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: Runtime Error

Solution code:
# UnionTreeクラス：グループ分けを木構造で管理する
class UnionFind():
    def __init__(self, N):
        self.par = [i for i in range(N)]
        self.size = [1] * N
        self.N = N

    # xのrootを返す
    def root(self, x):
        if self.par[x] == x:
            return x
        else: 
            self.par[x] = self.root(self.par[x])
            return self.root(self.par[x])

    # x, yが同じrootの場合true
    def same(self, x, y):
        rx = self.root(x)
        ry = self.root(y)
        return rx == ry

    # x,yのrootが違った場合、併合
    def unite(self, x, y):
        rx = self.root(x)
        ry = self.root(y)
        if self.size[rx] < self.size[ry]:
            self.par[rx] = ry
            self.size[ry] += self.size[rx]
        else:
            self.par[ry] = rx
            self.size[rx] += self.size[ry]

n, m = (int(i) for i in input().split())
input_arr = [[int(i) for i in input().split()] for i in range(m)] 

uf = UnionFind(n)
#input_arr = [[1,2],[3,4],[1,3],[2,3],[1,4]]

#print(output(uf))
result = [n*(n-1)/2]
for i in input_arr[::-1]:
    a = i[0]-1
    b = i[1]-1
    if not uf.same(a,b):
        x = uf.size[uf.root(a)] * uf.size[uf.root(b)]
        uf.unite(a,b)
        result.append(result[-1]-x)
    else:
        result.append(result[-1])

for i in result[::-1][1:]:
    print(i)

#print(uf.par)

Submission status: Runtime Error

Solution code:
import sys

args = []

args.append(int(input()))
args.append(int(input()))
args.append(int(input()))

result = int(args[1] / args[0])
if result > args[2]:
    result = args[2]
print(result)

Submission status: Runtime Error

Solution code:
import sys

args = []
args[0] = int(input())
args[1] = int(input())
args[2] = int(input())

result = int(args[1]) / args[0])
if result > args[2]:
    result = args[2]
print(result)

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv

result = int(int(args[2]) / int(args[1]))
if result > int(args[3]):
    result = int(args[3])
print(result)

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
d=b/a
if d=<c:
  print(d)
else:
  print(c)

Submission status: Runtime Error

Solution code:
string = input()
one = 0
zero = 0
for s in string:
    if s == '1':
        ones += 1
    else:
        zeros += 1

print(2*min(one, zero))

Submission status: Runtime Error

Solution code:
class Solution:
  def solve(self, A, B, C):
    count = 0
    spent = 0
    while B >= 0:
      B -= A
      count += 1
      if count == C:
        return C
    return count

def main():
  A = int(input())
  B = int(input())
  C = int(input())
  print(Solution().solve(A, B, C))
        
if __name__ == "__main__":
   main()

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv

A = args[0]
B = args[1]
C = args[2]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
class UnionFind:
    def __init__(self, n):
        self.par = [i for i in range(n+1)]
        self.rank = [0] * (n+1)
        self.sizes = [1] * (n+1)
        self.root = [1] * (n+1)
 
    # 検索
    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]
 
    # 併合
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if self.rank[x] < self.rank[y]:
            self.par[x] = y
            self.root[x] = -1
            self.sizes[y] += self.sizes[x]
        else:
            self.par[y] = x
            self.root[y] = -1
            self.sizes[x] += self.sizes[y]
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
        
 
    # 同じ集合に属するか判定
    def same_check(self, x, y):
        return self.find(x) == self.find(y)
    
    def size(self, x):
        return self.sizes[find(x)]
    
 
n, m = map(int, input().split())
lst = [list(map(int, input().split())) for _ in range(m)]
 
all_comb = n*(n-1)/2
 
a = UnionFind(n)
 
ans = [all_comb]
for pair in reversed(lst):
    if a.same_check(pair[0], pair[1]):
        ans.append(ans[-1])
        pass
    else:
        ans.append(ans[-1] - a.sizes[a.find(pair[0])]*a.sizes[a.find(pair[1])])
        a.union(pair[0], pair[1])
    
for i in reversed(ans[:-1]):
    print(int(i))

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10**5)
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]

ans = n * (n - 1) // 2
result = [ans]
leader = [-1] * n
size = [1] * n


def leader_check(i):
    if leader[i] == -1:
        return i
    ln = leader_check(leader[i])
    leader[i] = ln
    return ln


