Pagini recente » Cod sursa (job #721964) | Cod sursa (job #112616) | Cod sursa (job #2269351) | Cod sursa (job #679812) | Cod sursa (job #981717)
Cod sursa(job #981717)
#include<stdio.h>
int v[1000002];
long long min(long long a,long long b)
{
return a<b?a:b;
}
int main()
{
freopen("mins.in","r",stdin);
freopen("mins.out","w",stdout);
long long n,m,i,j,s=0,max,p;
scanf("%lld%lld",&n,&m);
max=min(n,m)-1;
for(i=1;i<=max;++i)
{
if(v[i]==0)
{
for(j=i;j<=max;j+=i)
++v[j];
p=i*i;
for(j=p;j<=max;j+=p)
v[j]=-1;
}
else if(v[i]%2==0)
s+=(n-1)*(m-1);
else
s-=(n-1)*(m-1);
}
printf("%lld\n",s);
return 0;
}