From 1516d87274cbe0366a35bb71d7a482d752651635 Mon Sep 17 00:00:00 2001
From: koba-e964 <3303362+koba-e964@users.noreply.github.com>
Date: Mon, 17 Jun 2024 10:09:59 +0900
Subject: [PATCH] Add atcoder/abc358/a.rs atcoder/abc358/b.rs
 atcoder/abc358/c.rs atcoder/abc358/d.rs atcoder/abc358/e.rs
 atcoder/abc358/remain.txt

---
 atcoder/abc358/a.rs       |  10 +++
 atcoder/abc358/b.rs       |  36 ++++++++
 atcoder/abc358/c.rs       |  51 +++++++++++
 atcoder/abc358/d.rs       |  42 +++++++++
 atcoder/abc358/e.rs       | 174 ++++++++++++++++++++++++++++++++++++++
 atcoder/abc358/remain.txt |   2 +
 6 files changed, 315 insertions(+)
 create mode 100644 atcoder/abc358/a.rs
 create mode 100644 atcoder/abc358/b.rs
 create mode 100644 atcoder/abc358/c.rs
 create mode 100644 atcoder/abc358/d.rs
 create mode 100644 atcoder/abc358/e.rs
 create mode 100644 atcoder/abc358/remain.txt

diff --git a/atcoder/abc358/a.rs b/atcoder/abc358/a.rs
new file mode 100644
index 00000000..1cee764f
--- /dev/null
+++ b/atcoder/abc358/a.rs
@@ -0,0 +1,10 @@
+fn getline() -> String {
+    let mut ret = String::new();
+    std::io::stdin().read_line(&mut ret).ok().unwrap();
+    ret
+}
+
+fn main() {
+    let s = getline();
+    println!("{}", if s == "AtCoder Land\n" { "Yes" } else { "No" });
+}
diff --git a/atcoder/abc358/b.rs b/atcoder/abc358/b.rs
new file mode 100644
index 00000000..9d6c51dc
--- /dev/null
+++ b/atcoder/abc358/b.rs
@@ -0,0 +1,36 @@
+use std::io::Read;
+
+fn get_word() -> String {
+    let stdin = std::io::stdin();
+    let mut stdin=stdin.lock();
+    let mut u8b: [u8; 1] = [0];
+    loop {
+        let mut buf: Vec<u8> = Vec::with_capacity(16);
+        loop {
+            let res = stdin.read(&mut u8b);
+            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
+                break;
+            } else {
+                buf.push(u8b[0]);
+            }
+        }
+        if buf.len() >= 1 {
+            let ret = String::from_utf8(buf).unwrap();
+            return ret;
+        }
+    }
+}
+
+fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }
+
+fn main() {
+    let n: i32 = get();
+    let a: i32 = get();
+    let mut last = 0;
+    for _ in 0..n {
+        let x: i32 = get();
+        let x = x.max(last);
+        last = x + a;
+        println!("{}", last);
+    }
+}
diff --git a/atcoder/abc358/c.rs b/atcoder/abc358/c.rs
new file mode 100644
index 00000000..94b9c820
--- /dev/null
+++ b/atcoder/abc358/c.rs
@@ -0,0 +1,51 @@
+use std::io::Read;
+
+fn get_word() -> String {
+    let stdin = std::io::stdin();
+    let mut stdin=stdin.lock();
+    let mut u8b: [u8; 1] = [0];
+    loop {
+        let mut buf: Vec<u8> = Vec::with_capacity(16);
+        loop {
+            let res = stdin.read(&mut u8b);
+            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
+                break;
+            } else {
+                buf.push(u8b[0]);
+            }
+        }
+        if buf.len() >= 1 {
+            let ret = String::from_utf8(buf).unwrap();
+            return ret;
+        }
+    }
+}
+
+fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }
+
+fn main() {
+    let n: usize = get();
+    let m: i32 = get();
+    let mut s = vec![0; n];
+    for i in 0..n {
+        let c = get_word();
+        for (j, cc) in c.chars().enumerate() {
+            if cc == 'o' {
+                s[i] |= 1 << j;
+            }
+        }
+    }
+    let mut ans = n as u32;
+    for bits in 1usize..1 << n {
+        let mut x = 0;
+        for i in 0..n {
+            if bits >> i & 1 == 1 {
+                x |= s[i];
+            }
+        }
+        if x == (1 << m) - 1 {
+            ans = ans.min(bits.count_ones());
+        }
+    }
+    println!("{}", ans);
+}
diff --git a/atcoder/abc358/d.rs b/atcoder/abc358/d.rs
new file mode 100644
index 00000000..96a9acff
--- /dev/null
+++ b/atcoder/abc358/d.rs
@@ -0,0 +1,42 @@
+use std::io::Read;
+
+fn get_word() -> String {
+    let stdin = std::io::stdin();
+    let mut stdin=stdin.lock();
+    let mut u8b: [u8; 1] = [0];
+    loop {
+        let mut buf: Vec<u8> = Vec::with_capacity(16);
+        loop {
+            let res = stdin.read(&mut u8b);
+            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
+                break;
+            } else {
+                buf.push(u8b[0]);
+            }
+        }
+        if buf.len() >= 1 {
+            let ret = String::from_utf8(buf).unwrap();
+            return ret;
+        }
+    }
+}
+
+fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }
+
+fn main() {
+    let n: usize = get();
+    let m: usize = get();
+    let mut a: Vec<i64> = (0..n).map(|_| get()).collect();
+    let mut b: Vec<i64> = (0..m).map(|_| get()).collect();
+    a.sort();
+    b.sort();
+    let mut pos = 0;
+    let mut ans = 0;
+    for a in a {
+        if pos < m && a >= b[pos] {
+            pos += 1;
+            ans += a;
+        }
+    }
+    println!("{}", if pos < m { -1 } else { ans });
+}
diff --git a/atcoder/abc358/e.rs b/atcoder/abc358/e.rs
new file mode 100644
index 00000000..a37734a7
--- /dev/null
+++ b/atcoder/abc358/e.rs
@@ -0,0 +1,174 @@
+use std::io::Read;
+
+fn get_word() -> String {
+    let stdin = std::io::stdin();
+    let mut stdin=stdin.lock();
+    let mut u8b: [u8; 1] = [0];
+    loop {
+        let mut buf: Vec<u8> = Vec::with_capacity(16);
+        loop {
+            let res = stdin.read(&mut u8b);
+            if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
+                break;
+            } else {
+                buf.push(u8b[0]);
+            }
+        }
+        if buf.len() >= 1 {
+            let ret = String::from_utf8(buf).unwrap();
+            return ret;
+        }
+    }
+}
+
+fn get<T: std::str::FromStr>() -> T { get_word().parse().ok().unwrap() }
+
+/// Verified by https://atcoder.jp/contests/abc198/submissions/21774342
+mod mod_int {
+    use std::ops::*;
+    pub trait Mod: Copy { fn m() -> i64; }
+    #[derive(Copy, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)]
+    pub struct ModInt<M> { pub x: i64, phantom: ::std::marker::PhantomData<M> }
+    impl<M: Mod> ModInt<M> {
+        // x >= 0
+        pub fn new(x: i64) -> Self { ModInt::new_internal(x % M::m()) }
+        fn new_internal(x: i64) -> Self {
+            ModInt { x: x, phantom: ::std::marker::PhantomData }
+        }
+        pub fn pow(self, mut e: i64) -> Self {
+            debug_assert!(e >= 0);
+            let mut sum = ModInt::new_internal(1);
+            let mut cur = self;
+            while e > 0 {
+                if e % 2 != 0 { sum *= cur; }
+                cur *= cur;
+                e /= 2;
+            }
+            sum
+        }
+        #[allow(dead_code)]
+        pub fn inv(self) -> Self { self.pow(M::m() - 2) }
+    }
+    impl<M: Mod> Default for ModInt<M> {
+        fn default() -> Self { Self::new_internal(0) }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> Add<T> for ModInt<M> {
+        type Output = Self;
+        fn add(self, other: T) -> Self {
+            let other = other.into();
+            let mut sum = self.x + other.x;
+            if sum >= M::m() { sum -= M::m(); }
+            ModInt::new_internal(sum)
+        }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> Sub<T> for ModInt<M> {
+        type Output = Self;
+        fn sub(self, other: T) -> Self {
+            let other = other.into();
+            let mut sum = self.x - other.x;
+            if sum < 0 { sum += M::m(); }
+            ModInt::new_internal(sum)
+        }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> Mul<T> for ModInt<M> {
+        type Output = Self;
+        fn mul(self, other: T) -> Self { ModInt::new(self.x * other.into().x % M::m()) }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> AddAssign<T> for ModInt<M> {
+        fn add_assign(&mut self, other: T) { *self = *self + other; }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> SubAssign<T> for ModInt<M> {
+        fn sub_assign(&mut self, other: T) { *self = *self - other; }
+    }
+    impl<M: Mod, T: Into<ModInt<M>>> MulAssign<T> for ModInt<M> {
+        fn mul_assign(&mut self, other: T) { *self = *self * other; }
+    }
+    impl<M: Mod> Neg for ModInt<M> {
+        type Output = Self;
+        fn neg(self) -> Self { ModInt::new(0) - self }
+    }
+    impl<M> ::std::fmt::Display for ModInt<M> {
+        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
+            self.x.fmt(f)
+        }
+    }
+    impl<M: Mod> ::std::fmt::Debug for ModInt<M> {
+        fn fmt(&self, f: &mut ::std::fmt::Formatter) -> ::std::fmt::Result {
+            let (mut a, mut b, _) = red(self.x, M::m());
+            if b < 0 {
+                a = -a;
+                b = -b;
+            }
+            write!(f, "{}/{}", a, b)
+        }
+    }
+    impl<M: Mod> From<i64> for ModInt<M> {
+        fn from(x: i64) -> Self { Self::new(x) }
+    }
+    // Finds the simplest fraction x/y congruent to r mod p.
+    // The return value (x, y, z) satisfies x = y * r + z * p.
+    fn red(r: i64, p: i64) -> (i64, i64, i64) {
+        if r.abs() <= 10000 {
+            return (r, 1, 0);
+        }
+        let mut nxt_r = p % r;
+        let mut q = p / r;
+        if 2 * nxt_r >= r {
+            nxt_r -= r;
+            q += 1;
+        }
+        if 2 * nxt_r <= -r {
+            nxt_r += r;
+            q -= 1;
+        }
+        let (x, z, y) = red(nxt_r, r);
+        (x, y - q * z, z)
+    }
+} // mod mod_int
+
+macro_rules! define_mod {
+    ($struct_name: ident, $modulo: expr) => {
+        #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
+        pub struct $struct_name {}
+        impl mod_int::Mod for $struct_name { fn m() -> i64 { $modulo } }
+    }
+}
+const MOD: i64 = 998_244_353;
+define_mod!(P, MOD);
+type MInt = mod_int::ModInt<P>;
+
+// Depends on MInt.rs
+fn fact_init(w: usize) -> (Vec<MInt>, Vec<MInt>) {
+    let mut fac = vec![MInt::new(1); w];
+    let mut invfac = vec![0.into(); w];
+    for i in 1..w {
+        fac[i] = fac[i - 1] * i as i64;
+    }
+    invfac[w - 1] = fac[w - 1].inv();
+    for i in (0..w - 1).rev() {
+        invfac[i] = invfac[i + 1] * (i as i64 + 1);
+    }
+    (fac, invfac)
+}
+
+fn main() {
+    let k: usize = get();
+    let mut c = vec![0usize; 26];
+    let mut dp = vec![MInt::new(0); k + 1];
+    let (fac, invfac) = fact_init(k + 1);
+    dp[0] += 1;
+    for i in 0..26 {
+        c[i] = get();
+        for j in (1..k + 1).rev() {
+            for l in 1..=j.min(c[i]) {
+                let val = dp[j - l] * invfac[l];
+                dp[j] += val;
+            }
+        }
+    }
+    let mut tot = MInt::new(0);
+    for i in 1..k + 1 {
+        tot += dp[i] * fac[i];
+    }
+    println!("{}", tot);
+}
diff --git a/atcoder/abc358/remain.txt b/atcoder/abc358/remain.txt
new file mode 100644
index 00000000..ab713757
--- /dev/null
+++ b/atcoder/abc358/remain.txt
@@ -0,0 +1,2 @@
+f
+g