Cod sursa(job #18593)

Utilizator crawlerPuni Andrei Paul crawler Data 18 februarie 2007 12:44:43
Problema Amlei Scor 0
Compilator cpp Status done
Runda preONI 2007, Runda 2, Clasa a 9-a si gimnaziu Marime 1.39 kb
#include <stdio.h>

#define fin "amlei.in"
#define fout "amlei.out"

typedef unsigned long long lint;



int main()
 {
   freopen(fin,"r",stdin);
   freopen(fout,"w",stdout);


   int  n,t,u, i,j, tmp,x[64], y[64], a,b;
   char c;

   do
    {
     scanf("%i%i%i", &n,&t,&u);

     for(i=1;i<=n;++i)
      x[i] = y[i] = 0;


     for(i=1;i<=n;++i)
      {
       scanf("%i", &tmp);
       if(tmp>0)
        x[tmp]=0;
         else
        x[-tmp]=1;
      }

     for(i=1;i<t;++i)
      for(j=1;j<=n;++j)
       {
        scanf("%i", &tmp);
        if(tmp<0)
         {
          tmp=-tmp;
          a=1;
         }
          else
         a=0;
        
        if(x[tmp]!=a)
         x[tmp]=2;
       }

     for(i=1;i<=n;++i)
      {
       scanf("%i", &tmp);
       if(tmp>0)
        y[tmp]=0;
         else
        y[-tmp]=1;
      }

     for(i=1;i<u;++i)
      for(j=1;j<=n;++j)
       {
        scanf("%i", &tmp);
        if(tmp<0)
         {
          tmp=-tmp;
          a=1;
         }
          else
         a=0;
        
        if(y[tmp]!=a)
         y[tmp]=2;
       }

      a=1;
      for(i=1;i<=n;++i)
       if(x[i]!=y[i])
        {
         a=0;
         break;
        }

      if(a)
       printf("DA\n");
        else
       printf("NU\n");

      c=fgetc(stdin);

    } while(c!=EOF);
   


   return 0;
 }