Pagini recente » Cod sursa (job #1014445) | Cod sursa (job #3280780) | Cod sursa (job #1156420) | Cod sursa (job #901413) | Cod sursa (job #3225533)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("mins.in");
ofstream cout("mins.out");
using ll = long long;
using pii = pair<int,int>;
const int nmax = 1e6 + 1;
ll n , m , siv[nmax];
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n >> m;
int mx = max(n,m);
for(int i = mx ; i >= 1 ; --i)
{
siv[i] = (n/i)*(m/i);
for(int j = i+i ; j <= mx ; j += i)
{
siv[i] -= siv[j];
}
}
cout << siv[1]/2 + 1;
return 0;
}