Cod sursa(job #1819751)
Utilizator | Data | 30 noiembrie 2016 19:44:00 | |
---|---|---|---|
Problema | Pairs | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
long long m[1000000];
int main()
{
fstream f("pairs.in", ios::in), g("pairs.out", ios::out);
int i, nr=0, j, a, b, r;
long long n;
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];
r=a%b;
while(r!=0)
{
a=b;
b=r;
r=a%b;
}
if(b==1)
nr++;
}
g<<nr;
return 0;
}