Submission #39339659
Source Code Expand
use proconio::input; fn main() { input! { n: usize, }; let mut count = vec![vec![0_usize; 10]; 10]; for i in 1..=n { let chars = i.to_string().chars().collect::<Vec<char>>(); let first = (*chars.first().unwrap() as u8 - b'0') as usize; let last = (*chars.last().unwrap() as u8 - b'0') as usize; count[first][last] += 1; } let mut ans = 0_usize; for i in 0..=9 { for j in 0..=9 { ans += count[i][j] * count[j][i]; } } println!("{}", ans); }
Submission Info
Submission Time | |
---|---|
Task | D - Handstand 2 |
User | bouzuya |
Language | Rust (1.42.0) |
Score | 400 |
Code Size | 545 Byte |
Status | AC |
Exec Time | 35 ms |
Memory | 2188 KiB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt |
All | large_01.txt, large_02.txt, large_03.txt, large_04.txt, large_05.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, small_01.txt, small_02.txt, small_03.txt, small_04.txt, small_05.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
large_01.txt | AC | 35 ms | 2096 KiB |
large_02.txt | AC | 31 ms | 2100 KiB |
large_03.txt | AC | 27 ms | 2088 KiB |
large_04.txt | AC | 32 ms | 2004 KiB |
large_05.txt | AC | 27 ms | 2080 KiB |
sample_01.txt | AC | 4 ms | 1988 KiB |
sample_02.txt | AC | 1 ms | 2084 KiB |
sample_03.txt | AC | 1 ms | 2164 KiB |
sample_04.txt | AC | 1 ms | 2144 KiB |
sample_05.txt | AC | 32 ms | 2064 KiB |
small_01.txt | AC | 1 ms | 2172 KiB |
small_02.txt | AC | 2 ms | 2108 KiB |
small_03.txt | AC | 2 ms | 2036 KiB |
small_04.txt | AC | 2 ms | 2188 KiB |
small_05.txt | AC | 2 ms | 2084 KiB |