Cod sursa(job #109716)
Utilizator | Data | 25 noiembrie 2007 12:32:26 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 1, Clasele 11-12 | Marime | 0.35 kb |
#include<fstream.h>
ifstream f("pairs.in");
ofstream g("pairs.out");
long n,i,j,nr=0,v[10001];
long gcd(long a, long b)
{
if(b==0)
return a;
else
return gcd(b, a%b);
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(gcd(v[i],v[j])==1)
nr++;
g<<nr<<'\n';
f.close();
g.close();
return 0;
}