Advertisement
Guest User

Untitled

a guest
Nov 21st, 2018
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.90 KB | None | 0 0
  1. #include <iostream>
  2. #include <bits/stdc++.h>
  3.  
  4. using namespace std;
  5.  
  6. int main()
  7. {
  8. vector < string > v1;
  9. string s1;
  10. cin >> s1;
  11. int n1 = s1.size();
  12. n1 = n1 * (n1 + 1) / 2;
  13. v1.resize(n1);
  14. int k = 0;
  15. for(int i = 0; i < s1.size(); i++)
  16. {
  17. for(int j = i; j < s1.size(); j++)
  18. {
  19. for(int h = i; h <= j; h++)
  20. {
  21. v1[k].push_back(s1[h]);
  22. }
  23. k++;
  24. }
  25. }
  26. vector < string > v2;
  27. string s2;
  28. cin >> s2;
  29. int n2 = s2.size();
  30. n2 = n2 * (n2 + 1) / 2;
  31. v2.resize(n2);
  32. int k2 = 0;
  33. for(int i = 0; i < s2.size(); i++)
  34. {
  35. for(int j = i; j < s2.size(); j++)
  36. {
  37. for(int h = i; h <= j; h++)
  38. {
  39. v2[k2].push_back(s2[h]);
  40. }
  41. k2++;
  42. }
  43. }
  44. vector < string > v3;
  45. string s3;
  46. cin >> s3;
  47. int n3 = s3.size();
  48. n3 = n3 * (n3 + 1) / 2;
  49. v3.resize(n3);
  50. int k3 = 0;
  51. for(int i = 0; i < s3.size(); i++)
  52. {
  53. for(int j = i; j < s3.size(); j++)
  54. {
  55. for(int h = i; h <= j; h++)
  56. {
  57. v3[k3].push_back(s3[h]);
  58. }
  59. k3++;
  60. }
  61. }
  62. vector < string > ans;
  63. int max = 0;
  64. for(int i = 0; i < n1; i++)
  65. {
  66. for(int j = 0; j < n2; j++)
  67. {
  68. for(int h = 0; h < n3; h++)
  69. {
  70. if(v1[i] == v2[j] && v2[j] == v3[h])
  71. {
  72. ans.push_back(v1[i]);
  73. if(max < v1[i].size())
  74. {
  75. max = v1[i].size();
  76. }
  77. }
  78. }
  79. }
  80. }
  81. for(int i = 0; i < ans.size(); i++)
  82. {
  83. if(ans[i].size() == max)
  84. {
  85. cout << ans[i];
  86. return 0;
  87. }
  88. }
  89. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement