Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int Arr[255][255];
- int n = 5;
- int iCount = 1;
- Arr[0][0] = iCount++;
- int i = 0, j = 1;
- int dx = 1, dy = -1;
- while (iCount < n*n)
- {
- Arr[i][j] = iCount++;
- i += dx;
- j += dy;
- //Xu ly cham bien
- if (j == -1 || i >= n)
- {
- if (i <= n - 1)
- {
- j = 0;
- }
- else
- {
- i = n - 1;
- j += 2;
- }
- dx = -dx;
- dy = -dy;
- }
- else if (i == -1 || j >= n)
- {
- if (j <= n - 1)
- {
- i = 0;
- }
- else
- {
- j = n - 1;
- i += 2;
- }
- dx = -dx;
- dy = -dy;
- }
- }
- Arr[n - 1][n - 1] = iCount;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- cout << Arr[i][j] << " ";
- }
- cout << endl << endl << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement