結果
| 問題 | No.2211 Frequency Table of GCD |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2023-02-10 23:43:37 |
| 言語 | Rust (1.77.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 655 ms / 2,000 ms |
| コード長 | 14,456 bytes |
| コンパイル時間 | 15,425 ms |
| コンパイル使用メモリ | 378,056 KB |
| 実行使用メモリ | 6,688 KB |
| 最終ジャッジ日時 | 2024-07-07 18:11:25 |
| 合計ジャッジ時間 | 20,395 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 7 ms
5,248 KB |
| testcase_01 | AC | 7 ms
5,376 KB |
| testcase_02 | AC | 7 ms
5,376 KB |
| testcase_03 | AC | 197 ms
5,376 KB |
| testcase_04 | AC | 242 ms
5,716 KB |
| testcase_05 | AC | 325 ms
6,284 KB |
| testcase_06 | AC | 256 ms
5,816 KB |
| testcase_07 | AC | 359 ms
6,524 KB |
| testcase_08 | AC | 15 ms
5,376 KB |
| testcase_09 | AC | 14 ms
5,376 KB |
| testcase_10 | AC | 27 ms
5,376 KB |
| testcase_11 | AC | 20 ms
5,376 KB |
| testcase_12 | AC | 30 ms
5,376 KB |
| testcase_13 | AC | 215 ms
5,720 KB |
| testcase_14 | AC | 271 ms
5,480 KB |
| testcase_15 | AC | 232 ms
5,376 KB |
| testcase_16 | AC | 256 ms
5,376 KB |
| testcase_17 | AC | 311 ms
6,320 KB |
| testcase_18 | AC | 460 ms
6,556 KB |
| testcase_19 | AC | 472 ms
6,560 KB |
| testcase_20 | AC | 459 ms
6,560 KB |
| testcase_21 | AC | 465 ms
6,560 KB |
| testcase_22 | AC | 473 ms
6,684 KB |
| testcase_23 | AC | 214 ms
5,376 KB |
| testcase_24 | AC | 654 ms
6,556 KB |
| testcase_25 | AC | 18 ms
5,528 KB |
| testcase_26 | AC | 7 ms
5,376 KB |
| testcase_27 | AC | 452 ms
6,644 KB |
| testcase_28 | AC | 655 ms
6,688 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type
--> src/main.rs:64:15
|
64 | fn readi() -> (i64) {
| ^ ^
|
= note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
|
64 - fn readi() -> (i64) {
64 + fn readi() -> i64 {
|
warning: unnecessary parentheses around assigned value
--> src/main.rs:296:19
|
296 | self.0 *= (rhs.0 % MOD);
| ^ ^
|
help: remove these parentheses
|
296 - self.0 *= (rhs.0 % MOD);
296 + self.0 *= rhs.0 % MOD;
|
warning: unnecessary parentheses around `for` iterator expression
--> src/main.rs:537:18
|
537 | for j in (2..202020) {
| ^ ^
|
help: remove these parentheses
|
537 - for j in (2..202020) {
537 + for j in 2..202020 {
|
warning: unused variable: `a2`
--> src/main.rs:453:18
|
453 | let (a2, e2) = self.mod_fact(k, p);
| ^^ help: if this is intentional, prefix it with an underscore: `_a2`
|
= note: `#[warn(unused_variables)]` on by default
warning: unused variable: `moi`
--> src/main.rs:458:21
|
458 | let moi = self.mod_inverse(a3 % p, p);
| ^^^ help: if this is intentional, prefix it with an underscore: `_moi`
warning: unused variable: `a2`
--> src/main.rs:478:18
|
478 | let (a2, e2) = self.mod_fact(k, p);
| ^^ help: if this is intentional, prefix it with an underscore: `_a2`
warning: unused variable: `a3`
--> src/main.rs:479:18
|
479 | let (a3, e3) = self.mod_fact(n - k, p);
| ^^ help: if this is intentional, prefix it with an underscore: `_a3`
warning: variable does not need to be mutable
--> src/main.rs:524:9
|
524 | let mut a: Vec<usize> = read_vec();
| ----^
| |
| help: remove this `mut`
|
= note: `#[warn(unu
ソースコード
// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
// const MOD: i64 = 1000000007;
const MOD: i64 = 998244353;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;
// const MOD: i64 = INF;
use cmp::Ordering::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;
macro_rules! p {
($x:expr) => {
println!("{}", $x);
};
}
macro_rules! d {
($x:expr) => {
println!("{:?}", $x);
};
}
#[allow(unused_macros)]
pub mod macros {
macro_rules! min { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); std::cmp::min($x, y) } }}
macro_rules! max { ($x: expr) => { $x }; ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); std::cmp::max($x, y) } }}
macro_rules! chmin { ($x: expr, $($xs: expr),+) => {{ let y = macros::min!($($xs),+); if $x > y { $x = y; true } else { false } }}}
macro_rules! chmax { ($x: expr, $($xs: expr),+) => {{ let y = macros::max!($($xs),+); if $x < y { $x = y; true } else { false } }}}
macro_rules! multi_vec { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_vec![$element; ($($lens),*)]; $len] ); ($element: expr; ($len: expr)) => ( vec![$element; $len] ); }
macro_rules! multi_box_array { ($element: expr; ($len: expr, $($lens: expr),*)) => ( vec![macros::multi_box_array![$element; ($($lens),*)]; $len].into_boxed_slice() ); ($element: expr; ($len: expr)) => ( vec![$element; $len].into_boxed_slice() ); }
#[allow(unused_imports)]
pub(super) use {chmax, chmin, max, min, multi_box_array, multi_vec};
}
use macros::*;
fn main() {
solve();
}
// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
let mut s = String::new();
std::io::stdin().read_line(&mut s).ok();
s.trim().parse().ok().unwrap()
}
#[allow(dead_code)]
fn readi() -> (i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
iter.next().unwrap().parse::<i64>().unwrap()
}
#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
read::<String>()
.split_whitespace()
.map(|e| e.parse().ok().unwrap())
.collect()
}
#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
(0..n).map(|_| read_vec()).collect()
}
#[allow(dead_code)]
fn readii() -> (i64, i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
)
}
#[allow(dead_code)]
fn readff() -> (f64, f64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<f64>().unwrap(),
iter.next().unwrap().parse::<f64>().unwrap(),
)
}
fn readcc() -> (char, char) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<char>().unwrap(),
iter.next().unwrap().parse::<char>().unwrap(),
)
}
fn readuuu() -> (usize, usize, usize) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
)
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
)
}
fn divisors(n: usize) -> Vec<usize> {
let mut divisors = Vec::new();
// n := i * x とおくと、 i が i > root(n) の時、 i はすでに ある x に探索されているから
// i <= root(n) まで探索すればよい
for i in 1..=(f64::sqrt(n as f64) + 1e-9) as usize {
// i で n が割り切れた場合
if n % i == 0 {
// 約数リストに格納
divisors.push(i);
// n := i * x の x を格納。ただし x := i の時は除く
if i != n / i {
divisors.push(n / i);
}
}
}
divisors.sort();
divisors
}
macro_rules! M {
(a :expr ) => {
M::new({ a })
};
}
#[derive(Copy, Clone, Debug)]
pub struct M(i64);
impl M {
fn new(x: i64) -> Self {
M(x.rem_euclid(MOD))
}
fn pow(self, n: usize) -> Self {
match n {
0 => M::new(1),
_ => {
let mut a = self.pow(n >> 1);
a *= a;
if n & 1 == 1 {
a *= self;
}
a
}
}
}
fn inv(self) -> Self {
self.pow((MOD - 2) as usize)
}
}
impl std::ops::Neg for M {
type Output = M;
fn neg(self) -> Self::Output {
Self::new(-self.0)
}
}
impl std::ops::AddAssign<M> for M {
fn add_assign(&mut self, rhs: Self) {
self.0 += rhs.0;
self.0 %= MOD;
}
}
impl std::ops::AddAssign<i64> for M {
fn add_assign(&mut self, rhs: i64) {
*self += M::new(rhs);
}
}
impl std::ops::AddAssign<usize> for M {
fn add_assign(&mut self, rhs: usize) {
*self += M::new(rhs as i64);
}
}
impl<T> std::ops::Add<T> for M
where
M: std::ops::AddAssign<T>,
{
type Output = Self;
fn add(self, other: T) -> Self {
let mut res = self;
res += other;
res
}
}
impl std::ops::SubAssign<M> for M {
fn sub_assign(&mut self, rhs: Self) {
self.0 -= rhs.0;
if self.0 < 0 {
self.0 %= MOD;
self.0 += MOD;
}
}
}
impl std::ops::SubAssign<i64> for M {
fn sub_assign(&mut self, rhs: i64) {
*self -= M::new(rhs);
if (*self).0 < 0 {
self.0 %= MOD;
self.0 += MOD;
}
}
}
impl std::ops::SubAssign<usize> for M {
fn sub_assign(&mut self, rhs: usize) {
*self -= M::new(rhs as i64);
if (*self).0 < 0 {
self.0 %= MOD;
self.0 += MOD;
}
}
}
impl<T> std::ops::Sub<T> for M
where
M: std::ops::SubAssign<T>,
{
type Output = Self;
fn sub(self, other: T) -> Self {
let mut res = self;
res -= other;
res
}
}
impl std::ops::MulAssign<M> for M {
fn mul_assign(&mut self, rhs: Self) {
self.0 %= MOD;
self.0 *= (rhs.0 % MOD);
self.0 %= MOD;
}
}
impl std::ops::MulAssign<i64> for M {
fn mul_assign(&mut self, rhs: i64) {
*self *= M::new(rhs);
}
}
impl std::ops::MulAssign<usize> for M {
fn mul_assign(&mut self, rhs: usize) {
*self *= M::new(rhs as i64);
}
}
impl<T> std::ops::Mul<T> for M
where
M: std::ops::MulAssign<T>,
{
type Output = Self;
fn mul(self, other: T) -> Self {
let mut res = self;
res *= other;
res
}
}
impl std::ops::DivAssign<M> for M {
fn div_assign(&mut self, rhs: Self) {
*self *= rhs.inv();
}
}
impl std::ops::DivAssign<i64> for M {
fn div_assign(&mut self, rhs: i64) {
*self /= M::new(rhs);
}
}
impl std::ops::DivAssign<usize> for M {
fn div_assign(&mut self, rhs: usize) {
*self /= M::new(rhs as i64);
}
}
impl<T> std::ops::Div<T> for M
where
M: std::ops::DivAssign<T>,
{
type Output = Self;
fn div(self, other: T) -> Self {
let mut res = self;
res /= other;
res
}
}
impl std::fmt::Display for M {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(f, "{}", self.0)
}
}
impl std::ops::Deref for M {
type Target = i64;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl std::ops::DerefMut for M {
fn deref_mut(&mut self) -> &mut Self::Target {
&mut self.0
}
}
#[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)]
/// (gcd, x, y)
pub fn extgcd(a: i64, b: i64) -> (i64, i64, i64) {
if b == 0 {
(a, 1, 0)
} else {
let (gcd, x, y) = extgcd(b, a % b);
(gcd, y, x - (a / b) * y)
}
}
#[allow(dead_code)]
/// x ^ n % m
pub fn mod_pow(x: usize, n: usize, m: usize) -> usize {
let mut res = 1;
let mut x = x % m;
let mut n = n;
while n > 0 {
if n & 1 == 1 {
res = (res * x) % m;
}
x = (x * x) % m;
n >>= 1;
}
res
}
pub struct Combination {
m: usize,
f_table: Vec<usize>,
moi: Vec<usize>,
}
impl Combination {
// 0 <= size <= 10^8 is constrained.
pub fn new(mod_num: usize, table_size: usize) -> Self {
Self {
m: mod_num,
f_table: vec![0; table_size],
moi: vec![0; 0],
}
}
pub fn build(&mut self) {
let size = self.f_table.len();
self.f_table = self.fact_table(size, self.m);
self.moi = self.fact_inv_table(size, self.m);
}
fn fact_table(&mut self, len: usize, m: usize) -> Vec<usize> {
let mut res = vec![1; len + 1];
for i in 2..len + 1 {
res[i] = (res[i - 1] * i) % m;
}
res
}
fn fact_inv_table(&mut self, len: usize, m: usize) -> Vec<usize> {
let mut res = vec![1; len + 1];
let mut inv = vec![1; len + 1];
//inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD
for i in 2..len {
inv[i] = (m - inv[m % i] * (m / i) % m) % m;
res[i] = inv[i] * res[i - 1];
// res[i] = self.mod_inverse(i, m) * res[i - 1];
// res[i] = 1;
res[i] %= m;
}
res
}
pub fn p(&mut self, n: usize, k: usize) -> i64 {
let p = MOD as usize;
if k == 0 {
return 1;
}
if n < k {
0
} else {
let (a1, e1) = self.mod_fact(n, p);
let (a2, e2) = self.mod_fact(k, p);
let (a3, e3) = self.mod_fact(n - k, p);
if e1 > e2 + e3 {
0
} else {
let moi = self.mod_inverse(a3 % p, p);
(a1 * self.mod_inverse(a3 % p, p) % p) as i64
}
}
}
pub fn c(&mut self, n: usize, k: usize) -> i64 {
let p = MOD as usize;
if n == 0 && k == 0 {
return 1;
}
if n == 0 {
return 0;
}
if k == 0 {
return 1;
}
if n < k {
0
} else {
let (a1, e1) = self.mod_fact(n, p);
let (a2, e2) = self.mod_fact(k, p);
let (a3, e3) = self.mod_fact(n - k, p);
if e1 > e2 + e3 {
0
} else {
(((a1 * &self.moi[k]) % p * &self.moi[n - k]) % p) as i64
}
}
}
pub fn h(&mut self, n: usize, k: usize) -> i64 {
return self.c(n + k - 1, k);
}
pub fn factorial(&mut self, n: usize) -> i64 {
return self.p(n, n);
}
fn extgcd(&mut self, a: i64, b: i64) -> (i64, i64, i64) {
if b == 0 {
(a, 1, 0)
} else {
let (gcd, x, y) = extgcd(b, a % b);
(gcd, y, x - (a / b) * y)
}
}
fn mod_inverse(&mut self, a: usize, m: usize) -> usize {
let (_, x, _) = self.extgcd(a as i64, m as i64);
((m as i64 + x) as usize % m) % m
}
fn mod_fact(&mut self, n: usize, p: usize) -> (usize, usize) {
if n == 0 {
(1, 0)
} else {
let (a, b) = self.mod_fact(n / p, p);
let pow = b + n / p;
if n / p % 2 != 0 {
(a * (p - self.f_table[(n % p) as usize]) % p, pow)
} else {
(a * self.f_table[(n % p) as usize] % p, pow)
}
}
}
}
fn solve() {
let (n, m) = readuu();
let mut a: Vec<usize> = read_vec();
let mut cnt = vec![0; 202020];
for i in 0..n {
let d = divisors(a[i]);
for j in 0..d.len() {
cnt[d[j]] += 1;
}
}
let mut res = vec![M(0); 202020];
for i in 0..202020 {
res[i] = M(2).pow(cnt[i]) - M(1);
}
for i in (1..202020).rev() {
for j in (2..202020) {
if i * j >= 202020 {
break;
}
res[i] = res[i] - res[i * j];
}
}
for i in 1..=m {
p!(res[i]);
}
return;
}