Algorithms UZ

// 860-misol phyton a,b = map(int,input().split()) print((b-a)+1) @JK_Programming

// 858-misol C++ #include <bits/stdc++.h> using namespace std; int main() { int n, x, k=0; cin>>n; double a[n]; for(int i=0; i<n; i++){ cin>>a[i]; } cin>>x; for(int i=0; i<n; i++){ if(a[i]==x) k++; } cout<<k<<endl; return 0; }

// 857-misol C++ #include <bits/stdc++.h> using namespace std; int main() { long long a,k,l,m=0; cin >> a; k=log(a)/log(10)+1; if(k==9) { while(a>0) { l=a%10; a=a/10; m=m+l; } if(m%2==1) { cout << "yes"; } else{ cout << "no"; } } else{ cout << "no"; } return 0; }

// 281-misol C++ #include <bits/stdc++.h> using namespace std; int main (){ int n, x, c = 0, max; cin >> n; int a[n], b[n]; for(int i = 0; i < n ; i++){ cin >> a[i]; } for(int i = 0; i < n; i++){ x = 0; for(int j = 0; j < n; j++){ if(a[i] == a[j]){ x++; } } b[c++] = x; } max = b[0]; for(int i = 1; i < c; i++){ if(b[i] > max){ max = b[i]; } } cout << n - max; return 0; }

// 609-misol C++ #include <bits/stdc++.h> using namespace std; int main() { int n,k; cin>> n>>k; if(k%n==0) { cout << "Yes"; } else{ cout << "No"; } return 0; }

// 61-misol C++ #include <bits/stdc++.h> using namespace std; int main () { long long n; cin>>n; cout << n*(2*n-1); return 0; }

// 62-misol C++ #include<iostream> using namespace std; int main() { long long n; cin>>n; cout<<(n*n+n+2)/2; }

if (a[3]!=0) { switch (a[3]) { case 0: cout<<""; break; case 1: cout<<"bir "; break; case 2: cout<<"ikki "; break; case 3: cout<<"uch "; break; case 4: cout<<"to'rt "; break; case 5: cout<<"besh "; break; case 6: cout<<"olti "; break; case 7: cout<<"yetti "; break; case 8: cout<<"sakkiz "; break; case 9: cout<<"to'qqiz "; break; default: cout<<"son xato! "; break; } } if (a[3]!=0 a[4]!=0 a[5]!=0)cout<<"ming "; if (a[2]!=0) { switch (a[2]) { case 0: cout<<""; break; case 1: cout<<"bir yuz "; break; case 2: cout<<"ikki yuz "; break; case 3: cout<<"uch yuz "; break; case 4: cout<<"to'rt yuz "; break; case 5: cout<<"besh yuz "; break; case 6: cout<<"olti yuz "; break; case 7: cout<<"yetti yuz "; break; case 8: cout<<"sakkiz yuz "; break; case 9: cout<<"to'qqiz yuz "; break; default: cout<<"son xato! "; break; } } if (a[1]!=0) { switch (a[1]) { case 0: cout<<""; break; case 1: cout<<"o'n "; break; case 2: cout<<"yigirma "; break; case 3: cout<<"o'ttiz "; break; case 4: cout<<"qirq "; break; case 5: cout<<"ellik "; break; case 6: cout<<"oltmish "; break; case 7: cout<<"yetmish "; break; case 8: cout<<"sakson "; break; case 9: cout<<"to'qson "; break; default: cout<<"son xato! "; break; } } if (a[0]!=0) { switch (a[0]) { case 0: cout<<""; break; case 1: cout<<"bir "; break; case 2: cout<<"ikki "; break; case 3: cout<<"uch "; break; case 4: cout<<"to'rt "; break; case 5: cout<<"besh "; break; case 6: cout<<"olti "; break; case 7: cout<<"yetti "; break; case 8: cout<<"sakkiz "; break; case 9: cout<<"to'qqiz "; break; default: cout<<"son xato! "; break; } } return 0; }

