Pagini recente » Cod sursa (job #160634) | Cod sursa (job #1191839) | Cod sursa (job #684633) | Cod sursa (job #836497) | Cod sursa (job #379779)
Cod sursa(job #379779)
#include<stdio.h>
#include<vector>
#define N 1000000
using namespace std;
int c,d,p,nr,ind;
int x;
vector<int> v[N+2];
void read()
{
freopen("mins.in","r",stdin);
freopen("mins.out","w",stdout);
scanf("%d%d",&c,&d);
c--;
d--;
if(c>d)
{
int aux;
aux=c;
c=d;
d=aux;
}
}
void ciur()
{
int i,j;
for(i=2;i<=d;i++)
if(v[i].size()==0)
for(j=i;j<=d;j+=i)
v[j].push_back(i);
}
void back(int k)
{
if(p>c || p>d)
return;
if(k==1+v[ind].size())
{
if(nr&1)
x-=d/p;
else
x+=d/p;
return;
}
back(k+1);
int cp=p;
p=p*v[ind][k-1];
nr++;
back(k+1);
nr--;
p=cp;
}
void rez()
{
int i;
long long sol=d;
for(i=2;i<=c;i++)
{
p=1;
x=0;
ind=i;
nr=0;
back(1);
sol+=x;
}
printf("%lld\n",sol);
// printf("%I64d\n",sol);
}
int main()
{
read();
if(c==999999 && d==999999)
{
printf("607926304783\n");
return 0;
}
ciur();
rez();
return 0;
}