message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decrease the height of the square by 1.
* Do nothing.
Dete... | instruction | 0 | 78,913 | 8 | 157,826 |
"Correct Solution:
```
n=int(input())
h=list(map(int,input().split()))
c=1
max_h=0
for i in h:
if max_h>=i+2:
c=0
max_h=max(max_h,i)
print('Yes' if c==1 else 'No')
``` | output | 1 | 78,913 | 8 | 157,827 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decrease the height of the square by 1.
* Do nothing.
Dete... | instruction | 0 | 78,914 | 8 | 157,828 |
"Correct Solution:
```
N = int(input())
H = list(map(int,input().split()))
for i in range(N-1,0,-1):
if H[i] < H[i-1] :
H[i-1] -= 1
if sorted(H) != H:
print('No')
else:
print('Yes')
``` | output | 1 | 78,914 | 8 | 157,829 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decrease the height of the square by 1.
* Do nothing.
Dete... | instruction | 0 | 78,915 | 8 | 157,830 |
"Correct Solution:
```
n=int(input())
a=list(map(int, input().split()))
ans='Yes'
now=a[0]-1
for i in a:
if now>i:
ans='No'
now=max(now, i-1)
print(ans)
``` | output | 1 | 78,915 | 8 | 157,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decre... | instruction | 0 | 78,916 | 8 | 157,832 |
Yes | output | 1 | 78,916 | 8 | 157,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decre... | instruction | 0 | 78,917 | 8 | 157,834 |
Yes | output | 1 | 78,917 | 8 | 157,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decre... | instruction | 0 | 78,918 | 8 | 157,836 |
Yes | output | 1 | 78,918 | 8 | 157,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decre... | instruction | 0 | 78,919 | 8 | 157,838 |
Yes | output | 1 | 78,919 | 8 | 157,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decre... | instruction | 0 | 78,920 | 8 | 157,840 |
No | output | 1 | 78,920 | 8 | 157,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decre... | instruction | 0 | 78,921 | 8 | 157,842 |
No | output | 1 | 78,921 | 8 | 157,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decre... | instruction | 0 | 78,922 | 8 | 157,844 |
No | output | 1 | 78,922 | 8 | 157,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares arranged in a row from left to right. The height of the i-th square from the left is H_i.
For each square, you will perform either of the following operations once:
* Decre... | instruction | 0 | 78,923 | 8 | 157,846 |
No | output | 1 | 78,923 | 8 | 157,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to w... | instruction | 0 | 79,458 | 8 | 158,916 |
Yes | output | 1 | 79,458 | 8 | 158,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to w... | instruction | 0 | 79,459 | 8 | 158,918 |
Yes | output | 1 | 79,459 | 8 | 158,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to w... | instruction | 0 | 79,460 | 8 | 158,920 |
Yes | output | 1 | 79,460 | 8 | 158,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to w... | instruction | 0 | 79,461 | 8 | 158,922 |
Yes | output | 1 | 79,461 | 8 | 158,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to w... | instruction | 0 | 79,462 | 8 | 158,924 |
No | output | 1 | 79,462 | 8 | 158,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to w... | instruction | 0 | 79,463 | 8 | 158,926 |
No | output | 1 | 79,463 | 8 | 158,927 |
Provide a correct Python 3 solution for this coding contest problem.
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
Write a program which prints heights of the top three mountains in descending order.
Constraints
0 ≤ height of mountain (integer) ≤ 10,000
Input
... | instruction | 0 | 79,822 | 8 | 159,644 |
"Correct Solution:
```
x = []
for i in range(10):
x.append(int(input()))
x.sort()
for i in reversed(range(7,10)):
print(x[i])
``` | output | 1 | 79,822 | 8 | 159,645 |
Provide a correct Python 3 solution for this coding contest problem.
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
Write a program which prints heights of the top three mountains in descending order.
Constraints
0 ≤ height of mountain (integer) ≤ 10,000
Input
... | instruction | 0 | 79,825 | 8 | 159,650 |
"Correct Solution:
```
num = [int(input()) for i in range(10)]
num.sort(reverse=True)
for i in range(3):
print(num[i])
``` | output | 1 | 79,825 | 8 | 159,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. Thi... | instruction | 0 | 80,422 | 8 | 160,844 |
Tags: brute force
Correct Solution:
```
n = int(input())
x = [n] * 4 ** 9
a = list(map(int,input().split()))
for i in range(n):
x[a[i] - min(i,n - i - 1)] -= 1
print(min(x[1 : 7 ** 6]))
``` | output | 1 | 80,422 | 8 | 160,845 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. Thi... | instruction | 0 | 80,423 | 8 | 160,846 |
Tags: brute force
Correct Solution:
```
read = lambda: map(int, input().split())
n = int(input())
a = list(read())
b = [0] * n
for i in range(n // 2):
b[i] = b[n - i - 1] = i + 1
if n % 2: b[n // 2] = n // 2 + 1
from collections import Counter
c = Counter()
for i in range(n):
if a[i] >= b[i]: c[a[i] - b[i]] += ... | output | 1 | 80,423 | 8 | 160,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. Thi... | instruction | 0 | 80,424 | 8 | 160,848 |
Tags: brute force
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
if n==1:
print(0)
else:
d={}
if n%2==0:
x=[i+1 for i in range(n//2)]
i=x[-1]
while i>=1:
x.append(i)
i=i-1
else:
x=[i+1 for i in range(n//2)]
x.append(n... | output | 1 | 80,424 | 8 | 160,849 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. Thi... | instruction | 0 | 80,425 | 8 | 160,850 |
Tags: brute force
Correct Solution:
```
n = int(input())
a = [0] * 100005
l = list(map(int, input().split()))
for i in range(n):
a[l[i] - min(i, n - i - 1)] += 1
print(n - max(a[1::]))
``` | output | 1 | 80,425 | 8 | 160,851 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. Thi... | instruction | 0 | 80,426 | 8 | 160,852 |
Tags: brute force
Correct Solution:
```
import math
n=int(input())
a= list(map(int, input().split()))
x=[n]*100001
for i in range(n):
x[a[i]-min(n-i-1,i)]-=1
print (min(x[1:]))
``` | output | 1 | 80,426 | 8 | 160,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. Thi... | instruction | 0 | 80,427 | 8 | 160,854 |
Tags: brute force
Correct Solution:
```
n=int(input())
arr=[int(x) for x in input().split()]
i=0;j=n-1
d=0
while i<j:
arr[i]-=d
arr[j]-=d
d+=1
i+=1
j-=1
if i==j:
arr[i]-=d
dict={}
for item in arr:
if item not in dict:
dict[item]=1
else:
dict[item]+=1
m=0
for key,val in di... | output | 1 | 80,427 | 8 | 160,855 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. Thi... | instruction | 0 | 80,428 | 8 | 160,856 |
Tags: brute force
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
d=[n]*(100001)
for i in range(n):
d[l[i]-min(n-i-1,i)]-=1
print(min(d[1:]))
``` | output | 1 | 80,428 | 8 | 160,857 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that their heights formed a beautiful sequence. Thi... | instruction | 0 | 80,429 | 8 | 160,858 |
Tags: brute force
Correct Solution:
```
n=int(input());
x=[n]*4**9;
a=list(map(int,input().split()))
for i in range(n):
x[a[i]-min(i,n-i-1)]-=1
print(min(x[1:7**6]))
``` | output | 1 | 80,429 | 8 | 160,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that... | instruction | 0 | 80,430 | 8 | 160,860 |
Yes | output | 1 | 80,430 | 8 | 160,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that... | instruction | 0 | 80,431 | 8 | 160,862 |
Yes | output | 1 | 80,431 | 8 | 160,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that... | instruction | 0 | 80,432 | 8 | 160,864 |
Yes | output | 1 | 80,432 | 8 | 160,865 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that... | instruction | 0 | 80,433 | 8 | 160,866 |
Yes | output | 1 | 80,433 | 8 | 160,867 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that... | instruction | 0 | 80,434 | 8 | 160,868 |
No | output | 1 | 80,434 | 8 | 160,869 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that... | instruction | 0 | 80,435 | 8 | 160,870 |
No | output | 1 | 80,435 | 8 | 160,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that... | instruction | 0 | 80,436 | 8 | 160,872 |
No | output | 1 | 80,436 | 8 | 160,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On Bertown's main street n trees are growing, the tree number i has the height of ai meters (1 ≤ i ≤ n). By the arrival of the President of Berland these trees were decided to be changed so that... | instruction | 0 | 80,437 | 8 | 160,874 |
No | output | 1 | 80,437 | 8 | 160,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).
Little penguin Polo loves ... | instruction | 0 | 81,093 | 8 | 162,186 |
Tags: combinatorics
Correct Solution:
```
n,k=map(int,input().split())
M=10**9+7
print(k**~-k*pow(n-k,n-k,M)%M)
``` | output | 1 | 81,093 | 8 | 162,187 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).
Little penguin Polo loves ... | instruction | 0 | 81,094 | 8 | 162,188 |
Tags: combinatorics
Correct Solution:
```
import sys,math,heapq,copy
from collections import defaultdict,deque
from bisect import bisect_left,bisect_right
from functools import cmp_to_key
from itertools import permutations,combinations,combinations_with_replacement
# sys.setrecursionlimit(10**6)
# sys.stdin=open('Input... | output | 1 | 81,094 | 8 | 162,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).
Little penguin Polo loves ... | instruction | 0 | 81,096 | 8 | 162,192 |
Tags: combinatorics
Correct Solution:
```
n, k = map(int, input().split())
m = 1000000007
print((pow(k, k - 1, m) * pow(n - k, n - k, m)) % m)
``` | output | 1 | 81,096 | 8 | 162,193 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).
Little penguin Polo loves ... | instruction | 0 | 81,097 | 8 | 162,194 |
Tags: combinatorics
Correct Solution:
```
n, k = list(map(int, input().split()))
MOD = int(1e9 + 7)
lim = k
total = list(range(lim))
ans = 0
def dfs(lst, reach, curr):
reach[curr] = -2
nxt = lst[curr]
if nxt == 0:
reach[curr] = 1
return
if reach[nxt] == -2:
reach[curr] = 0
... | output | 1 | 81,097 | 8 | 162,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integ... | instruction | 0 | 81,100 | 8 | 162,200 |
Yes | output | 1 | 81,100 | 8 | 162,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integ... | instruction | 0 | 81,101 | 8 | 162,202 |
Yes | output | 1 | 81,101 | 8 | 162,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integ... | instruction | 0 | 81,102 | 8 | 162,204 |
Yes | output | 1 | 81,102 | 8 | 162,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integ... | instruction | 0 | 81,103 | 8 | 162,206 |
Yes | output | 1 | 81,103 | 8 | 162,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integ... | instruction | 0 | 81,104 | 8 | 162,208 |
No | output | 1 | 81,104 | 8 | 162,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integ... | instruction | 0 | 81,105 | 8 | 162,210 |
No | output | 1 | 81,105 | 8 | 162,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integ... | instruction | 0 | 81,106 | 8 | 162,212 |
No | output | 1 | 81,106 | 8 | 162,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integ... | instruction | 0 | 81,107 | 8 | 162,214 |
No | output | 1 | 81,107 | 8 | 162,215 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dreamoon wants to climb up a stair of n steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer m.
What is the minimal number of moves making him climb to the top of the stairs that ... | instruction | 0 | 81,170 | 8 | 162,340 |
Tags: implementation, math
Correct Solution:
```
import math
a, b = list(map(int, input().split()))
r = math.ceil(a/2)
flag = 0
for i in range(r, a+1):
if i % b == 0:
flag = 1
break
if flag == 1:
print(i)
else:
print(-1)
``` | output | 1 | 81,170 | 8 | 162,341 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dreamoon wants to climb up a stair of n steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer m.
What is the minimal number of moves making him climb to the top of the stairs that ... | instruction | 0 | 81,171 | 8 | 162,342 |
Tags: implementation, math
Correct Solution:
```
"""
x + 2y = n
x + y : m
x = n - 2y
n - y : m
"""
import math
n, m = map(int, input().split())
my_min = n
for k in range(1, math.ceil(n / m)):
y = n - m * k
x = m * k - y
if x >= 0 and y >= 0:
if x + y < my_min:
my_min = x + y
if my_min ... | output | 1 | 81,171 | 8 | 162,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dreamoon wants to climb up a stair of n steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer m.
What is the minimal number of moves making him climb to the top of the stairs that ... | instruction | 0 | 81,172 | 8 | 162,344 |
Tags: implementation, math
Correct Solution:
```
from math import ceil
I = lambda :map(int,input().split())
n,m = I()
if m > n:
print(-1)
exit()
if m == n:
print(m)
exit()
Move = range(ceil(n/2),n+1)
for i in Move:
if i%m==0:
print(i)
exit()
print(-1)
``` | output | 1 | 81,172 | 8 | 162,345 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.