목록Baekjoon (4)

IT’s Portfolio

[Algorithm] Baekjoon - 2차원 배열 단계

💻 Baekjoon Two Dimensional Array Stage Matrix Sum Question_Link - 2738 Basic Code use std::io::{self, *}; fn make_matrix(n: u32, m: &str) -> (Vec, Vec) { let mut v: Vec = Vec::new(); let mut iter = m.lines().skip(1); for _ in 0..iter.clone().count() as u32/n { let mut t: Vec = Vec::new(); (0..n).for_each(|_| { t.push(iter.next().unwrap().split_whitespace() .map(|y| y.parse::().unwrap()).collect:..
Development Study/Rust 2023. 8. 10. 18:21
[Algorithm] Baekjoon - 심화 1 단계

💻 Baekjoon Deepening 1 Stage Sprout Question_Link - 25083 Basic Code fn main(){ print!(r#" ,r'"7 r`-_ ,' ,/ \. ". L_r' `~\/ | |"#); } King, Queen, Rook, Bishop, Knight, Pawn Question_Link - 3003 Basic Code use std::io; fn main() { const P: [i32; 6] = [1, 1, 2, 2, 2, 8]; let mut buf = String::new(); io::stdin().read_line(&mut buf).unwrap(); for (i, v) in buf.split_whitespace().map(|x|..
Development Study/Rust 2023. 8. 3. 22:53
[Algorithm] Baekjoon - 문자열 단계

💻 Baekjoon String Stage Character & String Question_Link - 27866 Basic Code use std::io::{self, Read}; fn main() { let mut buf = String::new(); io::stdin().read_to_string(&mut buf).unwrap(); let mut iter = buf.lines(); let s = String::from(iter.next().unwrap()); let i = iter.next().unwrap().parse::().unwrap(); println!("{}", &s[i-1..i]); } Measure Word Length Question_Link - 2743 Basic Code use ..
Development Study/Rust 2023. 7. 31. 18:45
[Algorithm] Baekjoon - 1차원 배열 단계

💻 Baekjoon One Dimensional Array Stage Count Number Question_Link - 10807 Basic Code use std::io; fn input() -> String { let mut buf = String::new(); io::stdin().read_line(&mut buf).unwrap(); buf.pop(); buf } fn main() { let mut n: Vec = Vec::new(); let mut v = 0; (0..3).for_each( |x| { let s = input(); if x==1 { n = s.split(" ").map( |y| y.parse().unwrap() ).collect(); } else if x==2 { v = s.pa..
Development Study/Rust 2023. 7. 13. 23:11
Prev 1 Next