diff --git a/epi_judge_java/epi/OfflineSampling.java b/epi_judge_java/epi/OfflineSampling.java
index ec727eac9..539561437 100644
--- a/epi_judge_java/epi/OfflineSampling.java
+++ b/epi_judge_java/epi/OfflineSampling.java
@@ -28,8 +28,7 @@ private static boolean randomSamplingRunner(TimedExecutor executor, int k,
         RandomSequenceChecker.binomialCoefficient(A.size(), k);
     Collections.sort(A);
     List<List<Integer>> combinations = new ArrayList<>();
-    for (int i = 0; i < RandomSequenceChecker.binomialCoefficient(A.size(), k);
-         ++i) {
+    for (int i = 0; i < totalPossibleOutcomes; ++i) {
       combinations.add(
           RandomSequenceChecker.computeCombinationIdx(A, A.size(), k, i));
     }
diff --git a/epi_judge_java/epi/OnlineSampling.java b/epi_judge_java/epi/OnlineSampling.java
index 2b1ab1c7a..ef746d027 100644
--- a/epi_judge_java/epi/OnlineSampling.java
+++ b/epi_judge_java/epi/OnlineSampling.java
@@ -32,8 +32,7 @@ private static boolean onlineRandomSampleRunner(TimedExecutor executor,
         RandomSequenceChecker.binomialCoefficient(A.size(), k);
     Collections.sort(A);
     List<List<Integer>> combinations = new ArrayList<>();
-    for (int i = 0; i < RandomSequenceChecker.binomialCoefficient(A.size(), k);
-         ++i) {
+    for (int i = 0; i < totalPossibleOutcomes; ++i) {
       combinations.add(
           RandomSequenceChecker.computeCombinationIdx(A, A.size(), k, i));
     }
diff --git a/epi_judge_java/epi/RandomSubset.java b/epi_judge_java/epi/RandomSubset.java
index 32ea15106..a474c80f4 100644
--- a/epi_judge_java/epi/RandomSubset.java
+++ b/epi_judge_java/epi/RandomSubset.java
@@ -31,7 +31,7 @@ private static boolean randomSubsetRunner(TimedExecutor executor, int n,
       A.add(i);
     }
     List<List<Integer>> combinations = new ArrayList<>();
-    for (int i = 0; i < RandomSequenceChecker.binomialCoefficient(n, k); ++i) {
+    for (int i = 0; i < totalPossibleOutcomes; ++i) {
       combinations.add(RandomSequenceChecker.computeCombinationIdx(A, n, k, i));
     }
     List<Integer> sequence = new ArrayList<>();
diff --git a/epi_judge_java_solutions/epi/OfflineSampling.java b/epi_judge_java_solutions/epi/OfflineSampling.java
index 2056052ac..151e89b65 100644
--- a/epi_judge_java_solutions/epi/OfflineSampling.java
+++ b/epi_judge_java_solutions/epi/OfflineSampling.java
@@ -37,8 +37,7 @@ private static boolean randomSamplingRunner(TimedExecutor executor, int k,
         RandomSequenceChecker.binomialCoefficient(A.size(), k);
     Collections.sort(A);
     List<List<Integer>> combinations = new ArrayList<>();
-    for (int i = 0; i < RandomSequenceChecker.binomialCoefficient(A.size(), k);
-         ++i) {
+    for (int i = 0; i < totalPossibleOutcomes; ++i) {
       combinations.add(
           RandomSequenceChecker.computeCombinationIdx(A, A.size(), k, i));
     }
diff --git a/epi_judge_java_solutions/epi/OnlineSampling.java b/epi_judge_java_solutions/epi/OnlineSampling.java
index b11e32e2d..ae9c32f73 100644
--- a/epi_judge_java_solutions/epi/OnlineSampling.java
+++ b/epi_judge_java_solutions/epi/OnlineSampling.java
@@ -55,8 +55,7 @@ private static boolean onlineRandomSampleRunner(TimedExecutor executor,
         RandomSequenceChecker.binomialCoefficient(A.size(), k);
     Collections.sort(A);
     List<List<Integer>> combinations = new ArrayList<>();
-    for (int i = 0; i < RandomSequenceChecker.binomialCoefficient(A.size(), k);
-         ++i) {
+    for (int i = 0; i < totalPossibleOutcomes; ++i) {
       combinations.add(
           RandomSequenceChecker.computeCombinationIdx(A, A.size(), k, i));
     }
diff --git a/epi_judge_java_solutions/epi/RandomSubset.java b/epi_judge_java_solutions/epi/RandomSubset.java
index 6d367d164..60afaa975 100644
--- a/epi_judge_java_solutions/epi/RandomSubset.java
+++ b/epi_judge_java_solutions/epi/RandomSubset.java
@@ -63,7 +63,7 @@ private static boolean randomSubsetRunner(TimedExecutor executor, int n,
       A.add(i);
     }
     List<List<Integer>> combinations = new ArrayList<>();
-    for (int i = 0; i < RandomSequenceChecker.binomialCoefficient(n, k); ++i) {
+    for (int i = 0; i < totalPossibleOutcomes; ++i) {
       combinations.add(RandomSequenceChecker.computeCombinationIdx(A, n, k, i));
     }
     List<Integer> sequence = new ArrayList<>();