Problem:


Score : 100 points

Problem Statement

Takahashi likes the sound when he buys a drink from a vending machine.

That sound can be heard by spending A yen (the currency of Japan) each time.

Takahashi has B yen. He will hear the sound as many times as he can with that money, but at most C times, as he would be satisfied at that time.

How many times will he hear the sound?

Constraints

All values in input are integers.

1 \leq A, B, C \leq 100

Input

Input is given from Standard Input in the following format:

A B C

Output

Print the number of times Takahashi will hear his favorite sound.

Sample Input 1

2 11 4

Sample Output 1

4

Since he has not less than 8 yen, he will hear the sound four times and be satisfied.

Sample Input 2

3 9 5

Sample Output 2

3

He may not be able to be satisfied.

Sample Input 3

100 1 10

Sample Output 3

0



Sample input:
2 11 4


Sample output:
4

Submission status: Wrong Answer

Solution code:
a,b,k=map(int,input().split())
cnt=0
for i in range(1,101):
  if a%i==0 and b%i==0:
    cnt+=1
  if cnt==k:
    print(i)
    break

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())

if A*C <=B:
  print(C)
else:
  print(C-1)

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())

if A * C <= B:
    print(C)
else:
    if A <= B:
        print(A)
    else:
        print(0)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
d=int(b/a)
if a<=c:
	if(d<=c):
		print(d)
	else:
		print(c)
else:
	print(0)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
print(min(round(b/a),c))

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())

num = B // A
print(num)

Submission status: Wrong Answer

Solution code:
A, B, C = map(int,input().split())

if A <= B:
    if A*C <= B:
        print(C)
    else:
        print(A)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
A, B, C = [int(s) for s in input().split(" ")]
for i in range(C):
  B -= A
  if B<0:
    break
print(B+A)

Submission status: Wrong Answer

Solution code:
a, b, c = input().split()
print(str(int(b) // int(a)))

Submission status: Wrong Answer

Solution code:
a, b, c = (int(i) for i in input().split())

if c > (b / a):
    print(b / a)
else:
    print(int(c))

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())

if a * c > b:
    print(c)
else:
    print(a // b)

Submission status: Wrong Answer

Solution code:
a, b, c = [int(x) for x in input().split()]
if a*c <= b:
    print('{0:.0f}'.format(c))
else:
    print('{0:.0f}'.format(b/a))

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin

def li(): return map(int, stdin.readline().split())

A, B, C = tuple(li())
times = B // A
print(min(A, C))

Submission status: Wrong Answer

Solution code:
a, b, c=map(int, input().split())
if b/a > c:
    print(c)
else:
    print(b/a)

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
print(int(B/A)) if B/A <= C else(C)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
s = b // a
g = a * c
if a > g:
    print(c)
else:
    print(s)

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
print(max(A//B, C))

Submission status: Wrong Answer

Solution code:
a, b, c = [int(x) for x in input().split()]
if a*c < b:
    print('{0:.0f}'.format(c))
else:
    print('{0:.0f}'.format(b/a))

Submission status: Wrong Answer

Solution code:
a, b, c = map(int,input().split())
print(max(c, b//a))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

A, B, C = (int(i) for i in input().split())

if round(B/A) >= C:
    print(C)
else:
    print(round(B/A))

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split(' '))
if b / a > c:
  time = c
else:
  time = b / a
print (time)

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())

if A * C < B:
    print(C)
else:
    if A < B:
        print(A)
    else:
        print(0)

Submission status: Wrong Answer

Solution code:
a,b,c = (int(_) for _ in input().split())

print(min(c, b/a))

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split(' '))
if c<b//a:
    print(b//a)
else:
    print(c)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int,input().split())
if(a > b):
  print(0)
elif(a*c <= b):
  print(c)
elif(a*c > b):
  print(a)

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
if B//A<=C:
    print(A//B)
else:
    print(C)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())
print(b%a if b%a <= c else c)

Submission status: Wrong Answer

Solution code:
A, B, C = map(int,input().split())
if C >= A // B:
  print(A // B)
else:
  print(C)

Submission status: Wrong Answer

Solution code:
a, b, c = (int(i) for i in input().split())

if a * c == b:
    print(c)
else:
    print(b//a)

Submission status: Wrong Answer

Solution code:
a,b,c = (int(i) for i in input().split())
if a*c <= a:print(c)
else:print(b//a)

Submission status: Wrong Answer

Solution code:
A,B,C = map(int, input().split())
print(B//A)

Submission status: Wrong Answer

Solution code:
a, b, c = map(int,input().split())
if(a > b):
  print(0)
elif(a*c <= b):
  print(b)
elif(a*c > b):
  print(a)

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())

print(min(B/A, C))

Submission status: Wrong Answer

Solution code:
A, B, C=input().split()
print(int(B)/int(A))

Submission status: Wrong Answer

Solution code:
a, b, c = [int(i) for i in input().split()]

print (min(a//b,c))

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())
print(int(min(C,A/B)))

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import re
import bisect
from datetime import datetime as dt
A, B, C = map(int, raw_input().split())

print max(B / A, C)

Submission status: Wrong Answer

Solution code:
a,b,c = map(int, input().split())
print(max(b//a, c))

Submission status: Wrong Answer

Solution code:
from sys import stdin

a, b, c = list(map(int, stdin.readline().rstrip().split()))

d = b / a
print(min(d, c))

Submission status: Time Limit Exceeded

Solution code:
s=list(input())
n1=len(s)

import sys
sys.setrecursionlimit(10**9)

def a(s,n1):
    for i in range(1,len(s)):
        if s[i-1]=="0" and s[i]=="1" or s[i-1]=="1" and s[i]=="0":
            s[i-1]=s[i]="a"
    s=list("".join(s).replace("a",""))
    
    if len(set(s))==1 or s==[]:
        print(n1-len(s))
    else:
        a(s,n1)
a(s,n1)

Submission status: Time Limit Exceeded

Solution code:
a,b,c=map(int, input().split())
krps=0
while krps<c:
  if b-a>=0:
    krps+=1
    b-=a
print(krps)

Submission status: Time Limit Exceeded

Solution code:
a,b,c = map(int, input().split())
count = 0
while (count != c) or (b < a):
    count += 1
    b = b - a
print(count)

Submission status: Time Limit Exceeded

Solution code:
import queue
a,b,c = map(int,input().split())
q = queue.LifoQueue()
for i in range(1,100):
  if(a%i == 0 and b%i == 0):
    q.put(i)
if c != 1:
  for i in range(c-1):
    q.get()
print(q.get())

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

if a*c > b:
  print(b//a)
else:
  print(c)

Submission status: Accepted

Solution code:
A,B,C= map(int, input().split())

kei = A*C

if B >= kei:
    print(C)
else:
    print(int(B/A))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

n = b // a
if n < c:
    print(n)
else:
    print(c)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(min(c,(int)(b/a)))

Submission status: Accepted

Solution code:


A, B, C = map(int, input().split())


i = B // A
if i > C:
    print(C)
else:
    print(i)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if A*C <= B:
  print(C)
else:
  print(B//A)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

n = b // a
if n >= c:
    print(c)
else:
    print(n)

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

if A * C <= B:
    print(C)
else:
    print(B//A)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(min(b//a, c))

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
print(min(b//a, c))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(min(c,b//a))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(c if b >= a*c else b//a)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(min(c,b//a))

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
print(b // a if b // a <= c else c)

Submission status: Accepted

Solution code:

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

d=b//a

if d>c:
    print(c)
else:
    print(d)

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
print(min(C,B//A))

Submission status: Accepted

Solution code:
A ,B, C = map(int,input().split())

count = B//A
if count > C:
    print(C)
else:
    print(count)

Submission status: Accepted

Solution code:
S_list = list(map(int,input().split()))
a,b,c = S_list
bell = int(b/a)
if bell >= c:
    result = c
else:
    result = bell
print(result)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a * c > b:
    print(b//a)
else:
    print(c)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if b // a < c:
    print(b // a)
else:
    print(c)

Submission status: Accepted

Solution code:
a = input().split()
if int(int(a[1]) / int(a[0])) >= int(a[2]):
    print(a[2])
else:
    print(int(int(a[1]) / int(a[0])))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(c if a * c <= b else b // a)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
print(min((a[1]//a[0]),a[2]))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(min(c, b//a))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(min(b//a,c))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

num = b // a

print(min(num, c))

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
print(min(b//a,c))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split(" "))
print(min(c,b//a))

Submission status: Accepted

Solution code:
a,b,c=list(map(int ,input().split()))
myans1=int(b/a)
if(myans1>c):
	print(c)
else:
	print(myans1)

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
print(min(C,B//A))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

oto = b // a
if oto <= c :
    print(oto)
elif oto > c :
    print(c)

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if B//A>C:
    print(C)
else:
    print(B//A)

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split())

x = B // A
if x < C:
    print(x)
else:
    print(C)

Submission status: Accepted

Solution code:
#ABC120A
a,b,c = map(int,input().split())
print(min(c,b//a))

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if B // A <= C:
    print(B // A)
else:
    print(C)

Submission status: Accepted

Solution code:
#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

a,b,c=input2()
if b//a >= c:
	print(c)
else:
	print(b//a)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

n = min(c, b // a)

print(n)

Submission status: Accepted

Solution code:
def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    a, b, c = Input()
    print(min(b//a, c))


main()

Submission status: Accepted

Solution code:
def resolve():
    A, B, C = list(map(int, input().split()))
    print(min(C, B//A))

if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

can_listen = b // a

if can_listen < c:
    print(can_listen)
else:
    print(c)

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split())

if b//a>c:
    print(c)

else:
    print(b//a)

Submission status: Accepted

Solution code:
# A - Favorite Sound
# https://atcoder.jp/contests/abc120/tasks/abc120_a

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

count = b // a

if count > c:
    count = c

print(count)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

num = int(B / A)

if num >= C:
    print(C)
elif num >= 1:
    print(num)
else:
    print('0')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

print(min(B//A, C))

Submission status: Accepted

Solution code:
A,B,C = map(int, input().split())
ans = int(B/A) if int(B/A) <= C else C
print(ans)

Submission status: Accepted

Solution code:
A,B,K = map(int,input().split())
print((B//A,K)[B//A >= K])

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if b/a<c:
    print(int(b/a))
else:
    print(c)

Submission status: Accepted

Solution code:
def atc_120a(input_value: str) -> int:
    A, B, C = map(int, input_value.split(" "))
    return min(C, B // A)

input_value = input()
print(atc_120a(input_value))

Submission status: Accepted

Solution code:
# 数値の取得
A,B,C = map(int,input().split())

# 計算と比較後回数を出力
max_cnt = B // A
sat_cnt = C
if max_cnt < sat_cnt:
  print(max_cnt)
else:
  print(sat_cnt)

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

print(min(C , B // A))

Submission status: Accepted

Solution code:
# A - Favorite Sound

A, B, C = map(int, input().split())

# A enn B kai MAX c

if A * C <= B:
    answer = C
else:
    answer = B // A

print(answer)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
x=b//a
if x>=c:
    print(c)
else:
    print(x)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
sound_count = B // A
if sound_count >= C:
    answer = C
else:
    answer = sound_count
print(answer)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print(min(C, B // A))

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print(C if B // A > C else B // A)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if B // A > C:
    print(C)
else:
    print(B // A)

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
print(min(b//a, c))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
# b/aの商がcより大きければcを出力
if b // a > c:
    print(c)
# そうでなければb/aの商を出力
else:
    print(b // a)

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split())

if (A * C) <= B:
    answer = C
else:
    answer = B // A
print(answer)

Submission status: Accepted

Solution code:
# 120_a
A, B, C = map(int, input().split())
if (1<=A&A<=100)&(1<=B&B<=100)&(1<=C&C<=100):
    C_price=A*C
    if B<C_price:
        B_count=int(B/A)
    elif B>=C_price:
        B_count=C
    print(B_count)

Submission status: Accepted

Solution code:
a, b, c = (int(n) for n in input().split())
if b // a <= c: print(b // a)
else: print(c)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(min(b//a, c))

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
print(min(B//A,C))

Submission status: Accepted

Solution code:
#116A
# 1.値を正しく取得
a, b, c = (int(x) for x in input().split())

# 2.正しく処理
print(min(b//a,c))

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
count=0
while B>0:
   if A>B:
      break
   B=B-A
   count+=1
   if count>=C:
      break
print(count)

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
print(min(b // a, c))

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print(min(B // A, C))

Submission status: Accepted

Solution code:
A, B, C = map (int, input().split())

print(min(C, B // A))

Submission status: Accepted

Solution code:
A, B, C = map (int, input().split())

if A * C <= B:
    print(C)
elif A * C >= B:
    print(B // A)

Submission status: Accepted

Solution code:
price, poket_money, max_music = map(int, input().split())

music_times = -1
for i in range(0, poket_money + 1, price):
    music_times += 1
    if max_music == music_times:
        break

print(music_times)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

print(min(B // A, C))

Submission status: Accepted

Solution code:
# 手持ちの金で、何回聞けるかを求める

A, B, C = map(int, input().split())

if C <= (B // A):
    print(C)
else:
    print(B // A)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

# 高橋くんは、お気に入りの自販機の音を、1回 A円 で聞くことができる。
# 高橋くんは、B円 持っている。
# C回 聞くと満足するので、B円 で 最大C回 まで聞けるだけ聞く。
# 高橋くんは、お気に入りの音を何回出来るか出力

i = B // A
if i > C:
    print(C)
else:
    print(i)

Submission status: Accepted

Solution code:
'''
問題：
    高橋くんは、自動販売機でジュースを買ったときの音が好きです。
    その音は 1回 A円で聞くことができます。

    高橋くんは B円持っていますが、
    お気に入りの音を C回聞くと満足するため、
    B円で最大 C回まで聞けるだけ聞きます。
    高橋くんはお気に入りの音を何回聞くことになるでしょうか。
'''

'''
制約：
    入力は全て整数である。
    1 ≤ A, B, C ≤ 100
'''

# 標準入力から A, B, C の値を取得する
a, b, c = map(int, input().split())

# お気に入りの音を聞ける回数を計算して出力する
result = 0
if a * c < b:
    result = c
else:
    result = int(b / a)

print(result)

Submission status: Accepted

Solution code:
import math

a, b, c = map(int,input().split())
print(min(math.floor(b/a), c))

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split())

if B//A >= C:
    print(C)
else:
    print(B//A)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if B // A >= C:
    print(C)
else:
    print(B // A)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if B // A >= C:
    print(C)
else:
    print(B // A)

Submission status: Accepted

Solution code:
per_price, takahashi_all_money, count_satisfied_sound = map(int, input().split())

need_money_of_satisfied = count_satisfied_sound * per_price

if takahashi_all_money >= need_money_of_satisfied:
    print(count_satisfied_sound)
elif takahashi_all_money < need_money_of_satisfied:
    print(takahashi_all_money // per_price)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
n = B // A
if n > C:
    print(C)
else:
    print(n)

Submission status: Accepted

Solution code:
A, B, C = list(map(int,input().split()))

ans = min(B//A,C)
print(ans)

Submission status: Accepted

Solution code:

a,b,c=map(int,input().split())
b //= a
print(min(b,c))

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split())

a = B // A

if C > a:
    print(a)
else:
    print(C)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(min(c, b//a))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if b < a:
    print(0)
elif c <= b // a:
    print(c)
else:
    print(b // a)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
ans = min(B // A, C)
print(ans)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(min(b//a,c))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(min(c, b // a))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(min(c,b//a))

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())

ans=B//A

if ans>C:
    ans=C
print(ans)

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

print(min(C, B//A))

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    A, B, C = LI()

    ans = min(B // A, C)
    print(ans)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d=b//a
if c>=d:
  print(d)
else:
  print(c)

Submission status: Accepted

Solution code:
def main():
    a, b, c = map(int, input().split())

    d = b // a

    print(min(c, d))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
print(min(B//A,C))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print([b//a,c][b//a>c])

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
if b//a <= c:
    print(b//a)
else:
    print(c)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(c if b-a*c>=0 else b//a)

Submission status: Accepted

Solution code:
value, money, max_count = map(int, input().split())

ans = min(money // value, max_count)
print(ans)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(min(b//a, c))

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
print(min(B//A,C))

Submission status: Accepted

Solution code:
a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
if b/a>=c:
  print(c)
else:
  print(int(b/a))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a * c <= b:
    print(c)
if a * c > b:
    print(b // a)
#h
#
#
#
# e
# d
# h
# h
# r
# h
# b
# h
# cr
# h
# c
# b
# r
# y
# c
# y
# e
# g
# y
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
# e

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a * c <= b:
    print(c)
if a * c > b:
    print(b // a)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a * c <= b:
    print(c)
if a * c > b:
    print(b // a)
#h
# 
# 
# 
# e
# d
# h
# h
# r
# h
# b
# h
# cr
# h
# c
# b
# r
# y

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
for i in range(C+1):
    if A*(i+1) <=B:
        continue
    else:
        break
print(i)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(min(c, b // a))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    A, B, C = map(int, readline().split())

    print(min(B // A, C))

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A,B,C=list(map(int,input().split()))

if A*C <= B:
    ans = C
else:
    ans = B//A
    
print(ans)

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if c <= b//a:
    print(c)
else:
    print(b//a)

Submission status: Accepted

Solution code:
A,B,C = map (int, input ().split ())
x = B//A
if x > C:
  print (C)
else:
  print (x)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if b/a >= c:
  print(c)
else:
  print(int(b/a))

Submission status: Accepted

Solution code:
import math

a=list(map(int,input().split()))
print(min(math.floor(a[1]/a[0]),a[2]))

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))

print(min(b // a, c))

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split())
print(min(b//a,c))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if b//a>=c:
  print(c)
else:
  print(b//a)

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if a*c <= b:
  print(c)
else:
  print(b//a)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a*c<b:
    print(c)
else:
    print(b//a)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
count = min(c, b//a)
print(count)

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [input() for _ in range(n)]

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

print(min(c, b//a))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
print(min(b//a, c))

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入g
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
a,b,c = readInts()
print(min(c, b//a))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

ans=0
while b>=a and ans<c:

    b=b-a
    ans+=1

print(ans)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(min(b // a, c))

Submission status: Accepted

Solution code:
A,B,C = map(int, input().split())

if B / A >= C:
    print(C)

elif 1 <= B / A < C:
    print(B //A)

else:
    print(0)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ans = min(c, b // a)
print(ans)

Submission status: Accepted

Solution code:
A,B,C = map(int, input().split())
D = B // A
print(C if C < D else D)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(min(b//a, c))

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

ans = min(B//A,C)
print(ans)

Submission status: Accepted

Solution code:
n=input().split()
A=int(n[0])
B=int(n[1])
C=int(n[2])

if B>=A*C:
    print(C)
elif B<A*C:
    print(B//A)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if B // A >= C:
    print(C)
else:
    print(B // A)

Submission status: Accepted

Solution code:
def main():
    a, b, c = map(int, input().split())
    cnt = 0
    current = a
    while current <= b:
        if cnt == c:
            break
        cnt += 1
        current += a
    print(cnt)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ans = 0
for i in range(1, c+1):
  if a*i <= b:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())


print(min(b//a,c))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(min(c,b//a))

Submission status: Accepted

Solution code:

A, B, C = map(int, input().split())

print(min(B//A, C))

Submission status: Accepted

Solution code:
a,b,c=list(map(int, input().split()))
print(min(b//a,c))

Submission status: Accepted

Solution code:
import sys


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


def main():
    a, b, c = nm()
    print(min(c, b // a))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
cnt = 0

while a <= b:
    b -= a
    cnt += 1

if cnt >= c:
    print(c)
else:
    print(cnt)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print(min(C, B//A))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
res = min(c, b// a)
print(res)

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if A*C<=B :
  print(C)
else:
  print(B//A)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
print(min(int(b/a),c))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if b//a>=c:
    print(c)
else:
    print(b//a)

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

max_sound = B // A

if C > max_sound:
    print(max_sound)
else:
    print(C)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if b //a < c:
    print(b//a)
else:
    print(c)

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
n = b % a
if a * c <= b:
  print(c)
else:
  print(int((b - n) / a))

Submission status: Accepted

Solution code:
A,B,C = list(map(int,input().split()))
count = B // A
if count < C:
    print(count)
else:
    print(C)

Submission status: Accepted

Solution code:
a,b,c=list(map(int,input().split()))
count=0
while(a<=b):
  b-=a
  if count==c:
    break
  count+=1
print(count)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a*c<=b:
    print(c)
elif a*c>b:
    print(b//a)

Submission status: Accepted

Solution code:
a,b,c=map(int, input().split())
if a*c>=b:
  print(b//a)
else:
  print(c)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if b // a > c:
  print(c)
else:
  print(b // a)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
d = int(b // a)
if d < c:
    print(d)
else:
    print(c)

Submission status: Accepted

Solution code:
#! python3
#  solve_120_A.py

A,B,C = map(int,input().split())

print(min(B//A,C))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print(min(b//a,c))

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())

ans = B//A
if ans > C:
  print(C)
else:
  print(ans)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(min((b // a), c))

Submission status: Accepted

Solution code:
ary = input().split(" ")
A = int(ary[0])
B = int(ary[1])
C = int(ary[2])

print(C) if int(B/A) >= C else print(int(B/A))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
 
if a <= b:
  x = b // a
  if x >= c:
    print(c)
  else:
    print(x)
else:
  print(0)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if b // a < c:
    print(b // a)
else:
    print(c)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a*c<=b:
    print(c)
else:
    print(b//a)

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
print(min(C,B//A))

Submission status: Accepted

Solution code:
A, B, C = input().strip().split()
A, B, C = [int(A), int(B), int(C)]

if B/A < 1:
    print(0)
elif B/A > C:
    print(C)
else:
    print(int(B/A))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ans = b//a
if ans > c:
    ans = c
print(ans)