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:
# abc120_a.py
# https://atcoder.jp/contests/abc120/tasks/abc120_a

# A - Favorite Sound /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 高橋くんは、自動販売機でジュースを買ったときの音が好きです。
# その音は 1回 A円で聞くことができます。
# 高橋くんは B円持っていますが、お気に入りの音を C 回聞くと満足するため、B 円で最大 C回まで聞けるだけ聞きます。
# 高橋くんはお気に入りの音を何回聞くことになるでしょうか。

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

# 入力
# 入力は以下の形式で標準入力から与えられる。
# A B C

# 出力
# 高橋くんはお気に入りの音を何回聞くことになるか出力せよ。

# 入力例 1
# 2 11 4

# 出力例 1
# 4

# 高橋くんは 8円以上持っているのでお気に入りの音を 4回聞いて満足します。

# 入力例 2
# 3 9 5

# 出力例 2
# 3

# 高橋くんが満足できないこともあります。

# 入力例 3
# 100 1 10

# 出力例 3
# 0


def calculation(lines):
    # line = lines[0]
    # N = int(lines[0])
    A, B, C = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i+1]))

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

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['2 11 4']
        lines_export = [4]
    if pattern == 2:
        lines_input = ['3 9 5']
        lines_export = [3]
    if pattern == 3:
        lines_input = ['100 1 10']
        lines_export = [0]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
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())
print(min(c, b//a))

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline  #文字列では使わない
A,B,C = map(int, input().split())
hear =B //A
ans =min(hear,C)
print(ans)

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())
count = B // A

print(min(count, C))

Submission status: Accepted

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

if b - (a * c) >= 0:
    print(c)

elif b - (a * c) < 0:
    print(b // a)

elif a > b :
    print(0)

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

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

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

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())
 cnt = 0
 ans = 0
 while cnt <= b:
     cnt += a
     if cnt <= b:
        ans += 1
     if ans == c:
         break
 print(ans)
main()

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

Submission status: Accepted

Solution code:
import sys
A,B,C = map(int,input().split())
if not ( 1 <= A <= 100 and 1 <= B <= 100 and 1 <= C <= 100 ): sys.exit()

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

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

Submission status: Accepted

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

sound_count = b//a

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 = (int(X) for X in input().split())
print(min(C,B//A))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
def ans(a, b, c):
    if a > b:
        return 0
    else:
        if int(b/a) < c:
            return int(b/a)
        else:
            return c
print(ans(n[0], n[1], n[2]))

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())
print(min(B//A,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 = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys
rm = lambda: map(int, sys.stdin.buffer.readline().split())
a, b, c = rm()
print(min(c, b//a))

Submission status: Accepted

Solution code:
import sys
rm = lambda: map(int, sys.stdin.buffer.readline().split())
a, b, c = rm()
print(min(c, b//a))

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b, c = rm()
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())
count = int(b / a)

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

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

Submission status: Accepted

Solution code:
A, B, C = list(map(int, input().split()))
print(min(int(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:
A, B, C = map(int, input().split())
n = B // A
print(min(n, 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())

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

Submission status: Accepted

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

b = B // A

if b >= C:
    print(C)

else:
    print(b)

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

Submission status: Accepted

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

count = 0
A_org = A
A = 0
for i in range(1000):
    if count < C:
        if A + A_org <= B:
            A += A_org
            count += 1
        else:
            break
    else:
        break
    
print(count)

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

Submission status: Accepted

Solution code:
def resolve():
    inp = input()
    li = list(map(lambda x: int(x), inp.split(" ")))
    num = li[1]//li[0]
    print(min(num, li[2]))
    
resolve()

Submission status: Accepted

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

print(b//a) if b//a<c else print(c)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#import sys
#import numpy as np
import math
#import itertools
#from fractions import Fraction
#import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions  import gcd
#input=sys.stdin.readline
#import bisect
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())
pos = b//a
print(pos if pos<= c else c)

Submission status: Accepted

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

main()

Submission status: Accepted

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

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

d=b//a

print(min(d,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:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/python

input_data = list(map(int,input().split()))

d1 = input_data[0]
d2 = input_data[1]
d3 = input_data[2]

d4 = int(d2 / d1)
if d4 > d3:
    total = d3
else:
    total = d4

print(total)

Submission status: Accepted

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

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

if __name__=="__main__":
    main()

Submission status: Accepted

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

def main():
  A,B,C = [int(i) for i in input().strip().split()]
  return min(B//A,C)
  
if __name__ == "__main__":
  print(main())

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

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

Submission status: Accepted

Solution code:
#!/usr/bin/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())
print(B // A if B // A < C else C)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b, c = map(int, open(0).read().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
print(min(d,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

def solve():
    input = sys.stdin.readline
    A, B, C = map(int, input().split())
    count = 0
    while count < C:
        if B >= A:
            count += 1
            B -= A
        else: break
    print(count)

    return 0

if __name__ == "__main__":
    solve()

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

Submission status: Accepted

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

    if b >= a * c:
        print(c)
    else:
        print(int(b/a))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

tmp = b // a

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

tmp =int(b/a)

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

Submission status: Accepted

Solution code:
import math
def ip():return int(input())
def inp():return map(int,input().split())
def inpstr():return map(str,input().split())
def linp():return list(map(int,input().split()))
def linpstr():return list(map(str,input().split()))

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

Submission status: Accepted

Solution code:
#abc120_a.py
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(count)
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(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 = input()
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())
print(b//a if b//a<=c else 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:
import sys
sys.setrecursionlimit(10**6)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

n = b // a

print(min(n, c))

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)
else:
  print(0)

Submission status: Accepted

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

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

ans = (b//a)

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

Submission status: Accepted

Solution code:
#A
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())
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())
n = b//a
if n >= c:
    print(c)
elif n <= c:
    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())
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))
elif(b/a < c):
  print(int(b/a))

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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:
  ans = c
else:
  ans = b // a

print(ans)

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())
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:
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:
import re
n = input()
m = re.search('(\d+)\s(\d+)\s(\d+)', n)
a = int(m.group(1))
b = int(m.group(2))
c = int(m.group(3))
i = b // a
if c <= i:
    print(c)
else:
    print(i)

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>c:
    print(c)
else:
    print(d)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(int,input().split()))
LS=lambda:list(map(str,input().split()))

a,b,c=L()
ans=0
if a*c<=b:
    ans=c
else:
    ans=b//a
print(ans)

Submission status: Accepted

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

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

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 b < a*c:
  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, B, C = map(int, input().split())
count = B // A

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

Submission status: Accepted

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

cnt=0

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(D)
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:
import bisect, collections, copy, heapq, itertools, math, numpy, string
import sys
from bisect import bisect_left, bisect_right, insort
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def MS(): return map(str, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
# N = I()
# A = [LI() for _ in range(N)]

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

Submission status: Accepted

Solution code:
import math
a,b,c=(int(x) for x in input().split())
if b>=c*a:
    print(c)
else:
    print(int(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:
a,b,c = map(int,input().split())
print (c) if a*c <= b else print (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())
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 = map(int,input().rstrip().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(C, B//A) )