Pagini recente » Cod sursa (job #2066244) | Cod sursa (job #2946624) | Cod sursa (job #137512) | Cod sursa (job #1090227) | Cod sursa (job #2187703)
#include <fstream>
using namespace std;
ifstream f("mins.in");
ofstream g("mins.out");
int n,m,k,a[1000005],b[1000005];
long long sol;
void afisare()
{
g<<sol<<'\n';
}
void citire()
{
f>>n>>m;
--n;
--m;
k=min(n,m);
}
void rezolva()
{
int i,j;
sol=1LL*n*m;
for(i=2;i<=k;i++)
{
if(!a[i])
{
for(j=i;j<=n;j+=i)
{
++a[j];
}
if(1LL*i*i<=1LL*n)
{
for(j=i*i;j<=n;j+=i*i)
{
b[j]=1;
}
}
}
if(!b[i])
{
if(a[i]%2)sol-=1LL*(1LL*n/i)*(1LL*m/i);
else sol+=1LL*(1LL*n/i)*(1LL*m/i);
}
}
afisare();
}
int main()
{
citire();
rezolva();
return 0;
}