message stringlengths 2 67k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 463 109k | cluster float64 19 19 | __index_level_0__ int64 926 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules from the very first game. That means, that if ... | instruction | 0 | 94,886 | 19 | 189,772 |
Tags: combinatorics, constructive algorithms, greedy, math
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,defaultd... | output | 1 | 94,886 | 19 | 189,773 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules from the very first game. That means, that if ... | instruction | 0 | 94,887 | 19 | 189,774 |
Tags: combinatorics, constructive algorithms, greedy, math
Correct Solution:
```
n=int(input())
fib=1
last=1
i=0
while True:
i+=1
fib=fib+last
last=fib-last
if fib>n:
print(i-1)
exit(0)
#Π§ΡΠΎ Ρ codeforces?
``` | output | 1 | 94,887 | 19 | 189,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules from the very first game. That means, that if ... | instruction | 0 | 94,888 | 19 | 189,776 |
Tags: combinatorics, constructive algorithms, greedy, math
Correct Solution:
```
n=int(input())
a,b,c=2,1,0
while a<=n:
a,b=a+b,a
c+=1
print(c)
``` | output | 1 | 94,888 | 19 | 189,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules from the very first game. That means, that if ... | instruction | 0 | 94,889 | 19 | 189,778 |
Tags: combinatorics, constructive algorithms, greedy, math
Correct Solution:
```
n=int(input())
fib=1
last=1
i=0
while True:
i+=1
fib=fib+last
last=fib-last
if fib>n:
print(i-1)
exit(0)
``` | output | 1 | 94,889 | 19 | 189,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen and Bessie are playing a simple number game. They both know a function f: \{0, 1\}^n β R, i. e. the function takes n binary arguments and returns a real value. At the start of the game, the variables x_1, x_2, ..., x_n are all set to -... | instruction | 0 | 95,022 | 19 | 190,044 |
Tags: math
Correct Solution:
```
n, r = [int(x) for x in input().split()]
n = 2 ** n
xs = [int(x) for x in input().split()]
s = sum(xs)
res = [0 for _ in range(r+1)]
for i in range(r):
res[i] = s / n
i, val = [int(x) for x in input().split()]
s += val - xs[i]
xs[i] = val
res[r] = s / n
print("\n".jo... | output | 1 | 95,022 | 19 | 190,045 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen and Bessie are playing a simple number game. They both know a function f: \{0, 1\}^n β R, i. e. the function takes n binary arguments and returns a real value. At the start of the game, the variables x_1, x_2, ..., x_n are all set to -... | instruction | 0 | 95,023 | 19 | 190,046 |
Tags: math
Correct Solution:
```
R = lambda:list(map(int,input().split()))
sum1 = 0
p1 = 1
a = [0]*263000
b = a
n,r = R()
p1 = 2**n
a = R()
sum1 = sum(a)
p2 = sum1 / p1
for i in range(r):
z,g=R()
sum1 = sum1 - a[z] + g
a[z] = g
b[i] = sum1/p1
print(p2)
for i in range(r):
print(b[i])
``` | output | 1 | 95,023 | 19 | 190,047 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen and Bessie are playing a simple number game. They both know a function f: \{0, 1\}^n β R, i. e. the function takes n binary arguments and returns a real value. At the start of the game, the variables x_1, x_2, ..., x_n are all set to -... | instruction | 0 | 95,024 | 19 | 190,048 |
Tags: math
Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import time
(n, r) = (int(i) for i in input().split())
c = [int(i) for i in input().split()]
start = time.time()
s = sum(c)
n2 = 2**n
ans = [s/n2]
for i in range(r):
(k, new) = (int(i) for i in input().split())
s +=... | output | 1 | 95,024 | 19 | 190,049 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen and Bessie are playing a simple number game. They both know a function f: \{0, 1\}^n β R, i. e. the function takes n binary arguments and returns a real value. At the start of the game, the variables x_1, x_2, ..., x_n are all set to -... | instruction | 0 | 95,025 | 19 | 190,050 |
Tags: math
Correct Solution:
```
import sys
n, r = [int(x) for x in sys.stdin.readline().split()]
a = [int(x) for x in sys.stdin.readline().split()]
s = sum(a)
n = 2**n
sys.stdout.write(str(s / n)+"\n")
for i in range(r):
p, x = [int(x) for x in sys.stdin.readline().split()]
s = s - a[p] + x
a[p] = x
sys.stdout.wr... | output | 1 | 95,025 | 19 | 190,051 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Allen and Bessie are playing a simple number game. They both know a function f: \{0, 1\}^n β R, i. e. the function takes n binary arguments and returns a real value. At the start of the game, the variables x_1, x_2, ..., x_n are all set to -... | instruction | 0 | 95,026 | 19 | 190,052 |
Tags: math
Correct Solution:
```
from sys import stdin
from math import fsum
def main():
n, m = map(int, input().split())
ff = list(map(float, input().split()))
scale, r = .5 ** n, fsum(ff)
res = [r * scale]
for si, sf in map(str.split, stdin.read().splitlines()):
i, f = int(si), float(sf)... | output | 1 | 95,026 | 19 | 190,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen and Bessie are playing a simple number game. They both know a function f: \{0, 1\}^n β R, i. e. the function takes n binary arguments and returns a real value. At the start of the game, th... | instruction | 0 | 95,027 | 19 | 190,054 |
No | output | 1 | 95,027 | 19 | 190,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen and Bessie are playing a simple number game. They both know a function f: \{0, 1\}^n β R, i. e. the function takes n binary arguments and returns a real value. At the start of the game, th... | instruction | 0 | 95,028 | 19 | 190,056 |
No | output | 1 | 95,028 | 19 | 190,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen and Bessie are playing a simple number game. They both know a function f: \{0, 1\}^n β R, i. e. the function takes n binary arguments and returns a real value. At the start of the game, th... | instruction | 0 | 95,029 | 19 | 190,058 |
No | output | 1 | 95,029 | 19 | 190,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Allen and Bessie are playing a simple number game. They both know a function f: \{0, 1\}^n β R, i. e. the function takes n binary arguments and returns a real value. At the start of the game, th... | instruction | 0 | 95,030 | 19 | 190,060 |
No | output | 1 | 95,030 | 19 | 190,061 |
Provide a correct Python 3 solution for this coding contest problem.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<image> | <image> | <image>
--- | --- | ---
Figure 1: β wins ... | instruction | 0 | 95,179 | 19 | 190,358 |
"Correct Solution:
```
def f(a):
for x in ['o','x']:
if a[0::4].count(x)==3 or a[2:7:2].count(x)==3:return x
for i in range(3):
if a[i*3:i*3+3].count(x)==3 or a[i::3].count(x)==3:return x
return 'd'
while 1:
try:print(f(input()))
except:break
``` | output | 1 | 95,179 | 19 | 190,359 |
Provide a correct Python 3 solution for this coding contest problem.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<image> | <image> | <image>
--- | --- | ---
Figure 1: β wins ... | instruction | 0 | 95,180 | 19 | 190,360 |
"Correct Solution:
```
import sys
for line in sys.stdin.readlines():
l = [s for s in line.rstrip()]
answer = 'd'
for i in range(3):
if l[i] == l[i+3] == l[i+6]:
if l[i] == 'o':
answer = 'o'
elif l[i] == 'x':
answer = 'x'
for i in range(0,8,3):
if l[i] == l[i+1] == l[i+2]:
... | output | 1 | 95,180 | 19 | 190,361 |
Provide a correct Python 3 solution for this coding contest problem.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<image> | <image> | <image>
--- | --- | ---
Figure 1: β wins ... | instruction | 0 | 95,181 | 19 | 190,362 |
"Correct Solution:
```
def f(s):
for t in ['o', 'x']:
if s[::4].count(t) == 3 or s[2:7:2].count(t) == 3:
return t
for i in range(3):
if s[i::3].count(t) == 3 or s[3 * i:3 * i + 3].count(t) == 3:
return t
return 'd'
while 1:
try:
print(f(inpu... | output | 1 | 95,181 | 19 | 190,363 |
Provide a correct Python 3 solution for this coding contest problem.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<image> | <image> | <image>
--- | --- | ---
Figure 1: β wins ... | instruction | 0 | 95,182 | 19 | 190,364 |
"Correct Solution:
```
ok = [[0,4,8], [2,4,6], [0,1,2], [3,4,5], [6,7,8], [0,3,6], [1,4,7], [2,5,8]]
while True:
try:
s = input()
except EOFError:
break
flag = False
for i in ok:
if s[i[0]] == s[i[1]] == s[i[2]] and s[i[0]] != 's':
print(s[i[0]])
flag = Tr... | output | 1 | 95,182 | 19 | 190,365 |
Provide a correct Python 3 solution for this coding contest problem.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<image> | <image> | <image>
--- | --- | ---
Figure 1: β wins ... | instruction | 0 | 95,183 | 19 | 190,366 |
"Correct Solution:
```
while True:
try:
ban = input()
except EOFError:
break
s = [ban[:3], ban[3:6], ban[6:]]
s += map(''.join, zip(*s))
s += [ban[0]+ban[4]+ban[8]] + [ban[2]+ban[4]+ban[6]]
if 'ooo' in s:
print('o')
elif 'xxx' in s:
print('x')
else:
... | output | 1 | 95,183 | 19 | 190,367 |
Provide a correct Python 3 solution for this coding contest problem.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<image> | <image> | <image>
--- | --- | ---
Figure 1: β wins ... | instruction | 0 | 95,184 | 19 | 190,368 |
"Correct Solution:
```
import sys
f = sys.stdin
vlines = [[0,1,2],[3,4,5],[6,7,8],[0,3,6],[1,4,7],[2,5,8],[0,4,8],[2,4,6]]
for line in f:
result = 'd'
for v in vlines:
if 's' != line[v[0]] and line[v[0]]== line[v[1]] == line[v[2]]:
result = line[v[0]]
break
print(result)
... | output | 1 | 95,184 | 19 | 190,369 |
Provide a correct Python 3 solution for this coding contest problem.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<image> | <image> | <image>
--- | --- | ---
Figure 1: β wins ... | instruction | 0 | 95,185 | 19 | 190,370 |
"Correct Solution:
```
# AOJ 0066 Tic Tac Toe
# Python3 2018.6.15 bal4u
def check(a):
for koma in ['o', 'x']:
for i in range(3):
if a[i:9:3].count(koma) == 3 or a[3*i:3*i+3].count(koma) == 3: return koma
if a[0:9:4].count(koma) == 3 or a[2:7:2].count(koma) == 3: return koma
return 'd'
while True:
try: print... | output | 1 | 95,185 | 19 | 190,371 |
Provide a correct Python 3 solution for this coding contest problem.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<image> | <image> | <image>
--- | --- | ---
Figure 1: β wins ... | instruction | 0 | 95,186 | 19 | 190,372 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
import os
import re
def is_win(A, B, C, sign):
if A[0] == A[1] == A[2] == sign or B[0] == B[1] == B[2] == sign or C[0] == C[1] == C[2] == sign:
return True
elif A[0] == B[0] == C[0] == sign or A[1] == B[1] == C[1] == sign or A[2] == B[2] == C[2... | output | 1 | 95,186 | 19 | 190,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<imag... | instruction | 0 | 95,187 | 19 | 190,374 |
Yes | output | 1 | 95,187 | 19 | 190,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<imag... | instruction | 0 | 95,188 | 19 | 190,376 |
Yes | output | 1 | 95,188 | 19 | 190,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<imag... | instruction | 0 | 95,189 | 19 | 190,378 |
Yes | output | 1 | 95,189 | 19 | 190,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<imag... | instruction | 0 | 95,190 | 19 | 190,380 |
Yes | output | 1 | 95,190 | 19 | 190,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<imag... | instruction | 0 | 95,191 | 19 | 190,382 |
No | output | 1 | 95,191 | 19 | 190,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<imag... | instruction | 0 | 95,192 | 19 | 190,384 |
No | output | 1 | 95,192 | 19 | 190,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<imag... | instruction | 0 | 95,193 | 19 | 190,386 |
No | output | 1 | 95,193 | 19 | 190,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tic-tac-toe is a game in which you win when you put β and Γ alternately in the 3 Γ 3 squares and line up β or Γ in one of the vertical, horizontal, and diagonal lines (Fig.). 1 to Fig. 3)
<imag... | instruction | 0 | 95,194 | 19 | 190,388 |
No | output | 1 | 95,194 | 19 | 190,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the following things at the same time: rock, paper o... | instruction | 0 | 95,453 | 19 | 190,906 |
Tags: brute force, constructive algorithms, flows, greedy, math
Correct Solution:
```
import sys
n=int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
mx=min(a[0],b[1])+min(a[1],b[2])+min(a[2],b[0])
if(a[0]>b[0]+b[2]):
mn=a[0]-b[0]-b[2]
elif(a[1]>b[0]+b[1]):
mn=a[1]-b[0]-b[1] ... | output | 1 | 95,453 | 19 | 190,907 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the following things at the same time: rock, paper o... | instruction | 0 | 95,454 | 19 | 190,908 |
Tags: brute force, constructive algorithms, flows, greedy, math
Correct Solution:
```
n = int(input())
a1,a3,a2 = map(int,input().split())
b1,b3,b2 = map(int,input().split())
mx = min(a1,b3) + min(a2,b1) + min(a3,b2)
mi = max(0,a1+b3-n , a2+b1-n , a3+b2-n)
print(mi,mx)
``` | output | 1 | 95,454 | 19 | 190,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the following things at the same time: rock, paper o... | instruction | 0 | 95,455 | 19 | 190,910 |
Tags: brute force, constructive algorithms, flows, greedy, math
Correct Solution:
```
#1426E
from itertools import permutations
import sys
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
maxa=min(a[0],b[1])+min(a[1],b[2])+min(a[2],b[0])
combi=((0,0),(1,1),(2,2),(0,2),(1,0),(2,1))
mina=... | output | 1 | 95,455 | 19 | 190,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the following things at the same time: rock, paper o... | instruction | 0 | 95,456 | 19 | 190,912 |
Tags: brute force, constructive algorithms, flows, greedy, math
Correct Solution:
```
n = int(input())
r,s,p = map(int,input().split())
a,b,c = map(int,input().split())
maxi = min(r,b)+min(s,c)+min(a,p)
mini = max(0,r+b-n)+max(0,s+c-n)+max(0,p+a-n)
print(mini,maxi)
``` | output | 1 | 95,456 | 19 | 190,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the following things at the same time: rock, paper o... | instruction | 0 | 95,457 | 19 | 190,914 |
Tags: brute force, constructive algorithms, flows, greedy, math
Correct Solution:
```
def maxV(first, second):
return str(min(first[0], second[1]) + min(first[1], second[2]) + min(first[2], second[0]))
def minV(first, second):
vitPedra = first[0] - (second[0] + second[2])
vitTesoura = first[1] - (second[0] + sec... | output | 1 | 95,457 | 19 | 190,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the following things at the same time: rock, paper o... | instruction | 0 | 95,458 | 19 | 190,916 |
Tags: brute force, constructive algorithms, flows, greedy, math
Correct Solution:
```
import sys
def main():
#n = iinput()
#k = iinput()
#m = iinput()
n = int(sys.stdin.readline().strip())
#n, k = rinput()
#n, m = rinput()
#m, k = rinput()
#n, k, m = rinput()
#n, m, k = rinp... | output | 1 | 95,458 | 19 | 190,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the following things at the same time: rock, paper o... | instruction | 0 | 95,459 | 19 | 190,918 |
Tags: brute force, constructive algorithms, flows, greedy, math
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
mini=0
maxi=min(a[0],b[1])+min(a[1],b[2])+min(a[2],b[0])
if a[0]>(b[0]+b[2]):
mini=a[0]-b[2]-b[0]
elif a[1]>(b[1]+b[0]):
mini=a[1]-b[1]-b[0]
elif... | output | 1 | 95,459 | 19 | 190,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the following things at the same time: rock, paper o... | instruction | 0 | 95,460 | 19 | 190,920 |
Tags: brute force, constructive algorithms, flows, greedy, math
Correct Solution:
```
import itertools
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
M = min(a[0], b[1]) + min(a[1], b[2]) + min(a[2], b[0])
order = []
order.append((0, 0))
order.append((0, 2))
order.append((1, 1... | output | 1 | 95,460 | 19 | 190,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the f... | instruction | 0 | 95,461 | 19 | 190,922 |
Yes | output | 1 | 95,461 | 19 | 190,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the f... | instruction | 0 | 95,462 | 19 | 190,924 |
Yes | output | 1 | 95,462 | 19 | 190,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the f... | instruction | 0 | 95,463 | 19 | 190,926 |
Yes | output | 1 | 95,463 | 19 | 190,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the f... | instruction | 0 | 95,464 | 19 | 190,928 |
Yes | output | 1 | 95,464 | 19 | 190,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the f... | instruction | 0 | 95,465 | 19 | 190,930 |
No | output | 1 | 95,465 | 19 | 190,931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the f... | instruction | 0 | 95,466 | 19 | 190,932 |
No | output | 1 | 95,466 | 19 | 190,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the f... | instruction | 0 | 95,467 | 19 | 190,934 |
No | output | 1 | 95,467 | 19 | 190,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob have decided to play the game "Rock, Paper, Scissors".
The game consists of several rounds, each round is independent of each other. In each round, both players show one of the f... | instruction | 0 | 95,468 | 19 | 190,936 |
No | output | 1 | 95,468 | 19 | 190,937 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andrey play another game.
Roman leaves a word for each of them. Each word consists of 2Β·n binary characte... | instruction | 0 | 95,587 | 19 | 191,174 |
Tags: games, greedy
Correct Solution:
```
"""
Author - Satwik Tiwari .
24th NOV , 2020 - Tuesday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fractio... | output | 1 | 95,587 | 19 | 191,175 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andrey play another game.
Roman leaves a word for each of them. Each word consists of 2Β·n binary characte... | instruction | 0 | 95,588 | 19 | 191,176 |
Tags: games, greedy
Correct Solution:
```
n = int(input())
a, b = input(), input()
t = {i + j: 0 for i in '01' for j in '01'}
for i in range(2 * n): t[a[i] + b[i]] += 1
d = t['11'] & 1
d += (t['10'] - t['01'] + 1 - d) // 2
if d > 0: d = 1
elif d < 0: d = 2
print(['Draw', 'First', 'Second'][d])
``` | output | 1 | 95,588 | 19 | 191,177 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andrey play another game.
Roman leaves a word for each of them. Each word consists of 2Β·n binary characte... | instruction | 0 | 95,589 | 19 | 191,178 |
Tags: games, greedy
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
... | output | 1 | 95,589 | 19 | 191,179 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andrey play another game.
Roman leaves a word for each of them. Each word consists of 2Β·n binary characte... | instruction | 0 | 95,590 | 19 | 191,180 |
Tags: games, greedy
Correct Solution:
```
from sys import stdin
#def read(): return map(int, stdin.readline().split())
n = int(stdin.readline())
a = stdin.readline()
b = stdin.readline()
cnt0 = 0
cnt1 = 0
cnt2 = 0
for i in range(n*2):
if a[i] == '0':
if b[i] == '0': cnt0 += 1
else: cnt1 += 1
elif b[i] == ... | output | 1 | 95,590 | 19 | 191,181 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andrey play another game.
Roman leaves a word for each of them. Each word consists of 2Β·n binary characte... | instruction | 0 | 95,591 | 19 | 191,182 |
Tags: games, greedy
Correct Solution:
```
ii=lambda:int(input())
kk=lambda:map(int,input().split())
ll=lambda:list(kk())
n,a1,a2=ii(),input(),input()
locs = [0]*4
for i in range(2*n):
locs[int(a1[i])+2*int(a2[i])]+=1
rm = min(locs[1],locs[2])
locs[1]-=rm
locs[2]-=rm
locs[3]=locs[3]&1
if locs[1]:
print("First")
else:
... | output | 1 | 95,591 | 19 | 191,183 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.