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.
β This is not playing but duty as allies of justice, Nii-chan!
β Not allies but justice itself, Onii-chan!
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters β Karen and Tsukihi β is heading f... | instruction | 0 | 23,464 | 14 | 46,928 |
Tags: combinatorics, dp, math
Correct Solution:
```
def ncr(n,r):
return (fact[n]*pow((fact[n-r]*fact[r])%mod,mod-2,mod))%mod
def calc(a,b):
count=1
count+=(a*b)
for i in range(2,min(a,b)+1):
# print (ncr(a,i))
count=(count+(ncr(a,i)*ncr(b,i)*fact[i]))%mod
return count
mod=998244353
fact=[1,1]
for i in range... | output | 1 | 23,464 | 14 | 46,929 |
Provide tags and a correct Python 3 solution for this coding contest problem.
β This is not playing but duty as allies of justice, Nii-chan!
β Not allies but justice itself, Onii-chan!
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters β Karen and Tsukihi β is heading f... | instruction | 0 | 23,465 | 14 | 46,930 |
Tags: combinatorics, dp, math
Correct Solution:
```
def calcop(a,b):
t=1
p=1
for i in range(0,min(a,b)):
p *= (a-i)*(b-i)
p //= i+1
t+=p
return t
a,b,c = map(int,input().split())
f = 998244353
ans = calcop(a,b)*calcop(b,c)*calcop(c,a)%f
print(ans)
``` | output | 1 | 23,465 | 14 | 46,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
β This is not playing but duty as allies of justice, Nii-chan!
β Not allies but justice itself, Onii-chan!
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters β Karen and Tsukihi β is heading f... | instruction | 0 | 23,466 | 14 | 46,932 |
Tags: combinatorics, dp, math
Correct Solution:
```
mod = 998244353
f = [1]
for i in range(1, 5010):
f += [f[i - 1] * i % mod]
def powmod(n, k):
if k == 0:
return 1
res = powmod(n, k // 2)
res *= res
res %= mod
if k % 2:
res *= n
res %= mod
return res
def inv(n):... | output | 1 | 23,466 | 14 | 46,933 |
Provide tags and a correct Python 3 solution for this coding contest problem.
β This is not playing but duty as allies of justice, Nii-chan!
β Not allies but justice itself, Onii-chan!
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters β Karen and Tsukihi β is heading f... | instruction | 0 | 23,467 | 14 | 46,934 |
Tags: combinatorics, dp, math
Correct Solution:
```
import math
def fpow(x, y, p):
if y < 0:
return 1 / fpow(x, -y, p)
elif y == 0:
return 1
elif y % 2 == 0:
return fpow((x * x) % p, y // 2, p)
else:
return ((x % p) * fpow(x % p, y - 1, p)) % p
def c(n, k):
global fa... | output | 1 | 23,467 | 14 | 46,935 |
Provide tags and a correct Python 3 solution for this coding contest problem.
β This is not playing but duty as allies of justice, Nii-chan!
β Not allies but justice itself, Onii-chan!
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters β Karen and Tsukihi β is heading f... | instruction | 0 | 23,468 | 14 | 46,936 |
Tags: combinatorics, dp, math
Correct Solution:
```
import math
f = 998244353
def matchings(a,b):
m = max(a,b)
n = min(a,b)
t = 1
p = 1
for i in range(0,n):
p *= (n-i)*(m-i)
p //= i+1
t += p
t = t % f
return(t)
inputs = [int(x) for x in input().spli... | output | 1 | 23,468 | 14 | 46,937 |
Provide tags and a correct Python 3 solution for this coding contest problem.
β This is not playing but duty as allies of justice, Nii-chan!
β Not allies but justice itself, Onii-chan!
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters β Karen and Tsukihi β is heading f... | instruction | 0 | 23,469 | 14 | 46,938 |
Tags: combinatorics, dp, math
Correct Solution:
```
a, b, c = map(int, input().split())
d = 998244353
def f(x, y):
s, t = 0, 1
for i in range(min(x, y) + 1):
s = (s + t) % d
t = t * (x - i) * (y - i) * pow(i + 1, d - 2, d) % d
return s
print(f(a, b) * f(a, c) * f(b, c) % d)
``` | output | 1 | 23,469 | 14 | 46,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make s airplanes.
A group of k people decided to make n airplanes each. They are going to buy several packs of paper, each of them ... | instruction | 0 | 23,526 | 14 | 47,052 |
Tags: math
Correct Solution:
```
k,n,s,p = map(int,input().split())
t = n // s + bool(n % s)
print(k * t // p + bool(k * t % p))
``` | output | 1 | 23,526 | 14 | 47,053 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make s airplanes.
A group of k people decided to make n airplanes each. They are going to buy several packs of paper, each of them ... | instruction | 0 | 23,527 | 14 | 47,054 |
Tags: math
Correct Solution:
```
[k, n, s, p] = [int(x) for x in input().split(' ')]
ndivs = n // s + (0 if n % s == 0 else 1)
packs = k * ndivs // p + (0 if k * ndivs % p == 0 else 1)
print(packs)
``` | output | 1 | 23,527 | 14 | 47,055 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make s airplanes.
A group of k people decided to make n airplanes each. They are going to buy several packs of paper, each of them ... | instruction | 0 | 23,528 | 14 | 47,056 |
Tags: math
Correct Solution:
```
def problem():
k,n,s,p = map(int,input().split(' '))
r = k
if n>s:
if n%s:
r *= n//s+1
else:
r *= n//s
else:
r *= 1
if r>p:
if r%p:
solution = r//p+1
else:
solution = r//p
els... | output | 1 | 23,528 | 14 | 47,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make s airplanes.
A group of k people decided to make n airplanes each. They are going to buy several packs of paper, each of them ... | instruction | 0 | 23,529 | 14 | 47,058 |
Tags: math
Correct Solution:
```
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def ... | output | 1 | 23,529 | 14 | 47,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make s airplanes.
A group of k people decided to make n airplanes each. They are going to buy several packs of paper, each of them ... | instruction | 0 | 23,530 | 14 | 47,060 |
Tags: math
Correct Solution:
```
import math
k,n,s,p=list(map(int,input().split()))
c=n/s
c=math.ceil(c)
c=c*k
c=c/p
c=math.ceil(c)
print(int(c))
``` | output | 1 | 23,530 | 14 | 47,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make s airplanes.
A group of k people decided to make n airplanes each. They are going to buy several packs of paper, each of them ... | instruction | 0 | 23,531 | 14 | 47,062 |
Tags: math
Correct Solution:
```
from math import ceil
(k, n, s, p) = [int(r) for r in input().split()]
total_sheets = k * ceil(n / s)
print(ceil(total_sheets / p))
``` | output | 1 | 23,531 | 14 | 47,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make s airplanes.
A group of k people decided to make n airplanes each. They are going to buy several packs of paper, each of them ... | instruction | 0 | 23,532 | 14 | 47,064 |
Tags: math
Correct Solution:
```
k, n, s, p=input().split()
k=int(k)
n=int(n)
s=int(s)
p=int(p)
if n%s!=0 :
packs=(int(n/s)+1)*k
if packs%p!=0 :
packs=int(((int(n/s)+1)*k)/p)+1
else :
packs=int(((int(n/s)+1)*k)/p)
else :
packs=((n/s)*k)
if packs%p!=0 :
packs=int(((... | output | 1 | 23,532 | 14 | 47,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make s airplanes.
A group of k people decided to make n airplanes each. They are going to buy several packs of paper, each of them ... | instruction | 0 | 23,533 | 14 | 47,066 |
Tags: math
Correct Solution:
```
k, n, s, p=map(float,input().split(' '))
print(int(((n+s-1)//s*k+p-1)//p))
``` | output | 1 | 23,533 | 14 | 47,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She also has put a robot at each end of the row (to th... | instruction | 0 | 23,831 | 14 | 47,662 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n = int(input())
row = [int(i) for i in input().strip().split()]
q_set = set([])
q_possibilities = []
for i in range(-1, -len(row), -1):
q_set.add(row[i])
q_possibilities.append(len(q_set))
q_possibilities.append(0)
q_possibilities.reverse()
p_... | output | 1 | 23,831 | 14 | 47,663 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She also has put a robot at each end of the row (to th... | instruction | 0 | 23,832 | 14 | 47,664 |
Tags: constructive algorithms, implementation
Correct Solution:
```
"""
http://codeforces.com/problemset/problem/1004/C
"""
input()
arr = map(int, input().split())
hash_ = {}
cnt = 0
for x in arr:
if x not in hash_:
cnt += len(hash_)
hash_[x] = len(hash_)
else:
cnt += len(hash_) - hash_[... | output | 1 | 23,832 | 14 | 47,665 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She also has put a robot at each end of the row (to th... | instruction | 0 | 23,833 | 14 | 47,666 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n = int(input())
a = input().split()
cou = [0 for i in range(100005)]
vis = [False for i in range(100005)]
st = set()
for i in range(n):
a[i] = int(a[i])
cou[a[i]] += 1
st.add(a[i])
ans = 0
for i in range(n):
cou[a[i]] -= 1
if cou[a... | output | 1 | 23,833 | 14 | 47,667 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She also has put a robot at each end of the row (to th... | instruction | 0 | 23,834 | 14 | 47,668 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n=int(input())
s=list(map(int,input().split()))
dic={}
for i in s:
dic[i]=len(dic)
print(sum(dic.values()))
``` | output | 1 | 23,834 | 14 | 47,669 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She also has put a robot at each end of the row (to th... | instruction | 0 | 23,835 | 14 | 47,670 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
right = list()
s = set()
for el in a[::-1]:
s.add(el)
right.append(len(s))
right = right[::-1]
s = set()
ans = 0
for i, el in enumerate(a[:-1]):
if el not in s:
ans += right[... | output | 1 | 23,835 | 14 | 47,671 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She also has put a robot at each end of the row (to th... | instruction | 0 | 23,836 | 14 | 47,672 |
Tags: constructive algorithms, implementation
Correct Solution:
```
from collections import Counter
n = int(input())
a = [int(x) for x in input().split()]
sum = 0
d = Counter(a)
la = set()
sa = set(a)
for i in range(n):
d[a[i]] -= 1
if d[a[i]] == 0:
sa.remove(a[i])
if a[i] in la:
co... | output | 1 | 23,836 | 14 | 47,673 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She also has put a robot at each end of the row (to th... | instruction | 0 | 23,837 | 14 | 47,674 |
Tags: constructive algorithms, implementation
Correct Solution:
```
import sys,os,io
import math,bisect,operator
inf,mod = float('inf'),10**9+7
# sys.setrecursionlimit(10 ** 6)
from itertools import groupby,accumulate
from heapq import heapify,heappop,heappush
from collections import deque,Counter,defaultdict
input = i... | output | 1 | 23,837 | 14 | 47,675 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She also has put a robot at each end of the row (to th... | instruction | 0 | 23,838 | 14 | 47,676 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n = int(input())
a = input().split(' ')
d = {}
t = {}
amount = 0
for i in range(n):
a[i] = int(a[i])
elem = a[i]
if elem not in d.keys():
d[elem] = 1
t[elem] = 1
amount += 1
else:
d[elem] += 1
t[e... | output | 1 | 23,838 | 14 | 47,677 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She als... | instruction | 0 | 23,839 | 14 | 47,678 |
Yes | output | 1 | 23,839 | 14 | 47,679 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She als... | instruction | 0 | 23,840 | 14 | 47,680 |
Yes | output | 1 | 23,840 | 14 | 47,681 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She als... | instruction | 0 | 23,841 | 14 | 47,682 |
Yes | output | 1 | 23,841 | 14 | 47,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She als... | instruction | 0 | 23,842 | 14 | 47,684 |
Yes | output | 1 | 23,842 | 14 | 47,685 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She als... | instruction | 0 | 23,843 | 14 | 47,686 |
No | output | 1 | 23,843 | 14 | 47,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She als... | instruction | 0 | 23,844 | 14 | 47,688 |
No | output | 1 | 23,844 | 14 | 47,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She als... | instruction | 0 | 23,845 | 14 | 47,690 |
No | output | 1 | 23,845 | 14 | 47,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers.
Sonya has drawn n numbers in a row, a_i is located in the i-th position. She als... | instruction | 0 | 23,846 | 14 | 47,692 |
No | output | 1 | 23,846 | 14 | 47,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mad scientist Mike is busy carrying out experiments in chemistry. Today he will attempt to join three atoms into one molecule.
A molecule consists of atoms, with some pairs of atoms connected by atomic bonds. Each atom has a valence number ... | instruction | 0 | 24,152 | 14 | 48,304 |
Tags: brute force, graphs, math
Correct Solution:
```
a, b, c = map(int, input().split())
for i in range(max([a, b, c])):
ab = i
bc = b - ab
ca = c - bc
if (bc > 0 or ca > 0) and (bc >= 0 and ca >= 0):
if (ab + ca == a):
print (ab, bc, ca)
exit()
print ('Impossible')
``` | output | 1 | 24,152 | 14 | 48,305 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The research center Q has developed a new multi-core processor. The processor consists of n cores and has k cells of cache memory. Consider the work of this processor.
At each cycle each core of the processor gets one instruction: either do... | instruction | 0 | 24,168 | 14 | 48,336 |
Tags: implementation
Correct Solution:
```
n, m, k = map(int, input().split())
ans = [0 for i in range(n)]
lock = [False for i in range(k)]
deadlock = lock[:]
insset = [[0 for i in range(n)] for i in range(m)]
for i in range(n):
ins = list(map(int, input().split()))
for j in range(m):
insset[j][i] = ins... | output | 1 | 24,168 | 14 | 48,337 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The research center Q has developed a new multi-core processor. The processor consists of n cores and has k cells of cache memory. Consider the work of this processor.
At each cycle each core of the processor gets one instruction: either do... | instruction | 0 | 24,169 | 14 | 48,338 |
Tags: implementation
Correct Solution:
```
import sys
n, m, k = [int(i) for i in sys.stdin.readline().split(' ')]
mem = set()
cpu = {}
x = [0] * n
for i in range(n):
x[i] = [int(j) for j in sys.stdin.readline().split(' ')]
for i in range(m):
dead = set([i for i in range(n)])
dead -= cpu.keys()
dead = [j for j ... | output | 1 | 24,169 | 14 | 48,339 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The research center Q has developed a new multi-core processor. The processor consists of n cores and has k cells of cache memory. Consider the work of this processor.
At each cycle each core of the processor gets one instruction: either do... | instruction | 0 | 24,170 | 14 | 48,340 |
Tags: implementation
Correct Solution:
```
from collections import defaultdict
n, m, k = [int(i) for i in input().split()]
cell = [0 for i in range(k+1)]
core = [0 for i in range(n+1)]
# if core is positive, it has been locked, same if a cell is positive
# core would access the cell
# n is the number of cores
# m is ... | output | 1 | 24,170 | 14 | 48,341 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The research center Q has developed a new multi-core processor. The processor consists of n cores and has k cells of cache memory. Consider the work of this processor.
At each cycle each core of the processor gets one instruction: either do... | instruction | 0 | 24,171 | 14 | 48,342 |
Tags: implementation
Correct Solution:
```
def adds(memtoproc,mem,proc):
if mem in memtoproc:
memtoproc[mem].append(proc)
else:
memtoproc[mem]=[proc]
def corr(arr,n,m):
brokemems=set()
stopprocs=[0]*n
for c in range(m):
memtoproc=dict()
usemems=set()
locmems=... | output | 1 | 24,171 | 14 | 48,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The research center Q has developed a new multi-core processor. The processor consists of n cores and has k cells of cache memory. Consider the work of this processor.
At each cycle each core of the processor gets one instruction: either do... | instruction | 0 | 24,172 | 14 | 48,344 |
Tags: implementation
Correct Solution:
```
n,m,k=map(int,input('').split())
x={}
out=[]
memory=[]
for i in range(n):
x[i]=list(map(int, input('').split()))
out+=[(0)]
for j in range(m):
for i in range(n):
k=x[i][j]
if k!=0:
for q in range(n):
if i!=q and out[i]==0... | output | 1 | 24,172 | 14 | 48,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The research center Q has developed a new multi-core processor. The processor consists of n cores and has k cells of cache memory. Consider the work of this processor.
At each cycle each core of the processor gets one instruction: either do... | instruction | 0 | 24,173 | 14 | 48,346 |
Tags: implementation
Correct Solution:
```
from collections import Counter
n, m, k = map(int, input().split())
a = [list(map(int, input().split())) for i in range(n)]
v, l = [0] * n, [False] * k
for j in range(m):
c = Counter(a[i][j] for i in range(n))
for i in range(n):
if not v[i] and a[i][j] a... | output | 1 | 24,173 | 14 | 48,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The research center Q has developed a new multi-core processor. The processor consists of n cores and has k cells of cache memory. Consider the work of this processor.
At each cycle each core of the processor gets one instruction: either do... | instruction | 0 | 24,174 | 14 | 48,348 |
Tags: implementation
Correct Solution:
```
n, m, k = map(int, input().split())
cycles = [[] for x in range(m)]
for x in range(n):
temp = list(map(int, input().split()))
for i in range(m):
cycles[i].append(temp[i])
active_cores, active_memory = [0] * n, [0] * (k + 1)
for i in range(m):
temp = {}
... | output | 1 | 24,174 | 14 | 48,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The research center Q has developed a new multi-core processor. The processor consists of n cores and has k cells of cache memory. Consider the work of this processor.
At each cycle each core of the processor gets one instruction: either do... | instruction | 0 | 24,175 | 14 | 48,350 |
Tags: implementation
Correct Solution:
```
__author__ = 'Lipen'
def main():
n, m, k = map(int, input().split())
data = []
when = [0]*n
blockedcells = set()
blockedcores = set()
for _ in range(n):
data.append(list(map(int, input().split())))
for j in range(m):
operation = [... | output | 1 | 24,175 | 14 | 48,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to "All World Classical Singing Festival". Other than Devu, comedian Churu was also invited.
Devu has provided organizers a list of ... | instruction | 0 | 24,184 | 14 | 48,368 |
Tags: greedy, implementation
Correct Solution:
```
n,d=input().split()
n=int(n)
d=int(d)
arr = input()
l = list(map(int,arr.split(' ')))
s=0
for i in range(0,n):
s=s+l[i]
s=s+ (n-1)*10
if(s>d):
print(-1)
else:
ans=(n-1)*2 + (d-s)//5
print(ans)
``` | output | 1 | 24,184 | 14 | 48,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to "All World Classical Singing Festival". Other than Devu, comedian Churu was also invited.
Devu has provided organizers a list of ... | instruction | 0 | 24,185 | 14 | 48,370 |
Tags: greedy, implementation
Correct Solution:
```
n,d=map(int,input().split(" "))
a=0
for k in input().split(" "):
a+=int(k)
if(a+10*(n-1)<=d):
print((d-a)//5)
else:
print(-1)
``` | output | 1 | 24,185 | 14 | 48,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to "All World Classical Singing Festival". Other than Devu, comedian Churu was also invited.
Devu has provided organizers a list of ... | instruction | 0 | 24,186 | 14 | 48,372 |
Tags: greedy, implementation
Correct Solution:
```
n, d = map(int, input().split())
sp = list(map(int, input().split()))
if sum(sp) + (n-1)*10 <= d:
d -= (sum(sp)+(n-1)*10)
k = (n-1)*2
k += d // 5
print(k)
else:
print(-1)
``` | output | 1 | 24,186 | 14 | 48,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to "All World Classical Singing Festival". Other than Devu, comedian Churu was also invited.
Devu has provided organizers a list of ... | instruction | 0 | 24,187 | 14 | 48,374 |
Tags: greedy, implementation
Correct Solution:
```
n,d=map(int,input().split())
arr=list(map(int,input().split()))
tot=sum(arr)
tottime=tot+(n-1)*10
if d<tottime:
print(-1)
else:
print((d-tot)//5)
``` | output | 1 | 24,187 | 14 | 48,375 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to "All World Classical Singing Festival". Other than Devu, comedian Churu was also invited.
Devu has provided organizers a list of ... | instruction | 0 | 24,188 | 14 | 48,376 |
Tags: greedy, implementation
Correct Solution:
```
import math
a = [int(x) for x in input().split()]
n = a[0]
d = a[1]
t = [int(x) for x in input().split()]
k = sum(t) + 10*(n-1)
if (k > d):
print('-1')
else:
print(2*(n-1)+ math.floor((d-k)/5))
``` | output | 1 | 24,188 | 14 | 48,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to "All World Classical Singing Festival". Other than Devu, comedian Churu was also invited.
Devu has provided organizers a list of ... | instruction | 0 | 24,189 | 14 | 48,378 |
Tags: greedy, implementation
Correct Solution:
```
n,d=map(int,input().split())
a = sum(list(map(int,input().split())))
if ((n-1)*10+a>d):
print(-1)
exit()
else:
print((d-a)//5)
``` | output | 1 | 24,189 | 14 | 48,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to "All World Classical Singing Festival". Other than Devu, comedian Churu was also invited.
Devu has provided organizers a list of ... | instruction | 0 | 24,190 | 14 | 48,380 |
Tags: greedy, implementation
Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Mon Dec 14 13:18:46 2020
@author: yash
"""
"""
__ __ _
| \/ (_)_ __ ___ _ __
| |\/| | | '__/ _ \| '_ \
| | | | | | | (_) | | | |
|_| |_|_|_| \___/|_| |_|
"""
"""
ββββββ... | output | 1 | 24,190 | 14 | 48,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Devu is a renowned classical singer. He is invited to many big functions/festivals. Recently he was invited to "All World Classical Singing Festival". Other than Devu, comedian Churu was also invited.
Devu has provided organizers a list of ... | instruction | 0 | 24,191 | 14 | 48,382 |
Tags: greedy, implementation
Correct Solution:
```
inp = list(map(int,input().split(" ")))
div=inp[0]
k=inp[1]
jokes=0
songs= list(map(int,input().split(" ")))
if((len(songs)-1)*10+sum(songs)>k):
print("-1")
else:
time_rem=k-(sum(songs))
jokes=time_rem//5
print(int(jokes))
``` | output | 1 | 24,191 | 14 | 48,383 |
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 | 24,297 | 14 | 48,594 |
No | output | 1 | 24,297 | 14 | 48,595 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n pictures delivered for the new exhibition. The i-th painting has beauty ai. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.
We are allowed to arranged pictures in any order. Wha... | instruction | 0 | 24,298 | 14 | 48,596 |
Tags: greedy, sortings
Correct Solution:
```
n = int(input())
l = list(map(int, input().split()))
d = {}
for i in l:
if i not in d:
d[i] = 1
else:
d[i] += 1
m = max(d.values())
print(n - m)
``` | output | 1 | 24,298 | 14 | 48,597 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n pictures delivered for the new exhibition. The i-th painting has beauty ai. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.
We are allowed to arranged pictures in any order. Wha... | instruction | 0 | 24,299 | 14 | 48,598 |
Tags: greedy, sortings
Correct Solution:
```
size = 1001
n = int(input())
a = [0] * size
ans = 0
num = map(int, input().split())
for b in num:
a[b] += 1
while a.count(0) != size:
cnt = 0
for i in range(size):
if a[i]:
cnt += 1
a[i] -= 1
ans += cnt - 1
print(ans)
``` | output | 1 | 24,299 | 14 | 48,599 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.