Pagini recente » Cod sursa (job #2074026) | Cod sursa (job #848947) | Cod sursa (job #629543) | Cod sursa (job #1732380) | Cod sursa (job #2451238)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("mins.in");
ofstream g ("mins.out");
long long vek[1000001];
bool ispp[1000002];
long long m,n,i,j;
int main()
{
f>>m>>n;
m--;
n--;
long long s=m*n;
int mnn=min(m,n);
for(i=2;i<=n;++i)
{
// cout<<"u";
if(vek[i]==0){
for(j=i;j<= mnn;j+=i)
{
// cout<<"v";
vek[j]++;
}
long long pp=1ll*i*i;
for(j=pp;j<= mnn;j+=pp)
ispp[j]=true;
}
if(!ispp[i])
{
if(vek[i]%2==1) s-=1LL*((m/i)*(n/i));
else s+=1LL*((m/i)*(n/i));
}
}
g<<s;
return 0;
}