message stringlengths 2 20.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 1.95k 109k | cluster float64 17 17 | __index_level_0__ int64 3.91k 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest... | instruction | 0 | 87,135 | 17 | 174,270 |
Yes | output | 1 | 87,135 | 17 | 174,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest... | instruction | 0 | 87,136 | 17 | 174,272 |
Yes | output | 1 | 87,136 | 17 | 174,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest... | instruction | 0 | 87,137 | 17 | 174,274 |
Yes | output | 1 | 87,137 | 17 | 174,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest... | instruction | 0 | 87,138 | 17 | 174,276 |
No | output | 1 | 87,138 | 17 | 174,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest... | instruction | 0 | 87,139 | 17 | 174,278 |
No | output | 1 | 87,139 | 17 | 174,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest... | instruction | 0 | 87,140 | 17 | 174,280 |
No | output | 1 | 87,140 | 17 | 174,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest... | instruction | 0 | 87,141 | 17 | 174,282 |
No | output | 1 | 87,141 | 17 | 174,283 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This time the Berland Team Olympiad in Informatics is held in a remote city that can only be reached by one small bus. Bus has n passenger seats, seat i can be occupied only by a participant from the city ai.
Today the bus has completed m t... | instruction | 0 | 87,222 | 17 | 174,444 |
Tags: data structures, implementation
Correct Solution:
```
import sys
from collections import deque
input=sys.stdin.readline
n,k,m=map(int,input().split())
a=list(map(int,input().split()))
r=a[0]
flag=0
for i in range(n):
if r!=a[i]:
flag=1
break
if flag==0:
print((m*n)%k)
sys.exit()
if k>n:
print(m*n)... | output | 1 | 87,222 | 17 | 174,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This time the Berland Team Olympiad in Informatics is held in a remote city that can only be reached by one small bus. Bus has n passenger seats, seat i can be occupied only by a participant from the city ai.
Today the bus has completed m t... | instruction | 0 | 87,223 | 17 | 174,446 |
Tags: data structures, implementation
Correct Solution:
```
def main():
_, k, m = [int(x) for x in input().split()]
a = []
last = ("-1", 0)
a.append(last)
for ai in input().split():
if last[0] == ai:
last = (ai, last[1]+1)
a[-1] = last
else:
last =... | output | 1 | 87,223 | 17 | 174,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This time the Berland Team Olympiad in Informatics is held in a remote city that can only be reached by one small bus. Bus has n passenger seats, seat i can be occupied only by a participant fro... | instruction | 0 | 87,224 | 17 | 174,448 |
No | output | 1 | 87,224 | 17 | 174,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This time the Berland Team Olympiad in Informatics is held in a remote city that can only be reached by one small bus. Bus has n passenger seats, seat i can be occupied only by a participant fro... | instruction | 0 | 87,225 | 17 | 174,450 |
No | output | 1 | 87,225 | 17 | 174,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This time the Berland Team Olympiad in Informatics is held in a remote city that can only be reached by one small bus. Bus has n passenger seats, seat i can be occupied only by a participant fro... | instruction | 0 | 87,226 | 17 | 174,452 |
No | output | 1 | 87,226 | 17 | 174,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This time the Berland Team Olympiad in Informatics is held in a remote city that can only be reached by one small bus. Bus has n passenger seats, seat i can be occupied only by a participant fro... | instruction | 0 | 87,227 | 17 | 174,454 |
No | output | 1 | 87,227 | 17 | 174,455 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kostya is a progamer specializing in the discipline of Dota 2. Valve Corporation, the developer of this game, has recently released a new patch which turned the balance of the game upside down. ... | instruction | 0 | 87,915 | 17 | 175,830 |
No | output | 1 | 87,915 | 17 | 175,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card.
Vasya... | instruction | 0 | 87,941 | 17 | 175,882 |
Tags: implementation
Correct Solution:
```
f=input()
s=input()
n=int(input())
ans=[]
printed=[]
for i in range(n):
t,ty,m,ca=input().split()
li=[]
if ca=='r':
li.append(ty)
li.append(m)
if li not in printed:
if ty == 'h':
print(f, m, t)
else:
... | output | 1 | 87,941 | 17 | 175,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card.
Vasya... | instruction | 0 | 87,942 | 17 | 175,884 |
Tags: implementation
Correct Solution:
```
__author__ = 'Administrator'
def inp():
return input()
home = inp()
away = inp()
n = int(inp())
class Node:
time = 0
team = 0
num = 0
color = 0
def __lt__(self, other):
return self.time < other.time
def __init__(self, a, b, c, d):
... | output | 1 | 87,942 | 17 | 175,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card.
Vasya... | instruction | 0 | 87,943 | 17 | 175,886 |
Tags: implementation
Correct Solution:
```
import collections
a_name = input()
b_name = input()
n = int(input())
players = [collections.Counter() for i in range(2)]
for i in range(n):
t, team, player, color = input().split()
team = 0 if team == 'h' else 1
player = int(player)
if color == 'y' and player... | output | 1 | 87,943 | 17 | 175,887 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card.
Vasya... | instruction | 0 | 87,944 | 17 | 175,888 |
Tags: implementation
Correct Solution:
```
s = input()
t = input()
n = int(input())
lis=[]
anh=[0]*(101)
ana=[0]*(101)
an=[]
for i in range(n):
n,m,a,b = map(str,input().split())
if m=='h':
lis.append([int(n),s,int(a),b,m])
else:
lis.append([int(n),t,int(a),b,m])
lis.sort()
#print(lis)
for i... | output | 1 | 87,944 | 17 | 175,889 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card.
Vasya... | instruction | 0 | 87,945 | 17 | 175,890 |
Tags: implementation
Correct Solution:
```
from collections import *
s1=input()
s2=input()
n=int(input())
d=defaultdict(int)
for i in range(n):
time,ty,num,col=map(str,input().split())
d[ty+num+col]+=1
if col=='y' and d[ty+num+col]==2 and d[ty+num+'r']==0:
if ty=='a':
print(s2,num,time)
... | output | 1 | 87,945 | 17 | 175,891 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card.
Vasya... | instruction | 0 | 87,946 | 17 | 175,892 |
Tags: implementation
Correct Solution:
```
team1 = input()
team2 = input()
fouls = int(input())
warn1 = [False] * 100
warn2 = [False] * 100
out1 = [False] * 100
out2 = [False] * 100
warns = []
for i in range(fouls):
a, b, c, d = map(str, input().split(' '))
a, c = int(a), int(c)
if b == 'a' and d == 'r' ... | output | 1 | 87,946 | 17 | 175,893 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card.
Vasya... | instruction | 0 | 87,947 | 17 | 175,894 |
Tags: implementation
Correct Solution:
```
if __name__ == '__main__':
h_team_name = input()
a_team_name = input()
h=dict()
a1 = dict()
ans = []
for _ in range (int(input())):
a,b,c,d=input().split()
if d == 'r':
if b == 'h':
h.setdefault(c,0)
h[c]+=2
if h[c] == 2 or h[c]==3:
ans.append([h_... | output | 1 | 87,947 | 17 | 175,895 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow card automatically receives a red card.
Vasya... | instruction | 0 | 87,948 | 17 | 175,896 |
Tags: implementation
Correct Solution:
```
__author__ = 'PrimuS'
s1 = input().strip("\n")
s2 = input().strip("\n")
n = int(input())
d1 = {}
d2 = {}
for i in range(n):
ss = input().split()
t = int(ss[0])
x = int(ss[2])
ss[3].strip("\n")
if ss[1] == 'h':
if x in d1 and d1[x] == 1:
... | output | 1 | 87,948 | 17 | 175,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow... | instruction | 0 | 87,949 | 17 | 175,898 |
Yes | output | 1 | 87,949 | 17 | 175,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow... | instruction | 0 | 87,950 | 17 | 175,900 |
Yes | output | 1 | 87,950 | 17 | 175,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow... | instruction | 0 | 87,951 | 17 | 175,902 |
Yes | output | 1 | 87,951 | 17 | 175,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow... | instruction | 0 | 87,952 | 17 | 175,904 |
Yes | output | 1 | 87,952 | 17 | 175,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow... | instruction | 0 | 87,953 | 17 | 175,906 |
No | output | 1 | 87,953 | 17 | 175,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow... | instruction | 0 | 87,954 | 17 | 175,908 |
No | output | 1 | 87,954 | 17 | 175,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow... | instruction | 0 | 87,955 | 17 | 175,910 |
No | output | 1 | 87,955 | 17 | 175,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has started watching football games. He has learned that for some fouls the players receive yellow cards, and for some fouls they receive red cards. A player who receives the second yellow... | instruction | 0 | 87,956 | 17 | 175,912 |
No | output | 1 | 87,956 | 17 | 175,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and points distribution for the next race, your task i... | instruction | 0 | 88,372 | 17 | 176,744 |
Tags: greedy
Correct Solution:
```
I=lambda:map(int,input().split())
n,d=I()
r,p=list(I()),list(I())
q,w,e,t=r[d-1]+p[0],d-2,1,0
while w>=0 and e<n:
if r[w]+p[e]<=q:w-=1;t+=1
e+=1
print(d-t)
``` | output | 1 | 88,372 | 17 | 176,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and points distribution for the next race, your task i... | instruction | 0 | 88,373 | 17 | 176,746 |
Tags: greedy
Correct Solution:
```
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
x=k
j=n-1
love=a[k-1]+b[0]
for i in range(k-1):
if love>=(a[i]+b[j]):
x-=1
j-=1
print(x)
``` | output | 1 | 88,373 | 17 | 176,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and points distribution for the next race, your task i... | instruction | 0 | 88,374 | 17 | 176,748 |
Tags: greedy
Correct Solution:
```
n,d=map(int,input().split())
s=[int(x) for x in input().split()]
p=[int(X) for X in input().split()]
z=[]
tt=s[d-1]+p[0]
z.append(s[d-1]+p[0])
p[0]=-1
s[d-1]=-1
i=0
j=1
v=n-1
s.sort(reverse=True)
p.sort()
while (i<n-1 and j<=v ):
if (s[i]+p[j])<=tt:
z.append(s[i]+p[j])
... | output | 1 | 88,374 | 17 | 176,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and points distribution for the next race, your task i... | instruction | 0 | 88,375 | 17 | 176,750 |
Tags: greedy
Correct Solution:
```
a = input().split()
a = [int(i) for i in a]
b = input().split()
b = [int(i) for i in b]
c = input().split()
c = [int(i) for i in c]
cha = []
for i in range(0, a[1] - 1):
cha.append(b[i] -b[a[1] - 1])
cao = []
for i in range(1, a[1]):
cao.append(c[0] - c[-i])
dui = 0
cha.sort()... | output | 1 | 88,375 | 17 | 176,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and points distribution for the next race, your task i... | instruction | 0 | 88,376 | 17 | 176,752 |
Tags: greedy
Correct Solution:
```
n,d = map(int,input().split())
s = list(map(int,input().split()))
p = list(map(int,input().split()))
maxPoints = s[d-1]+p[0]
pos = n-1
points = 1
count = 0
while (pos>=0 and points<n):
if (pos == d-1):
pos -= 1
else:
if (s[pos]+p[points]<=maxPoints):
... | output | 1 | 88,376 | 17 | 176,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and points distribution for the next race, your task i... | instruction | 0 | 88,377 | 17 | 176,754 |
Tags: greedy
Correct Solution:
```
n,d=map(int,input().split())
s=[*map(int,input().split())]
p=[*map(int,input().split())]
p=p[::-1]
item=s[d-1]+p[-1]
p.pop()
res=1
from bisect import bisect as bis
for i,x in enumerate(s):
if i!=d-1:
diff=item-x
if diff<0:res+=1;p.pop()
else:
a=... | output | 1 | 88,377 | 17 | 176,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and points distribution for the next race, your task i... | instruction | 0 | 88,378 | 17 | 176,756 |
Tags: greedy
Correct Solution:
```
from bisect import bisect_right
n,d = map(int,input().split())
s = list(map(int,input().split()))
p = list(map(int,input().split()))
t_wyn = []
wyn = s[d-1]+p[0]
t_wyn.append(wyn)
del s[d-1]
s_sort = sorted(s)
p_sort = sorted(p)
p_sort.pop()
for x in range(0,len(s),+1):
szuk = wyn... | output | 1 | 88,378 | 17 | 176,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and points distribution for the next race, your task i... | instruction | 0 | 88,379 | 17 | 176,758 |
Tags: greedy
Correct Solution:
```
from bisect import bisect_right
num_racers, selected_racer = map(int, input().split())
selected_racer -= 1
racers_points = list(map(int, input().split()))
selected_racer_points = racers_points[selected_racer]
awards = list(map(int, input().split()))
awards.sort(reverse=True)
selected... | output | 1 | 88,379 | 17 | 176,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and poi... | instruction | 0 | 88,380 | 17 | 176,760 |
Yes | output | 1 | 88,380 | 17 | 176,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and poi... | instruction | 0 | 88,381 | 17 | 176,762 |
Yes | output | 1 | 88,381 | 17 | 176,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and poi... | instruction | 0 | 88,382 | 17 | 176,764 |
Yes | output | 1 | 88,382 | 17 | 176,765 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and poi... | instruction | 0 | 88,383 | 17 | 176,766 |
Yes | output | 1 | 88,383 | 17 | 176,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and poi... | instruction | 0 | 88,384 | 17 | 176,768 |
No | output | 1 | 88,384 | 17 | 176,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and poi... | instruction | 0 | 88,385 | 17 | 176,770 |
No | output | 1 | 88,385 | 17 | 176,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and poi... | instruction | 0 | 88,386 | 17 | 176,772 |
No | output | 1 | 88,386 | 17 | 176,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Formula 1 officials decided to introduce new competition. Cars are replaced by space ships and number of points awarded can differ per race.
Given the current ranking in the competition and poi... | instruction | 0 | 88,387 | 17 | 176,774 |
No | output | 1 | 88,387 | 17 | 176,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At the school where Vasya is studying, preparations are underway for the graduation ceremony. One of the planned performances is a ball, which will be attended by pairs of boys and girls.
Each class must present two couples to the ball. In ... | instruction | 0 | 88,623 | 17 | 177,246 |
Tags: combinatorics, graphs, math
Correct Solution:
```
#pyrival orz
import os
import sys
import math
from io import BytesIO, IOBase
input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
... | output | 1 | 88,623 | 17 | 177,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At the school where Vasya is studying, preparations are underway for the graduation ceremony. One of the planned performances is a ball, which will be attended by pairs of boys and girls.
Each class must present two couples to the ball. In ... | instruction | 0 | 88,624 | 17 | 177,248 |
Tags: combinatorics, graphs, math
Correct Solution:
```
import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log2, ceil
from collections import defaultdict as dd
from bisect import bisect_left as bl, bisect_right as br
from bisect import insort
from collections import C... | output | 1 | 88,624 | 17 | 177,249 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At the school where Vasya is studying, preparations are underway for the graduation ceremony. One of the planned performances is a ball, which will be attended by pairs of boys and girls.
Each class must present two couples to the ball. In ... | instruction | 0 | 88,625 | 17 | 177,250 |
Tags: combinatorics, graphs, math
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import ... | output | 1 | 88,625 | 17 | 177,251 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At the school where Vasya is studying, preparations are underway for the graduation ceremony. One of the planned performances is a ball, which will be attended by pairs of boys and girls.
Each class must present two couples to the ball. In ... | instruction | 0 | 88,626 | 17 | 177,252 |
Tags: combinatorics, graphs, math
Correct Solution:
```
for tests in range(int(input())):
a,b,k=map(int,input().split())
la=list(map(int,input().split()))
lb=list(map(int,input().split()))
d={}
g={}
for i in range(k):
if d.get(la[i])==None:
d[la[i]]=1
else:
... | output | 1 | 88,626 | 17 | 177,253 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.