結果
問題 | No.2379 Burnside's Theorem |
ユーザー |
|
提出日時 | 2023-07-14 21:22:50 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 10 ms / 2,000 ms |
コード長 | 2,551 bytes |
コンパイル時間 | 12,812 ms |
コンパイル使用メモリ | 384,388 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-16 06:08:23 |
合計ジャッジ時間 | 13,334 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 20 |
ソースコード
pub mod prime_factorization {pub fn prime_factorization(n: usize) -> std::collections::BTreeMap<usize, usize> {let mut res = std::collections::BTreeMap::<usize, usize>::new();if n < 2 {return res;}let mut rem = n;{let mut i = 2;while i * i <= rem {while rem % i == 0 {*res.entry(i).or_insert(0) += 1;rem /= i;}i += 1;}}if rem > 1 {*res.entry(rem).or_insert(0) += 1;}res}pub fn divisors(n: usize) -> Vec<usize> {let mut res = vec![];let mut i = 1;while i * i <= n {if n % i == 0 {res.push(i);let j = n / i;if i != j {res.push(j);}}i += 1;}res.sort();res}}pub mod scanner {pub struct Scanner {buf: Vec<String>,}impl Scanner {pub fn new() -> Self {Self { buf: vec![] }}pub fn new_from(source: &str) -> Self {let source = String::from(source);let buf = Self::split(source);Self { buf }}pub fn next<T: std::str::FromStr>(&mut self) -> T {loop {if let Some(x) = self.buf.pop() {return x.parse().ok().expect("");}let mut source = String::new();std::io::stdin().read_line(&mut source).expect("");self.buf = Self::split(source);}}fn split(source: String) -> Vec<String> {source.split_whitespace().rev().map(String::from).collect::<Vec<_>>()}}}use crate::{prime_factorization::prime_factorization, scanner::Scanner};use std::io::Write;fn main() {let mut scanner = Scanner::new();let out = std::io::stdout();let mut out = std::io::BufWriter::new(out.lock());let t: usize = 1;for _ in 0..t {solve(&mut scanner, &mut out);}}fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {let n: usize = scanner.next();let pf = prime_factorization(n);if pf.len() <= 2 {writeln!(out, "Yes").unwrap();} else {writeln!(out, "No").unwrap();}}