Pagini recente » Cod sursa (job #2485798) | Monitorul de evaluare | Cod sursa (job #1489328) | Profil PetreCatalin | Cod sursa (job #1878581)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("expozitie.in");
ofstream out("expozitie.out");
int lc[505][505],lp[505][505],n,d,k,exp[505];
int ad(int h)
{
int t=0,i;
for(i=1;i<=lc[h-1][0] || i<=lp[h][0] || t;++i,t/=10)
{
lc[h][i]=(t+=lp[h][i]+lc[h-1][i])%10;
}
lc[h][0]=i-1;
while(i>=0)
{
lp[h][i]=lc[h][i];
--i;
}
}
void addd(int i)
{
int t=0,j;
for(j=1;j<=lc[i][0] || j<=exp[0] || t;j++,t/=10)
exp[j]=(t+=lc[i][j]+exp[j])%10;
exp[0]=j-1;
}
int main()
{
in>>n>>d>>k;
if(n<d*k)out<<"0";
else
{
if(n==d*k)out<<"1";
else
{
for(int i=1;i<=d;++i)
{
lp[i][1]=1;
lp[i][0]=1;
lc[i][1]=1;
lc[i][0]=1;
}
n=n-d*k;
for(int i=2;i<=n;++i)
for(int j=1;j<=d;++j)ad(j);
for(int i=1;i<=d;++i)addd(i);
for(int i=exp[0];i>0;--i)out<<exp[i];
}
}
return 0;
}