Cod sursa(job #777186)
Utilizator | Data | 11 august 2012 13:23:09 | |
---|---|---|---|
Problema | Indep | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<fstream>
using namespace std;
ifstream f("indep.in");
ofstream g("indep.out");
int k,i,x,p,n,nr,d,a[501];
int gcd(int a,int b)
{if(b==0)
return a;
else
return gcd(b,a%b);
}
int main()
{f>>n;
for(i=1;i<=n;++i)
f>>a[i];
d[0][0][0]=d[0][0][1]=1;
for(i=1;i<=n;++i)
{i1=i%2;
i2=1-i1;
}