QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #804131 | #9864. Coin | ucup-team5697# | WA | 3ms | 3924kb | C++14 | 614b | 2024-12-07 20:34:30 | 2024-12-07 20:34:30 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;bool Mbe;
namespace MAOJUN{
typedef long long ll;
ll n,k;
inline void slv(){
scanf("%lld%lld",&n,&k);ll m=n-k+1;
ll a,s=1;
for(int i=1;;i++){
a=(s-1)/(k-1)+1;
s+=a;
if(i>=k){
if(m<=a){printf("%lld\n",n-m+1);return;}
m-=a;
}
}
}
inline void main(){int T;scanf("%d",&T);while(T--)slv();}
}bool Med;int main(){
#ifdef LOCAL
freopen("1.in","r",stdin);
freopen("data.out","w",stdout);
atexit([]{fprintf(stderr,"%.0lfms\n%lfMB\n",clock()*1000./CLOCKS_PER_SEC,(&Mbe-&Med)/1024./1024);});
#endif
MAOJUN::main();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 3ms
memory: 3924kb
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: 1ms
memory: 3868kb
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 3 4 5 6 7 8 9 10 11 2 3 4 5 6 7 8 9 10 11 4 3 4 5 6 7 8 9 10 11 4 5 4 5 6 7 8 9 10 11 4 5 6 5 6 7 8 9 10 11 4 5 6 7 6 7 8 9 10 11 8 8 8 7 8 7 8 9 10 11 8 8 8 9 8 9 8 9 10 11 8 8 8 9 10 9 10 9 10 11 8 8 11 9 10 11 10 11 10 11
result:
wrong answer 2nd numbers differ - expected: '2', found: '3'