算法分析

时间复杂度 $O(n^2)$

参考文献

算法提高课

Java 代码

import java.util.Scanner;

public class Main {
    static int[] v = new int[] {0,10,20,50,100};
    static int[] f = new int[1010];
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        f[0] = 1;
        for(int i = 1;i <= 4;i++)
        {
            for(int j = v[i];j <= n;j ++)
            {
                f[j] = f[j] + f[j - v[i]];
            }
        }
        System.out.println(f[n]);
    }
}