NEERC/database/database_mb.java

   1 import java.io.FileReader;
   2 import java.io.IOException;
   3 import java.io.PrintWriter;
   4 import java.util.HashMap;
   5 import java.util.Scanner;
   6
   7 public class database_mb implements Runnable {
   8     private Scanner in;
   9     private PrintWriter out;
  10
  11     public static void main(String[] args) {
  12         new Thread(new database_mb()).start();
  13     }
  14
  15     public void run() {
  16         try {
  17             in = new Scanner(new FileReader("database.in"));
  18             out = new PrintWriter("database.out");
  19
  20             solve();
  21
  22             in.close();
  23             out.close();
  24         } catch (IOException e) {
  25             e.printStackTrace();
  26         }
  27     }
  28
  29     private void solve() {
  30         final int n = in.nextInt();
  31         final int m = in.nextInt();
  32         in.nextLine();
  33
  34         String[][] table = new String[n][];
  35         for (int i = 0; i < n; i++) {
  36             table[i] =  in.nextLine().split(",");
  37         }
  38
  39         for (int i = 0; i < m; i++) {
  40             for (int j = i + 1; j < m; j++) {
  41                 final HashMap<String, Integer> map = new HashMap<String, Integer>();
  42                 for (int k = 0; k < n; k++) {
  43                     String key = table[k][i] + "," + table[k][j];
  44                     if (map.containsKey(key)) {
  45                         out.println("NO");
  46                         out.printf("%d %d\n", map.get(key) + 1, k + 1);
  47                         out.printf("%d %d\n", i + 1, j + 1);
  48                         return;
  49                     }
  50                     map.put(key, k);
  51                 }
  52             }
  53         }
  54
  55         out.println("YES");
  56     }
  57 }