message stringlengths 2 20.2k | message_type stringclasses 2 values | message_id int64 0 1 | conversation_id int64 757 108k | cluster float64 4 4 | __index_level_0__ int64 1.51k 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We get more and more news about DDoS-attacks of popular websites.
Arseny is an admin and he thinks that a website is under a DDoS-attack if the total number of requests for a some period of time exceeds 100 ⋅ t, where t — the number of seconds in this time segment.
Arseny knows statistics on the number of requests per second since the server is booted. He knows the sequence r_1, r_2, ..., r_n, where r_i — the number of requests in the i-th second after boot.
Determine the length of the longest continuous period of time, which Arseny considers to be a DDoS-attack. A seeking time period should not go beyond the boundaries of the segment [1, n].
Input
The first line contains n (1 ≤ n ≤ 5000) — number of seconds since server has been booted. The second line contains sequence of integers r_1, r_2, ..., r_n (0 ≤ r_i ≤ 5000), r_i — number of requests in the i-th second.
Output
Print the only integer number — the length of the longest time period which is considered to be a DDoS-attack by Arseny. If it doesn't exist print 0.
Examples
Input
5
100 200 1 1 1
Output
3
Input
5
1 2 3 4 5
Output
0
Input
2
101 99
Output
1
Submitted Solution:
```
n = int(input())
a = list(map(int,input().split()))
k = 0
for i in a:
if i >= 100:
k += 1
print(k)
``` | instruction | 0 | 101,210 | 4 | 202,420 |
No | output | 1 | 101,210 | 4 | 202,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We get more and more news about DDoS-attacks of popular websites.
Arseny is an admin and he thinks that a website is under a DDoS-attack if the total number of requests for a some period of time exceeds 100 ⋅ t, where t — the number of seconds in this time segment.
Arseny knows statistics on the number of requests per second since the server is booted. He knows the sequence r_1, r_2, ..., r_n, where r_i — the number of requests in the i-th second after boot.
Determine the length of the longest continuous period of time, which Arseny considers to be a DDoS-attack. A seeking time period should not go beyond the boundaries of the segment [1, n].
Input
The first line contains n (1 ≤ n ≤ 5000) — number of seconds since server has been booted. The second line contains sequence of integers r_1, r_2, ..., r_n (0 ≤ r_i ≤ 5000), r_i — number of requests in the i-th second.
Output
Print the only integer number — the length of the longest time period which is considered to be a DDoS-attack by Arseny. If it doesn't exist print 0.
Examples
Input
5
100 200 1 1 1
Output
3
Input
5
1 2 3 4 5
Output
0
Input
2
101 99
Output
1
Submitted Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Thu Oct 18 15:50:54 2018
B.DDos
@author: rafael
"""
n = int(input())
req = [int(i) for i in input().split()]
maxi = 0
LIMIT = 100
start = None
end = None
for i in range(n):
if start is None:
if req[i] >= LIMIT: start = i
else:
if req[i] < LIMIT:
end = i
if i > 1: trial = end - start + 1
else: trial = end - start
if trial > maxi: maxi = trial
start,end = None,None
print(maxi)
``` | instruction | 0 | 101,211 | 4 | 202,422 |
No | output | 1 | 101,211 | 4 | 202,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We get more and more news about DDoS-attacks of popular websites.
Arseny is an admin and he thinks that a website is under a DDoS-attack if the total number of requests for a some period of time exceeds 100 ⋅ t, where t — the number of seconds in this time segment.
Arseny knows statistics on the number of requests per second since the server is booted. He knows the sequence r_1, r_2, ..., r_n, where r_i — the number of requests in the i-th second after boot.
Determine the length of the longest continuous period of time, which Arseny considers to be a DDoS-attack. A seeking time period should not go beyond the boundaries of the segment [1, n].
Input
The first line contains n (1 ≤ n ≤ 5000) — number of seconds since server has been booted. The second line contains sequence of integers r_1, r_2, ..., r_n (0 ≤ r_i ≤ 5000), r_i — number of requests in the i-th second.
Output
Print the only integer number — the length of the longest time period which is considered to be a DDoS-attack by Arseny. If it doesn't exist print 0.
Examples
Input
5
100 200 1 1 1
Output
3
Input
5
1 2 3 4 5
Output
0
Input
2
101 99
Output
1
Submitted Solution:
```
T = int(input())
R = [int(i) for i in input().split()]
SUM = 0
ANSW = 0
CIRK = 0
for i in range(1,T+1):
SUM += R[i-1]
CIRK +=1
if SUM > 100*i:
ANSW=CIRK
print(ANSW)
``` | instruction | 0 | 101,212 | 4 | 202,424 |
No | output | 1 | 101,212 | 4 | 202,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems. | instruction | 0 | 102,550 | 4 | 205,100 |
Tags: binary search, brute force, implementation, math
Correct Solution:
```
n,k = map(int,input().split())
t = 0
a = 0
for i in range(1,n+1):
t += (5*i)
if t+k > 240:
break
a = i
print(a)
``` | output | 1 | 102,550 | 4 | 205,101 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems. | instruction | 0 | 102,551 | 4 | 205,102 |
Tags: binary search, brute force, implementation, math
Correct Solution:
```
n,k=map(int,input().split())
k=240-k
for i in range(n):
k-=(i+1)*5
if k<0:
print(i)
break
else:
print(n)
``` | output | 1 | 102,551 | 4 | 205,103 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems. | instruction | 0 | 102,552 | 4 | 205,104 |
Tags: binary search, brute force, implementation, math
Correct Solution:
```
def sumAP(a):
return a/2*(10+(a-1)*5)
l = input()
l = [int(i) for i in l.split() if i.isdigit()]
i = 0
while i <= l[0] :
if sumAP(i+1)+l[1] > 240 :
break
i += 1
if i>l[0] :
print(l[0])
else :
print(i)
``` | output | 1 | 102,552 | 4 | 205,105 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems. | instruction | 0 | 102,553 | 4 | 205,106 |
Tags: binary search, brute force, implementation, math
Correct Solution:
```
n, k = map(int, input().split())
t = 4 * 60 - k
for i in range(n+1):
t -= 5 * (i + 1)
if t < 0:
break
print(i)
``` | output | 1 | 102,553 | 4 | 205,107 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems. | instruction | 0 | 102,554 | 4 | 205,108 |
Tags: binary search, brute force, implementation, math
Correct Solution:
```
n,k = map(int, input().split())
time_limit, time, count = 240, 0, 0
while time + (count+1)*5 <= time_limit - k and count != n:
count += 1
time += count*5
print(count)
``` | output | 1 | 102,554 | 4 | 205,109 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems. | instruction | 0 | 102,555 | 4 | 205,110 |
Tags: binary search, brute force, implementation, math
Correct Solution:
```
a,b = map(int,input().split())
count=0
c = 240-b
d=0
for i in range(1,a+1):
d = d+(i*5)
if d <= c:
count += 1
print(count)
``` | output | 1 | 102,555 | 4 | 205,111 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems. | instruction | 0 | 102,556 | 4 | 205,112 |
Tags: binary search, brute force, implementation, math
Correct Solution:
```
n,k = map(int, input().split())
t = 240 - k
for i in range(0,n):
t = t - (5 * (i+1))
if(t<0):
a = i
break
if(t>=0):
a = i+1
print(a)
``` | output | 1 | 102,556 | 4 | 205,113 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Limak is going to participate in a contest on the last day of the 2016. The contest will start at 20:00 and will last four hours, exactly until midnight. There will be n problems, sorted by difficulty, i.e. problem 1 is the easiest and problem n is the hardest. Limak knows it will take him 5·i minutes to solve the i-th problem.
Limak's friends organize a New Year's Eve party and Limak wants to be there at midnight or earlier. He needs k minutes to get there from his house, where he will participate in the contest first.
How many problems can Limak solve if he wants to make it to the party?
Input
The only line of the input contains two integers n and k (1 ≤ n ≤ 10, 1 ≤ k ≤ 240) — the number of the problems in the contest and the number of minutes Limak needs to get to the party from his house.
Output
Print one integer, denoting the maximum possible number of problems Limak can solve so that he could get to the party at midnight or earlier.
Examples
Input
3 222
Output
2
Input
4 190
Output
4
Input
7 1
Output
7
Note
In the first sample, there are 3 problems and Limak needs 222 minutes to get to the party. The three problems require 5, 10 and 15 minutes respectively. Limak can spend 5 + 10 = 15 minutes to solve first two problems. Then, at 20:15 he can leave his house to get to the party at 23:57 (after 222 minutes). In this scenario Limak would solve 2 problems. He doesn't have enough time to solve 3 problems so the answer is 2.
In the second sample, Limak can solve all 4 problems in 5 + 10 + 15 + 20 = 50 minutes. At 20:50 he will leave the house and go to the party. He will get there exactly at midnight.
In the third sample, Limak needs only 1 minute to get to the party. He has enough time to solve all 7 problems. | instruction | 0 | 102,557 | 4 | 205,114 |
Tags: binary search, brute force, implementation, math
Correct Solution:
```
n,k=input().split()
n=int(n)
k=int(k)
t=240-k
co=0
t1=0
for i in range(1,n+1):
t1+=5*i
if t1<=t:
co+=1
else:
break
print(co)
``` | output | 1 | 102,557 | 4 | 205,115 |
Provide a correct Python 3 solution for this coding contest problem.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes | instruction | 0 | 102,736 | 4 | 205,472 |
"Correct Solution:
```
N=int(input())
AB=[list(map(int,input().split())) for _ in range(N)]
AB.sort(key=lambda x:x[1])
SUM_=0
for i in range(N):
SUM_+=AB[i][0]
if SUM_>AB[i][1]:
print('No')
exit()
print('Yes')
``` | output | 1 | 102,736 | 4 | 205,473 |
Provide a correct Python 3 solution for this coding contest problem.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes | instruction | 0 | 102,737 | 4 | 205,474 |
"Correct Solution:
```
N = int(input())
AB = [list(map(int,input().split())) for _ in range(N)]
AB = sorted(AB, key=lambda x:x[1])
t = 0
for i in range(N):
t += AB[i][0]
if t > AB[i][1]:
print("No")
exit()
print("Yes")
``` | output | 1 | 102,737 | 4 | 205,475 |
Provide a correct Python 3 solution for this coding contest problem.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes | instruction | 0 | 102,738 | 4 | 205,476 |
"Correct Solution:
```
n=int(input())
ab=[tuple(map(int,input().split())) for _ in range(n)]
ab=sorted(ab,key=lambda x:x[1])
ans=0
for i,j in ab:
ans+=i
if ans>j:
print('No')
exit()
print('Yes')
``` | output | 1 | 102,738 | 4 | 205,477 |
Provide a correct Python 3 solution for this coding contest problem.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes | instruction | 0 | 102,739 | 4 | 205,478 |
"Correct Solution:
```
n,t=int(input()),0
AB=[list(map(int,input().split())) for _ in range(n)]
AB.sort(key=lambda X: X[1])
for ab in AB:
t += ab[0]
if t > ab[1]:
print("No")
exit()
print("Yes")
``` | output | 1 | 102,739 | 4 | 205,479 |
Provide a correct Python 3 solution for this coding contest problem.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes | instruction | 0 | 102,740 | 4 | 205,480 |
"Correct Solution:
```
N = int(input())
A = [list(map(int,input().split())) for i in range(N)]
A.sort(key = lambda x: x[1])
su = 0
for i in A:
su += i[0]
if su > i[1]:
print("No")
exit()
print("Yes")
``` | output | 1 | 102,740 | 4 | 205,481 |
Provide a correct Python 3 solution for this coding contest problem.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes | instruction | 0 | 102,741 | 4 | 205,482 |
"Correct Solution:
```
#40 ABC131D
n=int(input())
ab=[list(map(int,input().split())) for _ in range(n)]
ab=sorted(ab,key=lambda x:x[1])
j=True
x=0
for a,b in ab:
x+=a
if x>b:
j=False
break
print("Yes" if j else "No")
``` | output | 1 | 102,741 | 4 | 205,483 |
Provide a correct Python 3 solution for this coding contest problem.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes | instruction | 0 | 102,742 | 4 | 205,484 |
"Correct Solution:
```
N = int(input())
arr = [list(map(int,input().split())) for _ in range(N)]
arr.sort(key=lambda x: x[1])
cnt = 0
for a,b in arr:
cnt += a
if cnt > b:
flag = "No"
break
flag = 'Yes'
print(flag)
``` | output | 1 | 102,742 | 4 | 205,485 |
Provide a correct Python 3 solution for this coding contest problem.
Kizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.
Let the current time be time 0. Kizahashi has N jobs numbered 1 to N.
It takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.
Kizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.
Can Kizahashi complete all the jobs in time? If he can, print `Yes`; if he cannot, print `No`.
Constraints
* All values in input are integers.
* 1 \leq N \leq 2 \times 10^5
* 1 \leq A_i, B_i \leq 10^9 (1 \leq i \leq N)
Input
Input is given from Standard Input in the following format:
N
A_1 B_1
.
.
.
A_N B_N
Output
If Kizahashi can complete all the jobs in time, print `Yes`; if he cannot, print `No`.
Examples
Input
5
2 4
1 9
1 8
4 9
3 12
Output
Yes
Input
3
334 1000
334 1000
334 1000
Output
No
Input
30
384 8895
1725 9791
170 1024
4 11105
2 6
578 1815
702 3352
143 5141
1420 6980
24 1602
849 999
76 7586
85 5570
444 4991
719 11090
470 10708
1137 4547
455 9003
110 9901
15 8578
368 3692
104 1286
3 4
366 12143
7 6649
610 2374
152 7324
4 7042
292 11386
334 5720
Output
Yes | instruction | 0 | 102,743 | 4 | 205,486 |
"Correct Solution:
```
N = int(input())
AB = [list(map(int, input().split())) for i in range(N)]
AB.sort(key=lambda x: x[1])
time = 0
for a, b in AB:
time += a
if time > b:
print('No')
quit()
print('Yes')
``` | output | 1 | 102,743 | 4 | 205,487 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2 | instruction | 0 | 102,768 | 4 | 205,536 |
"Correct Solution:
```
S = input()
K = int(input())
for s in S[:K]:
if s != '1':
print(s)
break
else:
print(1)
``` | output | 1 | 102,768 | 4 | 205,537 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2 | instruction | 0 | 102,769 | 4 | 205,538 |
"Correct Solution:
```
S = input()
K = int(input())
i = 0
while i < K - 1 and S[i] == '1':
i += 1
print(S[i])
``` | output | 1 | 102,769 | 4 | 205,539 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2 | instruction | 0 | 102,770 | 4 | 205,540 |
"Correct Solution:
```
s = input()
k = int(input())
ans = '1'
for c in s[:k]:
if c != '1':
ans = c
break
print(ans)
``` | output | 1 | 102,770 | 4 | 205,541 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2 | instruction | 0 | 102,771 | 4 | 205,542 |
"Correct Solution:
```
n = input()
k = int(input())
ans = 1
for i in range(k):
if n[i] != "1":
ans = n[i]
break
print(ans)
``` | output | 1 | 102,771 | 4 | 205,543 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2 | instruction | 0 | 102,772 | 4 | 205,544 |
"Correct Solution:
```
S=input()
K=int(input())
a=1
for i in range(min(len(S),K)):
if S[i]!='1':
a=int(S[i])
break
print(a)
``` | output | 1 | 102,772 | 4 | 205,545 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2 | instruction | 0 | 102,773 | 4 | 205,546 |
"Correct Solution:
```
s,k=open(0)
for i,c in enumerate(s):
if c=="1":
if i+1==int(k):break
else:break
print(c)
``` | output | 1 | 102,773 | 4 | 205,547 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2 | instruction | 0 | 102,774 | 4 | 205,548 |
"Correct Solution:
```
S=input()
K=int(input())
ans=1
for i in range(K):
if (S[i]!='1'):
ans=S[i]
break
print(ans)
``` | output | 1 | 102,774 | 4 | 205,549 |
Provide a correct Python 3 solution for this coding contest problem.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2 | instruction | 0 | 102,775 | 4 | 205,550 |
"Correct Solution:
```
s=input()
k=int(input())
ans="1"
for i in range(k):
if (int(s[i])!=1):
ans=s[i]
break
print(ans)
``` | output | 1 | 102,775 | 4 | 205,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2
Submitted Solution:
```
S = input()
K = int(input())
for i in range(len(S)):
if S[i] != '1':
break
print('1' if K <= i else S[i])
``` | instruction | 0 | 102,776 | 4 | 205,552 |
Yes | output | 1 | 102,776 | 4 | 205,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2
Submitted Solution:
```
S=input()
K=int(input())
F=1
for i in range(K):
if(S[i]!='1'):
print(S[i])
F=0
break
if(F):
print(1)
``` | instruction | 0 | 102,777 | 4 | 205,554 |
Yes | output | 1 | 102,777 | 4 | 205,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2
Submitted Solution:
```
s = input()
k = int(input())
for i in range(k):
if s[i] != "1":
print(s[i])
exit()
print(1)
``` | instruction | 0 | 102,778 | 4 | 205,556 |
Yes | output | 1 | 102,778 | 4 | 205,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2
Submitted Solution:
```
S=input()
K=int(input())
for i in range(K):
if S[i]!='1':
print(S[i])
exit()
print(S[K-1])
``` | instruction | 0 | 102,779 | 4 | 205,558 |
Yes | output | 1 | 102,779 | 4 | 205,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2
Submitted Solution:
```
s = input()
n = int(input())
for i in s:
if i != "1":
print(i)
break
else:
print(1)
``` | instruction | 0 | 102,780 | 4 | 205,560 |
No | output | 1 | 102,780 | 4 | 205,561 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2
Submitted Solution:
```
s = input()
k = int(input())
l = len(s)
first = ''
for i in range(l):
if s[i] != '1':
first = s[i]
pos = i
break
print('1' if k <= pos else first)
``` | instruction | 0 | 102,781 | 4 | 205,562 |
No | output | 1 | 102,781 | 4 | 205,563 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2
Submitted Solution:
```
n = input()
m = int(input())
cnt = 0
for i in range(len(n)):
if n[i] == "1" :
cnt +=1
else:
if cnt >=m:
print(1)
else:
break
for i in range(len(n)):
if n[i] != "1":
print(n[i])
break
``` | instruction | 0 | 102,782 | 4 | 205,564 |
No | output | 1 | 102,782 | 4 | 205,565 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mr. Infinity has a string S consisting of digits from `1` to `9`. Each time the date changes, this string changes as follows:
* Each occurrence of `2` in S is replaced with `22`. Similarly, each `3` becomes `333`, `4` becomes `4444`, `5` becomes `55555`, `6` becomes `666666`, `7` becomes `7777777`, `8` becomes `88888888` and `9` becomes `999999999`. `1` remains as `1`.
For example, if S is `1324`, it becomes `1333224444` the next day, and it becomes `133333333322224444444444444444` the day after next. You are interested in what the string looks like after 5 \times 10^{15} days. What is the K-th character from the left in the string after 5 \times 10^{15} days?
Constraints
* S is a string of length between 1 and 100 (inclusive).
* K is an integer between 1 and 10^{18} (inclusive).
* The length of the string after 5 \times 10^{15} days is at least K.
Input
Input is given from Standard Input in the following format:
S
K
Output
Print the K-th character from the left in Mr. Infinity's string after 5 \times 10^{15} days.
Examples
Input
1214
4
Output
2
Input
3
157
Output
3
Input
299792458
9460730472580800
Output
2
Submitted Solution:
```
S = input()
K = int(input())
if S[0] == "1":
ind = 1
while S[ind] == "1":
ind += 1
print(S[ind])
else:
print(S[0])
``` | instruction | 0 | 102,783 | 4 | 205,566 |
No | output | 1 | 102,783 | 4 | 205,567 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1 | instruction | 0 | 103,459 | 4 | 206,918 |
"Correct Solution:
```
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
if d2 < d1:
print(1)
else:print(0)
``` | output | 1 | 103,459 | 4 | 206,919 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1 | instruction | 0 | 103,460 | 4 | 206,920 |
"Correct Solution:
```
m1,d = map(int,input().split())
m2,d = map(int,input().split())
print(int(m1!=m2))
``` | output | 1 | 103,460 | 4 | 206,921 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1 | instruction | 0 | 103,461 | 4 | 206,922 |
"Correct Solution:
```
A = input().split()
B = input().split()
if A[0] == B[0]:
print("0")
else:
print("1")
``` | output | 1 | 103,461 | 4 | 206,923 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1 | instruction | 0 | 103,462 | 4 | 206,924 |
"Correct Solution:
```
n,m=map(int,input().split())
s,t=map(int,input().split())
print(s-n)
``` | output | 1 | 103,462 | 4 | 206,925 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1 | instruction | 0 | 103,463 | 4 | 206,926 |
"Correct Solution:
```
m,d = map(int,input().split())
mm,dd = map(int,input().split())
if dd == 1:
print(1)
else:
print(0)
``` | output | 1 | 103,463 | 4 | 206,927 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1 | instruction | 0 | 103,464 | 4 | 206,928 |
"Correct Solution:
```
M1,_,M2,_=map(int,open(0).read().split())
print(M2-M1)
``` | output | 1 | 103,464 | 4 | 206,929 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1 | instruction | 0 | 103,465 | 4 | 206,930 |
"Correct Solution:
```
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
print("1" if d2==1 else "0")
``` | output | 1 | 103,465 | 4 | 206,931 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1 | instruction | 0 | 103,466 | 4 | 206,932 |
"Correct Solution:
```
M1 = input()
M2,D2 = map(int,input().split())
if D2 == 1:
print(1)
else :
print(0)
``` | output | 1 | 103,466 | 4 | 206,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1
Submitted Solution:
```
M1,D1=map(int,input().split())
M2,D2=map(int,input().split())
print(0 if M1==M2 else 1)
``` | instruction | 0 | 103,467 | 4 | 206,934 |
Yes | output | 1 | 103,467 | 4 | 206,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1
Submitted Solution:
```
m1,d1=map(int,input().split())
m2,d2=map(int,input().split())
print(int(m1!=m2))
``` | instruction | 0 | 103,468 | 4 | 206,936 |
Yes | output | 1 | 103,468 | 4 | 206,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1
Submitted Solution:
```
input()
_, D2 = input().strip().split()
if D2 == "1":
print("1")
else:
print("0")
``` | instruction | 0 | 103,469 | 4 | 206,938 |
Yes | output | 1 | 103,469 | 4 | 206,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1
Submitted Solution:
```
D1=input()
M2, D2 = [int(n) for n in input().split()]
print(1 if D2==1 else 0)
``` | instruction | 0 | 103,470 | 4 | 206,940 |
Yes | output | 1 | 103,470 | 4 | 206,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1
Submitted Solution:
```
for i in range(2):
a[i], b[i] = map(int, input().split())
if b[1] = 1:
print(1)
else:
print(0)
``` | instruction | 0 | 103,471 | 4 | 206,942 |
No | output | 1 | 103,471 | 4 | 206,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1
Submitted Solution:
```
N = int(input())
S = input()
ans = 0
for i in range(10):
l = 0
while(True):
if(i == int(S[l])):
for j in range(10):
m = l + 1
while(True):
if(j == int(S[m])):
for k in range(10):
for n in range(m+1, N):
if(k == int(S[n])):
ans += 1
break
m += 1
if(m >= N - 1 or j == int(S[m - 1])):
break
l += 1
if(l >= N - 2 or i == int(S[l - 1])):
break
print(ans)
``` | instruction | 0 | 103,472 | 4 | 206,944 |
No | output | 1 | 103,472 | 4 | 206,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, a date is written as Y-M-D. For example, 2019-11-30 means November 30, 2019.
Integers M_1, D_1, M_2, and D_2 will be given as input.
It is known that the date 2019-M_2-D_2 follows 2019-M_1-D_1.
Determine whether the date 2019-M_1-D_1 is the last day of a month.
Constraints
* Both 2019-M_1-D_1 and 2019-M_2-D_2 are valid dates in the Gregorian calendar.
* The date 2019-M_2-D_2 follows 2019-M_1-D_1.
Input
Input is given from Standard Input in the following format:
M_1 D_1
M_2 D_2
Output
If the date 2019-M_1-D_1 is the last day of a month, print `1`; otherwise, print `0`.
Examples
Input
11 16
11 17
Output
0
Input
11 30
12 1
Output
1
Submitted Solution:
```
M1,D1=map(int,input().split())
if M1== 1 or 3 or 5 or 7 or 8 or 10:
if D1=31:
print(1)
else:
print(0)
elif M1== 4 or 6 or 9 or 11 :
if D1=30:
print(1)
else:
print(0)
else:
if D1 ==28:
print(1)
else:
print(0)
``` | instruction | 0 | 103,473 | 4 | 206,946 |
No | output | 1 | 103,473 | 4 | 206,947 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.