message stringlengths 2 57.2k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 61 108k | cluster float64 22 22 | __index_level_0__ int64 122 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Rec... | instruction | 0 | 85,744 | 22 | 171,488 |
Tags: math
Correct Solution:
```
q = int(input())
L = [0]*q
R = [0]*q
D = [0]*q
for i in range(q):
entrada = str(input()).split()
L[i] = int(entrada[0])
R[i] = int(entrada[1])
D[i] = int(entrada[2])
def find_x(l,r,d):
result = d
if l <= d <= r:
if r % d == 0:
result = r + d... | output | 1 | 85,744 | 22 | 171,489 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Rec... | instruction | 0 | 85,745 | 22 | 171,490 |
Tags: math
Correct Solution:
```
n = int(input())
for _ in range(n):
l,r,d = map(int,input().split())
if d<l:
print(d)
else:
a = r//d
print((a+1)*d)
``` | output | 1 | 85,745 | 22 | 171,491 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Rec... | instruction | 0 | 85,746 | 22 | 171,492 |
Tags: math
Correct Solution:
```
q=int(input())
for i in range(q):
p=input().split()
l=int(p[0])
r=int(p[1])
d=int(p[2])
if d<l:
print(d)
else:
print(r+d-r%d)
``` | output | 1 | 85,746 | 22 | 171,493 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Rec... | instruction | 0 | 85,747 | 22 | 171,494 |
Tags: math
Correct Solution:
```
for i in range(int(input())):
l, r, d = map(int, input().split())
if l <= d <= r:
print((r // d + 1)*d)
else:
print(d)
``` | output | 1 | 85,747 | 22 | 171,495 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l_i, r_i].
Can you answer all the queries?
Rec... | instruction | 0 | 85,748 | 22 | 171,496 |
Tags: math
Correct Solution:
```
q = int(input())
M = [list(map(int, input().split())) for i in range(q)]
S =[]
#x = 1
l = len(S)
for i in range(q):
x = 1
while True:
if x < M[i][0] or x > M[i][1]:
if x % M[i][2] == 0:
S.append(x)
break
else:
... | output | 1 | 85,748 | 22 | 171,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l... | instruction | 0 | 85,749 | 22 | 171,498 |
Yes | output | 1 | 85,749 | 22 | 171,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l... | instruction | 0 | 85,750 | 22 | 171,500 |
Yes | output | 1 | 85,750 | 22 | 171,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l... | instruction | 0 | 85,751 | 22 | 171,502 |
Yes | output | 1 | 85,751 | 22 | 171,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l... | instruction | 0 | 85,752 | 22 | 171,504 |
Yes | output | 1 | 85,752 | 22 | 171,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l... | instruction | 0 | 85,753 | 22 | 171,506 |
No | output | 1 | 85,753 | 22 | 171,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l... | instruction | 0 | 85,754 | 22 | 171,508 |
No | output | 1 | 85,754 | 22 | 171,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l... | instruction | 0 | 85,755 | 22 | 171,510 |
No | output | 1 | 85,755 | 22 | 171,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given q queries in the following form:
Given three integers l_i, r_i and d_i, find minimum positive integer x_i such that it is divisible by d_i and it does not belong to the segment [l... | instruction | 0 | 85,756 | 22 | 171,512 |
No | output | 1 | 85,756 | 22 | 171,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the number of ways to divide an array a of n integers into any number of disjoint non-empty segments so that, in each segment, there exist at most k distinct integers that appear exactly on... | instruction | 0 | 85,757 | 22 | 171,514 |
No | output | 1 | 85,757 | 22 | 171,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the number of ways to divide an array a of n integers into any number of disjoint non-empty segments so that, in each segment, there exist at most k distinct integers that appear exactly on... | instruction | 0 | 85,758 | 22 | 171,516 |
No | output | 1 | 85,758 | 22 | 171,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, ab2, ab3, ....
You are given n integer geometric progressions. Your task is to find the smalles... | instruction | 0 | 86,118 | 22 | 172,236 |
No | output | 1 | 86,118 | 22 | 172,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, ab2, ab3, ....
You are given n integer geometric progressions. Your task is to find the smalles... | instruction | 0 | 86,119 | 22 | 172,238 |
No | output | 1 | 86,119 | 22 | 172,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, ab2, ab3, ....
You are given n integer geometric progressions. Your task is to find the smalles... | instruction | 0 | 86,120 | 22 | 172,240 |
No | output | 1 | 86,120 | 22 | 172,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, ab2, ab3, ....
You are given n integer geometric progressions. Your task is to find the smalles... | instruction | 0 | 86,121 | 22 | 172,242 |
No | output | 1 | 86,121 | 22 | 172,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together. He cannot do any other calculation.
Given are two integers A and B.
If Takaha... | instruction | 0 | 86,342 | 22 | 172,684 |
No | output | 1 | 86,342 | 22 | 172,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
A proper divisor is a divisor of a number, exc... | instruction | 0 | 86,839 | 22 | 173,678 |
Tags: greedy, math
Correct Solution:
```
import sys
t = int(input())
for _t in range(t):
n = int(sys.stdin.readline())
if n <= 3:
print(n - 1)
else:
print(3 if n % 2 else 2)
``` | output | 1 | 86,839 | 22 | 173,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
A proper divisor is a divisor of a number, exc... | instruction | 0 | 86,840 | 22 | 173,680 |
Tags: greedy, math
Correct Solution:
```
for t in range(int(input())):
n=int(input())
if n==1:
print(0)
if n==2:
print(1)
if n==3:
print(2)
if n>3:
if n%2!=0:
print(3)
else:
print(2)
``` | output | 1 | 86,840 | 22 | 173,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
A proper divisor is a divisor of a number, exc... | instruction | 0 | 86,841 | 22 | 173,682 |
Tags: greedy, math
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
if n==1:
print(0)
elif n == 2:
print(1)
elif n == 3:
print(2)
elif n%2:
print(3)
else:
print(2)
``` | output | 1 | 86,841 | 22 | 173,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
A proper divisor is a divisor of a number, exc... | instruction | 0 | 86,842 | 22 | 173,684 |
Tags: greedy, math
Correct Solution:
```
import math
import sys
from collections import defaultdict
from functools import lru_cache
t = int(input())
for _ in range(t):
n = int(input())
if n % 2 == 0:
if n == 2:
print(1)
else:
print(2)
else:
if n == 1:
... | output | 1 | 86,842 | 22 | 173,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
A proper divisor is a divisor of a number, exc... | instruction | 0 | 86,843 | 22 | 173,686 |
Tags: greedy, math
Correct Solution:
```
import sys
input=sys.stdin.readline
t=int(input())
for i in range(t):
n=int(input())
if n==1:
print(0)
elif n%2==0:
if n==2:
print(1)
else:
print(2)
elif n%2==1:
if n==3:
print(2)
else:
... | output | 1 | 86,843 | 22 | 173,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
A proper divisor is a divisor of a number, exc... | instruction | 0 | 86,844 | 22 | 173,688 |
Tags: greedy, math
Correct Solution:
```
for t in range(int(input())):
n=int(input())
if n == 1:
print(0)
elif n == 2:
print(1)
elif n == 3:
print(2)
elif n % 2 == 0:
print(2)
else:
print(3)
``` | output | 1 | 86,844 | 22 | 173,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
A proper divisor is a divisor of a number, exc... | instruction | 0 | 86,845 | 22 | 173,690 |
Tags: greedy, math
Correct Solution:
```
for __ in range(int(input())):
n = int(input())
if n == 1:
print(0)
elif n == 2:
print(1)
elif n % 2 == 0 or n == 3:
print(2)
else:
print(3)
``` | output | 1 | 86,845 | 22 | 173,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
A proper divisor is a divisor of a number, exc... | instruction | 0 | 86,846 | 22 | 173,692 |
Tags: greedy, math
Correct Solution:
```
try:
t=int(input())
for i in range(t):
n=int(input())
if(n==1):
print("0")
elif(n==2):
print("1")
elif(n%2==0 or n==3):
print("2")
else:
print("3")
except:
pass
``` | output | 1 | 86,846 | 22 | 173,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
... | instruction | 0 | 86,847 | 22 | 173,694 |
Yes | output | 1 | 86,847 | 22 | 173,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
... | instruction | 0 | 86,848 | 22 | 173,696 |
Yes | output | 1 | 86,848 | 22 | 173,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
... | instruction | 0 | 86,849 | 22 | 173,698 |
Yes | output | 1 | 86,849 | 22 | 173,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
... | instruction | 0 | 86,850 | 22 | 173,700 |
Yes | output | 1 | 86,850 | 22 | 173,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
... | instruction | 0 | 86,851 | 22 | 173,702 |
No | output | 1 | 86,851 | 22 | 173,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
... | instruction | 0 | 86,852 | 22 | 173,704 |
No | output | 1 | 86,852 | 22 | 173,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
... | instruction | 0 | 86,853 | 22 | 173,706 |
No | output | 1 | 86,853 | 22 | 173,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
... | instruction | 0 | 86,854 | 22 | 173,708 |
No | output | 1 | 86,854 | 22 | 173,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is x=3. If n=4, then such a number does not exist.... | instruction | 0 | 86,855 | 22 | 173,710 |
Tags: math, number theory
Correct Solution:
```
tests = int(input())
import math
def solve(n):
while(n%2 == 0):
n = n//2
if(n == 1):
return "NO"
else:
return "YES"
for t in range(tests):
n = int(input())
if n%2 != 0:
print("YES")
else:
print(solve(n))
``` | output | 1 | 86,855 | 22 | 173,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is x=3. If n=4, then such a number does not exist.... | instruction | 0 | 86,856 | 22 | 173,712 |
Tags: math, number theory
Correct Solution:
```
def solve():
n=int(input())
if n&1:
print("YES")
else:
from math import log2
k=log2(n)
if k==int(k):
print("NO")
else:
print("YES")
for _ in range(int(input())):
solve()
``` | output | 1 | 86,856 | 22 | 173,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is x=3. If n=4, then such a number does not exist.... | instruction | 0 | 86,857 | 22 | 173,714 |
Tags: math, number theory
Correct Solution:
```
def num(n):
while n%2==0:
n=int(n/2)
if n>1:
return "YES"
else:
return "NO"
for _ in range(int(input())):
n = int(input())
print(num(n))
``` | output | 1 | 86,857 | 22 | 173,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is x=3. If n=4, then such a number does not exist.... | instruction | 0 | 86,858 | 22 | 173,716 |
Tags: math, number theory
Correct Solution:
```
a = int(input())
for i in range(a):
liczba = int(input())
if liczba == 2 or liczba == 1:
print("NO")
elif liczba % 2 != 0:
print("YES")
else:
while True:
liczba = liczba/2
if liczba == 1:
pri... | output | 1 | 86,858 | 22 | 173,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is x=3. If n=4, then such a number does not exist.... | instruction | 0 | 86,859 | 22 | 173,718 |
Tags: math, number theory
Correct Solution:
```
def func(n):
if (n==1):
return "NO"
if (n%2!=0):
return "YES"
return func(n//2)
t = int(input())
for _ in range(t):
n = int(input())
print(func(n))
``` | output | 1 | 86,859 | 22 | 173,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is x=3. If n=4, then such a number does not exist.... | instruction | 0 | 86,860 | 22 | 173,720 |
Tags: math, number theory
Correct Solution:
```
test_cases = 1
test_cases = int(input())
for ttttt in range(test_cases):
n = int(input())
while n%2==0:
n/=2
if n==1:
print("NO")
else:
print("YES")
``` | output | 1 | 86,860 | 22 | 173,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is x=3. If n=4, then such a number does not exist.... | instruction | 0 | 86,861 | 22 | 173,722 |
Tags: math, number theory
Correct Solution:
```
for i in range(int(input())):
a=int(input())
b=bin(a)
b=list(b)
l=b.count('1')
if l==1 and b[2]=="1":
print("NO")
else:
print("YES")
``` | output | 1 | 86,861 | 22 | 173,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is x=3. If n=4, then such a number does not exist.... | instruction | 0 | 86,862 | 22 | 173,724 |
Tags: math, number theory
Correct Solution:
```
import math
def Log2(x):
if x == 0:
return False
return (math.log10(x) /
math.log10(2))
def isPowerOfTwo(n):
return (math.ceil(Log2(n)) ==
math.floor(Log2(n)))
t = int(input())
out = []
for x in range(t):
n = int(input())... | output | 1 | 86,862 | 22 | 173,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is ... | instruction | 0 | 86,863 | 22 | 173,726 |
Yes | output | 1 | 86,863 | 22 | 173,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is ... | instruction | 0 | 86,864 | 22 | 173,728 |
Yes | output | 1 | 86,864 | 22 | 173,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is ... | instruction | 0 | 86,865 | 22 | 173,730 |
Yes | output | 1 | 86,865 | 22 | 173,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is ... | instruction | 0 | 86,866 | 22 | 173,732 |
Yes | output | 1 | 86,866 | 22 | 173,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is ... | instruction | 0 | 86,867 | 22 | 173,734 |
No | output | 1 | 86,867 | 22 | 173,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is ... | instruction | 0 | 86,868 | 22 | 173,736 |
No | output | 1 | 86,868 | 22 | 173,737 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.