message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 276 109k | cluster float64 23 23 | __index_level_0__ int64 552 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the given set (x, y):
* point (x', y') is (x, y)'s ... | instruction | 0 | 102,318 | 23 | 204,636 |
Tags: implementation
Correct Solution:
```
l=[]
count=0
for _ in range(int(input())):
l.append(list(map(int,input().split())))
for i in l:
top=[]
bottom=[]
left=[]
right=[]
for j in l:
if i is not j:
if i[0]==j[0] and i[1]>j[1]:
bottom.append(j)
el... | output | 1 | 102,318 | 23 | 204,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the given set (x, y):
* point (x', y') is (x, y)'s ... | instruction | 0 | 102,319 | 23 | 204,638 |
Tags: implementation
Correct Solution:
```
n=int(input())
a=[]
for i in range(0,n):
a.append([int(j)for j in input().split()])
flag=0
for i in range(0,n):
c1=0
c2=0
c3=0
c4=0
for j in range(0,n):
if i!=j:
if a[i][0]<a[j][0]and a[i][1]==a[j][1]:
c1+=1
... | output | 1 | 102,319 | 23 | 204,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the given set (x, y):
* point (x', y') is (x, y)'s ... | instruction | 0 | 102,320 | 23 | 204,640 |
Tags: implementation
Correct Solution:
```
n = int(input())
points = []
for j in range(n):
x,y = map(int,input().split())
points.append([x,y])
count = 0
for j in range(n):
corr = points[j]
lower,upper,left,right = False,False,False,False
for k in range(n):
value = points[k]
if(value[... | output | 1 | 102,320 | 23 | 204,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the given set (x, y):
* point (x', y') is (x, y)'s ... | instruction | 0 | 102,321 | 23 | 204,642 |
Tags: implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Tue Aug 18 23:27:19 2020
@author: Tanmay
"""
# -*- coding: utf-8 -*-
"""
Created on Tue Aug 18 22:29:52 2020
@author: Tanmay
"""
from collections import OrderedDict
leflis=[]
rightlis=[]
checkl=[]
lis=[]
n=int(input())
for i in range(... | output | 1 | 102,321 | 23 | 204,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the given set (x, y):
* point (x', y') is (x, y)'s ... | instruction | 0 | 102,322 | 23 | 204,644 |
Tags: implementation
Correct Solution:
```
# Bismillahi-R-Rahmani-R-Rahim
"""
Created on Mon Jul 13 19:15:39 2020
@author: Samiul2651
"""
a = int(input())
x = []
y = []
i = 0
while i < a:
c,d = input().split(" ")
x.insert(i,int(c))
y.insert(i,int(d))
i += 1
i = 0
b = 0
while i < a:
j = 0
l = 0
... | output | 1 | 102,322 | 23 | 204,645 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the given set (x, y):
* point (x', y') is (x, y)'s ... | instruction | 0 | 102,323 | 23 | 204,646 |
Tags: implementation
Correct Solution:
```
# coding: utf-8
n = int(input())
li = []
for i in range(n):
li.append([int(j) for j in input().split()])
lx = {}
ly = {}
for p in li:
if p[1] in lx.keys():
if p[0]>lx[p[1]][1]:
lx[p[1]][1] = p[0]
elif p[0]<lx[p[1]][0]:
lx[p[1]][0... | output | 1 | 102,323 | 23 | 204,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the given set (x, y):
* point (x', y') is (x, y)'s ... | instruction | 0 | 102,324 | 23 | 204,648 |
Tags: implementation
Correct Solution:
```
l=int(input()); n=set([]); a=set([]); b=set([]); t=0
for i in range(l):
(c,d)=tuple(int(j) for j in input().split())
n.add((c,d)); a.add(c); b.add(d)
for c in n:
(l,r)=c; p=0; ok=False
for i in a:
if i<l and (i,r) in n: ok=True; p+=1; break;
for i... | output | 1 | 102,324 | 23 | 204,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the give... | instruction | 0 | 102,325 | 23 | 204,650 |
Yes | output | 1 | 102,325 | 23 | 204,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the give... | instruction | 0 | 102,326 | 23 | 204,652 |
Yes | output | 1 | 102,326 | 23 | 204,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the give... | instruction | 0 | 102,327 | 23 | 204,654 |
Yes | output | 1 | 102,327 | 23 | 204,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the give... | instruction | 0 | 102,328 | 23 | 204,656 |
Yes | output | 1 | 102,328 | 23 | 204,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the give... | instruction | 0 | 102,329 | 23 | 204,658 |
No | output | 1 | 102,329 | 23 | 204,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the give... | instruction | 0 | 102,330 | 23 | 204,660 |
No | output | 1 | 102,330 | 23 | 204,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the give... | instruction | 0 | 102,331 | 23 | 204,662 |
No | output | 1 | 102,331 | 23 | 204,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1, y1), (x2, y2), ..., (xn, yn). Let's define neighbors for some fixed point from the give... | instruction | 0 | 102,332 | 23 | 204,664 |
No | output | 1 | 102,332 | 23 | 204,665 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the area of the square whose side is the hypotenuse... | instruction | 0 | 102,367 | 23 | 204,734 |
Tags: brute force, math
Correct Solution:
```
import timeit
from math import floor,sqrt, gcd
def checkFloat(x):
check = x - floor(x)
if check == 0:
return True
return False
limit = int(input())
count = 0
# start = timeit.default_timer()
for n in range(1, int(sqrt(limit)) + 1):
for m in rang... | output | 1 | 102,367 | 23 | 204,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the area of the square whose side is the hypotenuse... | instruction | 0 | 102,368 | 23 | 204,736 |
Tags: brute force, math
Correct Solution:
```
from math import sqrt
n=int(input())
count=0
for i in range(1,n+1):
for j in range(i,n+1):
c = sqrt(i**2 + j**2)
if c == int(c) and c<=n:
count+=1
print(count)
``` | output | 1 | 102,368 | 23 | 204,737 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the area of the square whose side is the hypotenuse... | instruction | 0 | 102,369 | 23 | 204,738 |
Tags: brute force, math
Correct Solution:
```
import math
l = int(input())
ans = 0
for n in range(1, 10000):
for m in range(n + 1, 10000):
if m > l:
break
if math.gcd(n, m) != 1 or (n%2 and m%2):
continue
a = m**2 - n**2
b = 2 * m * n
c = m**2 + n*... | output | 1 | 102,369 | 23 | 204,739 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the area of the square whose side is the hypotenuse... | instruction | 0 | 102,370 | 23 | 204,740 |
Tags: brute force, math
Correct Solution:
```
# https://codeforces.com/problemset/problem/304/A
"""
Count how many right angled triangles with side length a, b, c satisfies
1 <= a <= b <= c <= n
Researching Primitive PTs (PPT) we deduce that we just need to construct PPTs and count how far we can extend them.
Euclid'... | output | 1 | 102,370 | 23 | 204,741 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the area of the square whose side is the hypotenuse... | instruction | 0 | 102,371 | 23 | 204,742 |
Tags: brute force, math
Correct Solution:
```
n=int(input())
dic={}
for i in range(1,n+1):
dic[i*i]=0
ans=0
for i in range(1,n+1):
for j in range(i,n+1):
if (i*i)+(j*j) in dic:
ans+=1
print(ans)
``` | output | 1 | 102,371 | 23 | 204,743 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the area of the square whose side is the hypotenuse... | instruction | 0 | 102,372 | 23 | 204,744 |
Tags: brute force, math
Correct Solution:
```
from math import *
n = int(input())
s = 0
for i in range(5,n+1):
for j in range(1,i):
u = i*i - j*j
if(sqrt(u) == int(sqrt(u))):
s += 1
print(s//2)
``` | output | 1 | 102,372 | 23 | 204,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the area of the square whose side is the hypotenuse... | instruction | 0 | 102,373 | 23 | 204,746 |
Tags: brute force, math
Correct Solution:
```
# A. Pythagorean Theorem II
import math
n = int(input())
def solve(n):
pairs = 0
for i in range(1, n):
for j in range(i+1, n):
sm = math.sqrt(i ** 2 + j ** 2)
if sm == int(sm) and n >= sm:
pairs += 1
return pairs... | output | 1 | 102,373 | 23 | 204,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the area of the square whose side is the hypotenuse... | instruction | 0 | 102,374 | 23 | 204,748 |
Tags: brute force, math
Correct Solution:
```
import sys
input = lambda: sys.stdin.readline().strip("\r\n")
import math
n = int(input())
ls = [i+1 for i in range(n)]
for i in range(n):
ls[i] = ls[i] ** 2
alpha = set(ls)
ans = 0
for i in range(n):
for j in range(i+1, n):
if ls[i] + ls[j] in alpha:
... | output | 1 | 102,374 | 23 | 204,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the ... | instruction | 0 | 102,375 | 23 | 204,750 |
Yes | output | 1 | 102,375 | 23 | 204,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the ... | instruction | 0 | 102,376 | 23 | 204,752 |
Yes | output | 1 | 102,376 | 23 | 204,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the ... | instruction | 0 | 102,377 | 23 | 204,754 |
Yes | output | 1 | 102,377 | 23 | 204,755 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the ... | instruction | 0 | 102,378 | 23 | 204,756 |
Yes | output | 1 | 102,378 | 23 | 204,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the ... | instruction | 0 | 102,379 | 23 | 204,758 |
No | output | 1 | 102,379 | 23 | 204,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the ... | instruction | 0 | 102,380 | 23 | 204,760 |
No | output | 1 | 102,380 | 23 | 204,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the ... | instruction | 0 | 102,381 | 23 | 204,762 |
No | output | 1 | 102,381 | 23 | 204,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:
In any right-angled triangle, the ... | instruction | 0 | 102,382 | 23 | 204,764 |
No | output | 1 | 102,382 | 23 | 204,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths correspond... | instruction | 0 | 102,534 | 23 | 205,068 |
Tags: math, number theory
Correct Solution:
```
import math as m
n = int(input())
n = n ** 2
if n <= 4:
print(-1)
elif n % 4 > 0:
print(n // 2, n // 2 + 1)
else:
print(n // 4 - 1, n // 4 + 1)
``` | output | 1 | 102,534 | 23 | 205,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths correspond... | instruction | 0 | 102,535 | 23 | 205,070 |
Tags: math, number theory
Correct Solution:
```
import time
t1=time.time()
n=int(input())
f=0
if n==987654323:
print(487730530870294164,487730530870294165)
f=1
elif n==999999937:
print(499999937000001984,499999937000001985)
f=1
elif n==433494437:
print(93958713454973484,93958713454973485)
f=1
el... | output | 1 | 102,535 | 23 | 205,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths correspond... | instruction | 0 | 102,536 | 23 | 205,072 |
Tags: math, number theory
Correct Solution:
```
n=int(input())
if n<3:
print ("-1")
elif n*n%4:
print(n*n//2,n*n//2+1)
else:
print(n*n//4-1,n*n//4+1)
``` | output | 1 | 102,536 | 23 | 205,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths correspond... | instruction | 0 | 102,537 | 23 | 205,074 |
Tags: math, number theory
Correct Solution:
```
n = int(input()) ** 2
print(*(-1,) if n < 9 else (n // 2, n // 2 + 1) if n & 1 else(n // 4 - 1, n // 4 + 1))
``` | output | 1 | 102,537 | 23 | 205,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths correspond... | instruction | 0 | 102,538 | 23 | 205,076 |
Tags: math, number theory
Correct Solution:
```
a = int(input())
def solve(a):
if a <= 2: return None
if a % 2:
x, y = a//2, a//2 + 1
return (2*x*y, x*x + y*y)
else:
x, y = a//2, 1
return (x*x - y*y, x*x + y*y)
A = solve(a)
if A is None:
print(-1)
else:
print(A[0], A... | output | 1 | 102,538 | 23 | 205,077 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths correspond... | instruction | 0 | 102,539 | 23 | 205,078 |
Tags: math, number theory
Correct Solution:
```
n=int(input().strip())
if n<=2:
print(-1)
else:
if n%2==0:
n=(n//2)**2
print(n-1,n+1)
else:
a=n//2
b=a+1
print(2*a*b,a**2+b**2)
``` | output | 1 | 102,539 | 23 | 205,079 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths correspond... | instruction | 0 | 102,540 | 23 | 205,080 |
Tags: math, number theory
Correct Solution:
```
k = int(input())
if k <= 2:
print('-1')
elif k % 2:
x = (k - 1) // 2
print(2 * x * (x + 1), x ** 2 + (x + 1) ** 2)
else:
x = k ** 2 // 4
print(x - 1, x + 1)
``` | output | 1 | 102,540 | 23 | 205,081 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths correspond... | instruction | 0 | 102,541 | 23 | 205,082 |
Tags: math, number theory
Correct Solution:
```
import math
n=int(input())
if(n<3):
print(-1)
quit()
if(n%2):
a=n
b=(a**2-1)//2
c=b+1
print(b,c)
else:
a=n
b=(a//2)**2-1
c=b+2
print(b,c)
# else:
# print(int(a),c)
``` | output | 1 | 102,541 | 23 | 205,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a rig... | instruction | 0 | 102,542 | 23 | 205,084 |
Yes | output | 1 | 102,542 | 23 | 205,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a rig... | instruction | 0 | 102,543 | 23 | 205,086 |
Yes | output | 1 | 102,543 | 23 | 205,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a rig... | instruction | 0 | 102,544 | 23 | 205,088 |
Yes | output | 1 | 102,544 | 23 | 205,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a rig... | instruction | 0 | 102,545 | 23 | 205,090 |
Yes | output | 1 | 102,545 | 23 | 205,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a rig... | instruction | 0 | 102,546 | 23 | 205,092 |
No | output | 1 | 102,546 | 23 | 205,093 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a rig... | instruction | 0 | 102,547 | 23 | 205,094 |
No | output | 1 | 102,547 | 23 | 205,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a rig... | instruction | 0 | 102,548 | 23 | 205,096 |
No | output | 1 | 102,548 | 23 | 205,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a rig... | instruction | 0 | 102,549 | 23 | 205,098 |
No | output | 1 | 102,549 | 23 | 205,099 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a following process.
There is a platform with n columns. 1 × 1 squares are appearing one after another in some columns on this platform. If there are no squares in the column, a square will occupy the bottom row. Otherwise a ... | instruction | 0 | 102,657 | 23 | 205,314 |
Tags: implementation
Correct Solution:
```
n, m = map(int, input().split())
c = list(map(int, input().split()))
print(min( [ c.count(x) for x in range(1, n+1) ] ))
``` | output | 1 | 102,657 | 23 | 205,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a following process.
There is a platform with n columns. 1 × 1 squares are appearing one after another in some columns on this platform. If there are no squares in the column, a square will occupy the bottom row. Otherwise a ... | instruction | 0 | 102,658 | 23 | 205,316 |
Tags: implementation
Correct Solution:
```
n,m=input().split();n=int(n)
c=list(map(int,input().split()))
print(min(c.count(x) for x in range(1,n+1)))
``` | output | 1 | 102,658 | 23 | 205,317 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a following process.
There is a platform with n columns. 1 × 1 squares are appearing one after another in some columns on this platform. If there are no squares in the column, a square will occupy the bottom row. Otherwise a ... | instruction | 0 | 102,659 | 23 | 205,318 |
Tags: implementation
Correct Solution:
```
n,m=map(int,input().split())
c=[0]*(n+1)
for d in list(map(int,input().split())):
c[d]+=1
print(min(c[1:]))
``` | output | 1 | 102,659 | 23 | 205,319 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.