QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #563296 | #1835. Fancy Formulas | ydzr00000 | WA | 30ms | 3864kb | C++17 | 667b | 2024-09-14 09:32:05 | 2024-09-14 09:32:05 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
inline long long qpow(long long a,long long b,long long p)
{
long long ans=1;
while(b)
{
if(b&1)
ans=ans*a%p;
a=a*a%p;
b>>=1;
}
return ans;
}
inline void solve(const int &p)
{
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
if((a+b)%p!=(c+d)%p)
{
puts("-1");
return;
}
long long inv=qpow(a+b,p-2,p);
for(int k=0;k<=60;k++)
{
long long v=(1ll<<k)%p;
long long t=(c+v*b%p)%p*inv%p;
long long up=(1ll<<k);
if(t<=up&&t>=1)
{
printf("%d\n",k);
break;
}
}
}
int main(){
int p,q;
scanf("%d %d",&p,&q);
while(q--)
solve(p);
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3864kb
input:
5 10 2 1 3 0 2 1 4 4 1 3 4 0 0 2 0 4 3 3 1 2 0 1 0 1 0 3 0 3 0 1 0 1 1 2 4 4 1 0 1 1
output:
2 1 2 -1 -1 0 0 0 1 -1
result:
ok 10 numbers
Test #2:
score: -100
Wrong Answer
time: 30ms
memory: 3788kb
input:
97 100000 30 56 74 12 95 39 8 29 11 42 76 74 48 63 58 53 74 22 85 11 80 23 84 4 30 90 30 90 92 91 41 45 21 82 11 92 65 30 28 67 74 57 95 36 16 31 78 66 2 77 6 73 83 20 41 62 45 44 92 94 96 28 77 47 76 12 87 1 47 80 42 85 46 91 65 72 23 39 4 58 21 96 37 80 83 33 66 50 84 21 61 44 4 78 47 35 39 50 39 ...
output:
6 6 5 6 6 -1 0 4 6 7 7 6 6 2 7 7 6 8 6 4 6 5 5 3 0 4 5 6 6 5 5 5 6 5 5 6 7 -1 5 4 -1 6 4 -1 4 6 5 5 -1 6 6 7 0 -1 2 -1 5 -1 5 7 2 4 6 4 6 6 -1 6 7 6 6 7 6 -1 4 2 7 0 6 -1 6 2 -1 4 6 5 -1 7 3 5 0 -1 7 3 4 6 4 6 0 1 5 7 6 -1 -1 -1 6 5 5 5 3 3 3 -1 -1 2 3 5 6 -1 -1 7 -1 5 7 6 5 6 -1 3 5 5 -1 4 5 6 -1 6...
result:
wrong answer 18th numbers differ - expected: '7', found: '8'