Update java solutions

Author: tossy310

battle_royal/tossy-java/BattleRoyal.java

@@ -1,23 +1,25 @@
+import java.io.PrintWriter;
 import java.util.Scanner;
-import java.util.stream.IntStream;
 
 public class BattleRoyal {
     private static final Scanner sc = new Scanner(System.in);
+    private static final PrintWriter pw = new PrintWriter(System.out);
     private static final int N = 100;
 
     private static void solve() {
-        final int k[] = new int[N];
+        int total = 0;
         for (int i = 0; i < N; i++) {
-            k[i] = sc.nextInt();
+            total += sc.nextInt();
         }
-        int total = IntStream.of(k).sum();
-        System.out.println(100 - total);
+        pw.println(100 - total);
     }
 
     public static void main(final String[] args) {
         final int T = sc.nextInt();
         for (int i = 0; i < T; i++) {
             solve();
         }
+        sc.close();
+        pw.close();
     }
 }

tsunahiki/java-tossy/Tsunahiki.java

@@ -1,11 +1,13 @@
+import java.io.PrintWriter;
 import java.util.Scanner;
 
 // O(N^2) solution
 public class Tsunahiki {
     private static final Scanner sc = new Scanner(System.in);
+    private static final PrintWriter pw = new PrintWriter(System.out);
     private static final int MAX_N = 100;
-    static final int a[] = new int[MAX_N];
-    static final int b[] = new int[MAX_N];
+    private static final int a[] = new int[MAX_N];
+    private static final int b[] = new int[MAX_N];
 
     private static boolean check(final int n, final int ans) {
         // try to win `ans` times
@@ -33,7 +35,7 @@ private static void solve() {
 
         for (int ans = n; ans >= 0; ans--) {
             if (check(n, ans)) {
-                System.out.println(ans);
+                pw.println(ans);
                 return;
             }
         }
@@ -46,5 +48,7 @@ public static void main(final String[] args) {
         for (int i = 0; i < T; i++) {
             solve();
         }
+        sc.close();
+        pw.close();
     }
 }