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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A serious incident happened at Taro's house, which loves steamed buns. One of the three steamed buns offered at the Buddhist altar in the Japanese-style room was gone. When Taro, who was aiming ... | instruction | 0 | 52,949 | 14 | 105,898 |
No | output | 1 | 52,949 | 14 | 105,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A serious incident happened at Taro's house, which loves steamed buns. One of the three steamed buns offered at the Buddhist altar in the Japanese-style room was gone. When Taro, who was aiming ... | instruction | 0 | 52,950 | 14 | 105,900 |
No | output | 1 | 52,950 | 14 | 105,901 |
Provide a correct Python 3 solution for this coding contest problem.
problem
You are in charge of quality control at a machine manufacturing plant. This machine requires a power supply, a motor, and a cable as parts. The manufacturing plant has a power supply, b motors, and c cables, numbered from 1 to a, a + 1 to a ... | instruction | 0 | 52,966 | 14 | 105,932 |
"Correct Solution:
```
for e in iter(input,'0 0 0'):
d=[2]*-~sum(map(int,e.split()))
f=[]
for _ in[0]*int(input()):
s,t,u,v=map(int,input().split())
if v:d[s]=d[t]=d[u]=1
else:f+=[(s,t,u)]
for s,t,u in f:
if d[t]*d[u]==1:d[s]=0
if d[u]*d[s]==1:d[t]=0
if d[s]*d[t]==1:d[u]=0
for x in d[1:]:print(x)
``` | output | 1 | 52,966 | 14 | 105,933 |
Provide a correct Python 3 solution for this coding contest problem.
problem
You are in charge of quality control at a machine manufacturing plant. This machine requires a power supply, a motor, and a cable as parts. The manufacturing plant has a power supply, b motors, and c cables, numbered from 1 to a, a + 1 to a ... | instruction | 0 | 52,967 | 14 | 105,934 |
"Correct Solution:
```
while True:
m = sum(map(int, input().split()))
if not m:
break
n = int(input())
fixed = [2] * m
failures = []
for _ in range(n):
i, j, k, r = map(int, input().split())
i, j, k = (x - 1 for x in (i, j, k))
if r:
fixed[i] = fixed[j... | output | 1 | 52,967 | 14 | 105,935 |
Provide a correct Python 3 solution for this coding contest problem.
problem
You are in charge of quality control at a machine manufacturing plant. This machine requires a power supply, a motor, and a cable as parts. The manufacturing plant has a power supply, b motors, and c cables, numbered from 1 to a, a + 1 to a ... | instruction | 0 | 52,968 | 14 | 105,936 |
"Correct Solution:
```
while 1:
a, b, c = map(int, input().split())
if a == 0:
break
data = []
n = int(input())
for _ in range(n):
data.append(list(map(int, input().split())))
data = sorted(data, key=lambda x: -x[3])
parts = [2] * (a+b+c)
for d in data:
a = d[0... | output | 1 | 52,968 | 14 | 105,937 |
Provide a correct Python 3 solution for this coding contest problem.
problem
You are in charge of quality control at a machine manufacturing plant. This machine requires a power supply, a motor, and a cable as parts. The manufacturing plant has a power supply, b motors, and c cables, numbered from 1 to a, a + 1 to a ... | instruction | 0 | 52,969 | 14 | 105,938 |
"Correct Solution:
```
for e in iter(input,'0 0 0'):
d=[2]*-~sum(map(int,e.split()))
f=[]
for _ in[0]*int(input()):
s,t,u,v=map(int,input().split())
if v:d[s]=d[t]=d[u]=1
else:f+=[(s,t,u)]
for s,t,u in f:
if d[t]*d[u]==1:d[s]=0
if d[u]*d[s]==1:d[t]=0
if d[s]*d[t]==1:d[u]=0
print(*d[1:],sep='\n')
``` | output | 1 | 52,969 | 14 | 105,939 |
Provide a correct Python 3 solution for this coding contest problem.
problem
You are in charge of quality control at a machine manufacturing plant. This machine requires a power supply, a motor, and a cable as parts. The manufacturing plant has a power supply, b motors, and c cables, numbered from 1 to a, a + 1 to a ... | instruction | 0 | 52,970 | 14 | 105,940 |
"Correct Solution:
```
# AOJ 0514: Quality Checking
# Python3 2018.6.30 bal4u
while True:
m = sum(list(map(int, input().split())))
if m == 0: break
p = [2]*(m+1)
tbl = []
for _ in range(int(input())):
i, j, k, r = map(int, input().split())
if r: p[i] = p[j] = p[k] = 1;
else: tbl.append((i, j, k))
for t in ... | output | 1 | 52,970 | 14 | 105,941 |
Provide a correct Python 3 solution for this coding contest problem.
problem
You are in charge of quality control at a machine manufacturing plant. This machine requires a power supply, a motor, and a cable as parts. The manufacturing plant has a power supply, b motors, and c cables, numbered from 1 to a, a + 1 to a ... | instruction | 0 | 52,971 | 14 | 105,942 |
"Correct Solution:
```
for _ in range(5):
a, b, c = [int(s) for s in input().strip().split(' ')]
if a | b | c == 0:
break
n = int(input().strip())
rlist = [[int(s) for s in input().strip().split(' ')] for _ in range(n)]
clist = [2,]*sum((a,b,c))
for success in filter(lambda r: r[3] == 1... | output | 1 | 52,971 | 14 | 105,943 |
Provide a correct Python 3 solution for this coding contest problem.
problem
You are in charge of quality control at a machine manufacturing plant. This machine requires a power supply, a motor, and a cable as parts. The manufacturing plant has a power supply, b motors, and c cables, numbered from 1 to a, a + 1 to a ... | instruction | 0 | 52,972 | 14 | 105,944 |
"Correct Solution:
```
while True:
supply,motor,cable=(int(x) for x in input().split())
if supply==0 and motor==0:
break
checknum=int(input())
reslist=[2]*(supply+motor+cable)
stack=[]
for i in range(checknum):
no1,no2,no3,result=(int(x)-1 for x in input().split())
r... | output | 1 | 52,972 | 14 | 105,945 |
Provide a correct Python 3 solution for this coding contest problem.
problem
You are in charge of quality control at a machine manufacturing plant. This machine requires a power supply, a motor, and a cable as parts. The manufacturing plant has a power supply, b motors, and c cables, numbered from 1 to a, a + 1 to a ... | instruction | 0 | 52,973 | 14 | 105,946 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0514
"""
import sys
from sys import stdin
input = stdin.readline
def main(args):
while True:
a, b, c = map(int, input().split())
if a == 0 and b == 0 and c == 0:
break
N... | output | 1 | 52,973 | 14 | 105,947 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves chemistry, and he enjoys mixing chemicals.
DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in any order.
Let's consider the danger ... | instruction | 0 | 53,423 | 14 | 106,846 |
Tags: dfs and similar, dsu, greedy
Correct Solution:
```
import sys
from collections import deque
# from collections import Counter
# from math import sqrt
# from math import log
# from math import ceil
# from bisect import bisect_left, bisect_right
# alpha=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', ... | output | 1 | 53,423 | 14 | 106,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves chemistry, and he enjoys mixing chemicals.
DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in any order.
Let's consider the danger ... | instruction | 0 | 53,424 | 14 | 106,848 |
Tags: dfs and similar, dsu, greedy
Correct Solution:
```
from collections import defaultdict, deque
def main():
n, m = map(int, input().split())
graph = defaultdict(list)
for _ in range(m):
x, y = map(int, input().split())
graph[x].append(y)
graph[y].append(x)
nodes2visit = se... | output | 1 | 53,424 | 14 | 106,849 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves chemistry, and he enjoys mixing chemicals.
DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in any order.
Let's consider the danger ... | instruction | 0 | 53,425 | 14 | 106,850 |
Tags: dfs and similar, dsu, greedy
Correct Solution:
```
from collections import defaultdict
def dfs(node,graph,vis):
global count
vis[node] = True
count+=1
for i in graph[node]:
if not vis[i]:
dfs(i,graph,vis)
n,m = map(int,input().split())
if m==0:
print(1)
else:
graph = de... | output | 1 | 53,425 | 14 | 106,851 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves chemistry, and he enjoys mixing chemicals.
DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in any order.
Let's consider the danger ... | instruction | 0 | 53,426 | 14 | 106,852 |
Tags: dfs and similar, dsu, greedy
Correct Solution:
```
import sys, os, io
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s + '\n')
def wi(n): sys.stdout.write(str(n) + '\n')
def wia(a)... | output | 1 | 53,426 | 14 | 106,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves chemistry, and he enjoys mixing chemicals.
DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in any order.
Let's consider the danger ... | instruction | 0 | 53,427 | 14 | 106,854 |
Tags: dfs and similar, dsu, greedy
Correct Solution:
```
def abhi(node , y):
visited[node]=1
comp[y].append(node)
for j in adj[node]:
if visited[j]==0:
abhi(j,y)
n,m = map(int,input().split())
adj=[[] for j in range(n+1)]
for j in range(m):
a,b = map(in... | output | 1 | 53,427 | 14 | 106,855 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves chemistry, and he enjoys mixing chemicals.
DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them in one by one, in any order.
Let's consider the danger ... | instruction | 0 | 53,429 | 14 | 106,858 |
Tags: dfs and similar, dsu, greedy
Correct Solution:
```
n, m = map(int, input().split())
p = list(range(n + 1))
s = [{i} for i in p]
for i in range(m):
x, y = map(int, input().split())
x, y = p[x], p[y]
if x != y:
if len(s[x]) < len(s[y]):
for k in s[x]:
p[k] = y
... | output | 1 | 53,429 | 14 | 106,859 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is a school PE teacher. Unlike other PE teachers, Vasya doesn't like it when the students stand in line according to their height. Instead, he demands that the children stand in the following order: a1, a2, ..., an, where ai is the hei... | instruction | 0 | 53,470 | 14 | 106,940 |
Tags: sortings
Correct Solution:
```
n=int(input())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
cnt=0
ans=[]
for i in range(n):
if a[i]==b[i]:
continue
#print(b)
j=i
while j<n and b[j]!=a[i]:
j+=1
while j>i:
b[j],b[j-1]=b[j-1],b[j]
... | output | 1 | 53,470 | 14 | 106,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is a school PE teacher. Unlike other PE teachers, Vasya doesn't like it when the students stand in line according to their height. Instead, he demands that the children stand in the following order: a1, a2, ..., an, where ai is the hei... | instruction | 0 | 53,471 | 14 | 106,942 |
Tags: sortings
Correct Solution:
```
import sys
n = int(sys.stdin.readline ())
a= [int (x) for x in sys.stdin.readline ().split ()]
assert len(a) == n
b = [int (x) for x in sys.stdin.readline ().split ()]
assert len(b) == n
ans = []
for i in range (n):
j = i;
while b[j] != a[i] :
j += 1
while j ... | output | 1 | 53,471 | 14 | 106,943 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is a school PE teacher. Unlike other PE teachers, Vasya doesn't like it when the students stand in line according to their height. Instead, he demands that the children stand in the following order: a1, a2, ..., an, where ai is the hei... | instruction | 0 | 53,472 | 14 | 106,944 |
Tags: sortings
Correct Solution:
```
import sys
n= int(input())
arr2 = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
ans = []
ans2 = []
for i in range(n-1):
# range(n) also work but outer loop will repeat one time more than needed.
# Last i elements are already in place... | output | 1 | 53,472 | 14 | 106,945 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is a school PE teacher. Unlike other PE teachers, Vasya doesn't like it when the students stand in line according to their height. Instead, he demands that the children stand in the following order: a1, a2, ..., an, where ai is the hei... | instruction | 0 | 53,473 | 14 | 106,946 |
Tags: sortings
Correct Solution:
```
n = int(input())
*a, = map(int, input().split())
*b, = map(int, input().split())
ans, s, k = [], 0, 0
while b:
x = b.index(a[k])
b.remove(a[k])
ans.append((x + k + 1, k + 1))
s += x
k += 1
print(s)
for i in ans:
for j in range(i[0], i[1], -1):
pr... | output | 1 | 53,473 | 14 | 106,947 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is a school PE teacher. Unlike other PE teachers, Vasya doesn't like it when the students stand in line according to their height. Instead, he demands that the children stand in the following order: a1, a2, ..., an, where ai is the hei... | instruction | 0 | 53,474 | 14 | 106,948 |
Tags: sortings
Correct Solution:
```
number = int(input())
origin = list(input().split())
array = list(input().split())
positions = {}
pre = []
last = []
result = 0
for i in range(number):
if origin[i] == array[i]:
continue
else:
j = i + 1
index = len(pre)
for j in range(i+1, number):
pre.insert(index,... | output | 1 | 53,474 | 14 | 106,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is a school PE teacher. Unlike other PE teachers, Vasya doesn't like it when the students stand in line according to their height. Instead, he demands that the children stand in the following order: a1, a2, ..., an, where ai is the hei... | instruction | 0 | 53,475 | 14 | 106,950 |
Tags: sortings
Correct Solution:
```
n = int(input())
target = list(map(int,input().split()))
got = list(map(int,input().split()))
swaps = []
for i in range(n-1,-1,-1):
for j in range(i+1):
if got[j] == target[i] and j != i:
swaps.append((j+1,(j+1)+1))
got[j],got[j+1] = got[j+1],got[... | output | 1 | 53,475 | 14 | 106,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is a school PE teacher. Unlike other PE teachers, Vasya doesn't like it when the students stand in line according to their height. Instead, he demands that the children stand in the following order: a1, a2, ..., an, where ai is the hei... | instruction | 0 | 53,476 | 14 | 106,952 |
Tags: sortings
Correct Solution:
```
n = int(input())
original = list(input().split())
given = list(input().split())
pre = []
last = []
result = 0
for i in range(n):
if original[i] == given[i]:
continue
else:
j = i + 1
index = len(pre)
for j in range(i + 1, n):
pre... | output | 1 | 53,476 | 14 | 106,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya is a school PE teacher. Unlike other PE teachers, Vasya doesn't like it when the students stand in line according to their height. Instead, he demands that the children stand in the following order: a1, a2, ..., an, where ai is the hei... | instruction | 0 | 53,477 | 14 | 106,954 |
Tags: sortings
Correct Solution:
```
def main():
N = int(input())
order = list(input().split())
initial = list(input().split())
X = []
Y = []
ans = 0
for i in range(N):
if order[i] == initial[i]:
continue
else:
j = i + 1
length = len(X)
... | output | 1 | 53,477 | 14 | 106,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by th... | instruction | 0 | 53,519 | 14 | 107,038 |
Tags: brute force, data structures, implementation
Correct Solution:
```
import sys
def main():
tmp = [int(x) for x in sys.stdin.readline().split()]
n = tmp[0]
q = tmp[1]
readApp = [0] * n
unreadApp = [0] * n
unreadTot = 0
genApp = [0] * n
firstFlag = 0
genOps = []
for i in ra... | output | 1 | 53,519 | 14 | 107,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by th... | instruction | 0 | 53,520 | 14 | 107,040 |
Tags: brute force, data structures, implementation
Correct Solution:
```
#!/usr/bin/env python
#-*-coding:utf-8 -*-
import sys,collections
n,q=map(int,input().split())
M=collections.defaultdict(collections.deque)
Q=collections.deque()
L=[]
s=n=m=0
for _ in range(q):
y,x=map(int,input().split())
if 2>y:
s+=1
Q.app... | output | 1 | 53,520 | 14 | 107,041 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by th... | instruction | 0 | 53,521 | 14 | 107,042 |
Tags: brute force, data structures, implementation
Correct Solution:
```
def main():
n, q = map(int, input().split())
vol, tot, l, res = [0] * (n + 1), [0] * (n + 1), [], []
z = m = 0
for _ in range(q):
t, x = map(int, input().split())
if t == 1:
l.append(x)
tot[x... | output | 1 | 53,521 | 14 | 107,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by th... | instruction | 0 | 53,522 | 14 | 107,044 |
Tags: brute force, data structures, implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
n, q = map(int, input().split())
l = [[] for _ in range(n)]
is_read = []
is_read_idx = 0
ans = 0
prev_t = 0
for _ in range(q):
ty, v = map(int, input().split())
if ty==1:
l[v-1].append(i... | output | 1 | 53,522 | 14 | 107,045 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by th... | instruction | 0 | 53,523 | 14 | 107,046 |
Tags: brute force, data structures, implementation
Correct Solution:
```
from collections import defaultdict, deque
q = deque()
idx, total = 0, 0
vis = defaultdict(deque)
not_valid = set()
max_x = -1
ans = []
N, Q = map(int, input().split())
for _ in range(Q):
t, x = map(int, input().split())
if t == 1:
... | output | 1 | 53,523 | 14 | 107,047 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by th... | instruction | 0 | 53,524 | 14 | 107,048 |
Tags: brute force, data structures, implementation
Correct Solution:
```
from sys import stdin
from collections import defaultdict
test = stdin.readlines()
n, q = map(int, test[0].split())
timeline = []
unread = defaultdict(lambda: [0, 0]) # 0 unread app notifications from t = 0
ans = 0
start = 0
out = []
for i in ... | output | 1 | 53,524 | 14 | 107,049 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by th... | instruction | 0 | 53,525 | 14 | 107,050 |
Tags: brute force, data structures, implementation
Correct Solution:
```
import collections
n,q=map(int,input().split())
dq=collections.deque()
l=n*[0]
p=list(l)
ans=0
t=0
ansl=[]
while(q):
a,b=map(int,input().split())
if a==1:
dq.append(b-1)
l[b-1],p[b-1]=l[b-1]+1,p[b-1]+1
ans=ans+1
... | output | 1 | 53,525 | 14 | 107,051 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the number of unread notifications generated by th... | instruction | 0 | 53,526 | 14 | 107,052 |
Tags: brute force, data structures, implementation
Correct Solution:
```
#!/usr/bin/env python
#-*-coding:utf-8 -*-
import collections
n,q=map(int,input().split())
Q=collections.deque()
A=n*[0]
B=A[:]
L=[]
s=n=0
for _ in range(q):
y,x=map(int,input().split())
if 2>y:
x-=1
Q.append(x)
B[x]+=1
A[x]+=1
s+=1
e... | output | 1 | 53,526 | 14 | 107,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the... | instruction | 0 | 53,527 | 14 | 107,054 |
Yes | output | 1 | 53,527 | 14 | 107,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the... | instruction | 0 | 53,528 | 14 | 107,056 |
Yes | output | 1 | 53,528 | 14 | 107,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the... | instruction | 0 | 53,529 | 14 | 107,058 |
Yes | output | 1 | 53,529 | 14 | 107,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the... | instruction | 0 | 53,530 | 14 | 107,060 |
Yes | output | 1 | 53,530 | 14 | 107,061 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the... | instruction | 0 | 53,531 | 14 | 107,062 |
No | output | 1 | 53,531 | 14 | 107,063 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the... | instruction | 0 | 53,532 | 14 | 107,064 |
No | output | 1 | 53,532 | 14 | 107,065 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the... | instruction | 0 | 53,533 | 14 | 107,066 |
No | output | 1 | 53,533 | 14 | 107,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can't count the... | instruction | 0 | 53,534 | 14 | 107,068 |
No | output | 1 | 53,534 | 14 | 107,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start its journey, but firstly they have to choose kay... | instruction | 0 | 53,587 | 14 | 107,174 |
Tags: brute force, greedy, sortings
Correct Solution:
```
from sys import stdin, stdout
n = int(stdin.readline())
values = sorted(list(map(int, stdin.readline().split())))
ans = float('inf')
for i in range(2 * n):
for j in range(i + 1, 2 * n):
res = []
for z in range(2 * n):
... | output | 1 | 53,587 | 14 | 107,175 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start its journey, but firstly they have to choose kay... | instruction | 0 | 53,588 | 14 | 107,176 |
Tags: brute force, greedy, sortings
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
a.sort()
an = 10 ** 9
for i in range(2 * n):
for j in range(i + 1, 2 * n):
if i == j:
continue
b = a[:]
del b[j], b[i]
c = 0
for k in range(0, 2 * n - 2... | output | 1 | 53,588 | 14 | 107,177 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start its journey, but firstly they have to choose kay... | instruction | 0 | 53,589 | 14 | 107,178 |
Tags: brute force, greedy, sortings
Correct Solution:
```
n = int(input())
w = list(map(int, input().split()))
w.sort()
p = 2 * n
num = []
for i in range(p):
for j in range(i + 1, p):
l = []
dif = 0
for k in range(p):
if k != i and k != j:
l.append(w[k])
f... | output | 1 | 53,589 | 14 | 107,179 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start its journey, but firstly they have to choose kay... | instruction | 0 | 53,590 | 14 | 107,180 |
Tags: brute force, greedy, sortings
Correct Solution:
```
n = int(input())
w = list(map(int, input().split()))
w.sort()
d = []
# Решаем перебором, выбрасываем из списка 2 каякеров и
# находим сумму разностей весов у оставшихся, отсортированных по возрастанию
for i in range(0, 2 * n):
for j in range(i + 1, 2 * n)... | output | 1 | 53,590 | 14 | 107,181 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start its journey, but firstly they have to choose kay... | instruction | 0 | 53,591 | 14 | 107,182 |
Tags: brute force, greedy, sortings
Correct Solution:
```
n = int(input())
a = list(map(int, input().strip().split()))
a.sort()
best = 100000
for i in range(0, 2*n-1):
for j in range(i+1, 2*n):
diff = 0
p = -1
for k in range(0,2*n):
if k != i and k != j:
diff +... | output | 1 | 53,591 | 14 | 107,183 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start its journey, but firstly they have to choose kay... | instruction | 0 | 53,592 | 14 | 107,184 |
Tags: brute force, greedy, sortings
Correct Solution:
```
n = int(input())
weights = list(map(int, input().split()))
pairs=[]
for i in range(2*n):
for j in range(2*n):
if i != j:
pairs.append([i, j])
total_diff = 10000000000
for pair in pairs:
diff = 0
new_weights = weights.copy()
ne... | output | 1 | 53,592 | 14 | 107,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start its journey, but firstly they have to choose kay... | instruction | 0 | 53,593 | 14 | 107,186 |
Tags: brute force, greedy, sortings
Correct Solution:
```
from itertools import combinations, chain
from math import inf
def take(s):
return sum([abs(s[i] - s[i+1]) for i in range(0, 2*n-2, 2)])
n = int(input())
wi = sorted(map(int, input().split()))
minimum = inf
for lonely_couple in combinations(range(2*n), 2):... | output | 1 | 53,593 | 14 | 107,187 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start its journey, but firstly they have to choose kay... | instruction | 0 | 53,594 | 14 | 107,188 |
Tags: brute force, greedy, sortings
Correct Solution:
```
def main():
n = int(input())
n *= 2
a = list(map(int, input().split()))
a.sort()
#print(*a)
o = 919478437678234
for i in range(0, n - 1):
for j in range(i + 1, n):
#print(i, j)
oo = 0
s = 0
... | output | 1 | 53,594 | 14 | 107,189 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start i... | instruction | 0 | 53,595 | 14 | 107,190 |
Yes | output | 1 | 53,595 | 14 | 107,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.
Now the party is ready to start i... | instruction | 0 | 53,596 | 14 | 107,192 |
Yes | output | 1 | 53,596 | 14 | 107,193 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.