Go to diff to previous submission
import java.util.LinkedList; import java.util.List; import java.util.Scanner; public class Fn { while (scanner.hasNext()) { int nodes = scanner.nextInt(); int edges = scanner.nextInt(); int [] poile = new int[nodes + 1]; for (int i=0; i<edges; i++) { int node1 = scanner.nextInt(); int node2 = scanner.nextInt(); ++poile[node1]; ++poile[node2]; } boolean hasBunny = false; for (int i=0; i<nodes; i++) { if (poile[i] >= 4) { hasBunny = true; break; } } if (hasBunny) { } else { } } } }
--- c5.s532.cteam038.fn.java.0.Fn.java +++ c5.s547.cteam038.fn.java.0.Fn.java @@ -8,17 +8,12 @@ public static void main(String [] args) { Scanner scanner = new Scanner(System.in); - while (scanner.hasNextLine()) { - String line = scanner.nextLine(); - - Scanner lineScanner = new Scanner(line); - int nodes = Integer.parseInt(lineScanner.next()); - int edges = Integer.parseInt(lineScanner.next()); + while (scanner.hasNext()) { + int nodes = scanner.nextInt(); + int edges = scanner.nextInt(); int [] poile = new int[nodes + 1]; for (int i=0; i<edges; i++) { - line = scanner.nextLine(); - lineScanner = new Scanner(line); - int node1 = Integer.parseInt(lineScanner.next()); - int node2 = Integer.parseInt(lineScanner.next()); + int node1 = scanner.nextInt(); + int node2 = scanner.nextInt(); ++poile[node1]; ++poile[node2];