Problem Description
The Asian Games is coming soon. And SMU likes sports very much. But he must prepare for the postgraduate entrance examination. So he has just one day free. Of course, he wants to see matches as many as possible on that day. Thus he wants to know how many matches he can watch at most. But it is boring to arrange the schedule. You, who are good at programming, want to help him as SMU’s best friend.
Input
The first line contains an integer T which means the number of test cases.Each test case starts with a line containing one integer N(0
#include
int main()
{
int n,m,i,j,k,t,sum;
char ch[1001][2],st[1001][2];
scanf("%d",&n);
for(i=1;ist[j-1][0])
k++;
if(ch[j][0]=st[j-1][0])
{
if(ch[j][1]>st[j-1][1])
k++;
if(ch[j][1]=st[j-1][1])
{
t=(ch[j][3]-'0')*10+(ch[j][4]-'0');
sum=(st[j-1][3]-'0')*10+(st[j-1][4]-'0');
if(t>sum)
k++;
}
}
}
printf("Case %d: %d\n",i,k);
}
}
运行起来就有问题啊 哪个好心的大牛帮我改下 啊
|
