lumyjuwon/problem1024.java at master · algorithmofcodeforce/lumyjuwon · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
package lumy;

import java.util.Scanner;

public class problem1024 {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int L = sc.nextInt();
		int sigma_start = 0;
		int sigma_end = 0;

		for (int i = L; i <= 100; i++) {
			int k_coefficient = (i - 1) * 2 + 2;
			int constant = (int) Math.pow(i - 1, 2) + (i - 1);
			int Transform_N = N * 2 - constant;
			//System.out.println(k_coefficient+"k" + "+ " + constant + " = " + Transform_N);

			if(Transform_N <0)
				break;

			if (Transform_N % k_coefficient == 0) {
				// System.out.println("L: " + i);
				sigma_start = Transform_N / k_coefficient;
				sigma_end = sigma_start + (i - 1);
				// System.out.println("K: " + start);
				break;
			}

		}

		if (sigma_start == 0 && sigma_end == 0) {
			System.out.println(-1);
		}
		else {
			for (int i = sigma_start; i <= sigma_end; i++) {
				if (i == sigma_end) {
					System.out.print(i);
				} else {
					System.out.print(i + " ");
				}
			}
		}

		sc.close();

	}

}