Pascal :
var n,x,i,j:longint; p:array[0..10000]of longint; begin readln(n); x:=trunc(sqrt(n)); p[0]:=1; for i:=1 to x do for j:=i*i to n do p[j]:=p[j]+p[j-i*i]; writeln(p[n]); end.
By signing up a 算道OJ universal account, you can submit code and join discussions in all online judging services provided by us.
Using your 算道OJ universal account