Cod sursa(job #1820175)
Utilizator | Data | 1 decembrie 2016 12:40:22 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
unsigned long M[1000000];
int main()
{
fstream f("pairs.in",ios::in),g("pairs.out",ios::out);
unsigned int n,i,j,nr=0,a,b,c;
f>>n;
for(i=0;i<n;i++)
f>>M[i];
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
a=M[i];
b=M[j];
c=a%b;
while(c)
{
a=b;
b=c;
c=a%b;
}
if(b==1)
nr++;
}
g<<nr;
return 0;
}