Pagini recente » Cod sursa (job #1611962) | Cod sursa (job #2273362) | Cod sursa (job #2802630) | Cod sursa (job #2589702) | Cod sursa (job #2323299)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("expozitie.in");
ofstream fout("expozitie.out");
long long n,d,k,i,j,t,aux,sol;
int c[501][20000];
int main(){
fin>>n>>d>>k;
n-=d*k;
sol=1;
cout<<n;
if(n<0){
fout<<0;
return 0;
}
///combinari de d luate cate n-d*k
c[0][0]=1; c[0][1]=1;
for(i=1;i<=d+n-1;i++){
for(j=i;j>=1;j--){
c[j][0]=max(c[j][0],c[j-1][0]);
t=0;
for(k=1;k<=c[j][0];k++){
c[j][k]+=c[j-1][k]+t;
t=c[j][k]/10;
c[j][k]%=10;
}
if(t!=0)
c[j][++c[j][0]]=t;
}
}
for(i=c[d-1][0];i>=1;i--)
fout<<c[d-1][i];
return 0;
}