提出 #45359171

---

ソースコード 拡げる

import sys
from functools import lru_cache
from collections import defaultdict


sys.setrecursionlimit(10**9)
def I(): return input()
def IS(): return input().split()
def II(): return int(input())
def LI(): return list(input())
def MI(): return map(int,input().split())
def LMI(): return list(map(int,input().split()))
def LLMI(number): return [list(map(int,input().split())) for _ in range(number)]

def generate_input()->list:
    import random
    inputdata = []
    n = random.randint(0, 100)
    inputdata.append(n)
    return inputdata


def simple_solve(n):
    ans = 0
    return ans


def solve(n):
    jlist = []
    for i in range(9):
        j = i + 1
        if n % j == 0:
            jlist.append(j)
    ans = []

    for i in range(n+1):
        for j in jlist:
            if i % (n/j) == 0:
                ans.append(j)
                break
        if len(ans) == i:
            ans.append('-')

    return ''.join(map(lambda x: str(x), ans))


if __name__=='__main__':
    test = False
    if test:
        inputdata = generate_input()
        a = simple_solve(*inputdata)
        b = solve(*inputdata)
        if a != b:
            print(*inputdata)
            print(a, b)
            exit(1)
    else:
        inputdata = []
        inputdata.append(II())
        print(solve(*inputdata))

提出情報

ジャッジ結果