پیامک بهینه

توضیح:

توسط این برنامه شما می توانید بفهمید که برای فرستادن یک عبارت حداقل چه تعداد بار دکمه صفحه کلید موبایل خود را باید بزنید.

#include <iostream> using namespace std; int main() { int length,tedad,sum=0; char str[200]; cin>>tedad; int result[tedad]; for(int i=0;i<tedad;i++) result[i]=0; for(int i=0 ; i<tedad ; i++) { sum=0; cin>>length; for(int j=0 ; j<length ; j++) { cin>>str[j]; switch(str[j]) { case 'a': case 'd': case 'g': case 'j': case 'm': case 'p': case 't': case 'w': sum++; break; case 'b': case 'e': case 'h': case 'k': case 'n': case 'q': case 'u': case 'x': sum+=2; break; case 'c': case 'f': case 'i': case 'l': case 'o': case 'r': case 'v': case 'y': sum+=3; break; case 's': case 'z': sum+=4; break; case ' ': sum+=2; break; } if(str[j]=='a'||str[j]=='b'||str[j]=='c'&&str[j-1]=='a'||str[j-1]=='b'||str[j-1]=='c') sum++; if(str[j]=='d'||str[j]=='e'||str[j]=='f'&&str[j-1]=='d'||str[j-1]=='e'||str[j-1]=='f') sum++; if(str[j]=='g'||str[j]=='h'||str[j]=='i'&&str[j-1]=='g'||str[j-1]=='h'||str[j-1]=='i') sum++; if(str[j]=='j'||str[j]=='k'||str[j]=='l'&&str[j-1]=='j'||str[j-1]=='k'||str[j-1]=='l') sum++; if(str[j]=='m'||str[j]=='n'||str[j]=='o'&&str[j-1]=='m'||str[j-1]=='n'||str[j-1]=='o') sum++; if(str[j]=='p'||str[j]=='q'||str[j]=='r'||str[j]=='s'&&str[j-1]=='p'||str[j-1]=='q'||str[j-1]=='r'||str[j-1]=='s') sum++; if(str[j]=='t'||str[j]=='u'||str[j]=='v'&&str[j-1]=='t'||str[j-1]=='u'||str[j-1]=='v') sum++; if(str[j]=='w'||str[j]=='x'||str[j]=='y'||str[j]=='z'&&str[j-1]=='w'||str[j-1]=='x'||str[j-1]=='y'||str[j-1]=='z') sum++; } result[i]=sum; } for(int i=0; i<tedad; i++) cout<<result[i]<<endl; return 0; }

کد مقلوب اعدد گویا

#include <iostream> #include <cmath> using namespace std; double maghlob(double ); int main() { int n; cin>>n; double result[n]; for(int i=0; i<n; i++) cin>>result[i]; for(int i=0; i<n; i++) cout<<maghlob(result[i])<<endl; return 0; } double maghlob(double n) { int sum=0,d=1,ted_ashar=0,ted_sahih=0,temp; double ashar; if(n<0){ d*=-1; n*=-1; } while(n-(int)n!=0){ ted_ashar++; n*=10; } temp=(int)n; while(temp>0){ temp/=10; ted_sahih++; } temp=(int)n; for( ;temp>0;temp/=10) { sum=sum*10+temp%10; } if(ted_ashar==0) return sum; return (sum/pow(10,(ted_sahih-ted_ashar)))*d; }

بازی ایکس او (XO)

#include <iostream> using namespace std; char barande(char ,char ,char ,char ,char ,char ,char ,char ,char ); int main() { char xy[2], xy11=' ' , xy12=' ' , xy13=' ' , xy21=' ' , xy22=' ' , xy23=' ' , xy31=' ' , xy32=' ' , xy33=' ' ; for(int i=1; i<=9; i++) { cin>>xy[0]>>xy[1]; if(i%2==1) { if(xy[0]=='1'&&xy[1]=='1'&&xy11!='x'&&xy11!='o') xy11='o'; else if(xy[0]=='1'&&xy[1]=='2'&&xy12!='x'&&xy12!='o') xy12='o'; else if(xy[0]=='1'&&xy[1]=='3'&&xy13!='x'&&xy13!='o') xy13='o'; else if(xy[0]=='2'&&xy[1]=='1'&&xy21!='x'&&xy21!='o') xy21='o'; else if(xy[0]=='2'&&xy[1]=='2'&&xy22!='x'&&xy22!='o') xy22='o'; else if(xy[0]=='2'&&xy[1]=='3'&&xy23!='x'&&xy23!='o') xy23='o'; else if(xy[0]=='3'&&xy[1]=='1'&&xy31!='x'&&xy31!='o') xy31='o'; else if(xy[0]=='3'&&xy[1]=='2'&&xy32!='x'&&xy32!='o') xy32='o'; else if(xy[0]=='3'&&xy[1]=='3'&&xy33!='x'&&xy33!='o') xy33='o'; else i--; } else { if(xy[0]=='1'&&xy[1]=='1'&&xy11!='x'&&xy11!='o') xy11='x'; else if(xy[0]=='1'&&xy[1]=='2'&&xy12!='x'&&xy12!='o') xy12='x'; else if(xy[0]=='1'&&xy[1]=='3'&&xy13!='x'&&xy13!='o') xy13='x'; else if(xy[0]=='2'&&xy[1]=='1'&&xy21!='x'&&xy21!='o') xy21='x'; else if(xy[0]=='2'&&xy[1]=='2'&&xy22!='x'&&xy22!='o') xy22='x'; else if(xy[0]=='2'&&xy[1]=='3'&&xy23!='x'&&xy23!='o') xy23='x'; else if(xy[0]=='3'&&xy[1]=='1'&&xy31!='x'&&xy31!='o') xy31='x'; else if(xy[0]=='3'&&xy[1]=='2'&&xy32!='x'&&xy32!='o') xy32='x'; else if(xy[0]=='3'&&xy[1]=='3'&&xy33!='x'&&xy33!='o') xy33='x'; else i--; } cout<<"+---+---+---+"<<endl<<"| "<<xy11<<" | "<<xy12<<" | "<<xy13<<" | "<<endl; cout<<"+---+---+---+"<<endl<<"| "<<xy21<<" | "<<xy22<<" | "<<xy23<<" | "<<endl; cout<<"+---+---+---+"<<endl<<"| "<<xy31<<" | "<<xy32<<" | "<<xy33<<" | "<<endl; cout<<"+---+---+---+"<<endl; if(barande(xy11 ,xy12 ,xy13 ,xy21 ,xy22 ,xy23 ,xy31 ,xy32 ,xy33)=='x') { cout<<"X is winner"; return 0; } if(barande(xy11 ,xy12 ,xy13 ,xy21 ,xy22 ,xy23 ,xy31 ,xy32 ,xy33)=='o') { cout<<"O is winner"; return 0; } if(barande(xy11 ,xy12 ,xy13 ,xy21 ,xy22 ,xy23 ,xy31 ,xy32 ,xy33)=='n' &&xy11!=' '&&xy12!=' '&&xy13!=' ' &&xy21!=' '&&xy22!=' '&&xy23!=' ' &&xy31!=' '&&xy32!=' '&&xy33!=' ' ) { cout<<"No winner"; return 0; } } return 0; } char barande(char xy11,char xy12,char xy13,char xy21,char xy22,char xy23,char xy31,char xy32,char xy33) { //For X if(xy11=='x'&&xy21=='x'&&xy31=='x') return 'x'; if(xy12=='x'&&xy22=='x'&&xy32=='x') return 'x'; if(xy13=='x'&&xy23=='x'&&xy33=='x') return 'x'; if(xy11=='x'&&xy12=='x'&&xy13=='x') return 'x'; if(xy21=='x'&&xy22=='x'&&xy23=='x') return 'x'; if(xy31=='x'&&xy32=='x'&&xy33=='x') return 'x'; if(xy11=='x'&&xy22=='x'&&xy33=='x') return 'x'; if(xy13=='x'&&xy22=='x'&&xy31=='x') return 'x'; //For O if(xy11=='o'&&xy21=='o'&&xy31=='o') return 'o'; if(xy12=='o'&&xy22=='o'&&xy32=='o') return 'o'; if(xy13=='o'&&xy23=='o'&&xy33=='o') return 'o'; if(xy11=='o'&&xy12=='o'&&xy13=='o') return 'o'; if(xy21=='o'&&xy22=='o'&&xy23=='o') return 'o'; if(xy31=='o'&&xy32=='o'&&xy33=='o') return 'o'; if(xy11=='o'&&xy22=='o'&&xy33=='o') return 'o'; if(xy13=='o'&&xy22=='o'&&xy31=='o') return 'o'; //None of them return 'n'; }

