message
stringlengths 2
39.6k
| message_type
stringclasses 2
values | message_id
int64 0
1
| conversation_id
int64 450
109k
| cluster
float64 2
2
| __index_level_0__
int64 900
217k
|
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
|
instruction
| 0
| 8,577
| 2
| 17,154
|
Tags: implementation, sortings
Correct Solution:
```
import sys
from collections import defaultdict as dd
from collections import Counter as cc
from queue import Queue
import math
import itertools
try:
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
except:
pass
input = lambda: sys.stdin.buffer.readline().rstrip()
for _ in range(int(input())):
n=int(input())
q=sorted(list(map(int,input().split())))
t=-1
for i in range(n):
if q[i]!=q[0]:
t=i
break
if t==-1:
print(0)
else:
print(n-t)
```
|
output
| 1
| 8,577
| 2
| 17,155
|
Provide tags and a correct Python 3 solution for this coding contest problem.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
|
instruction
| 0
| 8,578
| 2
| 17,156
|
Tags: implementation, sortings
Correct Solution:
```
t=int(input())
while t:
n=int(input())
a=list(map(int,input().split()))
b=min(a)
out=0
for i in a:
if i>b:
out+=1
print(out)
t-=1
```
|
output
| 1
| 8,578
| 2
| 17,157
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
Submitted Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Mon Feb 15 20:40:17 2021
@author: HP
"""
import sys
def get_arr():
return list (map (int, sys.stdin.readline ().strip ().split ()))
t = int (input ())
for i in range (t):
n = int (input ())
arr = get_arr()
if max (arr) ==min (arr):
print (0)
else:
count = 0
for j in arr:
if j == min (arr):
count += 1
print (len (arr) - count)
```
|
instruction
| 0
| 8,579
| 2
| 17,158
|
Yes
|
output
| 1
| 8,579
| 2
| 17,159
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
Submitted Solution:
```
t=int(input())
for i in range(0,t):
n=int(input())
a=[int(x) for x in input().split()]
a.sort()
print(n-a.count(a[0]))
```
|
instruction
| 0
| 8,580
| 2
| 17,160
|
Yes
|
output
| 1
| 8,580
| 2
| 17,161
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
Submitted Solution:
```
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
m = min(a)
print(len([i for i in a if i != m]))
```
|
instruction
| 0
| 8,581
| 2
| 17,162
|
Yes
|
output
| 1
| 8,581
| 2
| 17,163
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
Submitted Solution:
```
#pyrival orz
import os
import sys
from io import BytesIO, IOBase
input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input()
return(list(s[:len(s) - 1]))
def invr():
return(map(int,input().split()))
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
def seive(n):
primes = [True]*(n+1)
for i in range(2, n):
if not primes[i]:
continue
j = 2*i
while j <= n:
primes[j] = False
j += i
return primes
def factors(n):
factors = []
x = 2
while x*x <= n:
while n % x == 0:
factors.append(x)
n //= x
if n > 1:
factors.append(x)
return factors
# Functions: list of factors, seive of primes, gcd of two numbers
def main():
try:
for _ in range(inp()):
n = inp()
a = inlt()
mn = min(a)
ans = 0
for i in range(n):
if a[i] != mn:
ans += 1
print(ans)
except Exception as e:
print(e)
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main()
```
|
instruction
| 0
| 8,582
| 2
| 17,164
|
Yes
|
output
| 1
| 8,582
| 2
| 17,165
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
Submitted Solution:
```
n = int(input().strip())
print(n)
```
|
instruction
| 0
| 8,583
| 2
| 17,166
|
No
|
output
| 1
| 8,583
| 2
| 17,167
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
Submitted Solution:
```
num = int(input())
list = []
for a in range(num):
hero = int(input('Кол-во героев: '))
level = input('введите уровни героев: ')
for i in level:
if i == ' ':
pass
else:
list.append(int(i))
for run in range(hero-1):
for j in range(hero-1):
if list[j] > list[j+1]:
list[j], list[j+1] = list[j+1], list[j]
else:
pass
w = list.count(list[0])
if w == hero:
print(0)
else:
print(hero - w)
```
|
instruction
| 0
| 8,584
| 2
| 17,168
|
No
|
output
| 1
| 8,584
| 2
| 17,169
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
Submitted Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
winners = 0
champs = sorted(input().split(" "))
for lvl in champs:
if int(lvl) > int(champs[0]):
winners += 1
print(winners)
```
|
instruction
| 0
| 8,585
| 2
| 17,170
|
No
|
output
| 1
| 8,585
| 2
| 17,171
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that were fighting during the last minute).
When two heroes of equal levels fight, nobody wins the fight. When two heroes of different levels fight, the one with the higher level wins, and his level increases by 1.
The winner of the tournament is the first hero that wins in at least 100^{500} fights (note that it's possible that the tournament lasts forever if no hero wins this number of fights, then there is no winner). A possible winner is a hero such that there exists a sequence of fights that this hero becomes the winner of the tournament.
Calculate the number of possible winners among n heroes.
Input
The first line contains one integer t (1 ≤ t ≤ 500) — the number of test cases.
Each test case consists of two lines. The first line contains one integer n (2 ≤ n ≤ 100) — the number of heroes. The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 100), where a_i is the initial level of the i-th hero.
Output
For each test case, print one integer — the number of possible winners among the given n heroes.
Example
Input
3
3
3 2 2
2
5 5
4
1 3 3 7
Output
1
0
3
Note
In the first test case of the example, the only possible winner is the first hero.
In the second test case of the example, each fight between the heroes results in nobody winning it, so the tournament lasts forever and there is no winner.
Submitted Solution:
```
# import math
t = int(input())
for T in range(t):
n = int(input())
l = list(map(int , input().split()))
k = 0
ln = set(l)
# for i in range(1, n):
# if l[i-1]>l[i]:
# k+=1
# l[i-1]+=1
# if l[i]>l[i-1]:
# k+=1
# l[i]+=1
if len(ln)==1:
print(0)
if len(ln)%2==0:
print(len(l) - 1)
else:
print(len(ln))
```
|
instruction
| 0
| 8,586
| 2
| 17,172
|
No
|
output
| 1
| 8,586
| 2
| 17,173
|
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
|
instruction
| 0
| 9,455
| 2
| 18,910
|
Tags: binary search, brute force, implementation
Correct Solution:
```
h1,a1,d1 = map(int, input().split(' '))
h2,a2,d2 = map(int, input().split(' '))
H,A,D = map(int, input().split(' '))
ans = 100000000
for a in range(a1, 201) :
if a-d2 <= 0 : continue
for d in range(d1, 102) :
if a2-d <= 0 : ans = min(ans, (a-a1)*A + (d-d1)*D)
else :
turn = h2//(a-d2) + (h2%(a-d2)>0)
h = max(0, a2-d) * turn + 1
h = max(h, h1)
ans = min(ans, (h-h1)*H + (a-a1)*A + (d-d1)*D)
print(ans)
```
|
output
| 1
| 9,455
| 2
| 18,911
|
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
|
instruction
| 0
| 9,456
| 2
| 18,912
|
Tags: binary search, brute force, implementation
Correct Solution:
```
import math
hpy, atky, defy = map(int, input().split())
hpm, atkm, defm = map(int, input().split())
h,a,d = map(int, input().split())
ans = math.inf
for i in range(defy, 101):
for j in range(max(atky, defm+1), 201):
xx = math.ceil(hpm / (j - defm)) * max(0,(atkm-i))
hh = max(xx+1, hpy)
ans = min(ans, (i -defy)*d + (j-atky)*a + (hh-hpy)*h)
if ans >= math.inf:
print(0)
else:
print(ans)
```
|
output
| 1
| 9,456
| 2
| 18,913
|
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
|
instruction
| 0
| 9,457
| 2
| 18,914
|
Tags: binary search, brute force, implementation
Correct Solution:
```
R=lambda:map(int,input().split())
yH,yA,yD=R()
mH,mA,mD=R()
h,a,d=R()
Q=10**20
for A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):
for D in range(max(0,mA-yD)+1):
H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)
Q=min(A*a+D*d+max(0,h*(1-H)),Q)
print(Q)
# Made By Mostafa_Khaled
```
|
output
| 1
| 9,457
| 2
| 18,915
|
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
|
instruction
| 0
| 9,458
| 2
| 18,916
|
Tags: binary search, brute force, implementation
Correct Solution:
```
hy, ay, dy = map(int, input().split())
hm, am, dm = map(int, input().split())
h, a, d = map(int, input().split())
s = 1 << 30
for da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):
for dd in range(max(0, am - dy) + 1):
dh = max(0, ((am - dy - dd) * ((hm - 1) // (ay + da - dm) + 1) - hy + 1))
s = min(s, h * dh + a * da + d * dd)
print(s)
```
|
output
| 1
| 9,458
| 2
| 18,917
|
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
|
instruction
| 0
| 9,459
| 2
| 18,918
|
Tags: binary search, brute force, implementation
Correct Solution:
```
from math import *
#from bisect import *
#from collections import *
#from random import *
#from decimal import *"""
#from heapq import *
#from random import *
import sys
input=sys.stdin.readline
#sys.setrecursionlimit(3*(10**5))
global flag
def inp():
return int(input())
def st():
return input().rstrip('\n')
def lis():
return list(map(int,input().split()))
def ma1():
return map(int,input().split())
t=1
while(t):
t-=1
yh,ya,yd=ma1()
mh,ma,md=ma1()
h,a,d=ma1()
mi=1000000000
for i in range(1):
for j in range(300):
for k in range(200):
newya,newyd=j+ya,k+yd
if(newya-md <=0):
continue
if((ma-newyd)<=0):
mi=min(mi,a*j + d*k)
continue
t1=ceil(yh/(ma-newyd))
t2=ceil(mh/(newya-md))
need=0
newyh=yh
while(ceil(newyh/(ma-newyd))<=t2):
need+=1
newyh+=1
mi=min(mi,h*need + a*j + d*k)
print(mi)
```
|
output
| 1
| 9,459
| 2
| 18,919
|
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
|
instruction
| 0
| 9,460
| 2
| 18,920
|
Tags: binary search, brute force, implementation
Correct Solution:
```
R=lambda:map(int,input().split())
yH,yA,yD=R()
mH,mA,mD=R()
h,a,d=R()
Q=10**20
for A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):
for D in range(max(0,mA-yD)+1):
H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)
Q=min(A*a+D*d+max(0,h*(1-H)),Q)
print(Q)
```
|
output
| 1
| 9,460
| 2
| 18,921
|
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
|
instruction
| 0
| 9,461
| 2
| 18,922
|
Tags: binary search, brute force, implementation
Correct Solution:
```
H_y,A_y,D_y = map(int,input().split())
H_m,A_m,D_m = map(int,input().split())
h,a,d = map(int,input().split())
ans = 10**20
for A_buy in range(max(0,H_m+D_m-A_y)+1):
for D_buy in range(max(0,A_m-D_y)+1):
damage = A_y + A_buy - D_m
cost = A_buy * a + D_buy * d
if damage > 0 and cost < ans:
time = (H_m+damage-1)//damage
H_left = H_y - time * max(0, A_m - D_y - D_buy)
if H_left <= 0: cost += h * (1-H_left)
if cost < ans:
ans = cost
print(ans)
```
|
output
| 1
| 9,461
| 2
| 18,923
|
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
|
instruction
| 0
| 9,462
| 2
| 18,924
|
Tags: binary search, brute force, implementation
Correct Solution:
```
# HEY STALKER
hp_y, at_y, df_y = map(int, input().split())
hp_m, at_m, df_m = map(int, input().split())
cst_hp, cst_at, cst_df = map(int, input().split())
ans = 2e18
for ati in range(201):
for dfi in range(201):
if ati + at_y > df_m:
k = hp_m // ((at_y + ati) - df_m)
if hp_m % ((at_y + ati) - df_m) != 0:
k += 1
t = max(0, k*(at_m-df_y-dfi) - hp_y+1)
cost = cst_hp*t + cst_df*dfi + cst_at*ati
ans = min(ans, cost)
print(ans)
```
|
output
| 1
| 9,462
| 2
| 18,925
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
Submitted Solution:
```
import math
x, y, z = map(int, input().split())
a, b, c = map(int, input().split())
s, rs, ls = map(int, input().split())
def rec(ss):
for i in range(0, 205, 1):
for j in range(0, 105, 1):
if(i * rs + j * ls <= ss):
q = y + i;p = z + j; pq = x + ((int)((ss - i * rs - j *ls) / s))
an1 = 1000000000000.0;an2 = 1000000000000.0
if(b - p > 0):
an1 = math.ceil(((float) (pq)) / ((float)(b - p)))
if(q - c > 0):
an2 = math.ceil(((float) (a)) / ((float)(q - c)))
if(q > c and p >= b or an1 > an2):
return True
return False
st = 0; en = 100000; mid = 0
while(st <= en):
mid = (int)((st + en) / 2)
if(rec(mid) == True):
en = mid - 1
else:
st = mid + 1
print(en + 1)
```
|
instruction
| 0
| 9,463
| 2
| 18,926
|
Yes
|
output
| 1
| 9,463
| 2
| 18,927
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
Submitted Solution:
```
from operator import itemgetter
def bin_search(lo, hi, key):
while (lo < hi):
md = (hi + lo) // 2
if (md >= key(md)):
hi = md
#print("new hi:", hi)
else:
lo = md + 1
#print("new lo:", lo)
return lo #or hi, they're equal at this point
def key_func(budget, prices):
for k in range(1 + budget//prices[2]):
budget2 = budget - k*prices[2]
for j in range(1 + budget2//prices[1]):
budget3 = budget2 - j*prices[1]
i = budget3//prices[0]
if survive(i, j, k):
return budget - 1
return budget + 1
def survive(i, j, k):
#global y, m, p, penumsorted
toadd = [i, j, k]
newy = list(y)
newmhp = m[0]
for i, item in enumerate(penumsorted):
newy[item[0]] = y[item[0]] + toadd[i]
#print(vars())
while newy[0] > 0 and newmhp > 0:
oldmhp = newmhp;
newy[0] -= max(0, m[1] - newy[2])
newmhp -= max(0, newy[1] - m[2])
if oldmhp == newmhp:
newy[0] = 0
if newmhp <= 0 and newy[0] > 0:
return True
else:
return False
y = list(map(int, input().split()))
m = list(map(int, input().split()))
p = list(map(int, input().split()))
psorted = sorted(p)
penum = list(enumerate(p))
penumsorted = sorted(penum, key=itemgetter(1))
print(bin_search(0, 20000, lambda x: key_func(x, psorted)))
```
|
instruction
| 0
| 9,464
| 2
| 18,928
|
Yes
|
output
| 1
| 9,464
| 2
| 18,929
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
Submitted Solution:
```
from math import ceil
hy, ay, dy = map(int, input().split())
hm, am, dm = map(int, input().split())
hp, ap, dp = map(int, input().split())
def time(ay, hm, dm):
return float('inf') if ay <= dm else ceil(hm / (ay - dm))
def health_need(t, dy, am):
return 0 if dy >= am else t * (am - dy) + 1
min_p = float('inf')
for a in range(ay, 200 + 1):
t = time(a, hm, dm)
if t == float('inf'):
continue
for d in range(dy, 100 + 1):
h = health_need(t, d, am)
a_p = (a - ay) * ap
d_p = (d - dy) * dp
h_p = max(0, h - hy) * hp
total = a_p + d_p + h_p
if total < min_p:
min_p = total
print(min_p)
```
|
instruction
| 0
| 9,465
| 2
| 18,930
|
Yes
|
output
| 1
| 9,465
| 2
| 18,931
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
Submitted Solution:
```
H_y, A_y, D_y = map(int, input().split())
H_m, A_m, D_m = map(int, input().split())
h, a, d = map(int, input().split())
res = int(2e9)
n = H_m + D_m - A_y
m = A_m - D_y
for i in range(max(0, n)+1):
for j in range(max(0, m)+1):
d = A_y + i - D_m
cost = i * a + j * d
if d > 0 and cost < res:
time = (H_m + d - 1) // d
t = H_y - time * max(0, A_m - D_y - j)
if t <= 0:
cost += h * (1 - t)
res = min(res, cost)
print(res)
```
|
instruction
| 0
| 9,466
| 2
| 18,932
|
No
|
output
| 1
| 9,466
| 2
| 18,933
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
Submitted Solution:
```
hpy,atky,defy=list(map(int,input().split()))
hpm,atkm,defm=list(map(int,input().split()))
h,a,d=list(map(int,input().split()))
ans=0
dp=hpy-max(0,atkm-defy)
if dp<0:
m=10000000000
for i in range(101):
for j in range(101):
if hpy+i-max(0,atkm-(defy+j))>0:
m=min(m,i*h+j*d)
ans=ans+m
elif dp==0:
ans=ans+min(h,d)
da=hpm+defm-atky
if da>0 and da>dp:
ans=ans+(da//a+bool(da%a))*a
print(ans)
```
|
instruction
| 0
| 9,467
| 2
| 18,934
|
No
|
output
| 1
| 9,467
| 2
| 18,935
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
Submitted Solution:
```
from operator import itemgetter
def bin_search(lo, hi, key):
while (lo < hi):
md = (hi + lo) // 2
if (md >= key(md)):
hi = md
#print("new hi:", hi)
else:
lo = md + 1
#print("new lo:", lo)
return lo #or hi, they're equal at this point
def key_func(budget, prices):
for k in range(1 + budget//prices[2]):
budget2 = budget - k*prices[2]
for j in range(1 + budget2//prices[1]):
budget3 = budget2 - j*prices[1]
i = budget3//prices[0]
if survive(i, j, k):
return budget - 1
return budget + 1
def survive(i, j, k):
global y, m, p, penumsorted
toadd = [i, j, k]
newy = list(y)
newm = list(m)
for item in penumsorted:
newy[item[0]] = y[item[0]] + toadd[item[0]]
#print(vars())
while newy[0] > 0 and newm[0] > 0:
newy[0] -= max(0, newm[1] - newy[2])
newm[0] -= max(0, newy[1] - newm[2])
if newm[0] <= 0 and newy[0] > 0:
return True
else:
return False
y = list(map(int, input().split()))
m = list(map(int, input().split()))
p = list(map(int, input().split()))
psorted = sorted(p)
penum = list(enumerate(p))
penumsorted = sorted(penum, key=itemgetter(1))
print(bin_search(0, 30000, lambda x: key_func(x, psorted)))
```
|
instruction
| 0
| 9,468
| 2
| 18,936
|
No
|
output
| 1
| 9,468
| 2
| 18,937
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the monster's HP decrease by max(0, ATKY - DEFM), while Yang's HP decreases by max(0, ATKM - DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP ≤ 0 and the same time Master Yang's HP > 0, Master Yang wins.
Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF.
Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win.
Input
The first line contains three integers HPY, ATKY, DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang.
The second line contains three integers HPM, ATKM, DEFM, separated by a space, denoting the HP, ATK and DEF of the monster.
The third line contains three integers h, a, d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF.
All numbers in input are integer and lie between 1 and 100 inclusively.
Output
The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win.
Examples
Input
1 2 1
1 100 1
1 100 100
Output
99
Input
100 100 100
1 1 1
1 1 1
Output
0
Note
For the first sample, prices for ATK and DEF are extremely high. Master Yang can buy 99 HP, then he can beat the monster with 1 HP left.
For the second sample, Master Yang is strong enough to beat the monster, so he doesn't need to buy anything.
Submitted Solution:
```
import math
x, y, z = map(int, input().split())
a, b, c = map(int, input().split())
s, rs, ls = map(int, input().split())
def rec(ss):
for i in range(0, 155, 1):
for j in range(0, 155, 1):
if(i * rs + j * ls <= ss):
q = y + i;p = z + j; pq = x + (ss - i * rs - j *ls) / s
an1 = 1000000000000.0;an2 = 1000000000000.0
if(b - p > 0):
an1 = math.ceil(((float) (pq)) / ((float)(b - p)))
if(q - c > 0):
an2 = math.ceil(((float) (a)) / ((float)(q - c)))
if(q > c and p >= b or an1 > an2):
return True
return False
st = 0; en = 100000; mid = 0
while(st <= en):
mid = (int)((st + en) / 2)
if(rec(mid) == True):
en = mid - 1
else:
st = mid + 1
print(en + 1)
```
|
instruction
| 0
| 9,469
| 2
| 18,938
|
No
|
output
| 1
| 9,469
| 2
| 18,939
|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types of geometric figures. The number of figures of type ki and figure cost ci is known for each figure type. A player gets ci·f points for destroying one figure of type i, where f is the current factor. The factor value can be an integer number from 1 to t + 1, inclusive. At the beginning of the game the factor value is equal to 1. The factor is set to i + 1 after destruction of pi (1 ≤ i ≤ t) figures, so the (pi + 1)-th figure to be destroyed is considered with factor equal to i + 1.
Your task is to determine the maximum number of points Vasya can get after he destroys all figures. Take into account that Vasya is so tough that he can destroy figures in any order chosen by him.
Input
The first line contains the only integer number n (1 ≤ n ≤ 100) — the number of figure types.
Each of the following n lines contains two integer numbers ki and ci (1 ≤ ki ≤ 109, 0 ≤ ci ≤ 1000), separated with space — the number of figures of the i-th type and the cost of one i-type figure, correspondingly.
The next line contains the only integer number t (1 ≤ t ≤ 100) — the number that describe the factor's changes.
The next line contains t integer numbers pi (1 ≤ p1 < p2 < ... < pt ≤ 1012), separated with spaces.
Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Output
Print the only number — the maximum number of points Vasya can get.
Examples
Input
1
5 10
2
3 6
Output
70
Input
2
3 8
5 10
1
20
Output
74
Note
In the first example Vasya destroys three figures first and gets 3·1·10 = 30 points. Then the factor will become equal to 2 and after destroying the last two figures Vasya will get 2·2·10 = 40 points. As a result Vasya will get 70 points.
In the second example all 8 figures will be destroyed with factor 1, so Vasya will get (3·8 + 5·10)·1 = 74 points.
|
instruction
| 0
| 10,223
| 2
| 20,446
|
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
import sys
def solve():
n, = rv()
figures = list()
before = 0
for i in range(n):
number, cost, = rv()
figures.append([cost, number, before, before + number])
figures.sort()
for i in range(n):
number = figures[i][1]
figures[i][2] = before
figures[i][3] = before + number
before += number
t, = rv()
p = [0] + list(map(int, input().split())) + [before]
res = 0
for i in range(1, len(p)):
for f in range(len(figures)):
left = max(figures[f][2], p[i - 1])
right = min(figures[f][3], p[i])
num = max(0, right - left)
res += num * i * figures[f][0]
# print(left, right, num, i , f, figures[f][0])
print(res)
def prt(l): return print(''.join(l))
def rv(): return map(int, input().split())
def rl(n): return [list(map(int, input().split())) for _ in range(n)]
if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
solve()
# Made By Mostafa_Khaled
```
|
output
| 1
| 10,223
| 2
| 20,447
|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types of geometric figures. The number of figures of type ki and figure cost ci is known for each figure type. A player gets ci·f points for destroying one figure of type i, where f is the current factor. The factor value can be an integer number from 1 to t + 1, inclusive. At the beginning of the game the factor value is equal to 1. The factor is set to i + 1 after destruction of pi (1 ≤ i ≤ t) figures, so the (pi + 1)-th figure to be destroyed is considered with factor equal to i + 1.
Your task is to determine the maximum number of points Vasya can get after he destroys all figures. Take into account that Vasya is so tough that he can destroy figures in any order chosen by him.
Input
The first line contains the only integer number n (1 ≤ n ≤ 100) — the number of figure types.
Each of the following n lines contains two integer numbers ki and ci (1 ≤ ki ≤ 109, 0 ≤ ci ≤ 1000), separated with space — the number of figures of the i-th type and the cost of one i-type figure, correspondingly.
The next line contains the only integer number t (1 ≤ t ≤ 100) — the number that describe the factor's changes.
The next line contains t integer numbers pi (1 ≤ p1 < p2 < ... < pt ≤ 1012), separated with spaces.
Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Output
Print the only number — the maximum number of points Vasya can get.
Examples
Input
1
5 10
2
3 6
Output
70
Input
2
3 8
5 10
1
20
Output
74
Note
In the first example Vasya destroys three figures first and gets 3·1·10 = 30 points. Then the factor will become equal to 2 and after destroying the last two figures Vasya will get 2·2·10 = 40 points. As a result Vasya will get 70 points.
In the second example all 8 figures will be destroyed with factor 1, so Vasya will get (3·8 + 5·10)·1 = 74 points.
|
instruction
| 0
| 10,224
| 2
| 20,448
|
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
n=int(input())
a=[list(map(int,input().split()))[::-1] for i in range(n)]
t=int(input())
p=list(map(int,input().split()))
b=0
i=0
a.sort()
c=0
for j in range(n):
while i<t and p[i]-b<=a[j][1]:
c+=(p[i]-b)*(i+1)*a[j][0]
a[j][1]-=p[i]-b
b=p[i]
i+=1
c+=a[j][1]*(i+1)*a[j][0]
b+=a[j][1]
print(c)
```
|
output
| 1
| 10,224
| 2
| 20,449
|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types of geometric figures. The number of figures of type ki and figure cost ci is known for each figure type. A player gets ci·f points for destroying one figure of type i, where f is the current factor. The factor value can be an integer number from 1 to t + 1, inclusive. At the beginning of the game the factor value is equal to 1. The factor is set to i + 1 after destruction of pi (1 ≤ i ≤ t) figures, so the (pi + 1)-th figure to be destroyed is considered with factor equal to i + 1.
Your task is to determine the maximum number of points Vasya can get after he destroys all figures. Take into account that Vasya is so tough that he can destroy figures in any order chosen by him.
Input
The first line contains the only integer number n (1 ≤ n ≤ 100) — the number of figure types.
Each of the following n lines contains two integer numbers ki and ci (1 ≤ ki ≤ 109, 0 ≤ ci ≤ 1000), separated with space — the number of figures of the i-th type and the cost of one i-type figure, correspondingly.
The next line contains the only integer number t (1 ≤ t ≤ 100) — the number that describe the factor's changes.
The next line contains t integer numbers pi (1 ≤ p1 < p2 < ... < pt ≤ 1012), separated with spaces.
Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Output
Print the only number — the maximum number of points Vasya can get.
Examples
Input
1
5 10
2
3 6
Output
70
Input
2
3 8
5 10
1
20
Output
74
Note
In the first example Vasya destroys three figures first and gets 3·1·10 = 30 points. Then the factor will become equal to 2 and after destroying the last two figures Vasya will get 2·2·10 = 40 points. As a result Vasya will get 70 points.
In the second example all 8 figures will be destroyed with factor 1, so Vasya will get (3·8 + 5·10)·1 = 74 points.
|
instruction
| 0
| 10,225
| 2
| 20,450
|
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
import sys
def solve():
n, = rv()
figures = list()
before = 0
for i in range(n):
number, cost, = rv()
figures.append([cost, number, before, before + number])
figures.sort()
for i in range(n):
number = figures[i][1]
figures[i][2] = before
figures[i][3] = before + number
before += number
t, = rv()
p = [0] + list(map(int, input().split())) + [before]
res = 0
for i in range(1, len(p)):
for f in range(len(figures)):
left = max(figures[f][2], p[i - 1])
right = min(figures[f][3], p[i])
num = max(0, right - left)
res += num * i * figures[f][0]
# print(left, right, num, i , f, figures[f][0])
print(res)
def prt(l): return print(''.join(l))
def rv(): return map(int, input().split())
def rl(n): return [list(map(int, input().split())) for _ in range(n)]
if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
solve()
```
|
output
| 1
| 10,225
| 2
| 20,451
|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types of geometric figures. The number of figures of type ki and figure cost ci is known for each figure type. A player gets ci·f points for destroying one figure of type i, where f is the current factor. The factor value can be an integer number from 1 to t + 1, inclusive. At the beginning of the game the factor value is equal to 1. The factor is set to i + 1 after destruction of pi (1 ≤ i ≤ t) figures, so the (pi + 1)-th figure to be destroyed is considered with factor equal to i + 1.
Your task is to determine the maximum number of points Vasya can get after he destroys all figures. Take into account that Vasya is so tough that he can destroy figures in any order chosen by him.
Input
The first line contains the only integer number n (1 ≤ n ≤ 100) — the number of figure types.
Each of the following n lines contains two integer numbers ki and ci (1 ≤ ki ≤ 109, 0 ≤ ci ≤ 1000), separated with space — the number of figures of the i-th type and the cost of one i-type figure, correspondingly.
The next line contains the only integer number t (1 ≤ t ≤ 100) — the number that describe the factor's changes.
The next line contains t integer numbers pi (1 ≤ p1 < p2 < ... < pt ≤ 1012), separated with spaces.
Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Output
Print the only number — the maximum number of points Vasya can get.
Examples
Input
1
5 10
2
3 6
Output
70
Input
2
3 8
5 10
1
20
Output
74
Note
In the first example Vasya destroys three figures first and gets 3·1·10 = 30 points. Then the factor will become equal to 2 and after destroying the last two figures Vasya will get 2·2·10 = 40 points. As a result Vasya will get 70 points.
In the second example all 8 figures will be destroyed with factor 1, so Vasya will get (3·8 + 5·10)·1 = 74 points.
|
instruction
| 0
| 10,226
| 2
| 20,452
|
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
if __name__ == '__main__':
n = int(input())
pieces = [input() for _ in range(n)]
pieces = [_.split() for _ in pieces]
pieces = [tuple(_) for _ in pieces]
pieces = [[int(k), int(c)] for k, c in pieces]
t = int(input())
p = input().split()
p = [int(_) for _ in p]
pieces = sorted(pieces, key=lambda x: x[1])
values = []
count = 0
i = 0
j = 0
while i < n and j < t:
if count + pieces[i][0] < p[j]:
values.append((pieces[i][0], pieces[i][1], j + 1))
count += pieces[i][0]
i += 1
elif count + pieces[i][0] == p[j]:
values.append((pieces[i][0], pieces[i][1], j + 1))
count += pieces[i][0]
i += 1
j += 1
else:
diff = p[j] - count
values.append((diff, pieces[i][1], j + 1))
count = p[j]
j += 1
pieces[i][0] -= diff
while i < n:
values.append((pieces[i][0], pieces[i][1], j + 1))
i += 1
score = 0
for a, b, c in values:
score += a * b * c
print(score)
```
|
output
| 1
| 10,226
| 2
| 20,453
|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types of geometric figures. The number of figures of type ki and figure cost ci is known for each figure type. A player gets ci·f points for destroying one figure of type i, where f is the current factor. The factor value can be an integer number from 1 to t + 1, inclusive. At the beginning of the game the factor value is equal to 1. The factor is set to i + 1 after destruction of pi (1 ≤ i ≤ t) figures, so the (pi + 1)-th figure to be destroyed is considered with factor equal to i + 1.
Your task is to determine the maximum number of points Vasya can get after he destroys all figures. Take into account that Vasya is so tough that he can destroy figures in any order chosen by him.
Input
The first line contains the only integer number n (1 ≤ n ≤ 100) — the number of figure types.
Each of the following n lines contains two integer numbers ki and ci (1 ≤ ki ≤ 109, 0 ≤ ci ≤ 1000), separated with space — the number of figures of the i-th type and the cost of one i-type figure, correspondingly.
The next line contains the only integer number t (1 ≤ t ≤ 100) — the number that describe the factor's changes.
The next line contains t integer numbers pi (1 ≤ p1 < p2 < ... < pt ≤ 1012), separated with spaces.
Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Output
Print the only number — the maximum number of points Vasya can get.
Examples
Input
1
5 10
2
3 6
Output
70
Input
2
3 8
5 10
1
20
Output
74
Note
In the first example Vasya destroys three figures first and gets 3·1·10 = 30 points. Then the factor will become equal to 2 and after destroying the last two figures Vasya will get 2·2·10 = 40 points. As a result Vasya will get 70 points.
In the second example all 8 figures will be destroyed with factor 1, so Vasya will get (3·8 + 5·10)·1 = 74 points.
|
instruction
| 0
| 10,227
| 2
| 20,454
|
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
n = int(input())
figures = []
for _ in range(n):
amount, cost = map(int, input().split())
figures += [(cost, amount)]
figures.sort()
t = int(input())
T = list(map(int, input().split()))
result = 0
destructed = 0
i, j = 0, 0
while i < len(figures):
if j < len(T) and destructed + figures[i][1] >= T[j]:
take = T[j] - destructed
destructed += take
figures[i] = (figures[i][0], figures[i][1] - take)
result += take * (j + 1) * figures[i][0]
j += 1
else:
take = figures[i][1]
destructed += take
result += take * (j + 1) * figures[i][0]
i += 1
print(result)
```
|
output
| 1
| 10,227
| 2
| 20,455
|
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types of geometric figures. The number of figures of type ki and figure cost ci is known for each figure type. A player gets ci·f points for destroying one figure of type i, where f is the current factor. The factor value can be an integer number from 1 to t + 1, inclusive. At the beginning of the game the factor value is equal to 1. The factor is set to i + 1 after destruction of pi (1 ≤ i ≤ t) figures, so the (pi + 1)-th figure to be destroyed is considered with factor equal to i + 1.
Your task is to determine the maximum number of points Vasya can get after he destroys all figures. Take into account that Vasya is so tough that he can destroy figures in any order chosen by him.
Input
The first line contains the only integer number n (1 ≤ n ≤ 100) — the number of figure types.
Each of the following n lines contains two integer numbers ki and ci (1 ≤ ki ≤ 109, 0 ≤ ci ≤ 1000), separated with space — the number of figures of the i-th type and the cost of one i-type figure, correspondingly.
The next line contains the only integer number t (1 ≤ t ≤ 100) — the number that describe the factor's changes.
The next line contains t integer numbers pi (1 ≤ p1 < p2 < ... < pt ≤ 1012), separated with spaces.
Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.
Output
Print the only number — the maximum number of points Vasya can get.
Examples
Input
1
5 10
2
3 6
Output
70
Input
2
3 8
5 10
1
20
Output
74
Note
In the first example Vasya destroys three figures first and gets 3·1·10 = 30 points. Then the factor will become equal to 2 and after destroying the last two figures Vasya will get 2·2·10 = 40 points. As a result Vasya will get 70 points.
In the second example all 8 figures will be destroyed with factor 1, so Vasya will get (3·8 + 5·10)·1 = 74 points.
|
instruction
| 0
| 10,228
| 2
| 20,456
|
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
n = int(input())
fig = [tuple(map(int, input().split()))[::-1] for _ in range(n)]
fig.sort()
t = int(input())
a = list(map(int, input().split()))
res, curr = 0, 0
i, j = 0, 0
while i < n:
if j < t and curr + fig[i][1] >= a[j]:
take = a[j] - curr
curr += take
fig[i] = (fig[i][0], fig[i][1] - take)
res += take * (j + 1) * fig[i][0]
j += 1
else:
take = fig[i][1]
curr += take
res += take * (j + 1) * fig[i][0]
i += 1
print(res)
```
|
output
| 1
| 10,228
| 2
| 20,457
|
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
|
instruction
| 0
| 10,550
| 2
| 21,100
|
"Correct Solution:
```
H, N = map(int, input().split())
l = list(map(int, input().split()))
print('Yes' if H <= sum(l) else 'No')
```
|
output
| 1
| 10,550
| 2
| 21,101
|
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
|
instruction
| 0
| 10,551
| 2
| 21,102
|
"Correct Solution:
```
H, N = map(int, input().split())
PP = list(map(int, input().split()))
print("Yes" if sum(PP) >= H else "No")
```
|
output
| 1
| 10,551
| 2
| 21,103
|
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
|
instruction
| 0
| 10,552
| 2
| 21,104
|
"Correct Solution:
```
H, N = map(int, input().split())
a = sum(map(int, input().split()))
print("Yes" if a >= H else "No")
```
|
output
| 1
| 10,552
| 2
| 21,105
|
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
|
instruction
| 0
| 10,553
| 2
| 21,106
|
"Correct Solution:
```
h, n, *a = map(int, open(0).read().split())
if sum(a) >= h:
print("Yes")
else:
print("No")
```
|
output
| 1
| 10,553
| 2
| 21,107
|
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
|
instruction
| 0
| 10,554
| 2
| 21,108
|
"Correct Solution:
```
h,n=map(int,input().split())
A=list(map(int,input().split()))
print("Yes" if h<=sum(A) else "No")
```
|
output
| 1
| 10,554
| 2
| 21,109
|
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
|
instruction
| 0
| 10,555
| 2
| 21,110
|
"Correct Solution:
```
h,n = map(int,input().split())
a =[int(i) for i in input().split()]
print("Yes" if sum(a) >= h else "No")
```
|
output
| 1
| 10,555
| 2
| 21,111
|
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
|
instruction
| 0
| 10,556
| 2
| 21,112
|
"Correct Solution:
```
H,N=map(int,input().split())
A=[int(i) for i in input().split()]
print('Yes' if H<=sum(A) else "No")
```
|
output
| 1
| 10,556
| 2
| 21,113
|
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
|
instruction
| 0
| 10,557
| 2
| 21,114
|
"Correct Solution:
```
h,n = map(int,input().split())
a = list(map(int,input().split()))
print(["No","Yes"][sum(a) >= h])
```
|
output
| 1
| 10,557
| 2
| 21,115
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
Submitted Solution:
```
h,a=map(int,input().split())
l=list(map(int,input().split()))
print("Yes" if h<=sum(l) else "No")
```
|
instruction
| 0
| 10,558
| 2
| 21,116
|
Yes
|
output
| 1
| 10,558
| 2
| 21,117
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
Submitted Solution:
```
h,n=map(int,input().split())
A=tuple(map(int,input().split()))
print('Yes' if sum(A)>=h else 'No')
```
|
instruction
| 0
| 10,559
| 2
| 21,118
|
Yes
|
output
| 1
| 10,559
| 2
| 21,119
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
Submitted Solution:
```
h, _, *a = map(int, open(0).read().split())
print("Yes" if sum(a) >= h else "No")
```
|
instruction
| 0
| 10,560
| 2
| 21,120
|
Yes
|
output
| 1
| 10,560
| 2
| 21,121
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
Submitted Solution:
```
H, N = map(int, input().split())
A = [int(i) for i in input().split()]
print("Yes" if H<=sum(A) else "No")
```
|
instruction
| 0
| 10,561
| 2
| 21,122
|
Yes
|
output
| 1
| 10,561
| 2
| 21,123
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
Submitted Solution:
```
A, B = map(int, input().split())
input_list = input().split( )
input_sum = sum(input_list)
if(A <= input_sum):
print("Yes")
else:
print("No")
```
|
instruction
| 0
| 10,562
| 2
| 21,124
|
No
|
output
| 1
| 10,562
| 2
| 21,125
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
Submitted Solution:
```
N,H = map(int,input().split())
A = [int(i) for i in input().split()]
A.sort(reverse = True)
B = max(0,N-(A[0]+A[1]))
if B > 0:
print("No")
else:
print("Yes")
```
|
instruction
| 0
| 10,563
| 2
| 21,126
|
No
|
output
| 1
| 10,563
| 2
| 21,127
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
Submitted Solution:
```
H,N = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
#print(A)
MOVES = len(A)
NUM = MOVES
#print(MOVES)
count = 0
flag = 0
while(MOVES > 0):
H -= A[MOVES-1]
MOVES -= 1
if(H < 1):
print('yes')
flag = 1
break
if(flag == 0):
print('no')
```
|
instruction
| 0
| 10,564
| 2
| 21,128
|
No
|
output
| 1
| 10,564
| 2
| 21,129
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the monster's health becomes 0 or below.
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Constraints
* 1 \leq H \leq 10^9
* 1 \leq N \leq 10^5
* 1 \leq A_i \leq 10^4
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
H N
A_1 A_2 ... A_N
Output
If Raccoon can win without using the same move twice or more, print `Yes`; otherwise, print `No`.
Examples
Input
10 3
4 5 6
Output
Yes
Input
20 3
4 5 6
Output
No
Input
210 5
31 41 59 26 53
Output
Yes
Input
211 5
31 41 59 26 53
Output
No
Submitted Solution:
```
H,N = map(int, input().split())
hisatsu = list(map(int,input().split()))
for i in range(N):
H -= hisatsu[i-1]
if H >> 0:
print(No)
else:
print(Yes)
```
|
instruction
| 0
| 10,565
| 2
| 21,130
|
No
|
output
| 1
| 10,565
| 2
| 21,131
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.
Sir Jaime Lannister has discovered that Daenerys Targaryen is going to attack his kingdom soon. Therefore he wants to defend his kingdom. He has k liters of a strange liquid. He wants to distribute that liquid among the castles, so each castle may contain some liquid (possibly zero or non-integer number of liters). After that the stability of a wall is defined as follows: if the wall connects two castles a and b, and they contain x and y liters of that liquid, respectively, then the strength of that wall is x·y.
Your task is to print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.
Input
The first line of the input contains two integers n and k (1 ≤ n ≤ 40, 1 ≤ k ≤ 1000).
Then n lines follows. The i-th of these lines contains n integers ai, 1, ai, 2, ..., ai, n (<image>). If castles i and j are connected by a wall, then ai, j = 1. Otherwise it is equal to 0.
It is guaranteed that ai, j = aj, i and ai, i = 0 for all 1 ≤ i, j ≤ n.
Output
Print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.
Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.
Examples
Input
3 1
0 1 0
1 0 0
0 0 0
Output
0.250000000000
Input
4 4
0 1 0 1
1 0 1 0
0 1 0 1
1 0 1 0
Output
4.000000000000
Note
In the first sample, we can assign 0.5, 0.5, 0 liters of liquid to castles 1, 2, 3, respectively, to get the maximum sum (0.25).
In the second sample, we can assign 1.0, 1.0, 1.0, 1.0 liters of liquid to castles 1, 2, 3, 4, respectively, to get the maximum sum (4.0)
Submitted Solution:
```
n,k=map(int,input().split())
for i in range(n):
for a in input().split():
if int(a) > 0:
print((int(k)*.5)**2)
exit(0)
print(0)
```
|
instruction
| 0
| 11,317
| 2
| 22,634
|
No
|
output
| 1
| 11,317
| 2
| 22,635
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.
Sir Jaime Lannister has discovered that Daenerys Targaryen is going to attack his kingdom soon. Therefore he wants to defend his kingdom. He has k liters of a strange liquid. He wants to distribute that liquid among the castles, so each castle may contain some liquid (possibly zero or non-integer number of liters). After that the stability of a wall is defined as follows: if the wall connects two castles a and b, and they contain x and y liters of that liquid, respectively, then the strength of that wall is x·y.
Your task is to print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.
Input
The first line of the input contains two integers n and k (1 ≤ n ≤ 40, 1 ≤ k ≤ 1000).
Then n lines follows. The i-th of these lines contains n integers ai, 1, ai, 2, ..., ai, n (<image>). If castles i and j are connected by a wall, then ai, j = 1. Otherwise it is equal to 0.
It is guaranteed that ai, j = aj, i and ai, i = 0 for all 1 ≤ i, j ≤ n.
Output
Print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.
Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.
Examples
Input
3 1
0 1 0
1 0 0
0 0 0
Output
0.250000000000
Input
4 4
0 1 0 1
1 0 1 0
0 1 0 1
1 0 1 0
Output
4.000000000000
Note
In the first sample, we can assign 0.5, 0.5, 0 liters of liquid to castles 1, 2, 3, respectively, to get the maximum sum (0.25).
In the second sample, we can assign 1.0, 1.0, 1.0, 1.0 liters of liquid to castles 1, 2, 3, 4, respectively, to get the maximum sum (4.0)
Submitted Solution:
```
read = lambda: map(int, input().split())
n, K = read()
a = [list(read()) for i in range(n)]
ans = 0
for i in range(n):
for j in range(i + 1, n):
if a[i][j] == 1:
ans = max(ans, 1 / 4)
for k in range(j + 1, n):
if a[i][j] == a[j][k] == a[k][i] == 1:
ans = 1 / 3
break
print(ans * K * K)
```
|
instruction
| 0
| 11,318
| 2
| 22,636
|
No
|
output
| 1
| 11,318
| 2
| 22,637
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.
Sir Jaime Lannister has discovered that Daenerys Targaryen is going to attack his kingdom soon. Therefore he wants to defend his kingdom. He has k liters of a strange liquid. He wants to distribute that liquid among the castles, so each castle may contain some liquid (possibly zero or non-integer number of liters). After that the stability of a wall is defined as follows: if the wall connects two castles a and b, and they contain x and y liters of that liquid, respectively, then the strength of that wall is x·y.
Your task is to print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.
Input
The first line of the input contains two integers n and k (1 ≤ n ≤ 40, 1 ≤ k ≤ 1000).
Then n lines follows. The i-th of these lines contains n integers ai, 1, ai, 2, ..., ai, n (<image>). If castles i and j are connected by a wall, then ai, j = 1. Otherwise it is equal to 0.
It is guaranteed that ai, j = aj, i and ai, i = 0 for all 1 ≤ i, j ≤ n.
Output
Print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.
Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.
Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.
Examples
Input
3 1
0 1 0
1 0 0
0 0 0
Output
0.250000000000
Input
4 4
0 1 0 1
1 0 1 0
0 1 0 1
1 0 1 0
Output
4.000000000000
Note
In the first sample, we can assign 0.5, 0.5, 0 liters of liquid to castles 1, 2, 3, respectively, to get the maximum sum (0.25).
In the second sample, we can assign 1.0, 1.0, 1.0, 1.0 liters of liquid to castles 1, 2, 3, 4, respectively, to get the maximum sum (4.0)
Submitted Solution:
```
_,n=input().split()
print((int(n)*.5)**2)
```
|
instruction
| 0
| 11,319
| 2
| 22,638
|
No
|
output
| 1
| 11,319
| 2
| 22,639
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.