Pagini recente » Cod sursa (job #2887145) | Cod sursa (job #1960152) | Cod sursa (job #204949) | Cod sursa (job #1477519) | Cod sursa (job #2376084)
#include <fstream>
using namespace std;
long long int v[501][501];
int main()
{
ifstream fin("expozitie.in");
ofstream fout("expozitie.out");
int n,d,k,i,j;
fin>>n>>d>>k;
for (i=1;i<=d;i++)
v[i][0]=1;
if (d*k>n)
fout<<0;
else
{
n=n-(d*k);
for (j=1;j<=n;j++)
{
v[1][j]=1;
}
for (i=1;i<=d;i++)
{
for (j=1;j<=n;j++)
{
v[i][j]=v[i-1][j]+v[i][j-1];
}
}
fout<<v[d][n];
}
return 0;
}