結果
| 問題 |
No.2385 Parse Integer with Radix
|
| コンテスト | |
| ユーザー |
cleantted
|
| 提出日時 | 2023-07-20 01:56:37 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 159 ms / 2,000 ms |
| コード長 | 1,677 bytes |
| コンパイル時間 | 197 ms |
| コンパイル使用メモリ | 82,280 KB |
| 実行使用メモリ | 90,380 KB |
| 最終ジャッジ日時 | 2024-09-19 23:31:20 |
| 合計ジャッジ時間 | 3,163 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 11 |
ソースコード
# import bisect
import copy
import heapq
import itertools
import math
import operator
import random
import sys
from bisect import bisect, bisect_left, bisect_right, insort
from collections import Counter, deque
from fractions import Fraction
from functools import cmp_to_key, lru_cache, partial
from inspect import currentframe
from math import ceil, gcd, log10, pi, sqrt
from typing import Iterable, Iterator, List, Tuple, TypeVar, Union
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# import string
# import networkx as nx
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
# mod = 10 ** 9 + 7
mod = 998244353
# mod = 1 << 128
# mod = 10 ** 30 + 1
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]
def read_values(): return tuple(map(int, input().split()))
def read_index(): return tuple(map(lambda x: int(x) - 1, input().split()))
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
def dprint(*values): print(*values, file=sys.stderr)
def dprint2(*values):
names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values))
def f():
S = input().strip()
if len(S) < 2:
return int(S)
if S[:2] == "0b":
return int(S, 2)
elif S[:2] == "0o":
return int(S, 8)
elif S[:2] == "0x":
return int(S, 16)
else:
return int(S)
def main():
Q = int(input())
res = []
for _ in range(Q):
r = f()
res.append(r)
print(*res, sep="\n")
if __name__ == "__main__":
main()
cleantted