题解 | 最大的组合

import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        List<int[]> ans = new LinkedList<>();
        int max = 0;
        for (int a = 0; a <= n; a++) {
            for (int b = 0; b <= n; b++) {
                if ((a + b) % 3 != 0) continue;
                for (int c = 0; c <= n; c++) {
                    if ((b + c) % 5 == 0 && (a + b + c) % 7 == 0) {
                        if (a + b + c > max) {
                            max = a + b + c;
                            ans.clear();
                            ans.add(new int[]{a, b, c});
                        } else if (a + b + c == max) ans.add(new int[]{a, b, c});
                    }
                }
            }
        }
        for (int[] res : ans) System.out.println(res[0] + " " + res[1] + " " + res[2]);
        sc.close();
    }
}