QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#253951 | #6706. Sekiro | Lionel_ZQY# | AC ✓ | 1ms | 3620kb | C++20 | 421b | 2023-11-17 20:42:26 | 2023-11-17 20:42:26 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
void solve(){
i64 n,k;
cin>>n>>k;
if(n==0){
cout<<"0\n";
return ;
}
while(k--){
if(n%2==0) n/=2LL;
else if(n!=1) n=(n+1LL)/2LL;
else{
n=1;
break;
}
}
cout<<n<<'\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
input:
4 10 1 7 1 10 2 7 2
output:
5 4 3 2
result:
ok 4 number(s): "5 4 3 2"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3560kb
input:
1000 442956297 12 982332962 27 497083098 816382285 396247623 24 898041447 407271792 763055147 14 352462601 16 519828345 6 219558285 10 325702476 354976208 490357788 107179876 390383594 636902929 169308923 21552242 657869544 9 435305129 833496936 300697250 24 320657401 4 896954688 877519779 679896094...
output:
108144 8 1 24 1 46574 5379 8122318 214413 1 1 1 1 1284902 1 18 20041088 1 21246753 5480 553 226 3877013 3162838 1 1 0 330619747 1168178 1 10463 1 2 0 1 0 1 1 91795 22918685 0 364 26026 66 1 4 15291 1 1 10 0 35435061 1 1 13899 1 6616 1 117 1 30576 1 1 101267710 1 1 4428 1 37192038 620 1 0 11 3551 1 4...
result:
ok 1000 numbers