Pagini recente » Cod sursa (job #1573118) | Cod sursa (job #952977) | Cod sursa (job #782415) | Cod sursa (job #1816146) | Cod sursa (job #1612675)
#include <fstream>
using namespace std;
ifstream fin("mins.in");
ofstream fout("mins.out");
typedef long long i64;
const int nmax= 1000000;
bool p[nmax+1];
int d[nmax+1];
int main( ) {
int n, m;
fin>>n>>m;
--n, --m;
for ( int i= 2; i<=max(n, m); ++i ) {
if ( d[i]==0 ) {
d[i]= 1;
for ( int j= i*2; j<=max(n, m); j+= i ) {
++d[j];
}
for ( i64 j= i*i; j<=max(n, m); j+= (i64)i*i ) {
p[j]= 1;
}
}
}
i64 sol= (i64)n*m;
for ( int i= 2; i<=max(n, m); ++i ) {
if ( p[i]==0 ) {
int sign= 1;
if ( d[i]%2==1 ) {
sign= -1;
}
sol= (i64)sol+(i64)((i64)n/i)*((i64)m/i)*sign;
}
}
fout<<sol<<"\n";
return 0;
}