message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be t... | instruction | 0 | 41,017 | 5 | 82,034 |
"Correct Solution:
```
N = int(input())
W = [int(x) for x in input().split()]
WL = list(abs(sum(W[:x])-sum(W[x:])) for x in range(0,N+1))
print(min(WL))
``` | output | 1 | 41,017 | 5 | 82,035 |
Provide a correct Python 3 solution for this coding contest problem.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be t... | instruction | 0 | 41,018 | 5 | 82,036 |
"Correct Solution:
```
N = int(input())
W = list(map(int,input().split()))
print(min(abs(sum(W[:i])-sum(W[i:])) for i in range(N)))
``` | output | 1 | 41,018 | 5 | 82,037 |
Provide a correct Python 3 solution for this coding contest problem.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be t... | instruction | 0 | 41,019 | 5 | 82,038 |
"Correct Solution:
```
n = int(input())
w = list(map(int,input().split()))
m = float("Inf")
for i in range(n):
m = min(m,abs(sum(w[:i])-sum(w[i:])))
print(m)
``` | output | 1 | 41,019 | 5 | 82,039 |
Provide a correct Python 3 solution for this coding contest problem.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be t... | instruction | 0 | 41,020 | 5 | 82,040 |
"Correct Solution:
```
n=int(input())
s=list(map(int,input().split()))
print(min ((abs(sum(s[:i])-sum(s[i:]))) for i in range(n)))
``` | output | 1 | 41,020 | 5 | 82,041 |
Provide a correct Python 3 solution for this coding contest problem.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be t... | instruction | 0 | 41,021 | 5 | 82,042 |
"Correct Solution:
```
N = int(input())
W = list(map(int, input().split()))
print(min([abs(sum(W[:i]) - sum(W[i:])) for i in range(N)]))
``` | output | 1 | 41,021 | 5 | 82,043 |
Provide a correct Python 3 solution for this coding contest problem.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices greater than T, for some integer 1 \leq T < N. Let S_1 be t... | instruction | 0 | 41,022 | 5 | 82,044 |
"Correct Solution:
```
N=int(input())
W=list(map(int,input().split()))
S=[]
for T in range(0,N):
x=sum(W[0:T+1])
S.append(abs(sum(W)-2*x))
print(min(S))
``` | output | 1 | 41,022 | 5 | 82,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices gre... | instruction | 0 | 41,023 | 5 | 82,046 |
Yes | output | 1 | 41,023 | 5 | 82,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices gre... | instruction | 0 | 41,024 | 5 | 82,048 |
Yes | output | 1 | 41,024 | 5 | 82,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices gre... | instruction | 0 | 41,025 | 5 | 82,050 |
Yes | output | 1 | 41,025 | 5 | 82,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices gre... | instruction | 0 | 41,026 | 5 | 82,052 |
Yes | output | 1 | 41,026 | 5 | 82,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices gre... | instruction | 0 | 41,027 | 5 | 82,054 |
No | output | 1 | 41,027 | 5 | 82,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices gre... | instruction | 0 | 41,028 | 5 | 82,056 |
No | output | 1 | 41,028 | 5 | 82,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices gre... | instruction | 0 | 41,029 | 5 | 82,058 |
No | output | 1 | 41,029 | 5 | 82,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N weights indexed 1 to N. The mass of the weight indexed i is W_i.
We will divide these weights into two groups: the weights with indices not greater than T, and those with indices gre... | instruction | 0 | 41,030 | 5 | 82,060 |
No | output | 1 | 41,030 | 5 | 82,061 |
Provide a correct Python 3 solution for this coding contest problem.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the following conditions:
* The largest among the values i... | instruction | 0 | 41,031 | 5 | 82,062 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
import sys
from collections import Counter
N,M = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
mod = 10**9+7
cnt_A = [False]*(N*M+1)
for a in A:
cnt_A[a] = True
cnt_B = [False]*(N*M+1)
for b in B:
... | output | 1 | 41,031 | 5 | 82,063 |
Provide a correct Python 3 solution for this coding contest problem.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the following conditions:
* The largest among the values i... | instruction | 0 | 41,032 | 5 | 82,064 |
"Correct Solution:
```
import sys
import bisect
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
MOD = 10 ** 9 + 7
A = lr(); A.sort()
B = lr(); B.sort()
if len(set(A)) != N or len(set(B)) != M or min(A) < M or min(B) < N:
print(0); exit()
Ase... | output | 1 | 41,032 | 5 | 82,065 |
Provide a correct Python 3 solution for this coding contest problem.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the following conditions:
* The largest among the values i... | instruction | 0 | 41,033 | 5 | 82,066 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
MOD = 10 ** 9 + 7
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
A.append(0)
B.append(0)
ans, h, w = 1, 0, 0
for i in range(N * M, 0, -1):
if A[h] == i:... | output | 1 | 41,033 | 5 | 82,067 |
Provide a correct Python 3 solution for this coding contest problem.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the following conditions:
* The largest among the values i... | instruction | 0 | 41,034 | 5 | 82,068 |
"Correct Solution:
```
N, M = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
A.sort()
B.sort()
v = [0] * (N*M+1)
e = [0] * (N*M+1)
for i in range(N):
for j in range(M):
v[min(A[i],B[j])] += 1
if A[i] == B[j]:
e[A[i]] += ... | output | 1 | 41,034 | 5 | 82,069 |
Provide a correct Python 3 solution for this coding contest problem.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the following conditions:
* The largest among the values i... | instruction | 0 | 41,035 | 5 | 82,070 |
"Correct Solution:
```
import bisect
MOD = 10**9+7
N,M = map(int,input().split())
A = sorted(list(map(int,input().split())))
B = sorted(list(map(int,input().split())))
a = set(A)
b = set(B)
check = True
if len(a) != N or len(b) != M:
check = False
ans = 1
for num in range(N*M,0,-1):
tmp = 0
if num in a and ... | output | 1 | 41,035 | 5 | 82,071 |
Provide a correct Python 3 solution for this coding contest problem.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the following conditions:
* The largest among the values i... | instruction | 0 | 41,036 | 5 | 82,072 |
"Correct Solution:
```
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
A=set(a);B=set(b)
if len(A)!=len(a) or len(B)!=len(b):
print(0)
else:
L=[]
for i in range(n):
l=[]
for j in range(m):
l.append(0)
L.append(l)
ct=1;ctn=0;ctm=0
for k in range(... | output | 1 | 41,036 | 5 | 82,073 |
Provide a correct Python 3 solution for this coding contest problem.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the following conditions:
* The largest among the values i... | instruction | 0 | 41,037 | 5 | 82,074 |
"Correct Solution:
```
mod=10**9+7
n,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
if len(a)!=len(set(a)) or len(b)!=len(set(b)):
print(0)
exit()
a.sort(reverse=True)
b.sort(reverse=True)
i_a=0
i_b=0
ans=1
for i in range(n*m,0,-1):
f_a=f_b=0
if i_a<n:
if a[i_a]==i:
... | output | 1 | 41,037 | 5 | 82,075 |
Provide a correct Python 3 solution for this coding contest problem.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the following conditions:
* The largest among the values i... | instruction | 0 | 41,038 | 5 | 82,076 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
mod = int(1e9+7)
N,M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
if len(set(A)) < N or len(set(B)) < M:
print(0)
exit(0)
A.append(0)
B.append(0)
ai,bi = ... | output | 1 | 41,038 | 5 | 82,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the... | instruction | 0 | 41,039 | 5 | 82,078 |
Yes | output | 1 | 41,039 | 5 | 82,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the... | instruction | 0 | 41,040 | 5 | 82,080 |
Yes | output | 1 | 41,040 | 5 | 82,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the... | instruction | 0 | 41,041 | 5 | 82,082 |
Yes | output | 1 | 41,041 | 5 | 82,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the... | instruction | 0 | 41,042 | 5 | 82,084 |
Yes | output | 1 | 41,042 | 5 | 82,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the... | instruction | 0 | 41,043 | 5 | 82,086 |
No | output | 1 | 41,043 | 5 | 82,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the... | instruction | 0 | 41,044 | 5 | 82,088 |
No | output | 1 | 41,044 | 5 | 82,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the... | instruction | 0 | 41,045 | 5 | 82,090 |
No | output | 1 | 41,045 | 5 | 82,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider writing each of the integers from 1 to N \times M in a grid with N rows and M columns, without duplicates. Takahashi thinks it is not fun enough, and he will write the numbers under the... | instruction | 0 | 41,046 | 5 | 82,092 |
No | output | 1 | 41,046 | 5 | 82,093 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a positive integer n, let us define f(n) as the number of digits in base 10.
You are given an integer S. Count the number of the pairs of positive integers (l, r) (l \leq r) such that f(l) ... | instruction | 0 | 41,065 | 5 | 82,130 |
No | output | 1 | 41,065 | 5 | 82,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a positive integer n, let us define f(n) as the number of digits in base 10.
You are given an integer S. Count the number of the pairs of positive integers (l, r) (l \leq r) such that f(l) ... | instruction | 0 | 41,066 | 5 | 82,132 |
No | output | 1 | 41,066 | 5 | 82,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a positive integer n, let us define f(n) as the number of digits in base 10.
You are given an integer S. Count the number of the pairs of positive integers (l, r) (l \leq r) such that f(l) ... | instruction | 0 | 41,067 | 5 | 82,134 |
No | output | 1 | 41,067 | 5 | 82,135 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
6
2
3
1
1
4
2
Output
Yes
Yes
Yes
No
Yes
No | instruction | 0 | 41,143 | 5 | 82,286 |
"Correct Solution:
```
c=p=0;b=[0]*1000000
for _ in range(int(input())):
x=int(input())
if (c==x and p!=x) or b[0]==1 or c>x:print('No');continue
print('Yes')
if x>=1000000:continue
p+=1;b[x]+=1
while b[x]>1:p-=1;b[x]-=2;b[x-1]+=1;x-=1
while b[c+1]==1 and c<999999:c+=1
``` | output | 1 | 41,143 | 5 | 82,287 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
6
2
3
1
1
4
2
Output
Yes
Yes
Yes
No
Yes
No | instruction | 0 | 41,144 | 5 | 82,288 |
"Correct Solution:
```
n = int(input())
bits = set()
c1 = 0
count = 0
ans = []
for i in range(n):
x = int(input())
if x in bits:
y = x
while c1 < y and y in bits:
y -= 1
if y <= c1:
y = 0
if y == 0 and count != x:
c1 = max(x, c1)
an... | output | 1 | 41,144 | 5 | 82,289 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . an
n is the size of the sequence and ai is the ith elem... | instruction | 0 | 41,186 | 5 | 82,372 |
"Correct Solution:
```
n = int(input())
line = list(map(int, input().split()))
print(*line[::-1])
``` | output | 1 | 41,186 | 5 | 82,373 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . an
n is the size of the sequence and ai is the ith elem... | instruction | 0 | 41,187 | 5 | 82,374 |
"Correct Solution:
```
n=int(input())
a=input().split()
a.reverse()
print(" ".join(map(str,a)))
``` | output | 1 | 41,187 | 5 | 82,375 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . an
n is the size of the sequence and ai is the ith elem... | instruction | 0 | 41,188 | 5 | 82,376 |
"Correct Solution:
```
a = int(input())
b = input().split()
c = b[::-1]
print(" ".join(c))
``` | output | 1 | 41,188 | 5 | 82,377 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . an
n is the size of the sequence and ai is the ith elem... | instruction | 0 | 41,189 | 5 | 82,378 |
"Correct Solution:
```
(lambda _, s: print(*reversed(s.split())))(input(), input())
``` | output | 1 | 41,189 | 5 | 82,379 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . an
n is the size of the sequence and ai is the ith elem... | instruction | 0 | 41,190 | 5 | 82,380 |
"Correct Solution:
```
s = input()
t = input().split()
t.reverse()
print(' '.join(t))
``` | output | 1 | 41,190 | 5 | 82,381 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . an
n is the size of the sequence and ai is the ith elem... | instruction | 0 | 41,191 | 5 | 82,382 |
"Correct Solution:
```
n = int(input())
a = input().split()
a.reverse()
print(' '.join(a))
``` | output | 1 | 41,191 | 5 | 82,383 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . an
n is the size of the sequence and ai is the ith elem... | instruction | 0 | 41,192 | 5 | 82,384 |
"Correct Solution:
```
n=input()
list=list(map(int, input().split()))
print(*list[::-1])
``` | output | 1 | 41,192 | 5 | 82,385 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . an
n is the size of the sequence and ai is the ith elem... | instruction | 0 | 41,193 | 5 | 82,386 |
"Correct Solution:
```
n = int(input())
an = list(map(int,input().split()[:n]))
print(*an[::-1])
``` | output | 1 | 41,193 | 5 | 82,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . a... | instruction | 0 | 41,194 | 5 | 82,388 |
Yes | output | 1 | 41,194 | 5 | 82,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . a... | instruction | 0 | 41,195 | 5 | 82,390 |
Yes | output | 1 | 41,195 | 5 | 82,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . a... | instruction | 0 | 41,196 | 5 | 82,392 |
Yes | output | 1 | 41,196 | 5 | 82,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . a... | instruction | 0 | 41,197 | 5 | 82,394 |
Yes | output | 1 | 41,197 | 5 | 82,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . a... | instruction | 0 | 41,198 | 5 | 82,396 |
No | output | 1 | 41,198 | 5 | 82,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . a... | instruction | 0 | 41,199 | 5 | 82,398 |
No | output | 1 | 41,199 | 5 | 82,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which reads a sequence and prints it in the reverse order.
Note
解説
Constraints
* n ≤ 100
* 0 ≤ ai < 1000
Input
The input is given in the following format:
n
a1 a2 . . . a... | instruction | 0 | 41,200 | 5 | 82,400 |
No | output | 1 | 41,200 | 5 | 82,401 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.