Cod sursa(job #1045467)

Utilizator AndreiRSStatescu Andrei Rares AndreiRS Data 1 decembrie 2013 17:14:27
Problema A+B Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.32 kb
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define N_MAX 100
int main()
{
    freopen ("adunare.in", "r", stdin);
    freopen ("adunare.out", "w", stdout);

    int a, b;
    scanf ("%d%d", &a, &b);
    printf ("%d", a + b);

    return 0;

    int n[N_MAX][N_MAX],v[N_MAX][N_MAX],i,j,l,c,nr=0,k,iter; //n[N_MAX][N_MAX] ii prima matrice generata aleator,v[N_MAX][N_MAX] ii matricea dupa transformare
    srand(time(0)); //numerele introduse in matrice vor fi generate aleator
    scanf("%d%d%d",&l,&c,&iter);
    for(i=0;i<l;i++)
        for(j=0;j<c;j++)
            n[i][j]=rand()%2;   //numerele din matrice vor fi 1 pentru virus si 0 pentru casuta goala
    for(i=0;i<l;i++)
    {
        for(j=0;j<c;j++)
            printf("%d ",n[i][j]);  //afisarea matricei
        printf("\n");
    }
    for(k=0;k<iter;k++)
    {
        for(i=0;i<l;i++)
        {
            for(j=0;j<c;j++)
            {
                nr=0;

                if(i<l)
                    {if(n[i+1][j]==1)
                        nr++;}
                if(i>0)
                    {if(n[i-1][j]==1)
                        nr++;}
                if(j<c)
                    {if(n[i][j+1]==1)
                        nr++;}
                if(j>0)
                    {if(n[i][j-1]==1)
                        nr++;}
                if(i>0 && j>0)
                    {if(n[i-1][j-1]==1)
                        nr++;}
                if(i>0 && j<c)
                    {if(n[i-1][j+1]==1)
                        nr++;}
                if(i<l && j>0)
                    {if(n[i+1][j-1]==1)
                        nr++;}
                if(i<l && j<c)
                    {if(n[i+1][j+1]==1)
                        nr++;}


                if(nr==3 && n[i][j]==0)
                    v[i][j]=1;
                else if((nr==3 || nr==2) && n[i][j]==1)
                    v[i][j]=1;
                else v[i][j]=0;
            }
        }

        //ai construit noua matrice v, acum o afisezi si o pui la loc in matricea m ca sa o ai la pasul urmator

        printf("\n");
        for(i=0;i<l;i++)
        {
            for(j=0;j<c;j++)
            {
                printf("%d ",v[i][j]);
                n[i][j] = v[i][j];
            }
            printf("\n");
        }
    }
    return 0;
}