Cod sursa(job #110173)
| Utilizator |  cojocaru aurelian kojo |
Data | 25 noiembrie 2007 19:29:06 |
|---|---|---|---|
| Problema | Pairs | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.32 kb |
#include<fstream.h>
ifstream f("pairs.in");
ofstream g("pairs.out");
int x,a[100000],i,j,k;
int euclid(int p,int q)
{
while(q)
{int r=p%q;
p=q;
q=r;
}
return p;
}
int main()
{
f>>x;
for(i=1;i<=x;i++)
f>>a[i];
for(i=1;i<x;i++)
for(j=i+1;j<=x;j++)
if(euclid(a[i],a[j])==1)
k++;
g<<k;
return 0;
}