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.
Authors guessed an array a consisting of n integers; each integer is not less than 2 and not greater than 2 ⋅ 10^5. You don't know the array a, but you know the array b which is formed from it with the following sequence of operations:
1.... | instruction | 0 | 32,594 | 22 | 65,188 |
Tags: dfs and similar, graphs, greedy, number theory, sortings
Correct Solution:
```
from collections import Counter
def rwh_primes(n):
sieve = [True] * n
for i in range(3,int(n**0.5)+1,2):
if sieve[i]:
sieve[i*i::2*i]=[False]*((n-i*i-1)//(2*i)+1)
return [2] + [i for i in range(3,n,2) if... | output | 1 | 32,594 | 22 | 65,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Authors guessed an array a consisting of n integers; each integer is not less than 2 and not greater than 2 ⋅ 10^5. You don't know the array a, but you know the array b which is formed from it with the following sequence of operations:
1.... | instruction | 0 | 32,595 | 22 | 65,190 |
Tags: dfs and similar, graphs, greedy, number theory, sortings
Correct Solution:
```
import sys
from collections import Counter
from bisect import bisect_left
def Sieve(l): # Check if can be modified for primeNUmbers at prime places
#l=3 * 1000 * 1000 + 13
primes=[0]*2+[1]*l
for i in range(l):
if ... | output | 1 | 32,595 | 22 | 65,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Authors guessed an array a consisting of n integers; each integer is not less than 2 and not greater than 2 ⋅ 10^5. You don't know the array a, but you know the array b which is formed from it with the following sequence of operations:
1.... | instruction | 0 | 32,596 | 22 | 65,192 |
Tags: dfs and similar, graphs, greedy, number theory, sortings
Correct Solution:
```
from sys import stdin, stdout
import collections
import math
import heapq
def primes(n):
""" Returns a list of primes < n """
sieve = [True] * n
for i in range(3,int(n**0.5)+1,2):
if sieve[i]:
sieve[i*... | output | 1 | 32,596 | 22 | 65,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Authors guessed an array a consisting of n integers; each integer is not less than 2 and not greater than 2 ⋅ 10^5. You don't know the array a, but you know the array b which is formed from it w... | instruction | 0 | 32,597 | 22 | 65,194 |
No | output | 1 | 32,597 | 22 | 65,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Authors guessed an array a consisting of n integers; each integer is not less than 2 and not greater than 2 ⋅ 10^5. You don't know the array a, but you know the array b which is formed from it w... | instruction | 0 | 32,598 | 22 | 65,196 |
No | output | 1 | 32,598 | 22 | 65,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Authors guessed an array a consisting of n integers; each integer is not less than 2 and not greater than 2 ⋅ 10^5. You don't know the array a, but you know the array b which is formed from it w... | instruction | 0 | 32,599 | 22 | 65,198 |
No | output | 1 | 32,599 | 22 | 65,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Authors guessed an array a consisting of n integers; each integer is not less than 2 and not greater than 2 ⋅ 10^5. You don't know the array a, but you know the array b which is formed from it w... | instruction | 0 | 32,600 | 22 | 65,200 |
No | output | 1 | 32,600 | 22 | 65,201 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the new arrays as you want.
Let's call an array m-... | instruction | 0 | 32,739 | 22 | 65,478 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
# Fast IO Region
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.... | output | 1 | 32,739 | 22 | 65,479 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the new arrays as you want.
Let's call an array m-... | instruction | 0 | 32,740 | 22 | 65,480 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
for _ in range(int(input())):
n,m=map(int,input().split())
a=list(map(int,input().split()))
l=[0 for _ in range(m)]
for c in a:
l[c%m]+=1
ans=0
i=0
while i<=m//2:
if i==m-i or i==0:
if l[i]:
... | output | 1 | 32,740 | 22 | 65,481 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the new arrays as you want.
Let's call an array m-... | instruction | 0 | 32,741 | 22 | 65,482 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
for i in range(int(input())):
n,m=map(int,input().split())
a=list(map(int,input().split()))
g=[0]*(m+1)
for j in range(n):
g[a[j]%m]=g[a[j]%m]+1
sumo=0
for j in range(1,(m+1)//2):
if min(g[j],g[m-j])==max(g[j],g[m-... | output | 1 | 32,741 | 22 | 65,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the new arrays as you want.
Let's call an array m-... | instruction | 0 | 32,742 | 22 | 65,484 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
from math import *
from collections import defaultdict as dt
from sys import stdin
inp = lambda : stdin.readline().strip()
I = lambda : int(inp())
M = lambda : map(int,stdin.readline().split())
L = lambda : list(map(int,stdin.readline().split()))
mod = 1... | output | 1 | 32,742 | 22 | 65,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the new arrays as you want.
Let's call an array m-... | instruction | 0 | 32,743 | 22 | 65,486 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
def m_arrays(arr, k):
modulo = {}
seen = set()
for num in arr:
modulo[num % k] = modulo.get(num % k, 0) + 1
ans = 0
for c in modulo:
if k - c not in seen:
if k - c in modulo:
first = mo... | output | 1 | 32,743 | 22 | 65,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the new arrays as you want.
Let's call an array m-... | instruction | 0 | 32,744 | 22 | 65,488 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
from sys import stdin
from collections import defaultdict
input = stdin.readline
T = int(input())
for t in range(1,T + 1):
n,m = map(int,input().split())
count = defaultdict(lambda : 0)
_input = list(map(int,input().split()))
for i in _input:
count... | output | 1 | 32,744 | 22 | 65,489 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the new arrays as you want.
Let's call an array m-... | instruction | 0 | 32,745 | 22 | 65,490 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
from collections import Counter
def main():
for _ in range(int(input())):
n,m = map(int,input().split())
a = Counter(map(lam... | output | 1 | 32,745 | 22 | 65,491 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the new arrays as you want.
Let's call an array m-... | instruction | 0 | 32,746 | 22 | 65,492 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
# Har har mahadev
# author : @ harsh kanani
from collections import Counter
for _ in range(int(input())):
n, m = map(int, input().split())
l = list(map(int, input().split()))
l1 = []
for i in range(n):
l1.append(l[i]%m)
c = ... | output | 1 | 32,746 | 22 | 65,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the ... | instruction | 0 | 32,747 | 22 | 65,494 |
Yes | output | 1 | 32,747 | 22 | 65,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the ... | instruction | 0 | 32,748 | 22 | 65,496 |
Yes | output | 1 | 32,748 | 22 | 65,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the ... | instruction | 0 | 32,749 | 22 | 65,498 |
Yes | output | 1 | 32,749 | 22 | 65,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the ... | instruction | 0 | 32,750 | 22 | 65,500 |
Yes | output | 1 | 32,750 | 22 | 65,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the ... | instruction | 0 | 32,751 | 22 | 65,502 |
No | output | 1 | 32,751 | 22 | 65,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the ... | instruction | 0 | 32,752 | 22 | 65,504 |
No | output | 1 | 32,752 | 22 | 65,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the ... | instruction | 0 | 32,753 | 22 | 65,506 |
No | output | 1 | 32,753 | 22 | 65,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n consisting of n positive integers and a positive integer m.
You should divide elements of this array into some arrays. You can order the elements in the ... | instruction | 0 | 32,754 | 22 | 65,508 |
No | output | 1 | 32,754 | 22 | 65,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer numbers a1, a2, ..., ak. We say that this sequ... | instruction | 0 | 32,846 | 22 | 65,692 |
Tags: chinese remainder theorem, math, number theory
Correct Solution:
```
def gcd(a,b):
if a<b:
c=b
b=a
a=c
while b!=0:
t=b
b=a%b
a=t
return int(a)
def extendedEuclides(a,b):
xx=y=0
yy=x=1
while b!=0:
q=int(a/b)
t=b
b=a%b
a=t
t=xx
xx=x-q*xx
x=t
t=yy
yy=y-q*yy
y=t
return [a,x,y]
... | output | 1 | 32,846 | 22 | 65,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer numbers a1, a2, ..., ak. We say that this sequ... | instruction | 0 | 32,847 | 22 | 65,694 |
Tags: chinese remainder theorem, math, number theory
Correct Solution:
```
import math
def lcm(a,b):
return a*b// math.gcd(a,b)
def egcd(a,b):
if b==0: return (a, 1, 0)
g,x,y = egcd(b,a%b)
return (g, y, x - (a//b) * y)
def crt(a,m1,b,m2):
g,x,y = egcd(m1,m2)
if (b-a)%g!=0: return (0,-1)
... | output | 1 | 32,847 | 22 | 65,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer numbers a1, a2, ..., ak. We say that this sequ... | instruction | 0 | 32,848 | 22 | 65,696 |
Tags: chinese remainder theorem, math, number theory
Correct Solution:
```
def gcd(a,b):
if b == 0:
return a
return gcd(b, a%b)
def extend_euclid(a,b):
if b == 0:
return 1,0
else:
y,x = extend_euclid(b, a%b)
y = y - (a//b)*x
return x,y
n,m,k = map(int,input(... | output | 1 | 32,848 | 22 | 65,697 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer numbers a1, a2, ..., ak. We say that this sequ... | instruction | 0 | 32,849 | 22 | 65,698 |
Tags: chinese remainder theorem, math, number theory
Correct Solution:
```
#https://codeforces.com/contest/338/problem/D
def gcd(a,b):
if b == 0:
return a
return gcd(b, a%b)
def extend_euclid(a,b):
if b == 0:
return 1,0
else:
y,x = extend_euclid(b, a%b)
y = y - (a//b)... | output | 1 | 32,849 | 22 | 65,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer numbers a1, a2, ..., ak. We say that this sequ... | instruction | 0 | 32,850 | 22 | 65,700 |
Tags: chinese remainder theorem, math, number theory
Correct Solution:
```
def gcd(a,b):
if b == 0:
return a
return gcd(b, a%b)
def ext(a,b):
if b == 0:
return 1,0
else:
y,x = ext(b, a%b)
y = y - (a//b)*x
return x,y
n,m,k = map(int,input().split())
a = list(... | output | 1 | 32,850 | 22 | 65,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer numbers a1, a2, ..., ak. We say that this sequ... | instruction | 0 | 32,851 | 22 | 65,702 |
Tags: chinese remainder theorem, math, number theory
Correct Solution:
```
from sys import stdin
from math import gcd
def lcm(a,b):
return a*b//gcd(a,b)
def exgcd(a,b)->(int,int,int):
if b == 0:
return (a,1,0)
d,x,y = exgcd(b,a%b)
t = x
x = y
y = t - (a//b)*y
return (d,x,y)
def ca... | output | 1 | 32,851 | 22 | 65,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer numbers a1, a2, ..., ak. We say that this sequ... | instruction | 0 | 32,852 | 22 | 65,704 |
Tags: chinese remainder theorem, math, number theory
Correct Solution:
```
from math import gcd
def lcm(a, b):
if min(a, b) == 0: return max(a, b)
return a // gcd(a, b) * b
class equation():
def __init__(self, r, mod):
self.r = r
self.mod = mod
def goodBye():
print("NO")
exi... | output | 1 | 32,852 | 22 | 65,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer numbers a1, a2, ..., ak. We say that this sequ... | instruction | 0 | 32,853 | 22 | 65,706 |
Tags: chinese remainder theorem, math, number theory
Correct Solution:
```
'''
Created on Aug 28, 2016
@author: Md. Rezwanul Haque
'''
def gcd(a,b):
if b == 0:
return a
return gcd(b, a%b)
def extend_euclid(a,b):
if b == 0:
return 1,0
else:
y,x = extend_euclid(b, a%b)
... | output | 1 | 32,853 | 22 | 65,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer... | instruction | 0 | 32,854 | 22 | 65,708 |
Yes | output | 1 | 32,854 | 22 | 65,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer... | instruction | 0 | 32,855 | 22 | 65,710 |
Yes | output | 1 | 32,855 | 22 | 65,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer... | instruction | 0 | 32,856 | 22 | 65,712 |
Yes | output | 1 | 32,856 | 22 | 65,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer... | instruction | 0 | 32,857 | 22 | 65,714 |
No | output | 1 | 32,857 | 22 | 65,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer... | instruction | 0 | 32,858 | 22 | 65,716 |
No | output | 1 | 32,858 | 22 | 65,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer... | instruction | 0 | 32,859 | 22 | 65,718 |
No | output | 1 | 32,859 | 22 | 65,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a table G of size n × m such that G(i, j) = GCD(i, j) for all 1 ≤ i ≤ n, 1 ≤ j ≤ m. GCD(a, b) is the greatest common divisor of numbers a and b.
You have a sequence of positive integer... | instruction | 0 | 32,860 | 22 | 65,720 |
No | output | 1 | 32,860 | 22 | 65,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – ....
We know that the polyline passes through the point (a, b). Find minimum positive value x such that it is true or ... | instruction | 0 | 32,956 | 22 | 65,912 |
Tags: geometry, math
Correct Solution:
```
a, b = map(int, input().split())
if b > a:
print(-1)
else:
x1 = a + b
x = b
print(x1 / (2 * (x1 // (2 * x))))
``` | output | 1 | 32,956 | 22 | 65,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – ....
We know that the polyline passes through the point (a, b). Find minimum positive value x such that it is true or ... | instruction | 0 | 32,957 | 22 | 65,914 |
Tags: geometry, math
Correct Solution:
```
from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)%2==0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b))
``` | output | 1 | 32,957 | 22 | 65,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – ....
We know that the polyline passes through the point (a, b). Find minimum positive value x such that it is true or ... | instruction | 0 | 32,958 | 22 | 65,916 |
Tags: geometry, math
Correct Solution:
```
import sys
a,b = map(int,input().split())
if a<b:
print(-1)
sys.exit(0)
k = int(((a/b)+1)/2)
z = 2*k*b/(a+b)
print(a/(2*k-z))
``` | output | 1 | 32,958 | 22 | 65,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – ....
We know that the polyline passes through the point (a, b). Find minimum positive value x such that it is true or ... | instruction | 0 | 32,959 | 22 | 65,918 |
Tags: geometry, math
Correct Solution:
```
from fractions import Fraction
def solve(a, b):
x = Fraction(b)
n = a // (x*2)
a_ = a % (x*2)
if b > a:
return -1
if a_ == x:
return float(x)
if a_ < x:
return float((a+b)/(2*n))
if a_ > x:
return float((a+b)/(2*n+2... | output | 1 | 32,959 | 22 | 65,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – ....
We know that the polyline passes through the point (a, b). Find minimum positive value x such that it is true or ... | instruction | 0 | 32,960 | 22 | 65,920 |
Tags: geometry, math
Correct Solution:
```
a,b = list(map(int,input().split()))
if b > a:
print(-1)
else:
try:
x= 100000000000
k = int((a+b)/2/b)
if k != 0:
x = (a+b)/2/k
k = int((a-b)/2/b)
if k != 0:
x = min(x,(a-b)/2/k)
print("%.9f"%x)
... | output | 1 | 32,960 | 22 | 65,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – ....
We know that the polyline passes through the point (a, b). Find minimum positive value x such that it is true or ... | instruction | 0 | 32,961 | 22 | 65,922 |
Tags: geometry, math
Correct Solution:
```
#!/usr/bin/env python3
import collections, itertools, fractions, functools, heapq, math, queue
def solve():
a, b = map(int, input().split())
if a < b:
return -1
return (a+b)/(2*((a+b)//(2*b)))
if __name__ == '__main__':
print(solve())
``` | output | 1 | 32,961 | 22 | 65,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – ....
We know that the polyline passes through the point (a, b). Find minimum positive value x such that it is true or ... | instruction | 0 | 32,962 | 22 | 65,924 |
Tags: geometry, math
Correct Solution:
```
# problem statement: https://codeforces.com/problemset/problem/578/A
coord = input()
a, b = list(map(int, coord.split()))
if b > a:
print(-1)
else:
sol1 = (a + b)/(2 * int((a+b)/(2*b)))
print(sol1)
``` | output | 1 | 32,962 | 22 | 65,925 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – ....
We know that the polyline passes through the point (a, b). Find minimum positive value x such that it is true or ... | instruction | 0 | 32,963 | 22 | 65,926 |
Tags: geometry, math
Correct Solution:
```
import sys
a, b = list(map(int, sys.stdin.readline().split()))
if b > a :
print(-1)
elif b == a:
print(a)
else:
t = (a+b)/(2*int((a+b)/b/2))
print(t)
``` | output | 1 | 32,963 | 22 | 65,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a polyline going through points (0, 0) – (x, x) – (2x, 0) – (3x, x) – (4x, 0) – ... - (2kx, 0) – (2kx + x, x) – ....
We know that the polyline passes through the point (a, b). Find mi... | instruction | 0 | 32,968 | 22 | 65,936 |
No | output | 1 | 32,968 | 22 | 65,937 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya studies divisibility rules at school. Here are some of them:
* Divisibility by 2. A number is divisible by 2 if and only if its last digit is divisible by 2 or in other words, is even.
* Divisibility by 3. A number is divisible by... | instruction | 0 | 33,629 | 22 | 67,258 |
Tags: math, number theory
Correct Solution:
```
b, d = map(int, input().split())
for i in range(1, 10):
if (b**i) % d == 0:
print("2-type")
print(i)
exit()
if (b-1) % d == 0:
print("3-type")
exit()
if (b+1) % d == 0:
print("11-type")
exit()
for i in range(2, d+1):
if d % ... | output | 1 | 33,629 | 22 | 67,259 |
Provide a correct Python 3 solution for this coding contest problem.
You survived several months of exam wars and were able to enter ICPC University on a sunny day. On the day of admission, there was an enthusiastic recruitment of circles on the campus of the university, and you received a large number of pamphlets an... | instruction | 0 | 34,207 | 22 | 68,414 |
"Correct Solution:
```
import math
def get_one_int()->int:
one_int = int(input())
return one_int
def make_divisors(num:int)->set:
divisors = set()
for i in range(1, math.floor(num ** 0.5) + 1):
if num % i == 0:
divisors.add(i)
divisors.add(num // i)
return divisors... | output | 1 | 34,207 | 22 | 68,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given two positive integers a and b. In one move you can increase a by 1 (replace a with a+1). Your task is to find the minimum number of moves you need to do in order to make a divisible by b. It is possible, that you have to make 0... | instruction | 0 | 34,422 | 22 | 68,844 |
Tags: math
Correct Solution:
```
def main():
n = int(input())
while n > 0:
a,b = [int(x) for x in input().split()]
c = (b - a%b) % b
print(c)
n = n - 1
if __name__ == '__main__':
main()
``` | output | 1 | 34,422 | 22 | 68,845 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.