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 an integer m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers.
Decomposition into n products, given in the ... | instruction | 0 | 25,080 | 22 | 50,160 |
Tags: combinatorics, math, number theory
Correct Solution:
```
# Made By Mostafa_Khaled
bot = True
Mod = 1000000007
MAX = 33000
n = int( input() )
A = list( map( int, input().split() ) )
B = [0] * MAX
bePrime = [0] * MAX;
primNum = []
C = []
fac=[1]
for j in range(1, MAX):
fac.append( fac[-1] * j % ... | output | 1 | 25,080 | 22 | 50,161 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers.
Decomposition into n products, given in the ... | instruction | 0 | 25,081 | 22 | 50,162 |
Tags: combinatorics, math, number theory
Correct Solution:
```
import math
import sys
input=sys.stdin.readline
p=(10**9)+7
pri=p
fac=[1 for i in range((10**6)+1)]
for i in range(2,len(fac)):
fac[i]=(fac[i-1]*(i%pri))%pri
def modi(x):
return (pow(x,p-2,p))%p;
def ncr(n,r):
x=(fac[n]*((modi(fac[r])%p)*... | output | 1 | 25,081 | 22 | 50,163 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers.
Decomposition into n products, given in the ... | instruction | 0 | 25,082 | 22 | 50,164 |
Tags: combinatorics, math, number theory
Correct Solution:
```
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
from collections import Counter
def factor(x,cou):
while not x%2:
x /= 2
cou[2] += 1
for i in range(3,int(x**0.5)+1,2):
... | output | 1 | 25,082 | 22 | 50,165 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers.
Decomposition into n products, given in the ... | instruction | 0 | 25,083 | 22 | 50,166 |
Tags: combinatorics, math, number theory
Correct Solution:
```
Mod = 1000000007
MAX = 33000
n = int( input() )
A = list( map( int, input().split() ) )
B = [0] * MAX
bePrime = [0] * MAX;
primNum = []
C = []
fac=[1]
for j in range(1, MAX):
fac.append( fac[-1] * j % Mod )
def calc( M,... | output | 1 | 25,083 | 22 | 50,167 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers.
Decomposition into n products, given in the ... | instruction | 0 | 25,084 | 22 | 50,168 |
Tags: combinatorics, math, number theory
Correct Solution:
```
f=[1]*15001
fi=[1]*15001
a=1
b=1
m=10**9+7
from collections import defaultdict
for i in range(1,15001):
a*=i
b*=pow(i,m-2,m)
a%=m
b%=m
f[i]=a
fi[i]=b
d=defaultdict(int)
def factorize(n):
count = 0;
while ((n % 2 > 0) == Fa... | output | 1 | 25,084 | 22 | 50,169 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers.
Decomposition into n products, given in the ... | instruction | 0 | 25,085 | 22 | 50,170 |
Tags: combinatorics, math, number theory
Correct Solution:
```
from math import factorial as f
def primes(n):
sieve = [True] * n
for i in range(3,int(n**0.5)+1,2):
if sieve[i]:
sieve[i*i::2*i]=[False]*((n-i*i-1)//(2*i)+1)
return [2] + [i for i in range(3,n,2) if sieve[i]]
p = primes(3162... | output | 1 | 25,085 | 22 | 50,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers.
Decomposition into n products, given in the ... | instruction | 0 | 25,086 | 22 | 50,172 |
Tags: combinatorics, math, number theory
Correct Solution:
```
from math import sqrt, factorial as f
from collections import Counter
from operator import mul
from functools import reduce
def comb(n, m):
o = n - m
if m and o:
if m < o:
m, o = o, m
return reduce(mul, range(m + 1, n),... | output | 1 | 25,086 | 22 | 50,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an integer m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers.
Decomposition into n products, given in the ... | instruction | 0 | 25,087 | 22 | 50,174 |
Tags: combinatorics, math, number theory
Correct Solution:
```
ans={}
#######find prime factors
# Python3 program to print prime factors
# and their powers.
import math
# Function to calculate all the prime
# factors and count of every prime factor
def factorize(n):
count = 0;
# count the number of
# time... | output | 1 | 25,087 | 22 | 50,175 |
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 m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers... | instruction | 0 | 25,088 | 22 | 50,176 |
Yes | output | 1 | 25,088 | 22 | 50,177 |
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 m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers... | instruction | 0 | 25,089 | 22 | 50,178 |
Yes | output | 1 | 25,089 | 22 | 50,179 |
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 m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers... | instruction | 0 | 25,090 | 22 | 50,180 |
No | output | 1 | 25,090 | 22 | 50,181 |
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 m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers... | instruction | 0 | 25,091 | 22 | 50,182 |
No | output | 1 | 25,091 | 22 | 50,183 |
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 m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers... | instruction | 0 | 25,092 | 22 | 50,184 |
No | output | 1 | 25,092 | 22 | 50,185 |
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 m as a product of integers a1, a2, ... an <image>. Your task is to find the number of distinct decompositions of number m into the product of n ordered positive integers... | instruction | 0 | 25,093 | 22 | 50,186 |
No | output | 1 | 25,093 | 22 | 50,187 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input is given from Standard Input in the following format:
A... | instruction | 0 | 25,385 | 22 | 50,770 |
"Correct Solution:
```
A,B = list(map(int,input().split()))
if B%A==0:
print(B+A)
else:
print(B-A)
``` | output | 1 | 25,385 | 22 | 50,771 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input is given from Standard Input in the following format:
A... | instruction | 0 | 25,386 | 22 | 50,772 |
"Correct Solution:
```
A,B = map(int,input().split())
[print(A+B) if B%A == 0 else print(B-A)]
``` | output | 1 | 25,386 | 22 | 50,773 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input is given from Standard Input in the following format:
A... | instruction | 0 | 25,387 | 22 | 50,774 |
"Correct Solution:
```
A,B = map(int,input().split())
x = A + B if B % A == 0 else B - A
print(x)
``` | output | 1 | 25,387 | 22 | 50,775 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input is given from Standard Input in the following format:
A... | instruction | 0 | 25,388 | 22 | 50,776 |
"Correct Solution:
```
#A
a,b = map(int,input().split())
print((a+b) if b%a==0 else (b-a))
``` | output | 1 | 25,388 | 22 | 50,777 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input is given from Standard Input in the following format:
A... | instruction | 0 | 25,389 | 22 | 50,778 |
"Correct Solution:
```
x, y = map(int, input().split())
if y % x == 0:
print(x+y)
else:
print(y-x)
``` | output | 1 | 25,389 | 22 | 50,779 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input is given from Standard Input in the following format:
A... | instruction | 0 | 25,390 | 22 | 50,780 |
"Correct Solution:
```
a, b = map(int, input().split());print(b - a if b % a else a + b)
``` | output | 1 | 25,390 | 22 | 50,781 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input is given from Standard Input in the following format:
A... | instruction | 0 | 25,391 | 22 | 50,782 |
"Correct Solution:
```
A, B = map(int, input().split())
print(A+B) if(B % A == 0) else print(B-A)
``` | output | 1 | 25,391 | 22 | 50,783 |
Provide a correct Python 3 solution for this coding contest problem.
You are given positive integers A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input is given from Standard Input in the following format:
A... | instruction | 0 | 25,392 | 22 | 50,784 |
"Correct Solution:
```
a,b=map(int,input().split())
print(a+b if (b%a)==0 else (b-a))
``` | output | 1 | 25,392 | 22 | 50,785 |
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 A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input i... | instruction | 0 | 25,396 | 22 | 50,792 |
Yes | output | 1 | 25,396 | 22 | 50,793 |
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 A and B.
If A is a divisor of B, print A + B; otherwise, print B - A.
Constraints
* All values in input are integers.
* 1 \leq A \leq B \leq 20
Input
Input i... | instruction | 0 | 25,398 | 22 | 50,796 |
No | output | 1 | 25,398 | 22 | 50,797 |
Provide a correct Python 3 solution for this coding contest problem.
Let's solve the geometric problem
Mr. A is still solving geometric problems today. It is important to be aware of floating point errors when solving geometric problems.
Floating-point error is the error caused by the rounding that occurs when repre... | instruction | 0 | 25,554 | 22 | 51,108 |
"Correct Solution:
```
import fractions
a,b=map(int,input().split())
b//=fractions.gcd(a,b)
a,c=2,1
while a**2<=b:
if b%a==0:
c*=a
while b%a==0: b//=a
a+=1
print(c*b)
``` | output | 1 | 25,554 | 22 | 51,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given integers d and p, p is prime.
Also you have a mysterious device. It has memory cells, each contains an integer between 0 and p-1. Also two instructions are supported, addition an... | instruction | 0 | 25,595 | 22 | 51,190 |
No | output | 1 | 25,595 | 22 | 51,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of positive numbers that are presented in the array... | instruction | 0 | 25,613 | 22 | 51,226 |
Tags: implementation
Correct Solution:
```
from math import ceil
n = int(input())
a = list(map(int,input().split()))[:n]
p,n = 0,0
for i in range(len(a)):
if a[i] > 0:
p+=1
elif a[i] < 0:
n+=1
if (p>=ceil(len(a)/2)):
print(1)
elif(n>=ceil(len(a)/2)):
print(-1)
else:
print(0)
``` | output | 1 | 25,613 | 22 | 51,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of positive numbers that are presented in the array... | instruction | 0 | 25,614 | 22 | 51,228 |
Tags: implementation
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
x=0
y=0
z=a.count(0)
for i in range(len(a)):
if a[i]>0:
x+=1
elif a[i]<0:
y+=1
if x>=z+y:
print(1)
elif y>=x+z:
print(-1)
else:
print(0)
``` | output | 1 | 25,614 | 22 | 51,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of positive numbers that are presented in the array... | instruction | 0 | 25,615 | 22 | 51,230 |
Tags: implementation
Correct Solution:
```
m=int(input())
a=list(map(int,input().split()))
n=0
p=0
for i in a:
if i>0:
p=p+1
if i<0:
n+=1
if p>=(m+1)//2:
print (1)
elif n>=(m+1)//2:
print(-1)
else:
print(0)
``` | output | 1 | 25,615 | 22 | 51,231 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of positive numbers that are presented in the array... | instruction | 0 | 25,616 | 22 | 51,232 |
Tags: implementation
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
neg=0
zer=0
poz=0
for num in a:
if num==0:
zer+=1
elif num<0:
neg+=1
else:
poz+=1
ans=1
if poz<neg:
poz=neg
ans=-1
if poz*2>=n:
print(ans)
else:
print(0)
``` | output | 1 | 25,616 | 22 | 51,233 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of positive numbers that are presented in the array... | instruction | 0 | 25,617 | 22 | 51,234 |
Tags: implementation
Correct Solution:
```
n = int(input())
arr = list(map(int,input().split()))
zeros, pos, neg = 0, 0, 0
for a in arr:
if a>0: pos+=1
elif a<0: neg+=1
else: zeros+=1
min_pos = (n+1)//2
if pos>=min_pos:
print(1)
elif neg >= min_pos:
print(-1)
else:
print(0)
``` | output | 1 | 25,617 | 22 | 51,235 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of positive numbers that are presented in the array... | instruction | 0 | 25,618 | 22 | 51,236 |
Tags: implementation
Correct Solution:
```
from math import ceil
def go():
n = int(input())
a = [int(i) for i in input().split(' ')]
pos = neg = zero = 0
for i in range(n):
if a[i] > 0:
pos += 1
elif a[i] < 0:
neg += 1
else:
zero += 1
if p... | output | 1 | 25,618 | 22 | 51,237 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of positive numbers that are presented in the array... | instruction | 0 | 25,619 | 22 | 51,238 |
Tags: implementation
Correct Solution:
```
import math
k = int(input())
array = list(map(int,input().split()))
if len(list(filter(lambda x: x > 0,array))) >= math.ceil(k / 2) : print(1)
elif len(list(filter(lambda x: x < 0,array))) >= math.ceil(k / 2) : print(-1)
else: print(0)
``` | output | 1 | 25,619 | 22 | 51,239 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of positive numbers that are presented in the array... | instruction | 0 | 25,620 | 22 | 51,240 |
Tags: implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
m, p = 0, 0
for i in a:
if i < 0:
m += 1
elif i > 0:
p += 1
if m >= (n // 2 + n % 2):
print(-1)
elif p >= (n // 2 + n % 2):
print(1)
else:
print(0)
``` | output | 1 | 25,620 | 22 | 51,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of p... | instruction | 0 | 25,621 | 22 | 51,242 |
Yes | output | 1 | 25,621 | 22 | 51,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of p... | instruction | 0 | 25,622 | 22 | 51,244 |
Yes | output | 1 | 25,622 | 22 | 51,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of p... | instruction | 0 | 25,623 | 22 | 51,246 |
Yes | output | 1 | 25,623 | 22 | 51,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of p... | instruction | 0 | 25,624 | 22 | 51,248 |
Yes | output | 1 | 25,624 | 22 | 51,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of p... | instruction | 0 | 25,625 | 22 | 51,250 |
No | output | 1 | 25,625 | 22 | 51,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of p... | instruction | 0 | 25,626 | 22 | 51,252 |
No | output | 1 | 25,626 | 22 | 51,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of p... | instruction | 0 | 25,627 | 22 | 51,254 |
No | output | 1 | 25,627 | 22 | 51,255 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integers: a_1, a_2, β¦, a_n. Your task is to find some non-zero integer d (-10^3 β€ d β€ 10^3) such that, after each number in the array is divided by d, the number of p... | instruction | 0 | 25,628 | 22 | 51,256 |
No | output | 1 | 25,628 | 22 | 51,257 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
We have hidden an integer 1 β€ X β€ 10^{9}. You don't have to guess this number. You have to find the number of divisors of this number, and you don't even have to... | instruction | 0 | 25,746 | 22 | 51,492 |
No | output | 1 | 25,746 | 22 | 51,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
We have hidden an integer 1 β€ X β€ 10^{9}. You don't have to guess this number. You have to find the number of divisors of this number, and you don't even have to... | instruction | 0 | 25,747 | 22 | 51,494 |
No | output | 1 | 25,747 | 22 | 51,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
We have hidden an integer 1 β€ X β€ 10^{9}. You don't have to guess this number. You have to find the number of divisors of this number, and you don't even have to... | instruction | 0 | 25,748 | 22 | 51,496 |
No | output | 1 | 25,748 | 22 | 51,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
We have hidden an integer 1 β€ X β€ 10^{9}. You don't have to guess this number. You have to find the number of divisors of this number, and you don't even have to... | instruction | 0 | 25,749 | 22 | 51,498 |
No | output | 1 | 25,749 | 22 | 51,499 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of uni... | instruction | 0 | 26,148 | 22 | 52,296 |
Tags: implementation, math, number theory
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Wed Jul 15 15:27:19 2020
@author: Kanoun
"""
def factorial(n):
if (n==0):
return 1
return n*factorial(n-1)
A,B = map(int, input().split())
if (A<=B):
print(factorial(A))
else:
prin... | output | 1 | 26,148 | 22 | 52,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of uni... | instruction | 0 | 26,149 | 22 | 52,298 |
Tags: implementation, math, number theory
Correct Solution:
```
from functools import reduce
from operator import mul
def read_number_line():
return [int(i) for i in input().split()]
a, b = read_number_line()
print(reduce(mul, range(1, min(a, b) + 1)))
``` | output | 1 | 26,149 | 22 | 52,299 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of uni... | instruction | 0 | 26,150 | 22 | 52,300 |
Tags: implementation, math, number theory
Correct Solution:
```
def factorial(n):
fact = 1
for i in range(2, n+1):
fact = fact*i
return fact
a, b = [int(x) for x in input().split()]
if(a<=b):
print(factorial(a))
else:
print(factorial(b))
``` | output | 1 | 26,150 | 22 | 52,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Holidays have finished. Thanks to the help of the hacker Leha, Noora managed to enter the university of her dreams which is located in a town Pavlopolis. It's well known that universities provide students with dormitory for the period of uni... | instruction | 0 | 26,151 | 22 | 52,302 |
Tags: implementation, math, number theory
Correct Solution:
```
import math
a, b = map(int, input().split())
menor = min(a,b)
print(math.factorial(menor))
``` | output | 1 | 26,151 | 22 | 52,303 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.