提出 #71662107

---

ソースコード 拡げる

fn main() {
    input! {
        n: usize,
    }

    let mut map = vec![vec![0; n]; n];

    let mut r = 0;
    let mut c = (n - 1) / 2;
    let mut k = 1;
    map[r][c] = k;

    for _ in 0..n * n - 1 {
        if map[(r + n - 1) % n][(c + 1) % n] == 0 {
            map[(r + n - 1) % n][(c + 1) % n] = k + 1;
            r = (r + n - 1) % n;
            c = (c + 1) % n;
            k += 1;
        } else {
            map[(r + 1) % n][c] = k + 1;
            r = (r + 1) % n;
            k += 1;
        }
    }

    for row in &map {
        println!("{}", row.iter().join(" "));
    }
}

#[allow(unused_imports)]
use itertools::Itertools;
#[allow(unused_imports)]
use proconio::{input, marker::*};
#[allow(unused_imports)]
use std::{cmp::Reverse, collections::*};

提出情報

ジャッジ結果