Pagini recente » Cod sursa (job #590905) | Cod sursa (job #2825260) | Cod sursa (job #777111) | Cod sursa (job #1820887) | Cod sursa (job #3266016)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("pairs.in");
ofstream fout("pairs.out");
int n, a[100005], i, fr[1005], ans, j;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
ans=n*(n-1)/2;
for(i=1; i<=n; i++)
{
int d=2;
vector <int> divi;
while(a[i]>1)
{
if(a[i]%d==0)
{
divi.push_back(d);
while(a[i]%d==0)
a[i]/=d;
}
d++;
if(d*d>a[i] && a[i]>1)
d=a[i];
}
for(auto j: divi)
{
ans-=fr[j];
fr[j]++;
}
}
fout<<ans;
return 0;
}