Cod sursa(job #2449918)
Utilizator | Adrian Ariotn RadianEleven | Data | 21 august 2019 10:25:03 |
---|---|---|---|
Problema | Mins | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.78 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("mins.in");
ofstream g ("mins.out");
int vek[1000001];
int m,n;
int main()
{
f>>m>>n;
long long nonc=0;
if(n>m) swap(m,n);
for(int i=2;i<n;++i)
{
int px=0, py=0,j;
if(vek[i]==0){
for(j=2*i;j<m;j+=i)
{
vek[j]++;
px++;
}
for(j=2*i;j<n;j+=i)
{
py++;
}
if(vek[i]%2==0)
{
//g<<i<<"->"<<px<<"x "<<py<<"y \n";
nonc+=1ll*(py+1)*(px+1);
} else nonc-=1ll*(py+1)*(px+1);
}
}
g<<1LL*(m-1)*(n-1)-1ll*nonc;
return 0;
}