Pagini recente » Cod sursa (job #3250917) | Cod sursa (job #2928456) | Cod sursa (job #2876082) | Cod sursa (job #724520) | Cod sursa (job #2837221)
#include <bits/stdc++.h>
using namespace std;
ifstream in("mins.in");
ofstream out("mins.out");
typedef long long ll;
const ll lim=1e6+4;
bool ok[lim];
ll phi[lim];
ll ans=1;
ll c,d;
int main()
{
in>>c>>d; --c,--d;
if(c>d) swap(c,d);
for(ll i=1;i<=d;++i)
phi[i]=i;
for(ll i=2;i<=d;++i)
{
if(!ok[i]) for(ll j=i;j<=d;j+=i)
phi[j]=(phi[j]/i)*(i-1);
if(i<=c) ans+=2*phi[i];
else ans+=phi[i];
}
out<<ans<<'\n';
return 0;
}