Pagini recente » Cod sursa (job #1657647) | Cod sursa (job #1867720) | Cod sursa (job #1133998) | Istoria paginii autumn-warmup-2007/solutii/runda-2 | Cod sursa (job #2426718)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
int cmmdc(int a,int b)
{
while(b!=0)
{
int r=a%b;
a=b;
b=r;
}
return a;
}
int v[100001];
int main()
{
int n,nrp=0;
f>>n;
f>>v[1];
for(int i=2;i<=n;i++)
{
f>>v[i];
for(int j=i-1;j>=1;j--)
if(cmmdc(v[i],v[j])==1)
nrp++;
}
g<<nrp;
return 0;
}