Cod sursa(job #2818730)
Utilizator | Ionut Birescu IonutB56 | Data | 16 decembrie 2021 19:25:52 |
---|---|---|---|
Problema | Pairs | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("pairs.in");
ofstream g("pairs.out");
long long n, a[101], x, y,i, c,j,viz[101];
int prim(long n, long m)
{
while (m != 0)
{
int r = n % m;
n = m;
m = r;
}
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++;
}
}
g << c / 2;
}