第一题,钱币数量问题,注意是1-m全部都能组成。循环找到最大的小于等于sum+1的值为a[i],则sum+a[i]之内的都可以;import java.util.Arrays;import java.util.Scanner; /** Created by ouyangxizhu on 2019/4/5. /public class Tencent1 { public static void main(String args[]) { Scanner sc = new Scanner(System.in); int m = sc.nextInt(); int n = sc.nex...