Algorithm/SWEA

[SWEA - D3] 5431. ๋ฏผ์„์ด์˜ ๊ณผ์ œ ์ฒดํฌํ•˜๊ธฐ

hello_u 2023. 5. 9. 22:49

 

๋‚˜์˜ ์ฝ”๋“œ 

T = int(input())
for t in range(1,T+1):
    n,k = map(int,input().split())
    arr = list(map(int,input().split()))
    print("#"+str(t) , end=" ")
    for i in range(1,n+1):
        if i not in arr:
            print(i , end=" ")
    print()

 

๊ณผ์ œ๋ฅผ ์ œ์ถœํ•˜์ง€ ์•Š์€ ์‚ฌ๋žŒ์˜ ๋ฆฌ์ŠคํŠธ๋ฅผ ๋งŒ๋“ค์–ด์„œ 

append ํ•˜๊ณ  ๋งˆ์ง€๋ง‰์— ์ถœ๋ ฅํ•ด๋„ ๋˜๊ฒ ๋‹ค.