Advertisement
mehedi1

B - Test.cpp

Aug 28th, 2019
109
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.98 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int main() {
  5. int a,b,n,T,cas=0;
  6. string s1, s2, s3, x,x1,x2,y,y1,y2,p,p1,p2,q,q1,q2;
  7. while(cin>>s1>>s2>>s3) {
  8. int i,j;
  9. //1-2'
  10. for(i=0,j=s2.size()-1;i<s1.size() && j>=0;++i,--j) {
  11. if(s1[i] != s2[j]) break;
  12. }
  13. if(i<s1.size() && j>=0) x1 = s2.substr(0,j+1) + s1;
  14. //2-1'
  15. for(int i=0, j=s1.size()-1;i<s2.size() && j>=0;++i,--j) {
  16. if(s2[i] != s1[j]) break;
  17. }
  18. if(i<s2.size() && j>=0) x2 = s1.substr(0,j+1) + s2;
  19. if(s1.size()<=s2.size()) x = x1;
  20. else x = x2;
  21.  
  22. //x-3'
  23. for(i=0,j=s3.size()-1;i<x.size() && j>=0;++i,--j) {
  24. if(x[i] != s3[j]) break;
  25. }
  26. if(i<x.size() && j>=0) p1 = s3.substr(0,j+1) + x;
  27. //3-x'
  28. for(int i=0, j=x.size()-1;i<s3.size() && j>=0;++i,--j) {
  29. if(s3[i] != x[j]) break;
  30. }
  31. if(i<s3.size() && j>=0) p2 = x.substr(0,j+1) + s3;
  32. if(p1.size()<=p2.size()) p = p1;
  33. else p = p2;
  34.  
  35. //1-3'
  36. for(i=0,j=s3.size()-1;i<s1.size() && j>=0;++i,--j) {
  37. if(s1[i] != s3[j]) break;
  38. }
  39. if(i<s1.size() && j>=0) y1 = s3.substr(0,j+1) + s1;
  40. //3'-1
  41. for(int i=0, j=s1.size()-1;i<s3.size() && j>=0;++i,--j) {
  42. if(s3[i] != s1[j]) break;
  43. }
  44. if(i<s3.size() && j>=0) y2 = s1.substr(0,j+1) + s3;
  45. if(y1.size()<=y2.size()) y = y1;
  46. else y = y2;
  47.  
  48. //y-2'
  49. for(i=0,j=s2.size()-1;i<y.size() && j>=0;++i,--j) {
  50. if(y[i] != s2[j]) break;
  51. }
  52. if(i<y.size() && j>=0) q1 = s2.substr(0,j+1) + y;
  53. //2-y'
  54. for(int i=0, j=y.size()-1;i<s2.size() && j>=0;++i,--j) {
  55. if(s2[i] != y[j]) break;
  56. }
  57. if(i<s2.size() && j>=0) q2 = y.substr(0,j+1) + s2;
  58. if(y.size()<=s2.size()) q = q1;
  59. else q = q2;
  60.  
  61. cout<<p<<" "<<q<<endl;
  62. }
  63. return 0;
  64. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement