Pagini recente » Cod sursa (job #2101490) | Cod sursa (job #2881135) | Cod sursa (job #2370039) | Cod sursa (job #469668) | Cod sursa (job #565419)
Cod sursa(job #565419)
#include<iostream>
#include<fstream>
using namespace std;
int v[100000];
int main()
{
long long n,i,x,j,y,nr=0;
ifstream in("pairs.in");
ofstream out("pairs.out");
in>>n;
for (i=1;i<=n;++i)
in>>v[i];
for (i=1;i<=n;++i)
for (j=1;j<=n;++j)
if (v[i]!=v[j])
{
x=v[i];
y=v[j];
while (x!=y) {if (x>y) x=x-y; else y=y-x;}
if (x==1) nr++;
}
out<<nr/2;
return 0;
}