HDU 2058 JAVA

最新推荐文章于 2021-03-05 14:43:10 发布

原创最新推荐文章于 2021-03-05 14:43:10 发布 · 283 阅读

0 ·

CC 4.0 BY-SA版权

hdu--ACM 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种算法，用于找出所有可能的子序列，这些子序列的元素之和等于给定的目标值M。输入包括一系列整数和目标值M，输出为所有符合条件的子序列。示例展示了如何通过算法找到子序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description
Given a sequence 1,2,3,……N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.

Input
Input contains multiple test cases. each case contains two integers N, M( 1 <= N, M <= 1000000000).input ends with N = M = 0.

Output
For each test case, print all the possible sub-sequence that its sum is M.The format is show in the sample below.print a blank line after each test case.

Sample Input
20 10
50 30
0 0

Sample Output
[1,4]
[10,10]

[4,8]
[6,9]
[9,11]
[30,30]

import java.util.*;

class Main {
    public static void main(String args[]) {
        Scanner cin = new Scanner(System.in);
        while (cin.hasNext()) {
            long n = cin.nextInt();
            long m = cin.nextInt();
            if (n == 0 && m == 0)
                break;
            long d = 0;
            for (int i = (int) Math.sqrt(2 * m); i > 0; i--) {
                d = m - (i + i * i) / 2;
                if (d % i == 0)
                    System.out.println("[" + (d / i + 1) + "," + (d / i + i)
                            + "]");
            }

            System.out.println();
        }
    }
}