Advertisement
Guest User

Untitled

a guest
Jan 19th, 2018
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.33 KB | None | 0 0
  1. #include<iostream>
  2. #include<windows.h>
  3.  
  4. using namespace std;
  5.  
  6. void print(int** mas,int n)
  7. {
  8. system("cls");
  9. cout << endl << endl;
  10.  
  11. for (int i = 0; i < 2 * n + 1; i++)
  12. {
  13. for (int j = 0; j < 2 * n + 1; j++)
  14. {
  15. cout << mas[i][j] << "\t";
  16. }
  17. cout << "\n\n";
  18. }
  19. }
  20.  
  21.  
  22. void main()
  23. {
  24. int n = 0;
  25.  
  26. cout << "Enter n : ";
  27. cin >> n;
  28.  
  29. int** mas = new int*[2 * n + 1];
  30. for (int i = 0; i < 2 * n + 1; i++)
  31. {
  32. mas[i] = new int[2 * n + 1];
  33. }
  34.  
  35. int count = 0;
  36. for (int i = 0; i < 2 * n + 1; i++)
  37. {
  38. for (int j = 0; j < 2 * n + 1; j++)
  39. {
  40. mas[i][j] = 0;
  41. cout << mas[i][j] << "\t";
  42. }
  43. cout << "\n\n";
  44. }
  45.  
  46. mas[n][n] = 0;
  47. int step = 1;
  48. count = 1;
  49. for (int i = 1; i <= n; i++)
  50. {
  51. for (int lr = n+i-1; lr >= n - step; lr--)
  52. {
  53. mas[n - i][lr] = count;
  54. count++;
  55. print(mas,n);
  56. Sleep(300);
  57.  
  58. }
  59. for (int ud = n - (i - 1); ud <= n + step; ud++)
  60. {
  61. mas[ud][n-i] = count;
  62. count++;
  63. print(mas, n);
  64. Sleep(300);
  65. }
  66. for (int lr = n - (i - 1); lr <= n + step; lr++)
  67. {
  68. mas[n+i][lr] = count;
  69. count++;
  70. print(mas, n);
  71. Sleep(300);
  72. }
  73. for (int du = n + i - 1; du >= n - step; du--)
  74. {
  75. mas[du][n+i] = count;
  76. count++;
  77. print(mas, n);
  78. Sleep(300);
  79. }
  80. step += 1;
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90. delete[] mas;
  91. system("pause>0");
  92. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement