結果

問題 No.223 1マス指定の魔方陣
コンテスト
ユーザー uwi
提出日時 2015-06-05 22:33:38
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,704 bytes
コンパイル時間 3,972 ms
コンパイル使用メモリ 81,228 KB
実行使用メモリ 52,492 KB
最終ジャッジ日時 2024-07-06 14:20:02
合計ジャッジ時間 8,297 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 1
other AC * 2 WA * 24 RE * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q558 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[][] four = {
				{1, 2, 15, 16},
				{13, 14, 3, 4},
				{12, 7, 10, 5},
				{8, 11, 6, 9}
		};
		int[][] eight = new int[8][8];
		int[][] p = {
				{0, 3, 1, 2},
				{3, 0, 2, 1}
		};
		for(int i = 0;i < 8;i++){
			for(int j = 0;j < 8;j++){
				eight[i][j] = four[i%4][j%4] + p[i/4][j/2]*16;
			}
		}
		int[][] sixt = new int[16][16];
		for(int i = 0;i < 16;i++){
			for(int j = 0;j < 16;j++){
				sixt[i][j] = eight[i%8][j%8] + p[i/8][j/4]*64;
			}
		}
		int c = ni()-1, r = ni()-1, x = ni();
		
		int[][] magic = n == 4 ? four : n == 8 ? eight : sixt;
		
		int plus = x-four[r][c];
		if(plus < 0)plus += n*n;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				magic[i][j] += plus;
				if(magic[i][j] > n*n){
					magic[i][j] -= n*n;
				}
			}
		}
		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				if(j > 0)out.print(" ");
				out.print(magic[i][j]);
			}
			out.println();
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q558().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0