message stringlengths 2 433k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 113 108k | cluster float64 12 12 | __index_level_0__ int64 226 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time.
He... | instruction | 0 | 98,177 | 12 | 196,354 |
Tags: greedy, math
Correct Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
# sys.setrecursionlimit(10**6)
from collections import Counter
def check(l):
prev=l[0]
for i in range(1,len(l)):
if l[i]... | output | 1 | 98,177 | 12 | 196,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring elements would be distinct in a finite time.
He... | instruction | 0 | 98,178 | 12 | 196,356 |
Tags: greedy, math
Correct Solution:
```
n = int(input())
l1 = [int(num) for num in input().split(' ')]
l2 = list(set(l1))
l3 = []
for i in l2:
l3.append(l1.count(i))
if n == 1:
print("YES")
else:
if len(l2) == 1:
print("NO")
else:
if sum(l3) % 2 == 0:
if max(l3) <= sum(l3) /... | output | 1 | 98,178 | 12 | 196,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring e... | instruction | 0 | 98,179 | 12 | 196,358 |
Yes | output | 1 | 98,179 | 12 | 196,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring e... | instruction | 0 | 98,180 | 12 | 196,360 |
Yes | output | 1 | 98,180 | 12 | 196,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring e... | instruction | 0 | 98,181 | 12 | 196,362 |
Yes | output | 1 | 98,181 | 12 | 196,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring e... | instruction | 0 | 98,182 | 12 | 196,364 |
Yes | output | 1 | 98,182 | 12 | 196,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring e... | instruction | 0 | 98,183 | 12 | 196,366 |
No | output | 1 | 98,183 | 12 | 196,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring e... | instruction | 0 | 98,184 | 12 | 196,368 |
No | output | 1 | 98,184 | 12 | 196,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring e... | instruction | 0 | 98,185 | 12 | 196,370 |
No | output | 1 | 98,185 | 12 | 196,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Yaroslav has an array that consists of n integers. In one second Yaroslav can swap two neighboring array elements. Now Yaroslav is wondering if he can obtain an array where any two neighboring e... | instruction | 0 | 98,186 | 12 | 196,372 |
No | output | 1 | 98,186 | 12 | 196,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We'll call an array of n non-negative integers a[1], a[2], ..., a[n] interesting, if it meets m constraints. The i-th of the m constraints consists of three integers li, ri, qi (1 ≤ li ≤ ri ≤ n) meaning that value <image> should be equal to ... | instruction | 0 | 98,231 | 12 | 196,462 |
Tags: constructive algorithms, data structures, trees
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
from io import BytesIO, IOBase
import sys
from collections import defaultdict, deque, Counter
from math import sqrt, pi, ceil, log, inf, gcd, floor
from itertools import c... | output | 1 | 98,231 | 12 | 196,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We'll call an array of n non-negative integers a[1], a[2], ..., a[n] interesting, if it meets m constraints. The i-th of the m constraints consists of three integers li, ri, qi (1 ≤ li ≤ ri ≤ n) meaning that value <image> should be equal to ... | instruction | 0 | 98,232 | 12 | 196,464 |
Tags: constructive algorithms, data structures, trees
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
from io import BytesIO, IOBase
import sys
from collections import defaultdict, deque, Counter
from math import sqrt, pi, ceil, log, inf, gcd, floor
from itertools import c... | output | 1 | 98,232 | 12 | 196,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We'll call an array of n non-negative integers a[1], a[2], ..., a[n] interesting, if it meets m constraints. The i-th of the m constraints consists of three integers li, ri, qi (1 ≤ li ≤ ri ≤ n) meaning that value <image> should be equal to ... | instruction | 0 | 98,233 | 12 | 196,466 |
Tags: constructive algorithms, data structures, trees
Correct Solution:
```
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
def main():
n,m = map(int,input().split())
dp = [[0]*30 for _ in range(n+2)]
op = []
for _ in range(m):
op.appen... | output | 1 | 98,233 | 12 | 196,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such that <image>, where <image> is bitw... | instruction | 0 | 98,295 | 12 | 196,590 |
Tags: brute force, math, number theory
Correct Solution:
```
_, n=map(int,input().split())
m={}
ans=0
for x in map(int, input().split()):
ans+=m.get(x^n,0)
m[x]=m.get(x,0)+1
print(ans)
``` | output | 1 | 98,295 | 12 | 196,591 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such that <image>, where <image> is bitw... | instruction | 0 | 98,296 | 12 | 196,592 |
Tags: brute force, math, number theory
Correct Solution:
```
n, x = map(int, input().split())
l, res = [0] * 131073, 0
for a in map(int, input().split()):
res, l[a] = res + l[a ^ x], l[a] + 1
print(res)
``` | output | 1 | 98,296 | 12 | 196,593 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such that <image>, where <image> is bitw... | instruction | 0 | 98,297 | 12 | 196,594 |
Tags: brute force, math, number theory
Correct Solution:
```
a,b = map(int,input().split())
lista = list(map(int,input().split()))
n=0
d = dict()
for x in lista:
# get(a,b) retorna b se n tiver a chave a
n += d.get(x^b,0)
d[x] = d.get(x,0)+1
print(n)
``` | output | 1 | 98,297 | 12 | 196,595 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such that <image>, where <image> is bitw... | instruction | 0 | 98,298 | 12 | 196,596 |
Tags: brute force, math, number theory
Correct Solution:
```
n,x = map(int,input().split())
lis = list(map(int,input().split()))
ans=0
has=[0]*(1000000)
for i in lis:
has[i]+=1
ans=0
if x==0:
for i in range(1000000):
ans+=((has[i])*(has[i]-1))//2
else:
for i in range(n):
a=lis[i]^x
# prin... | output | 1 | 98,298 | 12 | 196,597 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such that <image>, where <image> is bitw... | instruction | 0 | 98,299 | 12 | 196,598 |
Tags: brute force, math, number theory
Correct Solution:
```
n, x = map(int, input().split())
arr = list(map(int, input().split()))
b = [0] * int(2e5)
for i in arr:
b[i] += 1
res = 0
for i in arr:
r = i ^ x
res += b[r]
if x == 0:
res -= len(arr)
print(res // 2)
``` | output | 1 | 98,299 | 12 | 196,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such that <image>, where <image> is bitw... | instruction | 0 | 98,300 | 12 | 196,600 |
Tags: brute force, math, number theory
Correct Solution:
```
a,b = map(int,input().split())
lst = list(map(int,input().split()))
n=0
dct = {}
for x in lst:
n += dct.get(x^b,0)
dct[x] = dct.get(x,0)+1
print(n)
``` | output | 1 | 98,300 | 12 | 196,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such that <image>, where <image> is bitw... | instruction | 0 | 98,301 | 12 | 196,602 |
Tags: brute force, math, number theory
Correct Solution:
```
n, x=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
ax=[i^x for i in a]
a.sort()
ax.sort()
pos=0
posx=0
c=1
cx=1
total=0
while pos<n and posx<n:
if a[pos]==ax[posx]:
if pos<n-1 and a[pos+1]==a[pos]:
pos+=1
c+=1
elif posx<n-1... | output | 1 | 98,301 | 12 | 196,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < j ≤ n) such that <image>, where <image> is bitw... | instruction | 0 | 98,302 | 12 | 196,604 |
Tags: brute force, math, number theory
Correct Solution:
```
#http://codeforces.com/problemset/problem/742/B
#works but is too slow
def sum(x):
return int(x*(x+1)/2)
from collections import Counter
from math import factorial
answer = 0
seen = {}
ri = input()
ri = ri.split()
n = int(ri[0])
x = int(ri[1])
ri = input()
... | output | 1 | 98,302 | 12 | 196,605 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < ... | instruction | 0 | 98,303 | 12 | 196,606 |
Yes | output | 1 | 98,303 | 12 | 196,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < ... | instruction | 0 | 98,304 | 12 | 196,608 |
Yes | output | 1 | 98,304 | 12 | 196,609 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < ... | instruction | 0 | 98,305 | 12 | 196,610 |
Yes | output | 1 | 98,305 | 12 | 196,611 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < ... | instruction | 0 | 98,306 | 12 | 196,612 |
Yes | output | 1 | 98,306 | 12 | 196,613 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < ... | instruction | 0 | 98,307 | 12 | 196,614 |
No | output | 1 | 98,307 | 12 | 196,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < ... | instruction | 0 | 98,308 | 12 | 196,616 |
No | output | 1 | 98,308 | 12 | 196,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < ... | instruction | 0 | 98,309 | 12 | 196,618 |
No | output | 1 | 98,309 | 12 | 196,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are some beautiful girls in Arpa’s land as mentioned before.
Once Arpa came up with an obvious problem:
Given an array and a number x, count the number of pairs of indices i, j (1 ≤ i < ... | instruction | 0 | 98,310 | 12 | 196,620 |
No | output | 1 | 98,310 | 12 | 196,621 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and define it as occ(num). Then t is dominated (by v) if... | instruction | 0 | 98,726 | 12 | 197,452 |
Tags: greedy, implementation, sortings, strings, two pointers
Correct Solution:
```
tc = int(input())
for ii in range(tc):
n = int(input())
ar = list(map(int,input().split()))
if n==1:
print(-1)
continue
x = dict()
m = float('inf')
c = 0
for i in range(n):
if ar[i] in... | output | 1 | 98,726 | 12 | 197,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and define it as occ(num). Then t is dominated (by v) if... | instruction | 0 | 98,727 | 12 | 197,454 |
Tags: greedy, implementation, sortings, strings, two pointers
Correct Solution:
```
import math
t=int(input())
for _ in range(t):
n=int(input())
a=list(map(int,input().split()))
d={}
ans=math.inf
for i in range(n):
if a[i] not in d:
d[a[i]]=i
else:
ans=min(ans... | output | 1 | 98,727 | 12 | 197,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and define it as occ(num). Then t is dominated (by v) if... | instruction | 0 | 98,728 | 12 | 197,456 |
Tags: greedy, implementation, sortings, strings, two pointers
Correct Solution:
```
t = int(input())
while t != 0:
n = int(input())
l = list(map(int, input().strip().split()))
dic = {}
for index, i in enumerate(l):
if i not in dic:
dic[i] = list()
dic[i].append(index)
... | output | 1 | 98,728 | 12 | 197,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and define it as occ(num). Then t is dominated (by v) if... | instruction | 0 | 98,729 | 12 | 197,458 |
Tags: greedy, implementation, sortings, strings, two pointers
Correct Solution:
```
t = int(input())
for i in range(t):
n = int(input())
nums = list(map(int, input().split()))
i = 0
j = 0
min_len = 100010
sub = set()
while i < n and j < n:
sub_len = len(sub)
sub.add(nums[j])
if len(sub) == sub_len:
mi... | output | 1 | 98,729 | 12 | 197,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and define it as occ(num). Then t is dominated (by v) if... | instruction | 0 | 98,730 | 12 | 197,460 |
Tags: greedy, implementation, sortings, strings, two pointers
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
mark = [-1]*(200001)
dist = 200001
for i in range(n):
if mark[a[i]] == -1:
mark[a[i]] = i
else:
... | output | 1 | 98,730 | 12 | 197,461 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and define it as occ(num). Then t is dominated (by v) if... | instruction | 0 | 98,731 | 12 | 197,462 |
Tags: greedy, implementation, sortings, strings, two pointers
Correct Solution:
```
a = int(input())
for i in range(a):
b = int(input())
lst = list(map(int, input().split()))
c = b+1
d = [-1]*(b+1)
for t in range(b):
if d[lst[t]] != -1:
c = min(c, t-d[lst[t]]+1)
d[lst[t]]... | output | 1 | 98,731 | 12 | 197,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and define it as occ(num). Then t is dominated (by v) if... | instruction | 0 | 98,732 | 12 | 197,464 |
Tags: greedy, implementation, sortings, strings, two pointers
Correct Solution:
```
import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
li = {}
for i in range(n):
if a[i] not in li:
li[a[i]] = [i]
el... | output | 1 | 98,732 | 12 | 197,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and define it as occ(num). Then t is dominated (by v) if... | instruction | 0 | 98,733 | 12 | 197,466 |
Tags: greedy, implementation, sortings, strings, two pointers
Correct Solution:
```
T = int(input())
results = []
for i in range(T):
n = int(input())
vals = input().split()
a = [int(val) for val in vals]
if len(a) < 2:
results.append(-1)
else:
d = {}
minLen = -1
# key: number, val: lastPos
... | output | 1 | 98,733 | 12 | 197,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and defin... | instruction | 0 | 98,734 | 12 | 197,468 |
Yes | output | 1 | 98,734 | 12 | 197,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and defin... | instruction | 0 | 98,735 | 12 | 197,470 |
Yes | output | 1 | 98,735 | 12 | 197,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and defin... | instruction | 0 | 98,736 | 12 | 197,472 |
Yes | output | 1 | 98,736 | 12 | 197,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and defin... | instruction | 0 | 98,737 | 12 | 197,474 |
Yes | output | 1 | 98,737 | 12 | 197,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and defin... | instruction | 0 | 98,738 | 12 | 197,476 |
No | output | 1 | 98,738 | 12 | 197,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and defin... | instruction | 0 | 98,739 | 12 | 197,478 |
No | output | 1 | 98,739 | 12 | 197,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and defin... | instruction | 0 | 98,740 | 12 | 197,480 |
No | output | 1 | 98,740 | 12 | 197,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an array t dominated by value v in the next situation.
At first, array t should have at least 2 elements. Now, let's calculate number of occurrences of each number num in t and defin... | instruction | 0 | 98,741 | 12 | 197,482 |
No | output | 1 | 98,741 | 12 | 197,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anu has created her own function f: f(x, y) = (x | y) - y where | denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). For example, f(11, 6) = (11|6) - 6 = 15 - 6 = 9. It can be proved that for any nonnegat... | instruction | 0 | 98,742 | 12 | 197,484 |
Tags: brute force, greedy, math
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
bitFreq = [0] * 32
for i in a :
for j in range(0,32):
if (i & (1 << j)) > 0 :
bitFreq[j] += 1
currBest = 0
currIn = 0
for i in range(len(a)):
currScore = 0
for j in range(0,32):
... | output | 1 | 98,742 | 12 | 197,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anu has created her own function f: f(x, y) = (x | y) - y where | denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). For example, f(11, 6) = (11|6) - 6 = 15 - 6 = 9. It can be proved that for any nonnegat... | instruction | 0 | 98,743 | 12 | 197,486 |
Tags: brute force, greedy, math
Correct Solution:
```
from math import ceil
def mlt(): return map(int, input().split())
x = int(input())
s = list(mlt())
cur = 1 << 32
fst = -1
while cur:
ct = 0
tm = -1
for n in s:
if n & cur:
ct += 1
tm = n
if ct == 1:
fst = tm... | output | 1 | 98,743 | 12 | 197,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anu has created her own function f: f(x, y) = (x | y) - y where | denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). For example, f(11, 6) = (11|6) - 6 = 15 - 6 = 9. It can be proved that for any nonnegat... | instruction | 0 | 98,744 | 12 | 197,488 |
Tags: brute force, greedy, math
Correct Solution:
```
n=int(input())
pw = [2**(30-i) for i in range(31)]
def kek(x):
global pw
#x=int(x)
ans=set()
mind=0
for i in range(31):
pwi=pw[i]
if pwi<=x:
x-=pwi
ans.add(pwi)
return ans
ra=list(map(int,input().split(... | output | 1 | 98,744 | 12 | 197,489 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anu has created her own function f: f(x, y) = (x | y) - y where | denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). For example, f(11, 6) = (11|6) - 6 = 15 - 6 = 9. It can be proved that for any nonnegat... | instruction | 0 | 98,745 | 12 | 197,490 |
Tags: brute force, greedy, math
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
ans=[]
for i in range(32,-1,-1):
flag=-1
badflag=0
for j in range(n):
if a[j]&1<<i:
if flag==-1:
flag=j
else:
badflag=1
if badflag==1:... | output | 1 | 98,745 | 12 | 197,491 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anu has created her own function f: f(x, y) = (x | y) - y where | denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). For example, f(11, 6) = (11|6) - 6 = 15 - 6 = 9. It can be proved that for any nonnegat... | instruction | 0 | 98,746 | 12 | 197,492 |
Tags: brute force, greedy, math
Correct Solution:
```
from sys import stdin
from bisect import bisect_left as bl
from bisect import bisect_right as br
def input():
return stdin.readline()[:-1]
def intput():
return int(input())
def sinput():
return input().split()
def intsput():
return map(int, si... | output | 1 | 98,746 | 12 | 197,493 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.