結果
問題 | No.1140 EXPotentiaLLL! |
ユーザー | Gosu_Hiroo |
提出日時 | 2020-07-31 21:50:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 7,559 bytes |
コンパイル時間 | 1,997 ms |
コンパイル使用メモリ | 200,868 KB |
実行使用メモリ | 13,824 KB |
最終ジャッジ日時 | 2024-07-06 17:39:23 |
合計ジャッジ時間 | 8,903 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | TLE | - |
testcase_01 | -- | - |
testcase_02 | -- | - |
testcase_03 | -- | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
ソースコード
/*** code generated by JHelper* More info: https://github.com/AlexeyDmitriev/JHelper* @author*/#include <bits/stdc++.h>using namespace std;using ll = long long;//#pragma GCC optimize("Ofast")//#pragma GCC optimize("unroll-loops")#define VI vector<int>#define G(size_1) vector<vector<int>>(size_1, vector<int>())#define SZ(x) ((int)(x).size())#define READ ({int t;cin >> t;t;})#define PII pair<int, int>#define FOR(i, _begin, _end) for (__typeof(_end) end = _end, begin = _begin, i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1- 2 * ((begin) > (end)))#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)#define ALL(x) (x).begin(),(x).end()#define RALL(x) (x).rbegin(),(x).rend()#define F first#define S second#define y0 y3487465#define y1 y8687969#define j0 j1347829#define j1 j234892#define MOD(x, m) ((((x) % (m)) + (m)) % (m))#define BIT(n) (1LL<<(n))#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define EB emplace_back#define PB push_back#define fcout cout << fixed << setprecision(12)#define fcerr cerr << fixed << setprecision(12)#define print(x) cout << (x) << '\n'#define printE(x) cout << (x) << endl#define fprint(x) cout << fixed << setprecision(12) << (x) << endl# define BYE(a) do { cout << (a) << endl; return ; } while (false)#ifdef DEBUG#define ERR(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(cerr,_it, args); }#define DBG(x) std::cerr << #x << " = " << x << endl;#else#define DBG(x) {};#define ERR(args...) {};#endifvoid _err(std::ostream &cerr, istream_iterator<string> it) { cerr << endl; }template<typename T, typename... Args>void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args) {cerr << *it << " = " << a << " ";_err(cerr, ++it, args...);}const double pi = 2 * acos(.0);const int inf = 0x3f3f3f3f;const ll mod = (ll) (1e9) + 7;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;}template<typename T>istream &operator>>(istream &is, vector<T> &V) {for (auto &&ele : V)is >> ele;return is;}template<typename T>ostream &operator<<(ostream &os, const vector<T> V) {os << "[";int cnt = 0;T curr;if (!V.empty()) {for (int i = 0; i < V.size() - 1; ++i) {if (V[i] == curr)cnt++;else cnt = 0;if (cnt == 4)os << "... ";if (cnt < 4)os << i << ":" << V[i] << " ";curr = V[i];}os << V.size() - 1 << ":" << V.back();}os << "]\n";return os;}template<typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> P) {os << "(";os << P.first << "," << P.second;os << ")";return os;}template<typename T, typename U>ostream &operator<<(ostream &os, const set<T, U> V) {os << "{";if (!V.empty()) {auto it = V.begin();for (int i = 0; i < V.size() - 1; ++i) {os << *it << " ";it++;}os << *it;}os << "}\n";return os;}template<typename K, typename H, typename P>ostream &operator<<(ostream &os, const unordered_set<K, H, P> V) {os << "{";if (!V.empty()) {auto it = V.begin();for (int i = 0; i < V.size() - 1; ++i) {os << *it << " ";it++;}os << *it;}os << "}\n";return os;}template<typename K, typename C>ostream &operator<<(ostream &os, const multiset<K, C> V) {os << "{";if (!V.empty()) {auto it = V.begin();for (int i = 0; i < V.size() - 1; ++i) {os << *it << " ";it++;}os << *it;}os << "}";return os;}template<typename K, typename T, typename C>ostream &operator<<(ostream &os, const map<K, T, C> V) {os << "{";if (!V.empty()) {auto it = V.begin();for (int i = 0; i < V.size() - 1; ++i) {os << "(";os << it->first << "," << it->second;os << ") ";it++;}os << "(";os << it->first << "," << it->second;os << ")";}os << "}\n";return os;}template<typename K, typename T, typename C>ostream &operator<<(ostream &os, const unordered_map<K, T, C> V) {os << "{";if (!V.empty()) {auto it = V.begin();for (int i = 0; i < V.size() - 1; ++i) {os << "(";os << it->first << "," << it->second;os << ") ";it++;}os << "(";os << it->first << "," << it->second;os << ")";}os << "}\n";return os;}template<typename T>ostream &operator<<(ostream &os, const deque<T> V) {os << "[";if (!V.empty()) {for (int i = 0; i < V.size() - 1; ++i) {os << V[i] << "->";}if (!V.empty())os << V.back();}os << "]\n";return os;};template<typename T, typename Cont, typename Comp>ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V) {priority_queue<T, Cont, Comp> _V = V;os << "[";if (!_V.empty()) {while (_V.size() > 1) {os << _V.top() << "->";_V.pop();}os << _V.top();}os << "]\n";return os;};template<class F>struct y_combinator {F f; // the lambda will be stored here// a forwarding operator():template<class... Args>decltype(auto) operator()(Args &&... args) const {// we pass ourselves to f, then the arguments.// the lambda should take the first argument as `auto&& recurse` or similar.return f(*this, std::forward<Args>(args)...);}};// helper function that deduces the type of the lambda:template<class F>y_combinator<std::decay_t<F>> recursive(F &&f) {return {std::forward<F>(f)};}struct hash_pair {template<class T1, class T2>size_t operator()(const pair<T1, T2> &p) const {auto hash1 = hash<T1>{}(p.first);auto hash2 = hash<T2>{}(p.second);return hash1 ^ hash2;}};template<typename T, typename U>std::vector<T> multi_vector(int n, U v) {return std::vector<T>(n, v);}template<typename U, typename... Args>auto multi_vector(int n, Args... args) {auto val = multi_vector<U>(std::forward<Args>(args)...);return std::vector<decltype(val)>(n, std::move(val));}class No1140EXPotentiaLLL {public:void solve(std::istream &cin, std::ostream &cout, std::ostream &cerr) {int testcases;cin >> testcases;auto f = [&](int P) {if (P == 1)return 0;for (int i = 2; i * i <= P; i++)if (P % i == 0)return 0;return 1;};for (int case_num = 1; case_num <= testcases; case_num++) {ll A, P;cin >> A >> P;if (f(P)) {ll ans = ((-A) % P + P)%P;print(ans);} elseprint(-1);}}};#undef intint main() {No1140EXPotentiaLLL solver;std::istream& in(std::cin);std::ostream& out(std::cout);std::ostringstream err;in.tie(0); ios::sync_with_stdio(0);solver.solve(in, out,err);return 0;}