Submission #20505288

---

Source Code Expand

import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
from functools import lru_cache,reduce
#from heapq import heappush,heappop,heapify,heappushpop,heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
#numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
sys.setrecursionlimit(10**4+10)
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)

@lru_cache
def solve(n,A):
    if n==0:
        return 0
    elif n<=0:
        return -float('INF')
    match={1:2,2:5,3:5,4:4,5:5,6:6,7:3,8:7,9:6}
    ans=[]
    for AA in A:
        ans.append(solve(n-match[AA],A)*10+AA)
    return max(ans)

def main():
    mod = 10**9+7
    mod2 = 998244353
    n,m=map(int, input().split())
    A=tuple(map(int, input().split()))
    print(solve(n,A))

if __name__ == '__main__':
    main()

Submission Info

Judge Result