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 of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles have odd length. Rectangles cannot intersect, but ... | instruction | 0 | 91,339 | 23 | 182,678 |
Tags: constructive algorithms, geometry
Correct Solution:
```
n = int(input())
print('YES')
for _ in range(n):
x1,y1,x2,y2 = [int(el) for el in input().split()]
print(x1%2+(y1%2)*2+1)
``` | output | 1 | 91,339 | 23 | 182,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles have odd length. Rectangles cannot intersect, but ... | instruction | 0 | 91,340 | 23 | 182,680 |
Tags: constructive algorithms, geometry
Correct Solution:
```
n = int(input())
ans = 'YES\n'
for i in range(n):
x1, y1, x2, y2 = map(int, input().split())
res = (x1 & 1) * 2 + (y1 & 1) + 1
ans += str(res) + '\n'
print(ans)
``` | output | 1 | 91,340 | 23 | 182,681 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles hav... | instruction | 0 | 91,341 | 23 | 182,682 |
Yes | output | 1 | 91,341 | 23 | 182,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles hav... | instruction | 0 | 91,342 | 23 | 182,684 |
Yes | output | 1 | 91,342 | 23 | 182,685 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles hav... | instruction | 0 | 91,343 | 23 | 182,686 |
Yes | output | 1 | 91,343 | 23 | 182,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles hav... | instruction | 0 | 91,344 | 23 | 182,688 |
Yes | output | 1 | 91,344 | 23 | 182,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles hav... | instruction | 0 | 91,345 | 23 | 182,690 |
No | output | 1 | 91,345 | 23 | 182,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles hav... | instruction | 0 | 91,346 | 23 | 182,692 |
No | output | 1 | 91,346 | 23 | 182,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles hav... | instruction | 0 | 91,347 | 23 | 182,694 |
No | output | 1 | 91,347 | 23 | 182,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One of Timofey's birthday presents is a colourbook in a shape of an infinite plane. On the plane n rectangles with sides parallel to coordinate axes are situated. All sides of the rectangles hav... | instruction | 0 | 91,348 | 23 | 182,696 |
No | output | 1 | 91,348 | 23 | 182,697 |
Provide a correct Python 3 solution for this coding contest problem.
Find the area of intersection between a circle $c$ and a polygon $g$. The center coordinate of the circle is ($0, 0$).
The polygon $g$ is represented by a sequence of points $p_1$, $p_2$,..., $p_n$ where line segments connecting $p_i$ and $p_{i+1}$ ... | instruction | 0 | 91,706 | 23 | 183,412 |
"Correct Solution:
```
from math import acos, hypot, isclose, sqrt
from typing import List, Tuple
def intersection(circle: Tuple[int, int, int],
polygon: List[Tuple[float, float]]) -> float:
x, y, r = circle
area = 0.0
for p1, p2 in zip(polygon, polygon[1:] + [polygon[0]]):
ps = ... | output | 1 | 91,706 | 23 | 183,413 |
Provide a correct Python 3 solution for this coding contest problem.
Find the area of intersection between a circle $c$ and a polygon $g$. The center coordinate of the circle is ($0, 0$).
The polygon $g$ is represented by a sequence of points $p_1$, $p_2$,..., $p_n$ where line segments connecting $p_i$ and $p_{i+1}$ ... | instruction | 0 | 91,707 | 23 | 183,414 |
"Correct Solution:
```
#!/usr/bin/env python3
# CGL_7_H: Circles - Intersection of a Circle and a Polygon
from math import acos, hypot, isclose, sqrt
def intersection(circle, polygon):
x, y, r = circle
area = 0.0
for p1, p2 in zip(polygon, polygon[1:]+[polygon[0]]):
ps = seg_intersection(circle,... | output | 1 | 91,707 | 23 | 183,415 |
Provide a correct Python 3 solution for this coding contest problem.
Find the area of intersection between a circle $c$ and a polygon $g$. The center coordinate of the circle is ($0, 0$).
The polygon $g$ is represented by a sequence of points $p_1$, $p_2$,..., $p_n$ where line segments connecting $p_i$ and $p_{i+1}$ ... | instruction | 0 | 91,708 | 23 | 183,416 |
"Correct Solution:
```
import cmath
import itertools
import math
from collections import defaultdict
INF = float("inf")
PI = cmath.pi
TAU = cmath.pi * 2
EPS = 1e-10
class Point:
"""
2次元空間上の点
"""
# 反時計回り側にある
CCW_COUNTER_CLOCKWISE = 1
# 時計回り側にある
CCW_CLOCKWISE = -1
# 線分の後ろにある
CCW_ONLINE_BACK = 2
# 線分の前にある
C... | output | 1 | 91,708 | 23 | 183,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n rectangles in a row. You can either turn each rectangle by 90 degrees or leave it as it is. If you turn a rectangle, its width will be height, and its height will be width. Notice that you can turn any number of rectangles, you a... | instruction | 0 | 91,723 | 23 | 183,446 |
Tags: greedy, sortings
Correct Solution:
```
import sys
from sys import stdin,stdout
from math import *
from collections import *
from itertools import *
int_arr = lambda: list(map(int,stdin.readline().strip().split()))
str_arr = lambda: list(map(int,stdin.readline().strip().split()))
get_str = lambda: map(str,stdin.r... | output | 1 | 91,723 | 23 | 183,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n rectangles in a row. You can either turn each rectangle by 90 degrees or leave it as it is. If you turn a rectangle, its width will be height, and its height will be width. Notice th... | instruction | 0 | 91,730 | 23 | 183,460 |
Yes | output | 1 | 91,730 | 23 | 183,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n rectangles in a row. You can either turn each rectangle by 90 degrees or leave it as it is. If you turn a rectangle, its width will be height, and its height will be width. Notice th... | instruction | 0 | 91,731 | 23 | 183,462 |
Yes | output | 1 | 91,731 | 23 | 183,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n rectangles in a row. You can either turn each rectangle by 90 degrees or leave it as it is. If you turn a rectangle, its width will be height, and its height will be width. Notice th... | instruction | 0 | 91,732 | 23 | 183,464 |
Yes | output | 1 | 91,732 | 23 | 183,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n rectangles in a row. You can either turn each rectangle by 90 degrees or leave it as it is. If you turn a rectangle, its width will be height, and its height will be width. Notice th... | instruction | 0 | 91,733 | 23 | 183,466 |
Yes | output | 1 | 91,733 | 23 | 183,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n rectangles in a row. You can either turn each rectangle by 90 degrees or leave it as it is. If you turn a rectangle, its width will be height, and its height will be width. Notice th... | instruction | 0 | 91,734 | 23 | 183,468 |
No | output | 1 | 91,734 | 23 | 183,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n rectangles in a row. You can either turn each rectangle by 90 degrees or leave it as it is. If you turn a rectangle, its width will be height, and its height will be width. Notice th... | instruction | 0 | 91,735 | 23 | 183,470 |
No | output | 1 | 91,735 | 23 | 183,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n rectangles in a row. You can either turn each rectangle by 90 degrees or leave it as it is. If you turn a rectangle, its width will be height, and its height will be width. Notice th... | instruction | 0 | 91,736 | 23 | 183,472 |
No | output | 1 | 91,736 | 23 | 183,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n rectangles in a row. You can either turn each rectangle by 90 degrees or leave it as it is. If you turn a rectangle, its width will be height, and its height will be width. Notice th... | instruction | 0 | 91,737 | 23 | 183,474 |
No | output | 1 | 91,737 | 23 | 183,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cybermen solved that first test much quicker than the Daleks. Luckily for us, the Daleks were angry (shocking!) and they destroyed some of the Cybermen.
After the fighting stopped, Heidi gave them another task to waste their time on.
T... | instruction | 0 | 91,793 | 23 | 183,586 |
Tags: data structures
Correct Solution:
```
import sys
NORM = 2000000
LIMIT = NORM * 2 + 1
class segmentTree:
def __init__(self, n):
self.n = n
self.t = [0] * (n * 2)
self.lazy = [0] * n
def apply(self, p, value):
self.t[p] += value
if p < self.n:
self.lazy[p] += value
def build(self, p):
while ... | output | 1 | 91,793 | 23 | 183,587 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrarily — be inside each other, coincide and so on. ... | instruction | 0 | 91,844 | 23 | 183,688 |
Tags: brute force, constructive algorithms, data structures, dp, graphs, sortings, trees, two pointers
Correct Solution:
```
import sys
t = int(sys.stdin.readline())
for _ in range(t):
n = int(sys.stdin.readline())
intervals = [None]*n
for i in range(n):
intervals[i] = tuple([int(a) for a in sys.s... | output | 1 | 91,844 | 23 | 183,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrarily — be inside each other, coincide and so on. ... | instruction | 0 | 91,845 | 23 | 183,690 |
Tags: brute force, constructive algorithms, data structures, dp, graphs, sortings, trees, two pointers
Correct Solution:
```
import sys
from collections import deque
def input():
return sys.stdin.readline().rstrip()
t = int(input())
for _ in range(t):
n = int(input())
segs = []
for i in range(n):
... | output | 1 | 91,845 | 23 | 183,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrarily — be inside each other, coincide and so on. ... | instruction | 0 | 91,846 | 23 | 183,692 |
Tags: brute force, constructive algorithms, data structures, dp, graphs, sortings, trees, two pointers
Correct Solution:
```
import io
import os
from collections import Counter, defaultdict, deque
# From: https://github.com/cheran-senthil/PyRival/blob/master/pyrival/data_structures/SegmentTree.py
class SegmentTree:
... | output | 1 | 91,846 | 23 | 183,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrarily — be inside each other, coincide and so on. ... | instruction | 0 | 91,847 | 23 | 183,694 |
Tags: brute force, constructive algorithms, data structures, dp, graphs, sortings, trees, two pointers
Correct Solution:
```
from sys import stdin
input = stdin.readline
q = int(input())
for rwere in range(q):
n = int(input())
seg = []
pts = []
for i in range(n):
pocz, kon = map(int,input().split())
seg.append(... | output | 1 | 91,847 | 23 | 183,695 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrarily — be inside each other, coincide and so on. ... | instruction | 0 | 91,848 | 23 | 183,696 |
Tags: brute force, constructive algorithms, data structures, dp, graphs, sortings, trees, two pointers
Correct Solution:
```
import io
import os
from collections import defaultdict
# From: https://github.com/cheran-senthil/PyRival/blob/master/pyrival/data_structures/SegmentTree.py
class SegmentTree:
def __init__(... | output | 1 | 91,848 | 23 | 183,697 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrarily — be inside each other, coincide and so on. ... | instruction | 0 | 91,849 | 23 | 183,698 |
Tags: brute force, constructive algorithms, data structures, dp, graphs, sortings, trees, two pointers
Correct Solution:
```
import sys
input = sys.stdin.readline
from itertools import accumulate
import random
t=int(input())
for testcases in range(t):
n=int(input())
S=[list(map(int,input().split())) for i ... | output | 1 | 91,849 | 23 | 183,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrarily — be inside each other, coincide and so on. ... | instruction | 0 | 91,850 | 23 | 183,700 |
Tags: brute force, constructive algorithms, data structures, dp, graphs, sortings, trees, two pointers
Correct Solution:
```
def solve(lsts):
points = []
for i in range(len(lsts)):
points.append((lst[i][0], 0, i))
points.append((lst[i][1], 1, i))
points.sort()
open = set()
incre... | output | 1 | 91,850 | 23 | 183,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrarily — be inside each other, coincide and so on. ... | instruction | 0 | 91,851 | 23 | 183,702 |
Tags: brute force, constructive algorithms, data structures, dp, graphs, sortings, trees, two pointers
Correct Solution:
```
import io
import os
from collections import Counter, defaultdict, deque
# From: https://github.com/cheran-senthil/PyRival/blob/master/pyrival/data_structures/SegmentTree.py
class SegmentTree:
... | output | 1 | 91,851 | 23 | 183,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrari... | instruction | 0 | 91,852 | 23 | 183,704 |
Yes | output | 1 | 91,852 | 23 | 183,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrari... | instruction | 0 | 91,853 | 23 | 183,706 |
Yes | output | 1 | 91,853 | 23 | 183,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrari... | instruction | 0 | 91,854 | 23 | 183,708 |
Yes | output | 1 | 91,854 | 23 | 183,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrari... | instruction | 0 | 91,855 | 23 | 183,710 |
Yes | output | 1 | 91,855 | 23 | 183,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrari... | instruction | 0 | 91,856 | 23 | 183,712 |
No | output | 1 | 91,856 | 23 | 183,713 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrari... | instruction | 0 | 91,857 | 23 | 183,714 |
No | output | 1 | 91,857 | 23 | 183,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrari... | instruction | 0 | 91,858 | 23 | 183,716 |
No | output | 1 | 91,858 | 23 | 183,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n segments on a Ox axis [l_1, r_1], [l_2, r_2], ..., [l_n, r_n]. Segment [l, r] covers all points from l to r inclusive, so all x such that l ≤ x ≤ r.
Segments can be placed arbitrari... | instruction | 0 | 91,859 | 23 | 183,718 |
No | output | 1 | 91,859 | 23 | 183,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it that
* starts in the upper left cell of the matrix;
* each following cell is to the right or down from the current cell;
*... | instruction | 0 | 92,054 | 23 | 184,108 |
Tags: dp, math
Correct Solution:
```
"""
#If FastIO not needed, use this and don't forget to strip
#import sys, math
#input = sys.stdin.readline
"""
import os
import sys
from io import BytesIO, IOBase
import heapq as h
from bisect import bisect_left, bisect_right
import time
from types import GeneratorType
BUFSIZE =... | output | 1 | 92,054 | 23 | 184,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it that
* starts in the upper left cell of the matrix;
* each following cell is t... | instruction | 0 | 92,058 | 23 | 184,116 |
Yes | output | 1 | 92,058 | 23 | 184,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it that
* starts in the upper left cell of the matrix;
* each following cell is t... | instruction | 0 | 92,059 | 23 | 184,118 |
Yes | output | 1 | 92,059 | 23 | 184,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it that
* starts in the upper left cell of the matrix;
* each following cell is t... | instruction | 0 | 92,060 | 23 | 184,120 |
Yes | output | 1 | 92,060 | 23 | 184,121 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it that
* starts in the upper left cell of the matrix;
* each following cell is t... | instruction | 0 | 92,063 | 23 | 184,126 |
No | output | 1 | 92,063 | 23 | 184,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a square matrix n × n, consisting of non-negative integer numbers. You should find such a way on it that
* starts in the upper left cell of the matrix;
* each following cell is t... | instruction | 0 | 92,065 | 23 | 184,130 |
No | output | 1 | 92,065 | 23 | 184,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gena doesn't like geometry, so he asks you to solve this problem for him.
A rectangle with sides parallel to coordinate axes contains n dots. Let's consider some point of the plane. Let's count... | instruction | 0 | 92,130 | 23 | 184,260 |
No | output | 1 | 92,130 | 23 | 184,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly n pixels.
Your task is to determine the size of the rectangular display — the number of lines (rows) of pixels a and the n... | instruction | 0 | 92,251 | 23 | 184,502 |
Tags: brute force, math
Correct Solution:
```
from math import sqrt
def div(n):
i = 1
list = []
while i <= n:
if n % i == 0:
list.append(i)
i = i + 1
return list
n=int(input())
root=sqrt(n)
divs=div(n)
#print(divs)
listy=[abs(root-x) for x in divs]
min_index=listy.... | output | 1 | 92,251 | 23 | 184,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly n pixels.
Your task is to determine the size of the rectangular display — the number of lines (rows) of pixels a and the n... | instruction | 0 | 92,252 | 23 | 184,504 |
Tags: brute force, math
Correct Solution:
```
n = int(input())
for i in range(1,n+1):
if (n%i==0):
if (i>n//i):
break
a= i
b= n//i
print(a, b)
``` | output | 1 | 92,252 | 23 | 184,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly n pixels.
Your task is to determine the size of the rectangular display — the number of lines (rows) of pixels a and the n... | instruction | 0 | 92,253 | 23 | 184,506 |
Tags: brute force, math
Correct Solution:
```
n = int(input())
res = 1
for i in range(2, int(n**0.5)+1):
if n%i == 0:
res = i
print(res, n//res)
``` | output | 1 | 92,253 | 23 | 184,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly n pixels.
Your task is to determine the size of the rectangular display — the number of lines (rows) of pixels a and the n... | instruction | 0 | 92,254 | 23 | 184,508 |
Tags: brute force, math
Correct Solution:
```
from math import sqrt
n=int(input())
q=int(sqrt(n))
k=t=1
for i in range(1,q+1):
if n%i==0:
t=i
k=max(k,t)
print(k,n//k)
``` | output | 1 | 92,254 | 23 | 184,509 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.