message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they h... | instruction | 0 | 85,855 | 14 | 171,710 |
Tags: data structures, greedy, sortings
Correct Solution:
```
n,k = map(int,input().split())
a = []
b = []
c = []
for i in range(n):
x,y,z = map(int,input().split())
if y == 1 and z != 1:
a.append(x)
elif y != 1 and z == 1:
b.append(x)
elif y == 1 and z == 1:
c.append(x)
else... | output | 1 | 85,855 | 14 | 171,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they h... | instruction | 0 | 85,856 | 14 | 171,712 |
Tags: data structures, greedy, sortings
Correct Solution:
```
n,k=map(int, input().split())
tab=[tuple(map(int,input().split())) for _ in range(n)]
both=[tabi[0] for tabi in tab if tabi[1:]==(1,1)]
both.sort()
alice=[tabi[0] for tabi in tab if tabi[1:]==(1,0)]# tabi[1]==1 and tabi[2]==0]
bob=[tabi[0] for tabi in tab i... | output | 1 | 85,856 | 14 | 171,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they h... | instruction | 0 | 85,857 | 14 | 171,714 |
Tags: data structures, greedy, sortings
Correct Solution:
```
def cumsum(x):
n = len(x)
ans = [0]*(n+1)
for i in range(n):
ans[i+1]=ans[i]+x[i]
return ans
def solve(k, t, a, b):
n = len(t)
b10, b01, b11=[],[],[]
for i in range(n):
if (a[i]==1 and b[i]==1):
b11.ap... | output | 1 | 85,857 | 14 | 171,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they h... | instruction | 0 | 85,858 | 14 | 171,716 |
Tags: data structures, greedy, sortings
Correct Solution:
```
t,k = map(int,input().split())
A = []
B = []
C = []
for i in range(t):
a,b,c = map(int,input().split())
if b == 1 and c == 0:
A.append(a)
elif b == 0 and c == 1:
B.append(a)
elif b == 1:
C.append(a)
if min(len(A),len(B... | output | 1 | 85,858 | 14 | 171,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they h... | instruction | 0 | 85,859 | 14 | 171,718 |
Tags: data structures, greedy, sortings
Correct Solution:
```
#import math
#from functools import lru_cache
#import heapq
#from collections import defaultdict
#from collections import Counter
#from collections import deque
#from sys import stdout
#from sys import setrecursionlimit
#setrecursionlimit(10**7)
from sys imp... | output | 1 | 85,859 | 14 | 171,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they h... | instruction | 0 | 85,860 | 14 | 171,720 |
Tags: data structures, greedy, sortings
Correct Solution:
```
# stdin = open("testdata.txt")
# def input():
# return stdin.readline().strip()
def addition(lst,k):
lst_alice = []
lst_bob = []
lst_both = []
addition_lst = []
lst.sort()
for i in range(len(lst)):
if lst[i][1] == 1 and l... | output | 1 | 85,860 | 14 | 171,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they h... | instruction | 0 | 85,861 | 14 | 171,722 |
Tags: data structures, greedy, sortings
Correct Solution:
```
n, k = tuple(map(int, input().split()))
alice = []
bob = []
both = []
for _ in range(n):
t, a, b = tuple(map(int, input().split()))
if a == 1 and b == 1:
both.append(t)
elif a == 1:
alice.append(t)
elif b == 1:
bob.ap... | output | 1 | 85,861 | 14 | 171,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... Their mom doesn't think so. She says that they h... | instruction | 0 | 85,862 | 14 | 171,724 |
Tags: data structures, greedy, sortings
Correct Solution:
```
n,k=list(map(int,input().split()))
x=[]
y=[]
z=[]
for i in range(n):
t,a,b=list(map(int,input().split()))
if a==1 and b==1:
z.append(t)
elif a==0 and b==1:
y.append(t)
elif a==1 and b==0:
x.append(t)
x1=len(x)
y1=... | output | 1 | 85,862 | 14 | 171,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... T... | instruction | 0 | 85,863 | 14 | 171,726 |
Yes | output | 1 | 85,863 | 14 | 171,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... T... | instruction | 0 | 85,864 | 14 | 171,728 |
Yes | output | 1 | 85,864 | 14 | 171,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... T... | instruction | 0 | 85,865 | 14 | 171,730 |
Yes | output | 1 | 85,865 | 14 | 171,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... T... | instruction | 0 | 85,866 | 14 | 171,732 |
Yes | output | 1 | 85,866 | 14 | 171,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... T... | instruction | 0 | 85,867 | 14 | 171,734 |
No | output | 1 | 85,867 | 14 | 171,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... T... | instruction | 0 | 85,868 | 14 | 171,736 |
No | output | 1 | 85,868 | 14 | 171,737 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... T... | instruction | 0 | 85,869 | 14 | 171,738 |
No | output | 1 | 85,869 | 14 | 171,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so read statements of both problems completely and carefully.
Summer vacation has started so Alice and Bob want to play and joy, but... T... | instruction | 0 | 85,870 | 14 | 171,740 |
No | output | 1 | 85,870 | 14 | 171,741 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some country is populated by wizards. They want to organize a demonstration.
There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n - x people) do not support the wizar... | instruction | 0 | 85,974 | 14 | 171,948 |
Tags: implementation, math
Correct Solution:
```
import math
n, x, z = map(int, input().split())
print(max(0, math.ceil(n / 100 * z) - x))
``` | output | 1 | 85,974 | 14 | 171,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some country is populated by wizards. They want to organize a demonstration.
There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n - x people) do not support the wizar... | instruction | 0 | 85,975 | 14 | 171,950 |
Tags: implementation, math
Correct Solution:
```
import math
n,w,p = map(int,input().split())
needed = int(math.ceil((n*p)/100))
ans = needed-w
if ans > 0:
print(ans)
else:
print(0)
``` | output | 1 | 85,975 | 14 | 171,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some country is populated by wizards. They want to organize a demonstration.
There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n - x people) do not support the wizar... | instruction | 0 | 85,976 | 14 | 171,952 |
Tags: implementation, math
Correct Solution:
```
from math import ceil
def magicians(n, x, y):
z = ceil(n * y / 100)
if x < z:
return z - x
return 0
N, X, Y = [int(i) for i in input().split()]
print(magicians(N, X, Y))
``` | output | 1 | 85,976 | 14 | 171,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some country is populated by wizards. They want to organize a demonstration.
There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n - x people) do not support the wizar... | instruction | 0 | 85,977 | 14 | 171,954 |
Tags: implementation, math
Correct Solution:
```
import sys
import math
#to read string
get_string = lambda: sys.stdin.readline().strip()
#to read list of integers
get_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )
#to read integers
get_int = lambda: int(sys.stdin.readline())
#to print fast
p... | output | 1 | 85,977 | 14 | 171,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some country is populated by wizards. They want to organize a demonstration.
There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n - x people) do not support the wizar... | instruction | 0 | 85,978 | 14 | 171,956 |
Tags: implementation, math
Correct Solution:
```
from math import ceil
n, x, y = map(int, input().split())
goal = ceil(n * (y / 100))
print (max(goal - x, 0))
``` | output | 1 | 85,978 | 14 | 171,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some country is populated by wizards. They want to organize a demonstration.
There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n - x people) do not support the wizar... | instruction | 0 | 85,979 | 14 | 171,958 |
Tags: implementation, math
Correct Solution:
```
import math
n,x,y = map(int,input().split(' '))
a = int(math.ceil(float(n * y * 0.01)))
if x >= a:
print(0)
else:
print(a - x)
``` | output | 1 | 85,979 | 14 | 171,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some country is populated by wizards. They want to organize a demonstration.
There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n - x people) do not support the wizar... | instruction | 0 | 85,980 | 14 | 171,960 |
Tags: implementation, math
Correct Solution:
```
import sys
import math
n, x, y = [int(x) for x in (sys.stdin.readline()).split()]
req = int(math.ceil(y / 100.0 * n))
if(req - x < 0):
print(0)
else:
print(req - x)
``` | output | 1 | 85,980 | 14 | 171,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Some country is populated by wizards. They want to organize a demonstration.
There are n people living in the city, x of them are the wizards who will surely go to the demonstration. Other city people (n - x people) do not support the wizar... | instruction | 0 | 85,981 | 14 | 171,962 |
Tags: implementation, math
Correct Solution:
```
n, x, y = map(int,input().split())
import math
print (0 if x>=n*y/100 else math.ceil(n*y/100 - x))
``` | output | 1 | 85,981 | 14 | 171,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, some of the machinery is defective, so it can currently only produce b thimbles each day. The factory intends to choose a k-day period to do main... | instruction | 0 | 86,147 | 14 | 172,294 |
Tags: data structures
Correct Solution:
```
from functools import reduce
class SegmentTree():
def __init__(self, L, function = lambda x,y: x+y, initilizer = None):
self.function = function
self.initilizer = initilizer
N = self.size = len(L)
M = 1 << N.bit_length()
self.margin... | output | 1 | 86,147 | 14 | 172,295 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, some of the machinery is defective, so it can currently only produce b thimbles each day. The factory intends to choose a k-day period to do main... | instruction | 0 | 86,148 | 14 | 172,296 |
Tags: data structures
Correct Solution:
```
import sys
from math import *
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
def add(a,x,v):
while x<len(a):
a[x] += v
x |= x+1
def get(a,x):
r = 0
while x>=0:
r += a[x]
x = (x&(x+1... | output | 1 | 86,148 | 14 | 172,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, some of the machinery is defective, so it can currently only produce b thimbles each day. The fact... | instruction | 0 | 86,149 | 14 | 172,298 |
No | output | 1 | 86,149 | 14 | 172,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, some of the machinery is defective, so it can currently only produce b thimbles each day. The fact... | instruction | 0 | 86,150 | 14 | 172,300 |
No | output | 1 | 86,150 | 14 | 172,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, some of the machinery is defective, so it can currently only produce b thimbles each day. The fact... | instruction | 0 | 86,151 | 14 | 172,302 |
No | output | 1 | 86,151 | 14 | 172,303 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, some of the machinery is defective, so it can currently only produce b thimbles each day. The fact... | instruction | 0 | 86,152 | 14 | 172,304 |
No | output | 1 | 86,152 | 14 | 172,305 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.
The killer starts with tw... | instruction | 0 | 86,177 | 14 | 172,354 |
Tags: brute force, implementation, strings
Correct Solution:
```
#-------------Program--------------
#----Kuzlyaev-Nikita-Codeforces----
#-------------Training-------------
#----------------------------------
n1,n2=map(str,input().split())
n=int(input())
for i in range(n):
v,f=map(str,input().split())
print(n1... | output | 1 | 86,177 | 14 | 172,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.
The killer starts with tw... | instruction | 0 | 86,178 | 14 | 172,356 |
Tags: brute force, implementation, strings
Correct Solution:
```
line=input()
print(line)
now = line.split()
n=int(input())
for i in range(n):
inp=input().strip()
line=inp.split()
for i in range(len(now)):
if now[i]==line[0]:
now[i]=line[1]
for x in now:
print(x,end=' ')
print()
``` | output | 1 | 86,178 | 14 | 172,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.
The killer starts with tw... | instruction | 0 | 86,179 | 14 | 172,358 |
Tags: brute force, implementation, strings
Correct Solution:
```
import math, sys
def main():
first, second = input().split()
n = int(input())
for i in range(n):
print(first, second)
kill, zher = input().split()
if first == kill:
first = zher
if second == kill:
second = zher
print(first, second)
... | output | 1 | 86,179 | 14 | 172,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.
The killer starts with tw... | instruction | 0 | 86,180 | 14 | 172,360 |
Tags: brute force, implementation, strings
Correct Solution:
```
a, b = map(str, input().split())
print(a, b, sep=' ')
n = int(input())
for i in range(n):
c, d = map(str, input().split())
if c == a:
a = d
if c == b:
b = d
print(a, b, sep=' ')
# CodeForcesian
# β₯
# Ψ²Ψ¨Ω
``` | output | 1 | 86,180 | 14 | 172,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.
The killer starts with tw... | instruction | 0 | 86,181 | 14 | 172,362 |
Tags: brute force, implementation, strings
Correct Solution:
```
def main():
n1, n2 = input().split()
print(n1, n2)
names = {n1, n2}
k = int(input())
for i in range(k):
killed, new = input().split()
names.remove(killed)
names.add(new)
for name in names:
p... | output | 1 | 86,181 | 14 | 172,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.
The killer starts with tw... | instruction | 0 | 86,182 | 14 | 172,364 |
Tags: brute force, implementation, strings
Correct Solution:
```
s = input().split()
print(' '.join(s))
n = int(input())
for i in range(n):
n1, n2 = input().split()
s[s.index(n1)] = n2
print(' '.join(s))
``` | output | 1 | 86,182 | 14 | 172,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.
The killer starts with tw... | instruction | 0 | 86,183 | 14 | 172,366 |
Tags: brute force, implementation, strings
Correct Solution:
```
(a, b) = input().split()
n = int(input())
print(a, b)
for i in range(n):
(a1, a2) = input().split()
if a == a1:
a = a2
elif b == a1:
b = a2
elif a == a2:
a = a1
elif b == a2:
b = a1
print(a... | output | 1 | 86,183 | 14 | 172,367 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for selecting his next victim.
The killer starts with tw... | instruction | 0 | 86,184 | 14 | 172,368 |
Tags: brute force, implementation, strings
Correct Solution:
```
potential_victim_1, potential_victim_2 = input().split()
print(potential_victim_1, potential_victim_2)
n = int(input())
for i in range(n):
victim, next_potential_victim = input().split()
if potential_victim_1 == victim:
print(potential_vic... | output | 1 | 86,184 | 14 | 172,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for select... | instruction | 0 | 86,185 | 14 | 172,370 |
Yes | output | 1 | 86,185 | 14 | 172,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for select... | instruction | 0 | 86,186 | 14 | 172,372 |
Yes | output | 1 | 86,186 | 14 | 172,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for select... | instruction | 0 | 86,187 | 14 | 172,374 |
Yes | output | 1 | 86,187 | 14 | 172,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for select... | instruction | 0 | 86,188 | 14 | 172,376 |
Yes | output | 1 | 86,188 | 14 | 172,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for select... | instruction | 0 | 86,189 | 14 | 172,378 |
No | output | 1 | 86,189 | 14 | 172,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for select... | instruction | 0 | 86,190 | 14 | 172,380 |
No | output | 1 | 86,190 | 14 | 172,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for select... | instruction | 0 | 86,191 | 14 | 172,382 |
No | output | 1 | 86,191 | 14 | 172,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that the killer has a strategy for select... | instruction | 0 | 86,192 | 14 | 172,384 |
No | output | 1 | 86,192 | 14 | 172,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of length exactly ai each hour. Luba can't water ... | instruction | 0 | 86,247 | 14 | 172,494 |
Tags: implementation
Correct Solution:
```
n,k=list(map(int,input().split()))
t=list(map(int,input().split()))
s=[]
for i in range(len(t)):
if k%t[i]==0:
p=k//t[i]
s.append(p)
print(min(s))
``` | output | 1 | 86,247 | 14 | 172,495 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of length exactly ai each hour. Luba can't water ... | instruction | 0 | 86,249 | 14 | 172,498 |
Tags: implementation
Correct Solution:
```
N,K = map(int,input().split())
src = list(map(int,input().split()))
for a in reversed(sorted(src)):
if a > K: continue
if K%a == 0:
print(K//a)
exit()
``` | output | 1 | 86,249 | 14 | 172,499 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of length exactly ai each hour. Luba can't water ... | instruction | 0 | 86,250 | 14 | 172,500 |
Tags: implementation
Correct Solution:
```
n,k=tuple(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
a.reverse()
for i in a:
if k%i==0:
print(k//i)
break
``` | output | 1 | 86,250 | 14 | 172,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of length exactly ai each hour. Luba can't water ... | instruction | 0 | 86,251 | 14 | 172,502 |
Tags: implementation
Correct Solution:
```
n,k = map(int, input().split())
b = list(map(int,input().split()))
a = []
for i in range(n):
if (k/b[i]).is_integer():
a.append(k/b[i])
a = sorted(a)
print(int(a[0]))
``` | output | 1 | 86,251 | 14 | 172,503 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.