message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.
Find the shortest p... | instruction | 0 | 102,690 | 5 | 205,380 |
"Correct Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
def c(x):
cnt=0
for i in a:
cnt += (i - 1) // x
return cnt <= k
l, r = 0, max(a)
while l + 1 < r:
mid = (l + r) // 2
if c(mid):
r = mid
else:
l = mid
print(r)
``` | output | 1 | 102,690 | 5 | 205,381 |
Provide a correct Python 3 solution for this coding contest problem.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.
Find the shortest p... | instruction | 0 | 102,691 | 5 | 205,382 |
"Correct Solution:
```
n,k = map(int,input().split())
a = list(map(int,input().split()))
def ok(arg):
cnt = 0
for log in a:
cnt += -(-log//arg)
cnt -= 1
return cnt<=k
st,en = 0,max(a)
mid = 0
while en-st>1:
mid = (en+st)//2
if ok(mid):
en = mid
else:
st = mid
print(en)
``` | output | 1 | 102,691 | 5 | 205,383 |
Provide a correct Python 3 solution for this coding contest problem.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.
Find the shortest p... | instruction | 0 | 102,692 | 5 | 205,384 |
"Correct Solution:
```
import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
l, r = (A[0], 1)
def is_ok(c):
x = sum([math.ceil(a/c)-1 for a in A])
return x <= K
l, r = max(A), 0
while l - r > 1:
c = (l + r) // 2
if is_ok(c):
l = c
else:
r = c
print(... | output | 1 | 102,692 | 5 | 205,385 |
Provide a correct Python 3 solution for this coding contest problem.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.
Find the shortest p... | instruction | 0 | 102,693 | 5 | 205,386 |
"Correct Solution:
```
n,k=map(int,input().split())
A=list(map(int,input().split()))
ng=0
ok=10**10
while ok-ng>1:
mid=(ok+ng)//2
c=0
for i in range(n):
c=c+(A[i]+mid-1)//mid
if c>k+n:
ng=mid
else:
ok=mid
print(ok)
``` | output | 1 | 102,693 | 5 | 205,387 |
Provide a correct Python 3 solution for this coding contest problem.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.
Find the shortest p... | instruction | 0 | 102,694 | 5 | 205,388 |
"Correct Solution:
```
n, k, *aa = map(int, open(0).read().split())
imp = 0
psbl = 10**9
while psbl - imp > 1:
mid = (psbl + imp) // 2
cost = sum(0--a//mid - 1 for a in aa)
if cost <= k:
psbl = mid
else:
imp = mid
print(psbl)
``` | output | 1 | 102,694 | 5 | 205,389 |
Provide a correct Python 3 solution for this coding contest problem.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.
Find the shortest p... | instruction | 0 | 102,695 | 5 | 205,390 |
"Correct Solution:
```
import bisect
n,k = map(int, input().split())
a = sorted(list(map(int, input().split())))
def cnt(x):
ret = 0
for ai in a:
ret += (ai+(x-1))//x - 1
return ret
ok, ng = a[-1], 0
while ok - ng > 1:
nw = (ok + ng) // 2
if cnt(nw)<=k:
ok = nw
else:
ng = nw
print(ok)
``` | output | 1 | 102,695 | 5 | 205,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it bec... | instruction | 0 | 102,696 | 5 | 205,392 |
Yes | output | 1 | 102,696 | 5 | 205,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it bec... | instruction | 0 | 102,697 | 5 | 205,394 |
Yes | output | 1 | 102,697 | 5 | 205,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it bec... | instruction | 0 | 102,698 | 5 | 205,396 |
Yes | output | 1 | 102,698 | 5 | 205,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it bec... | instruction | 0 | 102,699 | 5 | 205,398 |
Yes | output | 1 | 102,699 | 5 | 205,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it bec... | instruction | 0 | 102,701 | 5 | 205,402 |
No | output | 1 | 102,701 | 5 | 205,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N logs of lengths A_1,A_2,\cdots A_N.
We can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it bec... | instruction | 0 | 102,703 | 5 | 205,406 |
No | output | 1 | 102,703 | 5 | 205,407 |
Provide a correct Python 3 solution for this coding contest problem.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the number of ways to choose two of the N+M balls (disregardi... | instruction | 0 | 102,704 | 5 | 205,408 |
"Correct Solution:
```
N,M=map(int,input().split())
print((M*(M-1)+N*(N-1))//2)
``` | output | 1 | 102,704 | 5 | 205,409 |
Provide a correct Python 3 solution for this coding contest problem.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the number of ways to choose two of the N+M balls (disregardi... | instruction | 0 | 102,705 | 5 | 205,410 |
"Correct Solution:
```
N,M = map(int,input().split())
all = (M*(M-1)+N*(N-1))//2
print(all)
``` | output | 1 | 102,705 | 5 | 205,411 |
Provide a correct Python 3 solution for this coding contest problem.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the number of ways to choose two of the N+M balls (disregardi... | instruction | 0 | 102,706 | 5 | 205,412 |
"Correct Solution:
```
n,m = map(int,input().split())
print((m*(m-1))//2+(n*(n-1))//2)
``` | output | 1 | 102,706 | 5 | 205,413 |
Provide a correct Python 3 solution for this coding contest problem.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the number of ways to choose two of the N+M balls (disregardi... | instruction | 0 | 102,707 | 5 | 205,414 |
"Correct Solution:
```
a,b=map(int,input().split())
print(int(a*(a-1)/2+b*(b-1)//2))
``` | output | 1 | 102,707 | 5 | 205,415 |
Provide a correct Python 3 solution for this coding contest problem.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the number of ways to choose two of the N+M balls (disregardi... | instruction | 0 | 102,708 | 5 | 205,416 |
"Correct Solution:
```
m,n = map(int, input().split())
print(n*(n-1)//2+m*(m-1)//2)
``` | output | 1 | 102,708 | 5 | 205,417 |
Provide a correct Python 3 solution for this coding contest problem.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the number of ways to choose two of the N+M balls (disregardi... | instruction | 0 | 102,709 | 5 | 205,418 |
"Correct Solution:
```
N,M = map(int,input().split())
print(((N-1)*N+(M-1)*M)//2)
``` | output | 1 | 102,709 | 5 | 205,419 |
Provide a correct Python 3 solution for this coding contest problem.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the number of ways to choose two of the N+M balls (disregardi... | instruction | 0 | 102,710 | 5 | 205,420 |
"Correct Solution:
```
n,m = map(int,input().split())
print(((n*(n-1)) + m*(m-1))//2)
``` | output | 1 | 102,710 | 5 | 205,421 |
Provide a correct Python 3 solution for this coding contest problem.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the number of ways to choose two of the N+M balls (disregardi... | instruction | 0 | 102,711 | 5 | 205,422 |
"Correct Solution:
```
a, b = map(int, input().split())
y=a*(a-1)/2+b*(b-1)/2
print(int(y))
``` | output | 1 | 102,711 | 5 | 205,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the n... | instruction | 0 | 102,712 | 5 | 205,424 |
Yes | output | 1 | 102,712 | 5 | 205,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the n... | instruction | 0 | 102,713 | 5 | 205,426 |
Yes | output | 1 | 102,713 | 5 | 205,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the n... | instruction | 0 | 102,714 | 5 | 205,428 |
Yes | output | 1 | 102,714 | 5 | 205,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the n... | instruction | 0 | 102,715 | 5 | 205,430 |
Yes | output | 1 | 102,715 | 5 | 205,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the n... | instruction | 0 | 102,716 | 5 | 205,432 |
No | output | 1 | 102,716 | 5 | 205,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the n... | instruction | 0 | 102,717 | 5 | 205,434 |
No | output | 1 | 102,717 | 5 | 205,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the n... | instruction | 0 | 102,718 | 5 | 205,436 |
No | output | 1 | 102,718 | 5 | 205,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N+M balls, each of which has an integer written on it.
It is known that:
* The numbers written on N of the balls are even.
* The numbers written on M of the balls are odd.
Find the n... | instruction | 0 | 102,719 | 5 | 205,438 |
No | output | 1 | 102,719 | 5 | 205,439 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it does not exist, print -1.
Constraints
* 1 ≤ X,Y ≤ 10^9... | instruction | 0 | 102,784 | 5 | 205,568 |
"Correct Solution:
```
X, Y = [int(i) for i in input().split()]
if X % Y == 0:
print(-1)
else:
print(X)
``` | output | 1 | 102,784 | 5 | 205,569 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it does not exist, print -1.
Constraints
* 1 ≤ X,Y ≤ 10^9... | instruction | 0 | 102,785 | 5 | 205,570 |
"Correct Solution:
```
x,y=map(int,input().split())
print(-1 if x%y==0 else x*(y-1))
``` | output | 1 | 102,785 | 5 | 205,571 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it does not exist, print -1.
Constraints
* 1 ≤ X,Y ≤ 10^9... | instruction | 0 | 102,786 | 5 | 205,572 |
"Correct Solution:
```
x,y=map(int,input().split())
a=x*(y-1)
if a%y==0:
print(-1)
else:
print(a)
``` | output | 1 | 102,786 | 5 | 205,573 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it does not exist, print -1.
Constraints
* 1 ≤ X,Y ≤ 10^9... | instruction | 0 | 102,787 | 5 | 205,574 |
"Correct Solution:
```
x, y = input().split()
x = int(x)
y = int(y)
if x % y == 0:
print(-1)
else:
print(x * (y + 1))
``` | output | 1 | 102,787 | 5 | 205,575 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it does not exist, print -1.
Constraints
* 1 ≤ X,Y ≤ 10^9... | instruction | 0 | 102,788 | 5 | 205,576 |
"Correct Solution:
```
x, y=map(int, input().split())
print(-1 if x%y==0 else x)
``` | output | 1 | 102,788 | 5 | 205,577 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it does not exist, print -1.
Constraints
* 1 ≤ X,Y ≤ 10^9... | instruction | 0 | 102,789 | 5 | 205,578 |
"Correct Solution:
```
X, Y = map(int, input().split())
a = X / Y
if a == int(a):
ans = -1
else:
ans = X
print(ans)
``` | output | 1 | 102,789 | 5 | 205,579 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it does not exist, print -1.
Constraints
* 1 ≤ X,Y ≤ 10^9... | instruction | 0 | 102,790 | 5 | 205,580 |
"Correct Solution:
```
X, Y = map(int, input().split())
ans = (Y - 1) * X
if ans % Y == 0:
print(-1)
else:
print(ans)
``` | output | 1 | 102,790 | 5 | 205,581 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it does not exist, print -1.
Constraints
* 1 ≤ X,Y ≤ 10^9... | instruction | 0 | 102,791 | 5 | 205,582 |
"Correct Solution:
```
#15:15
x,y = map(int,input().split())
if x % y == 0:
print(-1)
else:
print(x)
``` | output | 1 | 102,791 | 5 | 205,583 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it ... | instruction | 0 | 102,792 | 5 | 205,584 |
Yes | output | 1 | 102,792 | 5 | 205,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it ... | instruction | 0 | 102,793 | 5 | 205,586 |
Yes | output | 1 | 102,793 | 5 | 205,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it ... | instruction | 0 | 102,794 | 5 | 205,588 |
Yes | output | 1 | 102,794 | 5 | 205,589 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it ... | instruction | 0 | 102,795 | 5 | 205,590 |
Yes | output | 1 | 102,795 | 5 | 205,591 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it ... | instruction | 0 | 102,796 | 5 | 205,592 |
No | output | 1 | 102,796 | 5 | 205,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it ... | instruction | 0 | 102,797 | 5 | 205,594 |
No | output | 1 | 102,797 | 5 | 205,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it ... | instruction | 0 | 102,798 | 5 | 205,596 |
No | output | 1 | 102,798 | 5 | 205,597 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given positive integers X and Y. If there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it. If it ... | instruction | 0 | 102,799 | 5 | 205,598 |
No | output | 1 | 102,799 | 5 | 205,599 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input Format
The input format is following:
n m q
a_1 a_2 ... a_q
Output Format
Print the number of connected part in one line.
Constraints
* n ≤ 10^{12}
* 7n is divisible by m.
* 1 ≤ ... | instruction | 0 | 102,802 | 5 | 205,604 |
No | output | 1 | 102,802 | 5 | 205,605 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
2 10 6
4 4 E
6 4 W
Output
2 | instruction | 0 | 102,846 | 5 | 205,692 |
"Correct Solution:
```
N, W, D = map(int, input().split())
def calc(x0, y0, dx, dy):
s = min(W - x0 if dx >= 0 else x0, D - y0 if dy >= 0 else y0)
x = x0 + dx*s; y = y0 + dy*s
assert x in [0, W] or y in [0, D], (x, y)
if y == 0:
return x
if x == W:
return W+y
if y == D:
r... | output | 1 | 102,846 | 5 | 205,693 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints small/large/equal relation of given two integers a and b.
Constraints
* -1000 ≤ a, b ≤ 1000
Input
Two integers a and b separated by a single space are given in a line.
Output
For given two integers a and b, print
... | instruction | 0 | 102,869 | 5 | 205,738 |
"Correct Solution:
```
a,b = list(map(int,input().split()))
if a > b:
print("a > b")
elif a == b:
print("a == b")
else:
print("a < b")
``` | output | 1 | 102,869 | 5 | 205,739 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints small/large/equal relation of given two integers a and b.
Constraints
* -1000 ≤ a, b ≤ 1000
Input
Two integers a and b separated by a single space are given in a line.
Output
For given two integers a and b, print
... | instruction | 0 | 102,870 | 5 | 205,740 |
"Correct Solution:
```
a, b = map(int, input().split())
c = "=="
if a < b:
c = '<'
elif a > b:
c = '>'
print ('a', c, 'b')
``` | output | 1 | 102,870 | 5 | 205,741 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints small/large/equal relation of given two integers a and b.
Constraints
* -1000 ≤ a, b ≤ 1000
Input
Two integers a and b separated by a single space are given in a line.
Output
For given two integers a and b, print
... | instruction | 0 | 102,871 | 5 | 205,742 |
"Correct Solution:
```
a,b=map(int,input().split())
print('a','<'if a<b else'>'if a>b else'==','b')
``` | output | 1 | 102,871 | 5 | 205,743 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which prints small/large/equal relation of given two integers a and b.
Constraints
* -1000 ≤ a, b ≤ 1000
Input
Two integers a and b separated by a single space are given in a line.
Output
For given two integers a and b, print
... | instruction | 0 | 102,872 | 5 | 205,744 |
"Correct Solution:
```
a,b = list(map(int, input().split()))
if (a < b):
print("a < b")
elif (a > b):
print("a > b")
else :
print("a == b")
``` | output | 1 | 102,872 | 5 | 205,745 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.