Cod sursa(job #3286179)
Utilizator | Data | 13 martie 2025 19:47:36 | |
---|---|---|---|
Problema | Pairs | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("pairs.in");
ofstream fout ("pairs.out");
int f[1000001],v[1000001],x[1000001];
int main()
{
for (int i=2; i<=1000000; i++)
{
for (int j=i; j<=1000000; j+=i)
{
if (x[j]==1)
f[i]++;
}
}
int n;
fin>>n;
for (int i=1; i<=n; i++)
{
fin>>v[i];
x[v[i]]++;
}
return 0;
}