Source code for submission s547

Go to diff to previous submission

Fn.java

  1.  
  2. import java.util.LinkedList;
  3. import java.util.List;
  4. import java.util.Scanner;
  5.  
  6. public class Fn {
  7.  
  8. public static void main(String [] args) {
  9. Scanner scanner = new Scanner(System.in);
  10. while (scanner.hasNext()) {
  11. int nodes = scanner.nextInt();
  12. int edges = scanner.nextInt();
  13.  
  14. int [] poile = new int[nodes + 1];
  15. for (int i=0; i<edges; i++) {
  16. int node1 = scanner.nextInt();
  17. int node2 = scanner.nextInt();
  18. ++poile[node1];
  19. ++poile[node2];
  20. }
  21.  
  22. boolean hasBunny = false;
  23. for (int i=0; i<nodes; i++) {
  24. if (poile[i] >= 4) {
  25. hasBunny = true;
  26. break;
  27. }
  28. }
  29. if (hasBunny) {
  30. System.out.println("YES");
  31. } else {
  32. System.out.println("NO");
  33. }
  34.  
  35. }
  36. }
  37.  
  38.  
  39. }
  40.  

Diff to submission s532

Fn.java

--- 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];