Submission #3810693


Source Code Expand

use std::collections::HashSet;

fn main() {
    let mut set = HashSet::<i32>::new();

    let n = read::<i32>();
    for _ in 0..n {
        set.insert(read::<i32>());
    }

    println!("{}", set.len());
}

#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().split_whitespace()
        .map(|e| e.parse().ok().unwrap()).collect()
}

Submission Info

Submission Time
Task B - Kagami Mochi
User cat12079801
Language Rust (1.15.1)
Score 200
Code Size 637 Byte
Status AC
Exec Time 2 ms
Memory 4352 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 13
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13
Case Name Status Exec Time Memory
a01 AC 2 ms 4352 KB
a02 AC 2 ms 4352 KB
a03 AC 2 ms 4352 KB
b04 AC 2 ms 4352 KB
b05 AC 2 ms 4352 KB
b06 AC 2 ms 4352 KB
b07 AC 2 ms 4352 KB
b08 AC 2 ms 4352 KB
b09 AC 2 ms 4352 KB
b10 AC 2 ms 4352 KB
b11 AC 2 ms 4352 KB
b12 AC 2 ms 4352 KB
b13 AC 2 ms 4352 KB