36-samepizzas subtask1

Author: Dimitris Los

_includes/source_code/code/37-PDP/samepizzas/TASK

@@ -13,43 +13,43 @@ TASK(
          passes_all,
          lang = "c++",
       ),
-	  SOLUTION(
+      SOLUTION(
          name = "samepizzas_select",
          source = "samepizzas_select.cc",
          passes_all,
          lang = "c++",
       ),
-	  SOLUTION(
+      SOLUTION(
          name = "samepizzas_bsearch",
          source = "samepizzas_bsearch.cc",
          passes_all,
          lang = "c++",
       ),
-	  SOLUTION(
+      SOLUTION(
          name = "samepizzas_pq",
          source = "samepizzas_pq.cc",
          passes_all,
          lang = "c++",
       ),
-	  SOLUTION(
+      SOLUTION(
          name = "samepizzas_subtask1",
          source = "samepizzas_subtask1.cc",
          passes_only = [1, 2, 3, 4, 5, 6],
          lang = "c++",
       ),
-	  SOLUTION(
+      SOLUTION(
          name = "samepizzas_subtask2",
          source = "samepizzas_subtask2.cc",
          passes_only = [2, 5, 7, 8, 9, 10, 11],
          lang = "c++",
       ),
-	  SOLUTION(
+      SOLUTION(
          name = "samepizzas_subtask3",
          source = "samepizzas_subtask3.cc",
          passes_only = [3, 4, 6, 12, 13, 14, 15, 16],
          lang = "c++",
       ),
-	  SOLUTION(
+      SOLUTION(
          name = "samepizzas_subtask4",
          source = "samepizzas_insertion_sort.cc",
          passes_only = [1,2,3,4,5,6,17,18,19,20,21,22,23,24,25,26],

_includes/source_code/code/37-PDP/samepizzas/samepizzas_subtask1.cc

@@ -7,13 +7,13 @@ int main(){
    long P, N, K;
    fscanf(in, "%ld", &P);
    fscanf(in, "%ld%ld", &N, &K);
-   fclose(in);
 
    std::vector<long> A(N);
    for(long i = 0; i < N; i++) {
       fscanf(in, "%ld", &A[i]);
    }
-    
+   fclose(in);
+   
    FILE *out= fopen("samepizzas.out", "w");
    if (K == 1) fprintf(out, "%ld\n", std::max(A[0], A[1]));
    else fprintf(out, "%ld\n", std::min(A[0], A[1]));