Pagini recente » Borderou de evaluare (job #904707) | Diferente pentru problema/johnie intre reviziile 3 si 2 | Cod sursa (job #282671)
Cod sursa(job #282671)
#include<stdio.h>
int n, k,x,y,i,j,m[101][22];
int main()
{
freopen("spider.in","r",stdin);
freopen("spider.out","w",stdout);
scanf("%d %d", &x, &y);
for(i=1;i<=x;i++)
m[i][1]=1;
m[0][1]=1;
for(i=1;i<=y;i++)
for(j=1;j<=x;j++)
for(k=1;k<=20;k++)
{
m[j][k]=m[j-1][k]+m[j][k];
m[j][k+1]+=m[j][k]/1000;
m[j][k]=m[j][k]%1000;
}
n=21;
while(m[x][n]==0) n--;
printf("%d", m[x][n]);
n--;
for(k=n;k>=1;k--)
{
if(m[x][k]<10) printf("00%d", m[x][k]);
else if(m[x][k]<100) printf("0%d", m[x][k]);
else printf("%d", m[x][k]);
}
return 0;
}