Created
March 28, 2017 19:27
-
-
Save stden/b15d5634ec5e1b9b948d6f97d793443a to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.Scanner; | |
import static java.lang.Math.min; | |
public class Solution { | |
private static int N; | |
static int[] A; | |
public static void main(String[] args) { | |
Scanner in = new Scanner(System.in); | |
N = in.nextInt(); | |
A = new int[N]; | |
rec(N, N, 0); | |
} | |
/** | |
* @param sum Какая сумма осталась | |
* @param limit Ограничение сверху (элемент который левее всего) | |
* @param size Сколько мы слагаемых уже поставили | |
*/ | |
private static void rec(int sum, int limit, int size) { | |
// Остановка рекурсии | |
if (sum == 0) { | |
System.out.print(N + " = " + A[0]); | |
for (int i = 1; i < size; i++) { | |
System.out.print(" + " + A[i]); | |
} | |
System.out.println(); | |
return; | |
} | |
// Раскладываем оставшуюся сумму | |
for (int x = min(limit, sum); x >= 1; x--) { | |
A[size] = x; // Поставили элемент x | |
rec(sum - x, x, size + 1); | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment