message stringlengths 2 39.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 450 109k | cluster float64 2 2 | __index_level_0__ int64 900 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n wizards. They are numbered from 1 to n, and the i-th wizard has the magical power ri (1 ≤ i ≤ n). Now they are confronting a powerful wizard, whose enemy's magical power is S. n Wiza... | instruction | 0 | 36,801 | 2 | 73,602 |
No | output | 1 | 36,801 | 2 | 73,603 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n wizards. They are numbered from 1 to n, and the i-th wizard has the magical power ri (1 ≤ i ≤ n). Now they are confronting a powerful wizard, whose enemy's magical power is S. n Wiza... | instruction | 0 | 36,802 | 2 | 73,604 |
No | output | 1 | 36,802 | 2 | 73,605 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n wizards. They are numbered from 1 to n, and the i-th wizard has the magical power ri (1 ≤ i ≤ n). Now they are confronting a powerful wizard, whose enemy's magical power is S. n Wiza... | instruction | 0 | 36,803 | 2 | 73,606 |
No | output | 1 | 36,803 | 2 | 73,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n wizards. They are numbered from 1 to n, and the i-th wizard has the magical power ri (1 ≤ i ≤ n). Now they are confronting a powerful wizard, whose enemy's magical power is S. n Wiza... | instruction | 0 | 36,804 | 2 | 73,608 |
No | output | 1 | 36,804 | 2 | 73,609 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over again.
Each round has the same scenario. It is de... | instruction | 0 | 36,911 | 2 | 73,822 |
Tags: math
Correct Solution:
```
H, n = map(int, input().split())
d = list(map(int, input().split()))
diff, max_damage = 0, 0
for di in d:
diff += di
max_damage = max(max_damage, -diff)
if max_damage>=H:
for i in range(n):
H += d[i]
if H<=0:
print(i+1)
exit... | output | 1 | 36,911 | 2 | 73,823 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over again.
Each round has the same scenario. It is de... | instruction | 0 | 36,912 | 2 | 73,824 |
Tags: math
Correct Solution:
```
H, n = map(int, input().split())
ds = [int(x) for x in input().split()]
h = H
mn = 0
for i, d in enumerate(ds):
h += d
mn = min(mn, h - H)
if h <= 0:
print(i + 1)
break
else:
sd = sum(ds)
if sd >= 0:
print(-1)
else:
sd = -sd
... | output | 1 | 36,912 | 2 | 73,825 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over again.
Each round has the same scenario. It is de... | instruction | 0 | 36,913 | 2 | 73,826 |
Tags: math
Correct Solution:
```
import math
arr = input()
H, M = [int(x) for x in arr.split(' ')]
arr = input()
arr = [int(x) for x in arr.split(' ')]
p_sum = [0]*M
s = 0
for i in range(M):
s += arr[i]
p_sum[i] = s
if abs(s)>=H and s<=0:
print(i+1)
quit()
#print(p_sum)
# A = roun... | output | 1 | 36,913 | 2 | 73,827 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over again.
Each round has the same scenario. It is de... | instruction | 0 | 36,914 | 2 | 73,828 |
Tags: math
Correct Solution:
```
from math import ceil
h, n = map(int, input().split())
a, s, mi, ans = list(map(int, input().split())), 0, [float('inf'), 0], 0
for i in range(n):
s += a[i]
if s < mi[0]:
mi = [s, i]
if -s >= h:
exit(print(i + 1))
if mi[0] > -1 or sum(a) > -1:
exit(prin... | output | 1 | 36,914 | 2 | 73,829 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over again.
Each round has the same scenario. It is de... | instruction | 0 | 36,915 | 2 | 73,830 |
Tags: math
Correct Solution:
```
import math
H, n = [int(i) for i in input().split(' ')]
d = [int(i) for i in input().split(' ')]
H_cur = H
dead = False
d_acc = [0]
for i in range(n):
d_acc.append(d_acc[-1]+d[i])
H_cur += d[i]
if H_cur <= 0:
print(i+1)
dead = True
break
if not dead:
... | output | 1 | 36,915 | 2 | 73,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over again.
Each round has the same scenario. It is de... | instruction | 0 | 36,916 | 2 | 73,832 |
Tags: math
Correct Solution:
```
health, minutes = list(map(int,input().split()))
change = list(map(int,input().split()))
max = int(1e15)
mini = max
sum = 0
ans = 0
current = health
for f in change:
sum += f
mini = min(mini, sum)
if mini >= 0:
print(-1)
exit(0)
rem = health
if health > abs(mini):
if... | output | 1 | 36,916 | 2 | 73,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over again.
Each round has the same scenario. It is de... | instruction | 0 | 36,917 | 2 | 73,834 |
Tags: math
Correct Solution:
```
'''input
1 2
-1 1
'''
from sys import stdin
import math
def find_min_s(arr):
min_s = 0
cur_sum = 0
for i in arr:
cur_sum += i
min_s = min(min_s, cur_sum)
return min_s
# main starts
H, n = list(map(int, stdin.readline().split()))
arr = list(map(int, stdin.readline().split()))
... | output | 1 | 36,917 | 2 | 73,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over again.
Each round has the same scenario. It is de... | instruction | 0 | 36,918 | 2 | 73,836 |
Tags: math
Correct Solution:
```
def main():
ans=0
h,n=map(int,input().split())
d=[0]
d+=list(map(int,input().split()))
inf=0x3f3f3f3f3f3f3f3f
maxx=inf
for i in range(1,n+1):
d[i]+=d[i-1]
maxx=min(d[i],maxx)
if h+maxx>0 and d[n]>=0:
print(-1)
return 0
... | output | 1 | 36,918 | 2 | 73,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over aga... | instruction | 0 | 36,919 | 2 | 73,838 |
Yes | output | 1 | 36,919 | 2 | 73,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over aga... | instruction | 0 | 36,920 | 2 | 73,840 |
Yes | output | 1 | 36,920 | 2 | 73,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over aga... | instruction | 0 | 36,921 | 2 | 73,842 |
Yes | output | 1 | 36,921 | 2 | 73,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over aga... | instruction | 0 | 36,922 | 2 | 73,844 |
Yes | output | 1 | 36,922 | 2 | 73,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over aga... | instruction | 0 | 36,923 | 2 | 73,846 |
No | output | 1 | 36,923 | 2 | 73,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over aga... | instruction | 0 | 36,924 | 2 | 73,848 |
No | output | 1 | 36,924 | 2 | 73,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over aga... | instruction | 0 | 36,925 | 2 | 73,850 |
No | output | 1 | 36,925 | 2 | 73,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts immediately. This is repeated over and over aga... | instruction | 0 | 36,926 | 2 | 73,852 |
No | output | 1 | 36,926 | 2 | 73,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, not all of those mighty heroes were created as ... | instruction | 0 | 37,909 | 2 | 75,818 |
Tags: brute force, dp, implementation
Correct Solution:
```
from sys import stdin
input = stdin.readline
def solve():
n = int(input())
a = list(map(int, input().split()))
# (n + number with -1 sign)%3 == 1
# dp[i][j][k][l]: choose from a[:i], j = (n + num with -1 sign) mod 3,
# k = whether two co... | output | 1 | 37,909 | 2 | 75,819 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, not all of those mighty heroes were created as ... | instruction | 0 | 37,910 | 2 | 75,820 |
Tags: brute force, dp, implementation
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
INF = 10 ** 20
DP = [-INF] * 12
DP[1] = a[0]
DP[5] = -a[0]
for elem in a[1:]:
newDP = []
newDP.append(DP[5] + elem)
newDP.append(DP[3] + elem)
newDP.append(DP[4] + elem)
newDP.append(DP[1]... | output | 1 | 37,910 | 2 | 75,821 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, not all of those mighty heroes were created as ... | instruction | 0 | 37,911 | 2 | 75,822 |
Tags: brute force, dp, implementation
Correct Solution:
```
N = int(input())
a, b, c, d, e = float("-inf"), float("-inf"), float("-inf"), 0, 1
for x in map(int, input().split()):
a, b, c, d, e = max(c + x, b - x), max(a + x, c - x), \
max(b + x, a - x, d - e * x), d + e * x, -e
print([d, b][N > ... | output | 1 | 37,911 | 2 | 75,823 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, not all of those mighty heroes were created as ... | instruction | 0 | 37,912 | 2 | 75,824 |
Tags: brute force, dp, implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
if n == 1:
print(a[0])
exit()
inf = float('inf')
dp = [[[-inf, -inf, -inf] for _ in range(2)] for _ in range(n + 1)]
dp[0][0][0] = 0
for i in range(n):
for j in range(2):
for k in range(3... | output | 1 | 37,912 | 2 | 75,825 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, not all of those mighty heroes were created as ... | instruction | 0 | 37,913 | 2 | 75,826 |
Tags: brute force, dp, implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
if n == 1:
print(a[0])
exit()
inf = 1002003004005006007
dp = [[[-inf, -inf, -inf] for _ in range(2)] for _ in range(n + 1)]
dp[0][0][0] = 0
for i in range(n):
for j in range(2):
for k in ... | output | 1 | 37,913 | 2 | 75,827 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, not all of those mighty heroes were created as ... | instruction | 0 | 37,914 | 2 | 75,828 |
Tags: brute force, dp, implementation
Correct Solution:
```
n = int(input())
a = [int(i) for i in input().split()]
if n == 1:
print(a[0])
else:
dp = [dict(), dict()]
dp[0][(0, 0, 0)] = a[0]
dp[0][(1, 0, 1)] = -a[0]
for i in range(1, n):
_i = i & 1
dp[_i].clear()
for j in range(3):
... | output | 1 | 37,914 | 2 | 75,829 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, not all of those mighty heroes were created as ... | instruction | 0 | 37,915 | 2 | 75,830 |
Tags: brute force, dp, implementation
Correct Solution:
```
from heapq import nsmallest
from math import inf as _inf
import sys as _sys
def main():
n, = _read_ints()
a = tuple(_read_ints())
result = find_max_power_can_make(a)
print(result)
def _read_line():
result = _sys.stdin.readline()
ass... | output | 1 | 37,915 | 2 | 75,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, not all of those mighty heroes were created as ... | instruction | 0 | 37,916 | 2 | 75,832 |
Tags: brute force, dp, implementation
Correct Solution:
```
N,x,y,z,v,w=input(),-9e9,-9e9,-9e9,0,1
for A in map(int,input().split()):x,y,z,v,w=max(z+A,y-A),max(x+A,z-A),max(y+A,x-A,v-w*A),v+w*A,-w
print([v,y][N>'1'])
``` | output | 1 | 37,916 | 2 | 75,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, ... | instruction | 0 | 37,917 | 2 | 75,834 |
Yes | output | 1 | 37,917 | 2 | 75,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, ... | instruction | 0 | 37,918 | 2 | 75,836 |
Yes | output | 1 | 37,918 | 2 | 75,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, ... | instruction | 0 | 37,919 | 2 | 75,838 |
No | output | 1 | 37,919 | 2 | 75,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, ... | instruction | 0 | 37,920 | 2 | 75,840 |
No | output | 1 | 37,920 | 2 | 75,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, ... | instruction | 0 | 37,921 | 2 | 75,842 |
No | output | 1 | 37,921 | 2 | 75,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While playing yet another strategy game, Mans has recruited n [Swedish heroes](https://www.youtube.com/watch?v=5sGOwFVUU0I), whose powers which can be represented as an array a.
Unfortunately, ... | instruction | 0 | 37,922 | 2 | 75,844 |
No | output | 1 | 37,922 | 2 | 75,845 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once upon a time in the Kingdom of Far Far Away lived Sir Lancelot, the chief Royal General. He was very proud of his men and he liked to invite the King to come and watch drill exercises which demonstrated the fighting techniques and tactic... | instruction | 0 | 37,923 | 2 | 75,846 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
n, m = map(int, input().split())
if n > m:
n, m = m, n
if n > 2 and m > 2:
print(((n * m) + 1) // 2)
elif n == 1:
print(m)
else:
print(2 * (((m // 4) * 2) + min(m % 4, 2)))
# Made By Mostafa_Khaled
``` | output | 1 | 37,923 | 2 | 75,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once upon a time in the Kingdom of Far Far Away lived Sir Lancelot, the chief Royal General. He was very proud of his men and he liked to invite the King to come and watch drill exercises which demonstrated the fighting techniques and tactic... | instruction | 0 | 37,924 | 2 | 75,848 |
Tags: constructive algorithms, greedy, implementation
Correct Solution:
```
n,m=map(int,input().split())
if n>m:n,m=m,n
if n==1:print(m)
elif n==2:print((m//4)*4+min((m%4)*2,4))
else:print((n*m)-(n*m)//2)
``` | output | 1 | 37,924 | 2 | 75,849 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the official contest this problem has a different statement, for which jury's solution was working incorrectly, and for this reason it was excluded from the contest. This mistake have been fixed and the current given problem statement and... | instruction | 0 | 38,106 | 2 | 76,212 |
Tags: games
Correct Solution:
```
n = int(input())
x = sorted(list(map(int, input().split())))
print(min([x[i + n // 2] - x[i] for i in range(n // 2)]))
``` | output | 1 | 38,106 | 2 | 76,213 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the official contest this problem has a different statement, for which jury's solution was working incorrectly, and for this reason it was excluded from the contest. This mistake have been fixed and the current given problem statement and... | instruction | 0 | 38,107 | 2 | 76,214 |
Tags: games
Correct Solution:
```
from itertools import accumulate
m = int(input())//2
X = [int(x) for x in input().split()]
X.sort()
Z = [X[i+m] - X[i] for i in range(m)]
print(min(Z))
``` | output | 1 | 38,107 | 2 | 76,215 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the official contest this problem has a different statement, for which jury's solution was working incorrectly, and for this reason it was excluded from the contest. This mistake have been fixed and the current given problem statement and... | instruction | 0 | 38,108 | 2 | 76,216 |
Tags: games
Correct Solution:
```
n = int(input())
x = sorted(list(map(int, input().split())))
print(min([x[i + n // 2] - x[i] for i in range(n // 2)]))
# Made By Mostafa_Khaled
``` | output | 1 | 38,108 | 2 | 76,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the official contest this problem has a different statement, for which jury's solution was working incorrectly, and for this reason it was excluded from the contest. This mistake have been fixed and the current given problem statement and... | instruction | 0 | 38,109 | 2 | 76,218 |
Tags: games
Correct Solution:
```
def main():
n = int(input())
l = sorted(map(int, input().split()))
print(min(b - a for a, b in zip(l, l[n // 2:])))
if __name__ == '__main__':
main()
``` | output | 1 | 38,109 | 2 | 76,219 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the official contest this problem has a different statement, for which jury's solution was working incorrectly, and for this reason it was excluded from the contest. This mistake have been fi... | instruction | 0 | 38,110 | 2 | 76,220 |
No | output | 1 | 38,110 | 2 | 76,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a probationary period in the game development company of IT City Petya was included in a group of the programmers that develops a new turn-based strategy game resembling the well known "Heroes of Might & Magic". A part of the game is t... | instruction | 0 | 39,119 | 2 | 78,238 |
Tags: math
Correct Solution:
```
#!/usr/bin/python3
n = int(input())
print(1 + 6 * (n * (n + 1) // 2))
``` | output | 1 | 39,119 | 2 | 78,239 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a probationary period in the game development company of IT City Petya was included in a group of the programmers that develops a new turn-based strategy game resembling the well known "Heroes of Might & Magic". A part of the game is t... | instruction | 0 | 39,120 | 2 | 78,240 |
Tags: math
Correct Solution:
```
j=int(input())
print (1+(j+1)*j*3)
``` | output | 1 | 39,120 | 2 | 78,241 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a probationary period in the game development company of IT City Petya was included in a group of the programmers that develops a new turn-based strategy game resembling the well known "Heroes of Might & Magic". A part of the game is t... | instruction | 0 | 39,121 | 2 | 78,242 |
Tags: math
Correct Solution:
```
def main():
n = int(input())
print(n * (n + 1) * 3 + 1)
if __name__ == '__main__':
main()
``` | output | 1 | 39,121 | 2 | 78,243 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a probationary period in the game development company of IT City Petya was included in a group of the programmers that develops a new turn-based strategy game resembling the well known "Heroes of Might & Magic". A part of the game is t... | instruction | 0 | 39,122 | 2 | 78,244 |
Tags: math
Correct Solution:
```
n=int(input())
print(int((3*(n+1)*n)+1))
``` | output | 1 | 39,122 | 2 | 78,245 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a probationary period in the game development company of IT City Petya was included in a group of the programmers that develops a new turn-based strategy game resembling the well known "Heroes of Might & Magic". A part of the game is t... | instruction | 0 | 39,123 | 2 | 78,246 |
Tags: math
Correct Solution:
```
a=int(input())
print(1+a*(a+1)*3)
``` | output | 1 | 39,123 | 2 | 78,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a probationary period in the game development company of IT City Petya was included in a group of the programmers that develops a new turn-based strategy game resembling the well known "Heroes of Might & Magic". A part of the game is t... | instruction | 0 | 39,124 | 2 | 78,248 |
Tags: math
Correct Solution:
```
n=int(input())
if n==0:
print(1)
elif n==1:
print(7)
else:
print(((6*(n+1))//2)*n+1)
``` | output | 1 | 39,124 | 2 | 78,249 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a probationary period in the game development company of IT City Petya was included in a group of the programmers that develops a new turn-based strategy game resembling the well known "Heroes of Might & Magic". A part of the game is t... | instruction | 0 | 39,125 | 2 | 78,250 |
Tags: math
Correct Solution:
```
n = int(input())
ans = 1 + 3 * n * (n + 1)
print(ans)
``` | output | 1 | 39,125 | 2 | 78,251 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a probationary period in the game development company of IT City Petya was included in a group of the programmers that develops a new turn-based strategy game resembling the well known "Heroes of Might & Magic". A part of the game is t... | instruction | 0 | 39,126 | 2 | 78,252 |
Tags: math
Correct Solution:
```
n = int(input())
x = (n+1)*n*3 + 1
print(x)
``` | output | 1 | 39,126 | 2 | 78,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After a probationary period in the game development company of IT City Petya was included in a group of the programmers that develops a new turn-based strategy game resembling the well known "He... | instruction | 0 | 39,127 | 2 | 78,254 |
Yes | output | 1 | 39,127 | 2 | 78,255 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.