#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int t,t1,t2,t3,att,ct[3],i,s,g;
long double res;
//freopen("G.txt","r",stdin);
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%d%d%d%d%d%d%d",&t1,&t2,&t3,&att,&ct[0],&ct[1],&ct[2]);
sort(ct,ct+3);
res=(ct[1]+ct[2])/2+t1+t2+t3+att;
s=res/10;
switch(s)
{
case 10:
case 9:
g=65;break;
case 8:
g=66;break;
case 7:
g=67;break;
case 6:
g=68;break;
default:
g=70;
}
printf("Case %d: %c\n",i,g);
}
return 0;
}
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.