above,all ,above all good at good at good
at good at above all me this is
####
world hello ok
####

at good:3
hello ok:1

#include <iostream>
#include <cmath>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <climits>
#include <ctime>
#include <cstring>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
#include <map>
#include <set>
#define LL long long
#define Pr pair<int,int>
#define fread(ch) freopen(ch,"r",stdin)
#define fwrite(ch) freopen(ch,"w",stdout)
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9+7;
const double eps = 1e-8;
const int maxn = 11234;
map <string,int> mp;
char as[555];
char pre[555];
char now[555];
char tmp[555];
char str[555];
int ans;
bool Ischar(char ch)
{
return ('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z');
}
int sread(int &pos)
{
while(str[pos] && !Ischar(str[pos])) ++pos;
if(!str[pos]) return 0;
int p1 = 0;
while(str[pos] && Ischar(str[pos])) now[p1++] = str[pos++];
now[p1] = 0;
while(str[pos] && str[pos] == ' ') ++pos;
return (str[pos] && Ischar(str[pos]))? 1: -1;
}
int main()
{
while(gets(str))
{
mp.clear();
ans = -1;
while(str[0] != '#')
{
int pos = 0;
int p1,p2;
pre[1] = '.';
pre[2] = 0;
int k;
while((k = sread(pos)))
{
//                printf("%d ",pos);
//                printf("%s ",now);
//                printf("%d\n",k);
bool can = 1;
for(int i = 0; pre[i]; ++i)
{
if(!Ischar(pre[i]))
{
can = 0;
break;
}
}
if(can)
{
strcpy(tmp,pre);
int p1 = strlen(pre);
tmp[p1++] = ' ';
strcpy(tmp+p1,now);
mp[tmp]++;
if(ans < mp[tmp] || (ans == mp[tmp] && strcmp(as,tmp) > 0))
{
ans = mp[tmp];
strcpy(as,tmp);
}
}
if(k == 1) strcpy(pre,now);
else pre[0] = '.',pre[1] = 0;
}
gets(str);
}
printf("%s:%d\n",as,ans);
}
return 0;
}
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct list
{
int d;
char ch[2][501];
}a[12500];
int cmp(struct list x,struct list y)
{
if(x.d>y.d)
{
return 1;
}
else if(x.d==y.d&&(strcmp(x.ch[0],y.ch[0])<0||(strcmp(x.ch[0],y.ch[0])==0&&strcmp(x.ch[1],y.ch[1])<0)))
{
return 1;
}
else
{
return 0;
}
}
int main()
{
int i,i1,top=0;
char ch[501],s1[501],s2[501],flag;
while(gets(ch)!=NULL)
{
flag=0;
i1=0;
if(strcmp(ch,"####")==0)
{
sort(a,a+top,cmp);
printf("%s %s:%d\n",a[0].ch[0],a[0].ch[1],a[0].d);
top=0;
continue;
}
for(i=0;ch[i]!='\0';i++)
{
if(ch[i]==' '||ch[i]==','||ch[i]=='.')
{
if(flag==1&&i1!=0)
{
s2[i1]='\0';
for(i1=0;top>i1;i1++)
{
if(strcmp(a[i1].ch[0],s1)==0&&strcmp(a[i1].ch[1],s2)==0)
{
a[i1].d++;
break;
}
}
if(i1==top)
{
strcpy(a[i1].ch[0],s1);
strcpy(a[i1].ch[1],s2);
a[i1].d=1;
top++;
}
strcpy(s1,s2);
}
else if(flag==0&&i1!=0)
{
flag++;
s2[i1]='\0';
strcpy(s1,s2);
}
if(ch[i]==','||ch[i]=='.')
{
flag=0;
}
i1=0;
continue;
}
s2[i1]=ch[i];
i1++;
}
if(flag==1&&i1!=0)
{
s2[i1]='\0';
for(i1=0;top>i1;i1++)
{
if(strcmp(a[i1].ch[0],s1)==0&&strcmp(a[i1].ch[1],s2)==0)
{
a[i1].d++;
break;
}
}
if(i1==top)
{
strcpy(a[i1].ch[0],s1);
strcpy(a[i1].ch[1],s2);
a[i1].d=1;
top++;
}
strcpy(s1,s2);
}
}
return 0;
}