OJ-0724

题目

题解

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int num = in.nextInt();

        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 1; i < num; i++) {
            int sum = i;
            for (int j = i + 1; j < num && sum < num; j++) {
                sum += j;
                if (sum == num) {
                    map.put(i, j);
                    break;
                }
            }
        }
        System.out.println(num + "=" + num);
        for (Integer key : map.keySet()) {
            System.out.print(num + "=");
            for (int i = key; i <= map.get(key); i++) {
                if (i != map.get(key)) {
                    System.out.print(i + "+");
                } else {
                    System.out.print(i);
                }
            }
            System.out.println();
        }
    }
}

参考

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        new Main().solve(n);
    }

    public void solve(int t) {
        StringBuilder sb = new StringBuilder();
        int result = 0;
        for (int i = 0; i < t; i++) {
            int nums = i + 1;
            if (2 * t % nums == 0) {
                int left = 2 * t / nums - i;
                if (left <= 0) {
                    break;
                }
                if (left % 2 == 0) {
                    result++;
                    int a = left / 2;
                    sb.setLength(0);
                    sb.append(t + "=");
                    for (int j = a; j <= a + i; j++) {
                        sb.append(j);
                        sb.append("+");
                    }
                    sb.setLength(sb.length() - 1);
                    System.out.println(sb.toString());
                }
            }
        }
        System.out.print("Result:" + result);
    }
}

https://blog.csdn.net/weixin_52908342/article/details/135044206