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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are b boys and g girls participating in Olympiad of Metropolises. There will be a board games tournament in the evening and n participants have accepted the invitation. The organizers do n... | instruction | 0 | 75,089 | 19 | 150,178 |
Yes | output | 1 | 75,089 | 19 | 150,179 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are b boys and g girls participating in Olympiad of Metropolises. There will be a board games tournament in the evening and n participants have accepted the invitation. The organizers do n... | instruction | 0 | 75,090 | 19 | 150,180 |
No | output | 1 | 75,090 | 19 | 150,181 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are b boys and g girls participating in Olympiad of Metropolises. There will be a board games tournament in the evening and n participants have accepted the invitation. The organizers do n... | instruction | 0 | 75,091 | 19 | 150,182 |
No | output | 1 | 75,091 | 19 | 150,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are b boys and g girls participating in Olympiad of Metropolises. There will be a board games tournament in the evening and n participants have accepted the invitation. The organizers do n... | instruction | 0 | 75,092 | 19 | 150,184 |
No | output | 1 | 75,092 | 19 | 150,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are b boys and g girls participating in Olympiad of Metropolises. There will be a board games tournament in the evening and n participants have accepted the invitation. The organizers do n... | instruction | 0 | 75,093 | 19 | 150,186 |
No | output | 1 | 75,093 | 19 | 150,187 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they ... | instruction | 0 | 75,303 | 19 | 150,606 |
Tags: constructive algorithms, games, math
Correct Solution:
```
data = input()
datalist = data.split()
a = int(datalist[0])
b = int(datalist[1])
r = int(datalist[2])
if a >= 2*r and b >= 2*r:
print("First")
else:
print("Second")
``` | output | 1 | 75,303 | 19 | 150,607 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they ... | instruction | 0 | 75,304 | 19 | 150,608 |
Tags: constructive algorithms, games, math
Correct Solution:
```
x=list(map(int,input().split()))
c=min(x[1],x[0])
v="Second"
if c>=x[2]*2:
v="First"
print(v)
``` | output | 1 | 75,304 | 19 | 150,609 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they ... | instruction | 0 | 75,305 | 19 | 150,610 |
Tags: constructive algorithms, games, math
Correct Solution:
```
a, b, r = map(int, input().split())
if a < 2 * r or b < 2 * r:
print("Second")
else:
print("First")
``` | output | 1 | 75,305 | 19 | 150,611 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they ... | instruction | 0 | 75,306 | 19 | 150,612 |
Tags: constructive algorithms, games, math
Correct Solution:
```
a,b,c=map(int,input().split())
if min(a,b)>=2*c:
print('First')
else:
print('Second')
``` | output | 1 | 75,306 | 19 | 150,613 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they ... | instruction | 0 | 75,307 | 19 | 150,614 |
Tags: constructive algorithms, games, math
Correct Solution:
```
s = input().split()
a = int(s[0])
b = int(s[1])
r = int(s[2])
if 2*r>min(a,b):
print("Second")
else:
print("First")
``` | output | 1 | 75,307 | 19 | 150,615 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they ... | instruction | 0 | 75,308 | 19 | 150,616 |
Tags: constructive algorithms, games, math
Correct Solution:
```
a,b,r=map(int,input().split())
if a>=r*2 and b>=2*r:
print("First")
else:
print("Second")
``` | output | 1 | 75,308 | 19 | 150,617 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they ... | instruction | 0 | 75,309 | 19 | 150,618 |
Tags: constructive algorithms, games, math
Correct Solution:
```
A, B, R = map(int, input().split())
if 2 * R > min(A, B) :
print("Second")
else :
print("First")
``` | output | 1 | 75,309 | 19 | 150,619 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so that the plates don't lie on each other (but they ... | instruction | 0 | 75,310 | 19 | 150,620 |
Tags: constructive algorithms, games, math
Correct Solution:
```
import math
a , b , r = map(int , input().split())
if r * 2 <= min(a , b):
print ('First')
else:
print ('Second')
``` | output | 1 | 75,310 | 19 | 150,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so tha... | instruction | 0 | 75,311 | 19 | 150,622 |
Yes | output | 1 | 75,311 | 19 | 150,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so tha... | instruction | 0 | 75,312 | 19 | 150,624 |
Yes | output | 1 | 75,312 | 19 | 150,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so tha... | instruction | 0 | 75,313 | 19 | 150,626 |
Yes | output | 1 | 75,313 | 19 | 150,627 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so tha... | instruction | 0 | 75,314 | 19 | 150,628 |
Yes | output | 1 | 75,314 | 19 | 150,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so tha... | instruction | 0 | 75,315 | 19 | 150,630 |
No | output | 1 | 75,315 | 19 | 150,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so tha... | instruction | 0 | 75,316 | 19 | 150,632 |
No | output | 1 | 75,316 | 19 | 150,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so tha... | instruction | 0 | 75,317 | 19 | 150,634 |
No | output | 1 | 75,317 | 19 | 150,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a rectangular table with length a and width b and the infinite number of plates of radius r. Two players play the following game: they take turns to put the plates on the table so tha... | instruction | 0 | 75,318 | 19 | 150,636 |
No | output | 1 | 75,318 | 19 | 150,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gosha is hunting. His goal is to catch as many Pokemons as possible. Gosha has a Poke Balls and b Ultra Balls. There are n Pokemons. They are numbered 1 through n. Gosha knows that if he throws ... | instruction | 0 | 75,546 | 19 | 151,092 |
No | output | 1 | 75,546 | 19 | 151,093 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gosha is hunting. His goal is to catch as many Pokemons as possible. Gosha has a Poke Balls and b Ultra Balls. There are n Pokemons. They are numbered 1 through n. Gosha knows that if he throws ... | instruction | 0 | 75,547 | 19 | 151,094 |
No | output | 1 | 75,547 | 19 | 151,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alternating turns. In the i-th turn, the player wh... | instruction | 0 | 75,595 | 19 | 151,190 |
Tags: math, number theory
Correct Solution:
```
def testPrimal(n):
siv = [0 for _ in range(n+1)]
for i in range(2, n+1):
if siv[i] == 0:
for j in range(i+i, n+1, i):
siv[j] = i
siv[i] = i - siv[i] + 1
result = n
for i in range(siv[n], n + 1):
result = ... | output | 1 | 75,595 | 19 | 151,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alternating turns. In the i-th turn, the player wh... | instruction | 0 | 75,596 | 19 | 151,192 |
Tags: math, number theory
Correct Solution:
```
x = int(input())
n = x
vis = [False for i in range(n+1)]
flag = [0 for i in range(n+1)]
for i in range(2, n+1):
if not vis[i]:
for j in range(i+i, n+1, i):
vis[j] = True
flag[j] = i
ans = x
for i in range(x - flag[x] + 1, x+1):
ans ... | output | 1 | 75,596 | 19 | 151,193 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alternating turns. In the i-th turn, the player wh... | instruction | 0 | 75,597 | 19 | 151,194 |
Tags: math, number theory
Correct Solution:
```
from sys import stdin
maxn = 1000006
prime = [0] * maxn
def getPrimes():
n = 2
while(n < maxn):
num = n*2
while(num < maxn):
prime[num] = n
num += n
num = n + 1
while( num < maxn and prime[num]!= 0 ):
... | output | 1 | 75,597 | 19 | 151,195 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alternating turns. In the i-th turn, the player wh... | instruction | 0 | 75,598 | 19 | 151,196 |
Tags: math, number theory
Correct Solution:
```
def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p + 1 for x1 in range(x2 - max(... | output | 1 | 75,598 | 19 | 151,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alternating turns. In the i-th turn, the player wh... | instruction | 0 | 75,599 | 19 | 151,198 |
Tags: math, number theory
Correct Solution:
```
x2 = int(input())
s = [-1] * (x2 + 1)
for i in range(2, x2+1):
if s[i] == -1:
for j in range(i, x2+1, i):
s[j] = i
ans = x2
for x1 in range(x2 - s[x2] + 1, x2 + 1):
x0 = x1 - s[x1] + 1
if x0 > 1:
ans = min(ans, x0)
print(ans)
``` | output | 1 | 75,599 | 19 | 151,199 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alternating turns. In the i-th turn, the player wh... | instruction | 0 | 75,600 | 19 | 151,200 |
Tags: math, number theory
Correct Solution:
```
x2 = int(input())
def maxPrimeDevisor(v):
result = 0
while v % 2 == 0:
result = 2
v //= 2
i = 3
while i * i <= v:
if v % i == 0:
while v % i == 0:
v //= i
result = max(result, i)
else... | output | 1 | 75,600 | 19 | 151,201 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alternating turns. In the i-th turn, the player wh... | instruction | 0 | 75,602 | 19 | 151,204 |
Tags: math, number theory
Correct Solution:
```
n = int(input())
ans = n
f = [0]*(n+1)
for i in range(2, n+1):
if f[i]==0:
for j in range(i*2, n+1, i):
f[j] = i
f[i] = i-f[i]+1
for i in range(f[n], n+1):
ans = min(ans, f[i])
print(ans)
# Made By Mostafa_Khaled
``` | output | 1 | 75,602 | 19 | 151,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alt... | instruction | 0 | 75,603 | 19 | 151,206 |
Yes | output | 1 | 75,603 | 19 | 151,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alt... | instruction | 0 | 75,604 | 19 | 151,208 |
Yes | output | 1 | 75,604 | 19 | 151,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alt... | instruction | 0 | 75,605 | 19 | 151,210 |
Yes | output | 1 | 75,605 | 19 | 151,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alt... | instruction | 0 | 75,606 | 19 | 151,212 |
Yes | output | 1 | 75,606 | 19 | 151,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alt... | instruction | 0 | 75,607 | 19 | 151,214 |
No | output | 1 | 75,607 | 19 | 151,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alt... | instruction | 0 | 75,608 | 19 | 151,216 |
No | output | 1 | 75,608 | 19 | 151,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alt... | instruction | 0 | 75,609 | 19 | 151,218 |
No | output | 1 | 75,609 | 19 | 151,219 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alt... | instruction | 0 | 75,610 | 19 | 151,220 |
No | output | 1 | 75,610 | 19 | 151,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Don't you tell me what you think that I can be
If you say that Arkady is a bit old-fashioned playing checkers, you won't be right. There is also a modern computer game Arkady and his friends are keen on. We won't discuss its rules, the only... | instruction | 0 | 75,892 | 19 | 151,784 |
Tags: greedy, implementation, interactive, sortings
Correct Solution:
```
# -*- coding:utf-8 -*-
"""
created by shuangquan.huang at 12/14/18
"""
import collections
import time
import os
import sys
import bisect
import heapq
N, M = map(int, input().split())
P = [0] + [int(x) for x in input().split()]
A = [0 for _ ... | output | 1 | 75,892 | 19 | 151,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Don't you tell me what you think that I can be
If you say that Arkady is a bit old-fashioned playing checkers, you won't be right. There is also a modern computer game Arkady and his friends ar... | instruction | 0 | 75,893 | 19 | 151,786 |
No | output | 1 | 75,893 | 19 | 151,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Don't you tell me what you think that I can be
If you say that Arkady is a bit old-fashioned playing checkers, you won't be right. There is also a modern computer game Arkady and his friends ar... | instruction | 0 | 75,894 | 19 | 151,788 |
No | output | 1 | 75,894 | 19 | 151,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Don't you tell me what you think that I can be
If you say that Arkady is a bit old-fashioned playing checkers, you won't be right. There is also a modern computer game Arkady and his friends ar... | instruction | 0 | 75,895 | 19 | 151,790 |
No | output | 1 | 75,895 | 19 | 151,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Don't you tell me what you think that I can be
If you say that Arkady is a bit old-fashioned playing checkers, you won't be right. There is also a modern computer game Arkady and his friends ar... | instruction | 0 | 75,896 | 19 | 151,792 |
No | output | 1 | 75,896 | 19 | 151,793 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everyone knows that agents in Valorant decide, who will play as attackers, and who will play as defenders. To do that Raze and Breach decided to play t matches of a digit game...
In each of t matches of the digit game, a positive integer is... | instruction | 0 | 76,056 | 19 | 152,112 |
Tags: games, greedy, implementation
Correct Solution:
```
# import sys
# # For getting input from input.txt file
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
t = int(input())
while t>0:
n = int(input())
number = input()
number_ls = [int(i) for i in number]
start,last = 0,n... | output | 1 | 76,056 | 19 | 152,113 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everyone knows that agents in Valorant decide, who will play as attackers, and who will play as defenders. To do that Raze and Breach decided to play t matches of a digit game...
In each of t matches of the digit game, a positive integer is... | instruction | 0 | 76,057 | 19 | 152,114 |
Tags: games, greedy, implementation
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
s=input()
if n%2==1:
a=[int(i)%2 for i in s[::2]]
if 1 in a:print(1)
else:print(2)
else:
a=[int(i)%2 for i in s[1::2]]
if 0 in a:print(2)
else:print(1)
``` | output | 1 | 76,057 | 19 | 152,115 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everyone knows that agents in Valorant decide, who will play as attackers, and who will play as defenders. To do that Raze and Breach decided to play t matches of a digit game...
In each of t matches of the digit game, a positive integer is... | instruction | 0 | 76,058 | 19 | 152,116 |
Tags: games, greedy, implementation
Correct Solution:
```
#*******************************************
#* CODER : ANIRBAN DEY *
#* NICK : nonstop-baban(since 2001) *
#* INSTITUTION : IIEST, SHIBPUR(2019-2023) *
#*******************************************
import os
import sys
import math
from... | output | 1 | 76,058 | 19 | 152,117 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everyone knows that agents in Valorant decide, who will play as attackers, and who will play as defenders. To do that Raze and Breach decided to play t matches of a digit game...
In each of t matches of the digit game, a positive integer is... | instruction | 0 | 76,059 | 19 | 152,118 |
Tags: games, greedy, implementation
Correct Solution:
```
for _ in [0]*int(input()):
n=int(input())
s=input()
if n%2:
for c in s[::2]:
if c in '13579':
print(1)
break
else:
print(2)
else:
for c in s[1::2]:
if c i... | output | 1 | 76,059 | 19 | 152,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everyone knows that agents in Valorant decide, who will play as attackers, and who will play as defenders. To do that Raze and Breach decided to play t matches of a digit game...
In each of t matches of the digit game, a positive integer is... | instruction | 0 | 76,060 | 19 | 152,120 |
Tags: games, greedy, implementation
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
ara = str(input())
if n == 1:
if int(ara[0]) % 2 == 0:
print(2)
else:
print(1)
elif n % 2 == 0:
l = 0
for i in range(1,n,2):
... | output | 1 | 76,060 | 19 | 152,121 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everyone knows that agents in Valorant decide, who will play as attackers, and who will play as defenders. To do that Raze and Breach decided to play t matches of a digit game...
In each of t matches of the digit game, a positive integer is... | instruction | 0 | 76,061 | 19 | 152,122 |
Tags: games, greedy, implementation
Correct Solution:
```
try:
t=int(input())
for i in range(t):
n=int(input())
s=input()
l=list(s)
l=[int(x) for x in l]
flag,flag2=0,0
for i in range(0,n,2):
if(l[i]%2!=0):
flag=1
break
... | output | 1 | 76,061 | 19 | 152,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everyone knows that agents in Valorant decide, who will play as attackers, and who will play as defenders. To do that Raze and Breach decided to play t matches of a digit game...
In each of t matches of the digit game, a positive integer is... | instruction | 0 | 76,062 | 19 | 152,124 |
Tags: games, greedy, implementation
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
s=input()
d={
"opos_e":0,
"opos_o": 0,
"epos_e": 0,
"epos_o": 0,
}
for i in range(n):
tmp=int(s[i])
if (i+1)%2==1:
if tmp%2==0:
... | output | 1 | 76,062 | 19 | 152,125 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.