結果
問題 | No.1409 Simple Math in yukicoder |
ユーザー |
|
提出日時 | 2021-11-01 16:20:56 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 13 ms / 2,000 ms |
コード長 | 3,168 bytes |
コンパイル時間 | 15,546 ms |
コンパイル使用メモリ | 390,992 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-10 06:51:17 |
合計ジャッジ時間 | 41,393 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 58 |
ソースコード
#[allow(unused_imports)]use std::cmp::*;#[allow(unused_imports)]use std::collections::*;use std::io::{Write, BufWriter};// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_rules! input {($($r:tt)*) => {let stdin = std::io::stdin();let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));let mut next = move || -> String{bytes.by_ref().map(|r|r.unwrap() as char).skip_while(|c|c.is_whitespace()).take_while(|c|!c.is_whitespace()).collect()};input_inner!{next, $($r)*}};}macro_rules! input_inner {($next:expr) => {};($next:expr,) => {};($next:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($next, $t);input_inner!{$next $($r)*}};}macro_rules! read_value {($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };($next:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()};($next:expr, chars) => {read_value!($next, String).chars().collect::<Vec<char>>()};($next:expr, usize1) => (read_value!($next, usize) - 1);($next:expr, [ $t:tt ]) => {{let len = read_value!($next, usize);read_value!($next, [$t; len])}};($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));}trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }impl<T: PartialOrd> Change for T {fn chmax(&mut self, x: T) { if *self < x { *self = x; } }fn chmin(&mut self, x: T) { if *self > x { *self = x; } }}fn powmod(x: i64, mut e: i64, m: i64) -> i64 {let mut sum = 1;let mut cur = x % m;while e > 0 {if e % 2 != 0 {sum = sum * cur % m;}cur = cur * cur % m;e /= 2;}sum}// Find a generator of (Z/pZ)^\timesfn gen_zpz(p: i64) -> i64 {let mut v = p - 1;let mut f = 2;let mut fs = vec![];while v >= f * f {if v % f == 0 {fs.push(f);while v % f == 0 { v /= f; }}f += 1;}if v > 1 {fs.push(v);}let mut g = 2;loop {if fs.iter().all(|&x| powmod(g, (p - 1) / x, p) != 1) {return g;}g += 1;}}// Tags: generators-of-cyclic-groupsfn main() {let out = std::io::stdout();let mut out = BufWriter::new(out.lock());macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}#[allow(unused)]macro_rules! putvec {($v:expr) => {for i in 0..$v.len() {puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});}}}input! {t: usize,vx: [(i64, i64); t],}for (v, x) in vx {let p = v * x + 1;let g = gen_zpz(p);let k = powmod(g, v, p);let mut ans = vec![];let mut c = 1;for _ in 0..x {ans.push(c);c = c * k % p;}ans.sort_unstable();putvec!(ans);}}