message stringlengths 2 20.1k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 1.95k 109k | cluster float64 17 17 | __index_level_0__ int64 3.91k 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005 | instruction | 0 | 3,223 | 17 | 6,446 |
"Correct Solution:
```
import sys
import os
import math
for s in sys.stdin:
s, w, h = map(float, s.split(','))
BMI = w / h / h
if BMI >= 25:
print(int(s))
``` | output | 1 | 3,223 | 17 | 6,447 |
Provide a correct Python 3 solution for this coding contest problem.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005 | instruction | 0 | 3,224 | 17 | 6,448 |
"Correct Solution:
```
try :
while True :
s, w, h = map(float, input().split(","))
BMI = w / (h ** 2)
if(BMI >= 25) :
print(int(s))
except :
pass
``` | output | 1 | 3,224 | 17 | 6,449 |
Provide a correct Python 3 solution for this coding contest problem.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005 | instruction | 0 | 3,225 | 17 | 6,450 |
"Correct Solution:
```
while True:
try:
line = input()
except EOFError:
break
n, w, t = map(float, line.split(','))
if w / t**2 >= 25: print(int(n))
``` | output | 1 | 3,225 | 17 | 6,451 |
Provide a correct Python 3 solution for this coding contest problem.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005 | instruction | 0 | 3,226 | 17 | 6,452 |
"Correct Solution:
```
while 1:
try:
s,w,h=map(float,input().split(","))
if w/h/h>=25:print(int(s))
except:break
``` | output | 1 | 3,226 | 17 | 6,453 |
Provide a correct Python 3 solution for this coding contest problem.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005 | instruction | 0 | 3,227 | 17 | 6,454 |
"Correct Solution:
```
while True:
try:
a = input()
except:
break
s,w,h = map(float,a.split(","))
bmi = w / (h**2)
if bmi >= 25:
print(int(s))
``` | output | 1 | 3,227 | 17 | 6,455 |
Provide a correct Python 3 solution for this coding contest problem.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005 | instruction | 0 | 3,228 | 17 | 6,456 |
"Correct Solution:
```
import sys
for e in sys.stdin:
s,w,h=e.split(',')
float(w)/float(h)**2<25 or print(s)
``` | output | 1 | 3,228 | 17 | 6,457 |
Provide a correct Python 3 solution for this coding contest problem.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005 | instruction | 0 | 3,229 | 17 | 6,458 |
"Correct Solution:
```
import sys
f = sys.stdin
for line in f:
id, weight, height = line.strip().split(',')
weight = float(weight)
height = float(height)
if 25 <= weight / height / height:
print(id)
``` | output | 1 | 3,229 | 17 | 6,459 |
Provide a correct Python 3 solution for this coding contest problem.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005 | instruction | 0 | 3,230 | 17 | 6,460 |
"Correct Solution:
```
try:
while True:
s, w, h = map(float, input().split(','))
if w / h**2 >= 25:
print(int(s))
except:
pass
``` | output | 1 | 3,230 | 17 | 6,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005
Submitted Solution:
```
# -*- coding: utf-8 -*-
import sys
import os
import math
for s in sys.stdin:
s, w, h = map(float, s.split(','))
BMI = w / h / h
if BMI >= 25:
print(int(s))
``` | instruction | 0 | 3,231 | 17 | 6,462 |
Yes | output | 1 | 3,231 | 17 | 6,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005
Submitted Solution:
```
S=[]
while True:
try:
s,w,h=map(float,input().split(","))
if w//(h*h)>=25:
S.append(int(s))
except EOFError:
break
for i in range(len(S)):
print(S[i])
``` | instruction | 0 | 3,232 | 17 | 6,464 |
Yes | output | 1 | 3,232 | 17 | 6,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005
Submitted Solution:
```
while True:
try:
s, w, h = input().split(",")
if float(w) / float(h) ** 2 >= 25:
print(s)
except EOFError:
break
``` | instruction | 0 | 3,233 | 17 | 6,466 |
Yes | output | 1 | 3,233 | 17 | 6,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005
Submitted Solution:
```
while True:
try:
s,w,h = map(float,input().split(","))
except: break
bmi = w/(h**2)
if bmi >= 25:
print(int(s))
``` | instruction | 0 | 3,234 | 17 | 6,468 |
Yes | output | 1 | 3,234 | 17 | 6,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005
Submitted Solution:
```
A=[]
while True:
try:
number,weight,height=map(float,input().split(','))
bmi=weight/(height)**2
if bmi>25:
A.append(int(number))
except EOFError:
break
for i in A:
print(i)
``` | instruction | 0 | 3,235 | 17 | 6,470 |
No | output | 1 | 3,235 | 17 | 6,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005
Submitted Solution:
```
import sys
for l in sys.stdin.readlines():
data = l.split(",")
x, y = float(data[1]), float(data[2])
if 25 < x / y ** 2:
print(data[0])
``` | instruction | 0 | 3,236 | 17 | 6,472 |
No | output | 1 | 3,236 | 17 | 6,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005
Submitted Solution:
```
while True:
try:
s, w, h = map(float, input().split(','))
if w / pow(h, 2) > 25:
print(int(s))
except:
break
``` | instruction | 0 | 3,237 | 17 | 6,474 |
No | output | 1 | 3,237 | 17 | 6,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Obesity is cited as the cause of many adult diseases. In the past, with a few exceptions, it was unrelated to high school students. However, it is no longer unrealistic to suffer from lack of exercise due to excessive studying for entrance exams, or to become bulimia nervosa due to stress. It may be a problem that high school students should be fully interested in.
So you decided to work as an assistant to a teacher in the health room to create a program to find students suspected of being obese from student data.
The method is to calculate a numerical value called BMI (Body Mass Index). BMI is given by the following formula.
<image>
BMI = 22 is standard, and above 25 is suspected of being obese.
Create a program that calculates BMI from each student's weight and height information and outputs the student ID numbers of 25 or more students.
input
The input is given in the following format:
s1, w1, h1
s2, w2, h2
...
...
si (1 ≤ si ≤ 2,000), wi (1 ≤ wi ≤ 200), hi (1.0 ≤ hi ≤ 2.0) are the student ID numbers (integers), weight (real numbers), and height (real numbers) of the i-th student, respectively. Represents.
The number of students does not exceed 50.
output
The student ID numbers of students with a BMI of 25 or higher are output on one line in the order in which they were entered.
Example
Input
1001,50.0,1.60
1002,60.0,1.70
1003,70.0,1.80
1004,80.0,1.70
1005,90.0,1.60
Output
1004
1005
Submitted Solution:
```
total=0
s=0
i=0
try:
while True:
a,b = map(int,input().split(','))
total += a*b
s+=b
i+=1
except:
result=s/i+0.5
print(total)
print(round(result))
``` | instruction | 0 | 3,238 | 17 | 6,476 |
No | output | 1 | 3,238 | 17 | 6,477 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11 | instruction | 0 | 3,714 | 17 | 7,428 |
Tags: implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Mon Jun 14 19:52:08 2021
@author: nagan
"""
n = int(input())
d = input().split()
d = [int(i) for i in d]
a, b = map(int, input().split())
ans = 0
for i in range(a - 1, b - 1):
ans += d[i]
print(ans)
``` | output | 1 | 3,714 | 17 | 7,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11 | instruction | 0 | 3,716 | 17 | 7,432 |
Tags: implementation
Correct Solution:
```
# coding: utf-8
n = int(input())
d = [int(i) for i in input().split()]
a, b = [int(i) for i in input().split()]
print(sum(d[a-1:b-1]))
``` | output | 1 | 3,716 | 17 | 7,433 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11 | instruction | 0 | 3,717 | 17 | 7,434 |
Tags: implementation
Correct Solution:
```
n = int(input())
l = list(map(int,input().split()))
a,b = map(int,input().split())
print(sum(l[i] for i in range (a-1,b-1)))
``` | output | 1 | 3,717 | 17 | 7,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11 | instruction | 0 | 3,719 | 17 | 7,438 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=[int(i) for i in input().split()]
a,b=map(int, input().split())
print(sum(s[a-1:b-1]))
``` | output | 1 | 3,719 | 17 | 7,439 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Berland Armed Forces System consists of n ranks that are numbered using natural numbers from 1 to n, where 1 is the lowest rank and n is the highest rank.
One needs exactly di years to rise from rank i to rank i + 1. Reaching a certain rank i having not reached all the previous i - 1 ranks is impossible.
Vasya has just reached a new rank of a, but he dreams of holding the rank of b. Find for how many more years Vasya should serve in the army until he can finally realize his dream.
Input
The first input line contains an integer n (2 ≤ n ≤ 100). The second line contains n - 1 integers di (1 ≤ di ≤ 100). The third input line contains two integers a and b (1 ≤ a < b ≤ n). The numbers on the lines are space-separated.
Output
Print the single number which is the number of years that Vasya needs to rise from rank a to rank b.
Examples
Input
3
5 6
1 2
Output
5
Input
3
5 6
1 3
Output
11 | instruction | 0 | 3,720 | 17 | 7,440 |
Tags: implementation
Correct Solution:
```
n = int(input())
d = list(map(int, input().split()))
a, b = input().split()
sum = 0
if int(a) == 1:
z = int(b) - int(a)
for i in d[:z]:
sum += i
print(sum)
elif int(a) != 1:
for j in d[int(a)-1:int(b)-1]:
sum += j
print(sum)
``` | output | 1 | 3,720 | 17 | 7,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The closing ceremony of Squanch Code Cup is held in the big hall with n × m seats, arranged in n rows, m seats in a row. Each seat has two coordinates (x, y) (1 ≤ x ≤ n, 1 ≤ y ≤ m).
There are two queues of people waiting to enter the hall: k people are standing at (0, 0) and n·m - k people are standing at (0, m + 1). Each person should have a ticket for a specific seat. If person p at (x, y) has ticket for seat (xp, yp) then he should walk |x - xp| + |y - yp| to get to his seat.
Each person has a stamina — the maximum distance, that the person agrees to walk. You should find out if this is possible to distribute all n·m tickets in such a way that each person has enough stamina to get to their seat.
Input
The first line of input contains two integers n and m (1 ≤ n·m ≤ 104) — the size of the hall.
The second line contains several integers. The first integer k (0 ≤ k ≤ n·m) — the number of people at (0, 0). The following k integers indicate stamina of each person there.
The third line also contains several integers. The first integer l (l = n·m - k) — the number of people at (0, m + 1). The following l integers indicate stamina of each person there.
The stamina of the person is a positive integer less that or equal to n + m.
Output
If it is possible to distribute tickets between people in the described manner print "YES", otherwise print "NO".
Examples
Input
2 2
3 3 3 2
1 3
Output
YES
Input
2 2
3 2 3 3
1 2
Output
NO
Submitted Solution:
```
print("YES")
``` | instruction | 0 | 3,828 | 17 | 7,656 |
No | output | 1 | 3,828 | 17 | 7,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair. | instruction | 0 | 4,436 | 17 | 8,872 |
Tags: brute force, implementation
Correct Solution:
```
t=int(input())
for i in range(t):
a=[int(c) for c in input().split()]
if max(a[1],a[0])<min(a[3],a[2]):
print("NO")
elif min(a[1],a[0])>max(a[3],a[2]):
print("NO")
else:
print("YES")
``` | output | 1 | 4,436 | 17 | 8,873 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair. | instruction | 0 | 4,437 | 17 | 8,874 |
Tags: brute force, implementation
Correct Solution:
```
for _ in range(int(input())):
m,n,o,p=map(int,input().split())
a=max(m,n)
b=min(m,n)
c=max(o,p)
d=min(o,p)
if(c>b and a>d):
print("YES")
else:
print("NO")
``` | output | 1 | 4,437 | 17 | 8,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair. | instruction | 0 | 4,438 | 17 | 8,876 |
Tags: brute force, implementation
Correct Solution:
```
for _ in range(int(input())):
l=list(map(int,input().split()))
m=max(l)
i=l.index(m)
l[i]=-1
m2=max(l)
j=l.index(m2)
if (i+j==1) or (i+j==5):
print("NO")
else:
print("YES")
``` | output | 1 | 4,438 | 17 | 8,877 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair. | instruction | 0 | 4,439 | 17 | 8,878 |
Tags: brute force, implementation
Correct Solution:
```
for _ in range(int(input())):
si=list(map(int,input().split()))
ai=sorted(si)
if max(si[0],si[1])==ai[-1] and max(si[2],si[3])==ai[-2]:print("YES")
elif max(si[0],si[1])==ai[-2] and max(si[2],si[3])==ai[-1]:print("YES")
else:print("NO")
``` | output | 1 | 4,439 | 17 | 8,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair. | instruction | 0 | 4,440 | 17 | 8,880 |
Tags: brute force, implementation
Correct Solution:
```
t = int(input())
while t>0:
a = list(map(int,input().split()))
b = [max(a[0],a[1]),max(a[2],a[3])]
a.sort()
b.sort()
a = a[2:]
if a==b:
print("YES")
else:
print("NO")
t = t-1
``` | output | 1 | 4,440 | 17 | 8,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair. | instruction | 0 | 4,441 | 17 | 8,882 |
Tags: brute force, implementation
Correct Solution:
```
t=int(input())
for _ in range(t):
a=list(map(int, input().split()))
b=a.copy()
a.sort(reverse=True)
c=[]
c.append(max(b[0], b[1]))
c.append(max(b[2], b[3]))
c.sort(reverse=True)
if(c==a[0:2]):
print('YES')
else:
print('NO')
``` | output | 1 | 4,441 | 17 | 8,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair. | instruction | 0 | 4,442 | 17 | 8,884 |
Tags: brute force, implementation
Correct Solution:
```
def Fair(arr):
maximum_a = max(arr)
newa = list(arr)
player_list = [max(arr[0],arr[1]),max(arr[2],arr[3])]
for i in range(len(newa)):
if newa[i] == maximum_a:
del newa[i]
break
maximum_b = max(newa)
if maximum_a in player_list:
if maximum_b in player_list:
return 'YES'
else:
return 'NO'
else:
return 'NO'
t = int(input().strip())
for i in range(t):
object_a = input().split(' ')
for i in range(len(object_a)):
object_a[i] = int(object_a[i])
print(Fair(object_a))
``` | output | 1 | 4,442 | 17 | 8,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair. | instruction | 0 | 4,443 | 17 | 8,886 |
Tags: brute force, implementation
Correct Solution:
```
t = int(input())
for i in range(t):
a,b,c,d = map(int,input().split())
Y = [a,b,c,d]
Y.sort(reverse=True)
if (max(a,b) == Y[0] or max(a,b) == Y[1]) and (max(c,d) == Y[0] or max(c,d) == Y[1]):
print("YES")
else:
print("NO")
``` | output | 1 | 4,443 | 17 | 8,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair.
Submitted Solution:
```
t=int(input())
while(t):
t=t-1
a=list(map(int,input().split()))
b=sorted(a)
maxx=b[-1]
maxx2=b[-2]
if(maxx in a[0:2]):
if(maxx2 in a[2:4]):
print("YES")
else:
print("NO")
elif(maxx2 in a[0:2]):
if(maxx in a[2:4]):
print("YES")
else:
print("NO")
else:
print("NO")
``` | instruction | 0 | 4,444 | 17 | 8,888 |
Yes | output | 1 | 4,444 | 17 | 8,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair.
Submitted Solution:
```
import sys
input = sys.stdin.readline
for _ in range(int(input())):
a,b,c,d=map(int,input().split())
if min(a,b)>max(c,d) or min(c,d)>max(a,b):
print("NO")
else:
print("YES")
``` | instruction | 0 | 4,445 | 17 | 8,890 |
Yes | output | 1 | 4,445 | 17 | 8,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair.
Submitted Solution:
```
# cook your dish here
for i in range(int(input())):
a=list(map(int,input().split()))
temp=a[:]
a.sort()
m1=a[3]
m2=a[2]
b=[]
b.append(m1)
b.append(m2)
b.sort()
c=[]
num1=max(temp[0],temp[1])
num2=max(temp[3],temp[2])
c.append(num1)
c.append(num2)
c.sort()
if(b==c):
print('YES')
else:
print('NO')
``` | instruction | 0 | 4,446 | 17 | 8,892 |
Yes | output | 1 | 4,446 | 17 | 8,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair.
Submitted Solution:
```
t=int(input())
for _ in range(t):
a,b,c,d=map(int,input().split())
x1 = max(a,b)
x2 = max(c,d)
if x1>min(c,d) and x2>min(a,b):
print("YES")
else:
print("NO")
``` | instruction | 0 | 4,447 | 17 | 8,894 |
Yes | output | 1 | 4,447 | 17 | 8,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair.
Submitted Solution:
```
for _ in range(int(input())):
a, b, c, d = map(int, input().split())
if(max(a,b) < min(c, d)):
print("YES")
else:
print("NO")
``` | instruction | 0 | 4,448 | 17 | 8,896 |
No | output | 1 | 4,448 | 17 | 8,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair.
Submitted Solution:
```
t=int(input())
for i in range(t):
p1,p2,p3,p4=map(int,input().split())
f1=max(p1,p2)
f2=max(p3,p4)
f3=max(p1,p3)
f4=max(p2,p4)
if f1!=f3 and f1!=f4:
print("No")
break
if f2!=f3 and f2!=f4:
print("No")
break
print("Yes")
``` | instruction | 0 | 4,449 | 17 | 8,898 |
No | output | 1 | 4,449 | 17 | 8,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair.
Submitted Solution:
```
t=int(input())
for i in range(t):
l=list(map(int,input().split()))
s=sorted(l)
p1,p2=s[-1],s[-2]
m1=[]
c=l[0]
for i in range(1,len(l)):
m1.append(max(c,l[i]))
c=l[i]
if(m1[-1]==p1 and m1[0]==p2):
print('YES')
else:
print('NO')
``` | instruction | 0 | 4,450 | 17 | 8,900 |
No | output | 1 | 4,450 | 17 | 8,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament.
It is known that in a match between two players, the one whose skill is greater will win. The skill of the i-th player is equal to s_i and all skill levels are pairwise different (i. e. there are no two identical values in the array s).
The tournament is called fair if the two players with the highest skills meet in the finals.
Determine whether the given tournament is fair.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
A single line of test case contains four integers s_1, s_2, s_3, s_4 (1 ≤ s_i ≤ 100) — skill of the players. It is guaranteed that all the numbers in the array are different.
Output
For each testcase, output YES if the tournament is fair, or NO otherwise.
Example
Input
4
3 7 9 5
4 5 6 9
5 3 8 1
6 5 3 2
Output
YES
NO
YES
NO
Note
Consider the example:
1. in the first test case, players 2 and 3 with skills 7 and 9 advance to the finals;
2. in the second test case, players 2 and 4 with skills 5 and 9 advance to the finals. The player with skill 6 does not advance, but the player with skill 5 advances to the finals, so the tournament is not fair;
3. in the third test case, players 1 and 3 with skills 5 and 8 advance to the finals;
4. in the fourth test case, players 1 and 3 with skills 6 and 3 advance to the finals. The player with skill 5 does not advance, but the player with skill 3 advances to the finals, so the tournament is not fair.
Submitted Solution:
```
import sys
n = int(input())
for line in sys.stdin:
s1, s2, s3, s4 = line.split()
t = [s1,s2,s3,s4]
t.sort(reverse = True)
t = t[:2]
t1 , t2 = max(s1,s2), max(s3,s4)
test = [t1,t2]
test.sort(reverse = True)
if test == t:
print("YES")
else:
print("NO")
``` | instruction | 0 | 4,451 | 17 | 8,902 |
No | output | 1 | 4,451 | 17 | 8,903 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1 | instruction | 0 | 4,540 | 17 | 9,080 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
import sys
import math
import collections
import heapq
import decimal
input=sys.stdin.readline
n,k=(int(i) for i in input().split())
if(n*k>(n*(n-1))//2):
print(-1)
else:
print(n*k)
for i in range(1,n+1):
c=0
if(i==n):
j=1
else:
j=i+1
while(c<k):
print(i,j)
if(j==n):
j=1
else:
j+=1
c+=1
``` | output | 1 | 4,540 | 17 | 9,081 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1 | instruction | 0 | 4,541 | 17 | 9,082 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
#code by AanchalTiwari
n, k = map(int, input().split())
if n < 2 * k + 1:
print(-1)
else:
print(n*k)
for i in range(1, n + 1):
c = 1
while c <= k:
a = i
b = i+c
if i + c > n:
a = i
b = (i+c) % n
print(a, b)
c = c + 1
``` | output | 1 | 4,541 | 17 | 9,083 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1 | instruction | 0 | 4,542 | 17 | 9,084 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
n,k=map(int,input().split())
if n<2*k+1:
print(-1)
else:
print(n*k)
l=range(1,n+1)
x=n-k
for i in range(x):
v=l[i]
for z in range(k):
print(v,v+1+z)
for i in range(x,n):
v=l[i]
for z in range(k):
if k-(n-v)>z:
print(v,z+1)
if z+1<=n-v:
print(v,v+1+z)
``` | output | 1 | 4,542 | 17 | 9,085 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1 | instruction | 0 | 4,543 | 17 | 9,086 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
from sys import stdin,stdout
from collections import *
from math import ceil, floor , log, gcd
st=lambda:list(stdin.readline().strip())
li=lambda:list(map(int,stdin.readline().split()))
mp=lambda:map(int,stdin.readline().split())
inp=lambda:int(stdin.readline())
pr=lambda n: stdout.write(str(n)+"\n")
mod=1000000007
INF=float('inf')
def solve():
n,k=mp()
x= (n*(n-1)) >>1
if n*k>x:
pr(-1)
return
ans=[]
for i in range(1,n+1):
for j in range(i+1,i+k+1):
if j==n:
ans.append((i,n))
else:
ans.append((i,j%n))
print(len(ans))
for i in ans:
print(*i)
for _ in range(1):
solve()
``` | output | 1 | 4,543 | 17 | 9,087 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1 | instruction | 0 | 4,544 | 17 | 9,088 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
n,k=map(int,input().split())
if(k>(n-1)//2):
print(-1)
else:
print(n*k)
for i in range(1,n+1):
for j in range(k):
print(i,(i+j)%n+1)
``` | output | 1 | 4,544 | 17 | 9,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1 | instruction | 0 | 4,545 | 17 | 9,090 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
n, k = map(int, input().split())
if k > (n - 1) // 2:
print(-1)
else:
print(n * k)
for i in range(n):
for j in range(k):
l = i
r = (l + j + 1)
print(l + 1, r%n + 1)
``` | output | 1 | 4,545 | 17 | 9,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1 | instruction | 0 | 4,546 | 17 | 9,092 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
n,k=map(int,input().split())
if n<2*k+1:
print(-1)
else:
print(n*k)
for i in range(1,n+1):
for z in range(k):
print(i,(i+z)%n+1)
``` | output | 1 | 4,546 | 17 | 9,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1 | instruction | 0 | 4,547 | 17 | 9,094 |
Tags: constructive algorithms, graphs, implementation
Correct Solution:
```
import sys,os,io
import math,bisect,operator
inf,mod = float('inf'),10**9+7
# sys.setrecursionlimit(10 ** 6)
from itertools import groupby,accumulate
from heapq import heapify,heappop,heappush
from collections import deque,Counter,defaultdict
I = lambda : int(sys.stdin.buffer.readline())
Neo = lambda : list(map(int, sys.stdin.buffer.readline().split()))
n,k = Neo()
if 2*k > n-1:
print(-1)
else:
print(n*k)
for i in range(1,n+1):
for j in range(i+1,k+i+1):
if j > n:
j = j%n
print(i,j)
``` | output | 1 | 4,547 | 17 | 9,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1
Submitted Solution:
```
# Author : nitish420 --------------------------------------------------------------------
import os
import sys
from io import BytesIO, IOBase
def main():
n,k=map(int,input().split())
if n<(k<<1)+1:
print(-1)
exit()
# each team will hae 2k edges
print(n*k)
for i in range(1,n+1):
j=i+1
z=k
while z:
if j==n+1:
j=1
print(i,j)
z-=1
j+=1
#----------------------------------------------------------------------------------------
# region fastio
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 file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b'\n') + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# endregion
if __name__ == '__main__':
main()
``` | instruction | 0 | 4,548 | 17 | 9,096 |
Yes | output | 1 | 4,548 | 17 | 9,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1
Submitted Solution:
```
import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
#sys.setrecursionlimit(200000000)
int1 = lambda x: int(x) - 1
#def input(): return sys.stdin.readline().strip()
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: map(int,input().split())
alele = lambda: list(map(int, input().split()))
ilelec = lambda: map(int1,input().split())
alelec = lambda: list(map(int1, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
#MOD = 1000000000 + 7
def Y(c): print(["NO","YES"][c])
def y(c): print(["no","yes"][c])
def Yy(c): print(["No","Yes"][c])
n,k = ilele()
if not(2*k <= n-1):
print(-1)
else:
print(n*k)
for i in range(1,n+1):
for j in range(i+1,i+1+k):
if j > n:
j = j - n
print(i,j)
``` | instruction | 0 | 4,549 | 17 | 9,098 |
Yes | output | 1 | 4,549 | 17 | 9,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1
Submitted Solution:
```
n, k = [int(i) for i in input().split()]
if k > n // 2 or n < 3 or n == 2*k:
print(-1)
exit()
print(n * k)
arr = list(range(1, n + 1)) + list(range(1, n // 2 + 1))
for i in range(arr[arr.index(max(arr))] ):
for j in range(1, k + 1):
print(arr[i], arr[j + i])
``` | instruction | 0 | 4,550 | 17 | 9,100 |
Yes | output | 1 | 4,550 | 17 | 9,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day, at the "Russian Code Cup" event it was decided to play football as an out of competition event. All participants was divided into n teams and played several matches, two teams could not play against each other more than once.
The appointed Judge was the most experienced member — Pavel. But since he was the wisest of all, he soon got bored of the game and fell asleep. Waking up, he discovered that the tournament is over and the teams want to know the results of all the matches.
Pavel didn't want anyone to discover about him sleeping and not keeping an eye on the results, so he decided to recover the results of all games. To do this, he asked all the teams and learned that the real winner was friendship, that is, each team beat the other teams exactly k times. Help Pavel come up with chronology of the tournir that meets all the conditions, or otherwise report that there is no such table.
Input
The first line contains two integers — n and k (1 ≤ n, k ≤ 1000).
Output
In the first line print an integer m — number of the played games. The following m lines should contain the information about all the matches, one match per line. The i-th line should contain two integers ai and bi (1 ≤ ai, bi ≤ n; ai ≠ bi). The numbers ai and bi mean, that in the i-th match the team with number ai won against the team with number bi. You can assume, that the teams are numbered from 1 to n.
If a tournir that meets the conditions of the problem does not exist, then print -1.
Examples
Input
3 1
Output
3
1 2
2 3
3 1
Submitted Solution:
```
n, k = map(int, input().strip().split())
if 2 * k > (n - 1):
print('-1')
else:
r = [str(n * k)]
for i in range(1, n+1):
for j in range(k):
r.append(str(i) + ' ' + str((i + j) % n + 1))
print('\n'.join(r))
``` | instruction | 0 | 4,551 | 17 | 9,102 |
Yes | output | 1 | 4,551 | 17 | 9,103 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.