if (a[9]!=0 a[10]!=0 a[11]!=0)cout<<"milliard "; if (a[8]!=0) { switch (a[8]) { case 0: cout<<""; break; case 1: cout<<"bir yuz "; break; case 2: cout<<"ikki yuz "; break; case 3: cout<<"uch yuz "; break; case 4: cout<<"to'rt yuz "; break; case 5: cout<<"besh yuz "; break; case 6: cout<<"olti yuz "; break; case 7: cout<<"yetti yuz "; break; case 8: cout<<"sakkiz yuz "; break; case 9: cout<<"to'qqiz yuz "; break; default: cout<<"son xato! "; break; }} if (a[7]!=0) { switch (a[7]) { case 0: cout<<""; break; case 1: cout<<"o'n "; break; case 2: cout<<"yigirma "; break; case 3: cout<<"o'ttiz "; break; case 4: cout<<"qirq "; break; case 5: cout<<"ellik "; break; case 6: cout<<"oltmish "; break; case 7: cout<<"yetmish "; break; case 8: cout<<"sakson "; break; case 9: cout<<"to'qson "; break; default: cout<<"son xato! "; break; } } if (a[6]!=0) { switch (a[6]) { case 0: cout<<""; break; case 1: cout<<"bir "; break; case 2: cout<<"ikki "; break; case 3: cout<<"uch "; break; case 4: cout<<"to'rt "; break; case 5: cout<<"besh "; break; case 6: cout<<"olti "; break; case 7: cout<<"yetti "; break; case 8: cout<<"sakkiz "; break; case 9: cout<<"to'qqiz "; break; default: cout<<"son xato! "; break; } } if (a[6]!=0 a[7]!=0 a[8]!=0)cout<<"million "; if (a[5]!=0) { switch (a[5]) { case 0: cout<<""; break; case 1: cout<<"bir yuz "; break; case 2: cout<<"ikki yuz "; break; case 3: cout<<"uch yuz "; break; case 4: cout<<"to'rt yuz "; break; case 5: cout<<"besh yuz "; break; case 6: cout<<"olti yuz "; break; case 7: cout<<"yetti yuz "; break; case 8: cout<<"sakkiz yuz "; break; case 9: cout<<"to'qqiz yuz "; break; default: cout<<"son xato! "; break; } } if (a[4]!=0) { switch (a[4]) { case 0: cout<<""; break; case 1: cout<<"o'n "; break; case 2: cout<<"yigirma "; break; case 3: cout<<"o'ttiz "; break; case 4: cout<<"qirq "; break; case 5: cout<<"ellik "; break; case 6: cout<<"oltmish "; break; case 7: cout<<"yetmish "; break; case 8: cout<<"sakson "; break; case 9: cout<<"to'qson "; break; default: cout<<"son xato! "; break; } } Davomi...👇👇👇👇

if (a[10]!=0) { switch (a[10]) { case 0: cout<<""; break; case 1: cout<<"o'n "; break; case 2: cout<<"yigirma "; break; case 3: cout<<"o'ttiz "; break; case 4: cout<<"qirq "; break; case 5: cout<<"ellik "; break; case 6: cout<<"oltmish "; break; case 7: cout<<"yetmish "; break; case 8: cout<<"sakson "; break; case 9: cout<<"to'qson "; break; default: cout<<"son xato! "; break; } } if (a[9]!=0) { switch (a[9]) { case 0: cout<<""; break; case 1: cout<<"bir "; break; case 2: cout<<"ikki "; break; case 3: cout<<"uch "; break; case 4: cout<<"to'rt "; break; case 5: cout<<"besh "; break; case 6: cout<<"olti "; break; case 7: cout<<"yetti "; break; case 8: cout<<"sakkiz "; break; case 9: cout<<"to'qqiz "; break; default: cout<<"son xato! "; break; } } Davomi...👇👇👇👇

#include <iostream> using namespace std; int main() { long long n; cin>>n; int a[12]; for (int i=0; i<12; i++) { a[i]=0; } int x=0; while (n>0) { a[x]=n%10; a[x+1]=(n/10)%10; n=n/100; x=x+2; } if (a[11]!=0) { switch (a[11]) { case 0: cout<<""; break; case 1: cout<<"bir yuz "; break; case 2: cout<<"ikki yuz "; break; case 3: cout<<"uch yuz "; break; case 4: cout<<"to'rt yuz "; break; case 5: cout<<"besh yuz "; break; case 6: cout<<"olti yuz "; break; case 7: cout<<"yetti yuz "; break; case 8: cout<<"sakkiz yuz "; break; case 9: cout<<"to'qqiz yuz "; break; default: cout<<"son xato! "; break; } } Davomi....👇👇👇👇

