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.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked ... | instruction | 0 | 24,092 | 23 | 48,184 |
No | output | 1 | 24,092 | 23 | 48,185 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked ... | instruction | 0 | 24,093 | 23 | 48,186 |
No | output | 1 | 24,093 | 23 | 48,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked ... | instruction | 0 | 24,094 | 23 | 48,188 |
No | output | 1 | 24,094 | 23 | 48,189 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked ... | instruction | 0 | 24,095 | 23 | 48,190 |
No | output | 1 | 24,095 | 23 | 48,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Dima has two sequences of points with integer coordinates: sequence (a1, 1), (a2, 2), ..., (an, n) and sequence (b1, 1), (b2, 2), ..., (bn, n).
Now Dima wants to count the number of dist... | instruction | 0 | 24,123 | 23 | 48,246 |
No | output | 1 | 24,123 | 23 | 48,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Dima has two sequences of points with integer coordinates: sequence (a1, 1), (a2, 2), ..., (an, n) and sequence (b1, 1), (b2, 2), ..., (bn, n).
Now Dima wants to count the number of dist... | instruction | 0 | 24,124 | 23 | 48,248 |
No | output | 1 | 24,124 | 23 | 48,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Dima has two sequences of points with integer coordinates: sequence (a1, 1), (a2, 2), ..., (an, n) and sequence (b1, 1), (b2, 2), ..., (bn, n).
Now Dima wants to count the number of dist... | instruction | 0 | 24,125 | 23 | 48,250 |
No | output | 1 | 24,125 | 23 | 48,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Dima has two sequences of points with integer coordinates: sequence (a1, 1), (a2, 2), ..., (an, n) and sequence (b1, 1), (b2, 2), ..., (bn, n).
Now Dima wants to count the number of dist... | instruction | 0 | 24,126 | 23 | 48,252 |
No | output | 1 | 24,126 | 23 | 48,253 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if... | instruction | 0 | 24,364 | 23 | 48,728 |
Tags: constructive algorithms, geometry, greedy, math, number theory, sortings
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
a.sort()
for i in range(1,n - 1):
if a[i + 1] - a[i] < a[i - 1]:
print("YES")
quit()
print("NO")
``` | output | 1 | 24,364 | 23 | 48,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if... | instruction | 0 | 24,365 | 23 | 48,730 |
Tags: constructive algorithms, geometry, greedy, math, number theory, sortings
Correct Solution:
```
import math
n=int(input())
list=[int(i) for i in input().split()]
list.sort()
for i in range(n-2):
if((list[i]+list[i+1])>list[i+2]):
print("YES")
exit()
print("NO")
``` | output | 1 | 24,365 | 23 | 48,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if... | instruction | 0 | 24,366 | 23 | 48,732 |
Tags: constructive algorithms, geometry, greedy, math, number theory, sortings
Correct Solution:
```
a=int(input())
b=list(map(int,input().split()))
b.sort()
for i in range(0,(a-2)):
if b[i]+b[i+1]>b[i+2]:
print('Yes')
break
else:
print('No')
``` | output | 1 | 24,366 | 23 | 48,733 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if... | instruction | 0 | 24,367 | 23 | 48,734 |
Tags: constructive algorithms, geometry, greedy, math, number theory, sortings
Correct Solution:
```
'''
//
//
//
//
//
// 766B-codeforces.c
// Bang Bang Bang
//
// Created by Mohammad Shamim on 11/5/17.
// Copyright (c) 2017 Mohammad Shamim. All rights reserved. :p
//
'''
n=int(input())
c=1
x=sorted(list... | output | 1 | 24,367 | 23 | 48,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if... | instruction | 0 | 24,368 | 23 | 48,736 |
Tags: constructive algorithms, geometry, greedy, math, number theory, sortings
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
a.sort()
c=0
for i in range(0,n-2):
if a[i]+a[i+1]>a[i+2]:
c+=1
break
if c>0:
print("YES")
else:
print("NO")
``` | output | 1 | 24,368 | 23 | 48,737 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if... | instruction | 0 | 24,369 | 23 | 48,738 |
Tags: constructive algorithms, geometry, greedy, math, number theory, sortings
Correct Solution:
```
N = int(input())
X = sorted(list(map(int, input().split())))
for i in range(N - 2):
for j in range(i + 1, N - 1):
for k in range(j + 1, N):
if X[i] + X[j] > X[k]:
print("YES")
... | output | 1 | 24,369 | 23 | 48,739 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if... | instruction | 0 | 24,370 | 23 | 48,740 |
Tags: constructive algorithms, geometry, greedy, math, number theory, sortings
Correct Solution:
```
n = int(input())
sides = list(map(int, input().split()))
sides.sort()
for i in range(n-2):
a = sides[i]
b = sides[i+1]
c = sides[i+2]
if a+b <= c:
continue
else:
print("YES")
exit()
print("NO")
``` | output | 1 | 24,370 | 23 | 48,741 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if... | instruction | 0 | 24,371 | 23 | 48,742 |
Tags: constructive algorithms, geometry, greedy, math, number theory, sortings
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
a.sort()
re=0
for i in range(1,n-1):
if a[i-1]+a[i]>a[i+1]:
print("YES")
re=1
break
if re==0:
print("NO")
``` | output | 1 | 24,371 | 23 | 48,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is ... | instruction | 0 | 24,372 | 23 | 48,744 |
Yes | output | 1 | 24,372 | 23 | 48,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is ... | instruction | 0 | 24,373 | 23 | 48,746 |
Yes | output | 1 | 24,373 | 23 | 48,747 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is ... | instruction | 0 | 24,374 | 23 | 48,748 |
Yes | output | 1 | 24,374 | 23 | 48,749 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is ... | instruction | 0 | 24,375 | 23 | 48,750 |
Yes | output | 1 | 24,375 | 23 | 48,751 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is ... | instruction | 0 | 24,376 | 23 | 48,752 |
No | output | 1 | 24,376 | 23 | 48,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is ... | instruction | 0 | 24,377 | 23 | 48,754 |
No | output | 1 | 24,377 | 23 | 48,755 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is ... | instruction | 0 | 24,378 | 23 | 48,756 |
No | output | 1 | 24,378 | 23 | 48,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is ... | instruction | 0 | 24,379 | 23 | 48,758 |
No | output | 1 | 24,379 | 23 | 48,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an n × m table, consisting of characters «A», «G», «C», «T». Let's call a table nice, if every 2 × 2 square contains all four distinct characters. Your task is to find a nice table... | instruction | 0 | 24,801 | 23 | 49,602 |
No | output | 1 | 24,801 | 23 | 49,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of which consists of 0 and 1 only. You can apply th... | instruction | 0 | 24,803 | 23 | 49,606 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n, m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
b = [list(map(int, input().split())) for _ in range(n)]
d = [list(map(lambda x, y: x ^ y, u, v)) for u, v in zip(a, b)]
p = any(map(lambda x: sum(x) ... | output | 1 | 24,803 | 23 | 49,607 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of which consists of 0 and 1 only. You can apply th... | instruction | 0 | 24,804 | 23 | 49,608 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n,m = map(int,input().split())
A=[];B=[]
for i in range(n):
A.append(list(map(int,input().split())))
for i in range(n):
B.append(list(map(int,input().split())))
for i in range(n-1):
for j in range(m-1):
if(A[i][j]!=B[i... | output | 1 | 24,804 | 23 | 49,609 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of which consists of 0 and 1 only. You can apply th... | instruction | 0 | 24,805 | 23 | 49,610 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n, m = [int(x) for x in input().split()]
a, b = [], []
for i in range(n):
a.append([int(x) for x in input().split()])
for i in range(n):
b.append([int(x) for x in input().split()])
flag = 0
for i in range(n):
cnt = 0
for ... | output | 1 | 24,805 | 23 | 49,611 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of which consists of 0 and 1 only. You can apply th... | instruction | 0 | 24,806 | 23 | 49,612 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
import atexit
import io
import sys
_I_B = sys.stdin.read().splitlines()
input = iter(_I_B).__next__
_O_B = io.StringIO()
sys.stdout = _O_B
@atexit.register
def write():
sys.__stdout__.write(_O_B.getvalue())
r,c=map(int,input().spli... | output | 1 | 24,806 | 23 | 49,613 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of which consists of 0 and 1 only. You can apply th... | instruction | 0 | 24,807 | 23 | 49,614 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
N, M = map(int, input().split())
A = []
B = []
for i in range(N):
A.append(list(map(int, input().split())))
for i in range(N):
B.append(list(map(int, input().split())))
C = []
for i in range(N):
tmp = []
for j in range(M... | output | 1 | 24,807 | 23 | 49,615 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of which consists of 0 and 1 only. You can apply th... | instruction | 0 | 24,808 | 23 | 49,616 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
n, m = [int(item) for item in input().split()]
a = []
b = []
for _ in range(n):
a.append([int(item) for item in input().split()])
for _ in range(n):
b.append([int(item) for item in input().split()])
ok = True
for i in range(n):... | output | 1 | 24,808 | 23 | 49,617 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of which consists of 0 and 1 only. You can apply th... | instruction | 0 | 24,809 | 23 | 49,618 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
t = 1
for _ in range(t):
n, m = map(int, input().split())
mata = []
matb = []
for i in range(n):
arr = [int(j) for j in input().split()]
mata += [arr]
for i in range(n):
arr = [int(j) for j in input().split()]
matb += [arr]
... | output | 1 | 24,809 | 23 | 49,619 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of which consists of 0 and 1 only. You can apply th... | instruction | 0 | 24,810 | 23 | 49,620 |
Tags: constructive algorithms, greedy, implementation, math
Correct Solution:
```
# ///==========Libraries, Constants and Functions=============///
import sys
from bisect import bisect_left,bisect_right
from collections import deque
inf = float("inf")
mod = 1000000007
def binary(number):
result=0
while number:
... | output | 1 | 24,810 | 23 | 49,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of w... | instruction | 0 | 24,811 | 23 | 49,622 |
Yes | output | 1 | 24,811 | 23 | 49,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of w... | instruction | 0 | 24,812 | 23 | 49,624 |
Yes | output | 1 | 24,812 | 23 | 49,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of w... | instruction | 0 | 24,813 | 23 | 49,626 |
Yes | output | 1 | 24,813 | 23 | 49,627 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of w... | instruction | 0 | 24,814 | 23 | 49,628 |
Yes | output | 1 | 24,814 | 23 | 49,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of w... | instruction | 0 | 24,815 | 23 | 49,630 |
No | output | 1 | 24,815 | 23 | 49,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of w... | instruction | 0 | 24,816 | 23 | 49,632 |
No | output | 1 | 24,816 | 23 | 49,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of w... | instruction | 0 | 24,817 | 23 | 49,634 |
No | output | 1 | 24,817 | 23 | 49,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ramesses came to university to algorithms practice, and his professor, who is a fairly known programmer, gave him the following task.
You are given two matrices A and B of size n × m, each of w... | instruction | 0 | 24,818 | 23 | 49,636 |
No | output | 1 | 24,818 | 23 | 49,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.25 inclusively. Besides, at least one side of th... | instruction | 0 | 25,130 | 23 | 50,260 |
Tags: binary search, implementation
Correct Solution:
```
from math import log
h,w=map(int,input().split())
ff = 2**int(log(h)/log(2))
ss = 2**int(log(w)/log(2))
if ff>ss :
ff=min(ff,int(ss*1.25))
else:
ss=min(ss,int(ff*1.25))
ff2=min(int(ss*1.25), h)
ss2=min(int(ff*1.25), w)
if ff*ss2>ss*ff2:
print(ff,ss2... | output | 1 | 25,130 | 23 | 50,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.25 inclusively. Besides, at least one side of th... | instruction | 0 | 25,131 | 23 | 50,262 |
Tags: binary search, implementation
Correct Solution:
```
def pic(x,y): #x/y
if x==2 and y==1:
print(1,1)
return ""
factors=[2**i for i in range(0,50)]
ans=[]
i=0
tx,ty=1,1
for i in factors:
if i<=x:
tx=i
else:
break
for i in factors:
... | output | 1 | 25,131 | 23 | 50,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.25 inclusively. Besides, at least one side of th... | instruction | 0 | 25,132 | 23 | 50,264 |
Tags: binary search, implementation
Correct Solution:
```
import math
line = input().split()
h = int(line[0])
w = int(line[1])
q = 1
#Four cases
#log(h), calculare w
h1 = math.pow(2,math.floor(math.log(h,2)))
w1 = w
while(h1/w1>1.25): h1 /= 2
if h1/w1<0.8 and h1%4 == 0 and h1 * 1.25 < w1: w1 = h1 * 1.25
#log(w), ... | output | 1 | 25,132 | 23 | 50,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.25 inclusively. Besides, at least one side of th... | instruction | 0 | 25,133 | 23 | 50,266 |
Tags: binary search, implementation
Correct Solution:
```
import math
s = input().split(' ');
h = int(s[0])
w = int(s[1])
ff = 2**math.floor(math.log2(h))
ss = 2**math.floor(math.log2(w))
if ff > ss :
ff = min(ff, math.floor(ss*1.25))
else:
ss = min(ss, math.floor(ff*1.25))
ff2 = min(math.floor(ss*1.25),... | output | 1 | 25,133 | 23 | 50,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.25 inclusively. Besides, at least one side of th... | instruction | 0 | 25,134 | 23 | 50,268 |
Tags: binary search, implementation
Correct Solution:
```
import math
s = input().split(' ');
h = int(s[0])
w = int(s[1])
ff = 2**math.floor(math.log2(h))
ss = 2**math.floor(math.log2(w))
if ff > ss :
ff = min(ff, math.floor(ss*1.25))
else:
ss = min(ss, math.floor(ff*1.25))
ff2 = min(math... | output | 1 | 25,134 | 23 | 50,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.25 inclusively. Besides, at least one side of th... | instruction | 0 | 25,135 | 23 | 50,270 |
Tags: binary search, implementation
Correct Solution:
```
import sys
import math
def input(): return sys.stdin.readline().strip()
def iinput(): return int(input())
def minput(): return map(int, input().split())
def listinput(): return list(map(int, input().split()))
h,w=minput()
x=2**int(math.log2(h))
y=2**int(... | output | 1 | 25,135 | 23 | 50,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.25 inclusively. Besides, at least one side of th... | instruction | 0 | 25,136 | 23 | 50,272 |
Tags: binary search, implementation
Correct Solution:
```
def pic(x,y): #x/y
factors=[2**i for i in range(0,50)]
ans=[]
i=0
tx,ty=1,1
for i in factors:
if i<=x:
tx=i
else:
break
for i in factors:
if i<=y:
ty=i
else:
... | output | 1 | 25,136 | 23 | 50,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.25 inclusively. Besides, at least one side of th... | instruction | 0 | 25,137 | 23 | 50,274 |
Tags: binary search, implementation
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in fi... | output | 1 | 25,137 | 23 | 50,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One popular blog site edits the uploaded photos like this. It cuts a rectangular area out of them so that the ratio of height to width (i.e. the height / width quotient) can vary from 0.8 to 1.2... | instruction | 0 | 25,138 | 23 | 50,276 |
Yes | output | 1 | 25,138 | 23 | 50,277 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.