QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #563308 | #1835. Fancy Formulas | ydzr00000 | WA | 0ms | 3752kb | C++17 | 688b | 2024-09-14 09:38:47 | 2024-09-14 09:38:47 |
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)
{
printf("%d\n",k);
break;
}
}
}
int main(){
int p,q;
scanf("%d %d",&p,&q);
while(q--)
solve(p);
return 0;
}
/*
97 1
47 80 42 85
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3752kb
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:
1 0 1 -1 -1 0 0 0 1 -1
result:
wrong answer 1st numbers differ - expected: '2', found: '1'