Pagini recente » Cod sursa (job #1116986) | Clasament Winter Challenge 2008, runda 2 | Borderou de evaluare (job #1896317) | Cod sursa (job #2383003) | Cod sursa (job #2151707)
#include <fstream>
using namespace std;
ifstream f ("mins.in");
ofstream g ("mins.out");
const int nmax=1e6+103;
int a,b,p,t,v[nmax],sol;
int main()
{
f>>a>>b;
t=max(a,b);
for(int i=1;i<=t;++i) v[i]=i-1;
for(int i=2;i<=t;i+=2) --v[i];
for(int i=3;i<=t;i+=2)
{
for(int j=i+i;j<=t;j+=i) v[j]-=v[i];
}
p=min(a,b);
v[1]=1;
for(int i=1;i<=p;++i) sol=sol+2*v[i];
for(int i=p+1;i<=t;++i) sol+=v[i];
g<<sol-1;
return 0;
}