fork download
  1. #include <iostream>
  2.  
  3. int main() {
  4.  
  5. const uint8_t size = 10;
  6. uint32_t array[size][size];
  7.  
  8. for (int i = 0; i < size; ++i) {
  9. for (int j = 0; j < size; ++j) {
  10. array[i][j] = i+1, j+1;
  11. }
  12. }
  13.  
  14. for (int i = 0; i < size; i++) {
  15. uint64_t summa = 0;
  16. for (int j = 0; j < size-1; j+=2) {
  17. summa += array[i][j] + array[i][j+1];
  18. }
  19. std::cout << summa << " ";
  20. }
  21.  
  22. std::cout << std::endl;
  23.  
  24. for (int i = 0; i < size; i++) {
  25.  
  26. uint64_t sumMultiply = 1;
  27. for (int j = 0; j < size - 1; j+=2) {
  28. uint64_t num;
  29. num = array[j][i] * array[j+1][i];
  30. sumMultiply *= num;
  31. }
  32. std::cout << sumMultiply << " column " << i+1 << " ";
  33. std::cout << std::endl;
  34. }
  35.  
  36. uint64_t max = array[0][0];
  37. for (int i = 0; i < size - 1; ++i) {
  38. if (array[i][i] < array[i + 1][i + 1]) {
  39. max = array[i + 1][i + 1];
  40. }
  41. }
  42. std::cout << "max num in diagonal: " << max << std::endl;;
  43.  
  44. for (int i = 0; i < size; ++i) {
  45. for (int j = 0; j < size; ++j) {
  46. std::cout <<array[i][j] << " ";
  47. }
  48. std::cout << std::endl;
  49. }
  50.  
  51.  
  52. return 0;
  53. }
Success #stdin #stdout 0s 4520KB
stdin
Standard input is empty
stdout
10 20 30 40 50 60 70 80 90 100 
3628800 column 1 
3628800 column 2 
3628800 column 3 
3628800 column 4 
3628800 column 5 
3628800 column 6 
3628800 column 7 
3628800 column 8 
3628800 column 9 
3628800 column 10 
max num in diagonal: 10
1 1 1 1 1 1 1 1 1 1 
2 2 2 2 2 2 2 2 2 2 
3 3 3 3 3 3 3 3 3 3 
4 4 4 4 4 4 4 4 4 4 
5 5 5 5 5 5 5 5 5 5 
6 6 6 6 6 6 6 6 6 6 
7 7 7 7 7 7 7 7 7 7 
8 8 8 8 8 8 8 8 8 8 
9 9 9 9 9 9 9 9 9 9 
10 10 10 10 10 10 10 10 10 10