1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
using namespace std;
typedef long long ll;
const ll maxn = 1e6;
ll mod;
struct {
static const int mod = 12000005;
int hs[mod], head[mod], nxt[mod], id[mod], top;
void init(){
memset(head, -1, sizeof(head));
top = 1;
};
void insert(ll x, int y) {
int k = x % mod;
hs[top] = x, id[top] = y, nxt[top] = head[k], head[k] = top++;
}
int find(int x) {
int k = x % mod;
for (int i = head[k]; i != -1; i = nxt[i]) if (hs[i] == x) return id[i];
return -1;
}
}mp;
ll bin(ll x, ll n, ll MOD)
{
ll ret = MOD != 1;
for (x %= MOD; n; n >>= 1, x = x * x % MOD)
if (n & 1)
ret = ret * x % MOD;
return ret;
}
inline ll get_inv(ll x, ll p) { return bin(x, p - 2, p); }
ll m, ma;
ll Init(ll a, ll p)
{
mp.init();
ll v = 1;
for(int i=1;i<=m;i++)
{
v = v * a % p;
mp.insert(v,i);
}
return v;
}
ll BSGS(ll a, ll b, ll p, ll init_d)
{
a %= p;
if (!a && !b)
return 1;
if (!a)
return -1;
ll v = init_d;
ll vv = init_d;
ll inv_b = get_inv(b, p);
for(ll i=1;i<=ma;i++)
{
auto it = mp.find(vv * inv_b % p);
if (it != -1)
return i * m - it;
vv = vv * v % p;
}
return -1;
}
int main()
{
ios::sync_with_stdio(false);
ll T;
cin>>T;
while (T--)
{
ll n, x0, a, b, p;
ll Q;
cin>>n>>x0>>a>>b>>p>>Q;
if (a == 0)
{
while (Q--)
{
ll v;
cin>>v;
if (v == x0)
{
cout<<0<<endl;
}
else if (v == b)
{
cout<<1<<endl;
}
else
{
cout<<-1<<endl;
}
}
}
else if (a == 1)
{
ll invb = get_inv(b, p);
while (Q--)
{
ll v;
cin>>v;
ll ans = (((v - x0 + p) % p) * invb) % p;
if (ans >= n)
{
cout<<-1<<endl;
}
else
{
cout<<ans<<endl;
}
}
}
else
{
ll bais = b * get_inv(a - 1, p) % p;
ll y0 = (x0 + bais) % p;
ll inv_y0 = get_inv(y0, p);
m = min(maxn, n);
ma = p / maxn + 3;
ll init_d = Init(a, p);
while (Q--)
{
ll v;
cin>>v;
v = (v + bais) % p;
v = (v * inv_y0) % p;
ll res = BSGS(a, v, p, init_d);
if (res >= n)
res = -1;
cout<<res<<endl;
}
}
}
}
|
近期评论