Cod sursa(job #145113)
Utilizator | Data | 28 februarie 2008 14:01:33 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream.h>
long n,m[100001];
int prim(int x,int y)
{while(x!=y)if(x>y)x=x-y;
else y=y-x;
return x;
}
int main()
{ifstream f("pairs.in");
int i,j,nr=0;
f>>n;for(i=1;i<n+1;i=i+1)f>>m[i];
f.close();
ofstream g("pairs.out");
for(i=1;i<n;i=i+1)
for(j=i;j<n+1;j=j+1)
if(prim(m[i],m[j])==1) nr++;
g<<nr;
g.close();
return 0;}