fork download
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4.  
  5. const int MAX_LENGTH = 100;
  6.  
  7.  
  8. int main() {
  9. char array[MAX_LENGTH + 1], mt[MAX_LENGTH + 1][MAX_LENGTH + 1], secMt[MAX_LENGTH + 1][MAX_LENGTH + 1];
  10. int counter = 0, lengthFin = 0;
  11.  
  12.  
  13. while (cin.getline(array, MAX_LENGTH)) {
  14. int asterix = 0;
  15. int length = strlen(array);
  16. for (int j = 0; j < length; ++j) {
  17. if (array[j] == '*') {
  18. ++asterix;
  19. }
  20. }
  21. //cout << asterix << " " << length<< "<-\n";
  22. if (asterix < length) {
  23. for (int j = 0; j < length; ++j) {
  24. mt[counter][j] = array[j];
  25. //cout << mt[counter][j] << "<->" << array[j]<< "\n";
  26. }
  27. ++counter;
  28. }
  29. lengthFin = length;
  30. }
  31.  
  32.  
  33. for (int i = 0 ; i < counter; ++i) {
  34. for (int j = 0 ; j < lengthFin; ++j) {
  35. cout << mt[i][j]<< " ";
  36. }
  37. cout << "\n";
  38. //cout << counter<<".\n"; //counter = 3
  39. }
  40.  
  41. // TOTUL BINE
  42.  
  43. int linie = counter ; //
  44. for (int i = 0; i < counter; ++i) {
  45. int col = lengthFin;
  46. for (int j = 0; j < lengthFin; ++j, --col) {
  47. // cout << mt[i][j] <<".";
  48. if ((mt[i][j] >= 'a' && mt[i][j] <= 'z') || (mt[i][j] >= 'A' && mt[i][j] <= 'Z')) {
  49. //cout << col - 1 <<" " << i <<" \n";
  50. secMt[col - 1][i] = mt[i][j];
  51. }
  52. }
  53. // cout <<" \n";
  54. }
  55.  
  56. for (int i = 0 ; i < counter; ++i) {
  57. for (int j = 0 ; j < lengthFin; ++j) {
  58. // cout << secMt[i][j] ;
  59. }
  60. // cout <<".\n";
  61. }
  62.  
  63.  
  64. return 0;
  65. }
  66.  
  67.  
  68. /*
  69. a*c*
  70. **sd
  71. v*g*
  72. ****
  73.  
  74. =======
  75. ****
  76. a*sa
  77. dd*b
  78. ***z
  79. */
Success #stdin #stdout 0s 5312KB
stdin
AmAmAb
Nunera
Ilarel
Mt*t*a
Ae***u
L****r
stdout
A m A m A b 
N u n e r a 
I l a r e l 
M t * t * a 
A e * * * u 
L * * * * r