結果
問題 | No.1595 The Final Digit |
ユーザー | kyaneko999 |
提出日時 | 2021-07-09 21:37:47 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 144 ms / 2,000 ms |
コード長 | 3,388 bytes |
コンパイル時間 | 1,400 ms |
コンパイル使用メモリ | 86,880 KB |
実行使用メモリ | 78,216 KB |
最終ジャッジ日時 | 2023-09-14 08:03:20 |
合計ジャッジ時間 | 3,977 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 128 ms
78,024 KB |
testcase_01 | AC | 139 ms
77,876 KB |
testcase_02 | AC | 144 ms
77,692 KB |
testcase_03 | AC | 138 ms
77,984 KB |
testcase_04 | AC | 142 ms
77,972 KB |
testcase_05 | AC | 139 ms
78,048 KB |
testcase_06 | AC | 138 ms
78,036 KB |
testcase_07 | AC | 138 ms
77,892 KB |
testcase_08 | AC | 137 ms
77,856 KB |
testcase_09 | AC | 131 ms
78,032 KB |
testcase_10 | AC | 128 ms
77,896 KB |
testcase_11 | AC | 128 ms
77,972 KB |
testcase_12 | AC | 125 ms
77,972 KB |
testcase_13 | AC | 128 ms
77,736 KB |
testcase_14 | AC | 131 ms
78,216 KB |
testcase_15 | AC | 128 ms
78,176 KB |
testcase_16 | AC | 126 ms
78,064 KB |
testcase_17 | AC | 129 ms
78,048 KB |
testcase_18 | AC | 130 ms
77,764 KB |
testcase_19 | AC | 128 ms
77,852 KB |
ソースコード
from sys import exit, stdin, setrecursionlimit from collections import deque, defaultdict, Counter from copy import deepcopy from bisect import bisect_left, bisect_right, insort_left, insort_right from heapq import heapify, heappop, heappush from itertools import product, permutations, combinations, combinations_with_replacement from functools import reduce from math import gcd, sin, cos, tan, asin, acos, atan, atan2, degrees, radians, ceil, floor, sqrt, factorial from math import pi as PI from random import randint # from decimal import Decimal setrecursionlimit(500000) INF = (1<<61)-1 EPS = 1e-10 MOD = 10**9+7 # MOD = 998244353 def input(): return stdin.readline()[:-1] def intput(): return int(stdin.readline()) def minput(): return stdin.readline()[:-1].split() def linput(): return stdin.readline()[:-1].split() def mint(): return map(int,stdin.readline().split()) def lint(): return list(map(int,stdin.readline().split())) def ilint(): return int(stdin.readline()), list(map(int,stdin.readline().split())) def lcm(x,y): return x*y//gcd(x,y) def lgcd(l): return reduce(gcd,l) def llcm(l): return reduce(lcm,l) def powmod(n,i,mod=MOD): return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod) def div2(x): return x.bit_length() def div10(x): return len(str(x))-(x==0) def popcount(x): return bin(x).count('1') def digit(x,i,max_len=None): s = str(x) if max_len: i -= max_len-len(s) return int(s[i-1]) if i>0 else 0 def digitsum(x): ans = 0 for i in range(div10(x)): ans += digit(x,i+1) return ans def pf(x,mode='counter'): C = Counter() p = 2 while x>1: k = 0 while x%p==0: x //= p k += 1 if k>0: C[p] += k p = p+2-(p==2) if p*p<x else x if mode=='counter': return C S = set([1]) for k in C: T = set() for x in S: for i in range(C[k]+1): T.add(x*(k**i)) S = T if mode=='set': return S if mode=='list': return sorted(S) def isprime(x): if x<2: return False return len(pf(x,'set'))==2 def matmul(A, B): # import numpy A1, A2 = A >> 15, A & (1 << 15) - 1 B1, B2 = B >> 15, B & (1 << 15) - 1 X = np.dot(A1, B1) % MOD Y = np.dot(A2, B2) Z = np.dot(A1 + A2, B1 + B2) - X - Y return ((X << 30) + (Z << 15) + Y) % MOD def matpow(A, N): P = np.eye(A.shape[0], dtype=np.int64) while N: if N & 1: P = matmul(P, A) A = matmul(A, A) N >>= 1 return P def zash(S): lis = sorted(S) dic = {} for i,x in enumerate(lis): dic[x] = i return lis, dic def pr(*x): print(*x, sep='', end='') if len(x) else print() def lprint(l): for x in l: print(x) def ston(c, c0='a'): return ord(c)-ord(c0) def ntos(x, c0='a'): return chr(x+ord(c0)) def judge(x, l=['Yes', 'No']): print(l[0] if x else l[1]) def debug(*x, flag=1): if flag: print(*x) ###################################################### p,q,r,K=mint() dic={} l=[None]*4 k=4 while True: if (p,q,r) in dic: period=k-dic[(p,q,r)] init=dic[(p,q,r)] break new=(p+q+r)%10 if k==K: print(new) exit() dic[(p,q,r)]=k l.append(new) p,q,r=q,r,new k+=1 print(l[(K-k)%period+init])