Algorithms UZ
Ir al canal en Telegram
Kanal egasi: @Bekzhanov_rasul “ Dunyoda ilmdan boshqa najot yoq va bolmagay. ” Imom Al-Buxoriy. Muhokama gruh: @Programmer_TK_Chat
Mostrar más202
Suscriptores
Sin datos24 horas
Sin datos7 días
Sin datos30 días
Archivo de publicaciones
// 474-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
for(int i=1; i<=n; i++)
{
n=n-2;
}
if(n%2==1)
{
cout<<"Ali";
}
else{
cout<<"G'ani";
}
return 0;
}
// 82-misol c++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
if(n%2==1)
{
cout<<"First player" ;
}
else{
cout<<"Second player";
}
return 0;
}
// 481-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,p,x,s=0,k=0,j;
cin>>n;
j=n;
x=log(n)*1./log(10)+1;
while(n>0)
{
p=n%10;
n=n/10;
s=s+pow(p,x);
k=k+p;
}
if(j==s)
{
cout<<k;
}
else{
cout<<j;
}
return 0;
}
// 229-misol Phyton
from math import *
a,b=map(int,input().split())
k=sqrt(a*b)
h=(a+b)/2
if(k>h):
print("<")
elif(k<h):
print(">")
else:
print("=")
// 753-misol phyton
from math import *
x,y=map(float,input().split())
f=(1/(x+2/(x*x)+3/(x*x*x))+exp(x*x+3*x))/(atan(x+y)+fabs(5+x)**2)-cos(y*y+(x*x)/2)**2
print(f'{f:.2f}')
// 480-misol golang
package main
import "fmt"
func main() {
var (
a, b int
)
fmt.Scan(&a, &b)
if (1932-a == a%100) && (1932-b == b%100) {
a = a%100 + (2022 - 1932)
b = b%100 + (2022 - 1932)
fmt.Println(a, b)
} else {
fmt.Println("NO")
}
}
// 369-misol c++
#include <bits/stdc++.h>
using namespace std;
long long int smallestNumber(int n)
{
if (n >= 0 && n <= 9)
return n;
stack<int> digits;
for (int i=9; i>=2 && n > 1; i--)
{
while (n % i == 0)
{
digits.push(i);
n = n / i;
}
}
if (n != 1)
return -1;
long long int k = 0;
while (!digits.empty())
{
k = k*10 + digits.top();
digits.pop();
}
return k;
}
int main()
{
int n ;
cin>>n;
cout << smallestNumber(n);
return 0;
}
// 484-misol c++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long m,ko,ok,p,s=0,y, k,z,l, v=0;
cin>>l>>m;
if(l==0||l>m)
{
cout<<-1;
}
else{
for(int n=m; n>=1; n--)
{
k=n ;
y=k;
do
{
s=0;
while(k>0)
{
p=k%10;
k=k/10;
s=s+p;
}
if(s==l)
{
v=1 ;
z=y ;
break ;
}
k=s;
} while(s>=10);
if (v==1)
{
cout<<z ;
break;
}
}}
return 0;
}
// 550-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,k,l=1,h;
cin>>n>>k;
if(n==k)
{
cout << 0;
}
else if(n>k)
{
h=n-k;
while(h>0)
{
h=h-10;
l++;
}
cout << l-1;
}
else{
h=k-n;
while(h>0)
{
h=h-10;
l++;
}
cout << l-1;
}
return 0;
}
// 613-misol c++
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
long long n;
cin>>n;
long long a[n];
for(int i=0; i<n; i++)
{
cin>>a[i];
}
sort(a,a+n);
cout << a[n-1] << " " << a[n-2] << " "<< a[n-3];
}
// 265-misol c++
#include <iostream>
#include <algorithm>
using namespace std;
// ekubni topish funksiyasi
int gcd(int a, int b) {
while(a and b) {
if(a>b)
a %= b;
else
b %= a;
}
return a+b;
}
int main() {
int n, m;
cin >>n>>m;
// cout<< "ekuk: " << (n*m)/gcd(n,m)<< endl;
cout << gcd(n,m)*(n*m)/gcd(n,m);
}
// 698-misol c++
#include <iostream>
#include <cmath>
using namespace std;
// convert3 funksiyasi berilgan 10lik sanoq siztemasidagi sonni 7lik sanoq siztemasiga o'tkazadi
long long convert3(int n) {
long long bin = 0;
int rem, i = 1;
while (n!=0) {
rem = n % 7;
n /= 7;
bin += rem * i;
i *= 10;
}
return bin;
}
// convert funksiyasini vazifasi berilgan 7lik sanoq sistemasidan 10likka o'tadi
int convert(long long n) {
int dec = 0, i = 0, rem;
while (n!=0) {
rem = n % 10;
n /= 10;
dec += rem * pow(7, i);
++i;
}
return dec;
}
int main() {
long long n,m,k;
cin >> n>>m;
k=convert(n)+convert(m) ;
cout << convert3(k);
}
#753-misol phytonda
from math import *
x,y=map(float,input().split())
f=(1/(x+2/(x*x)+3/(x*x*x))+exp(x*x+3*x))/(atan(x+y)+fabs(5+x)**2)-cos(y*y+(x*x)/2)**2
print(f'{f:.2f}')
// 722-misol C++
#include<bits/stdc++.h>
using namespace std;
long long int countValues(long long int x)
{
long long int count = 0, n = 1;
while (x != 0)
{
if (x%2 == 0)
count += n;
n *= 2;
x /= 2;
}
return count;
}
int main()
{
long long int x;
cin >> x;
cout << countValues(x);
return 0;
}
// 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";
}
// 278-misol python
n = int (input())
for i in range(1,n+1):
a2 = 4 + 3 * (2 ** i - 1) - 3
if a2 - n > 0:
print(int(a2-n))
break;
// 741-misol C++
#include<iostream>
#include<cmath>
using namespace std ;
void tic()
{
long long n ;
cin>>n ;
if (n==0||n==1||n==2||n==4||n==6||n==11||n==20||n==29)
{
cout<<0;
}
else
cout<<1 ;
}
int main()
{
long long n, t;
cin>>t ;
while(t--)
{
tic() ;
}
}
// 45-misol C++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,s=0;
cin >> n;
for ( int i=0; i<=n; i++)
{
s=s+i;
}
cout << s;
return 0;
}
// 44-misol c++
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
if(n%400==0||n%100!=0&&n%4==0)
{
cout << "Kabisa yili";
}
else{
cout << "Kabisa yili emas";
}
return 0;
}
// 43-misol c++
#include <iostream>
using namespace std;
int main()
{
long long a,b,h;
cin >> a >> b;
h=a;
a=b;
b=h;
cout << a << ' ' << b;
return 0;
}
