Pagini recente » Cod sursa (job #1366678) | Cod sursa (job #2105318) | Cod sursa (job #1948729) | Cod sursa (job #2528329) | Cod sursa (job #2883064)
#include <fstream>
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int VMAX = 1e6;
int nrdp[1+VMAX], x, y;
long long rez;
int prime[VMAX], np;
void calcul_nrdp(int n)
{
for (int i = 2; i <= n; i++)
{
if (nrdp[i] == 0)
{
prime[np++] = i;
for (int multiplu = i; multiplu <= n; multiplu += i)
{
nrdp[multiplu]++;
}
}
}
for (int i = 0; i < np && (long long)prime[i] * prime[i] <= n; i++)
{
int patrat = prime[i] * prime[i];
for (int multiplu = patrat; multiplu <= n; multiplu += patrat)
{
nrdp[multiplu] = -1;
}
}
}
int main()
{
ifstream in("mins.in");
ofstream out("mins.out");
in >> x >> y;
int n = min(x-1, y-1);
calcul_nrdp(n);
rez = (long long)(x- 1) * (y - 1);
for (int i = 2; i <= n; i++)
{
if (nrdp[i] != -1)
{
long long nr_fractii_red = ((long long)(x - 1) / i) * ((long long)(y - 1) / i);
if (nrdp[i] % 2 == 0)
{
rez += nr_fractii_red;
}
else
{
rez -= nr_fractii_red;
}
}
}
out << rez;
in.close();
out.close();
return 0;
}