fork download
  1. #include <iostream>
  2. #include <string>
  3. using namespace std;
  4.  
  5. int main()
  6. {
  7. string cases[8]={"TTT","TTH","THT","THH","HTT","HTH","HHT","HHH"};
  8. int p,j,i;
  9. cin>>p;
  10. int sets[p];
  11. string toss[p];
  12. string new1;
  13. for(i=0;i<p;i++)
  14. {
  15. cin>>sets[i];
  16. cin>>toss[i];
  17. }
  18. for(i=0;i<p;++i)
  19. {
  20. int case1=0,case2=0,case3=0,case4=0,case5=0,case6=0,case7=0,case8=0;
  21. new1=toss[i];
  22. cout<<sets[i];
  23. for(j=0;j<38;++j)
  24. {
  25. if ((new1[i] == cases[0][0] && (new1[i+1] == cases[0][1]) && (new1[i+2] == cases[0][2])))
  26. {case1++;}
  27. if ((new1[i] == cases[1][0] && (new1[i+1] == cases[1][1]) && (new1[i+2] == cases[1][2])))
  28. {case2++;}
  29. if ((new1[i] == cases[2][0] && (new1[i+1] == cases[2][1]) && (new1[i+2] == cases[2][2])))
  30. {case3++;}
  31. if ((new1[i] == cases[3][0] && (new1[i+1] == cases[3][1]) && (new1[i+2] == cases[3][2])))
  32. {case4++;}
  33. if ((new1[i] == cases[4][0] && (new1[i+1] == cases[4][1]) && (new1[i+2] == cases[4][2])))
  34. {case5++;}
  35. if ((new1[i] == cases[5][0] && (new1[i+1] == cases[5][1]) && (new1[i+2] == cases[5][2])))
  36. {case6++;}
  37. if ((new1[i] == cases[6][0] && (new1[i+1] == cases[6][1]) && (new1[i+2] == cases[6][2])))
  38. {case7++;}
  39. if ((new1[i] == cases[7][0] && (new1[i+1] == cases[7][1]) && (new1[i+2] == cases[7][2])))
  40. {case8++;}
  41. }
  42. cout<<case1<<" "<<case2<<" "<<case3<<" "<<case4<<" "<<case5<<" "<<case6<<" "<<case7<<" "<<case8<<" ";
  43.  
  44. }
  45.  
  46. return 0;
  47. }
  48.  
Success #stdin #stdout 0s 3280KB
stdin
4
1 2
1 2
1 2
1 2
stdout
10 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0 10 0 0 0 0 0 0 0