A masala Nabira va Bobo 👶👨🦳:
python da : Shamsiddin Qutlimuratov ning kodi eng mukammal deb topildi !
n,k,m,t,s=map(float,input().split())
bobo=(n+k)*m+n
ota=(n+k)+n
print(format(bobo,'.2f'),format(bobo/ota,'.2f'))C++ da: ❄️ ning codi eng mukamall deb topildi !
#include <bits/stdc++.h>
using namespace std;
#define int long double
signed main() {
int n, k, m, t, s;
cin >> n >> k >> m >> t >> s;
cout << fixed << setprecision(2) << m * (n + k) + n << ' ' << (m * (n + k) + n) / ((n + k + n) * 1.0l) << endl;
}
B masala Eng kuchli bo'luvchi :
python da : Samandar Ergashev ning kodi eng mukammal deb topildi !
n=int(input())
s=0
for i in range(1,int(n**0.5)+1):
if n%i==0:
s+=1
if i!=n//i:
s+=1
if n%s==0:
print(s)
else: print(-1)C++ da : Xaydaraliyev Jahonali ning kodi eng mukammal deb topildi !
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k = 0;
cin >> n;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) {
k++;
if (i * i < n) k++;
}
}
if (n % k == 0) cout << k;
else cout << -1;
return 0;
}
C masala Qor Momo 🧓❄:
python da : Otabek Aralov Abduxamitovich ning kodi eng mukammal deb topildi !
from itertools import combinations
def izla(A, B):
A.sort()
for b in B:
found = False
for r in range(1, len(A) + 1):
for combo in combinations(A, r):
if sum(combo) >= b:
for elem in combo:
A.remove(elem)
found = True
break
if found:
break
if not found:
return "Sovg'alar juda arzon 😠"
return len(A)
n=int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
print(izla(A, B))C++ da : Afsuski hech kim ishlay olmadi balki siz ishlarsiz ? ishlasangiz Admin ga yechimingizni yubring !
D masala Max Tub:
python da : Shamsiddin Qutlimuratov ning kodi eng mukammal deb topildi !
from math import gcd
def prime_factors(n):
s = set()
i = 2
while i * i <= n:
while n % i == 0:
s.add(i)
n //= i
i += 1
if n > 1:
s.add(n)
return s
def f(a, b):
return len(prime_factors(gcd(a, b)))
def m(a, b, x, y):
c1, c2 = f(a, b), f(x, y)
if c1 > c2:
return a, b
elif c2 > c1:
return x, y
elif a + b > x + y:
return a, b
elif x + y > a + b:
return x, y
else:
return min((a, b), (x, y))
a,b = map(int, input().split())
x,y = map(int, input().split())
r1,r2 = m(a, b, x, y)
print(r1,r2)C++ da : Shamsiddin Qutlimuratov ning kodi eng mukammal deb topildi !
#include<bits/stdc++.h>
using namespace std;
int count_factors(int n) {
set<int> factors;
while (n % 2 == 0) {
factors.insert(2);
n /= 2;
}
for (int i = 3; i * i <= n; i += 2) {
while (n % i == 0) {
factors.insert(i);
n /= i;
}
}
if (n > 2) {
factors.insert(n);
}
return factors.size();
}
int main(){
int a,b;
cin>>a>>b;
int x,y;
cin>>x>>y;
int cnt1=count_factors(gcd(a,b));
int cnt2=count_factors(gcd(x,y));
// cout<<cnt1<<' '<<cnt2<<endl;
if(cnt1>cnt2){
cout<<a<<' '<<b;
}
else if(cnt2 > cnt1){
cout<<x<<' '<<y;
}
else{
if(a+b>x+y){
cout<<a<<' '<<b;
}
else{
cout<<x<<' '<<y;
}
}
}
E masala Ifoda :
python da : Rahimberganov Musobek ning kodi eng mukammal deb topildi !
l,r=map(int,input().split())
s=input()
e=s
n=len(s)
p=''
d=''
for i in range(n):
if s[i]=='x':
k=i-1
while k>0 and s[k].isdigit():
k-=1
e=e.replace(s[k:i+1],'')
p+=s[k:i]+'1' if s[k:i] in '+-' else s[k:i]
g=0
try:
g+=eval(e)
except:
pass
h=0
try:
h+=eval(p)
except:
pass
print(max(l+1,r-1,key=lambda x:h*x+g))C++ da : Shamsiddin Qutlimuratov ning kodi eng mukammal deb topildi !
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r;
cin >> l >> r;
string s; cin >> s;
int a = 0, b = 0;
int k = 1;
int n = s.size();
for (int i = 0; i < n; i ++) {
char c = s[i];
if (c == '-' || c == '+') {
i ++;
if (s[i] == 'x') {
a += (c == '-' ? -1 : 1);
continue;
} else {
int d = 0;
while (s[i] != '+' && s[i] != '-' && s[i] != 'x') {
d *= 10; d += (s[i]-'0'); i ++;
if (i == n) break;
}
if (s[i] == 'x') {
a += (c == '-' ? -1 * d : d);
} else {
b += (c == '-' ? -1 * d : d);
i --;
}
continue;
}
} else {
if (s[i] == 'x') {
a += 1;
continue;
} else {
int d = 0;
while (s[i] != '+' && s[i] != '-' && s[i] != 'x') {
d *= 10; d += (s[i]-'0'); i ++;
if (i == n) break;
}
if (s[i] == 'x') {
a += d;
} else {
b += d;
i --;
}
continue;
}
}
}
if (a < 0) {
cout << l + 1 << endl;
} else {
cout << r - 1 << endl;
}
}
F masala So'ngi Savol :
bu savolda xatolik yuz bergan edi !
Asli yechilishi :
print(210)
G masala yana Geometriya :
python da :DoNo0425 ning kodi eng mukammal deb topildi !
n,k=map(int,input().split())
print(k+n,abs(n-k))C++ da : ❄️ ning kodi eng mukammal deb topildi !
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << n + k << ' ';
if (n - k > 0) cout << n - k << ' ';
if (k - n > 0) cout << k - n << endl;
}
H masala : Qonuniyat (very hard)
python da : Otabek Aralov Abduxamitovich ning kodi eng mukammal deb topildi !
n = int(input())
s=input()
s = s.rstrip('...').split(',')
if all('/' in x for x in s):
f = [x.split('/') for x in s]
f = [int(f[1]) for f in f]
if f[1] - f[0] == 1 and f[2] - f[1] == 1:
k = f"1/{f[0] + (n - 1)}"
print(k)
exit()
s = [int(x) for x in s]
if s[1] - s[0] == s[2] - s[1]:
d = s[1] - s[0]
k = s[0] + (n - 1) * d
print(k)
elif s[1] + s[0] == s[2]:
while len(s) < n:
s.append(s[-1] + s[-2])
print(s[n - 1])
elif s[1] * s[1] == s[2] * s[0]:
r = s[1] // s[0]
k = s[0] * (r ** (n - 1))
print(k)C++ da : ❄️ ning kodi eng mukammal deb topildi !
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
if (s == "1,2,3,4,5...") cout << n << endl;
else if (s == "1,2,4,8...") cout << (1 << (n-1)) << endl;
else if (s == "1,1,2,3,5,8...") cout << 55 << endl;
else if (s == "1/2,1/3,1/4...") {
cout << "1/" << n+1 << endl;
}
else if (s == "1,10,100...") {
cout << pow(10, n-1) << endl;
}
else if (n == 1) cout << 1 << endl;
else if (s[0] == '0') cout << n-1 << endl;
else if (s[0] == '2') cout << pow(2, n) << endl;
return 0;
}
Mana barcha masalalarda editoriallar qo'yilib chiqildi !
Qiynalaytgan masalalaringizni o'rganib chiqing ! va keyingi contestga tayyorlaning !
Siz ham shu qatorda turishni istasangiz ! ko'proq izlaning !
Contest yoqdi degan umiddaman ! :)
Telegram kanalimizga obuna bo'ling