We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 9e80f66 commit 8105816Copy full SHA for 8105816
notes/notes_possible_array_values.cpp
@@ -0,0 +1,14 @@
1
+// Si tenemos un array de longitud N y los valores van desde 1 <= Ai <= M
2
+
3
+// A1 < A2 < A3 < A4 < A5 < ... < AN-1 < AN
4
+// Combinaciones SIN Repeticiones M combinado N
5
6
+// A1 <= A2 <= A3 <= A4 <= A5 <= ... <= AN-1 <= AN
7
+// Combinaciones CON Repeticiones M combinado N
8
9
+// Si A1 == 1 && (A[i] + 1 == A[i + 1] o A[i] == A[i + 1])
10
+// 1 1 1
11
+// 1 1 2
12
+// 1 2 2
13
+// 1 2 3
14
+// Esto es igual a 2^(N - 1)
0 commit comments