Pagini recente » Cod sursa (job #1440580) | Cod sursa (job #265750) | Cod sursa (job #177570) | Cod sursa (job #128813) | Cod sursa (job #3246492)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("mins.in");
ofstream cout("mins.out");
vector<int> primiciur[1000001];
bool ciur[1000001];
int c,d,i;
long long rsp;
long long pinex(int lim,int elem)
{
long long ans = 0;
for(int mask = 1;mask<(1<<(primiciur[elem].size()));mask++)
{
long long p=1,nr=0;
for(int j=0;j<primiciur[elem].size();j++)
if(mask&(1<<j))
p = 1ll*p*primiciur[elem][j],nr++;
if(nr%2==0)
ans-=lim/p;
else
ans+=lim/p;
}
return lim-ans;
}
int main()
{
cin>>c>>d;
c--,d--;
if(c>d)
swap(c,d);
for(i=2; i<=d; i++)
{
if(!ciur[i])
{
primiciur[i].push_back(i);
for(int j=i*2; j<=d; j+=i)
{
primiciur[j].push_back(i);
ciur[j]=1;
}
}
}
for(i=1; i<=c; i++)
{
rsp+=pinex(d,i);
}
cout<<rsp;
return 0;
}