message stringlengths 2 22.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 145 109k | cluster float64 9 9 | __index_level_0__ int64 290 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K of these sections has a strawberry on top of each of them... | instruction | 0 | 80,627 | 9 | 161,254 |
"Correct Solution:
```
import bisect
h,w,k=map(int,input().split())
s=["."*(w+2)]+["."+input()+"." for i in range(h)]+["."*(w+2)]
l=[[0]*(w+2) for i in range(h+2)]
ans=1
for i in range(1,h+1):
for j in range(1,w+1):
if s[i][j]=='#':
l[i][j]=ans
ans+=1
A=1
ss=[]
for i in rang... | output | 1 | 80,627 | 9 | 161,255 |
Provide a correct Python 3 solution for this coding contest problem.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K of these sections has a strawberry on top of each of them... | instruction | 0 | 80,628 | 9 | 161,256 |
"Correct Solution:
```
h, w, k = map(int, input().split())
s = []
for i in range(h) :
s.append(list(input()))
tmp = 0
ichigoFlag = False
for i in range(h) :
for j in range(w) :
if s[i][j] == '#' :
tmp += 1
ichigoFlag = True
s[i][j] = tmp
elif ichigoFlag ==... | output | 1 | 80,628 | 9 | 161,257 |
Provide a correct Python 3 solution for this coding contest problem.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K of these sections has a strawberry on top of each of them... | instruction | 0 | 80,629 | 9 | 161,258 |
"Correct Solution:
```
h, w, k = map(int, input().split())
cake = [[0 for _ in range(w)] for _ in range(h)]
cnt = 0
flg = True
for i in range(h):
s = input()
if '#' not in s:
continue
rowflg = True
for j in range(w):
if s[j] == '#':
cnt += 1
rowflg = False
if rowflg:
cake[i][j] = c... | output | 1 | 80,629 | 9 | 161,259 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K o... | instruction | 0 | 80,630 | 9 | 161,260 |
Yes | output | 1 | 80,630 | 9 | 161,261 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K o... | instruction | 0 | 80,631 | 9 | 161,262 |
Yes | output | 1 | 80,631 | 9 | 161,263 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K o... | instruction | 0 | 80,632 | 9 | 161,264 |
Yes | output | 1 | 80,632 | 9 | 161,265 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K o... | instruction | 0 | 80,633 | 9 | 161,266 |
Yes | output | 1 | 80,633 | 9 | 161,267 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K o... | instruction | 0 | 80,634 | 9 | 161,268 |
No | output | 1 | 80,634 | 9 | 161,269 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K o... | instruction | 0 | 80,635 | 9 | 161,270 |
No | output | 1 | 80,635 | 9 | 161,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K o... | instruction | 0 | 80,636 | 9 | 161,272 |
No | output | 1 | 80,636 | 9 | 161,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chokudai made a rectangular cake for contestants in DDCC 2020 Finals.
The cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \times W equal sections. K o... | instruction | 0 | 80,637 | 9 | 161,274 |
No | output | 1 | 80,637 | 9 | 161,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia stat... | instruction | 0 | 81,108 | 9 | 162,216 |
Tags: greedy
Correct Solution:
```
def fun(n,m,li):
li=sorted(li)
x=[]
for i in range(m-n+1):
x.append(li[n-1+i]-li[i])
print(min(x))
n,m=list(map(lambda x :int(x),input().split()))
li=list(map(lambda x :int(x),input().split()))
fun(n,m,li)
``` | output | 1 | 81,108 | 9 | 162,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia stat... | instruction | 0 | 81,109 | 9 | 162,218 |
Tags: greedy
Correct Solution:
```
n, m = map(int, input().split(' '))
f = list(map(int, input().split(' ')))
f.sort()
puzzles_to_discard = m - n
if puzzles_to_discard == 0:
least_possible_difference = f[-1] - f[0]
else:
least_possible_difference = 999999
i = 0
while (i <= puzzles_to_discard):
difference_be... | output | 1 | 81,109 | 9 | 162,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia stat... | instruction | 0 | 81,110 | 9 | 162,220 |
Tags: greedy
Correct Solution:
```
n,p=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
c,m=0,10000000000000
for i in range(p):
for j in range(i+n-1,p):
c=a[j]-a[i]
if(c<m):
m=c
print(m)
``` | output | 1 | 81,110 | 9 | 162,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia stat... | instruction | 0 | 81,111 | 9 | 162,222 |
Tags: greedy
Correct Solution:
```
m, n = list(map(int, input().split()))
data = list(map(int, input().split()))
data.sort()
def get_diff(d):
return d[-1] - d[0]
minn = data[-1]-data[0]
for i in range(n - m+1):
if get_diff(data[i:m+i]) < minn:
minn = get_diff(data[i:m+i])
print(minn)
``` | output | 1 | 81,111 | 9 | 162,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia stat... | instruction | 0 | 81,112 | 9 | 162,224 |
Tags: greedy
Correct Solution:
```
nm = list(map(int, input().split()))
n = nm[0]
m = nm[1]
l = list(map(int, input().split()))
l.sort()
i = 0
j = n-1
result = 1000
while(j < len(l)):
result = min(result, l[j]-l[i])
i+=1
j+=1
print(result)
``` | output | 1 | 81,112 | 9 | 162,225 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia stat... | instruction | 0 | 81,113 | 9 | 162,226 |
Tags: greedy
Correct Solution:
```
I= lambda:map(int,input().split())
n,m = I()
a=sorted(I())
diff = []
for i,j in zip(a,a[n-1:]):
diff.append(j-i)
print(min(diff))
``` | output | 1 | 81,113 | 9 | 162,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia stat... | instruction | 0 | 81,114 | 9 | 162,228 |
Tags: greedy
Correct Solution:
```
n,m=[int(i)for i in input().split()]
g=sorted([int(i)for i in input().split()])
leastsofar=float('inf')
for x in range(n-1,m):
c=g[x]-g[x-n+1]
# print(g[x],g[x-n+1],c)
if c < leastsofar:
leastsofar = c
# print(g)
print(leastsofar)
``` | output | 1 | 81,114 | 9 | 162,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of them a jigsaw puzzle (which, as wikipedia stat... | instruction | 0 | 81,115 | 9 | 162,230 |
Tags: greedy
Correct Solution:
```
# Aditya Morankar
def main():
n,m = list(map(int, input().split()))
lst = list(map(int, input().split()))
lst.sort()
minn = 9999999
start=0
end = n-1
for i in range(n-1,m):
diff = lst[end]-lst[start]
if diff < minn:
... | output | 1 | 81,115 | 9 | 162,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of... | instruction | 0 | 81,116 | 9 | 162,232 |
Yes | output | 1 | 81,116 | 9 | 162,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of... | instruction | 0 | 81,117 | 9 | 162,234 |
Yes | output | 1 | 81,117 | 9 | 162,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of... | instruction | 0 | 81,118 | 9 | 162,236 |
Yes | output | 1 | 81,118 | 9 | 162,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of... | instruction | 0 | 81,119 | 9 | 162,238 |
Yes | output | 1 | 81,119 | 9 | 162,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of... | instruction | 0 | 81,120 | 9 | 162,240 |
No | output | 1 | 81,120 | 9 | 162,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of... | instruction | 0 | 81,121 | 9 | 162,242 |
No | output | 1 | 81,121 | 9 | 162,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of... | instruction | 0 | 81,122 | 9 | 162,244 |
No | output | 1 | 81,122 | 9 | 162,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye present for her n students and give each of... | instruction | 0 | 81,123 | 9 | 162,246 |
No | output | 1 | 81,123 | 9 | 162,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing ... | instruction | 0 | 81,137 | 9 | 162,274 |
Yes | output | 1 | 81,137 | 9 | 162,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing ... | instruction | 0 | 81,138 | 9 | 162,276 |
Yes | output | 1 | 81,138 | 9 | 162,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing ... | instruction | 0 | 81,139 | 9 | 162,278 |
Yes | output | 1 | 81,139 | 9 | 162,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing ... | instruction | 0 | 81,140 | 9 | 162,280 |
Yes | output | 1 | 81,140 | 9 | 162,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing ... | instruction | 0 | 81,141 | 9 | 162,282 |
No | output | 1 | 81,141 | 9 | 162,283 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing ... | instruction | 0 | 81,142 | 9 | 162,284 |
No | output | 1 | 81,142 | 9 | 162,285 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing ... | instruction | 0 | 81,143 | 9 | 162,286 |
No | output | 1 | 81,143 | 9 | 162,287 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub helps his grandfather at the farm. Today he must milk the cows. There are n cows sitting in a row, numbered from 1 to n from left to right. Each cow is either facing to the left or facing ... | instruction | 0 | 81,144 | 9 | 162,288 |
No | output | 1 | 81,144 | 9 | 162,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone.
In this game, the phone's sc... | instruction | 0 | 81,153 | 9 | 162,306 |
Yes | output | 1 | 81,153 | 9 | 162,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone.
In this game, the phone's sc... | instruction | 0 | 81,154 | 9 | 162,308 |
Yes | output | 1 | 81,154 | 9 | 162,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone.
In this game, the phone's sc... | instruction | 0 | 81,155 | 9 | 162,310 |
Yes | output | 1 | 81,155 | 9 | 162,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone.
In this game, the phone's sc... | instruction | 0 | 81,156 | 9 | 162,312 |
Yes | output | 1 | 81,156 | 9 | 162,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone.
In this game, the phone's sc... | instruction | 0 | 81,157 | 9 | 162,314 |
No | output | 1 | 81,157 | 9 | 162,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone.
In this game, the phone's sc... | instruction | 0 | 81,158 | 9 | 162,316 |
No | output | 1 | 81,158 | 9 | 162,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone.
In this game, the phone's sc... | instruction | 0 | 81,159 | 9 | 162,318 |
No | output | 1 | 81,159 | 9 | 162,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Quite recently, a very smart student named Jury decided that lectures are boring, so he downloaded a game called "Black Square" on his super cool touchscreen phone.
In this game, the phone's sc... | instruction | 0 | 81,160 | 9 | 162,320 |
No | output | 1 | 81,160 | 9 | 162,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Have you ever tasted Martian food? Well, you should.
Their signature dish is served on a completely black plate with the radius of R, flat as a pancake.
First, they put a perfectly circular portion of the Golden Honduras on the plate. It h... | instruction | 0 | 81,343 | 9 | 162,686 |
Tags: geometry
Correct Solution:
```
#!/usr/bin/env python3
def solve(R,r,k):
# Thanks to Numberphile's "Epic circles" video
# Use the formula for radii of circles in Pappus chain
r = r / R
n = k
answer = ((1-r)*r)/(2*((n**2)*((1-r)**2)+r))
# Note that in a Pappus chain the diameter of the circle is 1, so ... | output | 1 | 81,343 | 9 | 162,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ann and Borya have n piles with candies and n is even number. There are ai candies in pile with number i.
Ann likes numbers which are square of some integer and Borya doesn't like numbers which are square of any integer. During one move guy... | instruction | 0 | 81,388 | 9 | 162,776 |
Tags: constructive algorithms, greedy
Correct Solution:
```
perfectsquares=set(x**2 for x in range(10**5+1))
N=int(input())
array=[int(x) for x in input().split()]
squares,notsquares=[0,0]
squarelist=[]
notsquarelist=[]
for i in array:
if i in perfectsquares:
squares+=1
squarelist.append(i)
else:
notsquares+=1... | output | 1 | 81,388 | 9 | 162,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ann and Borya have n piles with candies and n is even number. There are ai candies in pile with number i.
Ann likes numbers which are square of some integer and Borya doesn't like numbers which are square of any integer. During one move guy... | instruction | 0 | 81,389 | 9 | 162,778 |
Tags: constructive algorithms, greedy
Correct Solution:
```
import math
def check_square(n):
return min((math.ceil(n**0.5))**2 - n, n - math.floor(n**0.5)**2)
k = int(input())
s = input()
L = s.split(" ")
L = [int(n) for n in L]
sq = []
nonsq = []
for e in L:
if check_square(e) == 0:
sq.append(e)
... | output | 1 | 81,389 | 9 | 162,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ann and Borya have n piles with candies and n is even number. There are ai candies in pile with number i.
Ann likes numbers which are square of some integer and Borya doesn't like numbers which are square of any integer. During one move guy... | instruction | 0 | 81,390 | 9 | 162,780 |
Tags: constructive algorithms, greedy
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 12 03:06:53 2018
@author: Sand Boa
"""
import math
sop=[]
ans=0
def findclosestsquare(a):
x=[]
for i in a:
s=i**0.5
s=round(s)
x.append((abs(s**2-i),i))
return x
cases = int(in... | output | 1 | 81,390 | 9 | 162,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ann and Borya have n piles with candies and n is even number. There are ai candies in pile with number i.
Ann likes numbers which are square of some integer and Borya doesn't like numbers which are square of any integer. During one move guy... | instruction | 0 | 81,391 | 9 | 162,782 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n = int(input())
a = [int(i) for i in input().split()]
b, v, ans = [], [], 0
for i in a:
c = int(i ** (1 / 2))
if c * c == i:
b.append(i)
else:
v.append(min(i - c * c, (c + 1) * (c + 1) - i))
b.sort(reverse=True)
v.sort()
for i in r... | output | 1 | 81,391 | 9 | 162,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ann and Borya have n piles with candies and n is even number. There are ai candies in pile with number i.
Ann likes numbers which are square of some integer and Borya doesn't like numbers which are square of any integer. During one move guy... | instruction | 0 | 81,392 | 9 | 162,784 |
Tags: constructive algorithms, greedy
Correct Solution:
```
#for i in range(int(input())):
import math
n=int(input())
arr=list(map(int,input().split()))
e=0
o=0
cnt=[]
d=[]
for i in range(n):
var=int(math.sqrt(arr[i]))
if var**2==arr[i] or (var+1)**2==arr[i]:
e+=1
else:
o+=1
d.app... | output | 1 | 81,392 | 9 | 162,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ann and Borya have n piles with candies and n is even number. There are ai candies in pile with number i.
Ann likes numbers which are square of some integer and Borya doesn't like numbers which are square of any integer. During one move guy... | instruction | 0 | 81,393 | 9 | 162,786 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n=int(input())
L=list(map(int,input().split()))
def getkey(item):
return item[1]
def getKey(item):
return item[0]
def finds(n):
rac=n**(1/2)
rac=int(rac)
p=rac**2
q=(rac+1)**2
return(min(abs(n-q),abs(n-p)))
D=[]
for i in range(len(L)):
D.append... | output | 1 | 81,393 | 9 | 162,787 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.