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.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting with 1). A median of an array (2, 6, 1, 2, 3) is ... | instruction | 0 | 87,850 | 12 | 175,700 |
Tags: greedy, math, sortings
Correct Solution:
```
def main():
def m(a):
return (len(a) + 1) // 2 - 1
from bisect import insort
(n, x) = map(int, input().split(' '))
a = list(sorted(list(map(int, input().split(' ')))))
if x not in a:
insort(a, x)
while a[m(a)] != x:
if a[... | output | 1 | 87,850 | 12 | 175,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting with 1). A median of an array (2, 6, 1, 2, 3) is ... | instruction | 0 | 87,851 | 12 | 175,702 |
Tags: greedy, math, sortings
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd =... | output | 1 | 87,851 | 12 | 175,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting with 1). A median of an array (2, 6, 1, 2, 3) is ... | instruction | 0 | 87,852 | 12 | 175,704 |
Tags: greedy, math, sortings
Correct Solution:
```
import sys
import bisect
input = lambda: sys.stdin.readline().strip("\r\n")
n, x = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ans = 0
while a[(len(a)-1)//2] != x:
a.append(x)
a.sort()
ans += 1
print(ans)
``` | output | 1 | 87,852 | 12 | 175,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting with 1). A median of an array (2, 6, 1, 2, 3) is ... | instruction | 0 | 87,853 | 12 | 175,706 |
Tags: greedy, math, sortings
Correct Solution:
```
import math
n,x=map(int,input().split())
a=list(map(int,input().split()))
new=0
if(a.count(x)==0):
a.append(x)
new+=1
a.sort()
index=0
dest=(n+1)//2
best=1000
val=0
n=len(a)
for i in range(n):
if(a[i]==x):
d=abs(dest-(i+1))
if(d<best):
... | output | 1 | 87,853 | 12 | 175,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting with 1). A median of an array (2, 6, 1, 2, 3) is ... | instruction | 0 | 87,854 | 12 | 175,708 |
Tags: greedy, math, sortings
Correct Solution:
```
n,x = map(int,input().split())
a = [int(x) for x in input().split()]
ans = 0
if x not in a:
ans += 1
a.append(x)
a.sort()
n = len(a)
while x != a[(n+1)//2 - 1]:
if x < a[(n+1)//2 - 1]:
a.append(1)
a.sort()
ans+=1
else:
a.... | output | 1 | 87,854 | 12 | 175,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting with 1). A median of an array (2, 6, 1, 2, 3) is ... | instruction | 0 | 87,855 | 12 | 175,710 |
Tags: greedy, math, sortings
Correct Solution:
```
def median(n,m,li):
count = 0
while True:
li.sort()
if li[(n+1)//2 -1]== m:
return count
li.append(m)
n+=1
count+=1
n,m = input().split()
li = [int(x) for x in input().split()]
print(median(int(n),int(m),li))
``` | output | 1 | 87,855 | 12 | 175,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting with 1). A median of an array (2, 6, 1, 2, 3) is ... | instruction | 0 | 87,856 | 12 | 175,712 |
Tags: greedy, math, sortings
Correct Solution:
```
import bisect
I=lambda:map(int,input().split())
n,x=I()
a,s=sorted(I()),0
while a[(n-1)//2]!=x:
a.insert(bisect.bisect_right(a,x),x)
s+=1
n+=1
print(s)
``` | output | 1 | 87,856 | 12 | 175,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting wi... | instruction | 0 | 87,857 | 12 | 175,714 |
Yes | output | 1 | 87,857 | 12 | 175,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting wi... | instruction | 0 | 87,858 | 12 | 175,716 |
Yes | output | 1 | 87,858 | 12 | 175,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting wi... | instruction | 0 | 87,859 | 12 | 175,718 |
Yes | output | 1 | 87,859 | 12 | 175,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting wi... | instruction | 0 | 87,860 | 12 | 175,720 |
Yes | output | 1 | 87,860 | 12 | 175,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting wi... | instruction | 0 | 87,861 | 12 | 175,722 |
No | output | 1 | 87,861 | 12 | 175,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting wi... | instruction | 0 | 87,862 | 12 | 175,724 |
No | output | 1 | 87,862 | 12 | 175,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting wi... | instruction | 0 | 87,863 | 12 | 175,726 |
No | output | 1 | 87,863 | 12 | 175,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A median in an array with the length of n is an element which occupies position number <image> after we sort the elements in the non-decreasing order (the array elements are numbered starting wi... | instruction | 0 | 87,864 | 12 | 175,728 |
No | output | 1 | 87,864 | 12 | 175,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order.
Ivan wrote out integers 2a1, 2a2, ..., 2an on a piece of paper. Now he wonders, what minimum number of integ... | instruction | 0 | 87,883 | 12 | 175,766 |
Tags: greedy, implementation
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
b=0
c=0
d=0
for i in range(1,n):
if a[i]!=a[i-1]:
c+=1-(i-b+d)%2
d=(i-b+d)//2
j=a[i-1]+1
while j<a[i] and d>0:
c+=1-d%2
d//=2
j+=1
c+=a[i]-j
... | output | 1 | 87,883 | 12 | 175,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order.
Ivan wrote out integers 2a1, 2a2, ..., 2an on a piece of paper. Now he wonders, what minimum number of integ... | instruction | 0 | 87,884 | 12 | 175,768 |
Tags: greedy, implementation
Correct Solution:
```
n=int(input())
a=map(int,input().split())
st=set()
for e in a :
while(e in st):
st.remove(e)
e+=1
st.add(e)
print(max(st)-len(st)+1)
``` | output | 1 | 87,884 | 12 | 175,769 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order.
Ivan wrote out integers 2a1, 2a2, ..., 2an on a piece of paper. Now he wonders, what minimum number of integ... | instruction | 0 | 87,885 | 12 | 175,770 |
Tags: greedy, implementation
Correct Solution:
```
from heapq import heapify, heappush, heappop
n = int(input())
a = list(map(int, input().split()))
q = []; cnt = 1; d = {}
for i in range(1, n):
if a[i] == a[i-1]:
cnt += 1
else:
q.append(a[i-1])
d[a[i-1]] = cnt
cnt = 1
... | output | 1 | 87,885 | 12 | 175,771 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order.
Ivan wrote out integers 2a1, 2a2, ..., 2an on a piece of paper. Now he wonders, what minimum number of integ... | instruction | 0 | 87,886 | 12 | 175,772 |
Tags: greedy, implementation
Correct Solution:
```
# array de indices em ordem crescente
# quantos 2**b precisa para 2**v-1 (soma de sequencia)
import math
def main():
n = int(input())
a = input().split()
a = [int(x) for x in a]
p = 0
carry = 0
ok = 0
while p<n:
count = carry
... | output | 1 | 87,886 | 12 | 175,773 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order.
Ivan wrote out integers 2a1, 2a2, ..., 2an on a piece of paper. Now he wonders, what minimum number of integ... | instruction | 0 | 87,887 | 12 | 175,774 |
Tags: greedy, implementation
Correct Solution:
```
from sys import stdin, stdout
inputIdx = 0;
input = stdin.read().strip().split();
def nextToken():
global inputIdx, input;
token = input[inputIdx];
inputIdx += 1;
return token;
def main():
global inputIdx, input;
while inputIdx < len(input):
n = int(... | output | 1 | 87,887 | 12 | 175,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order.
Ivan wrote out integers 2a1, 2a2, ..., 2an on a piece of paper. Now he wonders, what minimum number of integ... | instruction | 0 | 87,888 | 12 | 175,776 |
Tags: greedy, implementation
Correct Solution:
```
n = int(input())
seq = [int(x) for x in input().split()]
def inseri(s, n):
if n in s:
s.remove(n)
inseri(s, n+1)
else:
s.add(n)
s = set()
for i in seq:
inseri(s, i)
m = max(s)
print(m-len(s)+1)
``` | output | 1 | 87,888 | 12 | 175,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order.
Ivan wrote out integers 2a1, 2a2, ..., 2an on a piece of paper. Now he wonders, what minimum number of integ... | instruction | 0 | 87,889 | 12 | 175,778 |
Tags: greedy, implementation
Correct Solution:
```
input()
now = alc = ans = 0
for v in map(int, input().split()):
while alc and now != v:
ans += not (alc & 1)
alc >>= 1
now += 1
ans += v - now
alc += 1
now = v
else:
while alc:
ans += not (alc & 1)
alc >>= 1
p... | output | 1 | 87,889 | 12 | 175,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has got an array of n non-negative integers a1, a2, ..., an. Ivan knows that the array is sorted in the non-decreasing order.
Ivan wrote out integers 2a1, 2a2, ..., 2an on a piece of paper. Now he wonders, what minimum number of integ... | instruction | 0 | 87,890 | 12 | 175,780 |
Tags: greedy, implementation
Correct Solution:
```
from sys import stdin
N = int(stdin.readline())
num = set()
for b in map(int, stdin.readline().split()):
while b in num:
num.remove(b)
b += 1
num.add(b)
print(max(num) - len(num) + 1)
``` | output | 1 | 87,890 | 12 | 175,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.fl... | instruction | 0 | 88,016 | 12 | 176,032 |
Tags: constructive algorithms, interactive
Correct Solution:
```
from collections import defaultdict
for ik in range(int(input())):
n=int(input())
d=defaultdict(str)
if n==1:
print("! 1 1",flush=True)
continue
elif n==2:
print("? 1 2",flush=True)
s=input()
if s=="... | output | 1 | 88,016 | 12 | 176,033 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.fl... | instruction | 0 | 88,017 | 12 | 176,034 |
Tags: constructive algorithms, interactive
Correct Solution:
```
import sys
T = int(input())
def compare(l,r,arr):
print('?',a[l]+1,a[r]+1)
sys.stdout.flush()
res = input()
if (res == '>'): return 1;
else: return 0;
while (T > 0):
T -= 1
Max_a = []
Min_a = []
n = int(input())
... | output | 1 | 88,017 | 12 | 176,035 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.fl... | instruction | 0 | 88,018 | 12 | 176,036 |
Tags: constructive algorithms, interactive
Correct Solution:
```
import sys
def f(arr):
mn, mx = [], []
for i in range(len(arr) // 2):
print('?', arr[2*i], arr[2*i + 1])
sys.stdout.flush()
if input() == '>':
mn.append(arr[2*i + 1])
mx.append(arr[2*i])
els... | output | 1 | 88,018 | 12 | 176,037 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.fl... | instruction | 0 | 88,019 | 12 | 176,038 |
Tags: constructive algorithms, interactive
Correct Solution:
```
from sys import stdin, stdout
from math import sin, tan, cos
def ask(i, j):
stdout.write('? ' + str(i) + ' ' + str(j) + '\n')
stdout.flush()
return stdin.readline().strip()
T = int(stdin.readline())
for t in range(T):
n = int(stdin.rea... | output | 1 | 88,019 | 12 | 176,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.fl... | instruction | 0 | 88,020 | 12 | 176,040 |
Tags: constructive algorithms, interactive
Correct Solution:
```
# Online Python compiler (interpreter) to run Python online.
# Write Python 3 code in this online editor and run it.
# Online Python compiler (interpreter) to run Python online.
# Write Python 3 code in this online editor and run it.
import sys
def obtai... | output | 1 | 88,020 | 12 | 176,041 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.fl... | instruction | 0 | 88,021 | 12 | 176,042 |
Tags: constructive algorithms, interactive
Correct Solution:
```
"""
Author - Satwik Tiwari .
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
impor... | output | 1 | 88,021 | 12 | 176,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.fl... | instruction | 0 | 88,022 | 12 | 176,044 |
Tags: constructive algorithms, interactive
Correct Solution:
```
import sys
def f(arr):
mn, mx = [], []
for i in range(len(arr) // 2):
print('?', arr[2*i], arr[2*i + 1])
sys.stdout.flush()
if input() == '>':
mn.append(arr[2*i + 1])
mx.append(arr[2*i])
els... | output | 1 | 88,022 | 12 | 176,045 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.fl... | instruction | 0 | 88,023 | 12 | 176,046 |
Tags: constructive algorithms, interactive
Correct Solution:
```
from sys import stdin, stdout
#input = stdin.buffer.readline
#print = stdout.write
def ask(i, j):
print('?', i + 1, j + 1, flush=True)
s = input()
if s == '<':
return -1
if s == '=':
return 0
return 1
def ans(i, j):
print('!', i + 1, j + 1, fl... | output | 1 | 88,023 | 12 | 176,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pasca... | instruction | 0 | 88,024 | 12 | 176,048 |
Yes | output | 1 | 88,024 | 12 | 176,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pasca... | instruction | 0 | 88,025 | 12 | 176,050 |
Yes | output | 1 | 88,025 | 12 | 176,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pasca... | instruction | 0 | 88,026 | 12 | 176,052 |
Yes | output | 1 | 88,026 | 12 | 176,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pasca... | instruction | 0 | 88,027 | 12 | 176,054 |
No | output | 1 | 88,027 | 12 | 176,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pasca... | instruction | 0 | 88,028 | 12 | 176,056 |
No | output | 1 | 88,028 | 12 | 176,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pasca... | instruction | 0 | 88,029 | 12 | 176,058 |
No | output | 1 | 88,029 | 12 | 176,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem. You have to use flush operation right after printing each line. For example, in C++ you should use function fflush(stdout), in Java — System.out.flush(), in Pasca... | instruction | 0 | 88,030 | 12 | 176,060 |
No | output | 1 | 88,030 | 12 | 176,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that x = y2.
Input
The first line contains a sing... | instruction | 0 | 88,083 | 12 | 176,166 |
Tags: brute force, implementation, math
Correct Solution:
```
n = int(input())
a = [int(i)for i in input().split()]
a = sorted(a)
max_ = 0
for i in range(n):
if a[i] >= 0:
if a[i]**0.5 != int(a[i]**0.5):
max_ = a[i]
if max_ != 0:
print(max_)
else:
for i in range(n):
if a[i] < 0:
... | output | 1 | 88,083 | 12 | 176,167 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that x = y2.
Input
The first line contains a sing... | instruction | 0 | 88,084 | 12 | 176,168 |
Tags: brute force, implementation, math
Correct Solution:
```
import math
n = int(input())
p = list(map(int, input().split()))
def s(n, p):
if n == 1:
print(p[0])
return
elif max(p) < 0:
print(max(p))
return
while math.sqrt(max(p)) == int(math.sqrt(max(p))):
p.remove... | output | 1 | 88,084 | 12 | 176,169 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that x = y2.
Input
The first line contains a sing... | instruction | 0 | 88,085 | 12 | 176,170 |
Tags: brute force, implementation, math
Correct Solution:
```
import math
x=int(input())
l=list(map(int,input().split()))
k={}
for i in l:
k[i]=(abs(i)**0.5)
f=[]
for i in l:
if i<0:
f.append(i)
for i in k.keys():
if k[i]%1==0:
pass
else:
f.append(i)
print(max(f))
``` | output | 1 | 88,085 | 12 | 176,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that x = y2.
Input
The first line contains a sing... | instruction | 0 | 88,086 | 12 | 176,172 |
Tags: brute force, implementation, math
Correct Solution:
```
from math import sqrt
n = int(input())
l = list(map(int,input().split()))
max1=-float("inf")
for i in range(n):
if l[i]<0 or (sqrt(l[i]))!=int(sqrt(l[i])):
if l[i]>max1:
max1=l[i]
print(max1)
``` | output | 1 | 88,086 | 12 | 176,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that x = y2.
Input
The first line contains a sing... | instruction | 0 | 88,087 | 12 | 176,174 |
Tags: brute force, implementation, math
Correct Solution:
```
from math import sqrt, floor
int(input())
for n in sorted(map(int, input().split()))[::-1]:
if abs(n) != n:
print(n)
break
elif floor(sqrt(n)) - sqrt(n) != 0:
print(n)
break
``` | output | 1 | 88,087 | 12 | 176,175 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that x = y2.
Input
The first line contains a sing... | instruction | 0 | 88,088 | 12 | 176,176 |
Tags: brute force, implementation, math
Correct Solution:
```
import math
n=int(input())
x=list(map(int,input().split()))
#arr=sorted(x)
count=-1000001
for i in range(n):
if((x[i]<0) or (math.sqrt(x[i])!=int(math.sqrt(x[i])))):
count=max(count,x[i])
print(count)
``` | output | 1 | 88,088 | 12 | 176,177 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that x = y2.
Input
The first line contains a sing... | instruction | 0 | 88,089 | 12 | 176,178 |
Tags: brute force, implementation, math
Correct Solution:
```
import math
def perfect_square(x):
if x<0:
return False
else:
y=x**(1/2)
if y-math.floor(y)==0.0:
return True
not_perfect_square_list=[]
n=int(input())
if 1<=n<=1000:
lis=list(map(int,input().split()))
if l... | output | 1 | 88,089 | 12 | 176,179 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that x = y2.
Input
The first line contains a sing... | instruction | 0 | 88,090 | 12 | 176,180 |
Tags: brute force, implementation, math
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
s = {i*i for i in range(1001)}
print(max([i for i in a if i not in s]))
``` | output | 1 | 88,090 | 12 | 176,181 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given an array a1, a2, ..., an of n integers, find the largest number in the array that is not a perfect square.
A number x is said to be a perfect square if there exists an integer y such that... | instruction | 0 | 88,092 | 12 | 176,184 |
Yes | output | 1 | 88,092 | 12 | 176,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We guessed a permutation p consisting of n integers. The permutation of length n is the array of length n where each element from 1 to n appears exactly once. This permutation is a secret for you.
For each position r from 2 to n we chose so... | instruction | 0 | 88,543 | 12 | 177,086 |
Tags: brute force, constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import copy
t = int(input())
def fn(ivs, v, n):
result = list()
while len(result) < n - 1:
w = None
for iv in ivs:
if v in iv:
iv.remove(v)
if len(iv) == 1:
if w is No... | output | 1 | 88,543 | 12 | 177,087 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We guessed a permutation p consisting of n integers. The permutation of length n is the array of length n where each element from 1 to n appears exactly once. This permutation is a secret for you.
For each position r from 2 to n we chose so... | instruction | 0 | 88,544 | 12 | 177,088 |
Tags: brute force, constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import io
import os
from collections import defaultdict
from copy import deepcopy
def solve(N, segments):
def greedy(ans, memToSeg, first):
# If a number is only in a single segment, it's either th... | output | 1 | 88,544 | 12 | 177,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We guessed a permutation p consisting of n integers. The permutation of length n is the array of length n where each element from 1 to n appears exactly once. This permutation is a secret for you.
For each position r from 2 to n we chose so... | instruction | 0 | 88,545 | 12 | 177,090 |
Tags: brute force, constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
from collections import Counter
from itertools import chain
def dfs(n, r, hint_sets, count, removed, result):
if len(result) == n - 1:
last = (set(range(1, n + 1)) - set(result)).pop()
result.... | output | 1 | 88,545 | 12 | 177,091 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.