Submission #40216573


Source Code Expand

#[allow(unused_imports)]
use petgraph::unionfind::UnionFind;
#[allow(unused_imports)]
use proconio::{fastout, input, marker::Chars, marker::Usize1};
#[allow(unused_imports)]
use std::collections::{BTreeSet, HashSet, VecDeque};

#[fastout]
fn main() {
    input! {
        s:[Chars;8],
    }
    let mut x: char = 'A';
    let mut y: usize = 0;
    for i in 0..8 {
        for j in 0..8 {
            if s[i][j] == '*' {
                y = 8 - i - 1;
                x = (j as u8 + 'a' as u8) as char;
            }
        }
    }
    println!("{}{}", x as char, y + 1);
}

Submission Info

Submission Time
Task B - Chessboard
User sou31415
Language Rust (1.42.0)
Score 200
Code Size 574 Byte
Status AC
Exec Time 8 ms
Memory 2100 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
random_01.txt AC 8 ms 2048 KiB
random_02.txt AC 3 ms 1920 KiB
random_03.txt AC 2 ms 2100 KiB
random_04.txt AC 2 ms 1964 KiB
random_05.txt AC 2 ms 2028 KiB
random_06.txt AC 2 ms 1996 KiB
random_07.txt AC 2 ms 2016 KiB
random_08.txt AC 2 ms 1908 KiB
sample_01.txt AC 2 ms 2068 KiB
sample_02.txt AC 2 ms 1968 KiB