Pagini recente » Cod sursa (job #2470202) | Cod sursa (job #2819535) | Cod sursa (job #372981) | Cod sursa (job #889453) | Cod sursa (job #18204)
Cod sursa(job #18204)
#include<stdio.h>
#define input "amlei.in"
#define output "amlei.out"
#define dim 501
#define infinit -32000
void citire();
void rezolva();
int n, u, t, a[dim], b[dim];
FILE *in, *out;
int main()
{
in = fopen (input, "r");
out = fopen (output, "w");
int i;
while(!feof(in))
{
citire();
rezolva();
for(i=0; i<=t+1; i++)
a[i]=0;
for(i=0; i<=u+1; i++)
b[i]=0;
}
return 0;
}
void citire()
{
int i, s, x, k=0;
fscanf(in, "%d%d%d", &n, &t, &u);
s = 0;
for(i=1; i<=n*t; i++)
{
fscanf(in, "%d", &x);
s+=x;
if(i%n==0)
{
a[++k] = s;
s = 0;
}
}
s = 0;
k = 0;
for(i=1; i<=n*u; i++)
{
fscanf(in, "%d", &x);
s+=x;
if(i%n==0)
{
b[++k]=s;
s = 0;
}
}
}
void rezolva()
{
int i, j, ind = 0;
for(i=1; i<=t; i++)
for(j=1; j<=u; j++)
if(a[i]==b[j] && a[i] != infinit && b[j] != infinit)
{
ind ++;
a[i] = infinit;
b[j] = infinit;
}
if(ind == n)
fprintf(out, "DA\n");
if(ind < n)
fprintf(out, "NU\n");
}