#include <stdio.h>
#include <stdlib.h>
int main()
{
int i,T;
scanf("%d",&T);
for(i=1; i<=T; i++)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a<=20 && b<=20 && c<=20)
{
printf("Case %d: good\n",i);
}
else
{
printf("Case %d: bad\n",i);
}
}
}
Category Ad-hoc
UVa – 11936 – The Lazy Lumberjacks
#include <stdio.h>
#include <stdlib.h>
int main()
{
int i,t;
scanf("%d",&t);
for(i=0; i<t; i++)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a+b>c)
{
printf("OK\n");
}
else
{
printf("Wrong!!\n");
}
}
return 0;
}
UVa – 11934 – Magic Formula
#include <stdio.h>
#include <stdlib.h>
int main()
{
long long int a,b,c,d,L,i,r,counter;
for(;;)
{
scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&L);
if(a==0 && b==0 && c==0 && d==0 && L==0)
{
break;
}
counter=0;
for(i=0; i<=L; i++)
{
r=(a*i*i)+(b*i)+c;
if(r%d==0)
{
counter++;
}
}
printf("%lld\n",counter);
}
return 0;
}
UVa – 11877 – The Coco-Cola Store
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,s,i,sum,a,p,rm;
while((scanf("%d",&n))!=EOF)
{
if(n==0)
{
break;
}
s=n/3;
rm=n%3;
p=rm+s;
sum=s;
if(p==2)
{
p=3;
}
for(i=3; i<=p; )
{
a=p/i;
rm=p%i;
p=rm+a;
if(p==2)
{
p=3;
}
sum=sum+a;
}
printf("%d\n",sum);
}
return 0;
}
UVa – 11723 – Numbering Roads
#include <stdio.h>
#include <stdlib.h>
int main()
{
int N,R,D,b,c,i;
for(i=1;; i++)
{
scanf("%d %d",&R,&N);
if(R==0 && N==0)
{
break;
}
D=(R-N)/N;
b=(R-N)%N;
c=(N*26)+N;
if(c<R)
{
printf("Case %d: impossible\n",i);
}
else if(N<R)
{
if(b==0)
{
printf("Case %d: %d\n",i,D);
}
else if(b<=N)
{
D++;
printf("Case %d: %d\n",i,D);
}
}
else if(N>R)
{
D=0;
printf("Case %d: %d\n",i,D);
}
}
return 0;
}