用动态规划
用f[i,j]表示把i分解，其中所有因数不大于j的方案数

请问能否更详细地讲一下..
动态规划转移方程怎么写?

F[i,j]=total(F[x,y])
枚举x,符合以下条件：
x<i
x<j
i mod x=0
y=i div x

program yinshifenjie;
var
    a:array[1..10000]of longint;
    j,k:longint;
function fenjie(n:longint):longint;
    var
        sum,i:longint;
    begin
        sum:=0;
        if a[n]=0 then        
            begin
                for i:=1 to (n div 2) do
                    if (n mod i)=0 then
                        sum:=sum+fenjie(i);    
                a[n]:=sum;
            end
        else
            sum:=a[n];            
        fenjie:=sum;
    end;
begin
    readln(k);
    a[1]:=1;
    j:=fenjie(k);
    writeln(j);
    readln;
end.