Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- #include <cstring>
- #include <cstdlib>
- #include <vector>
- using namespace std;
- char s[1024];
- int mas[400];
- char curr;
- vector<char> v;
- void solve()
- {
- int g;
- cin.getline(s, 1024, '.');
- int len = strlen(s);
- for(int i=0; i<len; )
- {
- curr = s[i];
- if(s[i]>='a' && s[i]<='z')
- {
- g = i;
- while(g < len)
- {
- bool visited = true;
- if(s[g]>='a' && s[g]<='z' && curr == s[g])
- {
- int vLen = v.size();
- for(int q = 0; q<vLen; q++)
- {
- if(v[q] == s[i] && visited)
- {
- visited = false;
- break;
- }
- }
- if(visited)
- {
- ++mas[s[g]];
- }
- g++;
- }
- else
- {
- v.push_back(s[i]);
- i = g;
- break;
- }
- visited = true;
- }
- }
- i++;
- }
- int maxi = *max_element(mas, mas+256);
- int mini;
- int mi = 9999;
- for(int i=0; i<256; i++)
- {
- if(mas[i] < mi && mas[i])
- {
- mi = mas[i];
- }
- }
- for(int i=0; i<256; i++)
- {
- if(maxi == mas[i])
- {
- cout << maxi << ' ' << (char)i << endl;
- break;
- }
- }
- for(int j=0; j<len; j++)
- {
- if(s[j]>='a' && s[j]<='z')
- {
- char c = s[j];
- if(mi == mas[c])
- {
- cout << mi << ' ' << (char)c << endl;
- return;
- }
- }
- }
- }
- int main ()
- {
- solve();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement