تبدیل عدد به حروف

 

#include <iostream> using namespace std; int main() { int i = 0,a=0,b=0; char adad[13]; cin >> adad; for (; adad[i] != NULL; i++); for (int j = 0; j < i; j++) { if(adad[0]=='0') { cout<<"Sefr"; return 0; } if (((i - j - 1) % 3) == 0) { switch(adad[j]) { case '1': cout<<"Yek"; break; case '2': cout<<"Do"; break; case '3': cout<<"Seh"; break; case '4': cout<<"Chahar"; break; case '5': cout<<"Panj"; break; case '6': cout<<"Shesh"; break; case '7': cout<<"Haft"; break; case '8': cout<<"hasht"; break; case '9': cout<<"Noh"; break; } } else if (((i - j -1) % 3) == 1) { if (adad[j] == '0') { j++; switch (adad[j]) { case '1': cout << "Yek"; break; case '2': cout << "Do"; break; case '3': cout << "Seh"; break; case '4': cout << "Chahar"; break; case '5': cout << "Panj"; break; case '6': cout << "Shesh"; break; case '7': cout << "Haft"; break; case '8': cout << "hasht"; break; case '9': cout << "Noh"; break; } } else if (adad[j] == '1') { j++; switch (adad[j]) { case '1': cout << "Yazdah"; break; case '2': cout << "Davazdah"; break; case '3': cout << "Sizdah"; break; case '4': cout << "Chahardah"; break; case '5': cout << "Panzdah"; break; case '6': cout << "Shanzdah"; break; case '7': cout << "Hefdah"; break; case '8': cout << "hejdah"; break; case '9': cout << "Noozdah"; break; case '0': cout << "Dah"; break; } } else if (adad[j] > '1') { switch (adad[j]) { case '2': cout << "Bist"; break; case '3': cout << "Si"; break; case '4': cout << "Chehel"; break; case '5': cout << "Panjah"; break; case '6': cout << "Shast"; break; case '7': cout << "Haftad"; break; case '8': cout << "Hashtad"; break; case '9': cout << "Navad"; break; } } } else if (((i - j - 1) % 3) == 2) { if(adad[j]=='0'&&adad[j+1]=='0'&&adad[j]=='0') a=1; if(adad[j+1]=='0'&&adad[j+2]=='0') b=1; switch(adad[j]) { case '1': cout<<"Sad"; break; case '2': cout<<"Divist"; break; case '3': cout<<"Sisad"; break; case '4': cout<<"Chaharsad"; break; case '5': cout<<"Pansad"; break; case '6': cout<<"Sheshsad"; break; case '7': cout<<"Haftsad"; break; case '8': cout<<"hashtsad"; break; case '9': cout<<"Nohsad"; break; } } if((i-j)==4&&a==0) { if(adad[j+1]=='0'&&adad[j+2]=='0'&&adad[j+3]=='0') { cout<<" Hezar "; break; } else { cout<<" Hezar o "; continue; } } if((i-j)== 7&&a==0) { if(adad[j+1]=='0'&&adad[j+2]=='0'&&adad[j+3]=='0'&&adad[j+4]=='0'&&adad[j+5]=='0'&&adad[j+6]=='0') { cout<<" Million "; break; } else { cout<<" Million o "; continue; } } if((i-j)==10&&a==0) { if(adad[j+1]=='0'&&adad[j+2]=='0'&&adad[j+3]=='0'&&adad[j+4]=='0'&&adad[j+5]=='0'&&adad[j+6]=='0'&&adad[j+7]=='0'&&adad[j+8]=='0'&&adad[j+9]=='0') { cout<<" Milliard "; break; } else { cout<<" Milliard o "; continue; } } if(i-j-1>0&&adad[j]!='0'&&b==0) cout<<" o "; } return 0; }

پیامک بهینه

توضیح:

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

#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; }