fork download
  1. #include <iostream>
  2. #include <cstring>
  3. class DaisyTransformation
  4. {
  5. private:
  6. int moves,status,length;
  7. char S1[50],S2[50],S3[50];
  8. public:
  9. void getValues( )
  10. {
  11. std::cin >> S1 >> S2 >> moves;
  12. length=strlen(S1);
  13. }
  14. void printValues( )
  15. {
  16. //std::cout <<"After"<< S1<<S2;
  17. if(status==0)
  18. std::cout << "No\n";
  19. else
  20. std::cout << "Yes\n";
  21. }
  22. void printValues1( )
  23. {
  24. std::cout <<"After"<< S1<<S2;
  25.  
  26. }
  27. void calcPossibilities()
  28. {
  29. int i=1,j=0;
  30. //std::cout << "Before swapping" << S1<<S2;
  31. for(i=0;i<=moves&&j<length;){
  32. if(S1[j]==S2[j]){
  33. //S3[j]=S1[j];
  34. j++;
  35. //std::cout <<"\ncond"<< 1<<j;
  36. }
  37. else{
  38. if(S1[j]=='M'){
  39. S1[j]='D';
  40. i++;
  41. j++;
  42. //std::cout <<"\ncond1"<<i<<j ;
  43. }
  44. else{
  45. S1[j]='M';
  46. i++;
  47. j++;
  48. //std::cout << "\ncond2"<<i<<j;
  49. }
  50. }
  51. }
  52. if(strcmp(S1,S2)==0 && i==moves)
  53. status=1;
  54. else
  55. status=0;
  56.  
  57. }
  58.  
  59. };
  60. int main()
  61. {
  62. DaisyTransformation dt[250];
  63. int noOfTestCases,i;
  64. std::cin>>noOfTestCases;
  65. for(i=0;i<noOfTestCases;i++){
  66. std::cin.clear();
  67. dt[i].getValues();
  68. }
  69. for(i=0;i<noOfTestCases;i++){
  70. /*if(i==24)
  71.   dt[i].printValues1();*/
  72. dt[i].calcPossibilities();
  73. /*if(i==24)
  74.   dt[i].printValues1();*/
  75. dt[i].printValues();
  76. }
  77. return 0;
  78. }
Success #stdin #stdout 0s 3460KB
stdin
30
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
MMMMMDMDMDMMDMDMDM DDDDDDDDDDDDDDDDDD 12
stdout
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes