結果
| 問題 | No.1140 EXPotentiaLLL! |
| コンテスト | |
| ユーザー |
 hamath
|
| 提出日時 | 2020-07-31 22:39:59 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,843 bytes |
| コンパイル時間 | 2,562 ms |
| コンパイル使用メモリ | 216,692 KB |
| 最終ジャッジ日時 | 2025-01-12 10:56:10 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 3 WA * 9 |
ソースコード
#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18+18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a, b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;
#define dbgarr(n, m, arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n, arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a, b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second
template<class T>
bool chmax(T &a, const T &b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmin(T &a, const T &b) {
if(b < a) {
a = b;
return true;
}
return false;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T>
istream &operator>>(istream &i, vector<T> &v) {
rep(j, v.size())i>>v[j];
return i;
}
// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for(int i = 0; i < len; ++i) {
s<<v[i];
if(i < len-1) s<<" ";
}
return s;
}
// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
int len = vv.size();
for(int i = 0; i < len; ++i) {
s<<vv[i]<<endl;
}
return s;
}
vector<bool> prime_table(int n) {
vector<bool> prime(n+1, true);
if(n >= 0) prime[0] = false;
if(n >= 1) prime[1] = false;
for(int i = 2; i*i <= n; i++) {
if(!prime[i]) continue;
for(int j = i+i; j <= n; j += i) {
prime[j] = false;
}
}
return prime;
}
//mint
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x%MOD+MOD)%MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if((x += a.x) >= MOD) x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if((x += MOD-a.x) >= MOD) x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if(!t) return 1;
mint a = pow(t>>1);
a *= a;
if(t & 1) a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD-2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is>>a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os<<a.x; }
typedef vector<mint> Vmint;
typedef vector<vector<mint>> VVmint;
typedef vector<vector<vector<mint>>> VVVmint;
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n+1), ifact(n+1) {
assert(n < MOD);
fact[0] = 1;
for(int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
ifact[n] = fact[n].inv();
for(int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
}
mint operator()(int n, int k) {
if(k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
};
int solve() {
ll MX = 5*1e6+1;
//ll MX = 20;
vector<bool> pt = prime_table(MX);
//dbg(pt);
ll T;
cin>>T;
while (T--) {
ll a, p;
cin>>a>>p;
if(!pt[p]){
out(-1);
continue;
}
ll s = p*(p-1)/2;
a %= p;
if(gcd(a,s)==1){
a *= p-1;
a %= p;
}
out(a);
}
return 0;
}
void simulate(ll a) {
ll p = 23;
ll sim = 1;
REP(i,1, p+1) {
ll k = 1;
ll j = i;
while (j--) {
k *= a;
k %= p;
}
if(i<p){
sim *= k;
sim %= p;
}
dbg(k);
}
dbg(mp(a,sim));
dbg((a*sim) % p)
//exit(0);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout<<std::setprecision(10);
// REP(x,1,23){
// simulate(x);
// }
// simulate(4);
solve();
}