message stringlengths 2 30.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 237 109k | cluster float64 10 10 | __index_level_0__ int64 474 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The "BerCorp" company has got n employees. These employees can use m approved official languages for the formal correspondence. The languages are numbered with integers from 1 to m. For each emp... | instruction | 0 | 33,677 | 10 | 67,354 |
No | output | 1 | 33,677 | 10 | 67,355 |
Provide a correct Python 3 solution for this coding contest problem.
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 t... | instruction | 0 | 34,066 | 10 | 68,132 |
"Correct Solution:
```
a,x,c=map(int,input().split())
k=x//a
print(min(k,c))
``` | output | 1 | 34,066 | 10 | 68,133 |
Provide a correct Python 3 solution for this coding contest problem.
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 t... | instruction | 0 | 34,067 | 10 | 68,134 |
"Correct Solution:
```
a,b,c=map(int,input().split())
print(c if a*c<b else b//a)
``` | output | 1 | 34,067 | 10 | 68,135 |
Provide a correct Python 3 solution for this coding contest problem.
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 t... | instruction | 0 | 34,068 | 10 | 68,136 |
"Correct Solution:
```
a, b, c = map(int, input().split())
print(min((b // a, c)))
``` | output | 1 | 34,068 | 10 | 68,137 |
Provide a correct Python 3 solution for this coding contest problem.
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 t... | instruction | 0 | 34,069 | 10 | 68,138 |
"Correct Solution:
```
A,B,C=[int(i) for i in input().split()]
print(min(int(B/A),C))
``` | output | 1 | 34,069 | 10 | 68,139 |
Provide a correct Python 3 solution for this coding contest problem.
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 t... | instruction | 0 | 34,070 | 10 | 68,140 |
"Correct Solution:
```
a,b,c=map(int, input().split())
print(c if (a*c) <= b else b//a )
``` | output | 1 | 34,070 | 10 | 68,141 |
Provide a correct Python 3 solution for this coding contest problem.
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 t... | instruction | 0 | 34,071 | 10 | 68,142 |
"Correct Solution:
```
a, b, c = list(map(int, input().split()))
print(min(b // a, c))
``` | output | 1 | 34,071 | 10 | 68,143 |
Provide a correct Python 3 solution for this coding contest problem.
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 t... | instruction | 0 | 34,072 | 10 | 68,144 |
"Correct Solution:
```
a,b,c=map(int,input().split())
print(b//a if (b//a) <= c else c)
``` | output | 1 | 34,072 | 10 | 68,145 |
Provide a correct Python 3 solution for this coding contest problem.
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 t... | instruction | 0 | 34,073 | 10 | 68,146 |
"Correct Solution:
```
A, B, C = map(int, input().split(' '))
print(min(C, B // A))
``` | output | 1 | 34,073 | 10 | 68,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 ... | instruction | 0 | 34,074 | 10 | 68,148 |
Yes | output | 1 | 34,074 | 10 | 68,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 ... | instruction | 0 | 34,075 | 10 | 68,150 |
Yes | output | 1 | 34,075 | 10 | 68,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 ... | instruction | 0 | 34,076 | 10 | 68,152 |
Yes | output | 1 | 34,076 | 10 | 68,153 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 ... | instruction | 0 | 34,077 | 10 | 68,154 |
Yes | output | 1 | 34,077 | 10 | 68,155 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 ... | instruction | 0 | 34,078 | 10 | 68,156 |
No | output | 1 | 34,078 | 10 | 68,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 ... | instruction | 0 | 34,079 | 10 | 68,158 |
No | output | 1 | 34,079 | 10 | 68,159 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 ... | instruction | 0 | 34,080 | 10 | 68,160 |
No | output | 1 | 34,080 | 10 | 68,161 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 ... | instruction | 0 | 34,081 | 10 | 68,162 |
No | output | 1 | 34,081 | 10 | 68,163 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights between the two piles is minimized. Formally, l... | instruction | 0 | 34,438 | 10 | 68,876 |
Tags: greedy, math
Correct Solution:
```
t=int(input())
while(t>0):
t-=1
n=int(input())
d=n//2
s=0
s+= (2**n)
#print(s)
for i in range(1,d):
s+= (2**i)
#print(s)
s2=0
for i in range(d,n):
s2+=(2**i)
#print(s2)
print(abs(s-s2))
``` | output | 1 | 34,438 | 10 | 68,877 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights between the two piles is minimized. Formally, l... | instruction | 0 | 34,439 | 10 | 68,878 |
Tags: greedy, math
Correct Solution:
```
t=int(input())
for i in range(0,t):
n=int(input())
print((2**(n//2+1))-2)
``` | output | 1 | 34,439 | 10 | 68,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights between the two piles is minimized. Formally, l... | instruction | 0 | 34,440 | 10 | 68,880 |
Tags: greedy, math
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
group1 = 0
group2 = 0
if n==2:
print(2)
else:
for i in range(int(n/2)-1):
group1 += 2**(i+1)
group1 += 2**(n)
for i in range(int(n/2)-1, n-1):
group2 += 2**(i+1)
print(group1 - group2)
``` | output | 1 | 34,440 | 10 | 68,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights between the two piles is minimized. Formally, l... | instruction | 0 | 34,441 | 10 | 68,882 |
Tags: greedy, math
Correct Solution:
```
x=int(input())
for i in range(x):
b=0
n=int(input())
b+=pow(2,n)
for m in range(1,(n//2)):
b+=pow(2,m)
print(2*(b-pow(2,n)+1))
``` | output | 1 | 34,441 | 10 | 68,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights between the two piles is minimized. Formally, l... | instruction | 0 | 34,442 | 10 | 68,884 |
Tags: greedy, math
Correct Solution:
```
t = int(input())
vals = list(range(2, 56, 2))
for case in range(t):
n = int(input())
# diff = 10 ** 9
# total = sum(2 ** x for x in vals)
# for comb in combinations(vals, n // 2):
# sum1 = sum(2 ** x for x in comb)
# diff = min(abs(sum1 - (total... | output | 1 | 34,442 | 10 | 68,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights between the two piles is minimized. Formally, l... | instruction | 0 | 34,443 | 10 | 68,886 |
Tags: greedy, math
Correct Solution:
```
import math
import atexit
import io
import sys
# input = sys.stdin.readline
_OUTPUT_BUFFER = io.StringIO()
sys.stdout = _OUTPUT_BUFFER
@atexit.register
def write():
sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
def array_to_string(a):
s = ""
for i in a:
... | output | 1 | 34,443 | 10 | 68,887 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights between the two piles is minimized. Formally, l... | instruction | 0 | 34,444 | 10 | 68,888 |
Tags: greedy, math
Correct Solution:
```
t=int(input())
for i in range(t):
n=int(input())
if n==2:
print(2)
else:
a=0
b=0
for j in range(1,n//2):
a+=2**j
a+=2**n
for j in range(n//2,n):
b+=2**j
print(abs(a-b))
``` | output | 1 | 34,444 | 10 | 68,889 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights between the two piles is minimized. Formally, l... | instruction | 0 | 34,445 | 10 | 68,890 |
Tags: greedy, math
Correct Solution:
```
j=2
p=2
q={}
while(j<=30):
q[j]=p
p=p*2+2
j=j+2
for i in range(0,int(input())):
n=int(input())
print(q[n])
``` | output | 1 | 34,445 | 10 | 68,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights ... | instruction | 0 | 34,446 | 10 | 68,892 |
Yes | output | 1 | 34,446 | 10 | 68,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights ... | instruction | 0 | 34,447 | 10 | 68,894 |
Yes | output | 1 | 34,447 | 10 | 68,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights ... | instruction | 0 | 34,448 | 10 | 68,896 |
Yes | output | 1 | 34,448 | 10 | 68,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights ... | instruction | 0 | 34,449 | 10 | 68,898 |
Yes | output | 1 | 34,449 | 10 | 68,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights ... | instruction | 0 | 34,450 | 10 | 68,900 |
No | output | 1 | 34,450 | 10 | 68,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights ... | instruction | 0 | 34,451 | 10 | 68,902 |
No | output | 1 | 34,451 | 10 | 68,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights ... | instruction | 0 | 34,452 | 10 | 68,904 |
No | output | 1 | 34,452 | 10 | 68,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Phoenix has n coins with weights 2^1, 2^2, ..., 2^n. He knows that n is even.
He wants to split the coins into two piles such that each pile has exactly n/2 coins and the difference of weights ... | instruction | 0 | 34,453 | 10 | 68,906 |
No | output | 1 | 34,453 | 10 | 68,907 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at d... | instruction | 0 | 34,814 | 10 | 69,628 |
Tags: implementation, math
Correct Solution:
```
n,k=[int(x) for x in input().split(" ")]
precios=[int(x) for x in input().split(" ")]
resp=0
rem=precios[0]%k
minimo=min(precios)
for a in precios:
if (a%k!=rem):
resp=-1
break
else:
resp+=(a-minimo)//k
print(resp)
``` | output | 1 | 34,814 | 10 | 69,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at d... | instruction | 0 | 34,815 | 10 | 69,630 |
Tags: implementation, math
Correct Solution:
```
n, k = map(int, input().split())
a = sorted ( list(map(int, input().split())))
ans = 0
check = True
for i in range(n):
if (a[i]-a[0])%k != 0:
check = False
else:
ans += int((a[i]-a[0])/k)
if check:
print(ans)
else:
print(-1)
``` | output | 1 | 34,815 | 10 | 69,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at d... | instruction | 0 | 34,816 | 10 | 69,632 |
Tags: implementation, math
Correct Solution:
```
###################################################1
import sys
a, k = [int(i) for i in input().split()]
in2 = [int(i) for i in input().split()]
m = min(in2)
in2.remove(m)
res = 0
for r in in2:
if (r - m)%k == 0:
res += (r - m)//k
else:
print(-1)
... | output | 1 | 34,816 | 10 | 69,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at d... | instruction | 0 | 34,817 | 10 | 69,634 |
Tags: implementation, math
Correct Solution:
```
# -*- coding: utf-8 -*-
n,k = map(int,input().split(' '))
l = list(map(int, input().split(' ')))
l.sort()
min_ = l[0]
c = 0
b = True
for i in range(1,n):
if (l[i]-min_)%k==0:
c += (l[i]-min_)//k
else:
c = -1
break
print(c)
``` | output | 1 | 34,817 | 10 | 69,635 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at d... | instruction | 0 | 34,818 | 10 | 69,636 |
Tags: implementation, math
Correct Solution:
```
n,k = map(int,input().split(" "))
p = list(map(int,input().split(" ")))
o = []
for x in p:
o.append(x%k)
ruzne = False
x = o[0]
for num in o:
if num != x:
ruzne = True
if ruzne:
print("-1")
else:
kroky = 0
mn = min(p)
for i in range(n):
kroky += (p... | output | 1 | 34,818 | 10 | 69,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at d... | instruction | 0 | 34,819 | 10 | 69,638 |
Tags: implementation, math
Correct Solution:
```
import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
r=a[0]%k;t=0
for i in range(1,n):
if a[i]%k!=r:
print(-1)
break
else:
t+=(a[i]-a[0])//k
else:
print(t)
``` | output | 1 | 34,819 | 10 | 69,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at d... | instruction | 0 | 34,820 | 10 | 69,640 |
Tags: implementation, math
Correct Solution:
```
from math import floor
a,b = map(int, input().split())
x = list(map(int, input().split()))
mini = min(x)
ar = list(map(lambda a: (a-mini)/b,x))
if len(list(filter(lambda a: floor(a)!=a,ar))) > 0:
print(-1)
else:
print(int(sum(ar)))
``` | output | 1 | 34,820 | 10 | 69,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at d... | instruction | 0 | 34,821 | 10 | 69,642 |
Tags: implementation, math
Correct Solution:
```
n , k = map(int , input().split())
l = list(map(int, input().split()))
minimum = min(l)
ans = 0
for i in l:
if (i-minimum)%k!=0:
ans = -1
break
else:
ans = ans + (i-minimum)//k
print(ans)
``` | output | 1 | 34,821 | 10 | 69,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that ... | instruction | 0 | 34,822 | 10 | 69,644 |
Yes | output | 1 | 34,822 | 10 | 69,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that ... | instruction | 0 | 34,823 | 10 | 69,646 |
Yes | output | 1 | 34,823 | 10 | 69,647 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that ... | instruction | 0 | 34,824 | 10 | 69,648 |
Yes | output | 1 | 34,824 | 10 | 69,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that ... | instruction | 0 | 34,825 | 10 | 69,650 |
Yes | output | 1 | 34,825 | 10 | 69,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that ... | instruction | 0 | 34,826 | 10 | 69,652 |
No | output | 1 | 34,826 | 10 | 69,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that ... | instruction | 0 | 34,827 | 10 | 69,654 |
No | output | 1 | 34,827 | 10 | 69,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that ... | instruction | 0 | 34,828 | 10 | 69,656 |
No | output | 1 | 34,828 | 10 | 69,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that ... | instruction | 0 | 34,829 | 10 | 69,658 |
No | output | 1 | 34,829 | 10 | 69,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A new delivery of clothing has arrived today to the clothing store. This delivery consists of a ties, b scarves, c vests and d jackets.
The store does not sell single clothing items — instead, it sells suits of two types:
* a suit of the... | instruction | 0 | 35,284 | 10 | 70,568 |
Tags: brute force, greedy, math
Correct Solution:
```
from collections import Counter,deque,defaultdict,OrderedDict,namedtuple
from bisect import bisect_left,bisect_right,insort
from math import sqrt,ceil,floor,factorial,gcd
from sys import stdin
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(i... | output | 1 | 35,284 | 10 | 70,569 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.