for a, b in ab[:0:-1]:
    a, b = a - 1, b - 1
    la = leader_check(a)
    lb = leader_check(b)
    if la != lb:
        leader[la] = lb
        ans -= size[la] * size[lb]
        size[lb] += size[la]
    result.append(ans)

for i in result[::-1]:
    print(i)

Submission status: Runtime Error

Solution code:
import array
import functools.*

class UnionFind :
    def __init__(self, n):
        self.par = array.array('i', range(n))


    def root(self, i):
        if i == self.par[i]:
            return i
        else:
            r = self.root(self.par[i])
            self.par[i] = r
            return r


    def unite(self, x, y):
        rx = self.root(x)
        ry = self.root(y)
        if(rx == ry):
            return
        self.par[rx] = ry
        self.root(x)

    def same(self, x, y) :
        return self.root(x) == self.root(y)

    def debug(self):
        print(self.par)



def main():
    (n,m) = map(int, input().split())
    ab = []
    for i in range(m):
        (a,b) = map(int, input().split())
        ab.append((a-1,b-1))
    ab = ab[::-1]
    uf = UnionFind(n)
    res = []
    for (a,b) in ab:
        res.append(calcScore(uf, n))
        uf.unite(a,b)
    for i in range(m):
        res[i] = ((n*(n-1)) // 2) - res[i]
    res = res[::-1]
    for r in res:
        print(r)

def calcScore(uf, n):
    nroots = array.array('i', [0] * n)
    for i in range(n):
        root = uf.root(i)
        nroots[root] = nroots[root] + 1
    res = 0
    for r in nroots:
        res = res + (r * (r-1)) // 2
    return res

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import array
import functools.*

class UnionFind :
    def __init__(self, n):
        self.par = array.array('i', range(n))


    def root(self, i):
        if i == self.par[i]:
            return i
        else:
            r = self.root(self.par[i])
            self.par[i] = r
            return r


    def unite(self, x, y):
        rx = self.root(x)
        ry = self.root(y)
        if(rx == ry):
            return
        self.par[rx] = ry
        self.root(x)

    def same(self, x, y) :
        return self.root(x) == self.root(y)

    def debug(self):
        print(self.par)

if __name__ == '__main__':
    main()

def main():
    (n,m) = map(int, input().split())
    ab = []
    for i in range(m):
        (a,b) = map(int, input().split())
        ab.append((a-1,b-1))
    ab = ab[::-1]
    uf = UnionFind(n)
    res = []
    for (a,b) in ab:
        res.append(calcScore(uf, n))
        uf.unite(a,b)
    for i in range(m):
        res[i] = ((n*(n-1)) // 2) - res[i]
    res = res[::-1]
    for r in res:
        print(r)

def calcScore(uf, n):
    nroots = array.array('i', [0] * n)
    for i in range(n):
        root = uf.root(i)
        nroots[root] = nroots[root] + 1
    res = 0
    for r in nroots:
        res = res + (r * (r-1)) // 2
    return res

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;

int main(){
  //入力
  int A, B, C;
  cin >> A >> B >> C;

  //処理
  int ans = B / A;
  if (ans > C) ans = C;

  //出力
  cout << ans << endl;
}

Submission status: Runtime Error

Solution code:
import math
A,B,K=map(int,input().split())
d=[]
for i in range(1,max(A,B)+1):
    if A%i==0 and B%i==0:
        d.append(i)
print(d[len(d)-K])

Submission status: Runtime Error

Solution code:
import math
A,B,K=map(int,input().split())
d=[]
if math.gcd(A,B)==1:
    d.append(1)
else:
    for i in range(2,math.gcd(A,B)+1):
        if A%i==0 and B%i==0:
            d.append(i)
print(d[len(d)-K])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main() {
    int a, b, c, q;
    cin >> a >> b >> c;
    q = b/a;
    if(q < c){
        cout << q << endl;
    }else{
        cout << c << endl;
    };
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import scipy as sp


def divisor(num):
    list = set()
    for i in sp.arange(1, num+1):
        if num % i == 0:
            list.add(i)
    return list


a, b, k = [int(i) for i in input().split()]

div_a = divisor(a)
div_b = divisor(b)

cd = sp.sort(list(div_a & div_b))
cd_r = cd[::-1]
print(cd_r[k-1])

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
isl1 = [0]*m
isl2 = [0]*m
for i in range(m):
    (isl1[i], isl2[i]) = map(int,input().split())
    isl1[i] -= 1
    isl2[i] -= 1
boss = [-1]*n
mem = [1]*n
dpt = [0]*n
ans = [0]*m
s = (n*(n-1))//2
ans[m-1] = s
 
def sea(i, boss):
     m = 0
     while boss[i] >= 0:
          i = boss[i]
          m += 1
     return i,m
 
for j in range(m-1):
     i = m-j-1
     i1,i2 = isl1[i],isl2[i]
     p1,m1 = sea(i1, boss)
     p2,m2 = sea(i2, boss)
     if p1 != p2:
          if dpt[m1] < dpt[m2]:
               (p1,p2) = (p2,p1)
          boss[p2] = p1
          s -= mem[p1]*mem[p2]
          mem[p1] += mem[p2]
          mem[p2] = 0
          dpt[p1] = max(dpt[p1],dpt[p2]+1)
     ans[i-1] = s
         
for i in range(m):
     print(ans[i])

Submission status: Runtime Error

Solution code:
data = input().split()
n = int(data[0])
m = int(data[1])
edge=[]
for i in range(m):
    tmp = []
    data = input().split()
    tmp.append(int(data[0])-1)
    tmp.append(int(data[1])-1)
    edge.append(tmp)

grp=list(range(0, n))
def group(num):
    if grp[num] == num:
        return num
    return group(grp[num])

def merge(num1, num2):
    grp[num2]=grp[num1]

res=[]
ans = [1]*n
ben = int(n*(n-1)/2)
edge.reverse()
for e in edge:
    #print(e, ans, ben, grp)
    res.append(ben)
    g0 = group(e[0])
    g1 = group(e[1])
    if g0 != g1:
        ben -= ans[g0]*ans[g1]
        sum = ans[g0]+ans[g1]
        merge(g0, g1)
        ans[g0]=sum
        ans[g1]=sum

res.reverse()
for r in res:
    print(r)

#print(int(n*(n-1)/2))

Submission status: Runtime Error

Solution code:
N, M = [int(elm) for elm in input().split(" ")]
bridges = [[int(elm) for elm in input().split(" ")] for _ in range(M)]

#graph = {}
#for node in range(1, N+1):
#    graph[node] = [node]
#    #graph_mem[node] = []

#graph_n_mem = [0] + [1 for i in range(N)]
graph_n_mem = [0] + [1] * N
n_all_pairs = N * (N-1) // 2

parent = [-1] * (N+1)

#def get_parent(child_node, tmp_nodes=[]):
def get_parent(child_node):
    parent_node = parent[child_node]

    if parent_node != -1:
        #tmp_nodes.append(child_node)
        #out = get_parent(parent_node, tmp_nodes)
        out = get_parent(parent_node)
    else:
        out = child_node
        #if len(tmp_nodes) >= 1:
        #    tmp_nodes = tmp_nodes[:-1]
        #    for tmp_node in tmp_nodes:
        #        parent[tmp_node] = out
    return out


outs = []
out = n_all_pairs
for A, B in reversed(bridges):
    #A = graph[A][0]
    #B = graph[B][0]

    A = get_parent(A)
    B = get_parent(B)

    if A != B:
        n_b = graph_n_mem[B]
        n_a = graph_n_mem[A]
        graph_n_mem[A] += graph_n_mem[B]
        graph_n_mem[B] = 0

        parent[B] = A

        #old_graph_B = graph[B]
        #graph[A] += graph[B]
        #for node in old_graph_B:
        #    graph[node] = graph[A]
        
        out -= n_a * n_b

    outs.append(out)

outs = outs[::-1]
outs = outs[1:] + [n_all_pairs]
for out in outs:
    print(out)

Submission status: Runtime Error

Solution code:
A, B, K = map(int, input().split())
d = [i for i in range(100,1,-1) if (A%i==0 and B%i==0)]
print(d[K-1])

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
C=int(input())
if A*C<=B:
    print(C)
else:
    n=B//A
    print(n)

Submission status: Runtime Error

Solution code:
n = 0
X = 0
while X<1:
	# print(L)
	K = len(L)-1
	# print(K)
	for i in range(K):
		if L[i]+L[i+1]==1:
			L.pop(i)
			L.pop(i)
			n=n+1
			break
		elif i == K-1:
			X=1

# print(L)
print(n*2)

Submission status: Runtime Error

Solution code:
N, M = [int(elm) for elm in input().split(" ")]
bridges = [[int(elm) for elm in input().split(" ")] for _ in range(M)]

class Graph:
    pass

graph = {}
for node in range(1, N+1):
    graph[node] = [node]
    #graph_mem[node] = []

graph_n_mem = [0] + [1 for i in range(N)]
n_all_pairs = N * (N-1) // 2

#def delete_graph(B):
#    pass

def calc_out(n_list):
    out = n_all_pairs
    for elm in n_list:
        if elm <= 1:
            continue
        tmp = elm * (elm-1) // 2
        out -= tmp
    return out

outs = []
for A, B in reversed(bridges):
    #print(graph_n_mem)
    #print("before AB", A, B)
    A = graph[A][0]
    B = graph[B][0]
    #print(graph_n_mem, "AB", A, B)
    if graph[A] != graph[B]:
        #graph_n_mem[A] += len(graph[B])
        graph_n_mem[A] += graph_n_mem[B]
        graph_n_mem[B] = 0

        graph[A] += graph[B]
        for node in graph[A]:
            graph[node] = graph[A]
            
        #graph_mem[A] += graph_mem[B]
        

    out = calc_out(graph_n_mem)
    outs.append(out)

outs = outs[::-1]
outs = outs[1:] + [n_all_pairs]
for out in outs:
    print(out)

Submission status: Runtime Error

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

yakusuu_array = []

for ab in [a,b]:
    yakusuu_array_ab = []
    for i in range(1,ab):
        if ab % i == 0:
            yakusuu_array_ab.append(i)
    yakusuu_array.append(yakusuu_array_ab)

kouyakusuu = list(set(yakusuu_array[0]) & set(yakusuu_array[1]))

if len(kouyakusuu) == 0:
    print(1)
else:
    print(kouyakusuu[k-1])

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
i = int(0)
l = list()
if a > b:
    maxim = a
else:
    maxim = b
for i in range(1,100):
        if ((a % i) == 0) and ((b % i) == 0):
            l.append(i)
        elif maxim < i:
            break

n = int(len(l))
if c == 1:
    n = n
else:
    n -= c
print(l[n])

Submission status: Runtime Error

Solution code:
S=str(input())
l=list(S) # ['1', '2', '3']
ilength=len(l)
bS=[1 for i in range(len(S))]
recon=True
while(recon):
  recon=False
  indeces=[]
  jump=False
  for i in range(len(l)-1):
    if(int(l[i])+int(l[i+1])==1 and not(jump)):
      indeces.append(i)
      indeces.append(i+1)
      i+=1
      recon=True
      jump=True
    else:
      jump=False
  sl=[]
  for i in range(len(l)):
    if(not(i in indeces)): sl.append(l[i])
  l=sl[:]
flength=len(l)
print(ilength-flength)

Submission status: Runtime Error

Solution code:
nums=str(input())
arr=list(map(int,nums))
l=len(arr)
a=0
i=0
while i<len(arr)-1:
    if arr[i]!=arr[i+1]:
        del arr[i:i+2]
        #print(arr)
        a+=2
        i=0
    i+=1
print(a)

Submission status: Runtime Error

Solution code:
A, B, K = (int(i) for i in input().split())
list = []
for i in range(1, 100):
  if A % == 0 and B % i == 0:
    list.append(i)
print(list[len(list)-K])

Submission status: Runtime Error

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

ans = 0

lista = list(range(a+1))
aa = lista.pop(0)

listb = list(range(b+1))
bb = listb.pop(0)

if (a < b):
    li = [i for i in lista if a % i == 0 and b % i == 0]
    li = sorted(li, reverse=True)
    ans = li[k-1]
else:
    li = [i for i in listb if a % i == 0 and b % i == 0]
    li = sorted(li, reverse=True)
    ans = li[k-1]

print(ans)

Submission status: Runtime Error

Solution code:
# read data for n sequences.
n = stdin.readline().split()
a = int(n[0])
b = int(n[1])
c = int(n[2])
#data = [int(stdin.readline().rstrip()) for _ in range(n)]

out = int(b / a)

if out > c:
    out = c

print(out)

end = time.time()
print(end-start)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize ("-ffloat-store")  
#pragma GCC optimize ("-fno-defer-pop")
#define all(a) a.begin(),a.end()
#define bs binary_search
#define ll long long int
#define ld long double
ll power(ll a,ll b,ll m){ if(b==0) return 1; if(b==1) return a%m; ll t=power(a,b/2,m); t=(t*t)%m; if(b&1)t=(t*a)%m; return t;}
ll modInverse(ll a, ll m) { return power(a, m-2, m); }
#define ipr pair<ll,ll>
#define ps push_back
#define fs first
#define sc second
#define mkp make_pair
#define mod 1000000007
int main(){
	
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	
	ll i,j,k,a,b,c;
	cin>>a>>b>>c;

	k=b/a;
	cout<<min(k,c);
	
	return 0;
}

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
  
a=int(a)
b=int(b)
c=int(c)
x=int(x)

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

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input().split())
num_list = [i for i in range(a, b) if a % i == 0 and b % i == 0][::-1]
print(number_list[k-1])

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
  
a=int(a)
b=int(b)
c=int(c)
x=int(x)

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

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
  
a=int(a)
b=int(b)
c=int(c)
x=int(x)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input().split())
num_list = [i for i in range(1, 101) if a % i == 0 and b % i == 0]
num_list.reverse()
print(number_list[k-1])

Submission status: Runtime Error

Solution code:
a=input()
b=input()
c=input()
  
a=int(a)
b=int(b)
c=int(c)
x=int(x)

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

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input().split())
number_list = [i for i in range(1, 101) if a % i == 0 and b % i == 0][::-1]
print(number_list[k-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import fractions


def main():
    a = list(map(int, input().split()))
    b = fractions.gcd(a[0], a[1])
    c = b
    for i in range(a[2]-1):
        while True:
            c -= 1
            if b % c == 0:
                break
    print(c)


main()

Submission status: Runtime Error

Solution code:
inp = [int(i) for i in input().split()]
li =[]
li2 =[]

for k in range(1,inp[0]+1):
  f = inp[0] / k
  if f.is_integer():
    li.append(k)

for m in range(1,inp[1]+1):
  h = inp[1] / m
  if h.is_integer():
    li2.append(m)
    
li3 = list(set(li) & set(li2))
li3.sort()
print(li3[inp[2]-1])

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc second
#define pt(num) cout << num << "\n"
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
#define max(a, b) ((a)>(b) ? (a):(b))
#define min(a, b) ((a)<(b) ? (a):(b))
#define chmax(a, b) (a<b ? a=b : 0)
#define chmin(a, b) (a>b ? a=b : 0)
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 101010
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;



int main(void) {
    ll a, b, c;
    cin >> a >> b >> c;
    pt(min(b/a, c));
    
}

Submission status: Runtime Error

Solution code:
a = int(input('A'))
b = int(input('B'))
c = int(input('C'))

count = 0
for i in range(b // a):
    if i >= c:
        break
    count += 1

print(count)

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input().split())
l1 = [i for i in range(1, a) if (a % i == 0)]
l2 = [i for i in range(1, b) if (b % i == 0)]
l = list(set(l1) & set(l2))
l.sort()
print(l[k-1])

Submission status: Runtime Error

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

if A*C < B:
    print(C)

elif A*C = B:
    print(C)

elif A*C > B:
    print(B//A)

Submission status: Runtime Error

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

if A*C < B:
    print(C)

if A*C = B:
    print(C)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys


def main():
    lines = sys.stdin.readlines().split(' ')
    one_try = int(lines[0])
    money = int(lines[1])
    count = int(lines[2])
    n = 0
    while(True):
        if money >= one_try:
            money = money - one_try
            n = n + 1
        else:
            break
        if n == count:
            break
    print(n)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

l = []

greatest = a

if(b > a):
  greatest = b
  
for i in range(1, greatest):
  if(a % i == 0 and b % i == 0):
    l.append(i)

if(len(l) == 0):
  if(a == b):
    l.append(1)
    
print(str(l[len(l) - int(k)]))

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input().split())
list = []

for i in range(1, 101):
  if a%i == 0 and b %i == 0:
    list.append(i)
    list.sort(reverse=True)
    
print(list[k-1])

Submission status: Runtime Error

Solution code:
import sys


def main():
    one_try = int(sys.argv[1])
    money = int(sys.argv[2])
    count = int(sys.argv[3])
    n = 0
    while(True):
        if money >= one_try:
            money = money - one_try
            n = n + 1
        else:
            break
        if n == count:
            break
    print(n)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
A,B,K=list(map(int,input().split()))
count=0
z=[A,B]
for i in range(max(z),0,-1):
  if (A%i==0)and(B%i==0):
    count+=1
    if count==K:
      ans=i
      break
print(ans)

Submission status: Runtime Error

Solution code:
def main():
  A, B, C = input().split(" ")
  count = B // A
  return min(count, C)
  
if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
a,b,k = map(int, input().split())
import math
import sys
c = math.gcd(a, b)
ls = []
for i in range(1, c):
    if c % i == 0:
        ls.append(i)

print(ls[k-1])

Submission status: Runtime Error

Solution code:
A,B,K=list(map(int,input().split()))
count=0
z=[A,B]
for i in range(1,max(z)+1):
  if (A%i==0)and(B%i==0):
    count+=1
    if count==K:
      ans=count
      break
print(ans)

Submission status: Runtime Error

Solution code:
import sys

args = sys.argv
a = int(args[1])
b = int(args[2])
c = int(args[3])

ret = int(b/a)
if ret >= c:
    ret =c

print(ret)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
lis = []
for i in range(1,min(a,b)+1):
  if a%i == 0 and b%i == 0:
    lis.append(i)
print(lis[-1*c])

Submission status: Runtime Error

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

num1 = 11 // 2

if num <= c:
  print(num)
else:
  print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
in_str = input()
input_list = map(int,in_str)
per = input_list[0]
money = input_list[1]
target = input_list[2]
time = int(money/par)
ans = 0
if(time>=target):
  ans = target
else:
  ans = time
print(ans)

Submission status: Runtime Error

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

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

print(ANS)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(ANS)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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


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

Submission status: Runtime Error

Solution code:
import sys

l = []
for line in sys.stdin:
  l.append([int(i) for i in line.split()])

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

Submission status: Runtime Error

Solution code:
100 1 10

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define incant() cin.tie(0), ios::sync_with_stdio(false)
#define int long long
#define uint unsigned long long
#define double long double
using str = string;
template <class T> using vec = vector<T>;
template <class T> using vvec = vec<vec<T>>;
template <class T> using que = queue<T>;
template <class T> using pque = priority_queue<T>;
template <class... T> using tup = tuple<T...>;
using vint = vec<int>;
using vvint = vvec<int>;
using vstr = vec<str>;
using pint = pair<int, int>;
using vp = vec<pint>;
using tll = tup<int, int, int>;
using vt = vec<tll>;
using mint = map<int, int>;
using dict = map<str, int>;
using qint = que<int>;
using qp = que<pint>;
using pqint = pque<int>;
using pqp = pque<pint>;
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define lb lower_bound
#define ub upper_bound
#define fir first
#define sec second
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define sz(x) x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define ms(v, x) memset(v, x, sizeof(v))
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep,)(__VA_ARGS__)
#define _rev(i, n) revi(i, n, 0)
#define revi(i, a, b) for(int i = (int)(a - 1); i >= (int)(b); i--)
#define rev(...) _overload3(__VA_ARGS__, revi, _rev,)(__VA_ARGS__)
#define each(i, n) for(auto&& i: n)
#define out(x) cout << (x)
#define space() cout << " "
#define indent() cout << '\n'
#define print(x) out(x), indent()
#define debug(x) cerr << __LINE__ << ": " << #x << ": " << (x) << '\n'
#define YN(x) print((x) ? "YES" : "NO")
#define Yn(x) print((x) ? "Yes" : "No")
#define yn(x) print((x) ? "yes" : "no")
#define POS(x) print((x) ? "POSSIBLE" : "IMPOSSIBLE")
#define Pos(x) print((x) ? "Possible" : "Impossible")
#define pos(x) print((x) ? "possible" : "impossible")
const int INF = LLONG_MAX - INT_MAX, MOD = 1e9 + 7, LIMIT = 100001;
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
// const int dx[] = {-1, 0, 1, -1, 1, -1, 0, 1}, dy[] = {-1, -1, -1, 0, 0, 1, 1, 1};
const double EPS = 1e-9;
int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}
int lcm(int a, int b){return a / gcd(a, b) * b;}
int factorial(int a){return a < 2 ? 1 : factorial(a - 1) * a;}
int summation(int a){return a < 1 ? 0 : (a * a + a) / 2;}
int combination(int n, int r){int res = 1; rep(i, 1, r + 1) res *= n--, res /= i; return res;}
const str alphabet = "abcdefghijklmnopqrstuvwxyz";
int a, b, c, k, n, m, x, y, z, w, h;
str s, t;

signed main(){
    incant();
    while(cin >> a >> b >> c){
        int res = 0, cnt = 0, sum = 0, mx = -INF, mn = INF;
        bool flag = true;
        print(min(c, b / a));
    }
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <iomanip>

using namespace std;


int main(){
   int A,B,C;
   cin >> A >> B >> C;
   cout << min(C, B/A) << endl; 
   return 0;
}