fork download
  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4.  
  5. public static void main(String[] args) {
  6. Scanner s = new Scanner(System.in);
  7. int N;
  8. N = s.nextInt();
  9. int C[] = new int[N];
  10. int l[] = new int[N];
  11. int P[][] = new int[N][2000];
  12. for (int j = 0; j < N; j++) {
  13. C[j] = s.nextInt();
  14. l[j] = s.nextInt();
  15. for (int i = 0; i < l[j]; i++) {
  16. P[j][i] = s.nextInt();
  17. }
  18. }
  19. int g = 0;
  20. for (int k = 0; k < N; k++) {
  21. for (int i = 0; i < l[k]; i++) {
  22. for (int j = 0; j < l[k]; j++) {
  23. if (i != j) {
  24. if (C[k] == P[k][i] + P[k][j]) {
  25. System.out.println("Case #" + (k + 1) + ": " + (i + 1) + " " + (j + 1));
  26. g = 1;
  27. break;
  28. }
  29. }
  30. }
  31. if (g == 1) {
  32. break;
  33. }
  34. }
  35. g = 0;
  36. }
  37. s.close();
  38. }
  39. }
  40.  
Success #stdin #stdout 0.15s 321280KB
stdin
3
100
3
5 75 25
200
7
150 24 79 50 88 345 3
8
8
2 1 9 4 4 56 90 3
stdout
Case #1: 2 3
Case #2: 1 4
Case #3: 4 5