Cod sursa(job #712304)
Utilizator | Data | 13 martie 2012 11:59:47 | |
---|---|---|---|
Problema | Amlei | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.76 kb |
#include<cstdio>
int a,n,t,u,i,j,l,c[51],d[501][51],r,x,y,k,o,z[501],s,h,v[105],e;
int main()
{FILE *f=fopen("amlei.in","r"),*g=fopen("amlei.out","w");
while(!feof(f))
{fscanf(f,"%d%d%d",&n,&t,&u);
for(s=l=0,h=o=i=1;o<=t;i++)
{fscanf(f,"%d",&c[i]),s+=c[i];
if(i%n==0)
{for(j=1;j<=n;j++)
v[n+c[j]]++;
for(e=j=0;j<=2*n;j++)
{for(k=0;k<v[j];k++)
c[++e]=j-n;
v[j]=0;}
for(y=k=1;k<=l&&y;k++)
if(s==z[k])
{for(r=j=1;j<=n;j++)
if(d[k][j]!=c[j])
r=0;
if(r)
y=0;}
if(y)
for(z[++l]=s,j=1;j<=n;j++)
d[l][j]=c[j];
o++,s=i=0;}}
for(s=0,o=i=1;o<=u;i++)
{fscanf(f,"%d",&c[i]),s+=c[i];
if(i%n==0)
{for(j=1;j<=n;j++)
v[n+c[j]]++;
for(e=j=0;j<=2*n;j++)
{for(k=0;k<v[j];k++)
c[++e]=j-n;
v[j]=0;}
for(y=k=1;k<=l&&y;k++)
if(s==z[k])
{for(a=j=1;j<=n&&a;j++)
if(d[k][j]!=c[j])
a=0;
if(a)
y=0;}
if(y)
h=0;
o++,s=i=0;}}
if(feof(f))
break;
fprintf(g,"%s\n",h?"DA":"NU");}
return 0;}