結果

問題 No.1398 調和の魔法陣 (構築)
ユーザー shojin_pro
提出日時 2021-02-19 23:14:36
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 4,291 bytes
コンパイル時間 2,602 ms
コンパイル使用メモリ 79,032 KB
実行使用メモリ 44,828 KB
最終ジャッジ日時 2024-09-16 22:42:10
合計ジャッジ時間 33,330 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge6
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 12 WA * 16
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.util.*;
import java.io.*;
public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    public static void main(String[] args) throws Exception {
        int w = sc.nextInt();
        int h = sc.nextInt();
        int x = sc.nextInt();
        if(w % 3 == 0 && h % 3 == 0){
            pw.println(-1);
        }else{
            if(w == 2 && h == 2){
                if(x > 36){
                    pw.println(-1);
                }else{
                    for(int i = 0; i < h; i++){
                        for(int j = 0; j < w; j++){
                            pw.print(Math.min(9,x));
                            x -= Math.min(9,x);
                        }
                        pw.println();
                    }
                }
            }else{
                if(x > 36){
                    pw.println(-1);
                }else{
                    int[][] map = new int[3][3];
                    for(int i = 0; i < 2; i++){
                        for(int j = 0; j < 2; j++){
                            map[i][j] = Math.min(9,x);
                            x -= Math.min(9,x);
                        }
                    }
                    for(int i = 0; i < h; i++){
                        for(int j = 0; j < w; j++){
                            pw.print(map[i % 3][j % 3]);
                        }
                        pw.println();
                    }
                }
            }
        }
        pw.flush();
    }
    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }
        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }
        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }
        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }
    }
}
class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;
    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }
    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }
    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }
    public long nextLong() {
        return Long.parseLong(next());
    }
    public int nextInt() {
        return Integer.parseInt(next());
    }
    public double nextDouble() {
        return Double.parseDouble(next());
    }
    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }
    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }
    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0