Submission #1800734
Source Code Expand
fn main() { let n = get::val::<usize>(); let s = "DiscoPresentsDiscoveryChannelProgrammingContest2016"; let mut i = 0; while i < 51 { println!("{}", &s[i .. std::cmp::min(51, i+n)]); i += n } } #[allow(dead_code)] mod put { use std::string::*; pub fn vec<T: ToString>(vec: &Vec<T>, sep: &str) { let out = vec.iter().map(|e| e.to_string()).collect::<Vec<_>>().as_slice().join(sep); println!("{}", out); } pub fn mat<T: ToString>(mat: &Vec<Vec<T>>, sep: &str) { for v in mat { vec(v, sep); } } } #[allow(dead_code)] mod get { use std::io::*; use std::str::*; pub fn val<T: FromStr>() -> T { let mut buf = String::new(); let s = stdin(); s.lock().read_line(&mut buf).ok(); buf.trim_right().parse::<T>().ok().unwrap() } pub fn vals<T: FromStr>(n: usize) -> Vec<T> { let mut vec: Vec<T> = vec![]; for _ in 0 .. n { vec.push(val()); } vec } pub fn tuple<T1: FromStr, T2: FromStr>() -> (T1, T2) { let mut buf = String::new(); let s = stdin(); s.lock().read_line(&mut buf).ok(); let mut it = buf.trim_right().split_whitespace(); let x = it.next().unwrap().parse::<T1>().ok().unwrap(); let y = it.next().unwrap().parse::<T2>().ok().unwrap(); (x, y) } pub fn tuples<T1: FromStr, T2: FromStr>(n: usize) -> Vec<(T1, T2)> { let mut vec: Vec<(T1, T2)> = vec![]; for _ in 0 .. n { vec.push(tuple()); } vec } pub fn tuple3<T1: FromStr, T2: FromStr, T3: FromStr>() -> (T1, T2, T3) { let mut buf = String::new(); let s = stdin(); s.lock().read_line(&mut buf).ok(); let mut it = buf.trim_right().split_whitespace(); let x = it.next().unwrap().parse::<T1>().ok().unwrap(); let y = it.next().unwrap().parse::<T2>().ok().unwrap(); let z = it.next().unwrap().parse::<T3>().ok().unwrap(); (x, y, z) } pub fn tuple3s<T1: FromStr, T2: FromStr, T3: FromStr>(n: usize) -> Vec<(T1, T2, T3)> { let mut vec: Vec<(T1, T2, T3)> = vec![]; for _ in 0 .. n { vec.push(tuple3()); } vec } pub fn list<T: FromStr>() -> Vec<T> { let mut buf = String::new(); let s = stdin(); s.lock().read_line(&mut buf).ok(); buf.trim_right().split_whitespace().map(|t| t.parse::<T>().ok().unwrap()).collect() } pub fn lists<T: FromStr>(h: usize) -> Vec<Vec<T>> { let mut mat: Vec<Vec<T>> = vec![]; for _ in 0 .. h { mat.push(list()); } mat } pub fn chars() -> Vec<char> { let mut buf = String::new(); let s = stdin(); s.lock().read_line(&mut buf).ok(); buf.trim_right().chars().collect() } }
Submission Info
Submission Time | |
---|---|
Task | A - DISCO presents ディスカバリーチャンネルプログラミングコンテスト 2016 |
User | aimy |
Language | Rust (1.15.1) |
Score | 100 |
Code Size | 2746 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 4352 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_01.txt, example_02.txt, example_03.txt |
All | example_01.txt, example_02.txt, example_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_01.txt | AC | 2 ms | 4352 KB |
example_02.txt | AC | 2 ms | 4352 KB |
example_03.txt | AC | 2 ms | 4352 KB |
test_01.txt | AC | 2 ms | 4352 KB |
test_02.txt | AC | 2 ms | 4352 KB |
test_03.txt | AC | 2 ms | 4352 KB |
test_04.txt | AC | 2 ms | 4352 KB |
test_05.txt | AC | 2 ms | 4352 KB |
test_06.txt | AC | 2 ms | 4352 KB |
test_07.txt | AC | 2 ms | 4352 KB |
test_08.txt | AC | 2 ms | 4352 KB |
test_09.txt | AC | 2 ms | 4352 KB |
test_10.txt | AC | 2 ms | 4352 KB |
test_11.txt | AC | 2 ms | 4352 KB |
test_12.txt | AC | 2 ms | 4352 KB |
test_13.txt | AC | 2 ms | 4352 KB |
test_14.txt | AC | 2 ms | 4352 KB |
test_15.txt | AC | 2 ms | 4352 KB |
test_16.txt | AC | 2 ms | 4352 KB |
test_18.txt | AC | 2 ms | 4352 KB |
test_19.txt | AC | 2 ms | 4352 KB |
test_20.txt | AC | 2 ms | 4352 KB |
test_21.txt | AC | 2 ms | 4352 KB |
test_22.txt | AC | 2 ms | 4352 KB |
test_23.txt | AC | 2 ms | 4352 KB |
test_24.txt | AC | 2 ms | 4352 KB |
test_25.txt | AC | 2 ms | 4352 KB |
test_26.txt | AC | 2 ms | 4352 KB |
test_27.txt | AC | 2 ms | 4352 KB |
test_28.txt | AC | 2 ms | 4352 KB |
test_29.txt | AC | 2 ms | 4352 KB |
test_30.txt | AC | 2 ms | 4352 KB |
test_31.txt | AC | 2 ms | 4352 KB |
test_32.txt | AC | 2 ms | 4352 KB |
test_33.txt | AC | 2 ms | 4352 KB |
test_34.txt | AC | 2 ms | 4352 KB |
test_35.txt | AC | 2 ms | 4352 KB |
test_36.txt | AC | 2 ms | 4352 KB |
test_37.txt | AC | 2 ms | 4352 KB |
test_38.txt | AC | 2 ms | 4352 KB |
test_39.txt | AC | 2 ms | 4352 KB |
test_41.txt | AC | 2 ms | 4352 KB |
test_42.txt | AC | 2 ms | 4352 KB |
test_43.txt | AC | 2 ms | 4352 KB |
test_44.txt | AC | 2 ms | 4352 KB |
test_45.txt | AC | 2 ms | 4352 KB |
test_46.txt | AC | 2 ms | 4352 KB |
test_47.txt | AC | 2 ms | 4352 KB |
test_48.txt | AC | 2 ms | 4352 KB |
test_49.txt | AC | 2 ms | 4352 KB |
test_50.txt | AC | 2 ms | 4352 KB |