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.
Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had c pages.
At first day Mister B read v0 pages, but after that he started to speed up. Every day, starting from the second, he read a pages more than on the previous day (at first day he read v0 pages, at second — v0 + a pages, at third — v0 + 2a pages, and so on). But Mister B is just a human, so he physically wasn't able to read more than v1 pages per day.
Also, to refresh his memory, every day, starting from the second, Mister B had to reread last l pages he read on the previous day. Mister B finished the book when he read the last page for the first time.
Help Mister B to calculate how many days he needed to finish the book.
Input
First and only line contains five space-separated integers: c, v0, v1, a and l (1 ≤ c ≤ 1000, 0 ≤ l < v0 ≤ v1 ≤ 1000, 0 ≤ a ≤ 1000) — the length of the book in pages, the initial reading speed, the maximum reading speed, the acceleration in reading speed and the number of pages for rereading.
Output
Print one integer — the number of days Mister B needed to finish the book.
Examples
Input
5 5 10 5 4
Output
1
Input
12 4 12 4 1
Output
3
Input
15 1 100 0 0
Output
15
Note
In the first sample test the book contains 5 pages, so Mister B read it right at the first day.
In the second sample test at first day Mister B read pages number 1 - 4, at second day — 4 - 11, at third day — 11 - 12 and finished the book.
In third sample test every day Mister B read 1 page of the book, so he finished in 15 days.
Submitted Solution:
```
import math
import time
st = input().split()
c = int(st[0])
v0 = int(st[1])
v1 = int(st[2])
a = int(st[3])
l = int(st[4])
i = 0
d = 0
while i < c:
if (v0 + d * a) < v1:
i += v0 + d * a
else:
i += v1
d += 1
if d != 1:
i -= l
print(d)
``` | instruction | 0 | 73,010 | 4 | 146,020 |
Yes | output | 1 | 73,010 | 4 | 146,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had c pages.
At first day Mister B read v0 pages, but after that he started to speed up. Every day, starting from the second, he read a pages more than on the previous day (at first day he read v0 pages, at second — v0 + a pages, at third — v0 + 2a pages, and so on). But Mister B is just a human, so he physically wasn't able to read more than v1 pages per day.
Also, to refresh his memory, every day, starting from the second, Mister B had to reread last l pages he read on the previous day. Mister B finished the book when he read the last page for the first time.
Help Mister B to calculate how many days he needed to finish the book.
Input
First and only line contains five space-separated integers: c, v0, v1, a and l (1 ≤ c ≤ 1000, 0 ≤ l < v0 ≤ v1 ≤ 1000, 0 ≤ a ≤ 1000) — the length of the book in pages, the initial reading speed, the maximum reading speed, the acceleration in reading speed and the number of pages for rereading.
Output
Print one integer — the number of days Mister B needed to finish the book.
Examples
Input
5 5 10 5 4
Output
1
Input
12 4 12 4 1
Output
3
Input
15 1 100 0 0
Output
15
Note
In the first sample test the book contains 5 pages, so Mister B read it right at the first day.
In the second sample test at first day Mister B read pages number 1 - 4, at second day — 4 - 11, at third day — 11 - 12 and finished the book.
In third sample test every day Mister B read 1 page of the book, so he finished in 15 days.
Submitted Solution:
```
inp = input()
inpL = inp.split(" ")
c = int(inpL[0])
v0 = int(inpL[1])
v1 = int(inpL[2])
a = int(inpL[3])
l = int(inpL[4])
ans = 0
mul = 0
oc = c
isFirst = True
while c > 0:
ans = ans + 1
r = v0 + mul*a
if r > v1:
r = v1
if not isFirst:
c = c + l
if c > oc:
c = oc
c = c - r
print(ans)
``` | instruction | 0 | 73,011 | 4 | 146,022 |
No | output | 1 | 73,011 | 4 | 146,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had c pages.
At first day Mister B read v0 pages, but after that he started to speed up. Every day, starting from the second, he read a pages more than on the previous day (at first day he read v0 pages, at second — v0 + a pages, at third — v0 + 2a pages, and so on). But Mister B is just a human, so he physically wasn't able to read more than v1 pages per day.
Also, to refresh his memory, every day, starting from the second, Mister B had to reread last l pages he read on the previous day. Mister B finished the book when he read the last page for the first time.
Help Mister B to calculate how many days he needed to finish the book.
Input
First and only line contains five space-separated integers: c, v0, v1, a and l (1 ≤ c ≤ 1000, 0 ≤ l < v0 ≤ v1 ≤ 1000, 0 ≤ a ≤ 1000) — the length of the book in pages, the initial reading speed, the maximum reading speed, the acceleration in reading speed and the number of pages for rereading.
Output
Print one integer — the number of days Mister B needed to finish the book.
Examples
Input
5 5 10 5 4
Output
1
Input
12 4 12 4 1
Output
3
Input
15 1 100 0 0
Output
15
Note
In the first sample test the book contains 5 pages, so Mister B read it right at the first day.
In the second sample test at first day Mister B read pages number 1 - 4, at second day — 4 - 11, at third day — 11 - 12 and finished the book.
In third sample test every day Mister B read 1 page of the book, so he finished in 15 days.
Submitted Solution:
```
c, v0, v1, a, l = map(int, input().split())
now,day=0,0
while(now<c):
if(day==0):
now+=v0
else:
now+=v0-l
if(v0+a<=v1):
v0+=a
day+=1;
print(day)
``` | instruction | 0 | 73,012 | 4 | 146,024 |
No | output | 1 | 73,012 | 4 | 146,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had c pages.
At first day Mister B read v0 pages, but after that he started to speed up. Every day, starting from the second, he read a pages more than on the previous day (at first day he read v0 pages, at second — v0 + a pages, at third — v0 + 2a pages, and so on). But Mister B is just a human, so he physically wasn't able to read more than v1 pages per day.
Also, to refresh his memory, every day, starting from the second, Mister B had to reread last l pages he read on the previous day. Mister B finished the book when he read the last page for the first time.
Help Mister B to calculate how many days he needed to finish the book.
Input
First and only line contains five space-separated integers: c, v0, v1, a and l (1 ≤ c ≤ 1000, 0 ≤ l < v0 ≤ v1 ≤ 1000, 0 ≤ a ≤ 1000) — the length of the book in pages, the initial reading speed, the maximum reading speed, the acceleration in reading speed and the number of pages for rereading.
Output
Print one integer — the number of days Mister B needed to finish the book.
Examples
Input
5 5 10 5 4
Output
1
Input
12 4 12 4 1
Output
3
Input
15 1 100 0 0
Output
15
Note
In the first sample test the book contains 5 pages, so Mister B read it right at the first day.
In the second sample test at first day Mister B read pages number 1 - 4, at second day — 4 - 11, at third day — 11 - 12 and finished the book.
In third sample test every day Mister B read 1 page of the book, so he finished in 15 days.
Submitted Solution:
```
#codeforces Mister B and Book Reading solve with Python 3
import re
string=input()
pattern=r"\d+\s?"
lst=re.findall(pattern,string)
page=0
arr=[]
for i in range(1000):
if i==0:
page+=int(lst[1])+(i*int(lst[3]))
arr.append(i)
if page>=int(lst[0]):
break
if page>=int(lst[2]):
for i in range(1000):
page+=page
arr.append(i)
if page>=int(lst[0]):
break
page+=int(lst[1])+(i*int(lst[3]))+int(lst[4])
arr.append(i)
if page>=int(lst[0]):
break
if page>=int(lst[2]):
for i in range(1000):
page+=page
arr.append(i)
if page>=int(lst[0]):
break
print(len(arr))
``` | instruction | 0 | 73,013 | 4 | 146,026 |
No | output | 1 | 73,013 | 4 | 146,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had c pages.
At first day Mister B read v0 pages, but after that he started to speed up. Every day, starting from the second, he read a pages more than on the previous day (at first day he read v0 pages, at second — v0 + a pages, at third — v0 + 2a pages, and so on). But Mister B is just a human, so he physically wasn't able to read more than v1 pages per day.
Also, to refresh his memory, every day, starting from the second, Mister B had to reread last l pages he read on the previous day. Mister B finished the book when he read the last page for the first time.
Help Mister B to calculate how many days he needed to finish the book.
Input
First and only line contains five space-separated integers: c, v0, v1, a and l (1 ≤ c ≤ 1000, 0 ≤ l < v0 ≤ v1 ≤ 1000, 0 ≤ a ≤ 1000) — the length of the book in pages, the initial reading speed, the maximum reading speed, the acceleration in reading speed and the number of pages for rereading.
Output
Print one integer — the number of days Mister B needed to finish the book.
Examples
Input
5 5 10 5 4
Output
1
Input
12 4 12 4 1
Output
3
Input
15 1 100 0 0
Output
15
Note
In the first sample test the book contains 5 pages, so Mister B read it right at the first day.
In the second sample test at first day Mister B read pages number 1 - 4, at second day — 4 - 11, at third day — 11 - 12 and finished the book.
In third sample test every day Mister B read 1 page of the book, so he finished in 15 days.
Submitted Solution:
```
c,v0,v1,a,l = map(int,input().split())
ans = 0
i = 0
while(v0<c):
v0 = v0+min(v1,v0+i*a-l)*(i!=0)
ans+=1
i+=1
print(ans)
``` | instruction | 0 | 73,014 | 4 | 146,028 |
No | output | 1 | 73,014 | 4 | 146,029 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie. | instruction | 0 | 73,690 | 4 | 147,380 |
Tags: greedy, implementation
Correct Solution:
```
n,k = map(int,input().split())
now, reslt = 1, 0
for i in range(n):
x,y = map(int,input().split())
reslt += (x - now)%k + y - x + 1
now = y + 1
print(reslt)
``` | output | 1 | 73,690 | 4 | 147,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie. | instruction | 0 | 73,691 | 4 | 147,382 |
Tags: greedy, implementation
Correct Solution:
```
n, x = map(int, input().split())
rpos = 1
ans = 0
for i in range(n):
l, r = map(int, input().split())
ans += ((l - rpos) // x) * x
rpos = r + 1
print(r - ans)
``` | output | 1 | 73,691 | 4 | 147,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie. | instruction | 0 | 73,692 | 4 | 147,384 |
Tags: greedy, implementation
Correct Solution:
```
#!/usr/bin/env python
def main():
n, x = [int(c) for c in input().split()]
time = res = 0
for i in range(n):
l, r = [int(c) - 1 for c in input().split()]
time += x * ((l - time) // x)
tmp = r - time + 1
time += tmp
res += tmp
print(res)
if __name__ == '__main__':
main()
``` | output | 1 | 73,692 | 4 | 147,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie. | instruction | 0 | 73,693 | 4 | 147,386 |
Tags: greedy, implementation
Correct Solution:
```
n, x = [int(x) for x in input().split()]
p = 1
ans = 0
for i in range(n):
l, r = [int(x) for x in input().split()]
p += (l - p) // x * x
ans += r - p + 1
p = r + 1
print(ans)
``` | output | 1 | 73,693 | 4 | 147,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie. | instruction | 0 | 73,694 | 4 | 147,388 |
Tags: greedy, implementation
Correct Solution:
```
n, x = map(int, input().split())
t = 1
final = 0
for i in range(n):
l, r = map(int, input().split())
final += ((l-t) % x)+(r-l)+1
t = r+1
print(final)
``` | output | 1 | 73,694 | 4 | 147,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie. | instruction | 0 | 73,695 | 4 | 147,390 |
Tags: greedy, implementation
Correct Solution:
```
s = list(map(int,input().split()))
t=0
last = 1
for _ in range(s[0]):
l = list(map(int,input().split()))
a = ((l[0]-last)//s[1])*s[1]
t+= l[1]-a - (last-1)
last =l[1]+1
print(t)
``` | output | 1 | 73,695 | 4 | 147,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie. | instruction | 0 | 73,696 | 4 | 147,392 |
Tags: greedy, implementation
Correct Solution:
```
n, x = map(int, input().split())
p = 1
c = 0
for i in range(n):
l, r = map(int, input().split())
while l - p >= x:
p += x
c += r - p + 1
p = r + 1
print(c)
``` | output | 1 | 73,696 | 4 | 147,393 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie. | instruction | 0 | 73,697 | 4 | 147,394 |
Tags: greedy, implementation
Correct Solution:
```
vals = [int(n) for n in input().split()]
n = vals[0]
x = vals[1]
start = 1
result = 0
for _ in range(n):
moment = [int(n) for n in input().split()]
result += ((moment[0]-start)%x) + moment[1] - moment[0] + 1
start = moment[1]+1
print(result)
``` | output | 1 | 73,697 | 4 | 147,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.
Submitted Solution:
```
r=lambda:map(int,input().split())
a,b=r()
t=0
z=0
for i in a*[0]:
c,d=r()
t+=(c-z-1)%b+(d-c+1)
z=d
print(t)
``` | instruction | 0 | 73,698 | 4 | 147,396 |
Yes | output | 1 | 73,698 | 4 | 147,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.
Submitted Solution:
```
n,x=map(int,input().split())
total,start=0,0
for i in range(n):
a,b=map(int,input().split())
while(start+x<a):
start+=x
total+=(b-start)
start=b
print(total)
``` | instruction | 0 | 73,699 | 4 | 147,398 |
Yes | output | 1 | 73,699 | 4 | 147,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.
Submitted Solution:
```
n,x=list(map(int,input().split()))
s=1
total_min=0
for i in range(n):
l,r=list(map(int,input().split()))
total_min += ((l-s)%x)+(r-l+1)
s=r+1
print(total_min)
``` | instruction | 0 | 73,700 | 4 | 147,400 |
Yes | output | 1 | 73,700 | 4 | 147,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.
Submitted Solution:
```
n,x=map(int,input().split())
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
m=0
s=1
for i in range(len(a)):
if (a[i][0]-s)%x==0:
m+=a[i][1]+1-a[i][0]
s=a[i][1]+1
else:
m+=(a[i][0]-s)%x+(a[i][1]+1-a[i][0])
s=a[i][1]+1
print(m)
``` | instruction | 0 | 73,701 | 4 | 147,402 |
Yes | output | 1 | 73,701 | 4 | 147,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.
Submitted Solution:
```
n,x=map(int,input().split())
ans=0
t=1
for _ in range(n):
i,j=map(int,input().split())
ans+=j-i+1+(i-t)%x
print(ans)
``` | instruction | 0 | 73,702 | 4 | 147,404 |
No | output | 1 | 73,702 | 4 | 147,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.
Submitted Solution:
```
A = input().split()
B = int(A[0])
C = int(A[1])
E = []
F = []
for i in range(B):
D = input().split()
E.append ( int(D[0]) )
F.append ( int(D[1]) )
T = 0
Max = F[len(F)-1]
Ans = 0
i = 0
while(T<Max):
Temp = T + C
print(F[i]-E[i])
if (Temp <= E[i]):
if (Temp!=E[i]):
Ans += (E[i] - Temp) + (F[i] - E[i])
else:
Ans += (F[i] - E[i])
T = F[i]
i += 1
elif (Temp > E[i]):
Ans += (F[i] - E[i])
T = F[i]
i += 1
print(Ans)
``` | instruction | 0 | 73,703 | 4 | 147,406 |
No | output | 1 | 73,703 | 4 | 147,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.
Submitted Solution:
```
n,x=map(int,input().split())
array=[]
a=0
b=0
c=[]
for i in range(n):
array.append(list(map(int, input().split())))
for i in range(n):
if array[i][0]-b >x:
a+=1
b=array[i][1]
print(array[n-1][1]-a*x)
``` | instruction | 0 | 73,704 | 4 | 147,408 |
No | output | 1 | 73,704 | 4 | 147,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have decided to watch the best moments of some movie. There are two buttons on your player:
1. Watch the current minute of the movie. By pressing this button, you watch the current minute of the movie and the player automatically proceeds to the next minute of the movie.
2. Skip exactly x minutes of the movie (x is some fixed positive integer). If the player is now at the t-th minute of the movie, then as a result of pressing this button, it proceeds to the minute (t + x).
Initially the movie is turned on in the player on the first minute, and you want to watch exactly n best moments of the movie, the i-th best moment starts at the li-th minute and ends at the ri-th minute (more formally, the i-th best moment consists of minutes: li, li + 1, ..., ri).
Determine, what is the minimum number of minutes of the movie you have to watch if you want to watch all the best moments?
Input
The first line contains two space-separated integers n, x (1 ≤ n ≤ 50, 1 ≤ x ≤ 105) — the number of the best moments of the movie and the value of x for the second button.
The following n lines contain the descriptions of the best moments of the movie, the i-th line of the description contains two integers separated by a space li, ri (1 ≤ li ≤ ri ≤ 105).
It is guaranteed that for all integers i from 2 to n the following condition holds: ri - 1 < li.
Output
Output a single number — the answer to the problem.
Examples
Input
2 3
5 6
10 12
Output
6
Input
1 1
1 100000
Output
100000
Note
In the first sample, the player was initially standing on the first minute. As the minutes from the 1-st to the 4-th one don't contain interesting moments, we press the second button. Now we can not press the second button and skip 3 more minutes, because some of them contain interesting moments. Therefore, we watch the movie from the 4-th to the 6-th minute, after that the current time is 7. Similarly, we again skip 3 minutes and then watch from the 10-th to the 12-th minute of the movie. In total, we watch 6 minutes of the movie.
In the second sample, the movie is very interesting, so you'll have to watch all 100000 minutes of the movie.
Submitted Solution:
```
n, x = list(map(int, input().split()))
t = 0
m = 0
for i in range(n):
l, r = list(map(int, input().split()))
if t < l:
m += (r - l + 1) + (l - t + 1) % x
t = r + 1
print(m)
``` | instruction | 0 | 73,705 | 4 | 147,410 |
No | output | 1 | 73,705 | 4 | 147,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO | instruction | 0 | 74,492 | 4 | 148,984 |
Tags: implementation
Correct Solution:
```
#B=[int(z)for z in input().split('.')]
#D=[int(z)for z in input().split('.')]
#if B[2]-D[2]<18:
# print('NO')
#elif B[2]-D[2]>18:
# print('YES')
#else:
# if B[1]>D[1]:
# print('YES')
# elif B[1]<D[1]:
# print('NO')
# else:
# if B[0]>=D[0]:
# print('YES')
# else:
# print('NO')
#
### The Ver. above is NAIVE!
d,m,y = map(int,input().split('.'))
a,b,c = map(int,input().split('.'))
months = [0,31,28,31,30,31,30,31,31,30,31,30,31]
count = 0
while(count<6):
if b < c and c in range(13) and months[c] >= a + (b%4 == 0 and b ==2) :
temp = b
b = c
c = temp
count = 0
else: count += 1
if a < c and c <= (months[b] +(a%4 == 0 and b==2)):
temp = c
c = a
a = temp
count = 0
else: count += 1
if a < b and a in range(13):
temp = a
a = b
b = temp
count = 0
if y - c > 18 : print("YES")
elif y - c == 18:
if m > b : print("YES")
elif m == b:
if d >= a: print("YES")
else: print("NO")
else: print("NO")
else: print("NO")
``` | output | 1 | 74,492 | 4 | 148,985 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO | instruction | 0 | 74,493 | 4 | 148,986 |
Tags: implementation
Correct Solution:
```
from itertools import permutations
def parse(s):
return tuple(map(int, s.strip().split('.')))
def win(birth):
#print('birth:', birth)
print('YES')
import sys; sys.exit()
# jan feb mar apr may jun jul aug sep oct nov dec
days_in_month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
def get_days_in_month(y, m):
if y % 4 == 0 and m == 2:
return 29
return days_in_month[m-1]
target = parse(input())
#print('target:', target)
D, M, Y = target
given = parse(input())
feasible = False
for birth in permutations(given):
d, m, y = birth
if m > 12 or d > get_days_in_month(y, m):
continue
if y % 4 != 0 and (m, d) == (3, 1) and Y % 4 == 0:
m, d = 2, 29
if y % 4 == 0 and (m, d) == (2, 29) and Y % 4 != 0:
m, d = 3, 1
if Y - y > 18:
win(birth)
if Y - y == 18:
if m < M:
win(birth)
if m == M and d <= D:
win(birth)
print('NO')
``` | output | 1 | 74,493 | 4 | 148,987 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO | instruction | 0 | 74,494 | 4 | 148,988 |
Tags: implementation
Correct Solution:
```
from itertools import *
import sys
m=[32,29,32,31,32,31,32,32,31,32,31,32]
s,t=[map(int,input().split('.')) for _ in range(2)]
g=False
a,b,c=s
for d,e,f in permutations(t):
g|=b<13 and e<13 and a<m[b-1]+(b==2)*(c%4==0)and d<m[e-1]+(e==2)*(f%4==0)and(c-f>18 or(c-f==18 and(b>e or(b==e and(a>=d)))))
print(["NO","YES"][g])
``` | output | 1 | 74,494 | 4 | 148,989 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO | instruction | 0 | 74,495 | 4 | 148,990 |
Tags: implementation
Correct Solution:
```
d,m,y = map(int,input().split('.'))
a,b,c = map(int,input().split('.'))
months = [0,31,28,31,30,31,30,31,31,30,31,30,31]
count = 0
while(count <6):
if b < c and c in range(13) and months[c] >= a + (b%4 == 0 and b ==2) :
temp = b
b = c
c = temp
count = 0
else: count += 1
if a < c and c <= (months[b] +(a%4 == 0 and b==2)):
temp = c
c = a
a = temp
count = 0
else: count += 1
if a < b and a in range(13):
temp = a
a = b
b = temp
count = 0
if y - c > 18 : print("YES")
elif y - c == 18:
if m > b : print("YES")
elif m == b:
if d >= a: print("YES")
else: print("NO")
else: print("NO")
else: print("NO")
``` | output | 1 | 74,495 | 4 | 148,991 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO | instruction | 0 | 74,496 | 4 | 148,992 |
Tags: implementation
Correct Solution:
```
def checkDOB(a,b,c,d,e,f):
# 1 incremented to use < instead of <= below(codegolfing)
days=[32,29,32,31,32,31,32,32,31,32,31,32,32,30,32,31,32,31,32,32,31,32,31,32]
# if(f-c>18 || (f-c==18 && (e-b>0 || (e-b==0&&d>=a) ) ) ):return true
if( b<13 and e<13 and a<days[12*(c%4==0)+b-1] and d<days[12*(f%4==0)+e-1]):
if(c-f>18 or (c-f==18 and ( b-e>0 or (b-e==0 and ( a>=d ) ) ) ) ):
# print(a,b,c,d,e,f)
return True
return False
import sys
#fi=open("G:\DUMP\input.in","r")
#sys.stdin = fi
i=0
d=[]
#for line in sys.stdin:
for i in range(0,2):
d+= input().replace('\n','').split(".")
#print(d)
for i in range(len(d)):
d[i]=int(d[i])
#print(d)
b=False
for i in range(3,6):
for j in range(3,6):
for k in range(3,6):
if(i!=j and j!=k and k!=i):
b|=checkDOB(d[0],d[1],d[2],d[i],d[j],d[k])
print(["NO","YES"][b])
#for x in 0,1:print"YNEOS"[x::2]
``` | output | 1 | 74,496 | 4 | 148,993 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO | instruction | 0 | 74,497 | 4 | 148,994 |
Tags: implementation
Correct Solution:
```
t = tuple(map(int, input().split('.')))
dc = (0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31)
def f(d, m, y):
if m not in range(13) or d > dc[m] + (m == 2 and y % 4 == 0):
return False
else:
return t[2] - y > 18 or t[2] - y == 18 and (m, d) <= (t[1], t[0])
a, b, c = map(int, input().split('.'))
print('YES' if any((f(a, b, c), f(a, c, b), f(b, a, c), f(b, c, a), f(c, a, b), f(c, b, a))) else 'NO')
# Made By Mostafa_Khaled
``` | output | 1 | 74,497 | 4 | 148,995 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO | instruction | 0 | 74,498 | 4 | 148,996 |
Tags: implementation
Correct Solution:
```
import itertools as it
month_to_days_non_leap = {
1: 31,
2: 28,
3: 31,
4: 30,
5: 31,
6: 30,
7: 31,
8: 31,
9: 30,
10: 31,
11: 30,
12: 31,
}
def month_year_to_day(month, year):
if year % 4 == 0 and month == 2:
return 29
else:
return month_to_days_non_leap[month]
def good_date(day, month, year):
if month > 12: return False
if day > month_year_to_day(month, year): return False
return True
dd, mm, yy = map(int, input().split('.'))
bd, bm, by = map(int, input().split('.'))
found_sol = False
for p_bd, p_bm, p_by in it.permutations([bd, bm, by]):
if good_date(p_bd, p_bm, p_by):
year_diff = yy - p_by
if year_diff > 18:
found_sol = True
break
elif year_diff < 18:
continue
if p_bm < mm:
found_sol = True
break
elif p_bm > mm:
continue
if p_bd < dd:
found_sol = True
break
elif p_bd > dd:
continue
found_sol = True
break
if found_sol:
print("YES")
else:
print("NO")
``` | output | 1 | 74,498 | 4 | 148,997 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO | instruction | 0 | 74,499 | 4 | 148,998 |
Tags: implementation
Correct Solution:
```
dd,mm,yy=list(map(int,input().split('.')))
d,m,y=list(map(int,input().split('.')))
a=[[31,28,31,30,31,30,31,31,30,31,30,31],[31,29,31,30,31,30,31,31,30,31,30,31]]
b=[[d,m,y],[d,y,m],[m,y,d],[m,d,y],[y,m,d],[y,d,m]]
z=0
for i in range(6):
if 1<=b[i][2]<=99 and 1<=b[i][1]<=12 and 1<=b[i][0]<=a[int(b[i][2]%4==0)][b[i][1]-1]:
if yy-b[i][2]>18 or (yy-b[i][2]==18 and (mm>b[i][1] or (mm==b[i][1] and dd>=b[i][0]))):
z=1
break
print('YNEOS'[z==0::2])
``` | output | 1 | 74,499 | 4 | 148,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO
Submitted Solution:
```
t = tuple(map(int, input().split('.')))
dc = (0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31)
def f(d, m, y):
if m not in range(13) or d > dc[m] + (m == 2 and y % 4 == 0):
return False
else:
return t[2] - y > 18 or t[2] - y == 18 and (m, d) <= (t[1], t[0])
a, b, c = map(int, input().split('.'))
print('YES' if any((f(a, b, c), f(a, c, b), f(b, a, c), f(b, c, a), f(c, a, b), f(c, b, a))) else 'NO')
``` | instruction | 0 | 74,500 | 4 | 149,000 |
Yes | output | 1 | 74,500 | 4 | 149,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO
Submitted Solution:
```
s1 = input()
s2 = input()
if int(s1[-2:]) - int(s2[-2:]) <= 18:
print("YES")
else:
print("NO")
``` | instruction | 0 | 74,501 | 4 | 149,002 |
No | output | 1 | 74,501 | 4 | 149,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO
Submitted Solution:
```
B=[int(z)for z in input().split('.')]
D=[int(z)for z in input().split('.')]
if B[2]-D[2]<18:
print('NO')
elif B[2]-D[2]>18:
print('YES')
else:
if B[1]>D[1]:
print('YES')
elif B[1]<D[1]:
print('NO')
else:
if B[0]>=D[0]:
print('YES')
else:
print('NO')
``` | instruction | 0 | 74,502 | 4 | 149,004 |
No | output | 1 | 74,502 | 4 | 149,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO
Submitted Solution:
```
d = list(map(int, input().split('.')))
b = list(map(int, input().split('.')))
if d[2] - b[2] > 18:
print('YES')
elif d[2] - b[2] < 18:
print('NO')
elif (d[1], d[0]) >= (b[1], b[0]):
print('YES')
elif b[0] <= 12 and (d[1], d[0]) >= (b[0], b[1]):
print('YES')
else:
print('NO')
``` | instruction | 0 | 74,503 | 4 | 149,006 |
No | output | 1 | 74,503 | 4 | 149,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The king Copa often has been reported about the Codeforces site, which is rapidly getting more and more popular among the brightest minds of the humanity, who are using it for training and competing. Recently Copa understood that to conquer the world he needs to organize the world Codeforces tournament. He hopes that after it the brightest minds will become his subordinates, and the toughest part of conquering the world will be completed.
The final round of the Codeforces World Finals 20YY is scheduled for DD.MM.YY, where DD is the day of the round, MM is the month and YY are the last two digits of the year. Bob is lucky to be the first finalist form Berland. But there is one problem: according to the rules of the competition, all participants must be at least 18 years old at the moment of the finals. Bob was born on BD.BM.BY. This date is recorded in his passport, the copy of which he has already mailed to the organizers. But Bob learned that in different countries the way, in which the dates are written, differs. For example, in the US the month is written first, then the day and finally the year. Bob wonders if it is possible to rearrange the numbers in his date of birth so that he will be at least 18 years old on the day DD.MM.YY. He can always tell that in his motherland dates are written differently. Help him.
According to another strange rule, eligible participant must be born in the same century as the date of the finals. If the day of the finals is participant's 18-th birthday, he is allowed to participate.
As we are considering only the years from 2001 to 2099 for the year of the finals, use the following rule: the year is leap if it's number is divisible by four.
Input
The first line contains the date DD.MM.YY, the second line contains the date BD.BM.BY. It is guaranteed that both dates are correct, and YY and BY are always in [01;99].
It could be that by passport Bob was born after the finals. In this case, he can still change the order of numbers in date.
Output
If it is possible to rearrange the numbers in the date of birth so that Bob will be at least 18 years old on the DD.MM.YY, output YES. In the other case, output NO.
Each number contains exactly two digits and stands for day, month or year in a date. Note that it is permitted to rearrange only numbers, not digits.
Examples
Input
01.01.98
01.01.80
Output
YES
Input
20.10.20
10.02.30
Output
NO
Input
28.02.74
28.02.64
Output
NO
Submitted Solution:
```
def leap (x) :
if x%4 == 0 :
return (1)
return (0)
I = lambda : map(int,input().split())
iff = input()
ii = input()
iff1 = int(iff [:2])
iff2 = int(iff [3:5])
iff3 = int(iff [6:])
#print(iff1,iff2,iff3)
ii1 = int(ii [:2])
ii2 = int(ii [3:5])
ii3 = int(ii [6:])
l = [ii1,ii2,ii3]
l2 = [[ii1,ii2,ii3]]
d= {}
d[1] = 31 ; d[3] = 31 ; d[5]= 31 ; d[7] = 31 ; d[8] = 31 ; d[10] = 31 ; d[12] = 31 ;
d[4] = 30 ; d[6] = 30 ; d[9] = 30 ; d[11] = 30 ;
if leap(iff3) :
d[2] = 29
else :
d[2] = 28
for i in l :
for j in l :
if i==j :
continue
for k in l :
if i==k or j==k :
continue
#print(i)
if 1<=j<=12 and 1<=i<=d[j] and k>=iff3 + 18 :
l2.append([i,j,k])
for i in l2 :
p1 = i[0] ; p2 = i[1] ; p3 = i[2] ;
#print(p1,p2, p3)
if ( iff3 - p3<= 17 ) :
continue
if ( iff3 - p3 >= 19 ) :
exit(print("Yes"))
if p2>iff2 :
exit(print("Yes"))
if p2 < iff2 :
continue
if p2==iff2 :
if p1 > iff1 :
exit(print("Yes"))
if p1 < iff1 :
continue
exit(print("Yes"))
#print(l2)
#print(d)
print("NO")
``` | instruction | 0 | 74,504 | 4 | 149,008 |
No | output | 1 | 74,504 | 4 | 149,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00 | instruction | 0 | 74,999 | 4 | 149,998 |
Tags: implementation, strings
Correct Solution:
```
n = input().split(':')
h = int(n[0])
m = int(n[1])
def check(h,m):
h = str(h)
m = str(m)
if len(m) ==1:
m = '0'+m
if len(h) ==1:
h = '0'+h
if h == m [::-1]:
return True
return False
for i in range(100000):
m += 1
if m ==60:
m = 0
h += 1
if h == 24:
h = 0
if check(h,m):
break
res =""
h = str(h)
m = str(m)
if len(h) ==1:
res = res +'0' + str(h) + ':'
else:
res = res + str(h) + ":"
if len(m) ==1:
res = res + '0' +str(m)
else:
res = res + str(m)
print(res)
``` | output | 1 | 74,999 | 4 | 149,999 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00 | instruction | 0 | 75,000 | 4 | 150,000 |
Tags: implementation, strings
Correct Solution:
```
h, m = input().split(':')
res = h[::-1]
if res < '60' and m < res:
print(h, res, sep=':')
else:
res = '60'
while not res < '60':
h_int = (int(h) + 1) % 24
h = ('0' if h_int < 10 else '') + str(h_int)
res = h[::-1]
print(h, res, sep=':')
``` | output | 1 | 75,000 | 4 | 150,001 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00 | instruction | 0 | 75,001 | 4 | 150,002 |
Tags: implementation, strings
Correct Solution:
```
s1=input()
a=int(s1[0])*10+int(s1[1])
b=int(s1[3])*10 +int(s1[4])
def increasetime(a,b):
b+=1
if b==60:
a+=1
b=0
if a==24:
a=0
return a,b
a,b=increasetime(a,b)
while a//10!=b%10 or a%10!=b//10:
a,b=increasetime(a,b)
if a<10:
print("0",end="")
print(str(a)+":",end="")
else :
print(str(a)+":",end="")
if b<10:
print("0",end="")
print(b)
else :
print(b)
``` | output | 1 | 75,001 | 4 | 150,003 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00 | instruction | 0 | 75,002 | 4 | 150,004 |
Tags: implementation, strings
Correct Solution:
```
k = input()
a = int(k[:2]);b = int(k[3:])
h = (a*60+b+1)%(24*60)
def is_p(h):
a = str(h//60)
b = str(h%60)
if int(a) < 10:
a = '0'+a
if int(b) < 10:
b = '0'+b
if a+b == (a+b)[::-1]:
return True
return False
while not is_p(h):
h+=1
h%=(24*60)
a = str(h//60)
b = str(h%60)
if int(a)<10:
a = '0'+a
if int(b) < 10:
b = '0'+b
print(a+':'+b)
``` | output | 1 | 75,002 | 4 | 150,005 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00 | instruction | 0 | 75,003 | 4 | 150,006 |
Tags: implementation, strings
Correct Solution:
```
hora=["00","01","02","03","04","05","10","11","12","13","14","15","20","21","22","23"]
minuto=["00","10","20","30","40","50","01","11","21","31","41","51","02","12","22","32"]
b=input()
b=b.split(":")
b[0]=int(b[0])
b[1]=int(b[1])
for k in range (len(hora)):
if int(hora[k])>=b[0]:
if int(hora[k])==b[0]:
if (int(minuto[k])>b[1]):
posicion=k
break
else:
if k<((len(hora))-1):
posicion=k+1
break
else:
posicion=0
break
else:
posicion=k
break
print(hora[posicion]+":"+minuto[posicion])
``` | output | 1 | 75,003 | 4 | 150,007 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00 | instruction | 0 | 75,004 | 4 | 150,008 |
Tags: implementation, strings
Correct Solution:
```
n,m=map(int,input().split(":"))
M=1
def t(s):
if(int(s)<10):
return "0"+s
else:
return s
while(True):
a=((n*60+m+M)//60)%24
b=(n*60+m+M)%60
s=t(str(a))+":"+t(str(b))
if(s==s[::-1]):
print(s)
break
M+=1
``` | output | 1 | 75,004 | 4 | 150,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00 | instruction | 0 | 75,005 | 4 | 150,010 |
Tags: implementation, strings
Correct Solution:
```
s=input()
t1=s[:2]
t2=s[3:]
if t1=='23' and int(t2)>=32:print('00:00')
elif int(t1)==5 and int(t2)>=50:print('10:01')
elif int(t1)>5 and int(t1)<10:print('10:01')
elif int(t1)==15 and int(t2)>=51:print('20:02')
elif int(t1)>15 and int(t1)<20:print('20:02')
elif int(t2)>=int(t1[::-1]):
t3=int(t1)+1
if t3<10:t3=str('0'+str(t3))
else:t3=str(t3)
t4=t3[::-1]
print(t3+':'+t4)
else:
t3=t1
t4=t3[::-1]
print(t3+':'+t4)
``` | output | 1 | 75,005 | 4 | 150,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00 | instruction | 0 | 75,006 | 4 | 150,012 |
Tags: implementation, strings
Correct Solution:
```
s = input()
a = [x for x in s.split(":")]
temp = ""
f = -1
if(int(a[0])==23):
k = str(a[0])
if(int(k[::-1]) > int(a[1]) and int(k[::-1]) < 59 and f!=0):
temp= k + ":" +k[::-1]
f = 0
if(int(a[0])+1==24 and f!=0):
temp ="00"+":"+"00"
f = 0
for i in range(1,24-int(a[0])):
k = str(a[0])
if(int(k[::-1]) > int(a[1]) and int(k[::-1]) < 59 and f!=0):
temp= k + ":" +k[::-1]
f = 0
break
else:
k = str(int(a[0])+i)
if(int(k) <= 9):
k = "0"+ k
if(int(k[::-1]) < 59 and f!=0):
temp= k + ":" +k[::-1]
f = 0
break
print(temp)
``` | output | 1 | 75,006 | 4 | 150,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00
Submitted Solution:
```
a, b = input().split(':')
a, b = int(a), int(b)
if(b==59):
a = (a + 1)%24
b = (b+1)%60
while(True):
hora = str(a)
minuto = str(b)
if(int(hora)<10):
hora = '0' + hora
if(int(minuto)<10):
minuto = '0' + minuto
if(hora[0]==minuto[1] and hora[1]==minuto[0]):
print(hora+":"+minuto)
break
if(b==59):
a = (a + 1)%24
b = (b+1)%60
``` | instruction | 0 | 75,007 | 4 | 150,014 |
Yes | output | 1 | 75,007 | 4 | 150,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00
Submitted Solution:
```
s=input()
h=(s[:2])
m=(s[-2:])
if int(h[1])==5 and int(m)<int(h[::-1]):
print(h+':'+h[::-1])
elif int(h[1])<5:
if int(m)>=int(h[::-1]):
h=(int(h)+1)%24
if len(str(h))==1:
h='0'+str(h)
else:
h=str(h)
if h==0:
h='00'
m=h[::-1]
print(h+':'+m)
else:
print(h+':'+h[::-1])
else:
if int(h)<10:
print('10:01')
else:
print('20:02')
``` | instruction | 0 | 75,008 | 4 | 150,016 |
Yes | output | 1 | 75,008 | 4 | 150,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00
Submitted Solution:
```
l=input().split(':')
if l[0] in ['06','07','08','09']:
print('10:01')
elif l[0] in ['00','01','02','03','04']:
i = int(l[1])
temp = list(l[0])
temp.reverse()
st = ''.join(temp)
j=int(st)
if i<j:
print(l[0]+':'+st)
else:
st2=str(int(l[0])+1)
temp2 = list(st2)
temp2.reverse()
st3 = ''.join(temp2)
print('0'+st2+':'+st3+'0')
elif l[0] in ['10','11','12','13','14','20','21','22']:
i = int(l[1])
temp = list(l[0])
temp.reverse()
st = ''.join(temp)
j = int(st)
if i < j:
print(l[0] + ':' + st)
else:
st2 = str(int(l[0]) + 1)
temp2 = list(st2)
temp2.reverse()
st3 = ''.join(temp2)
print( st2 + ':' + st3)
elif l[0] in ['15']:
i = int(l[1])
if i < 51:
print(l[0] + ':' + '51')
else:
print('20:02')
elif l[0] in ['16','17','18','19']:
print('20:02')
elif l[0] in ['23']:
i = int(l[1])
if i < 32:
print(l[0] + ':' + '32')
else:
print('00:00')
elif l[0] in ['05']:
i = int(l[1])
temp = list(l[0])
temp.reverse()
st = ''.join(temp)
j = int(st)
if i < j:
print(l[0] + ':' + st)
else:
print('10:01')
``` | instruction | 0 | 75,009 | 4 | 150,018 |
Yes | output | 1 | 75,009 | 4 | 150,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00
Submitted Solution:
```
palindromes = ['00:00','01:10','02:20','03:30','04:40','05:50','10:01','11:11','12:21','13:31','14:41','15:51','20:02','21:12','22:22','23:32']
t = input()
check = 0
for i in range(16):
if int(t[:2])==int(palindromes[i][:2]):
check = 1
if int(t[3:])>=int(palindromes[i][3:]):
if i==15:
print('00:00')
else:
print(palindromes[i+1])
else:
print(palindromes[i])
if check==0:
for i in range(16):
if int(t[:2])<int(palindromes[i][:2]):
print(palindromes[i])
break
``` | instruction | 0 | 75,010 | 4 | 150,020 |
Yes | output | 1 | 75,010 | 4 | 150,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00
Submitted Solution:
```
from sys import stdin
input = stdin.readline
def is_palindrome(h, m):
a = str(h).zfill(2)
b = str(m).zfill(2)
return a[0] == b[1] and b[0] == a[1]
s = input().rstrip()
h = int(s[:2])
m = int(s[3:])
while True:
if m == 59:
m = 0
if h == 23:
h = 0
else:
h += 1
else:
m += 1
if is_palindrome(h, m):
break
print(h, ":", m, sep="")
``` | instruction | 0 | 75,011 | 4 | 150,022 |
No | output | 1 | 75,011 | 4 | 150,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00
Submitted Solution:
```
s=input('')
a,b=s.split(':')
a=int(a)
b=int(b)
if(a>=0 and a<=4):
if(b<=a):
temp="0"+str(a)
temp1=str(temp[::-1])
list1=[temp,temp1]
print(':'.join(list1))
else:
temp="0"+str(a+1)
temp1=str(temp[::-1])
list1=[temp,temp1]
print(':'.join(list1))
elif(a>=5 and a<=9):
print("10:01")
elif(a>=10 and a<=14):
if(a==10 and b<2):
print("10:01")
else:
if(b<=a):
temp2=str(a)
temp3=str(temp2[::-1])
list1=[temp2,temp3]
print(':'.join(list1))
else:
temp2=str(a+1)
temp3=str(temp2[::-1])
list1=[temp2,temp3]
print(':'.join(list1))
elif(a>=15 and a<=19):
print("20:02")
elif(a>=20 and a<=22):
if(a==20 and b<2):
print("20:02")
else:
if(b<=a):
temp4=str(a+1)
temp5=str(temp4[::-1])
list1=[temp4,temp5]
print(':'.join(list1))
else:
temp4=str(a+1)
temp5=str(temp4[::-1])
list1=[temp4,temp5]
print(':'.join(list1))
else:
print("00:00")
``` | instruction | 0 | 75,012 | 4 | 150,024 |
No | output | 1 | 75,012 | 4 | 150,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00
Submitted Solution:
```
h,m=input().split(':')
h=int(h)
m=int(m)
L=[0,1.1,2.2,3.3,4.4,5.5,6.6,10.01,11.11,12.21,13.31,14.41,15.51,20.02,21.12,22.22,23.32]
a=h+0.01*m
if L.count(a)==0:
L.append(a)
L.sort()
if L.index(a)< len(L)-1 :
s=str(L[L.index(a)+1])
L1=s.split('.')
if len(L1[0])==1:
h1='0'+L1[0]
L1[0]=h1
if len(L1[1])==1:
m1=L1[1]+'0'
L1[1]=m1
r=L1[0]+':'+L1[1]
else :
r='00:00'
print(r)
``` | instruction | 0 | 75,013 | 4 | 150,026 |
No | output | 1 | 75,013 | 4 | 150,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tattah is asleep if and only if Tattah is attending a lecture. This is a well-known formula among Tattah's colleagues.
On a Wednesday afternoon, Tattah was attending Professor HH's lecture. At 12:21, right before falling asleep, he was staring at the digital watch around Saher's wrist. He noticed that the digits on the clock were the same when read from both directions i.e. a palindrome.
In his sleep, he started dreaming about such rare moments of the day when the time displayed on a digital clock is a palindrome. As soon as he woke up, he felt destined to write a program that finds the next such moment.
However, he still hasn't mastered the skill of programming while sleeping, so your task is to help him.
Input
The first and only line of the input starts with a string with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59". Both "HH" and "MM" have exactly two digits.
Output
Print the palindromic time of day that comes soonest after the time given in the input. If the input time is palindromic, output the soonest palindromic time after the input time.
Examples
Input
12:21
Output
13:31
Input
23:59
Output
00:00
Submitted Solution:
```
n=input()
h=n[:2]
m=n[3:]
rh=h[::-1]
m=int(m)
if(int(m)<int(rh)):
ans=(h)+':'+(rh)
print(ans)
else:
while(1):
if(int(h)<23):
if(int(h[0])==0):
if(int(h[1]==9)):
h='10'
else:
h='0'+str(int(h[1])+1)
else:
h=str(int(h)+1)
rh=(h)[::-1]
#rh=int(rh)
if(int(rh)<59):
ans=str(h)+':'+rh
print(ans)
break;
else:
print("00:00")
break;
``` | instruction | 0 | 75,014 | 4 | 150,028 |
No | output | 1 | 75,014 | 4 | 150,029 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.