結果
問題 | No.1409 Simple Math in yukicoder |
ユーザー |
![]() |
提出日時 | 2021-02-26 22:04:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 22 ms / 2,000 ms |
コード長 | 3,860 bytes |
コンパイル時間 | 2,191 ms |
コンパイル使用メモリ | 207,260 KB |
最終ジャッジ日時 | 2025-01-19 05:29:51 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 58 |
コンパイルメッセージ
In function ‘lint mod_pow(lint, lint, lint)’, inlined from ‘int main()’ at main.cpp:121:31: main.cpp:87:30: warning: ‘minroot’ may be used uninitialized [-Wmaybe-uninitialized] 87 | (ret *= A); | ~~~~~^~~~~ main.cpp: In function ‘int main()’: main.cpp:108:22: note: ‘minroot’ was declared here 108 | lint minroot; | ^~~~~~~
ソースコード
#include <bits/stdc++.h>#include <random>#include <chrono>using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedefpair<ld, ld> pld;#define ALL(x) (x).begin(), (x).end()#define SZ(x) ((lint)(x).size())#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)#define REP(i, n) FOR(i,0,n)#define IREP(i, n) IFOR(i,0,n)#define endk '\n'#define fi first#define se secondstruct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;template<class T> auto add = [](T a, T b) -> T { return a + b; };template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };template<class T> using V = vector<T>;using Vl = V<lint>; using VVl = V<Vl>;template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");return os;}template< typename T >istream& operator>>(istream& is, vector< T >& v) {for (T& in : v) is >> in;return is;}template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }lint ceil(lint a, lint b) { return (a + b - 1) / b; }lint digit(lint a) { return (lint)log10(a); }lint e_dist(plint a, plint b) { return abs(a.fi - b.fi) * abs(a.fi - b.fi) + abs(a.se - b.se) * abs(a.se - b.se); }lint m_dist(plint a, plint b) { return abs(a.fi - b.fi) + abs(a.se - b.se); }bool check_overflow(lint a, lint b, lint limit) { return a > limit / b; } // a * b > c => truevoid Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e9;lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 };bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }struct Edge {lint from, to;lint cost;Edge() {}Edge(lint u, lint v, lint c) {cost = c;from = u;to = v;}bool operator<(const Edge& e) const {return cost < e.cost;}};struct WeightedEdge {lint to;lint cost;WeightedEdge(lint v, lint c = 1) {to = v;cost = c;}bool operator<(const WeightedEdge& e) const {return cost < e.cost;}};using WeightedGraph = V<V<WeightedEdge>>;typedef pair<plint, lint> tlint;typedef pair<plint, plint> qlint;typedef pair<char, lint> valchar;map< int64_t, int > prime_factor(int64_t n) {map< int64_t, int > ret;for (int64_t i = 2; i * i <= n; i++) {while (n % i == 0) {ret[i]++;n /= i;}}if (n != 1) ret[n] = 1;return ret;}lint mod_pow(lint A, lint B, lint mod) {lint ret = 1;while (B > 0) {if (B & 1) {(ret *= A);ret %= mod;}(A *= A);A %= mod;B >>= 1;}return ret;}lint T, A, B;int main() {cin >> T;while (T--) {cin >> A >> B;if (A == 1 && B == 1) {cout << 1 << endk;continue;}lint P = A * B + 1;auto ps = prime_factor(A * B);lint minroot;FOR(i, 2, P) {bool flag = true;for (plint v : ps) {lint _v = i;if (mod_pow(i, (P - 1) / v.first, A * B + 1) == 1) flag = false;}if (flag) {minroot = i;break;}}Vl arr;lint curr = 1, mul = mod_pow(minroot, A, A * B + 1);REP(i, B) {arr.push_back(curr);curr *= mul;curr %= A * B + 1;}sort(ALL(arr));cout << arr << endk;}}