結果

問題 No.747 循環小数N桁目 Hard
ユーザー cozy_saunacozy_sauna
提出日時 2022-03-13 15:32:05
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 97 ms / 2,000 ms
コード長 6,325 bytes
コンパイル時間 163 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 70,912 KB
最終ジャッジ日時 2024-09-18 22:35:30
合計ジャッジ時間 12,485 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
65,280 KB
testcase_01 AC 59 ms
65,408 KB
testcase_02 AC 61 ms
65,792 KB
testcase_03 AC 60 ms
65,280 KB
testcase_04 AC 58 ms
65,408 KB
testcase_05 AC 62 ms
65,408 KB
testcase_06 AC 59 ms
65,664 KB
testcase_07 AC 59 ms
65,280 KB
testcase_08 AC 60 ms
65,792 KB
testcase_09 AC 65 ms
65,280 KB
testcase_10 AC 60 ms
65,408 KB
testcase_11 AC 60 ms
65,408 KB
testcase_12 AC 59 ms
65,408 KB
testcase_13 AC 57 ms
65,408 KB
testcase_14 AC 57 ms
65,408 KB
testcase_15 AC 57 ms
65,280 KB
testcase_16 AC 58 ms
65,664 KB
testcase_17 AC 57 ms
65,408 KB
testcase_18 AC 59 ms
65,536 KB
testcase_19 AC 61 ms
65,536 KB
testcase_20 AC 62 ms
65,664 KB
testcase_21 AC 63 ms
65,408 KB
testcase_22 AC 59 ms
65,536 KB
testcase_23 AC 58 ms
65,664 KB
testcase_24 AC 58 ms
65,408 KB
testcase_25 AC 62 ms
65,536 KB
testcase_26 AC 60 ms
65,408 KB
testcase_27 AC 64 ms
65,792 KB
testcase_28 AC 64 ms
65,536 KB
testcase_29 AC 60 ms
65,408 KB
testcase_30 AC 62 ms
65,280 KB
testcase_31 AC 59 ms
65,664 KB
testcase_32 AC 58 ms
65,408 KB
testcase_33 AC 73 ms
68,352 KB
testcase_34 AC 68 ms
67,456 KB
testcase_35 AC 74 ms
67,840 KB
testcase_36 AC 78 ms
68,864 KB
testcase_37 AC 64 ms
67,840 KB
testcase_38 AC 69 ms
68,224 KB
testcase_39 AC 66 ms
67,840 KB
testcase_40 AC 72 ms
68,480 KB
testcase_41 AC 77 ms
68,864 KB
testcase_42 AC 76 ms
68,992 KB
testcase_43 AC 72 ms
68,096 KB
testcase_44 AC 75 ms
69,120 KB
testcase_45 AC 73 ms
68,480 KB
testcase_46 AC 75 ms
68,736 KB
testcase_47 AC 71 ms
68,224 KB
testcase_48 AC 66 ms
67,968 KB
testcase_49 AC 75 ms
68,480 KB
testcase_50 AC 61 ms
67,840 KB
testcase_51 AC 72 ms
68,480 KB
testcase_52 AC 66 ms
67,584 KB
testcase_53 AC 85 ms
70,272 KB
testcase_54 AC 66 ms
68,352 KB
testcase_55 AC 97 ms
69,760 KB
testcase_56 AC 68 ms
68,352 KB
testcase_57 AC 68 ms
67,840 KB
testcase_58 AC 91 ms
70,912 KB
testcase_59 AC 73 ms
68,736 KB
testcase_60 AC 69 ms
68,736 KB
testcase_61 AC 88 ms
69,760 KB
testcase_62 AC 67 ms
68,224 KB
testcase_63 AC 73 ms
68,480 KB
testcase_64 AC 75 ms
68,608 KB
testcase_65 AC 71 ms
67,456 KB
testcase_66 AC 74 ms
68,736 KB
testcase_67 AC 79 ms
69,376 KB
testcase_68 AC 71 ms
68,608 KB
testcase_69 AC 76 ms
69,248 KB
testcase_70 AC 60 ms
67,584 KB
testcase_71 AC 67 ms
68,224 KB
testcase_72 AC 64 ms
67,328 KB
testcase_73 AC 72 ms
68,352 KB
testcase_74 AC 76 ms
69,120 KB
testcase_75 AC 72 ms
68,352 KB
testcase_76 AC 69 ms
67,968 KB
testcase_77 AC 70 ms
68,224 KB
testcase_78 AC 74 ms
68,480 KB
testcase_79 AC 84 ms
69,120 KB
testcase_80 AC 76 ms
68,608 KB
testcase_81 AC 67 ms
68,352 KB
testcase_82 AC 60 ms
65,664 KB
testcase_83 AC 68 ms
67,840 KB
testcase_84 AC 80 ms
69,504 KB
testcase_85 AC 79 ms
68,736 KB
testcase_86 AC 68 ms
67,968 KB
testcase_87 AC 82 ms
69,504 KB
testcase_88 AC 67 ms
67,840 KB
testcase_89 AC 60 ms
67,584 KB
testcase_90 AC 76 ms
68,736 KB
testcase_91 AC 67 ms
67,968 KB
testcase_92 AC 75 ms
68,608 KB
testcase_93 AC 78 ms
69,248 KB
testcase_94 AC 67 ms
68,224 KB
testcase_95 AC 69 ms
68,736 KB
testcase_96 AC 73 ms
68,864 KB
testcase_97 AC 93 ms
70,528 KB
testcase_98 AC 95 ms
70,656 KB
testcase_99 AC 97 ms
70,912 KB
testcase_100 AC 89 ms
69,376 KB
testcase_101 AC 73 ms
68,352 KB
testcase_102 AC 89 ms
69,120 KB
testcase_103 AC 80 ms
69,504 KB
testcase_104 AC 81 ms
69,376 KB
testcase_105 AC 79 ms
69,504 KB
testcase_106 AC 78 ms
68,992 KB
testcase_107 AC 79 ms
69,120 KB
testcase_108 AC 79 ms
69,376 KB
testcase_109 AC 79 ms
69,120 KB
testcase_110 AC 77 ms
69,376 KB
testcase_111 AC 80 ms
69,504 KB
testcase_112 AC 78 ms
69,248 KB
testcase_113 AC 79 ms
69,120 KB
testcase_114 AC 78 ms
69,248 KB
testcase_115 AC 78 ms
69,632 KB
testcase_116 AC 80 ms
69,504 KB
testcase_117 AC 80 ms
69,248 KB
testcase_118 AC 79 ms
69,120 KB
testcase_119 AC 80 ms
69,248 KB
testcase_120 AC 79 ms
69,504 KB
testcase_121 AC 90 ms
69,632 KB
testcase_122 AC 81 ms
69,504 KB
testcase_123 AC 79 ms
69,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from math import factorial, exp
from copy import copy, deepcopy
from time import time

setrecursionlimit(1 << 20)
readline = stdin.readline
# @lru_cache(maxsize = None)
INF = 10 ** 18
MOD = 998244353
# MOD = 1000000007
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
ALP = 26
''' Input '''
def I(): return int(readline())
def ST(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def LII(): return list(map(lambda x: int(x) - 1, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x) - 1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b = map(int, input().split())
        node[a - 1].append(b - 1)
        node[b - 1].append(a - 1)
    return node 
def NODE_W(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b, c = map(int, input().split())
        node[a - 1].append((b - 1, c))
        node[b - 1].append((a - 1, c))
    return node

''' Array '''
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x

''' Sorted Array '''
# x <= A[i] (minimum i meeting the requirement)
def binary(sortedA, x): return bisect_left(sortedA, x)
# x < A[i] (minimum i meeting the requirement)
def binary2(sortedA, x): return bisect_right(sortedA, x + 1)
# number of x in A
def quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)

''' Alphabet '''
def id_a(s): return ord(s) - ord('a')
def id_A(s): return ord(s) - ord('A')
def st_a(i): return chr(ord('a') + i)
def st_A(i): return chr(ord('A') + i)

''' Other'''
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y + dy, x + dx) for dy, dx in DYDX if 0 <= y + dy < ly and 0 <= x + dx < lx]
def gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def is_prime(x):
    if x == 1 or x % 2 == 0: return x == 2
    f = 3
    while f * f <= x:
        if x % f == 0: return False 
        f += 2
    return True 
def gcd(x, y):
    if x == 0: return y
    return gcd(y % x, x)
def lcm(a, b):
    return a // gcd(a,b) * b

''' Output '''
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    for e in E: print(e)
def yn(x): print("Yes" if x else "No")
def blank(arr): print(" ".join(map(str, arr)))
def link(arr): print(''.join(map(str, arr)))
def debug(*args):
    if DEBUG:
        for e in args: print(e)
DEBUG = False
###############################################################################################

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from math import factorial, exp
from copy import copy, deepcopy
from time import time

setrecursionlimit(1 << 20)
readline = stdin.readline
# @lru_cache(maxsize = None)
INF = 10 ** 18
MOD = 998244353
# MOD = 1000000007
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
ALP = 26
''' Input '''
def I(): return int(readline())
def ST(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def LII(): return list(map(lambda x: int(x) - 1, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x) - 1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b = map(int, input().split())
        node[a - 1].append(b - 1)
        node[b - 1].append(a - 1)
    return node 
def NODE_W(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b, c = map(int, input().split())
        node[a - 1].append((b - 1, c))
        node[b - 1].append((a - 1, c))
    return node

''' Array '''
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x

''' Sorted Array '''
# x <= A[i] (minimum i meeting the requirement)
def binary(sortedA, x): return bisect_left(sortedA, x)
# x < A[i] (minimum i meeting the requirement)
def binary2(sortedA, x): return bisect_right(sortedA, x + 1)
# number of x in A
def quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)

''' Alphabet '''
def id_a(s): return ord(s) - ord('a')
def id_A(s): return ord(s) - ord('A')
def st_a(i): return chr(ord('a') + i)
def st_A(i): return chr(ord('A') + i)

''' Other'''
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y + dy, x + dx) for dy, dx in DYDX if 0 <= y + dy < ly and 0 <= x + dx < lx]
def gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def is_prime(x):
    if x == 1 or x % 2 == 0: return x == 2
    f = 3
    while f * f <= x:
        if x % f == 0: return False 
        f += 2
    return True 
def gcd(x, y):
    if x == 0: return y
    return gcd(y % x, x)
def lcm(a, b):
    return a // gcd(a,b) * b

''' Output '''
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    for e in E: print(e)
def yn(x): print("Yes" if x else "No")
def blank(arr): print(" ".join(map(str, arr)))
def link(arr): print(''.join(map(str, arr)))
def debug(*args):
    if DEBUG:
        for e in args: print(e)
DEBUG = False
###############################################################################################

N = ST()
K = ST()
ans = "285714"

NN = 0
for i in range(len(N)):
    e = int(N[len(N) - i - 1]) * pow(10, i, 6) % 6 
    NN += e 

N = NN % 6 

if N == 2:
    if int(K[-1]) % 2: idx = 2
    else: idx = 4
elif N == 5:
    if int(K[-1]) % 2: idx = 5
    else: idx = 1
else:
    idx = N 

print(ans[idx - 1])
0