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: Accepted

Solution code:
def main():
    a, b, c = [int(x) for x in input().split()]
    times = b // a
    if times < c:
        print(times)
    else:
        print(c)
main()

Submission status: Accepted

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

a = int(a)
b = int(b)
c = int(c)

if 1 <= a <= 100:
    if 1 <= b <= 100:
        if 1<= c <= 100:

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

Submission status: Accepted

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

Submission status: Accepted

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

n = b // a

print(min(n, c))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
i = input().split()

i = list(map(int, i))

if i[0] * i[2] < i[1]:
    print(i[2])
else:
    print(int(i[1]/i[0]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
numerosStr = input().split(" ")
numeros=[]
for i in numerosStr:
    numeros.append(int(i))

if numeros[1]/numeros[0] > numeros[2]:
    print(int(numeros[2]))
else:
    print(int(numeros[1]/numeros[0]))

Submission status: Accepted

Solution code:
line = input()
A, B, C = [int(n) for n in line.split()]
D = int(B/A)
if D >= C:
    print(C)
else:
    print(D)

Submission status: Accepted

Solution code:
line = input()
A,B,C = [int(n) for n in line.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())

d=b//a

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
cnt = B//A
print(min(cnt, 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:
import math
import collections
import sys

#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

a,b,c=MI()
print(min(int(b/a),c))

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 = list(map(int, input().split()))
a = A[1]//A[0]
if a <= A[2]:
    print(a)
else:
    print(A[2])

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:
per_cost, possess, times = map(int, input().split())

ans = min(possess // per_cost, times)
print(ans)

Submission status: Accepted

Solution code:
per_cost, possess, times = map(int, input().split())

MAX_cost = times * per_cost

if (possess >= MAX_cost):
    ans = times
else:
    ans = possess // per_cost

print(ans)

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 a*c <= b:
  print(c)
else:
  print(b // a)

Submission status: Accepted

Solution code:
import numpy as np
import sys

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())

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

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())
t = int(b/a)
if t<=c:
    print(t)
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=list(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(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(int(b//a))

Submission status: Accepted

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

sound_max = b//a

if c >= sound_max:
    print(sound_max)

elif c <= sound_max:
    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 = 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(int(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(c,b//a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m,k = map(int, input().split())
print(min(m // n,k))

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix

# strlist = "abcdefghijklmnopqrstuvwxyz"
a,b,c = map(int,input().split())
ans = min(b//a,c)

print(ans)
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(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(int(b/a),c))

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:
a,b,c= map(int,input().split())
 
if b//a >= c:
    print(c)
else:
    print(b//a)

Submission status: Accepted

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

if a > b:
    print(0)
else :
    if b >= a * c:
        print(c)
    else :
        print(math.floor(b/a))

Submission status: Accepted

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

if a > b:
    print("0")
else :
    if b >= a * c:
        print(c)
    else :
        print(math.floor(b/a))

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
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    a, b, c = input_nums()
    if b//a > c: print(c)
    else: print(b//a)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(min(c,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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, y, z = map(int,input().split())
print(min(int(y/x), z))

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:
#ABC-120-A
A, B, C = map(int, input().split())
ans = 0
while B >= A:
    B -= A
    ans += 1
    if ans == C:
        break
        
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b,c = LI()
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())

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())
print(min(B // A, C))

Submission status: Accepted

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

result = b // a
if result > c:
    result = c

print(result)

Submission status: Accepted

Solution code:
# ABC 120: A – Favorite Sound
a, b, c = [int(s) for s in input().split()]
print(c if b // a > c else b // a)

Submission status: Accepted

Solution code:
import math
a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
n = math.floor(y/x)
if n >= z:
    print(z)
else:
    print(n)

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  a, b, c = map(int, readline().split())
  print(min(b//a, c))
  
  
  
if __name__ == '__main__':
  main()

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:
import itertools
import fractions
def main():
  a,b,c = map(int,input().split())
  print(c if a*c <= b else b//a)
if __name__ == '__main__':
  main()

Submission status: Accepted

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

kikeru = b//a

if kikeru >= c:
    ans = c
else:
    ans = kikeru
    
print(ans)

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:
#どっちで出すか注意, rstrip注意
#提出前に見返すこと！
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate
    #from itertools import product
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a, b,c = map(int, input().split())

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

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

a,b,c = iim()
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 = list(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())
if a*c<b :print(c)
else:print(b//a)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()

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

Submission status: Accepted

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

if x <= C :
	print( x )
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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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(int(b/a) if int(b/a)<c else c)

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:
# coding: utf-8

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

num = B // A
# print(num)

print(min(num, C))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    from builtins import int, map, list, print, min
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = [int(x) for x in input().split()]
print(min(C, B // A))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import math

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

if a*c<=b:
  print(c)
else:
  print(math.floor(b/a))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    cost, budget, maxCount = map(int, input().split())
    ct = budget // cost
    print(min(maxCount, ct))
    

main()

Submission status: Accepted

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

if (B/A)>=C:
    print(C)
elif (B/A)<C:
    print(math.floor(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 b // a >= c:
    print(c)
else:
    print(b // a)

Submission status: Accepted

Solution code:
# ABC120 A

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

if __name__ == '__main__'    :
    main()

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:
a,b,c = map(int, input().split())
n = min(b//a, c)
print(n)

Submission status: Accepted

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

n = 0

for i in range(c + 1):
    if n < c and b - a >= 0:
        b = b - a
        n = n + 1
    else:
        print(n)
        break

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())
if B // A <= C:
    print(B // A)
else:
    print(C)

Submission status: Accepted

Solution code:
A,B,C = map(int, input().split(" "))
c = B//A
if c>=C:
	print(C)
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())
if a > b:
    print(0)
elif a == b:
    print(1)
elif a < b:
    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())
i=B//A
if i>C:
    print(C)
else:
    print(i)

Submission status: Accepted

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

print(min(c, math.floor(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 = [int(i) for i in 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 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:
def main():
    a, b, c = map(int, input().split())
    Count = 0
    while True:
        b = b-a
        if Count == c or b < 0:
            break
        Count += 1
    print(Count)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
d = 0
for i in range(1,c+1):
  if i*a <=b:
    d += 1
    continue
  else:
    break
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())
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(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:
# A - Favorite Sound
A,B,C=list(map(int,input().split()))

D=B//A

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

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
ans = min(ans, c)
print(ans)

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())

manzoku = c
saitei = b//a

print(min(manzoku, saitei))

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 c> b/a :
  print(int(b/a))
else:
  print(c)

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if B/A<0:
    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())
print(min(c,(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 = [int(s) for s in input().split()]
 
print(C) if B//A >= 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] = list(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(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 b//a >= c:
  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())

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

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in 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 = list(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 c*a<=b:
  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:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = [int(_) for _ in input().split()]
print(min(b//a, c))

Submission status: Accepted

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

if a*c > b:
    print(int(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:
#120_A
A,B,C=map(int,input().split())
print(min(C,B//A))

Submission status: Accepted

Solution code:
# Code for A - Favorite Sound
# Use input() to fetch data from STDIN
[a, b, c] = [int(x) for x in input().split()]

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

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,b,c = map(int, input().split())
if b//a >= c:
  print(c)
if b//a < c:
  print(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:
s=list(map(int,input().split()))
a=s[1]//s[0]
if a<=s[2]:
  print(int(a))
else:
  print(s[2])

Submission status: Accepted

Solution code:
class Solution:
    def solve(self, A: int, B: int, C: int) -> str:

        return min(B // A, C)


if __name__ == '__main__':

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

    # solve
    solution = Solution()
    print(solution.solve(A, B, C))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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())
ans = 0
if b // a >= c:
    ans = c
else:
    ans = b // a

print(ans)

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(C, 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:
def main():
    a, b, c = map(int, input().split())

    ans = b // a

    print(ans if ans < c else c)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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())

cnt = b // a 

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

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())
if a*c<=b: 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(B//A)
    
elif B//A >= C:
    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())
print(B//A if B//A<C else C)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B,C = [int(i) for i in input().split()]
if B // A >= C:
    print(C)
else:
    print(B//A)

Submission status: Accepted

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

Submission status: Accepted

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

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:
#!/usr/bin/env python3

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

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if int(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)
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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

a = int(B/A)

if a >= C:
  print(C)
else:
  print(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 = list(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))