API tools faq
paste
Advertisement
Guest User

sdfnklsdflksdbjfhA ,JMVNLFAACMVNBGSROWIUANISAFB VHGUZHIjCJGL

a guest
Jul 23rd, 2017
68
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 8.00 KB | None | 0 0
raw download clone embed print report
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int main() {
  4. int n;
  5. cin>>n;
  6. int a[8][n][n],b[8][n][n],c[8][n][n],d[8][n][n];
  7. for (int i = 0;i<n;i++) {
  8. for (int j = 0;j<n;j++) {
  9. cin>>a[0][i][j];
  10. a[1][i][n-j-1] = a[0][i][j];
  11. }
  12. }
  13. for (int i = 0;i<n;i++) {
  14. for (int j = 0;j<n;j++) {
  15. cin>>b[0][i][j];
  16. b[1][i][n-j-1] = b[0][i][j];
  17. }
  18. }
  19. for (int i = 0;i<n;i++) {
  20. for (int j = 0;j<n;j++) {
  21. cin>>c[0][i][j];
  22. c[1][i][n-j-1] = c[0][i][j];
  23. }
  24. }
  25. for (int i = 0;i<n;i++) {
  26. for (int j = 0;j<n;j++) {
  27. cin>>d[0][i][j];
  28. d[1][i][n-j-1] = d[0][i][j];
  29. }
  30. }
  31. for (int ii = 0,j = 0;ii<n;ii++,j++) {
  32. for (int jj = 0,i = n - 1;jj<n;jj++,i--) {
  33. a[2][ii][jj] = a[0][i][j]; a[3][ii][n - jj - 1] = a[2][ii][jj];
  34. b[2][ii][jj] = b[0][i][j]; b[3][ii][n - jj - 1] = b[2][ii][jj];
  35. c[2][ii][jj] = c[0][i][j]; c[3][ii][n - jj - 1] = c[2][ii][jj];
  36. d[2][ii][jj] = d[0][i][j]; d[3][ii][n - jj - 1] = d[2][ii][jj];
  37. }
  38. }
  39. for (int ii = 0,j = 0;ii<n;ii++,j++) {
  40. for (int jj = 0,i = n - 1;jj<n;jj++,i--) {
  41. a[4][ii][jj] = a[2][i][j]; a[5][ii][n - jj - 1] = a[4][ii][jj];
  42. b[4][ii][jj] = b[2][i][j]; b[5][ii][n - jj - 1] = b[4][ii][jj];
  43. c[4][ii][jj] = c[2][i][j]; c[5][ii][n - jj - 1] = c[4][ii][jj];
  44. d[4][ii][jj] = d[2][i][j]; d[5][ii][n - jj - 1] = d[4][ii][jj];
  45. }
  46. }
  47. for (int ii = 0,j = 0;ii<n;ii++,j++) {
  48. for (int jj = 0,i = n - 1;jj<n;jj++,i--) {
  49. a[6][ii][jj] = a[4][i][j]; a[7][ii][n - jj - 1] = a[6][ii][jj];
  50. b[6][ii][jj] = b[4][i][j]; b[7][ii][n - jj - 1] = b[6][ii][jj];
  51. c[6][ii][jj] = c[4][i][j]; c[7][ii][n - jj - 1] = c[6][ii][jj];
  52. d[6][ii][jj] = d[4][i][j]; d[7][ii][n - jj - 1] = d[6][ii][jj];
  53. }
  54. }
  55. for (int i = 0;i<8;i++) {
  56. for (int ii = 0;ii<n;ii++) {
  57. for (int jj = 0;jj<n;jj++)
  58. cout<<b[i][ii][jj]<<" ";
  59. cout<<endl;
  60. }
  61. cout<<endl<<endl;
  62. }
  63. /*for (int i = 0;i<8;i++) {
  64. bool f;
  65. for (int j = 0;j<8;j++) {
  66. for (int k = 0;k<8;k++) {
  67. for (int l = 0;l<8;l++) {
  68. int s;
  69.  
  70. //Start
  71. f = false;
  72. s = 0;
  73. if (a[i][n-1][n-1] > 0)s++; if (b[j][n-1][0] > 0)s++; if (c[k][0][n-1] > 0)s++; if (d[l][0][0] > 0)s++;
  74. if (s == 1)f = true;
  75. if (f == true) {
  76. f = true;
  77. for (int ii = 0;ii<n;ii++) {
  78. if (a[i][ii][n-1] && b[j][ii][0]) {f = false;break;}
  79. }
  80. if (f == true) {
  81. for (int ii = 0;ii<n;ii++) {
  82. if (c[k][ii][n-1] && d[l][ii][0]) {f = false;break;}
  83. }
  84. if (f == true) {
  85. for (int ii = 0;ii<n;ii++) {
  86. if (a[i][n-1][ii] && c[k][0][ii]) {f = false;break;}
  87. }
  88. if (f == true) {
  89. for (int ii = 0;ii<n;ii++) {
  90. if (b[j][n-1][ii] && d[l][0][ii]) {f = false;break;}
  91. }
  92. if (f == true) {
  93. for (int ii = 0;ii<n-1;ii++) {
  94. for (int jj = 0;jj<n-1;jj++) {
  95. if (a[i][ii][jj] == 0) {f = false;break;}
  96. }
  97. if (!f)break;
  98. }
  99. if (f == true) {
  100. for (int ii = 0;ii<n-1;ii++) {
  101. for (int jj = 1;jj<n;jj++) {
  102. if (b[j][ii][jj] == 0) {f = false;break;}
  103. }
  104. if (!f)break;
  105. }
  106. if (f == true) {
  107. for (int ii = 1;ii<n;ii++) {
  108. for (int jj = 0;jj<n-1;jj++) {
  109. if (c[k][ii][jj] == 0) {f = false;break;}
  110. }
  111. if (!f)break;
  112. }
  113. if (f == true) {
  114. for (int ii = 1;ii<n;ii++) {
  115. for (int jj = 1;jj<n;jj++) {
  116. if (c[l][ii][jj] == 0) {f = false;break;}
  117. }
  118. if (!f)break;
  119. }
  120. if (f == true) {
  121.  
  122. for (int ii = 0;ii<n-1;ii++) {
  123. for (int jj = 0;jj<2*n-1;jj++) {
  124. if (jj < n-1)cout<<a[i][ii][jj]<<" ";
  125. else if (jj == n-1)cout<<a[i][ii][jj]+b[j][ii][0]<<" ";
  126. else cout<<b[j][ii][jj - n + 1]<<" ";
  127. }
  128. cout<<endl;
  129. }
  130. for (int jj = 0;jj<2*n-1;jj++) {
  131. if (jj == n - 1)cout<<a[i][n-1][n-1] + b[j][n-1][0] + c[k][0][n-1] + d[l][0][0]<<" ";
  132. else if (jj < n - 1)cout<<a[i][n-1][jj] + c[j][0][jj]<<" ";
  133. else cout<<b[j][n-1][jj - n + 1] + d[l][0][jj - n + 1]<<" ";
  134. }
  135. cout<<endl;
  136. for (int ii = 1;ii<n;ii++) {
  137. for (int jj = 0;jj<2*n-1;jj++) {
  138. if (jj == n - 1)cout<<c[k][ii][jj] + d[l][ii][jj - n + 1]<<" ";
  139. else if (jj < n - 1)cout<<c[k][ii][jj]<<" ";
  140. else cout<<d[l][ii][jj - n + 1]<<" ";
  141. }
  142. cout<<endl;
  143. }
  144. return 0;
  145. }
  146. }
  147. }
  148. }
  149. }
  150. }
  151. }
  152. }
  153. }
  154. //Finish
  155. }
  156. }
  157. }
  158. } */
  159. return 0;
  160. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!