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 direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
|
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 direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
|
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 direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
|
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 direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
|
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 will travel a positive distance in the following direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
Submitted Solution:
```
s = set(input())
if len(s) == 4 or (len(s) == 2 and (s == {'S', 'N'} or s == {'E', 'W'})):
print('Yes')
else:
print('No')
```
|
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 will travel a positive distance in the following direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
Submitted Solution:
```
S=input()
n=w=s=e=0
for c in S:
if c =='N': n=1
elif c=='W': w=1
elif c=='S': s=1
elif c=='E': e=1
print('Yes' if n==s and w==e else 'No')
```
|
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 will travel a positive distance in the following direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
Submitted Solution:
```
s = set(list(input()))
if any(s == set(list(i)) for i in ["NS","EW","NEWS"]):
print("Yes")
else:
print("No")
```
|
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 will travel a positive distance in the following direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
Submitted Solution:
```
s=set;print("NYoe s"[s(input())in map(s,["NS","EW","NSEW"])::2])
```
|
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 will travel a positive distance in the following direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
Submitted Solution:
```
#coding: cp932
i=int(input())
#i = [int(input())for s in range(M)]
i = list(i)
#print(i)
N = int(i[0])
ans=0
for s in range(N-1):
if i[1+s]==0:
continue
cul= int((i[1+s]+i[2+s])/2)
ans += cul
if i[1+s]>i[2+s]:
amari = (i[1+s]+i[2+s])%2
print(ans)
```
|
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 will travel a positive distance in the following direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
Submitted Solution:
```
s = input()
if 'E' in s:
if 'W' not in s:
print('No')
exit()
elif 'E' not in s:
if 'W' in s:
print('No')
exit()
elif 'N' not in s:
if 'S' in s:
print('No')
exit()
else:
if 'S' not in s:
print('No')
exit()
print('Yes')
```
|
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 will travel a positive distance in the following direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
Submitted Solution:
```
s = input()
s = set(s)
if len(s)%2==0:
print('Yes')
else:
print('No')
```
|
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 will travel a positive distance in the following direction:
* North if the i-th letter of S is `N`
* West if the i-th letter of S is `W`
* South if the i-th letter of S is `S`
* East if the i-th letter of S is `E`
He has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.
Constraints
* 1 ≦ | S | ≦ 1000
* S consists of the letters `N`, `W`, `S`, `E`.
Input
The input is given from Standard Input in the following format:
S
Output
Print `Yes` if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print `No`.
Examples
Input
SENW
Output
Yes
Input
NSNNSNSN
Output
Yes
Input
NNEW
Output
No
Input
W
Output
No
Submitted Solution:
```
N = input()
lis = list(set(N))
if "S" in lis or "N" in lis:
if "N" not in lis or "S" not in lis:
print("NO")
quit()
if "E" in lis or "W" in lis:
if "E" not in lis or "W" not in lis:
print("NO")
quit()
print("YES")
```
|
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 of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
|
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 == "R":
current_l -= 1
if 0 < current_r - 1 and t == s[current_r - 1] and d == "R":
current_r -= 1
elif t == s[current_r] and d == "L":
current_r += 1
print(max(current_r - current_l - 1, 0))
```
|
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 of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
|
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
def ddprint(x):
if DBG:
print(x)
n,q = inm()
s = ins()
t = []
d = []
for i in range(q):
tt,dd = input().split()
t.append(tt)
d.append(dd)
ltop = 0
for i in range(q-1,-1,-1):
if t[i]==s[ltop] and d[i]=='L':
ltop += 1
if ltop==n:
break
elif ltop>0 and t[i]==s[ltop-1] and d[i]=='R':
ltop -= 1
rtop = n-1
for i in range(q-1,-1,-1):
if t[i]==s[rtop] and d[i]=='R':
rtop -= 1
if rtop == -1:
break
elif rtop<n-1 and t[i]==s[rtop+1] and d[i]=='L':
rtop += 1
print(n-min(n,ltop+n-1-rtop))
```
|
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 of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
|
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 d == 'R':
if L >= 1 and S[L-1] == t:
L -= 1
R = N
for t, d in TD[::-1]:
if d == 'L':
if R <= N and S[R+1] == t:
R += 1
if d == 'R':
if R >= 1 and S[R] == t:
R -= 1
answer = max(0, R - L + 1)
print(answer)
# 34
```
|
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 of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
|
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 else False
else:
if x == -1:
return True
if x == n:
return False
jpos = lambda w: True if w<n else False
for i in range(q):
if td[i][0] == s[x]:
if td[i][1] == "R":
x += 1
else:
x -= 1
if jpos(x) == False:
return False
if not 0<=x<n:
return True
return True
l = -1
r = n
while l+1<r:
m = (l+r)//2
if judge(m,"L"):
r = m
else:
l = m
ansl = r
l = -1
r = n
while l+1<r:
m = (l+r)//2
if judge(m,"R"):
l = m
else:
r = m
ansr = l
print(max(0,ansr-ansl+1))
```
|
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 of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
|
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 t, d in info:
if s[now] == t:
if d == "L":
now -= 1
elif d == "R":
now += 1
if now < 0:
return True
elif now > N-1:
return False
return False
def right_out(i):
now = i
for t, d in info:
if s[now] == t:
if d == "L":
now -= 1
elif d == "R":
now += 1
if now > N-1:
return True
elif now < 0:
return False
return False
left = biserch(ok=-1,ng=N,judge=left_out)
right = biserch(ok=N,ng=-1,judge=right_out)
ans = right - (left + 1)
print(ans)
```
|
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 of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
|
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:
return True
if ix < 0:
return False
return True
def checkR(ix):
for i in range(Q):
if T[i] == S[ix]:
ix += D[i]
if ix == N:
return False
if ix < 0:
return True
return True
OK = N
NG = -1
while abs(OK-NG)>1:
mid = (OK+NG)//2
if checkL(mid):
OK = mid
else:
NG = mid
Lans = OK*1
OK = -1
NG = N
while abs(OK-NG)>1:
mid = (OK+NG)//2
if checkR(mid):
OK = mid
else:
NG = mid
print(max(OK-Lans+1, 0))
```
|
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 of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
|
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 -= 1
if now < 0:
return "l"
elif now >= N:
return "r"
if now < 0:
return "l"
elif now >= N:
return "r"
else:
return None
ans = 0
left = 0
right = N
while True:
if left >= right:
break
opt = (left + right)//2
if func(opt) == "l":
left = opt + 1
else:
right = opt
ans += right
left = 0
right = N
while True:
if left >= right:
break
opt = (left + right)//2
if func(opt) == "r":
right = opt
else:
left = opt + 1
ans += (N - left)
print(N - ans)
```
|
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 of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
|
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':
left += 1
elif t == s[left] and d == 'R':
left -= 1
print(max(0,right-left-1))
```
|
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 cast Q spells to move the golems.
The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
Submitted Solution:
```
N,Q = map(int, input().split())
S = input()
C = [tuple(map(str, input().split())) for _ in range(Q)]
C = C[::-1]
left = -1
right = N
for (t,d) in C:
if ('L' == d):
if (S[left+1] == t):
left += 1
if (N-1 <= left):
print(0)
exit()
if (right < N):
if (S[right] == t):
right += 1
if (N < right):
right = N
else:
if (S[right-1] == t):
right -= 1
if (right <= 0):
print(0)
exit()
if (-1 < left):
if (S[left] == t):
left -= 1
if (left < -1):
left = -1
print(right - left - 1)
```
|
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 cast Q spells to move the golems.
The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
Submitted Solution:
```
n,q=map(int,input().split())
s=[0]+list(input())+[0]
a=[input().split()for i in range(q)][::-1]
l,r=0,n+1
for(m,h)in a:
if m==s[l+1]and h=="L":
l+=1
elif m==s[l]and h=="R":
l-=1
if m==s[r-1]and h=="R":
r-=1
elif m==s[r]and h=="L":
r+=1
print(max(0,r-l-1))
```
|
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 cast Q spells to move the golems.
The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
Submitted Solution:
```
n,q = (int(i) for i in input().split())
s = '#'+input()+'#'
l = 0
r = n+1
a = [list(input().split()) for i in range(q)]
for i in range(q-1, -1, -1):
t,d = a[i]
if s[l+1] == t and d =='L':
l += 1
elif s[l] == t and d == 'R':
l -= 1
if s[r] == t and d == 'L':
r += 1
elif s[r-1] == t and d == 'R':
r -= 1
print(max(0,r-l-1))
```
|
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 cast Q spells to move the golems.
The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
Submitted Solution:
```
I=input;n,q=map(int,I().split());s=' %s '%I();l,r=0,n+1
for t,_,d in eval('I(),'*q)[::-1]:L=d<'R';R=1-L;l+=(t==s[l+1])*L-(t==s[l])*R;r+=(t==s[r])*L-(t==s[r-1])*R
print(r-l-1)
```
|
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 cast Q spells to move the golems.
The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
Submitted Solution:
```
N,Q=map(int,input().split())
s=[i for i in input()]
ans=[1 for i in range(N)]
for i in range(Q):
t,d=map(str,input().split())
T=s.copy()
while t in T:
if d=='R' and T.index(t)!=len(T)-1:
ans[T.index(t)+1]+=ans[T.index(t)]
if d=='L' and T.index(t)!=0:
ans[T.index(t)-1]+=ans[T.index(t)]
ans[T.index(t)]=0
T[T.index(t)]='Done'
print(sum(ans))
```
|
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 cast Q spells to move the golems.
The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
Submitted Solution:
```
import sys
n,q=map(int,input().split())
s=input()
l=[[i for i in l.split()] for l in sys.stdin]
def right_fallen(x):
stack=x
for i in range(n):
if stack==n:
return True
if stack==-1:
return False
if l[i][0]==s[stack]:
if l[i][1]=='R':
stack+=1
else:
stack-=1
return False
def left_fallen(x):
stack=x
for i in range(n):
if stack==n:
return False
if stack==-1:
return True
if l[i][0]==s[stack]:
if l[i][1]=='R':
stack+=1
else:
stack-=1
return False
def binary_search():
ok=n
ng=-1
while(abs(ok-ng)>1):
mid=(ok+ng)//2
if right_fallen(mid):
ok=mid
else:
ng=mid
return ok
def binary_search2():
ok=-1
ng=n
while(abs(ok-ng)>1):
mid=(ok+ng)//2
if left_fallen(mid):
ok=mid
else:
ng=mid
return ok
print(binary_search()-binary_search2()-1)
```
|
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 cast Q spells to move the golems.
The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
Submitted Solution:
```
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,Q = map(int,readline().split())
S = 'x' + readline().rstrip().decode('utf-8') + 'x'
query = read().decode('utf-8').split()
# ここに居れば左右に落ちない、ぎりぎり
L = 1; R = N
for T,D in zip(query[-2::-1],query[-1::-1]):
if D == 'L':
if S[L] == T:
L += 1
if S[R+1] == T:
R += 1
else:
if S[R] == T:
R -= 1
if S[L-1] == T:
L -= 1
x = R-L+1
if x <= 0:
x = 0
print(x)
```
|
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 cast Q spells to move the golems.
The i-th spell consisted of two characters t_i and d_i, where d_i is `L` or `R`. When Snuke cast this spell, for each square with the character t_i, all golems on that square moved to the square adjacent to the left if d_i is `L`, and moved to the square adjacent to the right if d_i is `R`.
However, when a golem tried to move left from Square 1 or move right from Square N, it disappeared.
Find the number of golems remaining after Snuke cast the Q spells.
Constraints
* 1 \leq N,Q \leq 2 \times 10^{5}
* |s| = N
* s_i and t_i are uppercase English letters.
* d_i is `L` or `R`.
Input
Input is given from Standard Input in the following format:
N Q
s
t_1 d_1
\vdots
t_{Q} d_Q
Output
Print the answer.
Examples
Input
3 4
ABC
A L
B L
B R
A R
Output
2
Input
8 3
AABCBDBA
A L
B R
A R
Output
5
Input
10 15
SNCZWRCEWB
B R
R R
E R
W R
Z L
S R
Q L
W L
B R
C L
A L
N L
E R
Z L
S L
Output
3
Submitted Solution:
```
# coding: utf-8
def main():
N,Q = map(int, input().split())
s = input()
ans = N
command = []
# print(char_list)
for i in range(Q):
# 呪文
t,d = input().split()
command.append([t,d])
# r_ans = N
# l_ans = -1
# for i in range(N):
# if simulation_R(command,s,i,N):
# r_ans = i
# break
# # print(r_ans)
# for i in range(N-1,-1,-1):
# if simulation_L(command,s,i,N):
# l_ans = i
# break
# # print(l_ans)
# ans = N - (N-r_ans) - (l_ans+1)
# print(command)
r = binary_serch_R(command,s,N)
#print(r)
l = binary_serch_L(command,s,N)
#print(l)
ans = ans - (N-r) - (l+1)
print(ans)
def simulation_R(command,s,now,N):
for pair in command:
if pair[0] == s[now]:
if pair[1] == 'L':
now -= 1
elif pair[1] == 'R':
now += 1
if now < 0:
return False
elif now >= N:
return True
return False
def simulation_L(command,s,now,N):
for pair in command:
if pair[0] == s[now]:
if pair[1] == 'L':
now -= 1
elif pair[1] == 'R':
now += 1
if now < 0:
return True
elif now >= N:
return False
return False
def binary_serch_R(command,s,N):
left = 0
right = N-1
if simulation_R(command,s,left,N) :
return -1
if simulation_R(command,s,right,N) == False:
return N
while not simulation_R(command,s,left,N) and simulation_R(command,s,right,N):
mid = int((left+right)/2)
# print(mid)
if right - left == 1:
return right
if simulation_R(command,s,mid,N) :
right = mid
else :
left = mid
return right
def binary_serch_L(command,s,N):
left = 0
right = N-1
if simulation_L(command,s,left,N) == False :
return -1
if simulation_L(command,s,right,N):
return N
while simulation_L(command,s,left,N) and (not simulation_L(command,s,right,N)):
mid = int((left+right)/2)
if right - left == 1:
return left
if not simulation_L(command,s,mid,N) :
right = mid
else :
left = mid
return left
# def simulation(command,s,now,d,N):
# # print("test"+str(now))
# for pair in command:
# if pair[0] == s[now]:
# if pair[1] == 'L':
# now -= 1
# elif pair[1] == 'R':
# now += 1
# if d == 'L' and now < 0 :
# return True
# elif
# elif d == 'R' and now >= N :
# return True
# return False
if __name__ == "__main__":
main()
```
|
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 from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
|
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 from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
|
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 from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
|
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 from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
|
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 from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
|
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 from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
|
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 from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
|
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 from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
|
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 integers.
* 1 \leq K \leq N \leq 50
Input
Input is given from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
Submitted Solution:
```
a,b = [ int(x) for x in input().split() ]
print( a-b+1 )
```
|
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 integers.
* 1 \leq K \leq N \leq 50
Input
Input is given from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
Submitted Solution:
```
n,k = [int(u) for u in input().split(" ")]
print(n-k+1)
```
|
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 integers.
* 1 \leq K \leq N \leq 50
Input
Input is given from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
Submitted Solution:
```
#A問題
N, K = map(int, input().split())
print(N+1-K)
```
|
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 integers.
* 1 \leq K \leq N \leq 50
Input
Input is given from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
Submitted Solution:
```
inp = input()
n, m = map(int, inp.split())
print(n-m+1)
```
|
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 integers.
* 1 \leq K \leq N \leq 50
Input
Input is given from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
Submitted Solution:
```
n, k = map(int, input().split())
print(13 - 3 + 1)
```
|
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 integers.
* 1 \leq K \leq N \leq 50
Input
Input is given from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
Submitted Solution:
```
N = int(input())
S = []
for i in range(N):
S.append(input())
count_AB = 0
lefter_B = 0
righter_A = 0
only_lefter_B = 0
only_righter_A = 0
for i in range(N):
count_AB += S[i].count('AB')
if S[i][0] == 'B':
lefter_B += 1
if S[i][len(S[i])-1] == 'A':
righter_A += 1
if (S[i][0] == 'B')and(S[i][len(S[i])-1] != 'A'):
only_lefter_B += 1
if (S[i][0] != 'B')and(S[i][len(S[i])-1] == 'A'):
only_righter_A += 1
if (only_lefter_B==0) and (only_righter_A==0):
Appearing_AB = max(min(lefter_B,righter_A) - 1 , 0)
else:
Appearing_AB = min(lefter_B,righter_A)
print(count_AB + Appearing_AB)
```
|
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 integers.
* 1 \leq K \leq N \leq 50
Input
Input is given from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
Submitted Solution:
```
# coding: utf-8
# Your code here!
n=int(input())
#normal, start_b, end_a, both
kosu=0
tokushu=[0,0,0,0]
for i in range(n):
line=input()
switch=0
for l in range(len(line)):
if switch==1:
if line[l]=='B':
kosu+=1
else:
switch=0
if line[l]=='A':
switch=1
if line[0]=='B':
if line[-1]=='A':
tokushu[3]+=1
else:
tokushu[1]+=1
else:
if line[-1]=='A':
tokushu[2]+=1
else:
tokushu[0]+=1
#print(kosu)
#print(tokushu)
kosu=0
tokushu=[1,1,2,3]
"""
if tokushu[3]>=1:
mazu=tokushu[3]-1
else:
mazu=0
"""
if tokushu[3]>=1:
if tokushu[1]==0 and tokushu[2]==0:
mazu=tokushu[3]-1
else:
mazu=tokushu[3]-1
sukunai=min(tokushu[1],tokushu[2])
mazu+=(sukunai+1)
else:
mazu=min(tokushu[1], tokushu[2])
print(kosu+mazu)
```
|
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 integers.
* 1 \leq K \leq N \leq 50
Input
Input is given from Standard Input in the following format:
N K
Output
Print the answer.
Examples
Input
3 2
Output
2
Input
13 3
Output
11
Submitted Solution:
```
import sys
def main():
data = input()
flds = data.split(" ")
N = int(flds[0])
K = int(flds[1])
count = 0
for i in range(1, N):
if i + K - 1 <= N:
count += 1
print(count)
if __name__ == "__main__":
main()
```
|
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 like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
|
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,i+1])
for i in range(1,n):
a[i] += a[i-1]
ans.append([i,i+1])
else:
x = max(a)
if x > 0:
for i in range(n-1,-1,-1):
if a[i] != b:
a[i] += b
ans.append([by,i+1])
for i in range(n-2,-1,-1):
a[i] += a[i+1]
ans.append([i+2,i+1])
print (len(ans))
for i in ans:
print (*i)
```
|
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 like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
|
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):
if a[i] > 0:
op.append((si+1, i+1))
for i in reversed(range(n-1)):
op.append((i+2, i+1))
print(len(op))
for x, y in op:
print(x, y)
```
|
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 like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
|
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.append([ind+1, i+1])
if fugou == 1 :
if ind+1 != 1 :
ANS.append([ind+1, 1])
for i in range(n-1) :
ANS.append([i+1, i+2])
else :
if ind+1 != n :
ANS.append([ind+1, n])
for i in range(n,1,-1) :
ANS.append([i, i-1])
print(len(ANS))
for i in range(len(ANS)) :
print("{} {}".format(ANS[i][0], ANS[i][1]))
else :
print(0)
```
|
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 like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
|
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 range(1, N+1):
ans.append([min_idx, i])
for i in range(N, 1, -1):
ans.append([i, i-1])
print(len(ans))
for a in ans:
print(*a)
```
|
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 like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
|
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(i+1,"",i+2)
```
|
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 like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
|
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(n):
if A[i]!=Amax:
ans+=1
B.append([a+1,i+1])
for i in range(n-1):
ans+=1
B.append([i+1,i+2])
else:
a=A.index(Amin)
for i in range(n):
if A[i]!=Amin:
ans+=1
B.append([a+1,i+1])
for i in range(n-1):
ans+=1
B.append([n-i,n-i-1])
print(ans)
for b in B:
print(' '.join(map(str,b)))
```
|
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.