Pagini recente » Cod sursa (job #537958) | Cod sursa (job #3134084) | Cod sursa (job #3163441) | Cod sursa (job #1757458) | Cod sursa (job #2845615)
#include<iostream>
#include<fstream>
#define M 1000005
using namespace std;
long long i,c,d,nr_p, cnt[M];
/*void ciur(int ma)
{
for(int i=2;i<=ma;i++)
{
if(fr[i]==0)
for(int j=i;j<=ma;j+=i)
{
fr[j]=1;
}
}
}*/
int main()
{
freopen("mins.in","r",stdin);
freopen("mins.out","w",stdout);
cin>>c>>d;
c=c-1;
d=d-1;
//ciur(max(c, d));
for(int k=2;k<=M;k++)
{
nr_p -= (cnt[k]-1)*c/k*d/k;
for(int j=2*k; j<=M; j+=k)
{
cnt[j]-=(cnt[k]-1);
}
}
cout<<c*d-nr_p;
}