Cod sursa(job #2816677)
Utilizator | Ionut Birescu IonutB56 | Data | 11 decembrie 2021 21:03:29 |
---|---|---|---|
Problema | Pairs | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
long n, a[101], x, y,i, c,j;
int prim(int n, int m)
{
while (n != m)
if (n > m)
n = n - m;
else
m = m - n;
return n;
}
int main()
{
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
if (a[i] != a[j] && prim(a[i], a[j]) == 1)
c++;
}
cout << c / 2;
}