QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #632054 | #9456. Numbers | ucup-team3646# | AC ✓ | 30ms | 10708kb | Python3 | 379b | 2024-10-12 11:44:15 | 2024-10-14 17:04:31 |
Judging History
answer
from sys import stdin
input=lambda :stdin.readline()[:-1]
def solve():
n,m=map(int,input().split())
if m==1:
print(n)
return
tmp=1
e=0
while tmp<=n:
tmp<<=1
e+=1
ans=0
for i in range(e,-1,-1):
val=(1<<i)-1
if val*m<n:
ans|=1<<i
n=n-(min(m,n>>i)<<i)
print(ans)
for _ in range(int(input())):
solve()
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 15ms
memory: 10708kb
input:
5 3 1 3 2 3 3 10000 5 1244 10
output:
3 3 1 2000 125
result:
ok 5 tokens
Test #2:
score: 0
Accepted
time: 30ms
memory: 10688kb
input:
760 3 1 3 2 3 3 10000 5 1234 10 12345678910 34 124243243453446456 111323444 124234235325435436454645 242342343 232243434 23223 237234873238642783459236523976 10 0 1 0 12 1 3 10 4 9 5 3 2 4 5 7 3 6 2 5 3 7 3 7 2 9685295 190 5556910 213 7111987 191 7215414 122 5850275 271 4249528 191 3215769 167 26903...
output:
3 3 1 2000 125 363108205 1116056412 512639408316011 10001 23723487323864278345923652398 0 0 1 3 3 3 1 3 3 3 3 7 50977 26089 37237 59143 21589 22249 19257 12514 4955 69867 34099 67319 14241 26433 29343 26521 44241 19009 61709 10829 11557 39115 70165 26403 5215 28595 47438 15065 31705 27509 18483 7105...
result:
ok 760 tokens
Extra Test:
score: 0
Extra Test Passed