Pagini recente » Monitorul de evaluare | Cod sursa (job #1494953) | Cod sursa (job #2531641) | Profil CiprianD. | Cod sursa (job #2147698)
#define DM 1000001
#define DN 12
#include <bitset>
#include <cstring>
#include <fstream>
#include <vector>
using namespace std;
ifstream fi ("mins.in");
ofstream fo ("mins.out");
bitset <DM> bs;
int a, b, d, aux, rez, mltm, smn;
long long sol;
vector <int> dv[DM];
int main()
{
//ciur
for (int i = 2; i*i < DM; ++i)
if (!bs[i])
{
dv[i].push_back(i);
for (int j = i*2; j < DM; j += i)
{
dv[j].push_back(i);
dv[j].shrink_to_fit();
bs[j] = 1;
}
}
fi >> a >> d;
--a;
--d;
if (a < d)
swap(a, d);
for (int i = 2; i <= d; ++i)
{
rez = 0;
b = i;
//pinex
mltm = (1 << dv[i].size()) - 1;
for (int j = 1; j <= mltm; ++j)
{
aux = 1;
smn = 0;
for (int k = 0; k < dv[i].size(); ++k)
if (j&(1 << k))
{
aux *= dv[i][k];
++smn;
}
if (smn&1)
rez += a/aux;
else
rez -= a/aux;
}
sol += a - rez;
}
fo << sol + a;
return 0;
}