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.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and n, inclusive.
Input
... | instruction | 0 | 75,341 | 22 | 150,682 |
Tags: number theory
Correct Solution:
```
import math
count = 0
n = int(input())
for i in range(1, n+1):
deevisor = 0
is_prime = [True] * (i+1)
is_prime[0], is_prime[1] = False, False
if i % 2 == 0: deevisor += 1
for x in range(3, math.ceil(i**1/2) + 1, 2):
if is_prime[x]:
if i %... | output | 1 | 75,341 | 22 | 150,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and n, inclusive.
Input
... | instruction | 0 | 75,342 | 22 | 150,684 |
Tags: number theory
Correct Solution:
```
def prime(k):
if k==1:
return False
else:
for i in range(2,k):
if k%i==0:
return False
return True
n=int(input())
e=0
t=1
a=0
for i in range(1,n+1):
for k in range(1,t+1):
if t%k==0 and prime(k)==True:
... | output | 1 | 75,342 | 22 | 150,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and n, inclusive.
Input
... | instruction | 0 | 75,343 | 22 | 150,686 |
Tags: number theory
Correct Solution:
```
n = int(input())
arr = [0] * (n + 1)
for i in range(2, n // 2 + 1):
if not arr[i]:
for j in range(2 * i, n + 1, i):
arr[j] += 1
print(arr.count(2))
``` | output | 1 | 75,343 | 22 | 150,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and n, inclusive.
Input
... | instruction | 0 | 75,344 | 22 | 150,688 |
Tags: number theory
Correct Solution:
```
import math
def pf_bool(m):
a=0
f=False
if m==14:
f=True
j=m
s=set()
if m%2==0:
a=1
s.add(2)
while m%2==0:
m=m//2
for i in range(2,j+1):
if m%i==0:
a+=1
if a>2:
return False
while m%i==0:
m=m//i
if a==2:
return True
return False
t= 1
fo... | output | 1 | 75,344 | 22 | 150,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers... | instruction | 0 | 75,345 | 22 | 150,690 |
Yes | output | 1 | 75,345 | 22 | 150,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers... | instruction | 0 | 75,346 | 22 | 150,692 |
Yes | output | 1 | 75,346 | 22 | 150,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers... | instruction | 0 | 75,347 | 22 | 150,694 |
Yes | output | 1 | 75,347 | 22 | 150,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers... | instruction | 0 | 75,348 | 22 | 150,696 |
Yes | output | 1 | 75,348 | 22 | 150,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers... | instruction | 0 | 75,349 | 22 | 150,698 |
No | output | 1 | 75,349 | 22 | 150,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers... | instruction | 0 | 75,350 | 22 | 150,700 |
No | output | 1 | 75,350 | 22 | 150,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers... | instruction | 0 | 75,351 | 22 | 150,702 |
No | output | 1 | 75,351 | 22 | 150,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers... | instruction | 0 | 75,352 | 22 | 150,704 |
No | output | 1 | 75,352 | 22 | 150,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It can be shown that any positive integer x can be uniquely represented as x = 1 + 2 + 4 + ... + 2k - 1 + r, where k and r are integers, k ≥ 0, 0 < r ≤ 2k. Let's call that representation prairie partition of x.
For example, the prairie part... | instruction | 0 | 75,553 | 22 | 151,106 |
Tags: binary search, constructive algorithms, greedy, math
Correct Solution:
```
from collections import Counter
from math import log2
powers = [2 ** p for p in range(64)]
def can():
near = Counter()
for num in set(nums):
p = int(log2(num))
near[p] += nums[num]
seq_cp = seqs - Counter()
... | output | 1 | 75,553 | 22 | 151,107 |
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 | 75,601 | 22 | 151,202 |
Tags: math, number theory
Correct Solution:
```
N = int(input())
P = [0 for _ in range(1000010)]
# store the largest prime factor of a number --> if number is prime, mark its multiples
for i in range(2, N):
if P[i] == 0:
for j in range(2*i, N+1, i):
P[j] = i
ans = 1000010
for i in range(N-P[N]+1... | output | 1 | 75,601 | 22 | 151,203 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's assume that
* v(n) is the largest prime number, that does not exceed n;
* u(n) is the smallest prime number strictly greater than n.
Find <image>.
Input
The first line contains integer t (1 ≤ t ≤ 500) — the number of testsc... | instruction | 0 | 76,206 | 22 | 152,412 |
Tags: math, number theory
Correct Solution:
```
T = int( input() )
MAX = 33000
bePrime = [0] * MAX;
primNum = []
for j in range(2, MAX):
if bePrime[j] == 0:
primNum.append( j )
i = j
while i < MAX:
bePrime[i] = 1
i = i + j
def isPrime( a ):
for j in primNum:
... | output | 1 | 76,206 | 22 | 152,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's assume that
* v(n) is the largest prime number, that does not exceed n;
* u(n) is the smallest prime number strictly greater than n.
Find <image>.
Input
The first line contains integer t (1 ≤ t ≤ 500) — the number of testsc... | instruction | 0 | 76,207 | 22 | 152,414 |
Tags: math, number theory
Correct Solution:
```
def isPrime(n):
i = 2
while i * i <= n:
if n % i == 0:
return False
i += 1
return True
def prevPrime(n):
while not isPrime(n):
n -= 1
return n
def nextPrime(n):
n += 1
while not isPrime(n):
n += 1
... | output | 1 | 76,207 | 22 | 152,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's assume that
* v(n) is the largest prime number, that does not exceed n;
* u(n) is the smallest prime number strictly greater than n.
Find <image>.
Input
The first line contains integer t (1 ≤ t ≤ 500) — the number of testsc... | instruction | 0 | 76,208 | 22 | 152,416 |
Tags: math, number theory
Correct Solution:
```
T = int( input() )
#for every prime x
#(b-a)/ab
#1/a-1/b
MAX = 33000
bePrime = [0] * MAX;
primNum = []
for j in range(2, MAX):
if bePrime[j] == 0:
primNum.append( j )
i = j
while i < MAX:
bePrime[i] = 1
i = i + j
d... | output | 1 | 76,208 | 22 | 152,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's assume that
* v(n) is the largest prime number, that does not exceed n;
* u(n) is the smallest prime number strictly greater than n.
Find <image>.
Input
The first line contains integer t (1 ≤ t ≤ 500) — the number of testsc... | instruction | 0 | 76,209 | 22 | 152,418 |
Tags: math, number theory
Correct Solution:
```
from math import gcd
def prime(n):
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
for i in range(int(input())):
n = int(input())
x = n
y = n + 1
while not prime(x):
x -= 1
while not... | output | 1 | 76,209 | 22 | 152,419 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's assume that
* v(n) is the largest prime number, that does not exceed n;
* u(n) is the smallest prime number strictly greater than n.
Find <image>.
Input
The first line contains integer t (1 ≤ t ≤ 500) — the number of testsc... | instruction | 0 | 76,210 | 22 | 152,420 |
Tags: math, number theory
Correct Solution:
```
def prime(n):
m = int(n ** 0.5) + 1
t = [1] * (n + 1)
for i in range(3, m):
if t[i]: t[i * i :: 2 * i] = [0] * ((n - i * i) // (2 * i) + 1)
return [2] + [i for i in range(3, n + 1, 2) if t[i]]
def gcd(a, b):
c = a % b
return gcd(b, c) if c... | output | 1 | 76,210 | 22 | 152,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that
* v(n) is the largest prime number, that does not exceed n;
* u(n) is the smallest prime number strictly greater than n.
Find <image>.
Input
The first line contains... | instruction | 0 | 76,211 | 22 | 152,422 |
No | output | 1 | 76,211 | 22 | 152,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that
* v(n) is the largest prime number, that does not exceed n;
* u(n) is the smallest prime number strictly greater than n.
Find <image>.
Input
The first line contains... | instruction | 0 | 76,212 | 22 | 152,424 |
No | output | 1 | 76,212 | 22 | 152,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that
* v(n) is the largest prime number, that does not exceed n;
* u(n) is the smallest prime number strictly greater than n.
Find <image>.
Input
The first line contains... | instruction | 0 | 76,213 | 22 | 152,426 |
No | output | 1 | 76,213 | 22 | 152,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's assume that
* v(n) is the largest prime number, that does not exceed n;
* u(n) is the smallest prime number strictly greater than n.
Find <image>.
Input
The first line contains... | instruction | 0 | 76,214 | 22 | 152,428 |
No | output | 1 | 76,214 | 22 | 152,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in any place in the array.
An array is co-prime if ... | instruction | 0 | 76,318 | 22 | 152,636 |
Tags: greedy, implementation, math, number theory
Correct Solution:
```
import math
num_de_elementos = int(input())
elementos = list(map(int,input().split())) + [1]
aux = []
cont = 0
for i in range(num_de_elementos):
aux.append(elementos[i])
if(math.gcd(elementos[i], elementos[i+1]) != 1):
aux.append(1)
c... | output | 1 | 76,318 | 22 | 152,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in any place in the array.
An array is co-prime if ... | instruction | 0 | 76,319 | 22 | 152,638 |
Tags: greedy, implementation, math, number theory
Correct Solution:
```
from fractions import gcd
n = int(input())
l = list(map(int, input().split()))
ans = 0
new = [l[0]]
for i in range(1, n):
if gcd(l[i], l[i - 1]) != 1:
ans += 1
new.append(1)
new.append(l[i])
print(ans)
print(*new)
``` | output | 1 | 76,319 | 22 | 152,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in any place in the array.
An array is co-prime if ... | instruction | 0 | 76,320 | 22 | 152,640 |
Tags: greedy, implementation, math, number theory
Correct Solution:
```
from fractions import gcd
def is_co_prime(x, y):
return gcd(x, y) != 1
def solve():
N = int(input())
L = list(map(int, input().split()))
ans = [str(L[0])]
x = 0
for i in range(1, N):
if is_co_prime(L[i], L[i - ... | output | 1 | 76,320 | 22 | 152,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in any place in the array.
An array is co-prime if ... | instruction | 0 | 76,321 | 22 | 152,642 |
Tags: greedy, implementation, math, number theory
Correct Solution:
```
def mdc(a, b):
if b == 0:
return a
else:
return mdc(b, a % b)
input()
lista = list(map(int, input().split()))
tamanhoIni = len(lista)
i = 0
while i < len(lista) - 1:
mdcPar = 1
if lista[i] > lista[i + 1]:
m... | output | 1 | 76,321 | 22 | 152,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in any place in the array.
An array is co-prime if ... | instruction | 0 | 76,322 | 22 | 152,644 |
Tags: greedy, implementation, math, number theory
Correct Solution:
```
def gcd(a, b):
if b == 0: return a
else: return gcd(b, a % b)
if __name__ == "__main__":
n = int(input())
A = list(map(int, input().split()))
ans, cnt = [A[0]], 0
for i in range(1, n):
if gcd(A[i], A[i - 1]) != 1:
... | output | 1 | 76,322 | 22 | 152,645 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in any place in the array.
An array is co-prime if ... | instruction | 0 | 76,323 | 22 | 152,646 |
Tags: greedy, implementation, math, number theory
Correct Solution:
```
# all number 1~1e9
def gcd(a,b):
while b != 0:
t = b
b = a % b
a = t
return a
def coprime(a,b):
if gcd(a,b) == 1:
return True
else:
return False
def isPrime(n):
if (n <= 1): return Fals... | output | 1 | 76,323 | 22 | 152,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in any place in the array.
An array is co-prime if ... | instruction | 0 | 76,324 | 22 | 152,648 |
Tags: greedy, implementation, math, number theory
Correct Solution:
```
import math
n = input()
numbers = list(map(int, input().split()))
i = 0
out = []
last_insert = 0
while i < len(numbers) - 1:
if math.gcd(numbers[i], numbers[i+1]) == 1:
if str(numbers[i]) != last_insert:
out.append(str(nu... | output | 1 | 76,324 | 22 | 152,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in any place in the array.
An array is co-prime if ... | instruction | 0 | 76,325 | 22 | 152,650 |
Tags: greedy, implementation, math, number theory
Correct Solution:
```
import math
n=int(input())
a=list(map(int,input().split()))
b=[]
for i in range(0,n-1):
b+=[a[i]]
if math.gcd(a[i],a[i+1])-1:
b+=[1]
b+=[a[-1]]
print(len(b)-n)
for i in b:
print(i,end=' ')
# Made By Mostafa_Khaled
... | output | 1 | 76,325 | 22 | 152,651 |
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 of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in an... | instruction | 0 | 76,326 | 22 | 152,652 |
Yes | output | 1 | 76,326 | 22 | 152,653 |
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 of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in an... | instruction | 0 | 76,327 | 22 | 152,654 |
Yes | output | 1 | 76,327 | 22 | 152,655 |
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 of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in an... | instruction | 0 | 76,328 | 22 | 152,656 |
Yes | output | 1 | 76,328 | 22 | 152,657 |
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 of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in an... | instruction | 0 | 76,329 | 22 | 152,658 |
Yes | output | 1 | 76,329 | 22 | 152,659 |
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 of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in an... | instruction | 0 | 76,330 | 22 | 152,660 |
No | output | 1 | 76,330 | 22 | 152,661 |
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 of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in an... | instruction | 0 | 76,331 | 22 | 152,662 |
No | output | 1 | 76,331 | 22 | 152,663 |
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 of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in an... | instruction | 0 | 76,332 | 22 | 152,664 |
No | output | 1 | 76,332 | 22 | 152,665 |
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 of n elements, you must make it a co-prime array in as few moves as possible.
In each move you can insert any positive integral number you want not greater than 109 in an... | instruction | 0 | 76,333 | 22 | 152,666 |
No | output | 1 | 76,333 | 22 | 152,667 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Author has gone out of the stories about Vasiliy, so here is just a formal task description.
You are given q queries and a multiset A, initially containing only integer 0. There are three types of queries:
1. "+ x" — add integer x to mul... | instruction | 0 | 76,334 | 22 | 152,668 |
Tags: binary search, bitmasks, data structures, trees
Correct Solution:
```
# 10
# + 8
# + 9
# + 11
# + 6
# + 1
# ? 3
# - 8
# ? 3
# ? 8
# ? 11
MAX_BIT = 30
class Node:
def __init__(self):
self.left = None
self.right = None
self.leftCnt = 0
self.rightCnt = 0
def AddRight(se... | output | 1 | 76,334 | 22 | 152,669 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Author has gone out of the stories about Vasiliy, so here is just a formal task description.
You are given q queries and a multiset A, initially containing only integer 0. There are three types of queries:
1. "+ x" — add integer x to mul... | instruction | 0 | 76,336 | 22 | 152,672 |
Tags: binary search, bitmasks, data structures, trees
Correct Solution:
```
import collections
max_bits = 30
#root = collections.Counter()
#vals = collections.defaultdict(int)
class BNode:
def __init__(self, ct=0, zero=None, one=None):
self.ct = ct
self.zero = None
self.one = None
def... | output | 1 | 76,336 | 22 | 152,673 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Author has gone out of the stories about Vasiliy, so here is just a formal task description.
You are given q queries and a multiset A, initially containing only integer 0. There are three types of queries:
1. "+ x" — add integer x to mul... | instruction | 0 | 76,337 | 22 | 152,674 |
Tags: binary search, bitmasks, data structures, trees
Correct Solution:
```
from collections import defaultdict
class Trie():
def __init__(self,value):
self.value = value
self.left = None
self.right = None
self.terminal = False
self.par = None
self.child = 0
... | output | 1 | 76,337 | 22 | 152,675 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Author has gone out of the stories about Vasiliy, so here is just a formal task description.
You are given q queries and a multiset A, initially containing only integer 0. There are three types of queries:
1. "+ x" — add integer x to mul... | instruction | 0 | 76,338 | 22 | 152,676 |
Tags: binary search, bitmasks, data structures, trees
Correct Solution:
```
class D: u, v, n = None, None, 0
p = [1 << 30 - j for j in range(31)]
def sub(d, y):
for j in p:
d = d.u if y & j else d.v
d.n -= 1
def add(d, y):
for j in p:
if not d.u: d.u, d.v = D(), D()
d = d.u if y ... | output | 1 | 76,338 | 22 | 152,677 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Author has gone out of the stories about Vasiliy, so here is just a formal task description.
You are given q queries and a multiset A, initially containing only integer 0. There are three types of queries:
1. "+ x" — add integer x to mul... | instruction | 0 | 76,339 | 22 | 152,678 |
Tags: binary search, bitmasks, data structures, trees
Correct Solution:
```
import sys
input = sys.stdin.readline
from collections import defaultdict
class Node:
def __init__(self):
self.cnt = 0
self.next = [None] * 2
root = Node()
def add(x):
root.cnt += 1
cur = root
for k in range(... | output | 1 | 76,339 | 22 | 152,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Author has gone out of the stories about Vasiliy, so here is just a formal task description.
You are given q queries and a multiset A, initially containing only integer 0. There are three types of queries:
1. "+ x" — add integer x to mul... | instruction | 0 | 76,340 | 22 | 152,680 |
Tags: binary search, bitmasks, data structures, trees
Correct Solution:
```
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO,IOBase
class Node:
def __init__(self):
self.zero = None
self.one = None
self.onpath = 0
class Trie:
def __init_... | output | 1 | 76,340 | 22 | 152,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Author has gone out of the stories about Vasiliy, so here is just a formal task description.
You are given q queries and a multiset A, initially containing only integer 0. There are three types of queries:
1. "+ x" — add integer x to mul... | instruction | 0 | 76,341 | 22 | 152,682 |
Tags: binary search, bitmasks, data structures, trees
Correct Solution:
```
#!/usr/bin/env pypy3
import sys
class BitTreeNode(object):
__slots__ = ["left", "right", "count"]
def __init__(self, cnt):
self.left = None
self.right = None
self.count = cnt
class BitTree(object):
de... | output | 1 | 76,341 | 22 | 152,683 |
Provide a correct Python 3 solution for this coding contest problem.
Find the number of sequences of length K consisting of positive integers such that the product of any two adjacent elements is at most N, modulo 10^9+7.
Constraints
* 1\leq N\leq 10^9
* ~~1~~ 2\leq K\leq 100 (fixed at 21:33 JST)
* N and K are integ... | instruction | 0 | 76,509 | 22 | 153,018 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque, Counter, defaultdict
def getN():
return int(input())
def getList():
return list(map(int, input().split()))
import math
import copy
import bisect
MOD = 10**9 + 7
from logging import getLogge... | output | 1 | 76,509 | 22 | 153,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While doing some spring cleaning, Daniel found an old calculator that he loves so much. However, it seems like it is broken. When he tries to compute 1 + 3 using the calculator, he gets 2 instead of 4. But when he tries computing 1 + 4, he g... | instruction | 0 | 76,832 | 22 | 153,664 |
Tags: bitmasks, brute force, combinatorics, dp
Correct Solution:
```
def get_bin (a):
nums=[]
for i in range (32):
if ((1<<i)&a):
nums.append(1)
else:
nums.append(0)
while(len(nums)>0 and nums[-1]==0):
nums.pop()
return nums
dp={}
def get_num (... | output | 1 | 76,832 | 22 | 153,665 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While doing some spring cleaning, Daniel found an old calculator that he loves so much. However, it seems like it is broken. When he tries to compute 1 + 3 using the calculator, he gets 2 instead of 4. But when he tries computing 1 + 4, he g... | instruction | 0 | 76,833 | 22 | 153,666 |
Tags: bitmasks, brute force, combinatorics, dp
Correct Solution:
```
def solve(L, R):
res = 0
for i in range(32):
for j in range(32):
l = (L >> i) << i
r = (R >> j) << j
#print(l, r)
if l>>i&1==0 or r>>j&1==0:
continue
l -= 1<<i... | output | 1 | 76,833 | 22 | 153,667 |
Provide tags and a correct Python 3 solution for this coding contest problem.
While doing some spring cleaning, Daniel found an old calculator that he loves so much. However, it seems like it is broken. When he tries to compute 1 + 3 using the calculator, he gets 2 instead of 4. But when he tries computing 1 + 4, he g... | instruction | 0 | 76,834 | 22 | 153,668 |
Tags: bitmasks, brute force, combinatorics, dp
Correct Solution:
```
def g( a , b ):
cur = 1
res = 0
ze = 0
while cur <= b:
if b & cur:
b ^= cur
if a & b == 0:
res += ( 1 << ze )
if a & cur == 0:
ze = ze + 1
cur <<= 1
return... | output | 1 | 76,834 | 22 | 153,669 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.