Cod sursa(job #18164)
Utilizator | Victor Popescu slayer4u | Data | 18 februarie 2007 10:17:23 |
---|---|---|---|
Problema | Amlei | Scor | 0 |
Compilator | cpp | Status | done |
Runda | preONI 2007, Runda 2, Clasa a 10-a | Marime | 0.44 kb |
#include<stdio.h>
long n,s[100001],ant,num,i,t,u;
char c;
int main()
{
freopen ("amlei.in","rt",stdin);
freopen ("amlei.out","wt",stdout);
c=1;
ant=1;
while (c!='\n')
{
scanf ("%d %d %d\n",&n,&t,&u);
if (n==0 && t==0 && u==0)
break;
for (i=1;i<=n*t;i++)
scanf("%d",&s[i]);
for (i=1;i<=n*u;i++)
scanf("%d",&s[i]);
num++;
n=t=u=0;
}
for (i=1;i<=num-1;i++)
printf("NU\n");
printf("DA\n");
return 0;
}