Cod sursa(job #269603)
| Utilizator | Data | 3 martie 2009 09:08:38 | |
|---|---|---|---|
| Problema | Pairs | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
using namespace std
#include<fstream.h>
int main()
{unsigned long n,M[10000],aux1,aux2,i,j,r,k=0;
fstream f("pairs.in",ios::in);
f>>n;
for(i=0;i<n;i++)
f>>M[i];
f.close();
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(M[i]!=M[j])
{ aux1=M[i];
aux2=M[j];
while(aux2!=0)
{ r=aux1%aux2;
aux1=aux2;
aux2=r; }
if(aux1==1)
k++;}
fstream g("pairs.out",ios::out);
g<<k;
g.close();
return 0; }
