Algorithm/Baekjoon

2869

import math a,b,v = map(int, input().split()) day = (v-b)/(a-b) if a-b!=1: day= math.ceil(day) else: day=int(day) print(day)

1193

input_num = int(input()) line = 0 max_num = 0 while input_num > max_num: line += 1 max_num += line gap = max_num - input_num if line % 2 == 0: top = line - gap under = gap + 1 else : top = gap + 1 under = line - gap print("%d/%d"%(top,under)) 시간 초과로 못풀었던 문제....

2292

a= int(input()) count = 1 if a>1: a-=1 while 1: a-=(6*count) count +=1 if a

4673

temp = [i for i in range(1,10001)] for i in range(1,10000): result = 0 result +=i for j in str(i): result+=int(j) if result in temp: temp.remove(result) for num in temp: print(num)

1712

import math a,b,c = map(int,input().split()) if b < c: temp = c-b print(math.floor(a/temp + 1))else: print(-1)