Algorithms UZ
Open in Telegram
Kanal egasi: @Bekzhanov_rasul ā Dunyoda ilmdan boshqa najot yoq va bolmagay. ā Imom Al-Buxoriy. Muhokama gruh: @Programmer_TK_Chat
Show more202
Subscribers
No data24 hours
No data7 days
No data30 days
Posts Archive
// 384-misol Py
from math import *
n=int(input())
k=n%100
h=n//100
g=k%20
j=k//20
f=g%10
b=g//10
a=f%5
q=f//5
print(h+j+b+q+a)
// 530-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
cout << "=";
return 0;
}
// 59-misol C++
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
long long a,b;
cin >> a ;
b=a*a;
cout << b ;
}
// 445-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
cout<<n;
}
// 374-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,r,m,n,d;
cin>>a>>b>>c;
k=max(a,b);
r=max(k,c);
m=min(a,b);
n=min(m,c);
d=r-n;
cout<<d;
}
// 0626 misol C++
#include <bits/stdc++.h>
using namespace std;
int main() {
char c[64];
for(int i=0; i<64; i++) {
cin>>c[i];
}
for(int i=0; i<64; i++) {
if((i-1)%8==0&&c[i]=='1'&&c[i-7]=='0'&&c[i-14]=='*') {
cout<<"Yes";
return 0;
}
if(i%8==0&&c[i]=='1'&&c[i-9]=='0'&&c[i-18]=='*') {
cout<<"Yes";
return 0;
}
if((i-1)%8!=0&&i%8!=0&&c[i]=='1'&&c[i-9]=='0'&&c[i-18]=='*'||(i-1)%8!=0&&i%8!=0&&c[i]=='1'&&c[i-7]=='0'&&c[i-14]=='*') {
cout<<"Yes";
return 0;
}
}
cout<<"No";
}
// 50-misol C++
#include<iostream>
using namespace std;
int main()
{
int T,n,m;
cin>>T;
for(int i=1;i<=T; i++)
{
cin>>n>>m;
if(n*(n+1)/2==m)
cout<<1;
else cout<<0;
}
return 0;
}
// 71-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,k;
cin>>n;
k=n/2+1;
cout<<k;
return 0;
}
// 612-misol C++
#include<iostream>
using namespace std;
int main(){
int k,l;
char a,b;
cin >> a >>b;
k=a; l=b;
cout << (k-64)+(l-64);
}
// 230-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a;
cin >> a;
if(a%4==0)
cout << "Yes";
else{
cout << "No";
}
}
// 806-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,h=1,l;
cin >> a>> b;
while(a!=b)
{
h++;
l=a;
a=min(a,b);
b=abs(l-b);
}
cout <<h;
}
// 812-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
int h;
char a[7];
for(int i=0; i<7; i++)
{
cin >>a[i];
}v
cout << a[6]%2;
return 0;
}
Robocontest.uz saytidan birorta misolda savollaringiz bƶlsa Muhokama guruhda qoldiring .
Javob berishga harakat qilamiz
Masalani yechimini chiqarishni emas
uni ishlanish usulini o'ylab kurish kerak....
Muhimi matematika va fikrlay olish bo'lsa bas
// 855-misol Phyton
from math import *
n=int(input())
if (n % 2) == 0:
print(n//2)
else:
j=(-n)//2
print(j)
// 859-misol C++
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int n,a,m,k=0,h=0;
cin>>n >> a >> m;
if(m%2==1)
{
while(k<m)
{
k++;
if(k%2==1)
{
n=n*2;
}
else{
n= n+a;
}
}
}
else{
while(h<m)
{ h++;
if(h%2==0)
{ n=n*2; }
else{
n= n+a;
} } }
cout << n;}
// 467-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,m,k;
cin>>n>>m;
k=m*0.5+1+n;
if(m%2!=0)
{
cout<<"-1";
}
else{
cout<<k;
}
return 0;
}
// 113-misol C++
#include <iostream>
#include<math.h>
using namespace std;
int main()
{
int n,m,s,l;
cin>>n;
if(n<38)
{
cout<<n;
}
else{
s=n/5;
l=(s+1)*5-n;
if(l+1<=3)
{
cout<<(s+1)*5;
}
else{
cout<<n;
}
}
return 0;
}
// 789-misol phyton
from math import *
n=int(input())
if(n<5):
print(0)
else:
print(1)
