Pagini recente » Cod sursa (job #2246689) | Cod sursa (job #445419) | Cod sursa (job #1703947) | Cod sursa (job #1997442) | Cod sursa (job #918028)
Cod sursa(job #918028)
#include <iostream>
#include <fstream>
using namespace std;
int euclid (int a, int b)
{
if(b) return euclid(b, a%b);
return a;
}
int main()
{
ifstream fin ("pairs.in");
ofstream fout ("pairs.out");
int n, i, j, x, nr=0; fin>>n;
int m[100002];
for(i=1; i<=n; i++)
{
fin>>x;
for(j=1; j<i; j++)
if(euclid(m[j],x)==1) nr++;
else if (m[j]==x)
{
i--;
break;
}
m[i]=x;
}
fout<<nr;
return 0;
}