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.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner takes 1 virtual bourle from the loser.
Last eveni... | instruction | 0 | 19,938 | 19 | 39,876 |
Tags: dp, graphs
Correct Solution:
```
def ma():
s=input()
v=s.split(' ')
n=int(v[0])
k=int(v[1])
s=input()
dp=[[0,0] for _ in range(n+1)]
flag=True
mp={}
mp['W']=1
mp['D']=0
mp['L']=-1
for i in range (1,n):
c=s[i-1]
if c=='?':
dp[i][0]=min(dp[... | output | 1 | 19,938 | 19 | 39,877 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner takes 1 virtual bourle from the loser.
Last eveni... | instruction | 0 | 19,939 | 19 | 39,878 |
Tags: dp, graphs
Correct Solution:
```
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO,IOBase
def main():
n,k = map(int,input().split())
s = input().strip()
dp = [[0]*(2*k+5) for _ in range(n+1)]
# diff ; win/draw/lose
dp[0][0] = 1
prev = [[-1]*(... | output | 1 | 19,939 | 19 | 39,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner takes 1 virtual bourle from the loser.
Last eveni... | instruction | 0 | 19,940 | 19 | 39,880 |
Tags: dp, graphs
Correct Solution:
```
# 803E
import collections
def do():
n, k = map(int, input().split(" "))
s = input()
dp = collections.defaultdict(set)
gap = {'W': 1, 'L': -1, 'D': 0}
dp[-1].add(0)
for i in range(n-1):
if s[i] == '?':
for pre in dp[i-1]:
... | output | 1 | 19,940 | 19 | 39,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner takes 1 virtual bourle from the loser.
Last eveni... | instruction | 0 | 19,941 | 19 | 39,882 |
Tags: dp, graphs
Correct Solution:
```
N,k=list(map(int,input().strip().split(' ')))
S=input()
# num of W-num of L=j, j>k means k-j
dp=[[0 for j in range(2*k+1)]for i in range(N)]
#print(dp)
for i in range(len(S)):
if i==0:
if S[0]=='W':
dp[0][1]='W'
elif S[0]=='L':
dp[0][-1... | output | 1 | 19,941 | 19 | 39,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner takes 1 virtual bourle from the loser.
Last eveni... | instruction | 0 | 19,942 | 19 | 39,884 |
Tags: dp, graphs
Correct Solution:
```
n, k = [int(i) for i in input().split()]
s = input()
dp = [[False] * 2010 for i in range(1001)]
dp[0][0] = True
for i in range(n):
l = -k + 1
r = k
if i == n - 1:
l -= 1
r += 1
for b in range(l, r):
if s[i] == 'L':
dp[i + 1][b]... | output | 1 | 19,942 | 19 | 39,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner takes 1 virtual bourle from the loser.
Last eveni... | instruction | 0 | 19,943 | 19 | 39,886 |
Tags: dp, graphs
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
import sys
from io import BytesIO, IOBase
def main():
n,k=map(int,input().split())
s=list(input().rstrip())
dp,ans=[['0']*(2*k+2) for _ in range(n+1)],[]
dp[0][0]='.'
for i in range(1,n+1... | output | 1 | 19,943 | 19 | 39,887 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner takes 1 virtual bourle from the loser.
Last eveni... | instruction | 0 | 19,944 | 19 | 39,888 |
Tags: dp, graphs
Correct Solution:
```
n, k = [int(i) for i in input().split()]
s = input()
dp = [[False] * 2100 for i in range(1001)]
dp[0][0] = True
for i in range(n):
l = -k + 1
r = k
if i == n - 1:
l -= 1
r += 1
for b in range(l, r):
if s[i] == 'L':
dp[i + 1][b]... | output | 1 | 19,944 | 19 | 39,889 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner takes 1 virtual bourle from the loser.
Last eveni... | instruction | 0 | 19,945 | 19 | 39,890 |
Tags: dp, graphs
Correct Solution:
```
import sys
n, k = map(int, input().split())
s = list(input())
if s[-1] == 'D':
print('NO')
exit()
size, zero = 2*k-1, k-1
dp = [[0]*size for _ in range(n)]
dp[0][zero] = 1
for i in range(n-1):
for j in range(size):
if j and (s[i] == 'W' or s[i] == '?'):
... | output | 1 | 19,945 | 19 | 39,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner tak... | instruction | 0 | 19,946 | 19 | 39,892 |
Yes | output | 1 | 19,946 | 19 | 39,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner tak... | instruction | 0 | 19,947 | 19 | 39,894 |
Yes | output | 1 | 19,947 | 19 | 39,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner tak... | instruction | 0 | 19,948 | 19 | 39,896 |
Yes | output | 1 | 19,948 | 19 | 39,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner tak... | instruction | 0 | 19,949 | 19 | 39,898 |
Yes | output | 1 | 19,949 | 19 | 39,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner tak... | instruction | 0 | 19,950 | 19 | 39,900 |
No | output | 1 | 19,950 | 19 | 39,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner tak... | instruction | 0 | 19,951 | 19 | 39,902 |
No | output | 1 | 19,951 | 19 | 39,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner tak... | instruction | 0 | 19,952 | 19 | 39,904 |
No | output | 1 | 19,952 | 19 | 39,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there are always two players in a hand, there are no bets, and the winner tak... | instruction | 0 | 19,953 | 19 | 39,906 |
No | output | 1 | 19,953 | 19 | 39,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N boxes arranged in a circle. The i-th box contains A_i stones.
Determine whether it is possible to remove all the stones from the boxes by repeatedly performing the following operati... | instruction | 0 | 20,161 | 19 | 40,322 |
No | output | 1 | 20,161 | 19 | 40,323 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following game:
* Aoki chooses an integer x.
* Starting from Takaha... | instruction | 0 | 20,994 | 19 | 41,988 |
"Correct Solution:
```
#!/usr/bin/env python3
from bisect import bisect
N, Q = map(int, input().split())
A = [0] * (N % 2) + list(map(int, input().split()))
HF = len(A) // 2
li = []
cumsum = [sum(A[HF:])]
for i in range(HF - 1):
left = A[2 * i + 1]
right = A[i + HF]
li += [(left + right) // 2 + 1]
cum... | output | 1 | 20,994 | 19 | 41,989 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following game:
* Aoki chooses an integer x.
* Starting from Takaha... | instruction | 0 | 20,995 | 19 | 41,990 |
"Correct Solution:
```
# http://kmjp.hatenablog.jp/entry/2019/01/13/0930
import sys
input = sys.stdin.readline
from bisect import bisect_left
n, q = map(int, input().split())
a = list(map(int, input().split()))
xs = [int(input()) for i in range(q)]
s = [0]*(n+1)
se = [0]*(n+1)
for i in range(n):
s[i+1] = s[i] + ... | output | 1 | 20,995 | 19 | 41,991 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following game:
* Aoki chooses an integer x.
* Starting from Takaha... | instruction | 0 | 20,996 | 19 | 41,992 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
def calc(x):
l, r = 0, (N+1)//2
while r - l > 1:
m = (l+r) // 2
if A[m] + A[2*m] >= 2 * x:
l = m
else:
r = m
return l
N, Q = map(int, input().split())
A = [int(a) for a in input().split()][::-1]... | output | 1 | 20,996 | 19 | 41,993 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following game:
* Aoki chooses an integer x.
* Starting from Takaha... | instruction | 0 | 20,997 | 19 | 41,994 |
"Correct Solution:
```
from bisect import bisect_left
import sys
if sys.version_info[0:2] >= (3, 3):
from collections.abc import Sequence
else:
from collections import Sequence
class LazySequence(Sequence):
def __init__(self, f, n):
self.f = f
self.n = n
def __len__(self):
ret... | output | 1 | 20,997 | 19 | 41,995 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following game:
* Aoki chooses an integer x.
* Starting from Takaha... | instruction | 0 | 20,998 | 19 | 41,996 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpo... | output | 1 | 20,998 | 19 | 41,997 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following game:
* Aoki chooses an integer x.
* Starting from Takaha... | instruction | 0 | 20,999 | 19 | 41,998 |
"Correct Solution:
```
from bisect import bisect_left
N, Q = map(int, input().split())
A = [int(i) for i in input().split()]
X = [int(input()) for _ in range(Q)]
i = (N & 1) ^ 1
j = N // 2
st = sum(A[j:])
ret_k = []
ret_v = []
while i < j :
ret_k.append((A[i] + A[j]) // 2)
ret_v.append(st)
st = st - A[... | output | 1 | 20,999 | 19 | 41,999 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following game:
* Aoki chooses an integer x.
* Starting from Takaha... | instruction | 0 | 21,000 | 19 | 42,000 |
"Correct Solution:
```
import bisect
n,q = map(int, input().split())
aList = list(map(int, input().split()))
sumList=[]
sep2SumList=[]
for i in range(n):
if i==0:
sumList.append(aList[i])
else:
sumList.append(sumList[-1]+aList[i])
if n%2==0:
if i%2==1:
if i==1:
... | output | 1 | 21,000 | 19 | 42,001 |
Provide a correct Python 3 solution for this coding contest problem.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following game:
* Aoki chooses an integer x.
* Starting from Takaha... | instruction | 0 | 21,001 | 19 | 42,002 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
import bisect
n,q = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
if n%2 == 1:
n+=1
a.insert(0, 0)
sikiri = [(a[2*i+1] + a[i+n//2])//2 for i in range(n//2-1)]
s = sum(a[n//2:])
ans = [s]
for i in range(n//2-1):
s = s -... | output | 1 | 21,001 | 19 | 42,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following ga... | instruction | 0 | 21,002 | 19 | 42,004 |
Yes | output | 1 | 21,002 | 19 | 42,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following ga... | instruction | 0 | 21,003 | 19 | 42,006 |
Yes | output | 1 | 21,003 | 19 | 42,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following ga... | instruction | 0 | 21,004 | 19 | 42,008 |
Yes | output | 1 | 21,004 | 19 | 42,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following ga... | instruction | 0 | 21,005 | 19 | 42,010 |
Yes | output | 1 | 21,005 | 19 | 42,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following ga... | instruction | 0 | 21,006 | 19 | 42,012 |
No | output | 1 | 21,006 | 19 | 42,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following ga... | instruction | 0 | 21,007 | 19 | 42,014 |
No | output | 1 | 21,007 | 19 | 42,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following ga... | instruction | 0 | 21,008 | 19 | 42,016 |
No | output | 1 | 21,008 | 19 | 42,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N cards. The i-th card has an integer A_i written on it. For any two cards, the integers on those cards are different.
Using these cards, Takahashi and Aoki will play the following ga... | instruction | 0 | 21,009 | 19 | 42,018 |
No | output | 1 | 21,009 | 19 | 42,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N boxes arranged in a row from left to right. The i-th box from the left contains a_i manju (buns stuffed with bean paste). Sugim and Sigma play a game using these boxes. They alternat... | instruction | 0 | 21,010 | 19 | 42,020 |
No | output | 1 | 21,010 | 19 | 42,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N boxes arranged in a row from left to right. The i-th box from the left contains a_i manju (buns stuffed with bean paste). Sugim and Sigma play a game using these boxes. They alternat... | instruction | 0 | 21,011 | 19 | 42,022 |
No | output | 1 | 21,011 | 19 | 42,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N boxes arranged in a row from left to right. The i-th box from the left contains a_i manju (buns stuffed with bean paste). Sugim and Sigma play a game using these boxes. They alternat... | instruction | 0 | 21,012 | 19 | 42,024 |
No | output | 1 | 21,012 | 19 | 42,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N boxes arranged in a row from left to right. The i-th box from the left contains a_i manju (buns stuffed with bean paste). Sugim and Sigma play a game using these boxes. They alternat... | instruction | 0 | 21,013 | 19 | 42,026 |
No | output | 1 | 21,013 | 19 | 42,027 |
Provide a correct Python 3 solution for this coding contest problem.
D --Invisible
Problem Statement
You are trying to play a card game called "Invisible" with your friends. This card game uses two types of cards, a "scoring card" and a "jamming card". A positive value is written on each score card. The rules of thi... | instruction | 0 | 21,131 | 19 | 42,262 |
"Correct Solution:
```
n, m = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
memo = dict()
def calc(A, i):
if A[i] != -1:
return 0
point = 0
for j in range(i - 1, -1, -1):
if A[j] == -1:
break
point += A[j]
... | output | 1 | 21,131 | 19 | 42,263 |
Provide a correct Python 3 solution for this coding contest problem.
D --Invisible
Problem Statement
You are trying to play a card game called "Invisible" with your friends. This card game uses two types of cards, a "scoring card" and a "jamming card". A positive value is written on each score card. The rules of thi... | instruction | 0 | 21,132 | 19 | 42,264 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int... | output | 1 | 21,132 | 19 | 42,265 |
Provide a correct Python 3 solution for this coding contest problem.
D --Invisible
Problem Statement
You are trying to play a card game called "Invisible" with your friends. This card game uses two types of cards, a "scoring card" and a "jamming card". A positive value is written on each score card. The rules of thi... | instruction | 0 | 21,133 | 19 | 42,266 |
"Correct Solution:
```
n, m = map(int, input().split())
*A, = map(int, input().split())
*B, = map(int, input().split())
memo = {}
def dfs(p, q, s, t, turn, pss):
if (p, q, s, t, turn, pss) in memo:
return memo[p, q, s, t, turn, pss]
if p == len(A) and q == len(B):
return s-t
res = 0
if... | output | 1 | 21,133 | 19 | 42,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As we all know, Max is the best video game player among her friends. Her friends were so jealous of hers, that they created an actual game just to prove that she's not the best at games. The game is played on a directed acyclic graph (a DAG)... | instruction | 0 | 21,721 | 19 | 43,442 |
Tags: dfs and similar, dp, games, graphs
Correct Solution:
```
# python3
from functools import lru_cache
def readline(): return list(map(int, input().split()))
def main():
n, m = readline()
edges = [list() for __ in range(n)]
for __ in range(m):
tokens = input().split()
begin, end = map... | output | 1 | 21,721 | 19 | 43,443 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As we all know, Max is the best video game player among her friends. Her friends were so jealous of hers, that they created an actual game just to prove that she's not the best at games. The game is played on a directed acyclic graph (a DAG)... | instruction | 0 | 21,722 | 19 | 43,444 |
Tags: dfs and similar, dp, games, graphs
Correct Solution:
```
# int(input())
# [int(i) for i in input().split()]
import sys
sys.setrecursionlimit(20000)
def go(v,w,last):
if game[v][w][last] >= 0: return(game[v][w][last])
flag = 0
move = 0
for p in edges_out[v]:
if p[1] >= last:
m... | output | 1 | 21,722 | 19 | 43,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As we all know, Max is the best video game player among her friends. Her friends were so jealous of hers, that they created an actual game just to prove that she's not the best at games. The game is played on a directed acyclic graph (a DAG)... | instruction | 0 | 21,723 | 19 | 43,446 |
Tags: dfs and similar, dp, games, graphs
Correct Solution:
```
from functools import lru_cache
def readline(): return list(map(int, input().split()))
def main():
n, m = readline()
edges = [list() for __ in range(n)]
for __ in range(m):
tokens = input().split()
begin, end = map(int, toke... | output | 1 | 21,723 | 19 | 43,447 |
Provide a correct Python 3 solution for this coding contest problem.
There is an infinitely large pond, which we consider as a number line. In this pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1. On the lotus at coordinate i, an integer s_i is written.
You are standing on the lotus at coo... | instruction | 0 | 21,820 | 19 | 43,640 |
"Correct Solution:
```
n = int(input())
s = list(map(int, input().split()))
ans = 0
for i in range(1, n):
l = 0
r = n-1
cur = 0
while True:
l += i
r -= i
if l>=n or r<=i or (r%i==0 and r<=l):
break
cur += s[l] + s[r]
ans = max(ans, cur)
print(ans)
``` | output | 1 | 21,820 | 19 | 43,641 |
Provide a correct Python 3 solution for this coding contest problem.
There is an infinitely large pond, which we consider as a number line. In this pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1. On the lotus at coordinate i, an integer s_i is written.
You are standing on the lotus at coo... | instruction | 0 | 21,821 | 19 | 43,642 |
"Correct Solution:
```
n=int(input())
S=tuple(map(int,input().split()))
ans=0
for c in range(1,n-1):
k=1
tmp=0
while c*k<n-1:
a=n-1-k*c
if a<=c or (a<=k*c and a%c==0):
break
tmp+=S[n-1-k*c]+S[k*c]
k+=1
ans=max(ans,tmp)
print(ans)
``` | output | 1 | 21,821 | 19 | 43,643 |
Provide a correct Python 3 solution for this coding contest problem.
There is an infinitely large pond, which we consider as a number line. In this pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1. On the lotus at coordinate i, an integer s_i is written.
You are standing on the lotus at coo... | instruction | 0 | 21,822 | 19 | 43,644 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n=int(input())
S=list(map(int,input().split()))
ans=0
for d in range(1,n):
score=0
P=set()
for x in range(n//d):
... | output | 1 | 21,822 | 19 | 43,645 |
Provide a correct Python 3 solution for this coding contest problem.
There is an infinitely large pond, which we consider as a number line. In this pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1. On the lotus at coordinate i, an integer s_i is written.
You are standing on the lotus at coo... | instruction | 0 | 21,823 | 19 | 43,646 |
"Correct Solution:
```
import sys
def single_input(F): return F.readline().strip("\n")
def line_input(F): return F.readline().strip("\n").split()
def solve():
F = sys.stdin
N = int(single_input(F))
S = [int(s) for s in line_input(F)]
maxpoint = 0
for c in range(1, N//2):
s, l = 0, N-... | output | 1 | 21,823 | 19 | 43,647 |
Provide a correct Python 3 solution for this coding contest problem.
There is an infinitely large pond, which we consider as a number line. In this pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1. On the lotus at coordinate i, an integer s_i is written.
You are standing on the lotus at coo... | instruction | 0 | 21,824 | 19 | 43,648 |
"Correct Solution:
```
N = int(input())
S = list(map(int,input().split()))
ans = 0
for d in range(1,N):
max_now = 0
if (N-1) % d == 0:
now = 0
i, j = 0, N-1
while i < j:
now += S[i] + S[j]
max_now = max(now, max_now)
i += d
j -= d
els... | output | 1 | 21,824 | 19 | 43,649 |
Provide a correct Python 3 solution for this coding contest problem.
There is an infinitely large pond, which we consider as a number line. In this pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1. On the lotus at coordinate i, an integer s_i is written.
You are standing on the lotus at coo... | instruction | 0 | 21,825 | 19 | 43,650 |
"Correct Solution:
```
N = int(input())
s = [int(i) for i in input().split()]
ans = 0
for i in range(1, N-2):
p = 0
a = N-1
k = 0
while True:
k += 1
a -= i
b = a-i
if b>0 and a!= N-1-a and a!=N-1-a-i:
p += (s[a] + s[N-1-a])
ans = max(ans, p)
... | output | 1 | 21,825 | 19 | 43,651 |
Provide a correct Python 3 solution for this coding contest problem.
There is an infinitely large pond, which we consider as a number line. In this pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1. On the lotus at coordinate i, an integer s_i is written.
You are standing on the lotus at coo... | instruction | 0 | 21,826 | 19 | 43,652 |
"Correct Solution:
```
n = int(input())
s = list(map(int, input().split()))
MINUS_INF = -float("inf")
ans = 0
for c in range(1, n):
k = 1
tmp_ans = 0
while k * c < n - 1:
a = (n - 1) - k * c
b = a - c
if a <= b or b <= 0:
tmp_ans = MINUS_INF
if a % c == 0 and a //... | output | 1 | 21,826 | 19 | 43,653 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.