본문 바로가기

Algorithm 💡/Implementation50

[Softeer 기출문제] GBC import sys n,m = map(int,input().split()) limit = [0]*101 index = 1 test_index = 1 max_value = 0 for i in range(n): length, limit_fast = map(int,input().split()) for j in range(index,index+length): limit[j] = limit_fast index += length for i in range(m): test_length, test_fast = map(int,input().split()) for j in range(test_index,test_index + test_length): if test_fast > limit[j]: diff = test_fas.. 2023. 5. 30.
[Softeer 기출문제] 전광판 import sys t = int(input()) def set_time(n): time = [0]*7 if n == 0: time[0],time[1],time[2],time[4],time[5],time[6] = 1,1,1,1,1,1 elif n == 1: time[2],time[5] = 1,1 elif n == 2: time[0],time[2],time[3],time[4],time[6] = 1,1,1,1,1 elif n == 3: time[0],time[2],time[3],time[5],time[6] = 1,1,1,1,1 elif n == 4: time[1],time[2],time[3],time[5] = 1,1,1,1 elif n == 5: time[0],time[1],time[3],time[5],ti.. 2023. 5. 30.

티스토리툴바