message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decide... | instruction | 0 | 60,041 | 8 | 120,082 |
Tags: implementation
Correct Solution:
```
l1 = 0
l0 = 0
r1 = 0
r0 = 0
n = int(input())
for i in range(n):
a,b = map(int,input().split())
if a == 0:
l0 += 1
else:
l1 += 1
if b == 0:
r0 += 1
else:
r1 += 1
print(min(l0,l1) + min(r0,r1))
``` | output | 1 | 60,041 | 8 | 120,083 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decide... | instruction | 0 | 60,042 | 8 | 120,084 |
Tags: implementation
Correct Solution:
```
n=int(input())
list1=[]
list2=[]
for i in range(n):
x,y=map(int,input().split())
list1.append(x)
list2.append(y)
count1=list1.count(0)
count2=list1.count(1)
result1=0
if count1 >= count2:
result1=count2
else:
result1=count1
count3=list2.count(0)
count4=list2.count(1)
resu... | output | 1 | 60,042 | 8 | 120,085 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decide... | instruction | 0 | 60,043 | 8 | 120,086 |
Tags: implementation
Correct Solution:
```
n=int(input())
l=[]
r=[]
for i in range(n):
e1,e2=map(int,input().split())
l.append(e1)
r.append(e2)
a=l.count(0)
b=l.count(1)
c=r.count(0)
d=r.count(1)
ans=0
if a>b:
ans+=b
else:
ans+=a
if c>d:
ans+=d
else:
ans+=c
print(ans)
``` | output | 1 | 60,043 | 8 | 120,087 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decide... | instruction | 0 | 60,044 | 8 | 120,088 |
Tags: implementation
Correct Solution:
```
import sys
f = sys.stdin
#f = open("input.txt", "r")
f.readline()
l, r = [], []
res = 0
for line in f:
l += line.strip().split()[0]
r += line.strip().split()[1]
if l.count('0') < l.count('1'):
res += l.count('0')
else:
res += l.count('1')
if r.count('0') < r.co... | output | 1 | 60,044 | 8 | 120,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decide... | instruction | 0 | 60,045 | 8 | 120,090 |
Tags: implementation
Correct Solution:
```
n = int(input())
L = []
R = []
countL = [0, 0]
countR = [0, 0]
for _ in range(n):
x, y = map(int, input().split())
L.append(x)
R.append(y)
countL[x]+=1
countR[y]+=1
maxL = countL.index(max(countL))
maxR = countR.index(max(countR))
count = 0
for i in range(n):
if(L[i] != ... | output | 1 | 60,045 | 8 | 120,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was not going to be hungry any longer, so he decide... | instruction | 0 | 60,046 | 8 | 120,092 |
Tags: implementation
Correct Solution:
```
def main():
n = int(input())
left1 = 0
right1 = 0
for _ in range(n):
[l, r] = input().split()
left1 += 1 if l == '1' else 0
right1 += 1 if r == '1' else 0
left1 = min(left1, n - left1)
right1 = min(right1, n - right1)
prin... | output | 1 | 60,046 | 8 | 120,093 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was ... | instruction | 0 | 60,047 | 8 | 120,094 |
Yes | output | 1 | 60,047 | 8 | 120,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was ... | instruction | 0 | 60,048 | 8 | 120,096 |
Yes | output | 1 | 60,048 | 8 | 120,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was ... | instruction | 0 | 60,049 | 8 | 120,098 |
Yes | output | 1 | 60,049 | 8 | 120,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was ... | instruction | 0 | 60,050 | 8 | 120,100 |
Yes | output | 1 | 60,050 | 8 | 120,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was ... | instruction | 0 | 60,051 | 8 | 120,102 |
No | output | 1 | 60,051 | 8 | 120,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was ... | instruction | 0 | 60,052 | 8 | 120,104 |
No | output | 1 | 60,052 | 8 | 120,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was ... | instruction | 0 | 60,053 | 8 | 120,106 |
No | output | 1 | 60,053 | 8 | 120,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantenson's house. Fortunately for Karlsson, there wasn't anybody in his friend's house. Karlsson was ... | instruction | 0 | 60,054 | 8 | 120,108 |
No | output | 1 | 60,054 | 8 | 120,109 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked ... | instruction | 0 | 60,134 | 8 | 120,268 |
Tags: graphs, greedy, sortings
Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
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)]
d... | output | 1 | 60,134 | 8 | 120,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked ... | instruction | 0 | 60,135 | 8 | 120,270 |
Tags: graphs, greedy, sortings
Correct Solution:
```
n, m = map(int, input().split())
w = list(map(int, input().split()))
ans = 0
for i in range(m):
x, y = map(int, input().split())
ans += min(w[x-1], w[y-1])
print(ans)
``` | output | 1 | 60,135 | 8 | 120,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked ... | instruction | 0 | 60,136 | 8 | 120,272 |
Tags: graphs, greedy, sortings
Correct Solution:
```
n,m=map(int,input().split())
v=list(map(int,input().split()))
V=list(v)
Cost=[0]*n
Children=[]
for i in range(n):
V[i]=(v[i],i)
Children.append([])
V.sort(reverse=True)
for i in range(m):
x,y=map(int,input().split())
x-=1
y-=1
Children[x].app... | output | 1 | 60,136 | 8 | 120,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked ... | instruction | 0 | 60,137 | 8 | 120,274 |
Tags: graphs, greedy, sortings
Correct Solution:
```
R = lambda:map(int, input().split())
n, m = R()
v = [0] + list(R())
print(sum(min(v[x], v[y]) for x, y in (R() for i in range(m))))
# Made By Mostafa_Khaled
``` | output | 1 | 60,137 | 8 | 120,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked ... | instruction | 0 | 60,138 | 8 | 120,276 |
Tags: graphs, greedy, sortings
Correct Solution:
```
n, m = map(int, input().split())
v =[0]+ list(map(int, input().split()))
r = 0
for i in range(m):
r += min(v[i] for i in map(int, input().split()))
print(r)
``` | output | 1 | 60,138 | 8 | 120,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked ... | instruction | 0 | 60,139 | 8 | 120,278 |
Tags: graphs, greedy, sortings
Correct Solution:
```
(n, m) = list(map(int, input().split(' ')))
v = list(map(int, input().split(' ')))
r = 0
for mm in range(m):
(x, y) = list(map(int, input().split(' ')))
x -= 1
y -= 1
if(v[x] > v[y]):
r += v[y]
else:
r += v[x]
print(r)
... | output | 1 | 60,139 | 8 | 120,279 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked ... | instruction | 0 | 60,140 | 8 | 120,280 |
Tags: graphs, greedy, sortings
Correct Solution:
```
n,m = map(int, input().split(' '))
V = list(map(int, input().split(' ')))
edge = [set() for i in range(n)]
for i in range(m) :
a,b = map(int, input().split(' '))
a-=1;b-=1
edge[a].add(b)
edge[b].add(a)
L = [[V[i], i]for i in range(n)]
L.sort(key = lam... | output | 1 | 60,140 | 8 | 120,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope link... | instruction | 0 | 60,141 | 8 | 120,282 |
No | output | 1 | 60,141 | 8 | 120,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope link... | instruction | 0 | 60,142 | 8 | 120,284 |
No | output | 1 | 60,142 | 8 | 120,285 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryo... | instruction | 0 | 60,183 | 8 | 120,366 |
Tags: implementation
Correct Solution:
```
n, m = map(int, input().split())
c = {}
r = 0
for _ in range(m):
t = list(map(int, input().split()))
c[t[1]] = t[2:]
d = list(c.keys())
for v in d:
if v == 1:
if c[v]:
x = 0
for i in range(len(c[v])):
if c[v][i] !=... | output | 1 | 60,183 | 8 | 120,367 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryo... | instruction | 0 | 60,184 | 8 | 120,368 |
Tags: implementation
Correct Solution:
```
#!/usr/bin/env python
# 556C_matr.py - Codeforces.com 556C Matr quiz
#
# Copyright (C) 2015 Sergey
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
# ... | output | 1 | 60,184 | 8 | 120,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryo... | instruction | 0 | 60,185 | 8 | 120,370 |
Tags: implementation
Correct Solution:
```
parts = 0
ans = 0
a, b = map(int, input().split(' '))
for i in range(b):
shw = list(map(int, input().split(' ')))
ded = shw[0]
pat = shw[1:]
if pat[0] == 1:
ones = 0
for i in range(ded):
if pat[i] == i+1:
ones += 1
... | output | 1 | 60,185 | 8 | 120,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryo... | instruction | 0 | 60,186 | 8 | 120,372 |
Tags: implementation
Correct Solution:
```
n, k = map(int, input().split())
m = [list(map(int, input().split())) for _ in range(k)]
x = [0] * (n + 1)
y = [0] * (n + 1)
res = 0
for i, row in enumerate(m):
for j, v in enumerate(row):
if j == 0:
continue
x[v] = j
y[v] = i
no = 1
f... | output | 1 | 60,186 | 8 | 120,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryo... | instruction | 0 | 60,187 | 8 | 120,374 |
Tags: implementation
Correct Solution:
```
'''
Created on Jun 27, 2015
@author: maged
'''
[n,k] = [int(i) for i in input().split()]
#print(n, k)
unnest = 0
chains = k
for mats in range(0, k):
arr = [int(i) for i in input().split()]
m = arr[0]
if m == 1:
continue
for i in range (2, m+1):
... | output | 1 | 60,187 | 8 | 120,375 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryo... | instruction | 0 | 60,188 | 8 | 120,376 |
Tags: implementation
Correct Solution:
```
def open_doll(i):
global opened, time
opened[doll_num[i]] = i+1
time += doll_size[doll_num[i]] - 1 - doll_ind[i]
n, k = [int(i) for i in input().split(" ")]
doll_num, doll_ind, doll_size = [0] * n, [0] * n, [0] * k
opened = [0]*k
time = 0
for i in range(k):
s_... | output | 1 | 60,188 | 8 | 120,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryo... | instruction | 0 | 60,189 | 8 | 120,378 |
Tags: implementation
Correct Solution:
```
import sys
sys.setrecursionlimit(1000000000)
n,k=map(int,input().split())
t=[]
x=0
for i in range(k):
s=input().split()
h=[]
for j in range(len(s)-1):
h+=[int(s[j+1])]
if int(s[j+1])==1:x=i
t+=[h]
v=1
bb=True
while bb and len(t[x])>v:
if t[x][v]==t[x][v-1]+1:v+=1
... | output | 1 | 60,189 | 8 | 120,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryo... | instruction | 0 | 60,190 | 8 | 120,380 |
Tags: implementation
Correct Solution:
```
n, k = map(int, input().split())
arr = []
gc = 0
cus = 0
for i in range(k):
arr = list(map(int, input().split())) + [10 ** 5 + 2]
c = 0
if arr[1] == 1:
for j in range(1, arr[0] + 1):
if arr[j] + 1 == arr[j + 1]:
c += 1
... | output | 1 | 60,190 | 8 | 120,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls ... | instruction | 0 | 60,191 | 8 | 120,382 |
Yes | output | 1 | 60,191 | 8 | 120,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls ... | instruction | 0 | 60,192 | 8 | 120,384 |
Yes | output | 1 | 60,192 | 8 | 120,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls ... | instruction | 0 | 60,193 | 8 | 120,386 |
Yes | output | 1 | 60,193 | 8 | 120,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls ... | instruction | 0 | 60,194 | 8 | 120,388 |
Yes | output | 1 | 60,194 | 8 | 120,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls ... | instruction | 0 | 60,195 | 8 | 120,390 |
No | output | 1 | 60,195 | 8 | 120,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls ... | instruction | 0 | 60,196 | 8 | 120,392 |
No | output | 1 | 60,196 | 8 | 120,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls ... | instruction | 0 | 60,197 | 8 | 120,394 |
No | output | 1 | 60,197 | 8 | 120,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.
The main exhibit is a construction of n matryoshka dolls ... | instruction | 0 | 60,198 | 8 | 120,396 |
No | output | 1 | 60,198 | 8 | 120,397 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n columns of toy cubes in the box arranged in a line.... | instruction | 0 | 61,015 | 8 | 122,030 |
Tags: greedy, implementation, sortings
Correct Solution:
```
a = int(input())
c = input()
b = c.split()
b = [int(c) for c in b]
b.sort()
d = ''
for i in b:
d += str(i)+' '
d = d.rstrip()
print(d)
``` | output | 1 | 61,015 | 8 | 122,031 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n columns of toy cubes in the box arranged in a line.... | instruction | 0 | 61,016 | 8 | 122,032 |
Tags: greedy, implementation, sortings
Correct Solution:
```
from sys import stdin,stdout
input = stdin.readline
def write(n,sep="\n"):
stdout.write(str(n))
stdout.write(sep)
def gil():
return list(map(int, input().split()))
n=gil()
lis=gil()
lis.sort()
print(' '.join(map(str,lis)))
``` | output | 1 | 61,016 | 8 | 122,033 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n columns of toy cubes in the box arranged in a line.... | instruction | 0 | 61,017 | 8 | 122,034 |
Tags: greedy, implementation, sortings
Correct Solution:
```
num_column = int(input())
line = [int(i) for i in input().split()]
line = sorted(line)
A = []
for i in range(num_column):
line[i] = str(line[i])
A.append(line[i])
print(' '.join(A))
``` | output | 1 | 61,017 | 8 | 122,035 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n columns of toy cubes in the box arranged in a line.... | instruction | 0 | 61,018 | 8 | 122,036 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n = int(input())
cubes = [int(num) for num in input().split()]
for x in range(0, n-1):
minimum = x
for y in range(x+1, n):
if cubes[y] < cubes[minimum]:
minimum = y
prev_val = cubes[x]
cubes[x] = cubes[minimum]
cubes[... | output | 1 | 61,018 | 8 | 122,037 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n columns of toy cubes in the box arranged in a line.... | instruction | 0 | 61,019 | 8 | 122,038 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n = int(input())
coluna = [int(x) for x in input().split()]
while True:
colunasFaltando = 0
for i in range(n-1, -1, -1):
if i != 0:
if coluna[i] < coluna[i-1]:
colunasFaltando += 1
dif = abs(coluna[... | output | 1 | 61,019 | 8 | 122,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n columns of toy cubes in the box arranged in a line.... | instruction | 0 | 61,020 | 8 | 122,040 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n=int(input())
lst=list(map(int,input().split()))[:n]
lst.sort()
s=""
for i in range (len(lst)):
s=s+str(lst[i])
s=s+" "
print(s)
``` | output | 1 | 61,020 | 8 | 122,041 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n columns of toy cubes in the box arranged in a line.... | instruction | 0 | 61,021 | 8 | 122,042 |
Tags: greedy, implementation, sortings
Correct Solution:
```
num_cols = input()
boxes = input().split(' ')
boxes = sorted(list(map(int, boxes)))
boxes = ' '.join(list(map(str, boxes)))
print(boxes)
``` | output | 1 | 61,021 | 8 | 122,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n columns of toy cubes in the box arranged in a line.... | instruction | 0 | 61,022 | 8 | 122,044 |
Tags: greedy, implementation, sortings
Correct Solution:
```
def handleInput():
n = input()
columns = input()
columns = columns.split(" ")
for i in range(len(columns)):
columns[i] = int(columns[i])
return [n, columns]
def mergeSort(arr):
if len(arr) > 1:
mid = len(arr)//2 #Finding the mi... | output | 1 | 61,022 | 8 | 122,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n colu... | instruction | 0 | 61,023 | 8 | 122,046 |
Yes | output | 1 | 61,023 | 8 | 122,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n colu... | instruction | 0 | 61,024 | 8 | 122,048 |
Yes | output | 1 | 61,024 | 8 | 122,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n colu... | instruction | 0 | 61,025 | 8 | 122,050 |
Yes | output | 1 | 61,025 | 8 | 122,051 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.