#981419 (Rust) No.2751 429-like Number

• 問題: No.2751 429-like Number
• ユーザー: Yukino DX.
• 提出日時: 2024-05-13 18:29:53
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 1,026 ms / 4,000 ms
• コード長: 3,338 bytes
• コンパイル時間: 12,957 ms
• コンパイル使用メモリ: 406,164 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-05-13 18:30:17
• 合計ジャッジ時間: 23,705 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	3 ms; 6,940 KB
testcase_07	AC	373 ms; 6,944 KB
testcase_08	AC	395 ms; 6,940 KB
testcase_09	AC	373 ms; 6,940 KB
testcase_10	AC	1,026 ms; 6,940 KB
testcase_11	AC	383 ms; 6,944 KB
testcase_12	AC	421 ms; 6,944 KB
testcase_13	AC	400 ms; 6,944 KB
testcase_14	AC	519 ms; 6,940 KB
testcase_15	AC	376 ms; 6,940 KB
testcase_16	AC	383 ms; 6,940 KB
testcase_17	AC	382 ms; 6,940 KB
testcase_18	AC	398 ms; 6,940 KB
testcase_19	AC	402 ms; 6,940 KB
testcase_20	AC	400 ms; 6,944 KB
testcase_21	AC	401 ms; 6,940 KB
testcase_22	AC	406 ms; 6,944 KB
testcase_23	AC	391 ms; 6,944 KB
testcase_24	AC	390 ms; 6,944 KB
testcase_25	AC	403 ms; 6,944 KB
testcase_26	AC	394 ms; 6,944 KB
testcase_27	AC	397 ms; 6,944 KB

ソースコード

use proconio::input;

fn main() {
    input! {
        q:usize,
        a:[usize;q],
    }
    const N: usize = 100000;

    let primes = eratosthenes_sieve(N);
    for mut ai in a {
        let mut p = 0;
        for &prime in primes.iter() {
            while ai % prime == 0 {
                ai /= prime;
                p += 1;
            }
        }
        if ai != 1 {
            p += 1;
        }

        let ans = p == 3;
        println!("{}", if ans { "Yes" } else { "No" });
    }
}

use math::*;
mod math {
    #[allow(dead_code)]
    pub fn pow(mut n: usize, mut e: usize, m: usize) -> usize {
        let mut res = 1;
        n %= m;
        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
        }
    }
}