Created
April 1, 2020 03:34
-
-
Save parvinderandroid/af6535dfec3626a91df3676d1bdd8cb8 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from numpy import * | |
n = int(input()) | |
A = [list(map(int, input().split())) for i in range(n)] | |
A = array(A) | |
z = A.copy() | |
b = n | |
f = 0 | |
while n > 2: | |
k = f | |
for i in range(f, n - 1): | |
z[k][i + 1] = A[k][i] | |
k = n - 1 | |
for i in range(f, n - 1): | |
z[i + 1][k] = A[i][k] | |
k = n - 1 | |
for i in range(n - 1, f, -1): | |
z[k][i - 1] = A[k][i] | |
k = f | |
for i in range(n - 1, f, -1): | |
z[i - 1][k] = A[i][k] | |
n -= 1 | |
f += 1 | |
print(z) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# from numpy import * | |
n = int(input()) | |
A = [list(map(int, input().split())) for i in range(n)] | |
# A = array(A) | |
z = A.copy() | |
b = n | |
f = 0 | |
while n > 2: | |
k = f | |
for i in range(f, n - 1): | |
z[k][i + 1] = A[k][i] | |
k = n - 1 | |
for i in range(f, n - 1): | |
z[i + 1][k] = A[i][k] | |
k = n - 1 | |
for i in range(n - 1, f, -1): | |
z[k][i - 1] = A[k][i] | |
k = f | |
for i in range(n - 1, f, -1): | |
z[i - 1][k] = A[i][k] | |
n -= 1 | |
f += 1 | |
print(z) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment