Pagini recente » Cod sursa (job #2442796) | Cod sursa (job #112200) | Cod sursa (job #2775453) | Cod sursa (job #2387388) | Cod sursa (job #2839102)
#include <bits/stdc++.h>
using namespace std;
ifstream in("mins.in");
ofstream out("mins.out");
typedef long long ll;
const ll lim=1e6+4;
bool ok[lim];
ll prod[lim];
ll cnt[lim];
ll c,d,el;
int main()
{
in>>c>>d; --c,--d;
if(c>d) swap(c,d);
for(ll i=1;i<=c;++i)
prod[i]=1;
for(ll i=2;i<=c;++i)
{
if(!ok[i])
{
for(ll j=i;j<=c;j+=i)
ok[j]=true,
prod[j]*=i,
++cnt[j];
}
if(prod[i]==i)
{
if(cnt[i]%2==1)
el+=(c/i)*(d/i);
else el-=(c/i)*(d/i);
}
}
out<<c*d-el<<'\n';
return 0;
}