code-formula-2014-final

code-formula-2014-final/Cargo.toml

@@ -0,0 +1,14 @@
+[package]
+name = "code-formula-2014-final"
+version = "0.1.0"
+authors = ["bouzuya <m@bouzuya.net>"]
+edition = "2018"
+
+# dependencies added to new project
+[dependencies]
+proconio = { version = "=0.3.6", features = ["derive"] }
+superslice = "=1.0.0"
+
+[profile.release]
+lto = true
+panic = 'abort'

code-formula-2014-final/rust-toolchain

@@ -0,0 +1 @@
+1.42.0

code-formula-2014-final/src/bin/a.rs

@@ -0,0 +1,10 @@
+use proconio::input;
+
+fn main() {
+    input! {
+        a: i64,
+        b: i64,
+    };
+    let ans = a * b;
+    println!("{}", ans);
+}

code-formula-2014-final/src/bin/b.rs

@@ -0,0 +1,9 @@
+use proconio::input;
+
+fn main() {
+    input! {
+        n: usize,
+    };
+    let ans = n / 2 + if n % 2 == 0 { 0 } else { 3 };
+    println!("{}", ans);
+}

code-formula-2014-final/src/bin/c.rs

@@ -0,0 +1,63 @@
+use std::collections::BTreeSet;
+
+fn read<T: std::str::FromStr>(
+    stdin_lock: &mut std::io::StdinLock,
+    buf: &mut Vec<u8>,
+    delimiter: u8,
+) -> T {
+    buf.clear();
+    let _ = std::io::BufRead::read_until(stdin_lock, delimiter, buf).unwrap();
+    let s = unsafe { std::str::from_utf8_unchecked(&buf) };
+    s.parse().unwrap_or_else(|_| panic!("read"))
+}
+
+fn main() {
+    let stdin = std::io::stdin();
+    let mut stdin_lock = stdin.lock();
+    let mut buf: Vec<u8> = Vec::new();
+
+    let s: String = read(&mut stdin_lock, &mut buf, b'\n');
+    let s = s.trim_end().chars().collect::<Vec<char>>();
+
+    let mut set = BTreeSet::new();
+    let mut in_name = false;
+    let mut name = vec![];
+    for c in s.iter() {
+        match c {
+            '@' => {
+                if in_name {
+                    if !name.is_empty() {
+                        set.insert(name.into_iter().collect::<String>());
+                        name = vec![];
+                    }
+                }
+                in_name = true;
+            }
+            ' ' => {
+                if in_name {
+                    in_name = false;
+                    if !name.is_empty() {
+                        set.insert(name.into_iter().collect::<String>());
+                        name = vec![];
+                    }
+                }
+            }
+            'a'..='z' => {
+                if in_name {
+                    name.push(c);
+                }
+            }
+            _ => {
+                unreachable!();
+            }
+        }
+    }
+    if in_name {
+        if !name.is_empty() {
+            set.insert(name.into_iter().collect::<String>());
+        }
+    }
+    for s in set {
+        println!("{}", s);
+    }
+}

code-formula-2014-final/src/bin/d.rs

@@ -0,0 +1,11 @@
+use proconio::input;
+use proconio::marker::Usize1;
+
+fn main() {
+    input! {
+        n: usize,
+        a: [Usize1; n],
+    };
+    let ans = n - a.len();
+    println!("{}", ans);
+}

code-formula-2014-final/src/bin/e.rs

@@ -0,0 +1,11 @@
+use proconio::input;
+use proconio::marker::Usize1;
+
+fn main() {
+    input! {
+        n: usize,
+        a: [Usize1; n],
+    };
+    let ans = n - a.len();
+    println!("{}", ans);
+}

code-formula-2014-final/src/bin/f.rs

@@ -0,0 +1,11 @@
+use proconio::input;
+use proconio::marker::Usize1;
+
+fn main() {
+    input! {
+        n: usize,
+        a: [Usize1; n],
+    };
+    let ans = n - a.len();
+    println!("{}", ans);
+}

code-formula-2014-final/src/bin/g.rs

@@ -0,0 +1,11 @@
+use proconio::input;
+use proconio::marker::Usize1;
+
+fn main() {
+    input! {
+        n: usize,
+        a: [Usize1; n],
+    };
+    let ans = n - a.len();
+    println!("{}", ans);
+}

code-formula-2014-final/src/bin/h.rs

@@ -0,0 +1,11 @@
+use proconio::input;
+use proconio::marker::Usize1;
+
+fn main() {
+    input! {
+        n: usize,
+        a: [Usize1; n],
+    };
+    let ans = n - a.len();
+    println!("{}", ans);
+}