#966808 (Rust) No.2709 1975 Powers

• 問題: No.2709 1975 Powers
• ユーザー: Yukino DX.
• 提出日時: 2024-03-31 14:04:42
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 330 ms / 2,000 ms
• コード長: 5,242 bytes
• コンパイル時間: 1,035 ms
• コンパイル使用メモリ: 188,576 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-03-31 14:04:47
• 合計ジャッジ時間: 4,962 ms
• ジャッジサーバーID （参考情報）: judge11 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,676 KB
testcase_01	AC	1 ms; 6,676 KB
testcase_02	AC	3 ms; 6,676 KB
testcase_03	AC	156 ms; 6,676 KB
testcase_04	AC	283 ms; 6,676 KB
testcase_05	AC	175 ms; 6,676 KB
testcase_06	AC	55 ms; 6,676 KB
testcase_07	AC	1 ms; 6,676 KB
testcase_08	AC	51 ms; 6,676 KB
testcase_09	AC	176 ms; 6,676 KB
testcase_10	AC	1 ms; 6,676 KB
testcase_11	AC	5 ms; 6,676 KB
testcase_12	AC	14 ms; 6,676 KB
testcase_13	AC	184 ms; 6,676 KB
testcase_14	AC	26 ms; 6,676 KB
testcase_15	AC	30 ms; 6,676 KB
testcase_16	AC	139 ms; 6,676 KB
testcase_17	AC	1 ms; 6,676 KB
testcase_18	AC	18 ms; 6,676 KB
testcase_19	AC	270 ms; 6,676 KB
testcase_20	AC	2 ms; 6,676 KB
testcase_21	AC	49 ms; 6,676 KB
testcase_22	AC	305 ms; 6,676 KB
testcase_23	AC	305 ms; 6,676 KB
testcase_24	AC	330 ms; 6,676 KB
testcase_25	AC	305 ms; 6,676 KB
testcase_26	AC	306 ms; 6,676 KB

ソースコード

#![allow(unused_imports)]
//use itertools::{iproduct, Itertools};
//use proconio::input;
//use proconio::marker::*;
use std::collections::*;

fn main() {
    input! {
        n:usize,
        p:usize,
        q:usize,
        a:[usize;n],
    }

    let mut a = a;
    a.sort();
    let pow10 = a.iter().map(|&ai| pow(10, ai, p)).collect::<Vec<_>>();
    let pow9 = a.iter().map(|&ai| pow(9, ai, p)).collect::<Vec<_>>();
    let pow7 = a.iter().map(|&ai| pow(7, ai, p)).collect::<Vec<_>>();
    let pow5 = a.iter().map(|&ai| pow(5, ai, p)).collect::<Vec<_>>();

    let mut cnts = vec![0; p];
    for i in 0..n {
        cnts[pow5[i]] += 1;
    }

    let mut ans = 0usize;
    for a in 0..n {
        for b in a + 1..n {
            for c in b + 1..n {
                for d in c + 1..n {
                    if (pow10[a] + pow9[b] + pow7[c] + pow5[d]) % p == q {
                        ans += 1;
                    }
                }
            }
        }
    }

    println!("{}", ans);
}

use math::*;
mod math {
    #[allow(dead_code)]
    pub fn pow(mut n: usize, mut e: usize, m: usize) -> usize {
        let mut res = 1;
        while 0 < e {
            if e & 1 != 0 {
                res *= n;
                res %= m;
            }

            n *= n;
            n %= m;
            e >>= 1;
        }

        res
    }

    #[allow(dead_code)]
    pub fn gcd(a: usize, b: usize) -> usize {
        if b == 0 {
            a
        } else {
            gcd(b, a % b)
        }
    }

    #[allow(dead_code)]
    pub fn lcm(a: usize, b: usize) -> usize {
        a / gcd(a, b) * b
    }

    #[allow(dead_code)]
    pub fn prime_factor(mut n: usize) -> std::collections::HashMap<usize, usize> {
        let mut pfacs = std::collections::HashMap::new();
        for d in 2.. {
            if d * d > n {
                break;
            }

            while n % d == 0 {
                *pfacs.entry(d).or_insert(0) += 1;
                n /= d;
            }
        }
        if n != 1 {
            *pfacs.entry(n).or_insert(0) += 1;
        }

        pfacs
    }

    #[allow(dead_code)]
    pub fn divisors(n: usize) -> Vec<usize> {
        let mut divs = vec![];
        for d in (1..).take_while(|&d| d * d <= n) {
            if n % d == 0 {
                divs.push(d);
                if n / d != d {
                    divs.push(n / d);
                }
            }
        }

        divs
    }

    #[allow(dead_code)]
    pub fn eratosthenes_sieve(n: usize) -> Vec<usize> {
        let mut is_primes = vec![true; n + 1];
        is_primes[0] = false;
        is_primes[1] = false;
        let mut primes = vec![];

        for i in 2..=n {
            if !is_primes[i] {
                continue;
            }

            for j in (2 * i..=n).step_by(i) {
                is_primes[j] = false;
            }
        }

        for (val, is_prime) in is_primes.into_iter().enumerate() {
            if is_prime {
                primes.push(val);
            }
        }

        primes
    }

    #[allow(dead_code)]
    pub fn base_n(mut base10: usize, base: usize, len: usize) -> Vec<usize> {
        let mut base_n = vec![];
        for _ in 0..len {
            base_n.push(base10 % base);
            base10 /= base;
        }
        base_n.reverse();

        base_n
    }

    #[allow(dead_code)]
    pub fn div_floor(mut a: i64, mut b: i64) -> i64 {
        if b < 0 {
            a = -a;
            b = -b;
        }

        if a >= 0 {
            a / b
        } else {
            (a + 1) / b - 1
        }
    }

    #[allow(dead_code)]
    pub fn div_ceil(mut a: i64, mut b: i64) -> i64 {
        if b < 0 {
            a = -a;
            b = -b;
        }
        if a > 0 {
            (a - 1) / b + 1
        } else {
            a / b
        }
    }
}
use input::*;
mod input {
    #[macro_export]
    macro_rules! input {
        (source = $s:expr, $($r:tt)*) => {
            let mut iter = $s.split_whitespace();
            input_inner!{iter, $($r)*}
        };
        ($($r:tt)*) => {
            let s = {
                use std::io::Read;
                let mut s = String::new();
                std::io::stdin().read_to_string(&mut s).unwrap();
                s
            };
            let mut iter = s.split_whitespace();
            input_inner!{iter, $($r)*}
        };
    }

    #[macro_export]
    macro_rules! input_inner {
        ($iter:expr) => {};
        ($iter:expr, ) => {};

        ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
            let $var = read_value!($iter, $t);
            input_inner!{$iter $($r)*}
        };
    }

    #[macro_export]
    macro_rules! read_value {
        ($iter:expr, ( $($t:tt),* )) => {
            ( $(read_value!($iter, $t)),* )
        };

        ($iter:expr, [ $t:tt ; $len:expr ]) => {
            (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        };

        ($iter:expr, chars) => {
            read_value!($iter, String).chars().collect::<Vec<char>>()
        };

        ($iter:expr, usize1) => {
            read_value!($iter, usize) - 1
        };

        ($iter:expr, $t:ty) => {
            $iter.next().unwrap().parse::<$t>().expect("Parse error")
        };
    }
}