Advertisement
Guest User

Untitled

a guest
Jan 22nd, 2020
98
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.95 KB | None | 0 0
  1. #include<iostream>
  2. #include <cstdlib>
  3. using namespace std;
  4.  
  5. int randomRange(int low, int high)
  6. {
  7. return rand() % (high - low + 1) + low;
  8. }
  9.  
  10. int draw(){
  11. int a;
  12. int k = 2;
  13. cout<<"Input size: ";
  14. cin>>a;
  15.  
  16. if ((a <2) || (a>30))
  17. {
  18. cout<<"Error";
  19. return 0;
  20. }
  21. char arr[30][30] = {{0}};
  22. char random;
  23. char max='0', min='9';
  24. for(int i=0; i<a; i++){
  25. random = randomRange('0', '9');
  26. arr[0][i] = random;
  27. random = randomRange('0', '9');
  28. arr[a-1][i] = random;
  29. random = randomRange('0', '9');
  30. arr[i][a-1] = random;
  31.  
  32. for (int i =k; i<a; i++){
  33. random = randomRange('0', '9');
  34. arr[i][0] = random;
  35. }
  36.  
  37. for(int i=k; i<a-k; i++){
  38. random = randomRange('0', '9');
  39. arr[k][i-1] = random;
  40. random = randomRange('0', '9');
  41. arr[a-k-1][i] = random;
  42. random = randomRange('0', '9');
  43. arr[i][a-k-1] = random;
  44.  
  45. for (int i =k+2; i<a-k; i++){
  46. random = randomRange('0', '9');
  47. arr[i][k] = random;
  48. }
  49. }
  50. k+=2;
  51. }
  52.  
  53. for(int i=0;i<30;i++){
  54. for(int j=0;j<30;j++){
  55. cout << arr[i][j];
  56. }
  57. cout << endl;
  58. }
  59. if (k<a-2)
  60. draw();
  61. for (int i = 1; i < a; i++) {
  62. for (int j = 1; j < a; j++) {
  63. if (arr[i][j] > max) {
  64. max = arr[i][j];
  65. }
  66. }
  67. }
  68. for (int i = 1; i < a; i++) {
  69. for (int j = 1; j < a; j++) {
  70. if ((arr[i][j] < min) && (arr[i][j]!=0)) {
  71. min = arr[i][j];
  72. }
  73. }
  74. }
  75. cout << "MAX = ";
  76. cout << max;
  77. cout << endl;
  78. cout << "MIN = ";
  79. cout << min;
  80. return 0;
  81.  
  82. }
  83.  
  84. int main(){
  85. draw();
  86. getchar();
  87. return 0;
  88. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement