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

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c = mi()
    print(min(c, b // a))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')
# ----------------------------------------------------------- #

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

A,B,C = inputIL()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    a, b, c = map(int, input().split())
    ans = 0
    while ans < c and b >= a:
        b -= a
        ans += 1
    print(ans)

if __name__ == "__main__":
    main()

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
import sys


def solve(A: int, B: int, C: int):
    print(min(B // A, C))


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)


if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

if __name__ == '__main__':

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

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());print([c,b//a][a*c>b])

Submission status: Accepted

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

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 # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))

def main():
    a,b,c = readInts()
    print(c if a*c <= b else b//a)
if __name__ == '__main__':
  main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint

INF = float("inf")

def myinput():
    return map(int,input().split())

def mylistinput(n):
    return [ list(myinput()) for _ in range(n) ]

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

a,b,c = myinput()

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

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())
x = b//a
print(min(x, c))

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    A, B, C = map(int, input().split())
    print(min(C, B//A))

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a, b, c = [int(x) for x in input().split()]
print(min(b//a, c))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import *

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

Submission status: Accepted

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

nec = A*C
if(B>=nec):
    print(C)
else:
    i = C
    while all:
        if(A*i <= B):
            break
        else:
           i -= 1

    print(i)

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:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

a,b,c = inpl()
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:
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())
ans = min(b // a, 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:
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())

nec = A*C
if(B>=nec):
    print(C)
else:
    i = C
    while all:
        if(A*i <= B):
            break
        else:
           i -= 1

    print(i)

Submission status: Accepted

Solution code:
import itertools
import math
import string
import collections
from collections import Counter
from collections import deque
from operator import itemgetter
import sys
sys.setrecursionlimit(2*10**5)
INF = 2**60


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
a, b, c = map(int, input().split())
if a > b:
    print(0)
    exit()
if a*c <= b:
    print(c)
else:
    print(math.floor(b/a))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
m=b//a
print(min(m,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())
d=b//a
if (d+1)*a<=b:
  d+=1
print(min(d,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())
if a*c<=b:
    print(c)
else:
    print(b//a)

Submission status: Accepted

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

total = a * c

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

Submission status: Accepted

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

kai = b//a

if kai>c:
  print(c)
elif kai<=c:
  print(kai)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import re
import math

# import bisect

# import copy
# import heapq
# from collections import deque
# import decimal

# sys.setrecursionlimit(100001)
INF = sys.maxsize
# MOD = 10 ** 9 + 7

ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))


# ===CODE===


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

  return

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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



if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

res = B//A

if res >= C:
    print(C)
else:
    print(res)

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

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

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(b//a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
for i in range(0, 101):
    if a > b or i == c:
        print(i)
        break
    b = 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(B//A)

Submission status: Accepted

Solution code:
# ABC120A

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for _ in range(j)] for _ in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from itertools import accumulate #list(accumulate(A))

A, B, C = mi()

if A*C < B:
    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(d)
else:
    print(c)

Submission status: Accepted

Solution code:
# A - Favorite Sound

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:

def solve():

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

    canListen = B//A

    print(min(canListen, C))


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys
import math
from collections import Counter
import itertools
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

# ###########################################

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

Submission status: Accepted

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

kai=b//a
print(min([kai,c]))

Submission status: Accepted

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

kaisu = b // a

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

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
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
if b - (a * c) > 0:
  print(c)
else:
  print(math.floor(b / a))

Submission status: Accepted

Solution code:
def favorite_sound(a, b, c):

    return c if b//a > c else b//a
def main():
    a, b, c = map(int, input().split())
    print(favorite_sound(a, b, c))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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:
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B, C = il()
    print(min(C, 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:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


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

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

Submission status: Accepted

Solution code:
def main():
    A, B, C = map(int, input().split())
    x, y = divmod(B, A)
    if x < C:
        print(x)
    else:
        print(C)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, c = map(int, input().split())
print(c) if a * c <= b else print(int(b / a))

Submission status: Accepted

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

Submission status: Accepted

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

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

else:
    print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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:
num = list(map(int, input().split()))

sound = num[1] // num[0]

if sound > num[2]:
  sound = num[2]

print(sound)

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 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, groupby
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()
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(d)
else:
    print(c)

Submission status: Accepted

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

Submission status: Accepted

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

m=b//a

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

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:
import math

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

price = A
possession = B
maximum = C

number_of_purchases = min(math.floor(B / A), maximum)

print(number_of_purchases)

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

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B, C = lr()
time = B // A
answer = min(C, time)
print(answer)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c = [int(x) for x in 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(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(int(c))
else:
  print(int(b//a))

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
A = i[0]
B = i[1]
C = i[2]
D = B // A

if D <= C:
  print(D)
else:
  print(C)

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
A = i[0]
B = i[1]
C = i[2]
D = B // A

if D <= C:
  print(D)
else:
  print(C)

Submission status: Accepted

Solution code:
line = input()
numbers = [int(n) for n in line.split()]
predicted_value = min(numbers[1]//numbers[0], numbers[2])
print(predicted_value)