Cod sursa(job #847543)

Utilizator CosminRusuCosmin Rusu CosminRusu Data 4 ianuarie 2013 09:59:41
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include<fstream>
using namespace std;
int a[21][21];
int viz[21][21];
int main()
{
    ifstream f("robinson.in");
    ofstream g("robinson.out");
    int m,n,l,c;
    
    f>>m>>n>>l>>c;
    int aux=n;
    for(int i=1; i<=m;i++)
    {
            a[1][i]=a[i][1]=aux;
            aux++;
            
    
    }
    
    
    for(int i=2;i<=m;i++)
    for(int j=2; j<=m; j++)
    {
    a[i][j]=(a[i-1][j]+a[i][j-1])%1000;
    
    }

g<<a[m][m]<<"\n"<<l<<" "<<c<<"\n";

    for(int i=l; i<=m;i++)
    for(int j=c; j<=m;j++)
    {
    
    
    if(a[i][j]%4==0 && a[i][j]!=1)
    {g<<i-1<<" "<<j<<"\n";
    viz[i-1][j]=1;
    }
    if(a[i][j]%4==1&& a[i][j]!=1)
    {
    g<<i<<" "<<j+1<<"\n";
    viz[i][j+1]=1;
    }
    if(a[i][j]%4==2&& a[i][j]!=1)
    {
    g<<i+1<<" "<<j<<"\n";
    viz[i+1][j]=1;
    }
    if(a[i][j]%4==3&& a[i][j]!=1)
    {
    g<<i<<" "<<j-1<<"\n";
    viz[i][j-1]=1;
    }
    }
          
    

return 0;
}