Pagini recente » Borderou de evaluare (job #2483566) | Borderou de evaluare (job #2800187) | Borderou de evaluare (job #2800105) | Cod sursa (job #1394620) | Cod sursa (job #1882414)
#include <iostream>
#include <fstream>
using namespace std;
int n,v[100000],a,b,nr;
int main()
{
ifstream f("pairs.in");
ofstream g("pairs.out");
f>>n;
for (int i=1;i<=n;i++)
{
f>>v[i];
}
for (int i=1;i<=n-1;i++)
{
for (int j=i+1;j<=n;j++)
{
a=v[i];
b=v[j];
while (a!=b)
{
if (a>b) a=a-b;
else b=b-a;
}
if (a==1) nr++;
}
}
g<<nr;
return 0;
}