message stringlengths 2 57.2k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 61 108k | cluster float64 22 22 | __index_level_0__ int64 122 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Find a sequence of fractions (a_i)/(b_i), i = 1 … k (where a_i and b_i are positive integers) for some k such that:
$$$ \begin{cases} $b_i$ divides $n$, $1 < b_i < n$ for $i = 1 … k$ \\\ $1 ≤ a_i < b_i$ ... | instruction | 0 | 84,260 | 22 | 168,520 |
Tags: math
Correct Solution:
```
from math import sqrt
def phi(u):
ans = u
for i in range(2, int(sqrt(n)) + 1):
if u % i == 0:
while u % i == 0:
u = u / i
ans = ans - int(ans / i)
if n > 1:
ans = ans - int(ans / n)
return ans
def binpow(u, a, mod):
ans = 1
if a == 0:
return 1;
while a > 0:
if... | output | 1 | 84,260 | 22 | 168,521 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Find a sequence of fractions (a_i)/(b_i), i = 1 … k (where a_i and b_i are positive integers) for some k such that:
$$$ \begin{cases} $b_i$ divides $n$, $1 < b_i < n$ for $i = 1 … k$ \\\ $1 ≤ a_i < b_i$ ... | instruction | 0 | 84,261 | 22 | 168,522 |
Tags: math
Correct Solution:
```
# ========== //\\ //|| ||====//||
# || // \\ || || // ||
# || //====\\ || || // ||
# || // \\ || || // ||
# ========== // \\ ======== ||//====||
# code
def egcd(a, b):
if a ==... | output | 1 | 84,261 | 22 | 168,523 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Find a sequence of fractions (a_i)/(b_i), i = 1 … k (where a_i and b_i are positive integers) for some k such that:
$$$ \begin{cases} $b_i$ divides $n$, $1 < b_i < n$ for $i = 1 … k$ \\\ $1 ≤ a_i < b_i$ ... | instruction | 0 | 84,262 | 22 | 168,524 |
Tags: math
Correct Solution:
```
from math import sqrt
from itertools import count, islice
from fractions import Fraction
def isPrime(n):
return n > 1 and all(n % i for i in islice(count(2), int(sqrt(n) - 1)))
def factors(n: int):
_factors = []
for i in range(2, int(sqrt(n)) + 1):
times = 0
... | output | 1 | 84,262 | 22 | 168,525 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Find a sequence of fractions (a_i)/(b_i), i = 1 … k (where a_i and b_i are positive integers) for some k such that:
$$$ \begin{cases} $b_i$ divides $n$, $1 < b_i < n$ for $i = 1 … k$ \\\ $1 ≤ a_i < b_i$ ... | instruction | 0 | 84,263 | 22 | 168,526 |
Tags: math
Correct Solution:
```
from math import gcd
def check(e,f,n):
i=1
while i*e<=n:
if (n-(i*e))%f==0:
return ((n-(i*e))//f)
i+=1
def prime(x):
b=[]
i=2
while i*i<=x:
if x%i==0:
if x//i==i:
b.append(i)
else:
... | output | 1 | 84,263 | 22 | 168,527 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Find a sequence of fractions (a_i)/(b_i), i = 1 … k (where a_i and b_i are positive integers) for some k such that:
$$$ \begin{cases} $b_i$ divides $n$, $1 < b_i < n$ for $i = 1 … k$ \\\ $1 ≤ a_i < b_i$ ... | instruction | 0 | 84,264 | 22 | 168,528 |
Tags: math
Correct Solution:
```
import math
# method to print the divisors
def ps(n) :
a=[]
# Note that this loop runs till square root
i = 1
while i <= math.sqrt(n):
if (n % i == 0) :
# If divisors are equal, print only one
if (n / i... | output | 1 | 84,264 | 22 | 168,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a positive integer n.
Find a sequence of fractions (a_i)/(b_i), i = 1 … k (where a_i and b_i are positive integers) for some k such that:
$$$ \begin{cases} $b_i$ divides $n$, $1 ... | instruction | 0 | 84,265 | 22 | 168,530 |
No | output | 1 | 84,265 | 22 | 168,531 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers can be repeated in the original multiset and in ... | instruction | 0 | 84,718 | 22 | 169,436 |
Tags: implementation, math, number theory
Correct Solution:
```
read=lambda : map(int,input().split())
n,k,m=read()
a=list(read())
r=[[] for _ in range(m)]
p=-1
for d in a:
t=d%m
r[t].append(d)
if len(r[t])>=k:
p=t
break
if p<0:
print('No')
else:
print('Yes')
print(' '.join(map(s... | output | 1 | 84,718 | 22 | 169,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers can be repeated in the original multiset and in ... | instruction | 0 | 84,719 | 22 | 169,438 |
Tags: implementation, math, number theory
Correct Solution:
```
n,k,m=map(int,input().split())
a=list(map(int,input().split()))
mods=[0]*m
mod=0
for i in range(n):
mod=a[i]%m
mods[mod]+=1
if mods[mod]==k:
break
else:
print('No')
exit()
print('Yes')
results=[None]*k
count=0
for i in range(n):
cur=a[i]
if cur%m... | output | 1 | 84,719 | 22 | 169,439 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers can be repeated in the original multiset and in ... | instruction | 0 | 84,720 | 22 | 169,440 |
Tags: implementation, math, number theory
Correct Solution:
```
import sys
import math
import itertools
import collections
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def wr(arr): return ' ... | output | 1 | 84,720 | 22 | 169,441 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers can be repeated in the original multiset and in ... | instruction | 0 | 84,721 | 22 | 169,442 |
Tags: implementation, math, number theory
Correct Solution:
```
inp = list(map(int,input().split(' ')))
n, k, m = inp[0], inp[1], inp[2]
nums = [[] for i in range(m)]
for input in list(map(int,input().split(' '))):
nums[input%m].append(input)
done=False
for j in nums:
if len(j) >= k:
done=True
p... | output | 1 | 84,721 | 22 | 169,443 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers can be repeated in the original multiset and in ... | instruction | 0 | 84,722 | 22 | 169,444 |
Tags: implementation, math, number theory
Correct Solution:
```
n,k,m=map(int,input().split())
a=input().split()
b=[[]for i in range(0,m)]
for i in range(0,n):
c=int(a[i])
b[c%m].append(c)
if len(b[c%m])==k:
print('Yes')
print(' '.join(map(str,b[c%m])))
exit()
print('No')
... | output | 1 | 84,722 | 22 | 169,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers can be repeated in the original multiset and in ... | instruction | 0 | 84,723 | 22 | 169,446 |
Tags: implementation, math, number theory
Correct Solution:
```
n,k,m = map(int,input().split())
A = input().split()
B = [[] for x in range(0,m)]
for i in range(0,len(A)):
x = int(A[i])
B[x%m].append(x)
if len(B[x%m])==k:
print("Yes")
print(" ".join(map(str, B[x%m])))
exit()
print("... | output | 1 | 84,723 | 22 | 169,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers can be repeated in the original multiset and in ... | instruction | 0 | 84,724 | 22 | 169,448 |
Tags: implementation, math, number theory
Correct Solution:
```
import math
import re
def ria():
return [int(i) for i in input().split()]
def ri():
return int(input())
def rfa():
return [float(i) for i in input().split()]
n, k, m = ria()
mp = {}
ar = ria()
mx = 0
for i in ar:
if i % m not in mp:... | output | 1 | 84,724 | 22 | 169,449 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers can be repeated in the original multiset and in ... | instruction | 0 | 84,725 | 22 | 169,450 |
Tags: implementation, math, number theory
Correct Solution:
```
from collections import defaultdict
def divisibility(nums,k,m):
remainder = defaultdict(list)
for num in nums:
r = num%m
remainder[r].append(num)
for keys,values in remainder.items():
if len(values)>=k:
return values
return None
if __name__==... | output | 1 | 84,725 | 22 | 169,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers c... | instruction | 0 | 84,726 | 22 | 169,452 |
Yes | output | 1 | 84,726 | 22 | 169,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers c... | instruction | 0 | 84,727 | 22 | 169,454 |
Yes | output | 1 | 84,727 | 22 | 169,455 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers c... | instruction | 0 | 84,728 | 22 | 169,456 |
Yes | output | 1 | 84,728 | 22 | 169,457 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers c... | instruction | 0 | 84,729 | 22 | 169,458 |
Yes | output | 1 | 84,729 | 22 | 169,459 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers c... | instruction | 0 | 84,730 | 22 | 169,460 |
No | output | 1 | 84,730 | 22 | 169,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers c... | instruction | 0 | 84,731 | 22 | 169,462 |
No | output | 1 | 84,731 | 22 | 169,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers c... | instruction | 0 | 84,732 | 22 | 169,464 |
No | output | 1 | 84,732 | 22 | 169,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.
Numbers c... | instruction | 0 | 84,733 | 22 | 169,466 |
No | output | 1 | 84,733 | 22 | 169,467 |
Provide a correct Python 3 solution for this coding contest problem.
There is a set consisting of N distinct integers. The i-th smallest element in this set is S_i. We want to divide this set into two sets, X and Y, such that:
* The absolute difference of any two distinct elements in X is A or greater.
* The absolute... | instruction | 0 | 84,910 | 22 | 169,820 |
"Correct Solution:
```
import sys
from bisect import bisect
class BinaryIndexedTree:
def __init__(self, n, MOD):
self.size = n + 1
self.tree = [0] * (n + 2)
self.MOD = MOD
def sum(self, i):
i += 1
s = 0
while i > 0:
s = (s + self.tree[i]) % self.MO... | output | 1 | 84,910 | 22 | 169,821 |
Provide a correct Python 3 solution for this coding contest problem.
There is a set consisting of N distinct integers. The i-th smallest element in this set is S_i. We want to divide this set into two sets, X and Y, such that:
* The absolute difference of any two distinct elements in X is A or greater.
* The absolute... | instruction | 0 | 84,911 | 22 | 169,822 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
from bisect import bisect_left, bisect_right
INF = 10**18 + 100
N,A,B = map(int,input().split())
S = [-INF] + [int(x) for x in sys.stdin.read().split()]
MOD = 10**9 + 7
dpX = [0] * (N+1) # 最後にYを選んだとして、直前に選んだXがどこにあるか
dpY = [0] * (N+1) # 最後にXを選んだとして、直前に選んだY... | output | 1 | 84,911 | 22 | 169,823 |
Provide a correct Python 3 solution for this coding contest problem.
There is a set consisting of N distinct integers. The i-th smallest element in this set is S_i. We want to divide this set into two sets, X and Y, such that:
* The absolute difference of any two distinct elements in X is A or greater.
* The absolute... | instruction | 0 | 84,912 | 22 | 169,824 |
"Correct Solution:
```
mod=10**9+7
import bisect,sys
input=sys.stdin.readline
N,A,B=map(int,input().split())
S=[int(input()) for i in range(N)]
datax=[i for i in range(N+1)]
datay=[i for i in range(N+1)]
for i in range(2,N+1):
if S[i-1]-S[i-2]>=A:
datax[i]=datax[i-1]
if S[i-1]-S[i-2]>=B:
da... | output | 1 | 84,912 | 22 | 169,825 |
Provide a correct Python 3 solution for this coding contest problem.
There is a set consisting of N distinct integers. The i-th smallest element in this set is S_i. We want to divide this set into two sets, X and Y, such that:
* The absolute difference of any two distinct elements in X is A or greater.
* The absolute... | instruction | 0 | 84,913 | 22 | 169,826 |
"Correct Solution:
```
"""
https://atcoder.jp/contests/agc009/tasks/agc009_c
A <= B としてよい
dpだろうなぁ
dpA[i][X] = 1つ前を置いたのがBで、Aに置かれた最大がindexXの時の置き方
dpB[i][X] = 同様
if S[i]-S[i-1] >= B:
dpA[i][X] = dpA[i-1][X]
if X == i-1:
dpA[i][X] = ///
推移は、BITですればおｋ
もし差がB以下ならば→直前にBを置いていた場所に重ねおきはできない
→直前にAに置いていて、なおか... | output | 1 | 84,913 | 22 | 169,827 |
Provide a correct Python 3 solution for this coding contest problem.
There is a set consisting of N distinct integers. The i-th smallest element in this set is S_i. We want to divide this set into two sets, X and Y, such that:
* The absolute difference of any two distinct elements in X is A or greater.
* The absolute... | instruction | 0 | 84,914 | 22 | 169,828 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
class Lazysegtree:
#RUQ
def __init__(self, A, intv, initialize = True, segf = min):
#区間は 1-indexed で管理
self.N = len(A)
self.N0 = 2**(self.N-1).bit_length()
self.intv = intv
self.segf = segf
self.lazy... | output | 1 | 84,914 | 22 | 169,829 |
Provide a correct Python 3 solution for this coding contest problem.
There is a set consisting of N distinct integers. The i-th smallest element in this set is S_i. We want to divide this set into two sets, X and Y, such that:
* The absolute difference of any two distinct elements in X is A or greater.
* The absolute... | instruction | 0 | 84,915 | 22 | 169,830 |
"Correct Solution:
```
from bisect import bisect_left
N,A,B=map(int,input().split())
inf,mod=float("inf"),10**9+7
S=[int(input()) for i in range(N)]
St_A=[0]*N
St_B=[0]*N
J_A,J_B=[0],[0]
for i in range(N):
St_A[i]=bisect_left(S,S[i]+A)-1
St_B[i]=bisect_left(S,S[i]+B)-1
J_A.append(J_A[-1]+int(St_A[i]!=i))
J_B.ap... | output | 1 | 84,915 | 22 | 169,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a set consisting of N distinct integers. The i-th smallest element in this set is S_i. We want to divide this set into two sets, X and Y, such that:
* The absolute difference of any tw... | instruction | 0 | 84,918 | 22 | 169,836 |
No | output | 1 | 84,918 | 22 | 169,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a set consisting of N distinct integers. The i-th smallest element in this set is S_i. We want to divide this set into two sets, X and Y, such that:
* The absolute difference of any tw... | instruction | 0 | 84,919 | 22 | 169,838 |
No | output | 1 | 84,919 | 22 | 169,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.
Input
The first line contains two numbe... | instruction | 0 | 85,353 | 22 | 170,706 |
Tags: combinatorics, data structures, dp, two pointers
Correct Solution:
```
n, m = list(map(int, input().split()))
def intmodm(num):
return int(num) % m
a = list(map(intmodm, input().split()))
states = [[-1] * m]
# states[0][0] = 0
for index in range(n):
states.append(states[-1][:])
num = a[index]
for i in ran... | output | 1 | 85,353 | 22 | 170,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.
Input
The first line contains two numbe... | instruction | 0 | 85,354 | 22 | 170,708 |
Tags: combinatorics, data structures, dp, two pointers
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
from collections import Counter
import math as mt
import inspect, re
def varname(p): # prints name of the variable
for line in inspect.getframeinfo(inspect.currentframe().f_back)[3]:
... | output | 1 | 85,354 | 22 | 170,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.
Input
The first line contains two numbe... | instruction | 0 | 85,355 | 22 | 170,710 |
Tags: combinatorics, data structures, dp, two pointers
Correct Solution:
```
numElementos, modulo = input().split()
numElementos = int(numElementos)
modulo = int(modulo)
modulos = []
for i in range(modulo):
modulos.append(False)
restantePossivel = []
for i in range(modulo + 1):
restantePossivel.append(modulos.co... | output | 1 | 85,355 | 22 | 170,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.
Input
The first line contains two numbe... | instruction | 0 | 85,356 | 22 | 170,712 |
Tags: combinatorics, data structures, dp, two pointers
Correct Solution:
```
def modulus(arr, m, n):
for i in range(n):
arr[i] %= m
f = [0] * m
s = [0] * m
f[arr[0]] = 1
if f[0]:
return 1
for i in arr[1:]:
for j in range(m):
if f[j]:
s[j] = 1
... | output | 1 | 85,356 | 22 | 170,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.
Input
The first line contains two numbe... | instruction | 0 | 85,357 | 22 | 170,714 |
Tags: combinatorics, data structures, dp, two pointers
Correct Solution:
```
num_elementos, modulo = [ int(x) for x in input().split() ]
modulos = [False] * modulo
restante_possivel = [ modulos.copy() for _ in range(modulo + 1) ]
ultimo_elemento = min(num_elementos, modulo)
elementos = input().split()
for i in ran... | output | 1 | 85,357 | 22 | 170,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.
Input
The first line contains two numbe... | instruction | 0 | 85,358 | 22 | 170,716 |
Tags: combinatorics, data structures, dp, two pointers
Correct Solution:
```
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
c=[int(i)%m for i in input().split()]
z=[False]*m
for j in c:
q=z[:]
q[j]=True
for i in range(m):
if(z[i]):
q[(i+j)%m]=True
z=q[:]
if z[0... | output | 1 | 85,358 | 22 | 170,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.
Input
The first line contains two numbe... | instruction | 0 | 85,359 | 22 | 170,718 |
Tags: combinatorics, data structures, dp, two pointers
Correct Solution:
```
def main():
n, m = map(int, input().split())
l = [False] * m
l1 = l.copy()
for i in map(int, input().split()):
i %= m
l1[i] = True
for j, f in enumerate(l, i - m):
if f:
l1[j]... | output | 1 | 85,359 | 22 | 170,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.
Input
The first line contains two numbe... | instruction | 0 | 85,360 | 22 | 170,720 |
Tags: combinatorics, data structures, dp, two pointers
Correct Solution:
```
(n,m)=map(int,input().split())
if n>m:print("YES")
else:
t=[0 for i in range(m)]
s=input().split()
for i in range(len(s)):
h=int(s[i])%m
v=[0 for i in range(m)]
for j in range(m):
if t[j]==1:v[(h+j)%m]=1
for j in range(m):
if ... | output | 1 | 85,360 | 22 | 170,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible ... | instruction | 0 | 85,363 | 22 | 170,726 |
Yes | output | 1 | 85,363 | 22 | 170,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible ... | instruction | 0 | 85,365 | 22 | 170,730 |
No | output | 1 | 85,365 | 22 | 170,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a sequence of numbers a1, a2, ..., an, and a number m.
Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible ... | instruction | 0 | 85,367 | 22 | 170,734 |
No | output | 1 | 85,367 | 22 | 170,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arpa has found a list containing n numbers. He calls a list bad if and only if it is not empty and gcd (see notes section for more information) of numbers in the list is 1.
Arpa can perform two... | instruction | 0 | 85,441 | 22 | 170,882 |
No | output | 1 | 85,441 | 22 | 170,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arpa has found a list containing n numbers. He calls a list bad if and only if it is not empty and gcd (see notes section for more information) of numbers in the list is 1.
Arpa can perform two... | instruction | 0 | 85,442 | 22 | 170,884 |
No | output | 1 | 85,442 | 22 | 170,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arpa has found a list containing n numbers. He calls a list bad if and only if it is not empty and gcd (see notes section for more information) of numbers in the list is 1.
Arpa can perform two... | instruction | 0 | 85,443 | 22 | 170,886 |
No | output | 1 | 85,443 | 22 | 170,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arpa has found a list containing n numbers. He calls a list bad if and only if it is not empty and gcd (see notes section for more information) of numbers in the list is 1.
Arpa can perform two... | instruction | 0 | 85,444 | 22 | 170,888 |
No | output | 1 | 85,444 | 22 | 170,889 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alternating turns. In the i-th turn, the player wh... | instruction | 0 | 85,477 | 22 | 170,954 |
Tags: math, number theory
Correct Solution:
```
from math import sqrt
import sys
# from io import StringIO
#
# sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())
def largest_prime_factor(n):
for i in range(2, int(sqrt(n) + 1)):
if n % i == 0:
return largest_prime_factor(n // i)... | output | 1 | 85,477 | 22 | 170,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.
Alice goes first and then they take alternating turns. In the i-th turn, the player wh... | instruction | 0 | 85,478 | 22 | 170,956 |
Tags: math, number theory
Correct Solution:
```
# -*- coding: utf - 8 -*-
"""""""""""""""""""""""""""""""""""""""""""""
| author: mr.math - Hakimov Rahimjon |
| e-mail: mr.math0777@gmail.com |
| created: 10.03.2018 20:50 |
"""""""""""""""""""""""""""""""""""""""""""""
# inp = open("in... | output | 1 | 85,478 | 22 | 170,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Rec... | instruction | 0 | 85,741 | 22 | 171,482 |
Tags: math
Correct Solution:
```
n = int(input())
for i in range(n):
a = list(map(int,input().split(" ")))
if a[1] >= a[2] >= a[0] or a[0] >= a[2] >= a[1]:
if a[1] > a[0]:
a[0],a[1] = a[1], a[0]
print(a[0]//a[2]*a[2]+a[2])
else:
print(a[2])
``` | output | 1 | 85,741 | 22 | 171,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Rec... | instruction | 0 | 85,742 | 22 | 171,484 |
Tags: math
Correct Solution:
```
def f(l, r, d):
if d>r:
return d
for i in range(d,l,d):
if i%d ==0:
return i
return (int(r/d)+1)*d
n = int(input())
for i in range(n):
row = input().split(' ')
l = int(row[0])
r = int(row[1])
d = int(row[2])
print(str(int(f(... | output | 1 | 85,742 | 22 | 171,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Rec... | instruction | 0 | 85,743 | 22 | 171,486 |
Tags: math
Correct Solution:
```
test_cases = int(input())
for i in range(test_cases) :
left, right, divisor = map(int, input().split(" "))
if divisor < left :
print(divisor)
else :
print(divisor * ((right // divisor) + 1))
``` | output | 1 | 85,743 | 22 | 171,487 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.