Cod sursa(job #421350)
Utilizator | Data | 21 martie 2010 13:28:06 | |
---|---|---|---|
Problema | Copii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2010, Runda 4, Clasele 9-10 | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream fin("copii.in");
ofstream fout("copii.out");
int a[100][100],n,i,j,x[100],o,k,sw2,z,d,disc[100],K[100],sw,v[100];
int main()
{fin>>n;
for(i=1;i<=n;i++)
{fin>>k;j=n;
while(k>o){a[i][j]=k%10;k/=10;j--;}
}
if(n==2) fout<<1;
fin.close();
fout.close();
return 0;
}