結果

問題 No.2649 [Cherry 6th Tune C] Anthem Flower
ユーザー katonyonko
提出日時 2024-02-23 21:48:49
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 540 ms / 2,000 ms
コード長 1,744 bytes
コンパイル時間 165 ms
コンパイル使用メモリ 82,132 KB
実行使用メモリ 102,240 KB
最終ジャッジ日時 2024-09-29 06:12:09
合計ジャッジ時間 7,683 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math
_INPUT = """\
6
4
3 100
5 10
123456789012345678901234567890 20240223
11536100000 3215311
"""
def input():
return sys.stdin.readline()[:-1]
def divide2(x):
for i in range(len(x)):
if x[i]%2!=0:
x[i+1]+=10
x[i]//=2
return x
def plus1(x):
x[-1]+=1
for i in reversed(range(len(x))):
if x[i]==10:
x[i]=0
if i>0: x[i-1]+=1
else: x=[1]+x
return x
def solve(test):
T=int(input())
for _ in range(T):
N,M=input().split()
M=int(M)
N=list(map(int,N))
N1=plus1(N.copy())
if N[-1]%2==0:
N=divide2(N)
else:
N1=divide2(N1)
ans0=0
for i in range(len(N)):
ans0=(ans0*10+N[i])%M
ans1=0
for i in range(len(N1)):
ans1=(ans1*10+N1[i])%M
print(ans0*ans1%M)
def random_input():
from random import randint,shuffle
N=randint(1,10)
M=randint(1,N)
A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
shuffle(A)
return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3
def simple_solve():
return []
def main(test):
if test==0:
solve(0)
elif test==1:
sys.stdin = io.StringIO(_INPUT)
case_no=int(input())
for _ in range(case_no):
solve(0)
else:
for i in range(1000):
sys.stdin = io.StringIO(random_input())
x=solve(1)
y=simple_solve()
if x!=y:
print(i,x,y)
print(*[line for line in sys.stdin],sep='')
break
#0:1:2:
main(0)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0