fork download
copy 
  1. import java.io.*;
  2. import java.math.BigInteger;
  3.  
  4. public class Main
  5. {
  6.    public static void main(String[] args) throws IOException
  7.    {
  8.       new Main().run();
  9.    }
  10.  
  11.    BufferedReader in;
  12.    StreamTokenizer st;
  13.    PrintWriter out;
  14.  
  15.    double nextDouble() throws IOException
  16.    {
  17.        st.nextToken();
  18. 	   return (double)st.nval;
  19.    }
  20.  
  21.    String nextString() throws IOException
  22.    {
  23.       st.nextToken();
  24.       return (String)st.sval;
  25.    }
  26.  
  27.    int nextInt() throws IOException
  28.    {
  29.       st.nextToken();
  30.       return (int)st.nval;
  31.    }
  32.  
  33.    long nextLong() throws IOException
  34.    {
  35. 	   st.nextToken();
  36. 	   return (long)st.nval;
  37.    }
  38.  
  39.  
  40.    void run() throws IOException
  41.    {
  42.       in = new BufferedReader(new InputStreamReader(System.in));
  43.       st = new StreamTokenizer(in);
  44.       out = new PrintWriter(new OutputStreamWriter(System.out));
  45.       solve();
  46.       out.flush();
  47.    }
  48.  
  49.    void solve() throws IOException
  50.    {
  51. 	   int n = nextInt();
  52. 	   if (n % 4 == 2 || n % 4 == 3){
  53. 		   out.print(-1);
  54. 		   return;
  55. 	   }
  56. 	   if (n == 1){
  57. 		   out.println(1);
  58. 		   out.println(2);
  59. 		   out.println(3);
  60. 		   return;
  61. 	   }
  62. 	   if (n == 4){
  63. 		   out.println("4 2 3 1");
  64. 		   out.println("8 9 7 5");
  65. 		   out.println("12 11 10 6");
  66. 		   return;
  67. 	   }
  68. 	   if (n == 5){
  69. 		   out.println("7 3 4 2 1");
  70. 		   out.println("8 11 9 10 5");
  71. 		   out.println("15 14 13 12 6");
  72. 		   return;
  73. 	   }
  74. 	   if (n == 8){
  75. 		   out.println("8 6 4 2 7 1 5 3");
  76. 		   out.println("16 17 18 19 13 10 9 12");
  77. 		   out.println("24 23 22 21 20 11 14 15");
  78. 		   return;
  79. 	   }
  80. 	   if (n % 4 == 0){
  81. 		   int[] mas1 = new int[n];
  82. 		   int[] mas2 = new int[n];
  83. 		   int[] mas3 = new int[n];
  84. 		   int k = n / 4;
  85. 		   for (int i = 0; i < 2 * k; i++){
  86. 			   mas3[i] = 12 * k - i;
  87. 			   mas2[i] = 8 * k + i;
  88. 			   mas1[i] = mas3[i] - mas2[i];
  89. 		   }
  90. 		   for (int i=1; i<k; i++){
  91. 			   mas3[i + 2 * k - 1] = 8 * k - i - 1;
  92. 			   mas2[i + 2 * k - 1] = 4 * k + i;
  93. 			   mas1[i + 2 * k - 1] = mas3[i + 2 * k - 1] - mas2[i + 2 * k - 1];
  94. 		   }
  95. 		   for (int i=0; i<k - 2; i++){
  96. 			   mas3[3 * k - 1 + i] = 7 * k - 1 - i;
  97. 			   mas2[3 * k - 1 + i] = 5 * k + 2 + i;
  98. 			   mas1[3 * k - 1 + i] = mas3[3 * k - 1 + i] - mas2[3 * k - 1 + i];
  99. 		   }
  100. 		   mas3[n - 3] = 10 * k;
  101. 		   mas3[n - 2] = 8 * k - 1;
  102. 		   mas3[n - 1] = 5 * k + 1;
  103. 		   mas2[n - 3] = 6 * k + 1;
  104. 		   mas2[n - 2] = 6 * k;
  105. 		   mas2[n - 1] = 5 * k;
  106. 		   mas1[n - 3] = 4 * k - 1;
  107. 		   mas1[n - 2] = 2 * k - 1;
  108. 		   mas1[n - 1] = 1;
  109. 		   for (int i=0; i<n; i++){
  110. 			   out.print(mas1[i] + " ");
  111. 		   }
  112. 		   out.println();
  113. 		   for (int i=0; i<n; i++){
  114. 			   out.print(mas2[i] + " ");
  115. 		   }
  116. 		   out.println();
  117. 		   for (int i=0; i<n; i++){
  118. 			   out.print(mas3[i] + " ");
  119. 		   }
  120. 		   return;
  121. 	   }
  122. 	   if (n % 4 == 1){
  123. 		   int[] mas1 = new int[n];
  124. 		   int[] mas2 = new int[n];
  125. 		   int[] mas3 = new int[n];
  126. 		   int k = n / 4;
  127. 		   for (int i = 0; i < 2 * k; i++){
  128. 			   mas3[i] = 12 * k + 3 - i;
  129. 			   mas2[i] = 8 * k + 3 + i;
  130. 			   mas1[i] = mas3[i] - mas2[i];
  131. 		   }
  132. 		   for (int i=1; i<=k; i++){
  133. 			   mas3[i + 2 * k - 1] = 8 * k - i + 2;
  134. 			   mas2[i + 2 * k - 1] = 4 * k + i + 1;
  135. 			   mas1[i + 2 * k - 1] = mas3[i + 2 * k - 1] - mas2[i + 2 * k - 1];
  136. 		   }
  137. 		   for (int i=1; i<k - 1; i++){
  138. 			   mas3[3 * k + i - 1] = 7 * k + 2 - i;
  139. 			   mas2[3 * k + i - 1] = 5 * k + 3 + i;
  140. 			   mas1[3 * k + i - 1] = mas3[3 * k - 1 + i] - mas2[3 * k - 1 + i];
  141. 		   }
  142. 		   mas3[n - 3] = 10 * k + 3;
  143. 		   mas3[n - 2] = 8 * k + 2;
  144. 		   mas3[n - 1] = 5 * k + 3;
  145. 		   mas2[n - 3] = 6 * k + 2;
  146. 		   mas2[n - 2] = 6 * k + 3;
  147. 		   mas2[n - 1] = 5 * k + 2;
  148. 		   mas1[n - 3] = 4 * k + 1;
  149. 		   mas1[n - 2] = 2 * k - 1;
  150. 		   mas1[n - 1] = 1;
  151. 		   for (int i=0; i<n; i++){
  152. 			   out.print(mas1[i] + " ");
  153. 		   }
  154. 		   out.println();
  155. 		   for (int i=0; i<n; i++){
  156. 			   out.print(mas2[i] + " ");
  157. 		   }
  158. 		   out.println();
  159. 		   for (int i=0; i<n; i++){
  160. 			   out.print(mas3[i] + " ");
  161. 		   }
  162. 		   return;
  163. 	   }
  164.    }
  165.  
  166. }
Not running #stdin #stdout 0s 0KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/aVyn1E
language:
Java (12.0.1)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!