message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements with different indices even when their values are the same,... | instruction | 0 | 87,320 | 5 | 174,640 |
"Correct Solution:
```
MOD = 10 ** 9 + 7
FACT_MAX = 10 ** 5
fact = [1] * FACT_MAX
for i in range(1, FACT_MAX):
fact[i] = fact[i - 1] * i % MOD
def comb(n, r):
return fact[n] * pow(fact[n - r], MOD - 2, MOD) * pow(fact[r], MOD - 2, MOD)
N, K = map(int, input().split())
A = sorted(map(int, input().split()))
prin... | output | 1 | 87,320 | 5 | 174,641 |
Provide a correct Python 3 solution for this coding contest problem.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements with different indices even when their values are the same,... | instruction | 0 | 87,321 | 5 | 174,642 |
"Correct Solution:
```
N,K=map(int,input().split())
A=list(map(int,input().split()))
mod = 10**9+7
if K==1:print(0)
else:
factorial=[1 for i in range(N+1)]
for i in range(1,N+1):
if i==1:factorial[i]=1
else:factorial[i] = factorial[i-1]*i % mod
def comb(n,k):
return factorial[n]*pow(factorial[n-k]... | output | 1 | 87,321 | 5 | 174,643 |
Provide a correct Python 3 solution for this coding contest problem.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements with different indices even when their values are the same,... | instruction | 0 | 87,322 | 5 | 174,644 |
"Correct Solution:
```
N,K=map(int,input().split())
A=sorted(map(int,input().split()))
r=0
MOD=10**9+7
max_n=10**5
fac=[1]*(max_n+1)
inv=[1]*(max_n+1)
ifac=[1]*(max_n+1)
for n in range(2,max_n+1):
fac[n]=(fac[n-1]*n)%MOD
inv[n]=MOD-inv[MOD%n]*(MOD//n)%MOD
ifac[n]=(ifac[n-1]*inv[n])%MOD
def comb(n,k):
if... | output | 1 | 87,322 | 5 | 174,645 |
Provide a correct Python 3 solution for this coding contest problem.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements with different indices even when their values are the same,... | instruction | 0 | 87,323 | 5 | 174,646 |
"Correct Solution:
```
n,k=[int(i) for i in input().split()]
arr=[int(i) for i in input().split()]
ans=0
mod=10**9+7
arr.sort()
c=[0 for i in range(n)]
r=k-1
c[r]=1
def modinv(x,mod):
return pow(x,mod-2,mod)
for i in range(r+1,n):
c[i]=((c[i-1]*(i))*modinv(i-r,mod))%mod
pos=0
neg=0
for i in range(n):
pos+=... | output | 1 | 87,323 | 5 | 174,647 |
Provide a correct Python 3 solution for this coding contest problem.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements with different indices even when their values are the same,... | instruction | 0 | 87,324 | 5 | 174,648 |
"Correct Solution:
```
MOD = 10 ** 9 + 7
def comb(n, r):
return fact[n] * pow(fact[n - r], MOD - 2, MOD) * pow(fact[r], MOD - 2, MOD)
N, K = map(int, input().split())
fact = [1] * N
for i in range(1, N):
fact[i] = fact[i - 1] * i % MOD
A = sorted(map(int, input().split()))
print(sum(comb(i, K - 1) * (A[i] - A[... | output | 1 | 87,324 | 5 | 174,649 |
Provide a correct Python 3 solution for this coding contest problem.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements with different indices even when their values are the same,... | instruction | 0 | 87,325 | 5 | 174,650 |
"Correct Solution:
```
MOD = 1000000007
N,K = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
step =[1]*(N+1)
for i in range(1,N+1,1):
step[i]= (step[i-1]*i)%MOD
def nCk(n,k):
return (step[n]*pow(step[k],MOD-2,MOD)*pow(step[n-k],MOD-2,MOD))%MOD
max_sum=0
min_sum=0
for i in range(0,N,1):
... | output | 1 | 87,325 | 5 | 174,651 |
Provide a correct Python 3 solution for this coding contest problem.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements with different indices even when their values are the same,... | instruction | 0 | 87,326 | 5 | 174,652 |
"Correct Solution:
```
from itertools import accumulate
mod = 10 ** 9 + 7
N, K = map(int, input().split())
A = sorted([int(x) for x in input().split()])
f = [1 for _ in range(N + 1)]
inv = [1 for _ in range(N + 1)]
finv = [1 for _ in range(N + 1)]
for i in range(2, N + 1):
f[i] = f[i - 1] * i % mod
inv[i] =... | output | 1 | 87,326 | 5 | 174,653 |
Provide a correct Python 3 solution for this coding contest problem.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements with different indices even when their values are the same,... | instruction | 0 | 87,327 | 5 | 174,654 |
"Correct Solution:
```
mod = 10**9+7
f = [1]
for i in range(10**5+7):
f.append(f[-1]*(i+1)%mod)
def comb(n, r,mod=mod):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
n, k = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse=True)
ans = 0
for i in range(n-k+1):... | output | 1 | 87,327 | 5 | 174,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements wit... | instruction | 0 | 87,328 | 5 | 174,656 |
Yes | output | 1 | 87,328 | 5 | 174,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements wit... | instruction | 0 | 87,329 | 5 | 174,658 |
Yes | output | 1 | 87,329 | 5 | 174,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements wit... | instruction | 0 | 87,330 | 5 | 174,660 |
Yes | output | 1 | 87,330 | 5 | 174,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements wit... | instruction | 0 | 87,331 | 5 | 174,662 |
Yes | output | 1 | 87,331 | 5 | 174,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements wit... | instruction | 0 | 87,332 | 5 | 174,664 |
No | output | 1 | 87,332 | 5 | 174,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements wit... | instruction | 0 | 87,333 | 5 | 174,666 |
No | output | 1 | 87,333 | 5 | 174,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements wit... | instruction | 0 | 87,334 | 5 | 174,668 |
No | output | 1 | 87,334 | 5 | 174,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements wit... | instruction | 0 | 87,335 | 5 | 174,670 |
No | output | 1 | 87,335 | 5 | 174,671 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* 1≦A,B≦10^9
* op is either `+` or `-`.
Input
The input ... | instruction | 0 | 87,392 | 5 | 174,784 |
"Correct Solution:
```
l = input()
print(eval(l))
``` | output | 1 | 87,392 | 5 | 174,785 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* 1≦A,B≦10^9
* op is either `+` or `-`.
Input
The input ... | instruction | 0 | 87,393 | 5 | 174,786 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
# problem A
print(eval(input()))
``` | output | 1 | 87,393 | 5 | 174,787 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* 1≦A,B≦10^9
* op is either `+` or `-`.
Input
The input ... | instruction | 0 | 87,394 | 5 | 174,788 |
"Correct Solution:
```
a, b, c = input().split()
x = int(a)
y = int(c)
print(x + y if b=='+' else x - y)
``` | output | 1 | 87,394 | 5 | 174,789 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* 1≦A,B≦10^9
* op is either `+` or `-`.
Input
The input ... | instruction | 0 | 87,395 | 5 | 174,790 |
"Correct Solution:
```
a,b,c = input().split()
print(int(a)+int(c) if b == "+" else int(a) - int(c))
``` | output | 1 | 87,395 | 5 | 174,791 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* 1≦A,B≦10^9
* op is either `+` or `-`.
Input
The input ... | instruction | 0 | 87,396 | 5 | 174,792 |
"Correct Solution:
```
str=input()
print(eval(str))
``` | output | 1 | 87,396 | 5 | 174,793 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* 1≦A,B≦10^9
* op is either `+` or `-`.
Input
The input ... | instruction | 0 | 87,397 | 5 | 174,794 |
"Correct Solution:
```
print(eval(input().replace(' ','')))
``` | output | 1 | 87,397 | 5 | 174,795 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* 1≦A,B≦10^9
* op is either `+` or `-`.
Input
The input ... | instruction | 0 | 87,398 | 5 | 174,796 |
"Correct Solution:
```
A, op, B = map(str, input().split())
C = A + op + B
print(eval(C))
``` | output | 1 | 87,398 | 5 | 174,797 |
Provide a correct Python 3 solution for this coding contest problem.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* 1≦A,B≦10^9
* op is either `+` or `-`.
Input
The input ... | instruction | 0 | 87,399 | 5 | 174,798 |
"Correct Solution:
```
print(eval(input().strip()))
``` | output | 1 | 87,399 | 5 | 174,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* ... | instruction | 0 | 87,400 | 5 | 174,800 |
Yes | output | 1 | 87,400 | 5 | 174,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* ... | instruction | 0 | 87,401 | 5 | 174,802 |
Yes | output | 1 | 87,401 | 5 | 174,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* ... | instruction | 0 | 87,402 | 5 | 174,804 |
Yes | output | 1 | 87,402 | 5 | 174,805 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* ... | instruction | 0 | 87,403 | 5 | 174,806 |
Yes | output | 1 | 87,403 | 5 | 174,807 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* ... | instruction | 0 | 87,404 | 5 | 174,808 |
No | output | 1 | 87,404 | 5 | 174,809 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* ... | instruction | 0 | 87,405 | 5 | 174,810 |
No | output | 1 | 87,405 | 5 | 174,811 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* ... | instruction | 0 | 87,406 | 5 | 174,812 |
No | output | 1 | 87,406 | 5 | 174,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* ... | instruction | 0 | 87,407 | 5 | 174,814 |
No | output | 1 | 87,407 | 5 | 174,815 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be used in one combination. For example, if n is 3 and s i... | instruction | 0 | 87,424 | 5 | 174,848 |
"Correct Solution:
```
dp = [[0 for _ in range(1001)] for _ in range(10)]
dp[1][0] = dp[0][0] = 1
for now in range(1, 101):
for used in range(9, 0, -1):
dpu = dp[used]
dpu_1 = dp[used - 1]
for s in range(now, 1001):
dpu[s] = dpu_1[s - now] + dpu[s]
while True:
n, s = map(int, input().split())
... | output | 1 | 87,424 | 5 | 174,849 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be used in one combination. For example, if n is 3 and s i... | instruction | 0 | 87,425 | 5 | 174,850 |
"Correct Solution:
```
dp = [[0 for j in range(1001)] for i in range(10)]
dp[0][0] = 1
for j in range(1, 1001):
dp[0][j] = 0
for k in range(0, 101):
for i in range(9, 0, -1):
for j in range(k, 1001):
dp[i][j] += dp[i - 1][j - k]
while True:
n, s = map(int, input().split())
if n + s == 0:
break
... | output | 1 | 87,425 | 5 | 174,851 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be used in one combination. For example, if n is 3 and s i... | instruction | 0 | 87,426 | 5 | 174,852 |
"Correct Solution:
```
ans = [[0 for i in range(1001)] for j in range(11)]
ans[0][0] = 1
for i in range(101):
for n in range(9, -1, -1):
for s in range(1001 - i):
ans[n + 1][s + i] += ans[n][s]
while True:
n, s = map(int, input().split())
if n == 0:
break
print(ans[n][s]... | output | 1 | 87,426 | 5 | 174,853 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be used in one combination. For example, if n is 3 and s i... | instruction | 0 | 87,427 | 5 | 174,854 |
"Correct Solution:
```
"""
now...今注目する値
used...使った数字の数
sum...それまでの合計
dp[now][used][sum]...nowまででused個の数字を使って合計sumの場合の数
dp[now][used][sum] = dp[now - 1][used - 1][sum - now] + dp[now - 1][used][sum] (used >= 1 and sum >= now)
dp[now - 1][used][sum] (used == 0 or... | output | 1 | 87,427 | 5 | 174,855 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be used in one combination. For example, if n is 3 and s i... | instruction | 0 | 87,428 | 5 | 174,856 |
"Correct Solution:
```
# AOJ 0097 Sum of Integers II
# Python3 2018.6.15 bal4u
dp = [[0 for s in range(1001)] for n in range(11)]
dp[0][0] = 1
for k in range(101):
for n in range(9, -1, -1):
for s in range(1001-k):
dp[n+1][s+k] += dp[n][s]
while True:
n, s = list(map(int, input().split()))
if n == 0: break
p... | output | 1 | 87,428 | 5 | 174,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be... | instruction | 0 | 87,429 | 5 | 174,858 |
No | output | 1 | 87,429 | 5 | 174,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be... | instruction | 0 | 87,430 | 5 | 174,860 |
No | output | 1 | 87,430 | 5 | 174,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be... | instruction | 0 | 87,431 | 5 | 174,862 |
No | output | 1 | 87,431 | 5 | 174,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be... | instruction | 0 | 87,432 | 5 | 174,864 |
No | output | 1 | 87,432 | 5 | 174,865 |
Provide a correct Python 3 solution for this coding contest problem.
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an
n is given in the first line. Then, n integers are gi... | instruction | 0 | 87,509 | 5 | 175,018 |
"Correct Solution:
```
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa = x[0]
su = 1
for i in range(len... | output | 1 | 87,509 | 5 | 175,019 |
Provide a correct Python 3 solution for this coding contest problem.
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an
n is given in the first line. Then, n integers are gi... | instruction | 0 | 87,510 | 5 | 175,020 |
"Correct Solution:
```
# python template for atcoder1
from functools import reduce
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def gcd(a, b):
"""
return gcd of a,b
ユークリッド
"""
while b:
a, b = b, a % b
return a
def list_gcd(l):
"""
l: list
l のgcd を返す
... | output | 1 | 87,510 | 5 | 175,021 |
Provide a correct Python 3 solution for this coding contest problem.
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an
n is given in the first line. Then, n integers are gi... | instruction | 0 | 87,511 | 5 | 175,022 |
"Correct Solution:
```
from functools import reduce
def gcd(a,b): #最小公約数
if ((a%b) == 0 ):
return b
else:
return (gcd(b,a%b))
def lcm(a,b):
return a * b // gcd(a,b)
n = int(input())
l = list(map(int,input().split()))
print (reduce(lcm,l))
``` | output | 1 | 87,511 | 5 | 175,023 |
Provide a correct Python 3 solution for this coding contest problem.
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an
n is given in the first line. Then, n integers are gi... | instruction | 0 | 87,512 | 5 | 175,024 |
"Correct Solution:
```
import math
from functools import reduce
n=int(input())
z=list(map(int,input().split()))
def lcm_b(x,y):
return (x*y)//(math.gcd(x,y))
def lcm(*z):
return reduce(lcm_b,z,1)
print(lcm(*z))
``` | output | 1 | 87,512 | 5 | 175,025 |
Provide a correct Python 3 solution for this coding contest problem.
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an
n is given in the first line. Then, n integers are gi... | instruction | 0 | 87,513 | 5 | 175,026 |
"Correct Solution:
```
n = int(input())
A = tuple(map(int, input().split()))
def gcd(a, b):
if a < b:
a, b = b, a
while b != 0:
a, b = b, a % b
return a
b = A[0]
for a in A:
b = a * b // gcd(a, b)
print(b)
``` | output | 1 | 87,513 | 5 | 175,027 |
Provide a correct Python 3 solution for this coding contest problem.
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an
n is given in the first line. Then, n integers are gi... | instruction | 0 | 87,514 | 5 | 175,028 |
"Correct Solution:
```
import math
input()
b = 1
for a in [int(x) for x in input().split()]:
b = a * b // math.gcd(a, b)
print(b)
``` | output | 1 | 87,514 | 5 | 175,029 |
Provide a correct Python 3 solution for this coding contest problem.
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an
n is given in the first line. Then, n integers are gi... | instruction | 0 | 87,515 | 5 | 175,030 |
"Correct Solution:
```
from fractions import gcd
def lcm(a,n):
x = a[0]
for i in range(1,n):
x = (x * a[i]) // gcd(x,a[i])
return x
n = int(input())
a = list(map(int,input().split()))
print(lcm(a,n))
``` | output | 1 | 87,515 | 5 | 175,031 |
Provide a correct Python 3 solution for this coding contest problem.
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an
n is given in the first line. Then, n integers are gi... | instruction | 0 | 87,516 | 5 | 175,032 |
"Correct Solution:
```
import fractions
n=int(input())
a=list(map(int, input().split()))
b=a[0]
for i in range(1, n):
b=b*a[i]//fractions.gcd(b, a[i])
print(b)
``` | output | 1 | 87,516 | 5 | 175,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an... | instruction | 0 | 87,517 | 5 | 175,034 |
Yes | output | 1 | 87,517 | 5 | 175,035 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.