백준2347 [백준/파이썬] 2622번 삼각형만들기 -Codefrom sys import stdinn = int(stdin.readline())res = 0for i in range(1, n + 1): for j in range(i, n + 1): k = n - i - j if k pypy3로 제출하였습니다. 2024. 6. 22. [백준/파이썬] 12167번 Standing Ovation (Large) -Codefor t in range(1, int(input()) + 1): s_max, audience = input().split() s_max = int(s_max) cnt, res = int(audience[0]), 0 for level in range(1, s_max + 1): if cnt 2024. 6. 21. [백준/파이썬] 27130번 Long Multiplication -Coden1 = int(input())n2 = input()res = 0print(n1)print(n2)for i in range(1, len(n2) + 1): temp = n1 * int(n2[-i]) print(temp) res += temp * (10 ** (i - 1))print(res) 2024. 6. 20. [백준/파이썬] 31994번 강당 대관 -Codedic = {}for _ in range(7): name, cnt = input().split() dic[name] = int(cnt)print(max(dic, key=dic.get)) 2024. 6. 19. [백준/파이썬] 31962번 등교 -Coderes = []n, x = map(int, input().split())for _ in range(n): s, t = map(int, input().split()) if s + t 0 else -1) 2024. 6. 18. [백준/파이썬] 19963번 Санта Клаус -Coden, m, k = map(int, input().split())res = [0] * (n + 1)for _ in range(2): for i in list(map(int, input().split())): res[i] = 1print(n - m - k)for i in range(1, n + 1): if res[i] == 0: print(i, end=" ") 2024. 6. 17. 이전 1 ··· 36 37 38 39 40 41 42 ··· 392 다음
