language: Pascal (fpc) (fpc 2.2.0)
date: 104 days 22 hours ago
link:
visibility: public 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

var
a:array[0..15] of integer;
f:array[0..11,0..10000] of int64;
i,j,n:longint;
begin
read(n);
a[1]:=1;
f[0,0]:=1;
for i:=2 to 11 do
   a[i]:=2*a[i-1];
i:=0;
for i:=1 to 11 do
begin
for j:=0 to n do
   begin
      f[i,j]:=f[i-1,j]+f[i,j];
      if j-a[i]>=0 then f[i,j]:=f[i,j]+f[i-1,j-a[i]];
      write(f[i,j],' ');
        end;
writeln;
end;
write(f[11,n]);    
end.