fork download
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4.  
  5. const int MAX_LENGTH = 20;
  6.  
  7. int main() {
  8. char array[MAX_LENGTH + 1], matrix[MAX_LENGTH + 1][MAX_LENGTH + 1];
  9. int n;
  10. cin >> n;
  11. cin.getline(array, MAX_LENGTH);
  12. for (int i = 0; i < n; ++i) {
  13. cin.getline(array, MAX_LENGTH);
  14. for (int j = 0; j < n; ++j) {
  15. matrix[i][j] = array[j];
  16. }
  17. }
  18. int countR = 0, countM = 0, countC = 0;
  19. int countr = 0, countm = 0, countc = 0;
  20. for (int i = 0; i < n; ++i) {
  21. for (int j = 0; j < n; ++j) {
  22. if (matrix[i][j] == 'M') {
  23. cout << matrix[i][j] << "<-|";
  24. ++countm;
  25. } else if (matrix[i][j] == 'C') {
  26. cout << matrix[i][j] << "<-|";
  27. ++countc;
  28. } else if (matrix[i][j] == 'R') {
  29. cout << matrix[i][j] << "<-|";
  30. ++countr;
  31. }
  32. cout << i << " " << j <<" []";
  33. cout <<"count m: " << countm << "| count c: " << countc << "|count r: " << countr << "||";
  34. cout << "\n";
  35. }
  36. if (countm != 0) {
  37. ++countM;
  38. countm = 0;
  39. }
  40. if(countc != 0) {
  41. ++countC;
  42. countc = 0;
  43. }
  44. if (countr != 0) {
  45. ++countR;
  46. countr = 0;
  47. }
  48.  
  49. }
  50. if (countR > countM && countM > countC) {
  51. cout <<"R";
  52. } else if (countM > countR && countR > countC) {
  53. cout<< "M";
  54. } else {
  55. cout << "C";
  56. }
  57. return 0;
  58. }
Success #stdin #stdout 0.01s 5288KB
stdin
5
RCMMC
MRCCR
MCRCC
MMMRM
MMMCR
stdout
R<-|0 0 []count m: 0| count c: 0|count r: 1||
C<-|0 1 []count m: 0| count c: 1|count r: 1||
M<-|0 2 []count m: 1| count c: 1|count r: 1||
M<-|0 3 []count m: 2| count c: 1|count r: 1||
C<-|0 4 []count m: 2| count c: 2|count r: 1||
M<-|1 0 []count m: 1| count c: 0|count r: 0||
R<-|1 1 []count m: 1| count c: 0|count r: 1||
C<-|1 2 []count m: 1| count c: 1|count r: 1||
C<-|1 3 []count m: 1| count c: 2|count r: 1||
R<-|1 4 []count m: 1| count c: 2|count r: 2||
M<-|2 0 []count m: 1| count c: 0|count r: 0||
C<-|2 1 []count m: 1| count c: 1|count r: 0||
R<-|2 2 []count m: 1| count c: 1|count r: 1||
C<-|2 3 []count m: 1| count c: 2|count r: 1||
C<-|2 4 []count m: 1| count c: 3|count r: 1||
M<-|3 0 []count m: 1| count c: 0|count r: 0||
M<-|3 1 []count m: 2| count c: 0|count r: 0||
M<-|3 2 []count m: 3| count c: 0|count r: 0||
R<-|3 3 []count m: 3| count c: 0|count r: 1||
M<-|3 4 []count m: 4| count c: 0|count r: 1||
M<-|4 0 []count m: 1| count c: 0|count r: 0||
M<-|4 1 []count m: 2| count c: 0|count r: 0||
M<-|4 2 []count m: 3| count c: 0|count r: 0||
C<-|4 3 []count m: 3| count c: 1|count r: 0||
R<-|4 4 []count m: 3| count c: 1|count r: 1||
C