Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <cstring>
- #include <algorithm>
- using namespace std;
- ifstream f("masaretu.in");
- ofstream g("masaretu.out");
- int cerinta,a[10000],v[10000];
- char s[10];
- int main()
- {
- f>>cerinta;
- if(cerinta==1)
- {
- int sol=0;
- while(f>>s)
- {
- int n=strlen(s);
- if(n==8)sol++;
- }
- g<<sol<<'\n';
- }
- else
- {
- while(f>>s)
- {
- int n=strlen(s);
- if(n==8)
- {
- for(int i=0;i<8;i+=2)
- {
- int val=(s[i]-'a'+1)*100+(s[i+1]-'a'+1);
- a[val]++;
- }
- }
- }
- int Max=0,nr=0;
- for(int i=1;i<=3000;i++)
- {
- if(a[i]>Max)
- {
- nr=1;
- v[nr]=i;
- Max=a[i];
- }
- else if(Max==a[i])
- {
- v[++nr]=i;
- }
- }
- sort(v+1,v+nr+1);
- for(int i=1;i<=nr;i++)
- {
- int x=v[i]%100;
- int y=v[i]/100;
- g<<(char)(y+'a'-1)<<(char)(x+'a'-1)<<" ";
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement