Submission #1,411

2022-09-04 20:27:48

python3

Accepted 50/50

17ms

13224 KiB

# 31-el oszthato
def solve(n):
  ret=[n]
  while True:
    x,r=divmod(ret[-1],10)
    x-=3*r
    if x<0: break
    ret.append(x)
    if x==0:break
  print(["IGEN","NEM"][(ret[-1]%31>0)])
  print(" ".join(str(x) for x in ret[1:]))

solve(int(input()))

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	17ms	11356 KiB
		2	Accepted	0/0	17ms	11348 KiB
		3	Accepted	3/3	17ms	11532 KiB
		4	Accepted	3/3	17ms	11868 KiB
		5	Accepted	4/4	17ms	12008 KiB
		6	Accepted	4/4	17ms	11724 KiB
		7	Accepted	4/4	17ms	12260 KiB
		8	Accepted	4/4	17ms	12524 KiB
		9	Accepted	4/4	17ms	12456 KiB
		10	Accepted	4/4	17ms	12508 KiB
		11	Accepted	4/4	17ms	12936 KiB
		12	Accepted	4/4	17ms	12956 KiB
		13	Accepted	4/4	17ms	13060 KiB
		14	Accepted	4/4	17ms	13076 KiB
		15	Accepted	2/2	17ms	13224 KiB
		16	Accepted	2/2	17ms	13064 KiB