結果

問題 No.1409 Simple Math in yukicoder
ユーザー minatominato
提出日時 2021-02-26 23:09:13
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 7,476 bytes
コンパイル時間 3,592 ms
コンパイル使用メモリ 236,712 KB
最終ジャッジ日時 2024-04-10 14:10:39
合計ジャッジ時間 4,506 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ（β）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/string:43,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bitset:52,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:52,
                 from main.cpp:4:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h: In destructor 'std::__cxx11::basic_string<char>::_Alloc_hider::~_Alloc_hider()':
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to 'always_inline' 'std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = char]': target specific option mismatch
  184 |       ~allocator() _GLIBCXX_NOTHROW { }
      |       ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/string:54:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/basic_string.h:181:14: note: called from here
  181 |       struct _Alloc_hider : allocator_type // TODO check __is_final
      |              ^~~~~~~~~~~~

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
constexpr char ln = '\n';
template <class Container> inline int SZ(const Container& v) { return int(v.size()); }
template <class T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; }
template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; }
inline int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(ull x) { return __builtin_popcountll(x); }
inline int kthbit(ull x, int k) { return (x >> k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; }
const string YESNO[2] = {"NO", "YES"};
const string YesNo[2] = {"No", "Yes"};
inline void YES(bool t = true) { cout << YESNO[t] << "\n"; }
inline void Yes(bool t = true) { cout << YesNo[t] << "\n"; }
template <class T> inline void drop(T x) { cout << x << "\n"; exit(0); }
inline void print() { cout << "\n"; }
template <class T> inline void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); }
template <class T, class... Args> inline void print(const T& x, const Args& ... args) { cout << x << " "; print(args...); }
#ifdef MINATO_LOCAL
template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; }
template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); }
template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; }
string debug_delim(int& i) { return i++ == 0 ? "" : ", "; }
#define debug_embrace(x) { int i = 0; os << "{";  { x } return os << "}"; }
template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) }
template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) }
template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) }
template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) }
template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) }
void debug_out() { cerr << endl; }
template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); }
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_;
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#include <atcoder/all>
using namespace atcoder;
// //using mint = modint998244353;
// //using mint = modint1000000007;
// //using mint = modint;
// 
// istream& operator>>(istream& is, modint998244353& M) { long long x; is >> x; M = x; return is; }
// ostream& operator<<(ostream& os, const modint998244353& M) { return os << M.val(); }
// istream& operator>>(istream& is, modint1000000007& M) { long long x; is >> x; M = x; return is; }
// ostream& operator<<(ostream& os, const modint1000000007& M) { return os << M.val(); }
// template <int m> istream& operator>>(istream& is, static_modint<m>& M) { long long x; is >> x; M = x; return is; }
// template <int m> ostream& operator<<(ostream& os, const static_modint<m>& M) { return os << M.val(); }
// istream& operator>>(istream& is, modint& M) { long long x; is >> x; M = x; return is; }
// ostream& operator<<(ostream& os, const modint& M) { return os << M.val(); }
// 
// //vector<mint> multiply(vector<mint> a, vector<mint> b) { return convolution(a,b); }
//O(NloglogN)
struct PrimeFactorTable {
  public:
    PrimeFactorTable() {}
    PrimeFactorTable(int n) : n_(n), table(n + 1) {
        iota(table.begin(), table.end(), 0);
        for (int i = 2; i * i <= n; i++) {
            if (table[i] == i) {
                for (int j = i * i; j <= n; j += i) {
                    if (table[j] == j) table[j] = i;
                }
            }
        }
    }

    int operator[](int x) const { return table[x]; }

    vector<pair<int, int>> prime_factor(int x) const {
        assert(1 <= x and x <= n_);
        vector<pair<int, int>> ret;
        while (x != 1) {
            if (ret.empty() or ret.back().first != table[x]) {
                ret.emplace_back(table[x], 1);
            } else {
                ret.back().second++;
            }
            x /= table[x];
        }

        return ret;
    }

  private:
    int n_;
    vector<int> table;  
};

PrimeFactorTable PFT;

void solve() {
    int x,v; cin >> v >> x;
    const int P = x * v + 1;
    vec<ll> table(P);
    vec<int> ans;
    ans.reserve(x);
    for (int i = 1; i < P; i++) {
        if (PFT[i]==i) {
            table[i] = pow_mod(i,x,P);
        } else{
            int u = PFT[i];
            int v = i / u;
            table[i] = table[u] * table[v] % P;
        }
        if (table[i]==1) ans.emplace_back(i);
    }
    while (SZ(ans) > x) ans.pop_back();
    print(ans);
}
void naive() {
    int x,v; cin >> v >> x;
    for (int i = 1; i <= x*v; i++) {
        debug(i,pow_mod(i,x,x*v+1));
    }
}

int main() {
    PFT = PrimeFactorTable(100000);
    //naive();
    int Q; cin >> Q;
    for (int q = 0; q < Q; q++) {
        solve();
    }
}
0