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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became... | instruction | 0 | 6,994 | 17 | 13,988 |
Tags: *special
Correct Solution:
```
__author__ = 'Pavel Mavrin'
a = input().strip()
b = input().strip()
n = len(a) // 2
x = 0
figs = ["[]", "()", "8<"]
for i in range(n):
s1 = figs.index(a[i * 2: (i + 1) * 2])
s2 = figs.index(b[i * 2: (i + 1) * 2])
if s2 == (s1 + 1) % 3:
x += 1
if s1 == (s... | output | 1 | 6,994 | 17 | 13,989 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became... | instruction | 0 | 6,995 | 17 | 13,990 |
Tags: *special
Correct Solution:
```
s1 = input()
s2 = input()
num1 = 0
num2 = 0
for i in range(0, len(s1), 2):
c1 = s1[i:i + 2]
c2 = s2[i:i + 2]
if c1 != c2:
if (c1 == "8<" and c2 == "[]"):
num1 += 1
elif (c1 == "()" and c2 == "8<"):
num1 += 1
elif (c1 == "[]... | output | 1 | 6,995 | 17 | 13,991 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became... | instruction | 0 | 6,996 | 17 | 13,992 |
Tags: *special
Correct Solution:
```
def split_by_n( seq, n ):
while seq:
yield seq[:n]
seq = seq[n:]
def is_first_win(first, second):
if first ==second:
return 0
if first == '8<':
if second == '[]':
return 1
else:
return -1
if first == '[... | output | 1 | 6,996 | 17 | 13,993 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became... | instruction | 0 | 6,997 | 17 | 13,994 |
Tags: *special
Correct Solution:
```
a = input()
a_actions = [(a[i:i+2]) for i in range(0, len(a), 2)]
b = input()
b_actions = [(b[i:i+2]) for i in range(0, len(b), 2)]
# print(a_actions, b_actions)
rock = "()"
paper = "[]"
scissors = "8<"
a_pts = 0
b_pts = 0
for i in range(len(a)//2):
if a_actions[i] == rock... | output | 1 | 6,997 | 17 | 13,995 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became... | instruction | 0 | 6,998 | 17 | 13,996 |
Tags: *special
Correct Solution:
```
#!/bin/bash/python
# Date: 2014-04-16
# Author: shijinzhan
# Status:
# Note: '()' < '[]'
# '[]' < '8<'
# '8<' < '()'
team1 = input().replace('(', '6').replace('[', '7')
team2 = input().replace('(', '6').replace('[', '7')
s = 0
for x in range(0, len(team1), 2):
if team1[x] > ... | output | 1 | 6,998 | 17 | 13,997 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became... | instruction | 0 | 6,999 | 17 | 13,998 |
Tags: *special
Correct Solution:
```
s = input()
t = input()
a = 0
b = 0
for i in range(0, len(s), 2):
if s[i:i+2] == "[]" and t[i:i+2]=="()":
a += 1
if s[i:i+2] == "()" and t[i:i+2]=="8<":
a += 1
if s[i:i+2] == "8<" and t[i:i+2]=="[]":
a += 1
if t[i:i+2] == "[]" and s[i:i+2]=="... | output | 1 | 6,999 | 17 | 13,999 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' actions in the final battle. Figure out who became... | instruction | 0 | 7,000 | 17 | 14,000 |
Tags: *special
Correct Solution:
```
cnt=0
t1=input()
t2=input()
for i in range(0,len(t1),2):
p1=t1[i:i+2]
p2=t2[i:i+2]
if(p1=="8<"):
if(p2=="[]"):
cnt+=1
elif(p2=="()"):
cnt-=1
elif(p1=="[]"):
if(p2=="()"):
cnt+=1
elif(p2=="8<"):
... | output | 1 | 7,000 | 17 | 14,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' act... | instruction | 0 | 7,001 | 17 | 14,002 |
Yes | output | 1 | 7,001 | 17 | 14,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' act... | instruction | 0 | 7,002 | 17 | 14,004 |
Yes | output | 1 | 7,002 | 17 | 14,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' act... | instruction | 0 | 7,003 | 17 | 14,006 |
Yes | output | 1 | 7,003 | 17 | 14,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' act... | instruction | 0 | 7,004 | 17 | 14,008 |
Yes | output | 1 | 7,004 | 17 | 14,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' act... | instruction | 0 | 7,005 | 17 | 14,010 |
No | output | 1 | 7,005 | 17 | 14,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' act... | instruction | 0 | 7,006 | 17 | 14,012 |
No | output | 1 | 7,006 | 17 | 14,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' act... | instruction | 0 | 7,007 | 17 | 14,014 |
No | output | 1 | 7,007 | 17 | 14,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two teams meet in The Game World Championship. Some scientists consider this game to be the most intellectually challenging game in the world. You are given two strings describing the teams' act... | instruction | 0 | 7,008 | 17 | 14,016 |
No | output | 1 | 7,008 | 17 | 14,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment, as Valery has found another ruler, its length ... | instruction | 0 | 7,041 | 17 | 14,082 |
Tags: binary search, greedy, implementation
Correct Solution:
```
def main():
from bisect import bisect_left
n, l, x, y = map(int, input().split())
aa, d = list(map(int, input().split())), {}
for z in (x, y, y + x):
for a in aa:
a += z
if a > l:
break
... | output | 1 | 7,041 | 17 | 14,083 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment, as Valery has found another ruler, its length ... | instruction | 0 | 7,042 | 17 | 14,084 |
Tags: binary search, greedy, implementation
Correct Solution:
```
import itertools
import math
def can_measure(a, d):
return any(i + d in a for i in a)
def main():
n, l, x, y = map(int, input().split())
a = set(map(int, input().split()))
can_x = can_measure(a, x)
can_y = can_measure(a, y)
if can_x and can_y:... | output | 1 | 7,042 | 17 | 14,085 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment, as Valery has found another ruler, its length ... | instruction | 0 | 7,043 | 17 | 14,086 |
Tags: binary search, greedy, implementation
Correct Solution:
```
def main():
import sys
tokens = [int(i) for i in sys.stdin.read().split()]
tokens.reverse()
n, l, x, y = [tokens.pop() for i in range(4)]
marks = set(tokens)
flag_x = flag_y = False
index = -1
for i in marks... | output | 1 | 7,043 | 17 | 14,087 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment, as Valery has found another ruler, its length ... | instruction | 0 | 7,044 | 17 | 14,088 |
Tags: binary search, greedy, implementation
Correct Solution:
```
class CodeforcesTask480BSolution:
def __init__(self):
self.result = ''
self.n_l_x_y = []
self.ruler = []
def read_input(self):
self.n_l_x_y = [int(x) for x in input().split(" ")]
self.ruler = [int(x) for x... | output | 1 | 7,044 | 17 | 14,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment, as Valery has found another ruler, its length ... | instruction | 0 | 7,045 | 17 | 14,090 |
Tags: binary search, greedy, implementation
Correct Solution:
```
n, l, x, y = map(int, input().split())
s = set(map(int, input().split()))
def f(d): return any(i + d in s for i in s)
def g():
for i in s:
if i + x + y in s: return i + x
return 0
def h():
for i in s:
if i + y - x in s:
... | output | 1 | 7,045 | 17 | 14,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment, as Valery has found another ruler, its length ... | instruction | 0 | 7,046 | 17 | 14,092 |
Tags: binary search, greedy, implementation
Correct Solution:
```
from collections import defaultdict
class LongJumps():
def __init__(self, n, l, x, y, a):
self.n, self.l, self.x, self.y, self.a = n,l,x,y,a
def get_markers(self):
st = defaultdict(set)
req_pts = [self.x,self.y]
... | output | 1 | 7,046 | 17 | 14,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment, as Valery has found another ruler, its length ... | instruction | 0 | 7,047 | 17 | 14,094 |
Tags: binary search, greedy, implementation
Correct Solution:
```
n, l, x, y = map(int, input().split())
def f(t, q):
i = j = 0
while j < n:
d = t[j] - t[i]
if d < q: j += 1
elif d > q: i += 1
else: return 0
return q
def g(t):
q = x + y
i = j = 0
while j < n:
... | output | 1 | 7,047 | 17 | 14,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment, as Valery has found another ruler, its length ... | instruction | 0 | 7,048 | 17 | 14,096 |
Tags: binary search, greedy, implementation
Correct Solution:
```
import itertools
import math
def can_measure(a, d):
return any(i + d in a for i in a)
def main():
n, l, x, y = map(int, input().split())
a = set(map(int, input().split()))
can_x = can_measure(a, x)
can_y = can_measure(a, y)
if can_x and can_y:
... | output | 1 | 7,048 | 17 | 14,097 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment,... | instruction | 0 | 7,049 | 17 | 14,098 |
Yes | output | 1 | 7,049 | 17 | 14,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment,... | instruction | 0 | 7,050 | 17 | 14,100 |
Yes | output | 1 | 7,050 | 17 | 14,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment,... | instruction | 0 | 7,051 | 17 | 14,102 |
Yes | output | 1 | 7,051 | 17 | 14,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment,... | instruction | 0 | 7,052 | 17 | 14,104 |
Yes | output | 1 | 7,052 | 17 | 14,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment,... | instruction | 0 | 7,053 | 17 | 14,106 |
Yes | output | 1 | 7,053 | 17 | 14,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment,... | instruction | 0 | 7,054 | 17 | 14,108 |
No | output | 1 | 7,054 | 17 | 14,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment,... | instruction | 0 | 7,055 | 17 | 14,110 |
No | output | 1 | 7,055 | 17 | 14,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment,... | instruction | 0 | 7,056 | 17 | 14,112 |
No | output | 1 | 7,056 | 17 | 14,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler!
However, there is no reason for disappointment,... | instruction | 0 | 7,057 | 17 | 14,114 |
No | output | 1 | 7,057 | 17 | 14,115 |
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 | 7,224 | 17 | 14,448 |
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 | 7,224 | 17 | 14,449 |
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 | 7,225 | 17 | 14,450 |
Tags: data structures, implementation
Correct Solution:
```
def process(A, m, k):
n = len(A)
start = n*m
d = []
for i in range(n):
if len(d)==0 or d[-1][0] != A[i]:
d.append([A[i], 1])
else:
d[-1][1]+=1
if d[-1][1]==k:
start-=k*m
d.... | output | 1 | 7,225 | 17 | 14,451 |
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 | 7,226 | 17 | 14,452 |
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 | 7,226 | 17 | 14,453 |
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 | 7,227 | 17 | 14,454 |
Tags: data structures, implementation
Correct Solution:
```
#reference sol:-31772413
r=lambda:map(int,input().split())
n,k,m=r()
a=list(r())
stck=[]
for i in range(n):
if len(stck)==0 or stck[-1][0]!=a[i]:
stck.append([a[i],1])
else:
stck[-1][1]+=1
if stck[-1][1]==k:
stck.pop()
rem=0
strt,end=0,len(stck)-1
if... | output | 1 | 7,227 | 17 | 14,455 |
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 | 7,228 | 17 | 14,456 |
No | output | 1 | 7,228 | 17 | 14,457 |
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 | 7,229 | 17 | 14,458 |
No | output | 1 | 7,229 | 17 | 14,459 |
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 | 7,230 | 17 | 14,460 |
No | output | 1 | 7,230 | 17 | 14,461 |
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 | 7,231 | 17 | 14,462 |
No | output | 1 | 7,231 | 17 | 14,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n football teams in the world.
The Main Football Organization (MFO) wants to host at most m games. MFO wants the i-th game to be played between the teams a_i and b_i in one of the k stadiums.
Let s_{ij} be the numbers of games ... | instruction | 0 | 7,666 | 17 | 15,332 |
Tags: graphs
Correct Solution:
```
import random
import math
def set_color(game, color):
color_count[game[0]][game[2]] -= 1
color_count[game[1]][game[2]] -= 1
game[2] = color
color_count[game[0]][game[2]] += 1
color_count[game[1]][game[2]] += 1
def fix(node):
minimum = math.inf
maximum = 0... | output | 1 | 7,666 | 17 | 15,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n football teams in the world.
The Main Football Organization (MFO) wants to host at most m games. MFO wants the i-th game to be played between the teams a_i and b_i in one of the k ... | instruction | 0 | 7,667 | 17 | 15,334 |
No | output | 1 | 7,667 | 17 | 15,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n football teams in the world.
The Main Football Organization (MFO) wants to host at most m games. MFO wants the i-th game to be played between the teams a_i and b_i in one of the k ... | instruction | 0 | 7,668 | 17 | 15,336 |
No | output | 1 | 7,668 | 17 | 15,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n football teams in the world.
The Main Football Organization (MFO) wants to host at most m games. MFO wants the i-th game to be played between the teams a_i and b_i in one of the k ... | instruction | 0 | 7,669 | 17 | 15,338 |
No | output | 1 | 7,669 | 17 | 15,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n football teams in the world.
The Main Football Organization (MFO) wants to host at most m games. MFO wants the i-th game to be played between the teams a_i and b_i in one of the k ... | instruction | 0 | 7,670 | 17 | 15,340 |
No | output | 1 | 7,670 | 17 | 15,341 |
Provide a correct Python 3 solution for this coding contest problem.
B: Dansunau www --Dance Now!-
story
Last lab life! Daigakuin! !! Dosanko Snow has won 9th place in the event "Master Idol World", which can be said to be the outpost of the biggest competition "Lab Life" where master idols compete. The sharp dance ... | instruction | 0 | 8,357 | 17 | 16,714 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
n = int(input())
R = list(map(int,input().split()))
SPC = []
S = []
P = []
C = []
ans = 10**5
for i in range(n):
s,p,c = map(int,input().split())
S.append(s)
P.append(p)
C.append(c)
SPC.append([s,p,c])
you = ... | output | 1 | 8,357 | 17 | 16,715 |
Provide a correct Python 3 solution for this coding contest problem.
In Group C of the 3rd year, we decided to use the "class flag" used at the sports festival on November 10, 2007 at future class reunions. So, in order to decide which students to keep the "class flag", I decided to play the following game using a lar... | instruction | 0 | 8,971 | 17 | 17,942 |
"Correct Solution:
```
while 1:
try:
n = int(input())
except:
break
if n % 39 == 0:
ans = 39
else:
ans = n % 39
print("3C" + str(ans).zfill(2))
``` | output | 1 | 8,971 | 17 | 17,943 |
Provide a correct Python 3 solution for this coding contest problem.
In Group C of the 3rd year, we decided to use the "class flag" used at the sports festival on November 10, 2007 at future class reunions. So, in order to decide which students to keep the "class flag", I decided to play the following game using a lar... | instruction | 0 | 8,972 | 17 | 17,944 |
"Correct Solution:
```
try:
while True:
ame = int(input())
num1 = ame % 39
if num1 == 0:
num1 = 39
if num1 < 10:
print("3C0" + str(num1))
else:
print("3C" + str(num1))
except EOFError as e:
num = 0
``` | output | 1 | 8,972 | 17 | 17,945 |
Provide a correct Python 3 solution for this coding contest problem.
In Group C of the 3rd year, we decided to use the "class flag" used at the sports festival on November 10, 2007 at future class reunions. So, in order to decide which students to keep the "class flag", I decided to play the following game using a lar... | instruction | 0 | 8,973 | 17 | 17,946 |
"Correct Solution:
```
while True:
try:
a = int(input())
except:break
if a%39 == 0:
print("3C39")
else:
b = a // 39
c = a - 39 * b
if c < 10:
print("3C0",c,sep='')
else:
print("3C",c,sep='')
``` | output | 1 | 8,973 | 17 | 17,947 |
Provide a correct Python 3 solution for this coding contest problem.
In Group C of the 3rd year, we decided to use the "class flag" used at the sports festival on November 10, 2007 at future class reunions. So, in order to decide which students to keep the "class flag", I decided to play the following game using a lar... | instruction | 0 | 8,974 | 17 | 17,948 |
"Correct Solution:
```
while True:
try:
a = int(input())
except:
break
a = str(a%39)
if a == "0":
a = "39"
elif len(a) == 1:
a = "0"+a
print("3C"+a)
``` | output | 1 | 8,974 | 17 | 17,949 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.