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.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
|
instruction
| 0
| 21,602
| 2
| 43,204
|
Tags: games
Correct Solution:
```
f = lambda: map(int, input().split())
n, k = f()
d = sum(q & 1 for q in f())
s = n - k >> 1
q = s < d and (k & 1 or s < n - d) if n - k & 1 else k & 1 and s >= n - d
if n == k: q = d & 1
print(['Daenerys', 'Stannis'][q])
# Made By Mostafa_Khaled
```
|
output
| 1
| 21,602
| 2
| 43,205
|
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
|
instruction
| 0
| 21,603
| 2
| 43,206
|
Tags: games
Correct Solution:
```
import sys
def solve():
n, k = map(int, input().split())
a = list(map(int, input().split()))
odds = sum([x % 2 for x in a])
evens = n - odds
if n == k: return "Daenerys" if odds % 2 == 0 else "Stannis"
moves = n - k
if moves % 2 == 0: #equal number of moves and Daenerys moves last, stannis wants to destory all evens and have parity be good
eachmove = moves // 2
if evens <= eachmove:
remodds = k
if remodds % 2 == 1:
return "Stannis"
return "Daenerys"
else: #Stannis moves last, Danerys wants to destroy all of the odds
dmoves = moves//2
if odds <= dmoves or (evens <= dmoves and (n - moves) % 2 == 0):
return "Daenerys"
return "Stannis"
if sys.hexversion == 50594544 : sys.stdin = open("test.txt")
print(solve())
```
|
output
| 1
| 21,603
| 2
| 43,207
|
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
|
instruction
| 0
| 21,604
| 2
| 43,208
|
Tags: games
Correct Solution:
```
f = lambda: map(int, input().split())
n, k = f()
d = sum(q & 1 for q in f())
s = n - k >> 1
q = s < d and (k & 1 or s < n - d) if n - k & 1 else k & 1 and s >= n - d
if n == k: q = d & 1
print(['Daenerys', 'Stannis'][q])
```
|
output
| 1
| 21,604
| 2
| 43,209
|
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
|
instruction
| 0
| 21,605
| 2
| 43,210
|
Tags: games
Correct Solution:
```
n, k = map(int, input().split())
o = sum(int(x) & 1 for x in input().split())
e, k = n - o, n - k
if not k:
w = o & 1
elif k & 1:
if ((n - k) & 1) and o <= (k >> 1):
w = 0
elif min(o, e) <= (k >> 1) and not ((n - k) & 1):
w = 0
else:
w = 1
elif ((n - k) & 1) and e <= (k >> 1):
w = 1
else:
w = 0
print(['Daenerys', 'Stannis'][w])
```
|
output
| 1
| 21,605
| 2
| 43,211
|
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
|
instruction
| 0
| 21,606
| 2
| 43,212
|
Tags: games
Correct Solution:
```
n,m=map(int,input().strip().split())
a=list(map(int,input().strip().split()))
x=0
for i in range(n):
if (a[i]&1):
x=x+1
# print(x)
if (n==m):
if (x&1):
print("Stannis")
else:
print("Daenerys")
elif ((n-m)&1):
if (m&1):
if ((n-m)//2>=x):
print("Daenerys");
else:
print("Stannis");
else:
if ((n-m)//2>=x or (n-m)//2>=(n-x)):
print("Daenerys")
else:
print("Stannis");
else:
if (m&1):
if ((n-m)//2>=(n-x)):
print("Stannis")
else:
print("Daenerys")
else:
print("Daenerys")
```
|
output
| 1
| 21,606
| 2
| 43,213
|
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
|
instruction
| 0
| 21,607
| 2
| 43,214
|
Tags: games
Correct Solution:
```
n,k=[int(i) for i in input().split()]
l=[int(i) for i in input().split()]
no=0
for i in l:
no+=i%2
ne=n-no
if n==k:
if no%2:
print("Stannis")
else:
print("Daenerys")
else:
if no<=(n-k)//2:
print("Daenerys")
else:
if no%2:
if (n-k)%2 and ne<=(n-k)//2 and ne%2==0:
print("Daenerys")
elif (n-k)%2==0 and (ne>(n-k)//2 or ne%2):
print("Daenerys")
else:
print("Stannis")
else:
if (n-k)%2 and ne<=(n-k)//2 and ne%2:
print("Daenerys")
elif (n-k)%2==0 and (ne>(n-k)//2 or ne%2==0):
print("Daenerys")
else:
print("Stannis")
```
|
output
| 1
| 21,607
| 2
| 43,215
|
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
|
instruction
| 0
| 21,608
| 2
| 43,216
|
Tags: games
Correct Solution:
```
n, k = map(int,input().split())
a = list(map(int,input().split()))
cnt1 = 0
for i in range(n):
cnt1 += a[i] % 2
ans = ['Daenerys' , 'Stannis']
if(n == k):
print(ans[sum(a)%2])
exit()
if(cnt1 > (n - k)//2 and (n - cnt1) > (n - k)//2):
print(ans[(n - k) % 2])
else:
if(cnt1 > (n - k) //2):
cnt0 = n - cnt1
print(ans[(sum(a) - ((n - k) - cnt0))%2])
else:
print(ans[(sum(a) - cnt1)%2])
```
|
output
| 1
| 21,608
| 2
| 43,217
|
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
|
instruction
| 0
| 21,609
| 2
| 43,218
|
Tags: games
Correct Solution:
```
def f(n, k, l, r):
if n & 1:
if k == n:
return bool(l & 1)
elif k & 1:
return n + k <= 2 * l
else:
return 2 * l < n + k and 2 * l > n - k - 1
else:
if k == n:
return bool(l & 1)
elif k & 1:
return n - k + 1 <= 2 * l
else:
return False
n, k = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
l = list(map(lambda i: i & 1, a)).count(1)
r = n - l
print('Stannis' if f(n, k, l, r) else 'Daenerys')
```
|
output
| 1
| 21,609
| 2
| 43,219
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
Submitted Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect
from itertools import chain, dropwhile, permutations, combinations
from collections import defaultdict, deque
def VI(): return list(map(int,input().split()))
def main(n,k,a):
now = sum(a)
even = sum([x%2==0 for x in a])
odd = sum([x%2==1 for x in a])
d = n-k
D = "Daenerys"
S = "Stannis"
if n==k:
ans = [S,D][now%2==0]
elif d%2==0: # Daenerys last
if k%2==0: ans = D
elif even <= d//2: ans = S
else: ans = D
else: # Stannis last
if k%2==0:
if odd <= d//2 or even <= d//2: ans = D
else: ans = S
else:
if odd <= d//2: ans = D
else: ans = S
print(ans)
def main_input(info=0):
n,k = VI()
a = VI()
main(n,k,a)
if __name__ == "__main__":
main_input()
```
|
instruction
| 0
| 21,610
| 2
| 43,220
|
Yes
|
output
| 1
| 21,610
| 2
| 43,221
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
Submitted Solution:
```
n,k=input().split()
n=int(n)
k=int(k)
s=input()
a=[int(i) for i in s.split()]
nodd=0
for i in a:
if(i%2!=0):
nodd+=1
neven=len(a)-nodd
if(n==k):
if(nodd%2==0):
print("Daenerys")
else:
print("Stannis")
else:
if(nodd<=int((n-k)/2)):
print("Daenerys")
elif(neven<=int((n-k)/2)):
if(k%2==0):
print("Daenerys")
else:
print("Stannis")
else:
if((n-k)%2==0):
print("Daenerys")
else:
print("Stannis")
```
|
instruction
| 0
| 21,611
| 2
| 43,222
|
Yes
|
output
| 1
| 21,611
| 2
| 43,223
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
Submitted Solution:
```
import sys
input = []
input_index = 0
def next(type, number = None):
def next():
global input, input_index
while input_index == len(input):
if sys.stdin:
input = sys.stdin.readline().split()
input_index = 0
else:
raise Exception()
input_index += 1
return input[input_index - 1]
if number is None:
result = type(next())
else:
result = [type(next()) for _ in range(number)]
return result
n, k = next(int, 2)
bs = next(int, n)
oc = 0
for b in bs:
oc += 1 if b % 2 == 1 else 0
ec = n - oc
dh = (n - k) // 2
sh = (n - k) - dh
if n == k:
if oc % 2 == 0:
print("Daenerys")
else:
print("Stannis")
else:
if k % 2 == 0:
if dh == sh:
print("Daenerys")
else:
if dh >= oc or dh >= ec:
print("Daenerys")
else:
print("Stannis")
else:
if dh == sh:
if sh >= ec:
print("Stannis")
else:
print("Daenerys")
else:
if dh >= oc:
print("Daenerys")
else:
print("Stannis")
```
|
instruction
| 0
| 21,612
| 2
| 43,224
|
Yes
|
output
| 1
| 21,612
| 2
| 43,225
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
Submitted Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
cnt = n - k
even = sum([i % 2 == 0 for i in a])
odd = sum([i % 2 == 1 for i in a])
f1 = cnt % 2 == 0 and k % 2 == 1 and even <= cnt // 2
f2 = cnt % 2 == 1 and not (k % 2 == 0 and even <= cnt // 2 or odd <= cnt // 2)
f3 = cnt == 0 and odd % 2 == 1
ans = 'Stannis' if f1 or f2 or f3 else 'Daenerys'
print(ans)
```
|
instruction
| 0
| 21,613
| 2
| 43,226
|
Yes
|
output
| 1
| 21,613
| 2
| 43,227
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
Submitted Solution:
```
import sys
input = []
input_index = 0
def next(type, number = None):
def next():
global input, input_index
while input_index == len(input):
if sys.stdin:
input = sys.stdin.readline().split()
input_index = 0
else:
raise Exception()
input_index += 1
return input[input_index - 1]
if number is None:
result = type(next())
else:
result = [type(next()) for _ in range(number)]
return result
n, k = next(int, 2)
ks = next(int, n)
oc = 0
for k in ks:
oc += 1 if k % 2 == 1 else 0
ec = n - oc
sh = (n - k) // 2 + (1 if (n - k) % 2 == 1 else 0)
dh = (n - k) // 2
if dh == sh:
if k%2==0:
print("Daenerys")
else:
if sh >= ec:
print("Stannis")
else:
print("Daenerys")
else:
if k%2==0:
if dh >= oc:
print("Daenerys")
elif dh >= ec:
print("Daenerys")
else:
print("Stannis")
else:
if dh >= oc:
print("Daenerys")
else:
print("Stannis")
```
|
instruction
| 0
| 21,614
| 2
| 43,228
|
No
|
output
| 1
| 21,614
| 2
| 43,229
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
Submitted Solution:
```
import sys
input = []
input_index = 0
def next(type, number = None):
def next():
global input, input_index
while input_index == len(input):
if sys.stdin:
input = sys.stdin.readline().split()
input_index = 0
else:
raise Exception()
input_index += 1
return input[input_index - 1]
if number is None:
result = type(next())
else:
result = [type(next()) for _ in range(number)]
return result
n, k = next(int, 2)
ks = next(int, n)
oc = 0
for k in ks:
oc += 1 if k % 2 == 1 else 0
ec = n - oc
sh = (n - k) // 2 + (1 if (n - k) % 2 == 1 else 0)
dh = (n - k) // 2
if k%2==0:
if dh == sh:
print("Daenerys")
else:
print("Stannis")
else:
if dh == sh:
print("Daenerys")
elif dh < oc:
print("Stannis")
else:
print("Daenerys")
```
|
instruction
| 0
| 21,615
| 2
| 43,230
|
No
|
output
| 1
| 21,615
| 2
| 43,231
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
Submitted Solution:
```
n,m=map(int,input().strip().split())
a=list(map(int,input().strip().split()))
x=0
for i in range(n):
if (a[i]&1):
x=x+1
# print(x)
if ((n-m)&1):
if (m&1):
if ((n-m)//2>=x):
print("Daenerys");
else:
print("Stannis");
else:
if ((n-m)//2>=x or (n-m)//2>=(n-x)):
print("Daenerys")
else:
print("Stannis");
else:
if (m&1):
if ((n-m)//2>=(n-x)):
print("Stannis")
else:
print("Daenerys")
else:
print("Daenerys")
```
|
instruction
| 0
| 21,616
| 2
| 43,232
|
No
|
output
| 1
| 21,616
| 2
| 43,233
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly k cities left.
The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.
Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
Input
The first line contains two positive space-separated integers, n and k (1 ≤ k ≤ n ≤ 2·105) — the initial number of cities in Westeros and the number of cities at which the game ends.
The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 106), which represent the population of each city in Westeros.
Output
Print string "Daenerys" (without the quotes), if Daenerys wins and "Stannis" (without the quotes), if Stannis wins.
Examples
Input
3 1
1 2 1
Output
Stannis
Input
3 1
2 2 1
Output
Daenerys
Input
6 3
5 20 12 7 14 101
Output
Stannis
Note
In the first sample Stannis will use his move to burn a city with two people and Daenerys will be forced to burn a city with one resident. The only survivor city will have one resident left, that is, the total sum is odd, and thus Stannis wins.
In the second sample, if Stannis burns a city with two people, Daenerys burns the city with one resident, or vice versa. In any case, the last remaining city will be inhabited by two people, that is, the total sum is even, and hence Daenerys wins.
Submitted Solution:
```
n, k = (input().split(' '))
n = int(n)
k = int(k)
people =[int(i) for i in(input().split(' '))]
j = 0
while(1):
if len(people) == k:
if sum(people)%2 == 0:
print('Daenerys')
break
else:
print('Stannis')
break
if j%2 == 0:
l = len(people)
for i in range(l):
if people[i]%2 == 1:
people.remove(people[i])
j += 1
break
if l == len(people):
people.pop()
j += 1
else:
l = len(people)
for i in range(l):
if people[i]%2 == 0:
people.remove(people[i])
j += 1
break
if l == len(people):
people.pop()
j += 1
```
|
instruction
| 0
| 21,617
| 2
| 43,234
|
No
|
output
| 1
| 21,617
| 2
| 43,235
|
Provide a correct Python 3 solution for this coding contest problem.
The fearless Ikta has finally hunted down the infamous Count Big Bridge! Count Bigbridge is now trapped in a rectangular room w meters wide and h meters deep, waiting for his end.
If you select a corner of the room and take the coordinate system so that the width direction is the x-axis and the depth direction is the y-axis, and the inside of the room is in the positive direction, Count Big Bridge is at the point (p, q). .. At point (x, y), there is a shock wave launcher, which is Ikta's ultimate weapon, from which a shock wave of v meters per second is emitted in all directions. This shock wave is valid for t seconds and is reflected off the walls of the room.
Ikta, who is outside the room, wants to know how much Count Big Bridge will suffer, so let's write a program that asks Count Big Bridge how many shock waves he will hit. At this time, if the shock wave hits the enemy from the n direction at the same time, it is considered to have hit the enemy n times, and it is also effective if the shock wave hits the enemy exactly t seconds later. The shock wave does not disappear due to obstacles such as the launcher itself and Count Big Bridge, and the shock waves do not interfere with each other.
Input
The input is given in the following format.
> w h v t x y p q
>
* Each is a positive integer as explained in the problem statement.
Constraints
* v × t ≤ 106
* 2 ≤ w, h ≤ 108
* 0 <x, p <w
* 0 <y, q <h
* (x, y) ≠ (p, q)
Output
Output the number of times the shock wave hits Count Big Bridge on one line.
Examples
Input
10 10 1 10 3 3 7 7
Output
1
Input
10 10 1 11 3 3 7 7
Output
5
Input
2 3 1000 1000 1 1 1 2
Output
523598775681
|
instruction
| 0
| 21,969
| 2
| 43,938
|
"Correct Solution:
```
def solve():
w, h, v, t, x, y, p, q = map(int, input().split())
def count(a, b):
res = 0
C = v*t
ky = 0
while 1:
B = b + 2*h*ky
D = C**2 - (B - y)**2
if D < 0:
break
SQ = D**.5 + 1e-7
k0 = int((x - a - SQ) // (2*w))
k1 = int((x - a + SQ) // (2*w))
res += max(k1 - k0, 0)
ky += 1
ky = -1
while 1:
B = b + 2*h*ky
D = C**2 - (B - y)**2
if D < 0:
break
SQ = D**.5 + 1e-7
k0 = int((x - a - SQ) // (2*w))
k1 = int((x - a + SQ) // (2*w))
res += max(k1 - k0, 0)
ky -= 1
return res
ans = 0
for a in [p, 2*w-p]:
for b in [q, 2*h-q]:
ans += count(a, b)
print(ans)
solve()
```
|
output
| 1
| 21,969
| 2
| 43,939
|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
|
instruction
| 0
| 22,245
| 2
| 44,490
|
Tags: binary search, math
Correct Solution:
```
for _ in range(int(input())):
lst = list(map(int, input().split()))
if ( sum(lst) % 9 ) or (sum(lst) // 9 > min(lst)):
print('no')
else:
print('yes')
```
|
output
| 1
| 22,245
| 2
| 44,491
|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
|
instruction
| 0
| 22,246
| 2
| 44,492
|
Tags: binary search, math
Correct Solution:
```
t = int(input())
while t > 0:
a,b,c = map(int, input().split())
if (a + b + c) % 9 != 0:
print("NO")
else:
print("YES" if min(a,b,c) >= (a + b + c) // 9 else "NO")
t -= 1
```
|
output
| 1
| 22,246
| 2
| 44,493
|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
|
instruction
| 0
| 22,247
| 2
| 44,494
|
Tags: binary search, math
Correct Solution:
```
t = int(input())
for _ in range(t):
a, b, c = map(int, input().split())
s = a + b + c
if s % 9 == 0:
mini = s // 9
if a >= mini and b >= mini and c >= mini:
print("YES")
continue
print("NO")
```
|
output
| 1
| 22,247
| 2
| 44,495
|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
|
instruction
| 0
| 22,248
| 2
| 44,496
|
Tags: binary search, math
Correct Solution:
```
import sys
input=sys.stdin.readline
from collections import defaultdict as dc
from collections import Counter
from bisect import bisect_right, bisect_left
import math
from operator import itemgetter
from heapq import heapify, heappop, heappush
from queue import PriorityQueue as pq
for _ in range(int(input())):
a,b,c=map(int,input().split())
#print((a+b+c)%7)
if (a+b+c)%9==0 and min(a,min(b,c))>=(a+b+c)//9:
print("YES")
else:
print("NO")
```
|
output
| 1
| 22,248
| 2
| 44,497
|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
|
instruction
| 0
| 22,249
| 2
| 44,498
|
Tags: binary search, math
Correct Solution:
```
tests = int(input())
#a = []
for i in range(tests):
linha = list(map(int,input().split()))
soma = 0
acabo = 0
for j in linha:
soma += j
menos = round(soma/9)
if menos > soma/9:
menos -= 1
menos = max(0,menos-1)
for j in range(3):
if linha[j] <= menos and acabo == 0:
acabo = 1
print("NO")
#a.append("NO")
if soma % 9 == 0 and acabo == 0:
print("YES")
#a.append("YES")
elif acabo == 0:
print("NO")
#a.append("NO")
#print(a)
#52953008 41784347 28668647 YES
#36581297 36848381 77832701 YES
#3 15 9 YES?
#2 8 8 YES
#1 1 7 YES
```
|
output
| 1
| 22,249
| 2
| 44,499
|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
|
instruction
| 0
| 22,250
| 2
| 44,500
|
Tags: binary search, math
Correct Solution:
```
for _ in range(int(input())):
a, b, c = map(int, input().split())
t = a+b+c
if t%9 == 0 and min(a, b, c) >= t//9:
print("YES")
else :
print("NO")
```
|
output
| 1
| 22,250
| 2
| 44,501
|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
|
instruction
| 0
| 22,251
| 2
| 44,502
|
Tags: binary search, math
Correct Solution:
```
for _ in range(int(input())):a=list(map(int,input().split()));print('NO'if sum(a)%9 or min(a)<sum(a)//9 else'YES')
```
|
output
| 1
| 22,251
| 2
| 44,503
|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
|
instruction
| 0
| 22,252
| 2
| 44,504
|
Tags: binary search, math
Correct Solution:
```
# Bismillahir Rahmanir Rahim
# @UTH0R :- A |-| |\| A F
from functools import reduce
for test in range(0, int(input())):
a , b, c= list(map(int, input().split()));
if (a + b + c) % 9:
print('NO')
else :
print('YES' if min(a,b,c) >= (a+b+c)//9 else 'NO')
```
|
output
| 1
| 22,252
| 2
| 44,505
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
Submitted Solution:
```
num = int(input())
lst = []
for i in range(num):
ints = input()
ints = ints.split()
for k in range(3):
ints[k] = int(ints[k])
summ = sum(ints)
if summ%9 == 0:
a = summ/9
for k in range(3):
if ints[k]-a < 0:
lst.append("NO")
break
if k ==2:
lst.append("YES")
else:
lst.append("NO")
for i in range(num):
print(lst[i])
```
|
instruction
| 0
| 22,253
| 2
| 44,506
|
Yes
|
output
| 1
| 22,253
| 2
| 44,507
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
Submitted Solution:
```
tc = int(input())
for _ in range(tc):
a,b,c = map(int,input().split())
tmp = (a+b+c) // 9
if tmp <= min(a,b,c) and (a+b+c) % 9 == 0:
print("YES")
else:
print("NO")
```
|
instruction
| 0
| 22,254
| 2
| 44,508
|
Yes
|
output
| 1
| 22,254
| 2
| 44,509
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
Submitted Solution:
```
t = int(input())
for _ in range(t):
a,b,c = map(int,input().split(' '))
s = a+b+c
d = s // 9
if s > 8 and s % 9 == 0:
if a >= d and b >= d and c >= d:
print('YES')
else:
print('NO')
else:
print('NO')
```
|
instruction
| 0
| 22,255
| 2
| 44,510
|
Yes
|
output
| 1
| 22,255
| 2
| 44,511
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
Submitted Solution:
```
from sys import stdin,stdout
q=int(input())
for k in range(q):
x,y,z=list(map(int,stdin.readline().split()))
d=x+y+z
rem=(x+y+z)//9
if (x+y+z)%9==0 and x>=rem and y>=rem and z>=rem:
print("Yes")
else:
print("No")
```
|
instruction
| 0
| 22,256
| 2
| 44,512
|
Yes
|
output
| 1
| 22,256
| 2
| 44,513
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
Submitted Solution:
```
for _ in range(int(input())):
a,b,c=map(int,input().split())
if (a+b+c)<7:
print('NO')
continue
if a==0 or b==0 or c==0:
print('NO')
continue
if ((a+b+c)-2)%7==0 and min(a,b,c)>(a+b+c-2)//7:
print('YES')
else:
print('NO')
```
|
instruction
| 0
| 22,257
| 2
| 44,514
|
No
|
output
| 1
| 22,257
| 2
| 44,515
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
Submitted Solution:
```
def cases():
a,b,c=[int(x) for x in input().split()]
if (a+b+c) ==9:
print("YES")
return
print("NO")
# shots=0
# if(a+b+c<7):
# print("NO")
# return
# while(1):
# if(shots==7):
# break
# if(a>1):
# a-=1
# elif(b>1):
# b-=1
# elif(c>1):
# c-=1
# shots+=1
# #print("ans=",a,b,c)
# if a==1 and b==1 and c==1:
# print("YES")
# else:
# print("NO")
t = 1
t = int(input())
for pop in range(t):
cases()
```
|
instruction
| 0
| 22,258
| 2
| 44,516
|
No
|
output
| 1
| 22,258
| 2
| 44,517
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
Submitted Solution:
```
def cases():
a,b,c=[int(x) for x in input().split()]
s=a+b+c
if(a<7 and b<7 and c<7 and s>7):
print("YES")
else:
print("NO")
t = 1
t = int(input())
for pop in range(t):
cases()
```
|
instruction
| 0
| 22,259
| 2
| 44,518
|
No
|
output
| 1
| 22,259
| 2
| 44,519
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.
To kill the monsters, you can use a cannon that, when fired, deals 1 damage to the selected monster. Every 7-th (i. e. shots with numbers 7, 14, 21 etc.) cannon shot is enhanced and deals 1 damage to all monsters, not just one of them. If some monster's current amount of health points is 0, it can't be targeted by a regular shot and does not receive damage from an enhanced shot.
You want to pass the dungeon beautifully, i. e., kill all the monsters with the same enhanced shot (i. e. after some enhanced shot, the health points of each of the monsters should become equal to 0 for the first time). Each shot must hit a monster, i. e. each shot deals damage to at least one monster.
Input
The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
Each test case consists of a single line that contains three integers a, b and c (1 ≤ a, b, c ≤ 10^8) — the number of health points each monster has.
Output
For each test case, print YES if you can kill all the monsters with the same enhanced shot. Otherwise, print NO. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).
Example
Input
3
3 2 4
1 1 1
10 1 7
Output
YES
NO
NO
Note
In the first test case, you can do as follows: 1-th shot to the first monster, 2-th shot to the second monster, 3-th shot to the third monster, 4-th shot to the first monster, 5-th shot to the third monster, 6-th shot to the third monster, and 7-th enhanced shot will kill all the monsters.
In the second test case, you can't kill monsters with the same enhanced shot, because the total number of health points of monsters is 3, and you will kill them in the first 3 shots.
Submitted Solution:
```
n = int(input())
for _ in range(n):
a, b, c = map(int, input().split())
s = sorted([a, b, c])
message = 'YES' if (a + b + c) % 9 == 0 and s[0] * 7 <= s[1] + s[2] else 'NO'
print(message)
```
|
instruction
| 0
| 22,260
| 2
| 44,520
|
No
|
output
| 1
| 22,260
| 2
| 44,521
|
Provide tags and a correct Python 3 solution for this coding contest problem.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
|
instruction
| 0
| 22,261
| 2
| 44,522
|
Tags: constructive algorithms, implementation, math
Correct Solution:
```
k = int(input())
l = int(input())
m = int(input())
n = int(input())
d = int(input())
print(len(list(set(list([i for i in range(1,d+1)if i%l == 0 or i%k == 0 or i%m == 0 or i%n == 0])))))
```
|
output
| 1
| 22,261
| 2
| 44,523
|
Provide tags and a correct Python 3 solution for this coding contest problem.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
|
instruction
| 0
| 22,262
| 2
| 44,524
|
Tags: constructive algorithms, implementation, math
Correct Solution:
```
k = int(input())
l = int(input())
m = int(input())
n = int(input())
d = int(input())
count = 0
i = 1
while i <= d:
if i % k == 0 or i % l == 0 or i % m == 0 or i % n ==0:
count += 1
i += 1
print(count)
```
|
output
| 1
| 22,262
| 2
| 44,525
|
Provide tags and a correct Python 3 solution for this coding contest problem.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
|
instruction
| 0
| 22,263
| 2
| 44,526
|
Tags: constructive algorithms, implementation, math
Correct Solution:
```
a=int(input())
b=int(input())
c=int(input())
d=int(input())
n=int(input())
ans=0
for i in range(1,n+1):
if i%a==0 or i%b==0 or i%c==0 or i%d==0:
ans+=1
print(ans)
```
|
output
| 1
| 22,263
| 2
| 44,527
|
Provide tags and a correct Python 3 solution for this coding contest problem.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
|
instruction
| 0
| 22,264
| 2
| 44,528
|
Tags: constructive algorithms, implementation, math
Correct Solution:
```
def is_dividable(n, nums) :
for num in nums :
if(n % num == 0) : return True
return False
j=0
Nums = []
while(j < 4) :
Nums.append(int(input()))
j+=1
dragons = int(input())
punched_dragons = 0
i = 1
while(i <= dragons) :
if(is_dividable(i, Nums)):
punched_dragons += 1
i += 1
print(punched_dragons)
```
|
output
| 1
| 22,264
| 2
| 44,529
|
Provide tags and a correct Python 3 solution for this coding contest problem.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
|
instruction
| 0
| 22,265
| 2
| 44,530
|
Tags: constructive algorithms, implementation, math
Correct Solution:
```
k = int(input())
l = int(input())
m = int(input())
n = int(input())
d = int(input())
ct = 0
for i in range(1, d+1):
if i%k and i%l and i%m and i%n:
ct += 1
print(d-ct)
```
|
output
| 1
| 22,265
| 2
| 44,531
|
Provide tags and a correct Python 3 solution for this coding contest problem.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
|
instruction
| 0
| 22,266
| 2
| 44,532
|
Tags: constructive algorithms, implementation, math
Correct Solution:
```
k = int(input());l = int(input());m = int(input());n = int(input());d = int(input());a = list(range(1,d+1))
k_set = [x for x in a if x % k == 0];l_set = [x for x in a if x % l == 0];m_set = [x for x in a if x % m == 0];n_set = [x for x in a if x % n == 0]
result = set(k_set+l_set+m_set+n_set)
print(len(result))
```
|
output
| 1
| 22,266
| 2
| 44,533
|
Provide tags and a correct Python 3 solution for this coding contest problem.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
|
instruction
| 0
| 22,267
| 2
| 44,534
|
Tags: constructive algorithms, implementation, math
Correct Solution:
```
k = int(input())
l = int(input())
m = int(input())
n = int(input())
d = int(input())
q = 0
for i in range(1, d+1):
if i%k==0 or i%l==0 or i%m==0 or i%n==0:
q += 1
print(q)
```
|
output
| 1
| 22,267
| 2
| 44,535
|
Provide tags and a correct Python 3 solution for this coding contest problem.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
|
instruction
| 0
| 22,268
| 2
| 44,536
|
Tags: constructive algorithms, implementation, math
Correct Solution:
```
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
z=0
for i in range(1,e+1):
if(i%a!=0 and i%b!=0 and i%c!=0 and i%d!=0 ):
z=z+1
print(e-z)
```
|
output
| 1
| 22,268
| 2
| 44,537
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
Submitted Solution:
```
k=int(input())
l=int(input())
m=int(input())
n=int(input())
d=int(input())
z=0
for i in range(1,d+1):
if i%k!=0 and i%l!=0 and i%m!=0 and i%n!=0:
z+=1
print(d-z)
```
|
instruction
| 0
| 22,269
| 2
| 44,538
|
Yes
|
output
| 1
| 22,269
| 2
| 44,539
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
Submitted Solution:
```
k=int(input())
l=int(input())
m=int(input())
n=int(input())
d=int(input())
l_=[]
for i in range(d):
l_.append(1)
for i in range(k-1,d,k) :
l_[i]=0
for i in range(l-1,d,l) :
l_[i]=0
for i in range(m-1,d,m) :
l_[i]=0
for i in range(n-1,d,n) :
l_[i]=0
ans=0
for i in l_:
if i==0:
ans+=1
print(ans)
```
|
instruction
| 0
| 22,270
| 2
| 44,540
|
Yes
|
output
| 1
| 22,270
| 2
| 44,541
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
Submitted Solution:
```
def cure(k,l,m,n,d):
count=0
for i in range(1,d+1):
if i%k==0 or i%l==0 or i%m==0 or i%n==0:
count+=1
return count
k = int(input())
l = int(input())
m = int(input())
n = int(input())
d = int(input())
print(cure(k,l,m,n,d))
```
|
instruction
| 0
| 22,271
| 2
| 44,542
|
Yes
|
output
| 1
| 22,271
| 2
| 44,543
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
Submitted Solution:
```
k=int (input())
l=int (input())
m=int (input())
n=int (input())
dragons=int (input())
damagedDragons = 0
for i in range (1, dragons+1):
if i%k == 0 or i%l == 0 or i%m == 0 or i%n == 0:
damagedDragons = damagedDragons + 1
print(damagedDragons)
```
|
instruction
| 0
| 22,272
| 2
| 44,544
|
Yes
|
output
| 1
| 22,272
| 2
| 44,545
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
Submitted Solution:
```
klmn = [int(input()), int(input()), int(input()), int(input())]
d = int(input())
res = set()
for i in klmn:
dd = 0
while dd < d:
dd += i
res.add(dd)
print(len(res))
```
|
instruction
| 0
| 22,273
| 2
| 44,546
|
No
|
output
| 1
| 22,273
| 2
| 44,547
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
Submitted Solution:
```
# https://codeforces.com/problemset/problem/148/A
k = int(input())
l = int(input())
m = int(input())
n = int(input())
d = int(input())
count = 0
for i in range(1, d+1):
if i%k%n==0 or i%l%n==0 or i%m%n==0 or i%n==0:
count += 1
print(count)
```
|
instruction
| 0
| 22,274
| 2
| 44,548
|
No
|
output
| 1
| 22,274
| 2
| 44,549
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
Submitted Solution:
```
k=int(input())
l=int(input())
m=int(input())
n=int(input())
d=int(input())
s=0
for i in range(0,d):
if i%k==0:
s+=1
elif i%l==0:
s+=1
elif i%m==0:
s+=1
elif i%n==0:
s+=1
print(s)
```
|
instruction
| 0
| 22,275
| 2
| 44,550
|
No
|
output
| 1
| 22,275
| 2
| 44,551
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
«One dragon. Two dragon. Three dragon», — the princess was counting. She had trouble falling asleep, and she got bored of counting lambs when she was nine.
However, just counting dragons was boring as well, so she entertained herself at best she could. Tonight she imagined that all dragons were here to steal her, and she was fighting them off. Every k-th dragon got punched in the face with a frying pan. Every l-th dragon got his tail shut into the balcony door. Every m-th dragon got his paws trampled with sharp heels. Finally, she threatened every n-th dragon to call her mom, and he withdrew in panic.
How many imaginary dragons suffered moral or physical damage tonight, if the princess counted a total of d dragons?
Input
Input data contains integer numbers k, l, m, n and d, each number in a separate line (1 ≤ k, l, m, n ≤ 10, 1 ≤ d ≤ 105).
Output
Output the number of damaged dragons.
Examples
Input
1
2
3
4
12
Output
12
Input
2
3
4
5
24
Output
17
Note
In the first case every first dragon got punched with a frying pan. Some of the dragons suffered from other reasons as well, but the pan alone would be enough.
In the second case dragons 1, 7, 11, 13, 17, 19 and 23 escaped unharmed.
Submitted Solution:
```
k=int(input())
l=int(input())
m=int(input())
n=int(input())
d=int(input())
answer=d//k+d//l+d//m+d//n
answer-=d//(k*l)+d//(l*m)+d//(k*m)+d//(k*n)+d//(l*n)+d//(m*n)
answer+=d//(k*l*n)+d//(k*m*n)+d//(l*m*n)+d//(k*l*m)
answer-=d//(k*l*m*n)
print(answer)
```
|
instruction
| 0
| 22,276
| 2
| 44,552
|
No
|
output
| 1
| 22,276
| 2
| 44,553
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
You want to get a treasure on the Nth basement floor of a dungeon. First, you are on the 1st basement floor and your health is H (H is a positive integer). Go downstairs. Sometimes physical strength is consumed. The physical strength consumed when descending to the lower floor on each floor is known in advance. On the other hand, there is one recovery fountain on each floor, and you can recover with each use of the fountain. Each has its own health. You will die if your health drops below 0. Also, your health will never be higher than H. You can use the Recovery Fountain as many times as you like, but it will take time to recover. Because of this, you want to use the fountain as few times as possible.
N, H, when given the health consumed when descending downstairs on each floor, and the health to recover when using the recovery fountain once on each floor, underground N without reducing health to 0 or less. Create a program to find the minimum number of times the fountain has been used to reach the floor.
Also, once you go downstairs, you can't go upstairs until you get the treasure.
input
The input consists of N lines. The first line of the input contains two integers N, H (2 ≤ N ≤ 100000 = 105, 1 ≤ H ≤ 10000000 = 107) separated by blanks. N is underground. It means that there is a treasure on the Nth floor, and H is the initial physical strength (physical strength at the stage of arriving at the basement 1st floor of the dungeon) and the maximum physical strength (recovery does not make the physical strength larger than H). ).
In the following N − 1 line, two integers are written separated by a space. For the integers di and hi on the 1 + i line (1 ≤ i ≤ N − 1), di is from the basement i floor to the basement i. + The physical strength consumed when descending to the 1st floor, hi represents the physical strength to recover when using the spring once in the basement i floor (0 ≤ di <H, 1 ≤ hi <H).
There is a way to reach the Nth basement floor in any scoring data. Of the scoring data, 10% of the points satisfy N ≤ 1000 and H ≤ 1000. For 30% of the points, N Satisfy ≤ 1000. For 50% of the points, the minimum number of times the fountain is used does not exceed 106.
Example
Input
10 10
4 2
2 5
6 1
7 3
6 4
9 6
0 8
4 1
9 4
Output
10
Submitted Solution:
```
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0553
"""
import sys
from sys import stdin
from heapq import heappop, heappush
input = stdin.readline
def main(args):
N, H = map(int, input().split())
MAX_H = H
costs = []
wells = []
for _ in range(N - 1):
di, hi = map(int, input().split())
costs.append(di)
wells.append(hi)
costs.append(0)
wells.append(0)
ans = 0
floor = 1
repeat = True
while floor < N:
# ?£????????????§N????????§??°?????§??????????????§????????????
pq = []
while H > 0:
deficit = MAX_H - H
if deficit != 0:
heappush(pq, [-1 * min(MAX_H - H, wells[floor - 1]), wells[floor - 1], floor, H])
c = costs[floor - 1]
H -= c
if floor >= N or H < 1:
break
floor += 1
if H > 0:
break
# ??°?????§??????????????°??????????????§??????????????§??????????????????????????°?????§????????????????????????
# ????????§???????????? min(MAX_H - H, ???????????????) ????????????
# ?????????????????¨??????????¬???????????????? MAX_H - (H + ???????????????) ??¨?????????
replenish, replenish_orig, f, orig_H = heappop(pq)
if replenish == -replenish_orig:
if H == 0:
rep = 1
else:
rep = -H // replenish_orig
if H % replenish_orig != 0:
rep += 1
H = min(orig_H + (replenish_orig * rep), MAX_H)
ans += rep
else:
H = min(orig_H - replenish, MAX_H)
ans += 1
# ???????????¨???????????¨????????????H?????????????????§????????????????????¢????????£????????¨???????????¢?´¢???????????´??????
floor = f
print(ans)
if __name__ == '__main__':
main(sys.argv[1:])
```
|
instruction
| 0
| 22,789
| 2
| 45,578
|
No
|
output
| 1
| 22,789
| 2
| 45,579
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.