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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits "1974".
Constraints
* 0 \leq N_1, N_2, N_3, N_4 \leq 9
* N_1, N_2, N_3 and N_4 are integers.
Input
Input is given from Standard Input in the following format:
N_1 N_2 N_3 N_4
Output
If N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits "1974", print `YES`; if they cannot, print `NO`.
Examples
Input
1 7 9 4
Output
YES
Input
1 9 7 4
Output
YES
Input
1 2 9 1
Output
NO
Input
4 9 0 8
Output
NO
Submitted Solution:
```
*N, = map(int, input().split())
if sorted(N) == [1, 4, 7, 9]:
print("YES")
else:
print("NO")
``` | instruction | 0 | 89,938 | 5 | 179,876 |
Yes | output | 1 | 89,938 | 5 | 179,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits "1974".
Constraints
* 0 \leq N_1, N_2, N_3, N_4 \leq 9
* N_1, N_2, N_3 and N_4 are integers.
Input
Input is given from Standard Input in the following format:
N_1 N_2 N_3 N_4
Output
If N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits "1974", print `YES`; if they cannot, print `NO`.
Examples
Input
1 7 9 4
Output
YES
Input
1 9 7 4
Output
YES
Input
1 2 9 1
Output
NO
Input
4 9 0 8
Output
NO
Submitted Solution:
```
print("YES" if sorted(input().split()) == ['1','4','7','9'] else "NO")
``` | instruction | 0 | 89,939 | 5 | 179,878 |
Yes | output | 1 | 89,939 | 5 | 179,879 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits "1974".
Constraints
* 0 \leq N_1, N_2, N_3, N_4 \leq 9
* N_1, N_2, N_3 and N_4 are integers.
Input
Input is given from Standard Input in the following format:
N_1 N_2 N_3 N_4
Output
If N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits "1974", print `YES`; if they cannot, print `NO`.
Examples
Input
1 7 9 4
Output
YES
Input
1 9 7 4
Output
YES
Input
1 2 9 1
Output
NO
Input
4 9 0 8
Output
NO
Submitted Solution:
```
N = sorted(list(map(str, input().split())))
print('YES' if ''.join(N) == '1479' else'NO')
``` | instruction | 0 | 89,940 | 5 | 179,880 |
Yes | output | 1 | 89,940 | 5 | 179,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits "1974".
Constraints
* 0 \leq N_1, N_2, N_3, N_4 \leq 9
* N_1, N_2, N_3 and N_4 are integers.
Input
Input is given from Standard Input in the following format:
N_1 N_2 N_3 N_4
Output
If N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits "1974", print `YES`; if they cannot, print `NO`.
Examples
Input
1 7 9 4
Output
YES
Input
1 9 7 4
Output
YES
Input
1 2 9 1
Output
NO
Input
4 9 0 8
Output
NO
Submitted Solution:
```
import sys
"""テンプレ"""
# 高速
input = sys.stdin.readline
# 1行を空白でリストにする(int)
def intline():
return list(map(int, input().split()))
# 上のstrヴァージョン
def strline():
return list(map(str, input().split()))
# 1列に並んだ数
def intlines(n):
return [int(input() for _ in range(n))]
# 上の文字列ヴァージョン
def lines(n):
return [input() for _ in range(n)]
"""ここからメインコード"""
k = intline().sort()
if k = [1, 4, 7, 9]:print("YES")
else:print("NO")
``` | instruction | 0 | 89,941 | 5 | 179,882 |
No | output | 1 | 89,941 | 5 | 179,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits "1974".
Constraints
* 0 \leq N_1, N_2, N_3, N_4 \leq 9
* N_1, N_2, N_3 and N_4 are integers.
Input
Input is given from Standard Input in the following format:
N_1 N_2 N_3 N_4
Output
If N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits "1974", print `YES`; if they cannot, print `NO`.
Examples
Input
1 7 9 4
Output
YES
Input
1 9 7 4
Output
YES
Input
1 2 9 1
Output
NO
Input
4 9 0 8
Output
NO
Submitted Solution:
```
s = input()
for i in range(7):
if s[:i] + s[-7 + i:] == "keyence":
print("YES")
exit()
print("NO")
``` | instruction | 0 | 89,942 | 5 | 179,884 |
No | output | 1 | 89,942 | 5 | 179,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits "1974".
Constraints
* 0 \leq N_1, N_2, N_3, N_4 \leq 9
* N_1, N_2, N_3 and N_4 are integers.
Input
Input is given from Standard Input in the following format:
N_1 N_2 N_3 N_4
Output
If N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits "1974", print `YES`; if they cannot, print `NO`.
Examples
Input
1 7 9 4
Output
YES
Input
1 9 7 4
Output
YES
Input
1 2 9 1
Output
NO
Input
4 9 0 8
Output
NO
Submitted Solution:
```
n= sort(list(int,input().split()))
if n == [1,7,9,4]:
print("YES")
else:
print("NO")
``` | instruction | 0 | 89,943 | 5 | 179,886 |
No | output | 1 | 89,943 | 5 | 179,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits "1974".
Constraints
* 0 \leq N_1, N_2, N_3, N_4 \leq 9
* N_1, N_2, N_3 and N_4 are integers.
Input
Input is given from Standard Input in the following format:
N_1 N_2 N_3 N_4
Output
If N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits "1974", print `YES`; if they cannot, print `NO`.
Examples
Input
1 7 9 4
Output
YES
Input
1 9 7 4
Output
YES
Input
1 2 9 1
Output
NO
Input
4 9 0 8
Output
NO
Submitted Solution:
```
from bisect import bisect
def inpl(): return list(map(int, input().split()))
MOD = 10**9 + 7
N, M = inpl()
A = sorted(inpl())
B = sorted(inpl())
A_set = set(A)
B_set = set(B)
ans = 1
for x in range(N*M, 0, -1):
if (x in A_set) and (x in B_set):
tmp = 1
elif x in A_set:
tmp = max(M - bisect(B, x), 0)%MOD
elif x in B_set:
tmp = max(N - bisect(A, x), 0)%MOD
else:
a = bisect(A, x)
b = bisect(B, x)
tmp = max(x - N*b - M*a + a*b, 0)%MOD
ans = (tmp*ans)%MOD
print(ans)
``` | instruction | 0 | 89,944 | 5 | 179,888 |
No | output | 1 | 89,944 | 5 | 179,889 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
anagram
grandmother
Output
4 | instruction | 0 | 90,054 | 5 | 180,108 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
mod2 = 10**9+9
sa = [S() for _ in range(2)]
ml = min(map(len, sa))
ss = []
r = 0
for si in range(2):
s = sa[si]
a = [0]
a2 = [0]
b = [set() for _ in range(ml)]
b2 = [set() for _ in range(ml)]
for c in s:
k = 97 ** (ord(c) - ord('a'))
a.append((a[-1] + k) % mod)
a2.append((a2[-1] + k) % mod2)
if si == 1:
for i in range(len(a)):
for j in range(i+1,len(a)):
if j - i > ml:
break
if j - i <= r:
continue
if (a[j]-a[i]) % mod in ss[0][j-i-1] and (a2[j]-a2[i]) % mod2 in ss[1][j-i-1]:
r = j-i
else:
for i in range(len(a)):
for j in range(i+1,len(a)):
if j - i > ml:
break
b[j-i-1].add((a[j]-a[i]) % mod)
b2[j-i-1].add((a2[j]-a2[i]) % mod2)
ss = [b,b2]
return r
print(main())
``` | output | 1 | 90,054 | 5 | 180,109 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Given the integer n, output the smallest m such that nCm (the number of combinations that choose m out of n different ones) is even.
Constraints
The input satisfies the following conditions.
* 1 ≤ n ≤ 1018
Input
The input is given in the following format.
n
Output
Output the minimum m such that nCm is an even number on one line.
Examples
Input
2
Output
1
Input
111
Output
16
Input
3
Output
4 | instruction | 0 | 90,062 | 5 | 180,124 |
"Correct Solution:
```
n = int(input())
print((n+1) &- (n+1))
``` | output | 1 | 90,062 | 5 | 180,125 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Given the integer n, output the smallest m such that nCm (the number of combinations that choose m out of n different ones) is even.
Constraints
The input satisfies the following conditions.
* 1 ≤ n ≤ 1018
Input
The input is given in the following format.
n
Output
Output the minimum m such that nCm is an even number on one line.
Examples
Input
2
Output
1
Input
111
Output
16
Input
3
Output
4 | instruction | 0 | 90,063 | 5 | 180,126 |
"Correct Solution:
```
n=int(input())+1;print(n&-~~n)
``` | output | 1 | 90,063 | 5 | 180,127 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Given the integer n, output the smallest m such that nCm (the number of combinations that choose m out of n different ones) is even.
Constraints
The input satisfies the following conditions.
* 1 ≤ n ≤ 1018
Input
The input is given in the following format.
n
Output
Output the minimum m such that nCm is an even number on one line.
Examples
Input
2
Output
1
Input
111
Output
16
Input
3
Output
4 | instruction | 0 | 90,064 | 5 | 180,128 |
"Correct Solution:
```
n = int(input()) + 1
print(n &- n)
``` | output | 1 | 90,064 | 5 | 180,129 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Problem
Given the integer n, output the smallest m such that nCm (the number of combinations that choose m out of n different ones) is even.
Constraints
The input satisfies the following conditions.
* 1 ≤ n ≤ 1018
Input
The input is given in the following format.
n
Output
Output the minimum m such that nCm is an even number on one line.
Examples
Input
2
Output
1
Input
111
Output
16
Input
3
Output
4
Submitted Solution:
```
def nCm(n, k):
C = [1] + [0 for i in range(1, k+1)]
for i in range(1, n+1):
j = min(i, k)
while j > 0:
C[j] += C[j-1]
j -= 1
return C[k]
n = int(input())
k = 1
while nCm(n, k) % 2:
k += 1
print(k)
``` | instruction | 0 | 90,065 | 5 | 180,130 |
No | output | 1 | 90,065 | 5 | 180,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imp is really pleased that you helped him. But it you solve the last problem, his gladness would raise even more.
<image> Let's define <image> for some set of integers <image> as the number of pairs a, b in <image>, such that:
* a is strictly less than b;
* a divides b without a remainder.
You are to find such a set <image>, which is a subset of {1, 2, ..., n} (the set that contains all positive integers not greater than n), that <image>.
Input
The only line contains two integers n and k <image>.
Output
If there is no answer, print "No".
Otherwise, in the first line print "Yes", in the second — an integer m that denotes the size of the set <image> you have found, in the second line print m integers — the elements of the set <image>, in any order.
If there are multiple answers, print any of them.
Examples
Input
3 3
Output
No
Input
6 6
Output
Yes
5
1 2 4 5 6
Input
8 3
Output
Yes
4
2 4 5 8
Note
In the second sample, the valid pairs in the output set are (1, 2), (1, 4), (1, 5), (1, 6), (2, 4), (2, 6). Thus, <image>.
In the third example, the valid pairs in the output set are (2, 4), (4, 8), (2, 8). Thus, <image>.
Submitted Solution:
```
n,k=list(map(int,input().split()))
if ( n==300000 and k==1000000000)or ( n==300000 and k==3529833):
if ( n==300000 and k==1000000000):
print("No")
else:
print(n)
for i in range(1,n+1):
print(i, end=" ")
else:
s=[1 for i in range(n)]
s[0]=0
for i in range(2,n//2+1):
x=i+i
while x<=n:
s[x-1]+=1
x+=i
k1=0; lim=0
for i in range(n):
k1+=s[i]
if k1 >=k:
lim =i
break
dif=k1-k
if dif<0 :
print("No")
else:
print("Yes")
for i in range(lim//2+1):
s[i]+=(lim+1)//(i+1)-1
t=True
print(lim)
for i in range(lim+1):
if t:
if s[i]!=dif:
print(i+1,end=" ")
else:
t=False
else:
print(i+1,end=" ")
``` | instruction | 0 | 90,660 | 5 | 181,320 |
No | output | 1 | 90,660 | 5 | 181,321 |
Provide a correct Python 3 solution for this coding contest problem.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991 | instruction | 0 | 90,710 | 5 | 181,420 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
N, *AB = map(int, sys.stdin.buffer.read().split())
A = sorted(AB[::2])
B = sorted(AB[1::2])
center = N//2
if N%2==1:
print(B[center]-A[center]+1)
else:
print((B[center]+B[center-1])-(A[center]+A[center-1])+1)
``` | output | 1 | 90,710 | 5 | 181,421 |
Provide a correct Python 3 solution for this coding contest problem.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991 | instruction | 0 | 90,711 | 5 | 181,422 |
"Correct Solution:
```
N = int(input())
A = []
B = []
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
i = N//2
if N%2 == 0:
print(B[i]+B[i-1]-A[i]-A[i-1]+1)
else:
print(B[i]-A[i]+1)
``` | output | 1 | 90,711 | 5 | 181,423 |
Provide a correct Python 3 solution for this coding contest problem.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991 | instruction | 0 | 90,712 | 5 | 181,424 |
"Correct Solution:
```
n = int(input())
a = [0]*n
b = [0]*n
for i in range(n):
a[i], b[i] = map(int, input().split())
a.sort()
b.sort()
if n%2:
k1 = a[n//2]
k2 = b[n//2]
else:
k1 = a[n//2-1]+a[n//2]
k2 = b[n//2-1]+b[n//2]
ans = k2-k1+1
print(ans)
``` | output | 1 | 90,712 | 5 | 181,425 |
Provide a correct Python 3 solution for this coding contest problem.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991 | instruction | 0 | 90,713 | 5 | 181,426 |
"Correct Solution:
```
n = int(input())
min = []
max = []
for i in range(n):
a, b = map(int, input().split())
min.append(a)
max.append(b)
min.sort()
max.sort()
if n%2 == 0:
print((max[n//2] + max[n//2 - 1]) -(min[n//2] + min[n//2 - 1])+ 1)
else:
print(max[n//2]-min[n//2]+1)
``` | output | 1 | 90,713 | 5 | 181,427 |
Provide a correct Python 3 solution for this coding contest problem.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991 | instruction | 0 | 90,714 | 5 | 181,428 |
"Correct Solution:
```
n=int(input())
aa=[]
bb=[]
for _ in range(n):
a,b=map(int,input().split())
aa.append(a)
bb.append(b)
aa.sort()
bb.sort()
if n%2==1:
print(bb[n//2]-aa[n//2]+1)
else:
am=aa[n//2]+aa[n//2-1]
bm=bb[n//2]+bb[n//2-1]
print(bm-am+1)
``` | output | 1 | 90,714 | 5 | 181,429 |
Provide a correct Python 3 solution for this coding contest problem.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991 | instruction | 0 | 90,715 | 5 | 181,430 |
"Correct Solution:
```
n=int(input(""))
a=[]
b=[]
for i in range(n):
cc=input("").split(" ")
a+=[int(cc[0])]
b+=[int(cc[1])]
s=0
a.sort()
b.sort()
if (n%2==0):
s=(a[int(n/2)]+a[int(n/2)-1]-b[int(n/2)]-b[int(n/2)-1])
else:
s=a[int((n-1)/2)]-b[int((n-1)/2)]
print(int(-s+1))
``` | output | 1 | 90,715 | 5 | 181,431 |
Provide a correct Python 3 solution for this coding contest problem.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991 | instruction | 0 | 90,716 | 5 | 181,432 |
"Correct Solution:
```
n,*ab=map(int,open(0).read().split())
a=ab[::2]
b=ab[1::2]
m=n//2
a.sort()
b.sort()
ans=0
if n&1==1:
ans=b[m]-a[m]+1
else:
ans=int(2*((b[m]+b[m-1])/2-(a[m]+a[m-1])/2))
ans+=1
print(ans)
``` | output | 1 | 90,716 | 5 | 181,433 |
Provide a correct Python 3 solution for this coding contest problem.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991 | instruction | 0 | 90,717 | 5 | 181,434 |
"Correct Solution:
```
n=int(input())
a=[0]*n
b=[0]*n
for i in range(n):
a[i],b[i]=map(int,input().split())
a.sort()
b.sort()
if n%2:ans=b[n//2]-a[n//2]+1
else:ans=b[(n-1)//2+1]-a[(n-1)//2+1]+b[(n-1)//2]-a[(n-1)//2]+1
print(ans)
``` | output | 1 | 90,717 | 5 | 181,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991
Submitted Solution:
```
n,*l=map(int,open(0).read().split())
m,M=sorted(l[::2]),sorted(l[1::2])
d=n//2
print(M[d]-m[d]+1+(M[d-1]+-m[d-1])*(n%2^1))
``` | instruction | 0 | 90,718 | 5 | 181,436 |
Yes | output | 1 | 90,718 | 5 | 181,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991
Submitted Solution:
```
N = int(input())
A = [0]*N
B = [0]*N
for i in range(N):
A[i],B[i] = map(int, input().split())
A.sort()
B.sort()
if len(A)%2 != 0:
ans = B[N//2]-A[N//2]+1
else:
ans = (B[N//2]+B[N//2-1]) - (A[N//2]+A[N//2-1]) + 1
print(ans)
``` | instruction | 0 | 90,719 | 5 | 181,438 |
Yes | output | 1 | 90,719 | 5 | 181,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991
Submitted Solution:
```
N=int(input())
A=[]
B=[]
for i in range(N):
a,b=map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
M=N//2
if N%2:
print(B[M]-A[M]+1)
else:
print((B[M-1]+B[M]) - (A[M-1]+A[M]) + 1)
``` | instruction | 0 | 90,720 | 5 | 181,440 |
Yes | output | 1 | 90,720 | 5 | 181,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991
Submitted Solution:
```
n=int(input())
a,b=[],[]
for i in range(n):
inp=list(map(int,input().split()))
a.append(inp[0])
b.append(inp[1])
a.sort()
b.sort()
am=sum(a[(n-1)//2:n//2+1])
bm=sum(b[(n-1)//2:n//2+1])
print(bm-am+1)
``` | instruction | 0 | 90,721 | 5 | 181,442 |
Yes | output | 1 | 90,721 | 5 | 181,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991
Submitted Solution:
```
n=int(input())
a=[0]*n
b=[0]*n
for i in range(n):
a[i],b[i]=map(int,input().split())
if n%2==1:
a_m = a[n//2]
b_m = b[n//2]
ans=max(b_m-a_m+1,0)
print(ans)
else:
a_m = (a[n//2]+a[n//2-1])
b_m = (b[n//2]+b[n//2-1])
ans = max(b_m-a_m+1,0)
print(ans)
``` | instruction | 0 | 90,722 | 5 | 181,444 |
No | output | 1 | 90,722 | 5 | 181,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991
Submitted Solution:
```
import statistics
n = int(input())
a_list = [0 for i in range(n)]
b_list = [0 for i in range(n)]
x_list = [(0,0) for i in range(n)]
for i in range(n):
a,b = map(int,input().split())
a_list[i] = a
b_list[i] = b
x_list[i] = (a,b)
a_sort = sorted(a_list)
b_sort = sorted(b_list)
a_med = statistics.median_low(a_list)
b_med = statistics.median_high(b_list)
print(b_med-a_med+1)
``` | instruction | 0 | 90,723 | 5 | 181,446 |
No | output | 1 | 90,723 | 5 | 181,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991
Submitted Solution:
```
N=int(input())
A=[]
B=[]
for i in range(N):
a,b=map(int,input().split())
A.append(a)
B.append(b)
if N%2==1:
print(B[N//2]-A[N//2]+1)
else:
A_chu=(A[N//2-1]+A[N//2])/2
B_chu=(B[N//2-1]+B[N//2])/2
ans=(B_chu-A_chu)*2+1
print(int(ans))
``` | instruction | 0 | 90,724 | 5 | 181,448 |
No | output | 1 | 90,724 | 5 | 181,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.
Constraints
* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
A_2 B_2
:
A_N B_N
Output
Print the answer.
Examples
Input
2
1 2
2 3
Output
3
Input
3
100 100
10 10000
1 1000000000
Output
9991
Submitted Solution:
```
import bisect
n = int(input())
l = []
r = []
for i in range(n):
a, b = map(int, input().split())
l.append(a)
r.append(b)
l.sort()
r.sort(reverse=True)
if n%2 == 1:
print(r[(n-1)//2]-l[(n-1)//2]+1)
else:
print(2*(r[(n-2)//2]-l[(n-2)//2])-1)
``` | instruction | 0 | 90,725 | 5 | 181,450 |
No | output | 1 | 90,725 | 5 | 181,451 |
Provide a correct Python 3 solution for this coding contest problem.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777 | instruction | 0 | 90,726 | 5 | 181,452 |
"Correct Solution:
```
a, b = map(int, input().split())
print(min(str(a) * b, a * str(b)))
``` | output | 1 | 90,726 | 5 | 181,453 |
Provide a correct Python 3 solution for this coding contest problem.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777 | instruction | 0 | 90,727 | 5 | 181,454 |
"Correct Solution:
```
a, b = input().split()
x = a * int(b)
y = b * int(a)
print(min(x, y))
``` | output | 1 | 90,727 | 5 | 181,455 |
Provide a correct Python 3 solution for this coding contest problem.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777 | instruction | 0 | 90,728 | 5 | 181,456 |
"Correct Solution:
```
A,B=map(int,input().split());print(str(min(A,B))*max(A,B))
``` | output | 1 | 90,728 | 5 | 181,457 |
Provide a correct Python 3 solution for this coding contest problem.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777 | instruction | 0 | 90,729 | 5 | 181,458 |
"Correct Solution:
```
a,b = input().split()
c = sorted([a*int(b),b*int(a)])
print(c[0])
``` | output | 1 | 90,729 | 5 | 181,459 |
Provide a correct Python 3 solution for this coding contest problem.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777 | instruction | 0 | 90,730 | 5 | 181,460 |
"Correct Solution:
```
A, B = input().split()
print(min(A*int(B), B*int(A)))
``` | output | 1 | 90,730 | 5 | 181,461 |
Provide a correct Python 3 solution for this coding contest problem.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777 | instruction | 0 | 90,731 | 5 | 181,462 |
"Correct Solution:
```
n,m=map(int,input().split())
print(min(str(n)*m,str(m)*n))
``` | output | 1 | 90,731 | 5 | 181,463 |
Provide a correct Python 3 solution for this coding contest problem.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777 | instruction | 0 | 90,732 | 5 | 181,464 |
"Correct Solution:
```
L=list(map(int,input().split()))
print(str(min(L))*max(L))
``` | output | 1 | 90,732 | 5 | 181,465 |
Provide a correct Python 3 solution for this coding contest problem.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777 | instruction | 0 | 90,733 | 5 | 181,466 |
"Correct Solution:
```
_,a,b=sorted(input());print(a*int(b))
``` | output | 1 | 90,733 | 5 | 181,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777
Submitted Solution:
```
a,b = input().split()
l = [a*int(b),b*int(a)]
l.sort()
print(l[0])
``` | instruction | 0 | 90,734 | 5 | 181,468 |
Yes | output | 1 | 90,734 | 5 | 181,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777
Submitted Solution:
```
N,M = map(int,input().split())
print((str(N)*M,str(M)*N)[N > M])
``` | instruction | 0 | 90,735 | 5 | 181,470 |
Yes | output | 1 | 90,735 | 5 | 181,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777
Submitted Solution:
```
a,b=map(int,input().split())
print(str(a)*b if a<b else a*str(b))
``` | instruction | 0 | 90,736 | 5 | 181,472 |
Yes | output | 1 | 90,736 | 5 | 181,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777
Submitted Solution:
```
a=sorted(input().split())
print(a[0]*int(a[1]))
``` | instruction | 0 | 90,737 | 5 | 181,474 |
Yes | output | 1 | 90,737 | 5 | 181,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777
Submitted Solution:
```
a, b = map(int,input().split())
A = list(str(a)*b,), B = list(str(b)*a)
C = max(len(A),len(B))
for i in range(C)
if A[i] > B[i]:
print(str(B))
break
elif B[i] > A[i]:
print(str(A))
break
``` | instruction | 0 | 90,738 | 5 | 181,476 |
No | output | 1 | 90,738 | 5 | 181,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777
Submitted Solution:
```
'''
INPUT SHORTCUTS
N, K = map(int,input().split())
N ,A,B = map(int,input().split())
string = str(input())
arr = list(map(int,input().split()))
N = int(input())
'''
a, b = map(int,input().split())
res = ''
if a<=b:
for _ in range(b):
res += 'b'
else:
for _ in range(a):
res += 'b'
print(res)
``` | instruction | 0 | 90,739 | 5 | 181,478 |
No | output | 1 | 90,739 | 5 | 181,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777
Submitted Solution:
```
a, b = map(int, input().split())
if a < b:
print(b*a)
else:
print(a*b)
``` | instruction | 0 | 90,740 | 5 | 181,480 |
No | output | 1 | 90,740 | 5 | 181,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?
Constraints
* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.
Input
Input is given from Standard Input in the following format:
a b
Output
Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)
Examples
Input
4 3
Output
3333
Input
7 7
Output
7777777
Submitted Solution:
```
a, b = map(int, input().split())
if a >= b:
print(b*((10**a -1)/9))
else:
print(a*((10**b -1)/9))
``` | instruction | 0 | 90,741 | 5 | 181,482 |
No | output | 1 | 90,741 | 5 | 181,483 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a positive integer X. Find the largest perfect power that is at most X. Here, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.
Constraints
* 1 ≤ X ≤ 1000
* X is an integer.
Input
Input is given from Standard Input in the following format:
X
Output
Print the largest perfect power that is at most X.
Examples
Input
10
Output
9
Input
1
Output
1
Input
999
Output
961 | instruction | 0 | 90,778 | 5 | 181,556 |
"Correct Solution:
```
X = int(input())
ans = 1
for i in range(2, X+1):
t = i*i
while t <= X:
ans = max(ans, t)
t *= i
print(ans)
``` | output | 1 | 90,778 | 5 | 181,557 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a positive integer X. Find the largest perfect power that is at most X. Here, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.
Constraints
* 1 ≤ X ≤ 1000
* X is an integer.
Input
Input is given from Standard Input in the following format:
X
Output
Print the largest perfect power that is at most X.
Examples
Input
10
Output
9
Input
1
Output
1
Input
999
Output
961 | instruction | 0 | 90,779 | 5 | 181,558 |
"Correct Solution:
```
x=int(input())
a=1
for i in range(2,x):
j=2
while i**j<=x:
a=max(a,i**j)
j+=1
print(a)
``` | output | 1 | 90,779 | 5 | 181,559 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a positive integer X. Find the largest perfect power that is at most X. Here, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.
Constraints
* 1 ≤ X ≤ 1000
* X is an integer.
Input
Input is given from Standard Input in the following format:
X
Output
Print the largest perfect power that is at most X.
Examples
Input
10
Output
9
Input
1
Output
1
Input
999
Output
961 | instruction | 0 | 90,780 | 5 | 181,560 |
"Correct Solution:
```
x = int(input())
ans = 0
for b in range(1,35):
for p in range(2,11):
if b**p <=x:
ans = max(b**p,ans)
print(ans)
``` | output | 1 | 90,780 | 5 | 181,561 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a positive integer X. Find the largest perfect power that is at most X. Here, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.
Constraints
* 1 ≤ X ≤ 1000
* X is an integer.
Input
Input is given from Standard Input in the following format:
X
Output
Print the largest perfect power that is at most X.
Examples
Input
10
Output
9
Input
1
Output
1
Input
999
Output
961 | instruction | 0 | 90,781 | 5 | 181,562 |
"Correct Solution:
```
N=int(input())
ans=[]
for i in range(1,32):
for k in range(2,11):
c=i**k
if c<=N:
ans.append(c)
print(max(ans))
``` | output | 1 | 90,781 | 5 | 181,563 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a positive integer X. Find the largest perfect power that is at most X. Here, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.
Constraints
* 1 ≤ X ≤ 1000
* X is an integer.
Input
Input is given from Standard Input in the following format:
X
Output
Print the largest perfect power that is at most X.
Examples
Input
10
Output
9
Input
1
Output
1
Input
999
Output
961 | instruction | 0 | 90,782 | 5 | 181,564 |
"Correct Solution:
```
X=int(input())
a=0
for i in range(40):
for j in range(2,20):
if i**j<=X:
a=max(a,i**j)
print(a)
``` | output | 1 | 90,782 | 5 | 181,565 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.