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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a n × m field consisting only of periods ('.') and asterisks ('*'). Your task is to count all right triangles with two sides parallel to the square sides, whose vertices are in the... | instruction | 0 | 99,049 | 23 | 198,098 |
Yes | output | 1 | 99,049 | 23 | 198,099 |
Provide a correct Python 3 solution for this coding contest problem.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The following conditions must be met when attaching tiles.
* Do... | instruction | 0 | 99,416 | 23 | 198,832 |
"Correct Solution:
```
h, w = map(int, input().split())
a, b = map(int, input().split())
print(h * w - (a * b * ((h // a) * (w // b))))
``` | output | 1 | 99,416 | 23 | 198,833 |
Provide a correct Python 3 solution for this coding contest problem.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The following conditions must be met when attaching tiles.
* Do... | instruction | 0 | 99,417 | 23 | 198,834 |
"Correct Solution:
```
h,w = map(int,input().split())
a,b = map(int,input().split())
print(h*w-(a*(h//a)*b*(w//b)))
``` | output | 1 | 99,417 | 23 | 198,835 |
Provide a correct Python 3 solution for this coding contest problem.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The following conditions must be met when attaching tiles.
* Do... | instruction | 0 | 99,418 | 23 | 198,836 |
"Correct Solution:
```
h,w = map(int,input().split())
a,b = map(int,input().split())
ai = h//a*a
bi = w//b*b
print(h*w-ai*bi)
``` | output | 1 | 99,418 | 23 | 198,837 |
Provide a correct Python 3 solution for this coding contest problem.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The following conditions must be met when attaching tiles.
* Do... | instruction | 0 | 99,419 | 23 | 198,838 |
"Correct Solution:
```
h,w=map(int,input().split())
a,b=map(int,input().split())
x=h//a*a
y=w//b*b
print(h*w-x*y)
``` | output | 1 | 99,419 | 23 | 198,839 |
Provide a correct Python 3 solution for this coding contest problem.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The following conditions must be met when attaching tiles.
* Do... | instruction | 0 | 99,420 | 23 | 198,840 |
"Correct Solution:
```
a,b = list(map(int,input().split()))
c,d = list(map(int,input().split()))
sum1 = a*b
length2 = a // c
side2 = b // d
sum2 = (c*length2) * (d*side2)
print(sum1 - sum2)
``` | output | 1 | 99,420 | 23 | 198,841 |
Provide a correct Python 3 solution for this coding contest problem.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The following conditions must be met when attaching tiles.
* Do... | instruction | 0 | 99,421 | 23 | 198,842 |
"Correct Solution:
```
h,w = map(int,input().split())
a,b = map(int,input().split())
rh,rw = h%a, w%b
print(rh*w + rw*h - rh*rw)
``` | output | 1 | 99,421 | 23 | 198,843 |
Provide a correct Python 3 solution for this coding contest problem.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The following conditions must be met when attaching tiles.
* Do... | instruction | 0 | 99,422 | 23 | 198,844 |
"Correct Solution:
```
h,w=map(int,input().split())
a,b=map(int,input().split())
high=(h//a)*a
wide=(w//b)*b
print(h*w-high*wide)
``` | output | 1 | 99,422 | 23 | 198,845 |
Provide a correct Python 3 solution for this coding contest problem.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The following conditions must be met when attaching tiles.
* Do... | instruction | 0 | 99,423 | 23 | 198,846 |
"Correct Solution:
```
h,w=map(int,input().split())
a,b=map(int,input().split())
x,y=h//a,w//b
print((h*w)-(x*a*y*b))
``` | output | 1 | 99,423 | 23 | 198,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The follo... | instruction | 0 | 99,424 | 23 | 198,848 |
Yes | output | 1 | 99,424 | 23 | 198,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The follo... | instruction | 0 | 99,425 | 23 | 198,850 |
Yes | output | 1 | 99,425 | 23 | 198,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The follo... | instruction | 0 | 99,426 | 23 | 198,852 |
Yes | output | 1 | 99,426 | 23 | 198,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
I want to put as many rectangular tiles as possible on a rectangular wall with a size of $ h $ in height and $ w $ in width, and a size of $ a $ in height and $ b $ in width.
The follo... | instruction | 0 | 99,427 | 23 | 198,854 |
Yes | output | 1 | 99,427 | 23 | 198,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After returning to shore, uncle Bogdan usually visits the computer club "The Rock", to solve tasks in a pleasant company. One day, uncle Bogdan met his good old friend who told him one unusual t... | instruction | 0 | 99,610 | 23 | 199,220 |
No | output | 1 | 99,610 | 23 | 199,221 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After returning to shore, uncle Bogdan usually visits the computer club "The Rock", to solve tasks in a pleasant company. One day, uncle Bogdan met his good old friend who told him one unusual t... | instruction | 0 | 99,611 | 23 | 199,222 |
No | output | 1 | 99,611 | 23 | 199,223 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After returning to shore, uncle Bogdan usually visits the computer club "The Rock", to solve tasks in a pleasant company. One day, uncle Bogdan met his good old friend who told him one unusual t... | instruction | 0 | 99,612 | 23 | 199,224 |
No | output | 1 | 99,612 | 23 | 199,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After returning to shore, uncle Bogdan usually visits the computer club "The Rock", to solve tasks in a pleasant company. One day, uncle Bogdan met his good old friend who told him one unusual t... | instruction | 0 | 99,613 | 23 | 199,226 |
No | output | 1 | 99,613 | 23 | 199,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as (i, j), and the length of the side of each cell... | instruction | 0 | 99,646 | 23 | 199,292 |
Tags: greedy, implementation
Correct Solution:
```
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
n = int(input())
left_most = [n] * 10
right_most = [-1] * 10
up_most = [n] * 10
down_most = [-1] * 10
field = []
rotated = []
ans = [0] * 1... | output | 1 | 99,646 | 23 | 199,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as (i, j), and the length of the side of each cell... | instruction | 0 | 99,647 | 23 | 199,294 |
Tags: greedy, implementation
Correct Solution:
```
t = int(input())
while t:
t -= 1
n = int(input())
a = []
for _ in range(n):
a.append(input())
for d in range(10):
minrow, maxrow, ans = 20000, 0, 0
mincol, maxcol = 20000, 0
for i in range(n):
for j i... | output | 1 | 99,647 | 23 | 199,295 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as (i, j), and the length of the side of each cell... | instruction | 0 | 99,648 | 23 | 199,296 |
Tags: greedy, implementation
Correct Solution:
```
import sys
input = sys.stdin.readline
for _ in range(int(input())):
n = int(input())
dd = [[] for _ in range(10)]
for i in range(n):
s = input()
for j in range(n):
dd[int(s[j])].append((i,j))
result = [0]*10
for d in range(10):
if len(dd[d]... | output | 1 | 99,648 | 23 | 199,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as (i, j), and the length of the side of each cell... | instruction | 0 | 99,649 | 23 | 199,298 |
Tags: greedy, implementation
Correct Solution:
```
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
from __builtin__ import xrange as range
from future_builtins import ascii, filter, hex, map, oct, zip
def main():
t=int(input... | output | 1 | 99,649 | 23 | 199,299 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as (i, j), and the length of the side of each cell... | instruction | 0 | 99,650 | 23 | 199,300 |
Tags: greedy, implementation
Correct Solution:
```
def findTriangles(n, rows):
minRow = [n-1]*10
maxRow = [0]*10
minCol = [n-1]*10
maxCol = [0]*10
maxArea = [0]*10
for i in range(n):
for j in range(n):
minCol[grid[i][j]] = min(minCol[grid[i][j]], j)
minRow[grid[i]... | output | 1 | 99,650 | 23 | 199,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as (i, j), and the length of the side of each cell... | instruction | 0 | 99,651 | 23 | 199,302 |
Tags: greedy, implementation
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import defau... | output | 1 | 99,651 | 23 | 199,303 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as (i, j), and the length of the side of each cell... | instruction | 0 | 99,652 | 23 | 199,304 |
Tags: greedy, implementation
Correct Solution:
```
#!/usr/bin/env python3
import io
import os
import sys
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
def printd(*args, **kwargs):
#print(*args, **kwargs, file=sys.stderr)
#print(*args, **kwargs)
pass
def get_str():
return input().decode(... | output | 1 | 99,652 | 23 | 199,305 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as (i, j), and the length of the side of each cell... | instruction | 0 | 99,653 | 23 | 199,306 |
Tags: greedy, implementation
Correct Solution:
```
t = int(input())
def calculate(d, last_rows, last_cols, a):
ans = 0
# print("-" * 1000)
# print(d)
for i in range(0, len(a)):
x = []
# print("-" * 100)
# print(i)
for j in range(0, len(a)):
if a[i][j] == d:
... | output | 1 | 99,653 | 23 | 199,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as ... | instruction | 0 | 99,654 | 23 | 199,308 |
Yes | output | 1 | 99,654 | 23 | 199,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as ... | instruction | 0 | 99,655 | 23 | 199,310 |
Yes | output | 1 | 99,655 | 23 | 199,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as ... | instruction | 0 | 99,656 | 23 | 199,312 |
Yes | output | 1 | 99,656 | 23 | 199,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as ... | instruction | 0 | 99,657 | 23 | 199,314 |
Yes | output | 1 | 99,657 | 23 | 199,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as ... | instruction | 0 | 99,658 | 23 | 199,316 |
No | output | 1 | 99,658 | 23 | 199,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as ... | instruction | 0 | 99,659 | 23 | 199,318 |
No | output | 1 | 99,659 | 23 | 199,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as ... | instruction | 0 | 99,660 | 23 | 199,320 |
No | output | 1 | 99,660 | 23 | 199,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong has a square board consisting of n rows and n columns of square cells, each consisting of a single digit (from 0 to 9). The cell at the j-th column of the i-th row can be represented as ... | instruction | 0 | 99,661 | 23 | 199,322 |
No | output | 1 | 99,661 | 23 | 199,323 |
Provide a correct Python 3 solution for this coding contest problem.
The Smart Beaver from ABBYY loves puzzles. One of his favorite puzzles is the magic square. He has recently had an idea to automate the solution of this puzzle. The Beaver decided to offer this challenge to the ABBYY Cup contestants.
The magic squar... | instruction | 0 | 99,711 | 23 | 199,422 |
"Correct Solution:
```
import sys, random
def f(b):
global a
a = [[0] * n for o in range(n)]
for i in range(n):
for j in range(n):
a[i][j] = b[i * n + j]
rez = 0
for i in range(n):
ns = 0
for j in range(n):
ns += a[i][j]
rez += abs(su - ns)... | output | 1 | 99,711 | 23 | 199,423 |
Provide a correct Python 3 solution for this coding contest problem.
C: Skewering
problem
One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura.
There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C block... | instruction | 0 | 100,295 | 23 | 200,590 |
"Correct Solution:
```
A,B,C=map(int,input().split())
ANS=0
for i in [A,B,C]:
if i%2==1:
ANS+=1
if ANS>=2:
print("Hom")
else:
print("Tem")
``` | output | 1 | 100,295 | 23 | 200,591 |
Provide a correct Python 3 solution for this coding contest problem.
C: Skewering
problem
One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura.
There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C block... | instruction | 0 | 100,296 | 23 | 200,592 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy
from collections import Counter, deque
import heapq
from functools import reduce
# local only
# if not __debug__:
# fin = open('in_1.txt', ... | output | 1 | 100,296 | 23 | 200,593 |
Provide a correct Python 3 solution for this coding contest problem.
C: Skewering
problem
One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura.
There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C block... | instruction | 0 | 100,297 | 23 | 200,594 |
"Correct Solution:
```
print('Hom' if sum(map(lambda x:int(x)%2, input().split())) > 1 else 'Tem')
``` | output | 1 | 100,297 | 23 | 200,595 |
Provide a correct Python 3 solution for this coding contest problem.
C: Skewering
problem
One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura.
There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C block... | instruction | 0 | 100,298 | 23 | 200,596 |
"Correct Solution:
```
a, b, c = map(lambda x: int(x)%2, input().split())
if a + b + c >= 2:
print("Hom")
else:
print("Tem")
``` | output | 1 | 100,298 | 23 | 200,597 |
Provide a correct Python 3 solution for this coding contest problem.
C: Skewering
problem
One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura.
There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C block... | instruction | 0 | 100,299 | 23 | 200,598 |
"Correct Solution:
```
print("Hom" if sum([int(n)%2 for n in input().split()]) > 1 else "Tem")
``` | output | 1 | 100,299 | 23 | 200,599 |
Provide a correct Python 3 solution for this coding contest problem.
C: Skewering
problem
One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura.
There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C block... | instruction | 0 | 100,300 | 23 | 200,600 |
"Correct Solution:
```
A, B, C = map(int, input().split())
count = 0
if A%2 == 1:
count += 1
if B%2 == 1:
count += 1
if C%2 == 1:
count += 1
if count >= 2:
print ('Hom')
else:
print ('Tem')
``` | output | 1 | 100,300 | 23 | 200,601 |
Provide a correct Python 3 solution for this coding contest problem.
C: Skewering
problem
One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura.
There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C block... | instruction | 0 | 100,301 | 23 | 200,602 |
"Correct Solution:
```
print('Hom' if len(list(i for i in map(int, input().split()) if i % 2 == 1)) >= 2 else 'Tem')
``` | output | 1 | 100,301 | 23 | 200,603 |
Provide a correct Python 3 solution for this coding contest problem.
C: Skewering
problem
One day, when Homura was playing with blocks, Tempura came. Homura decided to play with blocks with Tempura.
There is a rectangular parallelepiped of A \ times B \ times C, which is made by stacking A \ times B \ times C block... | instruction | 0 | 100,302 | 23 | 200,604 |
"Correct Solution:
```
a,b,c = map(int,input().split())
cnt = 0
if a %2 == 0:
cnt += 1
if b %2 == 0:
cnt += 1
if c %2 == 0:
cnt += 1
if cnt >= 2:
print('Tem')
else:
print('Hom')
``` | output | 1 | 100,302 | 23 | 200,605 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for... | instruction | 0 | 100,729 | 23 | 201,458 |
Yes | output | 1 | 100,729 | 23 | 201,459 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for... | instruction | 0 | 100,730 | 23 | 201,460 |
Yes | output | 1 | 100,730 | 23 | 201,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for... | instruction | 0 | 100,731 | 23 | 201,462 |
Yes | output | 1 | 100,731 | 23 | 201,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for... | instruction | 0 | 100,732 | 23 | 201,464 |
No | output | 1 | 100,732 | 23 | 201,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for... | instruction | 0 | 100,733 | 23 | 201,466 |
No | output | 1 | 100,733 | 23 | 201,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for... | instruction | 0 | 100,734 | 23 | 201,468 |
No | output | 1 | 100,734 | 23 | 201,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for... | instruction | 0 | 100,735 | 23 | 201,470 |
No | output | 1 | 100,735 | 23 | 201,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Cat Noku has obtained a map of the night sky. On this map, he found a constellation with n stars numbered from 1 to n. For each i, the i-th star is located at coordinates (xi, yi). No two stars are located at the same position.
In the eveni... | instruction | 0 | 100,753 | 23 | 201,506 |
Tags: geometry, implementation
Correct Solution:
```
def det(a,b,c):
return (b[0]-a[0])*(c[1]-a[1])-(c[0]-a[0])*(b[1]-a[1])
n = int(input())
a = []
for i in range(1,n+1):
x,y=map(int,input().split())
a.append([x,y,i])
a.sort(key=lambda x: (x[0],x[1]))
for i in range(n-2):
x = a[i]
y = a[i+1]
z =... | output | 1 | 100,753 | 23 | 201,507 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.