fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. struct Map {
  5. float a, b, c;
  6. };
  7.  
  8. bool laBangNhau(Map m1, Map m2) {
  9. return (m1.a == m2.a && m1.b == m2.b && m1.c == m2.c);
  10. }
  11.  
  12. int linearSearch(Map arr[], int n, Map y) {
  13. for (int i = 0; i < n; i++) {
  14. if (laBangNhau(arr[i], y)) return i;
  15. }
  16. return -1;
  17. }
  18.  
  19. int main() {
  20. int n;
  21. if (!(cin >> n)) return 0;
  22. Map A[n];
  23. for (int i = 0; i < n; i++) {
  24. cin >> A[i].a >> A[i].b >> A[i].c;
  25. }
  26.  
  27. int m;
  28. cin >> m;
  29. Map B[m];
  30. for (int i = 0; i < m; i++) {
  31. cin >> B[i].a >> B[i].b >> B[i].c;
  32. }
  33.  
  34. for (int i = 0; i < m; i++) {
  35. int check = linearSearch(A, n, B[i]);
  36. if (check != -1) cout << check << endl;
  37. else cout << "KHONG" << endl;
  38. }
  39. return 0;
  40. }
  41.  
Success #stdin #stdout 0s 5324KB
stdin
5
48.96 14.87 21.83
0.38 74.03 10.76
1.64 53.26 59.72
15.29 90.53 43.64
87.32 63.79 34.01
3
48.96 14.87 21.83
38.16 41.07 12.23
15.29 90.53 43.64
stdout
0
KHONG
3