QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#239539 | #6558. Allergen Testing | mtxas# | WA | 16ms | 3396kb | C++14 | 869b | 2023-11-04 21:10:21 | 2023-11-04 21:10:21 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
//#define printf(...)
#define mp make_pair
using namespace std;
void solve()
{
int n,d;
cin>>n>>d;
const int B = LLONG_MAX;
function<int(int,int)> lift = [&] (int d, int k){
if(k == 0) return 1LL;
if(k==1) return d;
int dd = lift(d, k/2LL);
if(dd > B/dd) return LLONG_MAX;
else dd = dd*dd;
if(k&1LL){
if(dd > B/d) return LLONG_MAX;
else dd *= d;
}
return dd;
};
int L =1, R = 70;
while(L<=R){
int M = (L+R)/2LL;
if(lift(d+1, M)>=n) R= M-1;
else L = M+1;
}
cout<<L<<'\n';
}
signed main()
{
// freopen("input_00.txt", "r", stdin);
int T = 1;
cin >> T;
while(T--)
{
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3396kb
input:
1 4 1
output:
2
result:
ok single line: '2'
Test #2:
score: -100
Wrong Answer
time: 16ms
memory: 3368kb
input:
10000 1 1 1000000000000000000 1 1 1000000000000000000 1000000000000000000 1000000000000000000 26615519354743225 163142634 26615519354743225 163142634 26615519354743224 163142634 26615519354743226 163142634 847997831064072529 920867976 847997831064072529 920867976 847997831064072528 920867976 8479978...
output:
1 60 1 1 2 2 2 3 2 2 2 3 2 2 2 3 2 2 2 3 2 2 2 3 2 2 2 3 2 2 2 3 2 2 2 3 2 2 2 3 2 2 2 3 3 3 3 4 3 3 3 4 3 3 3 4 3 3 3 4 3 3 3 4 3 3 3 4 3 3 3 4 3 3 3 4 3 3 3 4 3 3 3 4 4 4 4 5 4 4 4 5 4 4 4 5 4 4 4 5 4 4 4 5 4 4 4 5 4 4 4 5 4 4 4 5 4 4 4 5 4 4 4 5 5 5 5 6 5 5 5 6 5 5 5 6 5 5 5 6 5 5 5 6 5 5 5 6 5 5...
result:
wrong answer 1st lines differ - expected: '0', found: '1'