Advertisement
Guest User

Untitled

a guest
Dec 18th, 2018
62
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.16 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #include <iostream>
  3. #include <string>
  4. using namespace std;
  5. signed long long i, k, k2,k3, k4, k5, k6, suma;
  6. string s, s2, s3;
  7. int main(){
  8. cout<<"s="; getline(cin, s );
  9. cout<<"avem sirul="<<s<<endl;
  10. k=0; k2=0; k3=0; k4=0; k5=0; s3="ma";
  11. for(i=0;i<s.length(); i++){
  12. if((s[i]>='A') && (s[i]<='Z')) { k6++; if(s[i]=='A') k5++;}
  13. if((s[i]>='a') && (s[i]<='z')) {
  14. k++;
  15. if(s[i]=='a') k3++;
  16. if(s[i]=='u') k4++;}
  17. if((s[i]>='0') && (s[i]<='9')){ suma+=s[i]-48; k2++;};
  18. }
  19. if(k==0) cout<<"nu sunt litere mici in sir"<<endl;
  20. else cout<<"sunt "<<k<<" litere mici in sir"<<endl;
  21. if(k6==0) cout<<"nu sunt litere mari in sir"<<endl;
  22. else cout<<"sunt "<<k6<<" litere mari in sir"<<endl;
  23. if(k2==0) cout<<"nu sunt cifre in sir"<<endl;
  24. else cout<<"suma= "<<suma<<endl;
  25. //if(k==0);
  26. // else{
  27. if(k3==0) cout<<"nu este litera a in sir"<<endl;
  28. else cout<<"pozitia primei litere a="<<s.find('a')<<endl;
  29. if(k4==0) cout<<"nu este litera u in sir"<<endl;
  30. else cout<<"pozitia ultimei litere u="<<s.rfind('u')<<endl;
  31. if(s.rfind(s3)>300) cout<<"nu este silaba ma in sir"<<endl;
  32. else cout<<"ultima poz a silabei ma="<<s.rfind(s3)<<endl;
  33. //}
  34. i=0; k=0;
  35. while(i<s.length()){
  36. if(s[i]==' ') {s.erase(i,1); k++;}
  37. else i++;}
  38. i=0;
  39. while(i<s.length()){
  40. if((s[i]>='0')&&(s[i]<='9')) {s.erase(i,1); k++;}
  41. else i++;}
  42. if(k==0) cout<<"sirul nu a fost modificat"<<endl;
  43. else cout<<"sirul modificat:"<<endl;
  44. cout << s << endl;
  45. s2="lasm";
  46. if(k5==0) cout<<"nu este litera A in sir"<<endl;
  47. else{
  48. for(i=0; i<s.length(); i++)
  49. if(s[i]=='A') {s.insert(i,s2); i+=4;}
  50. cout<<"sirul cu carac inserat:"<<s<<endl; }
  51. return 0;
  52. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement