Pagini recente » Cod sursa (job #1775665) | Cod sursa (job #2274144) | Cod sursa (job #412212) | Cod sursa (job #206663) | Cod sursa (job #1664041)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("pascal.in");
ofstream g("pascal.out");
int c2,c3,c5;
int main()
{
long long n;
int d;
f>>n>>d;
vector <int> exp2(n+3,0);
vector <int> exp3(n+3,0);
vector <int> exp5(n+3,0);
for(int i=1;i<=n;i++)
{if(i%2==0)exp2[i]=1+exp2[i/2];
if(i%3==0)exp3[i]=1+exp3[i/3];
if(i%5==0)exp5[i]=1+exp5[i/5];
}
if(d==2)
{long long nr=0;
for(int i=1;i<n;i++)
{c2=c2+exp2[n-i+1]-exp2[i];
if(c2>=1) nr++;
}
g<<nr;
}
if(d==3)
{long long nr=0;
for(int i=1;i<n;i++)
{c3=c3+exp3[n-i+1]-exp3[i];
if(c3>=1) nr++;
}
g<<nr;
}
if(d==4)
{long long nr=0;
for(int i=1;i<n;i++)
{c2=c2+exp2[n-i+1]-exp2[i];
if(c2>=2) nr++;
}
g<<nr;
}
if(d==5)
{long long nr=0;
for(int i=1;i<n;i++)
{c5=c5+exp5[n-i+1]-exp5[i];
if(c5>=1) nr++;
}
g<<nr;
}
if(d==6)
{long long nr=0;
for(int i=1;i<n;i++)
{c2=c2+exp2[n-i+1]-exp2[i];
c3=c3+exp3[n-i+1]-exp3[i];
if(c2&&c3) nr++;
}
g<<nr;
}
return 0;
}