Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void obnulit(int mass[], int razmer) {
- for(int as = 0; as < razmer; as++) {
- mass[as] = 0;
- }
- }
- void sortmass(int povt[], int povt2[], char bukva[], char bukva2[] ) {
- int razmer = 0;
- while ( povt2[razmer] != 0 ) {
- razmer++;
- }
- int higher = 0;
- int ind = 0;
- int k = 0;
- for (int ak = 0; ak < razmer; ak++) {
- ind = 0;
- int f = 0;
- higher = 0;
- while(f < razmer) {
- if(povt2[f] > higher){
- higher = povt2[f];
- ind = f;
- }
- f++;
- }
- bukva2[ak] = bukva[ind];
- povt[ak] = povt2[ind];
- povt2[ind] = 0;
- }
- cout<<endl;
- for(int asd = 0; asd < razmer; asd++){
- if (bukva2[asd] != bukva2[asd-1] && bukva2[asd] != ' ') {
- cout<<bukva2[asd]<<" - "<<povt[asd];
- cout<<endl; }
- }
- }
- int main(){
- int razm = 100;
- char bukva3[razm];
- char stroka[razm];
- int povt[razm] = { };
- char bukva[razm];
- char bukva2[razm];
- int povt2[razm] = { };
- char alphabet[27] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
- cin.getline(stroka, razm);
- char k = ' ';
- int str = 0;
- while ( k != 0) {
- k = stroka[str];
- if ( k >= 'a' && k <= 'z') {
- stroka[str] -= 32;
- }
- str++;
- }
- int z = 0;
- int a = 0;
- int no = 0;
- while(stroka[z] != 0) {
- int j = 0;
- a = 0;
- while(stroka[j] != 0){
- if(stroka[z] == stroka [j]) {
- a++;
- povt[no] = a;
- bukva[no] = stroka[z];
- no++;
- }
- j++;
- }
- z++;
- }
- int op = 0;
- int nas = 0;
- while(bukva[op] != 0) {
- if(bukva[op] != bukva[op+1]) {
- bukva2[nas] = bukva[op];
- povt2[nas] = povt[op];
- nas++;
- }
- op++;
- }
- obnulit(povt, razm);
- sortmass(povt, povt2, bukva2, bukva3);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement