QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#810825 | #9864. Coin | lbssssss | WA | 2ms | 3656kb | C++17 | 649b | 2024-12-12 11:43:37 | 2024-12-12 11:43:38 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
void solve(){
int n,k;
std::cin >> n >> k;
if(n<=k+2){
std::cout << n <<'\n';
return ;
}
if(k==2){
int e = 1;
while(e*2<n+1){
e *= 2;
}
std::cout<<e<<"\n";
return ;
}
// k+2 < n
int f1 = k;
while((f1*k+k-2)/(k-1)<=n+1){
f1 = (f1*k+k-2)/(k-1);
}
std::cout<<f1<<'\n';
}
signed main(){
std::cin.tie(0)->sync_with_stdio(0);
std::cout.tie(0);
int t = 1;
std::cin >> t;
while(t--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3656kb
input:
4 6 2 8 3 10000 2 1919810 114514
output:
4 8 8192 1919805
result:
ok 4 number(s): "4 8 8192 1919805"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3652kb
input:
100 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3 10 3 11 4 2 4 3 4 4 4 5 4 6 4 7 4 8 4 9 4 10 4 11 5 2 5 3 5 4 5 5 5 6 5 7 5 8 5 9 5 10 5 11 6 2 6 3 6 4 6 5 6 6 6 7 6 8 6 9 6 10 6 11 7 2 7 3 7 4 7 5 7 6 7 7 7 8 7 9 7 10 7 11 8 2 8 3 8 4 8 5 8 6 8 7 8 8 8 9 8 10 8 11 9 ...
output:
2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 4 5 6 6 6 6 6 6 6 6 4 8 8 7 7 7 7 7 7 7 8 8 8 9 8 8 8 8 8 8 8 8 8 9 10 9 9 9 9 9 8 8 11 9 10 11 10 10 10 10 8 12 11 12 12 11 12 11 11 11
result:
wrong answer 11th numbers differ - expected: '2', found: '3'