Cod sursa(job #3279317)
| Utilizator | Data | 22 februarie 2025 15:15:59 | |
|---|---|---|---|
| Problema | Pairs | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
#define int long long
const int NMAX = 1e5 + 5;
int freq[NMAX], vmax, n, dp[NMAX];
signed main()
{
fin >> n;
for(int i = 1; i <= n; i ++)
{
int val;
fin >> val;
freq[val]++;
vmax = max(vmax, val);
}
for(int i = vmax; i >= 1; i--)
{
for(int j = i; j <= vmax; j += i)
dp[i] += freq[j];
dp[i] = dp[i] * (dp[i] - 1) / 2;
for(int j = 2 * i; j <= vmax; j += i)
dp[i] -= dp[j];
}
fout << dp[1];
return 0;
}
