[code] - 백준 수학 1193,2869,10250,2775,1712,2839,2292 python

1193

#1193
a = int(input())
count = 0
while (a > count) :
    a -= count
    count += 1
c = str((count+1)-a)
d = str(a)

if count%2 == 0 :
    print(d+"/"+c)
elif count%2 != 0:
    print(c+"/"+d)

2869

#2869
import sys
a, b, c = map(int, sys.stdin.readline().split())
print((c-b-1)//(a-b)+1)
    

10250

#10250
T = int(input())
for i in range(T):
    a,b,c = map(int,input().split())
    if c%a == 0 :
        print((a*100)+(c//a))
    else :
        print(((c%a)*100)+(c//a)+1)
  

2775

#2775
T = int(input())

for i in range(T):
    a = int(input())
    b = int(input())
    c = [i for i in range(1,b+1)]
    for _ in range(a):
        for j in range(1, b):
            c[j] += c[j-1]
    print(c[-1])

2292

#2292

a = int(input())
count = 1

while a > 1 :
    a -= 6*count
    count +=1
print(count)   

2839

#2839

a = int(input())

def solution(n):
    for i in range((a//3)+1):
        for j in range((a//5)+1):
            if (3*i)+(5*j) == a :
                
                return i+j
            
    return -1

print(solution(a))

1712

#1712

a,b,c = map(int,input().split())
count = 0

if b < c :
    count = a//(c-b)
    print(count+1)
else :
    print(-1)