Pagini recente » Cod sursa (job #706305) | Cod sursa (job #163273) | Cod sursa (job #260382) | Cod sursa (job #3232333) | Cod sursa (job #3220256)
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int Vmax = 1000001;
int c, d;
bool bad[Vmax];
int cnt[Vmax];
int main(){
ifstream fin("mins.in");
ofstream fout("mins.out");
fin>>c>>d;
c--;
d--;
long long sol=1LL*c*d;
for(int k=2;k<=min(c, d);k++){
if(cnt[k]==0){
for(int j=k;j<=min(c, d);j+=k)
cnt[j]++;
/*for(int o=k*k;o<=min(c, d);o+=k*k){
bad[o]=1;
}*/
}
}
for(int k=2;k<=min(c, d);k++){
if(bad[k]) continue;
if(cnt[k]%2){
sol-=1LL*((c/k)*(d/k));
}
else
sol+=1LL*((c/k)*(d/k));
}
fout<<sol;
}