Advertisement
Guest User

Untitled

a guest
Nov 19th, 2019
89
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.37 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. int main()
  6. {
  7. ios::sync_with_stdio(false);
  8. cin.tie(NULL); cout.tie(NULL);
  9. string Z[3];
  10. cin >> Z[0];
  11. cin >> Z[1];
  12. cin >> Z[2];
  13. for(int x = 0; x < Z[0].size(); x++)
  14. {
  15. for(int z = 0; z < Z[1].size(); z++)
  16. {
  17. if(Z[0][x] == Z[1][z])
  18. {
  19. for(int i = 0; i < Z[2].size(); i++)
  20. {
  21. for(int q = 0; q < Z[0].size(); q++)
  22. {
  23. if(Z[0][q] == Z[2][i] && q != x)
  24. {
  25. cout << Z[0] << " " << x + 1 << " " << Z[1] << " " << z + 1 << "\n" << Z[0] << " " << q + 1 << " " << Z[2] << " " << i + 1;
  26. return 0;
  27. }
  28. }
  29. for(int q = 0; q < Z[1].size(); q++)
  30. {
  31. if(Z[1][q] == Z[2][i] && q != z)
  32. {
  33. cout << Z[0] << " " << x + 1 << " " << Z[1] << " " << z + 1 << "\n" << Z[1] << " " << q + 1 << " " << Z[2] << " " << i + 1;
  34. return 0;
  35. }
  36. }
  37. }
  38. }
  39. }
  40. }
  41. for(int x = 0; x < Z[0].size(); x++)
  42. {
  43. for(int z = 0; z < Z[2].size(); z++)
  44. {
  45. if(Z[0][x] == Z[2][z])
  46. {
  47. for(int i = 0; i < Z[1].size(); i++)
  48. {
  49. for(int q = 0; q < Z[0].size(); q++)
  50. {
  51. if(Z[0][q] == Z[1][i] && q != x)
  52. {
  53. cout << Z[0] << " " << x + 1 << " " << Z[2] << " " << z + 1 << "\n" << Z[0] << " " << q + 1 << " " << Z[1] << " " << i + 1;
  54. return 0;
  55. }
  56. }
  57. for(int q = 0; q < Z[2].size(); q++)
  58. {
  59. if(Z[2][q] == Z[1][i] && q != z)
  60. {
  61. cout << Z[0] << " " << x + 1 << " " << Z[2] << " " << z + 1 << "\n" << Z[2] << " " << q + 1 << " " << Z[1] << " " << i + 1;
  62. return 0;
  63. }
  64. }
  65. }
  66. }
  67. }
  68. }
  69. return 0;
  70. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement