Pagini recente » Istoria paginii runda/5problemepanamaine | Cod sursa (job #2013401) | Cod sursa (job #701931) | Cod sursa (job #2828488) | Cod sursa (job #592829)
Cod sursa(job #592829)
# include <fstream>
using namespace std;
int i, j, c, d, phi1[200100], phi2[200100];
long long sol;
int main ()
{
ifstream f ("mins.in");
ofstream g ("mins.out");
f >> c >> d;
--c, --d;
if (c > d) c ^= d ^= c ^= d;
// c < d
// pentru c
for (i = 1; i <= c; ++i)
phi1[i] = i;
for (i = 1; i <= c; ++i)
if (phi1[i] == i)
for (j = i; j <= d; j += i)
phi1[i] -= phi1[i] / j;
// pentru d
for (i = 1; i <= d; ++i)
phi2[i] = i;
for (i = 1; i <= d; ++i)
if (phi2[i] == i)
for (j = i; j <= c; j += i)
phi2[i] -= phi2[i] / j;
for (i = 1; i <= c; ++i)
sol = (long long)(sol + phi1[i]);
for (i = 1; i <= d; ++i)
sol = (long long)(sol + phi2[i]);
g << sol << '\n';
g.close ();
return 0;
}