رسم حروف با ستاره

رسم A

#include <iostream> using namespace std; int main() { int n,s=1; cin>>n; for(int i=1; i<=n; i++) { if(i==1) { for(int j=1; j<=n-i; j++) cout<<' '; cout<<'*'<<endl; continue; } for(int j=1; j<=n-i; j++) cout<<' '; cout<<'*'; if(i==n/2+1) { for(int j=1; j<=s+1; j++) cout<<'*'; cout<<endl; s+=2; continue; } for(int j=1 ; j<=s; j++) cout<<' '; cout<<'*'<<endl; s+=2; } return 0; }

رسم N

#include <iostream> using namespace std; int main() { int n,s1=0; cin>>n; for(int i=0; i<n; i++) if(i==0||i==(n-1)) { cout<<'*'; for(int j=0; j<n-2; j++) cout<<' '; cout<<'*'; cout<<endl; } else { cout<<'*'; for(int j=1; j<=s1; j++) cout<<' '; cout<<'*'; s1++; for(int k=1; k<=n-2-s1; k++) cout<<' '; cout<<'*'; cout<<endl; } return 0; }

رسمH

#include <iostream> using namespace std; int main() { int i=0,n; cin>>n; for(i=0; i<n; i++) { if(i==n/2) { for(int j=0; j<n+2; j++) cout<<'*'; cout<<endl; continue; } cout<<'*'; for(int j=0;j<n;j++) cout<<' '; cout<<'*'<<endl; } }

رسم شکل با ستاره

مثلث قائم الزاویه

#include <iostream> using namespace std; int main() { int n; cin>>n; cout<<endl; for(int i=1;i<=n;i++){ for(int j=1;j<=i;j++) cout<<'*'; cout<<endl; } return 0; }

رسم مثلث متساوی الاضلاع

#include <iostream> using namespace std; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=2*n+1;j++) if(j>=n-i+2&&j<=n+i) cout<<'*'; else cout<<' '; cout<<endl; } }

رسم لوزی

#include <iostream> #include <conio.h> using namespace std; void fasele(int n) { for(int i=1; i<=n; i++) cout<<" "; return; } int main() { int n; cout<<"Enter n\n"; cin>>n; int a=n,b=n-1,c=n-1; for(int i=1; i<=2*n-1; i+=2) { fasele(a); for(int j=1; j<=i; j++) cout<<"*"; fasele(c); cout<<endl; a--; } int d=2,e=1,f=1; for(int i=2*n-3; i>=1; i-=2) { fasele(d); for(int j=1; j<=i; j++) cout<<"*"; fasele(e); cout<<endl; d++; } return 0; }

تبدیل عدد در مبنای 10 به مبنای 2

#include <iostream> using namespace std; int makos(int n); int main() { int num,result=0,d=1,temp; cin>>num; temp=num; while(temp%2==0){ d*=10; temp/=10; } while(num>=2) { result=result*10+num%2; num/=2; } result=result*10+num; cout<<"Result is:"<<'\t'<<result*d; return 0; } int makos(int n) { int sum=0; while(n!=0) { sum=sum*10+n%10; n/=10; } return sum; }

تبدیل عدد در مبنای 2 به مبنای 10

 

#include <iostream> using namespace std; int main() { int num,result=0; cin>>num; for(int i=1;num>0;i*=2){ result=result+((num%10)*i); num/=10; } cout<<"Result is:"<<'\t'<<result; return 0; }

عوامل اول یک عدد با توان

 

#include <iostream> using namespace std; bool is_prime(int n); int main() { int num,temp; cin>>num; cout<<"Result is:"<<'\t'; for(int i=2; i<=num; i++) { temp=num; int exp=0; if(num%i==0) if(is_prime(i)){ cout<<i<<'*'; while(temp%i==0){ exp++; temp/=i; } cout<<exp<<'\t'; } } return 0; } bool is_prime(int n) { for(int i=2; i<n; i++) if(n%i==0) return false; return true; }