message stringlengths 2 16.2k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 575 109k | cluster float64 16 16 | __index_level_0__ int64 1.15k 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he will travel a positive distance in the following direct... | instruction | 0 | 104,329 | 16 | 208,658 |
"Correct Solution:
```
t=input()
n='N' in t
w='W' in t
s='S' in t
e='E' in t
if n==s and w==e:
print('Yes')
else:
print('No')
``` | output | 1 | 104,329 | 16 | 208,659 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he will travel a positive distance in the following direct... | instruction | 0 | 104,330 | 16 | 208,660 |
"Correct Solution:
```
s = input()
def f(a,b):
return (a in s and b not in s) or (b in s and a not in s)
if f('W', 'E') or f('N', 'S'):
print('No')
else:
print('Yes')
``` | output | 1 | 104,330 | 16 | 208,661 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he will travel a positive distance in the following direct... | instruction | 0 | 104,331 | 16 | 208,662 |
"Correct Solution:
```
S=set(input());print("YNeos"[S!=set("NEWS")and S!={"N","S"}and S!={"E","W"}::2])
``` | output | 1 | 104,331 | 16 | 208,663 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he will travel a positive distance in the following direct... | instruction | 0 | 104,332 | 16 | 208,664 |
"Correct Solution:
```
s = input()
A = ["N", "S", "E", "W"]
B = [0] * 4
for i in range(4):
B[i] = s.count(A[i]) > 0
print("No" if (B[0]^B[1]) or (B[2]^B[3]) else "Yes")
``` | output | 1 | 104,332 | 16 | 208,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he... | instruction | 0 | 104,333 | 16 | 208,666 |
Yes | output | 1 | 104,333 | 16 | 208,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he... | instruction | 0 | 104,334 | 16 | 208,668 |
Yes | output | 1 | 104,334 | 16 | 208,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he... | instruction | 0 | 104,335 | 16 | 208,670 |
Yes | output | 1 | 104,335 | 16 | 208,671 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he... | instruction | 0 | 104,336 | 16 | 208,672 |
Yes | output | 1 | 104,336 | 16 | 208,673 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he... | instruction | 0 | 104,337 | 16 | 208,674 |
No | output | 1 | 104,337 | 16 | 208,675 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he... | instruction | 0 | 104,338 | 16 | 208,676 |
No | output | 1 | 104,338 | 16 | 208,677 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he... | instruction | 0 | 104,339 | 16 | 208,678 |
No | output | 1 | 104,339 | 16 | 208,679 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke lives on an infinite two-dimensional plane. He is going on an N-day trip. At the beginning of Day 1, he is at home. His plan is described in a string S of length N. On Day i(1 ≦ i ≦ N), he... | instruction | 0 | 104,340 | 16 | 208,680 |
No | output | 1 | 104,340 | 16 | 208,681 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cast Q spells to move the golems.
The i-th spell consisted... | instruction | 0 | 105,079 | 16 | 210,158 |
"Correct Solution:
```
n, q = map(int, input().split())
s = "_{}_".format(input())
td = [input().split() for _ in range(q)]
current_l = 0
current_r = len(s) - 1
for t, d in reversed(td):
if current_l + 1 < len(s) - 1 and t == s[current_l + 1] and d == "L":
current_l += 1
elif t == s[current_l] and d ... | output | 1 | 105,079 | 16 | 210,159 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cast Q spells to move the golems.
The i-th spell consisted... | instruction | 0 | 105,080 | 16 | 210,160 |
"Correct Solution:
```
#from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353
... | output | 1 | 105,080 | 16 | 210,161 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cast Q spells to move the golems.
The i-th spell consisted... | instruction | 0 | 105,081 | 16 | 210,162 |
"Correct Solution:
```
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, Q = lr()
S = '-' + sr() + '-'
TD = [sr().split() for _ in range(Q)]
L = 1
for t, d in TD[::-1]:
if d == 'L':
if L <= N and S[L] == t:
L += 1
if ... | output | 1 | 105,081 | 16 | 210,163 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cast Q spells to move the golems.
The i-th spell consisted... | instruction | 0 | 105,082 | 16 | 210,164 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
n,q = map(int,input().split())
s = input().rstrip()
td = [list(input().rstrip().split()) for i in range(q)]
def judge(x,direction):
if direction == "L":
if x == n:
return True
if x == -1:
return False
jpos = lambda w: True if w>=0 el... | output | 1 | 105,082 | 16 | 210,165 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cast Q spells to move the golems.
The i-th spell consisted... | instruction | 0 | 105,083 | 16 | 210,166 |
"Correct Solution:
```
N,Q = map(int,input().split())
s = input()
info = [input().split() for _ in range(Q)]
def biserch(ok,ng,judge):
while abs(ok-ng) > 1:
mid = (ok+ng) // 2
if judge(mid):
ok = mid
else:
ng = mid
return ok
def left_out(i):
now = i
for ... | output | 1 | 105,083 | 16 | 210,167 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cast Q spells to move the golems.
The i-th spell consisted... | instruction | 0 | 105,084 | 16 | 210,168 |
"Correct Solution:
```
def inpl(): return list(map(int, input().split()))
N, Q = inpl()
S = input()
T = [""]*(Q)
D = [-1]*(Q)
for i in range(Q):
t, d = input().split()
T[i] = t
D[i] += 2*(d == "R")
def checkL(ix):
for i in range(Q):
if T[i] == S[ix]:
ix += D[i]
if ix == N:
... | output | 1 | 105,084 | 16 | 210,169 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cast Q spells to move the golems.
The i-th spell consisted... | instruction | 0 | 105,085 | 16 | 210,170 |
"Correct Solution:
```
N, Q = (int(i) for i in input().split())
S = input()
L = []
for i in range(Q):
t, d = (i for i in input().split())
L.append((t,d))
def func(k):
now = k
for t, d in L:
if S[now] == t:
if d == "R":
now += 1
else:
now -... | output | 1 | 105,085 | 16 | 210,171 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cast Q spells to move the golems.
The i-th spell consisted... | instruction | 0 | 105,086 | 16 | 210,172 |
"Correct Solution:
```
N,Q = map(int, input().split())
s = '_'+input()+'_'
td = [input().split() for _ in range(Q)]
right = N+1
left = 0
for t,d in reversed(td):
if t == s[right-1] and d =='R':
right -= 1
elif t == s[right] and d == 'L':
right += 1
if t == s[left+1] and d == 'L':
lef... | output | 1 | 105,086 | 16 | 210,173 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cas... | instruction | 0 | 105,087 | 16 | 210,174 |
Yes | output | 1 | 105,087 | 16 | 210,175 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cas... | instruction | 0 | 105,088 | 16 | 210,176 |
Yes | output | 1 | 105,088 | 16 | 210,177 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cas... | instruction | 0 | 105,089 | 16 | 210,178 |
Yes | output | 1 | 105,089 | 16 | 210,179 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cas... | instruction | 0 | 105,090 | 16 | 210,180 |
Yes | output | 1 | 105,090 | 16 | 210,181 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cas... | instruction | 0 | 105,091 | 16 | 210,182 |
No | output | 1 | 105,091 | 16 | 210,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cas... | instruction | 0 | 105,092 | 16 | 210,184 |
No | output | 1 | 105,092 | 16 | 210,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cas... | instruction | 0 | 105,093 | 16 | 210,186 |
No | output | 1 | 105,093 | 16 | 210,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares numbered 1 to N from left to right. Each square has a character written on it, and Square i has a letter s_i. Besides, there is initially one golem on each square.
Snuke cas... | instruction | 0 | 105,094 | 16 | 210,188 |
No | output | 1 | 105,094 | 16 | 210,189 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integers.
* 1 \leq K \leq N \leq 50
Input
Input is given fr... | instruction | 0 | 105,946 | 16 | 211,892 |
"Correct Solution:
```
a = list(map(int,input().split()))
N=a[0]
K=a[1]
print(N-K+1)
``` | output | 1 | 105,946 | 16 | 211,893 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integers.
* 1 \leq K \leq N \leq 50
Input
Input is given fr... | instruction | 0 | 105,947 | 16 | 211,894 |
"Correct Solution:
```
N,K = list(map(int,input().rstrip().split()))
print(N-K+1)
``` | output | 1 | 105,947 | 16 | 211,895 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integers.
* 1 \leq K \leq N \leq 50
Input
Input is given fr... | instruction | 0 | 105,948 | 16 | 211,896 |
"Correct Solution:
```
n, k = (int(z) for z in input().split())
print(n - k + 1)
``` | output | 1 | 105,948 | 16 | 211,897 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integers.
* 1 \leq K \leq N \leq 50
Input
Input is given fr... | instruction | 0 | 105,949 | 16 | 211,898 |
"Correct Solution:
```
import math
N,K = map(int,input().split())
print(N-K+1)
``` | output | 1 | 105,949 | 16 | 211,899 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integers.
* 1 \leq K \leq N \leq 50
Input
Input is given fr... | instruction | 0 | 105,950 | 16 | 211,900 |
"Correct Solution:
```
N, K = map(int, input().split())
A = N - K + 1
print(A)
``` | output | 1 | 105,950 | 16 | 211,901 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integers.
* 1 \leq K \leq N \leq 50
Input
Input is given fr... | instruction | 0 | 105,951 | 16 | 211,902 |
"Correct Solution:
```
n, k = map(int, input().split())
ans = n - k + 1
print(ans)
``` | output | 1 | 105,951 | 16 | 211,903 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integers.
* 1 \leq K \leq N \leq 50
Input
Input is given fr... | instruction | 0 | 105,952 | 16 | 211,904 |
"Correct Solution:
```
N, K = list(map(int, input().split())) # 整数
print(N-K+1)
``` | output | 1 | 105,952 | 16 | 211,905 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integers.
* 1 \leq K \leq N \leq 50
Input
Input is given fr... | instruction | 0 | 105,953 | 16 | 211,906 |
"Correct Solution:
```
n, k = [int(n) for n in input().split()]
print(n - k + 1)
``` | output | 1 | 105,953 | 16 | 211,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integ... | instruction | 0 | 105,954 | 16 | 211,908 |
Yes | output | 1 | 105,954 | 16 | 211,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integ... | instruction | 0 | 105,955 | 16 | 211,910 |
Yes | output | 1 | 105,955 | 16 | 211,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integ... | instruction | 0 | 105,956 | 16 | 211,912 |
Yes | output | 1 | 105,956 | 16 | 211,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integ... | instruction | 0 | 105,957 | 16 | 211,914 |
Yes | output | 1 | 105,957 | 16 | 211,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integ... | instruction | 0 | 105,958 | 16 | 211,916 |
No | output | 1 | 105,958 | 16 | 211,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integ... | instruction | 0 | 105,959 | 16 | 211,918 |
No | output | 1 | 105,959 | 16 | 211,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integ... | instruction | 0 | 105,960 | 16 | 211,920 |
No | output | 1 | 105,960 | 16 | 211,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to Takahashi.
How many ways are there to choose K consecutive integers?
Constraints
* All values in input are integ... | instruction | 0 | 105,961 | 16 | 211,922 |
No | output | 1 | 105,961 | 16 | 211,923 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would... | instruction | 0 | 105,978 | 16 | 211,956 |
"Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
b = 0
by = 0
flg = 0
for i,j in enumerate(a):
if abs(j) > abs(b):
b = j
by = i+1
if j > 0:
flg = 1
else:
flg = 0
ans = []
if flg == 1:
x = min(a)
if x < 0:
for i in range(n):
if a[i] != b:
a[i] += b
ans.append([by... | output | 1 | 105,978 | 16 | 211,957 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would... | instruction | 0 | 105,979 | 16 | 211,958 |
"Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
s = min(a)
b = max(a)
si = a.index(s)
bi = a.index(b)
op = []
if s + b >= 0:
for i in range(n):
if a[i] < 0:
op.append((bi+1, i+1))
for i in range(n-1):
op.append((i+1, i+2))
else:
for i in range(n):
... | output | 1 | 105,979 | 16 | 211,959 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would... | instruction | 0 | 105,980 | 16 | 211,960 |
"Correct Solution:
```
n = int(input())
A = list(map(int, input().split()))
ANS = []
B=A[:]
B.sort()
if abs(B[0]) > abs(B[-1]) :
absmax = B[0]
else :
absmax = B[-1]
ind = A.index(absmax)
if absmax != 0 :
fugou = absmax // abs(absmax)
for i in range(n) :
if A[i] * fugou < 0 :
ANS... | output | 1 | 105,980 | 16 | 211,961 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would... | instruction | 0 | 105,981 | 16 | 211,962 |
"Correct Solution:
```
N = int(input())
A = list(map(int, input().split()))
min_a, max_a = min(A), max(A)
min_idx, max_idx = A.index(min_a)+1, A.index(max_a)+1
ans = []
if abs(min_a) <= abs(max_a):
for i in range(1, N+1):
ans.append([max_idx, i])
for i in range(1, N):
ans.append([i, i+1])
else:
for i in ... | output | 1 | 105,981 | 16 | 211,963 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would... | instruction | 0 | 105,982 | 16 | 211,964 |
"Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
print(2*n-1)
if abs(max(a))<abs(min(a)):
x = a.index(min(a))
for i in range(n):
print(x+1,"",i+1)
for i in range(n-1):
print(n-i,"",n-i-1)
else:
x =a. index(max(a))
for i in range(n):
print(x+1,"",i+1)
for i in range(n-1):
print(... | output | 1 | 105,982 | 16 | 211,965 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would... | instruction | 0 | 105,983 | 16 | 211,966 |
"Correct Solution:
```
n=int(input())
A=list(map(int,input().split()))
Amax=max(A)
Amin=min(A)
ans=0
B=[]
if Amin>=0:
ans=n-1
for i in range(n-1):
B.append([i+1,i+2])
elif Amax<=0:
ans=n-1
for i in range(n-1):
B.append([n-i,n-i-1])
elif Amax>=-Amin:
a=A.index(Amax)
for i in range... | output | 1 | 105,983 | 16 | 211,967 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.