message stringlengths 2 30.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 237 109k | cluster float64 10 10 | __index_level_0__ int64 474 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can lo... | instruction | 0 | 23,811 | 10 | 47,622 |
No | output | 1 | 23,811 | 10 | 47,623 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the price was increased during the i-th month.
Using... | instruction | 0 | 24,016 | 10 | 48,032 |
Tags: binary search, brute force, greedy, math
Correct Solution:
```
import math
for t in range(int(input())):
n, k = map(int, input(). split())
lis = list(map(int, input(). split()))
ans = 0
sm = lis[0]
for i in range(1, n):
if lis[i] / sm <= k / 100:
sm += lis[i]
else:
... | output | 1 | 24,016 | 10 | 48,033 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the price was increased during the i-th month.
Using... | instruction | 0 | 24,017 | 10 | 48,034 |
Tags: binary search, brute force, greedy, math
Correct Solution:
```
def main():
T=eval(input())
for _1 in range(T):
N,K=list(map(int,input().split()))
P=[]
P=list(map(int,input().split()))
Sum=P[0]
Ans=0
for i in range(1,len(P)):
if P[i]*100<=Sum*K:... | output | 1 | 24,017 | 10 | 48,035 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the price was increased during the i-th month.
Using... | instruction | 0 | 24,018 | 10 | 48,036 |
Tags: binary search, brute force, greedy, math
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
import math
import itertools
import bisect
import heapq
def main():
pass
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
... | output | 1 | 24,018 | 10 | 48,037 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the price was increased during the i-th month.
Using... | instruction | 0 | 24,019 | 10 | 48,038 |
Tags: binary search, brute force, greedy, math
Correct Solution:
```
import sys
input = sys.stdin.readline
for _ in range(int(input())):
n, k = map(int,input().split())
p = list(map(int,input().split()))
cnt = 0
prev = p[0]
for i in range(1, n):
if p[i] / prev <= k/100:
prev += ... | output | 1 | 24,019 | 10 | 48,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the price was increased during the i-th month.
Using... | instruction | 0 | 24,020 | 10 | 48,040 |
Tags: binary search, brute force, greedy, math
Correct Solution:
```
import sys,math
input=sys.stdin.readline
t = int(input())
for _ in range(t):
n,k = map(int,input().split())
a = list(map(int,input().split()))
ar = [0]*n
ar[0] = a[0]
for i in range(1,n):
ar[i] = ar[i-1] + a[i]
... | output | 1 | 24,020 | 10 | 48,041 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the price was increased during the i-th month.
Using... | instruction | 0 | 24,021 | 10 | 48,042 |
Tags: binary search, brute force, greedy, math
Correct Solution:
```
for _ in range(int(input())):
n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=0
s=a[0]
for i in range(1,n):
for j in range(1,1000):
pass
l=a[i]/(s)
if(l<=k/100):s+=a[i]
... | output | 1 | 24,021 | 10 | 48,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the price was increased during the i-th month.
Using... | instruction | 0 | 24,022 | 10 | 48,044 |
Tags: binary search, brute force, greedy, math
Correct Solution:
```
def solve():
n, k = map(int, input().split())
p = list(map(int, input().split()))
def f(m):
gsum = p[0] + m
for i in range(1, n):
if p[i] / gsum > k / 100:
return False
... | output | 1 | 24,022 | 10 | 48,045 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the price was increased during the i-th month.
Using... | instruction | 0 | 24,023 | 10 | 48,046 |
Tags: binary search, brute force, greedy, math
Correct Solution:
```
for _ in range(int(input())):
n, k = map(int, input().split())
p = list(map(int, input().split()))
ans = 0
now = p[0]
for i in range(1, n):
plus = max(0, (100 * p[i] + k - 1) // k - now)
ans += plus
now += p... | output | 1 | 24,023 | 10 | 48,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the pr... | instruction | 0 | 24,024 | 10 | 48,048 |
Yes | output | 1 | 24,024 | 10 | 48,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the pr... | instruction | 0 | 24,025 | 10 | 48,050 |
Yes | output | 1 | 24,025 | 10 | 48,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the pr... | instruction | 0 | 24,026 | 10 | 48,052 |
Yes | output | 1 | 24,026 | 10 | 48,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the pr... | instruction | 0 | 24,027 | 10 | 48,054 |
Yes | output | 1 | 24,027 | 10 | 48,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the pr... | instruction | 0 | 24,028 | 10 | 48,056 |
No | output | 1 | 24,028 | 10 | 48,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the pr... | instruction | 0 | 24,029 | 10 | 48,058 |
No | output | 1 | 24,029 | 10 | 48,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the pr... | instruction | 0 | 24,030 | 10 | 48,060 |
No | output | 1 | 24,030 | 10 | 48,061 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a statistic of price changes for one product represented as an array of n positive integers p_0, p_1, ..., p_{n - 1}, where p_0 is the initial price of the product and p_i is how the pr... | instruction | 0 | 24,031 | 10 | 48,062 |
No | output | 1 | 24,031 | 10 | 48,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.
Reliable sources h... | instruction | 0 | 24,233 | 10 | 48,466 |
Tags: greedy, math, strings
Correct Solution:
```
def cur(s):
s1=""
ci=-1
for i in range(len(s)-1):
if int(s[i])%2==0 and int(s[i])<int(s[-1]):
return (s[0:i]+s[-1]+s[i+1:len(s)-1]+s[i])
elif int(s[i])%2==0 and int(s[i])>int(s[-1]):
ci=i
if ci!=-1:
return s[0:ci]+s[-1]+s[ci+1:len(s)... | output | 1 | 24,233 | 10 | 48,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.
Reliable sources h... | instruction | 0 | 24,234 | 10 | 48,468 |
Tags: greedy, math, strings
Correct Solution:
```
s = input()
l = []
count=0
for i in s:
l.append(int(i))
for j in range(len(l)):
if (l[j] % 2 == 0 and l[j] < l[-1]):
count+=1
l[j], l[-1] = l[-1], l[j]
break
elif (l[j] % 2 == 0 and l[j] > l[-1]):
count += 1
temp=j
if... | output | 1 | 24,234 | 10 | 48,469 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.
Reliable sources h... | instruction | 0 | 24,235 | 10 | 48,470 |
Tags: greedy, math, strings
Correct Solution:
```
a=input()
a=list(a)
ind=-1
s=-1
flag=0
e=a[len(a)-1]
temp=0
for i in range(len(a)-1,-1,-1):
if(int(a[i])%2==0):
flag=flag+1
if(flag==1):
ind=i
temp=a[i]
elif e>a[i]:
ind=i
temp=a[i]
if(flag==0):
print('-1')
else:
a[len(a)-1]=str... | output | 1 | 24,235 | 10 | 48,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.
Reliable sources h... | instruction | 0 | 24,237 | 10 | 48,474 |
Tags: greedy, math, strings
Correct Solution:
```
n=input()
l1=list(n)
k=l1.copy()
f=0
maxi=0
for i in range(len(l1)):
if(int(l1[i])%2==0 and int(l1[i])<int(l1[len(l1)-1])):
f=1
c=l1[len(l1)-1]
l1[len(l1)-1]=l1[i]
l1[i]=c
break
if(f==0):
for i in range(len(l1)):
i... | output | 1 | 24,237 | 10 | 48,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.
Reliable sources h... | instruction | 0 | 24,238 | 10 | 48,476 |
Tags: greedy, math, strings
Correct Solution:
```
l=list(input())
n=len(l)
r=int(l[-1])
flag=0
m=-1
for i in range(n):
if(int(l[i])%2==0):
m=i
if(r>int(l[i])):
l[-1],l[i]=l[i],l[-1]
flag=1
break
if(flag):
k=""
for i in range(n):
k+=l[i]
print(k... | output | 1 | 24,238 | 10 | 48,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is no... | instruction | 0 | 24,240 | 10 | 48,480 |
Yes | output | 1 | 24,240 | 10 | 48,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is no... | instruction | 0 | 24,241 | 10 | 48,482 |
Yes | output | 1 | 24,241 | 10 | 48,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is no... | instruction | 0 | 24,242 | 10 | 48,484 |
Yes | output | 1 | 24,242 | 10 | 48,485 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is no... | instruction | 0 | 24,243 | 10 | 48,486 |
Yes | output | 1 | 24,243 | 10 | 48,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is no... | instruction | 0 | 24,244 | 10 | 48,488 |
No | output | 1 | 24,244 | 10 | 48,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is no... | instruction | 0 | 24,245 | 10 | 48,490 |
No | output | 1 | 24,245 | 10 | 48,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is no... | instruction | 0 | 24,246 | 10 | 48,492 |
No | output | 1 | 24,246 | 10 | 48,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is no... | instruction | 0 | 24,247 | 10 | 48,494 |
No | output | 1 | 24,247 | 10 | 48,495 |
Provide a correct Python 3 solution for this coding contest problem.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.
Write a program which computes the am... | instruction | 0 | 25,469 | 10 | 50,938 |
"Correct Solution:
```
import math
N = int(input())
A = 100000
for _ in range(N):
A = A * 1.05
A = (int(math.ceil(A / 1000))) * 1000
print(A)
``` | output | 1 | 25,469 | 10 | 50,939 |
Provide a correct Python 3 solution for this coding contest problem.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.
Write a program which computes the am... | instruction | 0 | 25,470 | 10 | 50,940 |
"Correct Solution:
```
import math
a = 100
b = int(input())
for _ in range(b):
a = math.ceil(a * 1.05)
a *= 1000
print(a)
``` | output | 1 | 25,470 | 10 | 50,941 |
Provide a correct Python 3 solution for this coding contest problem.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.
Write a program which computes the am... | instruction | 0 | 25,471 | 10 | 50,942 |
"Correct Solution:
```
n = int(input())
S = 100000
for i in range(n) :
S *= 1.05
if S % 1000!= 0 :
S = (int(S/1000)+1)*1000
print(S)
``` | output | 1 | 25,471 | 10 | 50,943 |
Provide a correct Python 3 solution for this coding contest problem.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.
Write a program which computes the am... | instruction | 0 | 25,472 | 10 | 50,944 |
"Correct Solution:
```
n=int(input())
a=100000
while n!=0:
a=a*1.05
if a%1000!=0:
a=a-(a%1000)+1000
n=n-1
print(int (a))
``` | output | 1 | 25,472 | 10 | 50,945 |
Provide a correct Python 3 solution for this coding contest problem.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.
Write a program which computes the am... | instruction | 0 | 25,473 | 10 | 50,946 |
"Correct Solution:
```
import math
j = 100
for _ in range(int(input())):
j = math.ceil(j * 1.05)
print(j * 1000)
``` | output | 1 | 25,473 | 10 | 50,947 |
Provide a correct Python 3 solution for this coding contest problem.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.
Write a program which computes the am... | instruction | 0 | 25,474 | 10 | 50,948 |
"Correct Solution:
```
n = int(input())
Mo = 100000
for i in range(n):
Mo = Mo * 1.05
if Mo%1000 != 0:
Mo = (int(Mo/1000) + 1)*1000
print(int(Mo))
``` | output | 1 | 25,474 | 10 | 50,949 |
Provide a correct Python 3 solution for this coding contest problem.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.
Write a program which computes the am... | instruction | 0 | 25,475 | 10 | 50,950 |
"Correct Solution:
```
a=100000
n=int(input())
for i in range(n):
a=a*1.05
if a%1000 !=0:
a=a-(a%1000)+1000
print(int(a))
``` | output | 1 | 25,475 | 10 | 50,951 |
Provide a correct Python 3 solution for this coding contest problem.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 above week by week.
Write a program which computes the am... | instruction | 0 | 25,476 | 10 | 50,952 |
"Correct Solution:
```
n = 100000
for i in range(int(input())):
n *= 1.05;
if n % 1000:
n += 1000
n = int(n / 1000) * 1000
print(n)
``` | output | 1 | 25,476 | 10 | 50,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 ab... | instruction | 0 | 25,477 | 10 | 50,954 |
Yes | output | 1 | 25,477 | 10 | 50,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 ab... | instruction | 0 | 25,478 | 10 | 50,956 |
Yes | output | 1 | 25,478 | 10 | 50,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 ab... | instruction | 0 | 25,479 | 10 | 50,958 |
Yes | output | 1 | 25,479 | 10 | 50,959 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 ab... | instruction | 0 | 25,480 | 10 | 50,960 |
Yes | output | 1 | 25,480 | 10 | 50,961 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 ab... | instruction | 0 | 25,481 | 10 | 50,962 |
No | output | 1 | 25,481 | 10 | 50,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 ab... | instruction | 0 | 25,482 | 10 | 50,964 |
No | output | 1 | 25,482 | 10 | 50,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 ab... | instruction | 0 | 25,483 | 10 | 50,966 |
No | output | 1 | 25,483 | 10 | 50,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your friend who lives in undisclosed country is involved in debt. He is borrowing 100,000-yen from a loan shark. The loan shark adds 5% interest of the debt and rounds it to the nearest 1,000 ab... | instruction | 0 | 25,484 | 10 | 50,968 |
No | output | 1 | 25,484 | 10 | 50,969 |
Provide a correct Python 3 solution for this coding contest problem.
Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting fo... | instruction | 0 | 25,501 | 10 | 51,002 |
"Correct Solution:
```
i=1
while i<5:
t_i,n_i=map(int,input().split())
if t_i==1:a=n_i*6000
if t_i==2:a=n_i*4000
if t_i==3:a=n_i*3000
if t_i==4:a=n_i*2000
print(a)
i=i+1
``` | output | 1 | 25,501 | 10 | 51,003 |
Provide a correct Python 3 solution for this coding contest problem.
Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting fo... | instruction | 0 | 25,502 | 10 | 51,004 |
"Correct Solution:
```
dic={1:6000,2:4000,3:3000,4:2000}
for i in range(4):
t,n=map(int,input().split())
print(dic[t]*n)
``` | output | 1 | 25,502 | 10 | 51,005 |
Provide a correct Python 3 solution for this coding contest problem.
Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting fo... | instruction | 0 | 25,503 | 10 | 51,006 |
"Correct Solution:
```
S=6000
A=4000
B=3000
C=2000
for k in range(4):
i,n1=map(int,input().split())
if i==1:
print(f"{S*n1}")
elif i==2:
print(f"{A*n1}")
elif i==3:
print(f"{B*n1}")
elif i==4:
print(f"{C*n1}")
``` | output | 1 | 25,503 | 10 | 51,007 |
Provide a correct Python 3 solution for this coding contest problem.
Today is the ticket release date for Aizu Entertainment's recommended idol group "Akabeko & Koboushi". There are four types of tickets:
S seat 6000 yen
A seat 4000 yen
B seat 3000 yen
C seat 2000 yen
You, the sales manager, are excitedly waiting fo... | instruction | 0 | 25,504 | 10 | 51,008 |
"Correct Solution:
```
for i in range(4):
t,n = map(int,input().split())
if t==1:
kingaku=6000
elif t==2:
kingaku=4000
elif t==3:
kingaku=3000
elif t==4:
kingaku=2000
print(n*kingaku)
``` | output | 1 | 25,504 | 10 | 51,009 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.