// 611-misol PHYTON n=int(input()) print(n+2)

// 707-misol PHYTON a=input() print(a)

// 301-misol c++ #include <bits/stdc++.h> using namespace std; int main() { long long n,h=0; cin>>n; int a[n]; for(int i=0; i<n; i++) { cin>> a[i]; } for(int i=0; i<n-1; i++) { if(a[i]+1==a[i+1]) h++; } if(h+1==n) { cout << "YES"; } else{ cout <<"NO"; } return 0; }

// 520-misol c++ #include <iostream> using namespace std; int main() { long long n; cin>>n; cout << 1 << endl; return 0; }

// 17-misol c++ #include <iostream> using namespace std; int fff(int n) { int s=0, p; while (n>0) { p=n%10; s=s+p; n=n/10; } return s*s; } int main() { int n; cin>>n; int k=0; int i=1, h; while (k<n) { if(i%fff(i)==0) k++; h=i; i++; } cout<<h<<endl; return 0; }

Davomi....👇 if(b2>=b1) max=b1; else max=b2; if(b3<=max) max=b3; if(b4<=max) max=b4; if(b5<=max) max=b5; if(b6<=max) max=b6; if(b7<=max) max=b7; if(b8<=max) max=b8; cout<

// 18-misol C++ #include<iostream> #include<cmath> using namespace std; int main() { int a1,a2,a3,a4,a5,a6,a7,a8,a9; int b1,b2,b3,b4,b5,b6,b7,b8,b9,max; cin>>a1>>a2>>a3>>a4>>a5>>a6>>a7>>a8>>a9; b1=abs(a1-6)+abs(a2-1)+abs(a3-8)+abs(a4-7)+abs(a5-5)+abs(a6-3)+abs(a7-2)+abs(a8-9)+abs(a9-4); b2=abs(a1-6)+abs(a2-7)+abs(a3-2)+abs(a4-1)+abs(a5-5)+abs(a6-9)+abs(a7-8)+abs(a8-3)+abs(a9-4); b3=abs(a1-2)+abs(a2-9)+abs(a3-4)+abs(a4-7)+abs(a5-5)+abs(a6-3)+abs(a7-6)+abs(a8-1)+abs(a9-8); b4=abs(a1-2)+abs(a2-7)+abs(a3-6)+abs(a4-9)+abs(a5-5)+abs(a6-1)+abs(a7-4)+abs(a8-3)+abs(a9-8); b5=abs(a1-4)+abs(a2-3)+abs(a3-8)+abs(a4-9)+abs(a5-5)+abs(a6-1)+abs(a7-2)+abs(a8-7)+abs(a9-6); b6=abs(a1-4)+abs(a2-9)+abs(a3-2)+abs(a4-3)+abs(a5-5)+abs(a6-7)+abs(a7-8)+abs(a8-1)+abs(a9-6); b7=abs(a1-8)+abs(a2-1)+abs(a3-6)+abs(a4-3)+abs(a5-5)+abs(a6-7)+abs(a7-4)+abs(a8-9)+abs(a9-2); b8=abs(a1-8)+abs(a2-3)+abs(a3-4)+abs(a4-1)+abs(a5-5)+abs(a6-9)+abs(a7-6)+abs(a8-7)+abs(a9-2);

// 376-misol C++ #include<bits/stdc++.h> using namespace std; int main(){ long long n; cin>>n; switch(n) { case 1: case 2: case 12: cout<<"Winter";break; case 3: case 4: case 5: cout<<"Spring";break; case 6: case 7: case 8: cout<<"Summer";break; case 9: case 10: case 11: cout<<"Autumn"; break; default: cout<<"Error";break; } return 0; }

// 375-misol C++ #include <bits/stdc++.h> using namespace std; int main() { int n; cin>>n; int arr[n]; int mx=-1; for ( int i=0; i<n; i++) { cin>>arr[i]; if(arr[i]%2==0) { mx=max(mx,arr[i]); } } cout<<mx; return 0; }