Pagini recente » Cod sursa (job #158314) | Cod sursa (job #384090) | Cod sursa (job #1640132) | Cod sursa (job #2130144) | Cod sursa (job #2352045)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
int ok(int a,int b)
{
while(a!=b)
if(a>b)
a-=b;
else
b-=a;
return a;
}
int main()
{
int n,ct=0,m[100000];
f>>n;
f>>m[0];
for(int i=1;i<n;i++)
{
f>>m[i];
if(ok(m[0],m[i])==1)
ct++;
}
for(int i=1;i<n-1;i++)
for(int j=i;j<n;j++)
if(ok(m[i],m[j])==1)
ct++;
g<<ct;
}