Pagini recente » Cod sursa (job #1945045) | Cod sursa (job #3271477) | Cod sursa (job #2502757) | Cod sursa (job #1191966) | Cod sursa (job #544459)
Cod sursa(job #544459)
#include <stdio.h>
int n,r,k,d[200][2][501],ii=0,j,i;
void adunare(int a[], int b[],int ij,int ji)
{
int n1,kk=0;
//printf("%d %d\n",a[0],b[0]);
if(a[0]>b[0]){
n1=a[0];
}else{
n1=b[0];
}
int i1;
for(i1=1;i1<=n1;i1++){
d[i1][ij][ji]=(a[i1]+b[i1]+kk)%10;
kk=(a[i]+b[i]+kk)/10;
}
//printf("%d\n",n1);
if(kk>0){
n1++;
d[n1][ij][ji]=1;
}
d[n1][ij][ji]=n1;
}
int main()
{
freopen("expozitie.in","r",stdin);
freopen("expozitie.out","w",stdout);
scanf("%d%d%d",&n,&r,&k);
n=n-r*k;
for(i=1;i<=r;i++){
d[1][1][i]=d[0][1][i]=1;
}
for(i=2;i<=n;i++){
for(j=1;j<=r;j++){
adunare(d[ii^1][j],d[ii][j-1],ii,j);
}
ii=ii^1;
}
for(i=d[0][n][r];i>=1;i--){
printf("%d",d[i][n][r]);
}
return 0;
}