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 |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as `2018/01/23`.
After finishing the document, she noticed... | instruction | 0 | 47,791 | 4 | 95,582 |
"Correct Solution:
```
print(f"{2018}{input()[4:]}")
``` | output | 1 | 47,791 | 4 | 95,583 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as ... | instruction | 0 | 47,792 | 4 | 95,584 |
Yes | output | 1 | 47,792 | 4 | 95,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as ... | instruction | 0 | 47,793 | 4 | 95,586 |
Yes | output | 1 | 47,793 | 4 | 95,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as ... | instruction | 0 | 47,794 | 4 | 95,588 |
Yes | output | 1 | 47,794 | 4 | 95,589 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as ... | instruction | 0 | 47,796 | 4 | 95,592 |
No | output | 1 | 47,796 | 4 | 95,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as ... | instruction | 0 | 47,797 | 4 | 95,594 |
No | output | 1 | 47,797 | 4 | 95,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as ... | instruction | 0 | 47,799 | 4 | 95,598 |
No | output | 1 | 47,799 | 4 | 95,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she... | instruction | 0 | 48,418 | 4 | 96,836 |
Tags: implementation, math
Correct Solution:
```
a,b,c,d,k=map(int,input().split())
l=max(a,c)
r=min(b,d)
if r<l:
print(0)
elif l<=k<=r and a<=k<=b:
print (r-l)
else :
print (r-l+1)
``` | output | 1 | 48,418 | 4 | 96,837 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she... | instruction | 0 | 48,419 | 4 | 96,838 |
Tags: implementation, math
Correct Solution:
```
i1,s1,i2,s2,k=map(int,input().split())
if i2<=s1 and i2>=i1 and s2>=s1:
if k>=i2 and k <=s1 :
print(s1-i2)
else:
print(s1-i2+1)
elif i2>=i1 and i2<=s1 and s2<=s1:
if k>=i2 and k <=s2 :
print(s2-i2)
else:
print(s2-i2+1)
elif... | output | 1 | 48,419 | 4 | 96,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she... | instruction | 0 | 48,420 | 4 | 96,840 |
Tags: implementation, math
Correct Solution:
```
inp = list(map(int, input().split()))
l = max(inp[0], inp[2])
r = min(inp[1], inp[3])
res = max(r - l + 1, 0)
print(res - (l <= inp[4] <= r))
``` | output | 1 | 48,420 | 4 | 96,841 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she... | instruction | 0 | 48,421 | 4 | 96,842 |
Tags: implementation, math
Correct Solution:
```
i = input().split()
start = max(int(i[0]), int(i[2]))
end = min(int(i[1]), int(i[3]))
res = end - start + 1
if start <= int(i[4]) <= end:
res -= 1
if res < 0:
res = 0
print(res)
``` | output | 1 | 48,421 | 4 | 96,843 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she... | instruction | 0 | 48,422 | 4 | 96,844 |
Tags: implementation, math
Correct Solution:
```
#aditya76
import math
l1,r1,l2,r2,k=map(int,input().split())
nach=max(l1,l2)
kon=min(r1,r2)
if nach>kon:
print(0)
elif nach<=k<=kon:
print(kon-nach)
else:
print(kon-nach+1)
``` | output | 1 | 48,422 | 4 | 96,845 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she... | instruction | 0 | 48,423 | 4 | 96,846 |
Tags: implementation, math
Correct Solution:
```
l1, r1, l2, r2, k = map(int,input().split())
maxd = 0
if l1 <= l2 <= r2 <= r1 or l2 <= l1 <= r1 <= r2:
if r2 <= r1:
if l2 <= k <= r2:
maxd = r2 - l2
else:
maxd = r2 - l2 + 1
else:
if l1<=k<=r1:
maxd = r1... | output | 1 | 48,423 | 4 | 96,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she... | instruction | 0 | 48,424 | 4 | 96,848 |
Tags: implementation, math
Correct Solution:
```
l1,r1,l2,r2,k=(int(z) for z in input().split())
L=max(l1,l2)
R=min(r1,r2)
ans=0
if L<=k<=R:
ans-=1
print(max(ans+R-L+1,0))
``` | output | 1 | 48,424 | 4 | 96,849 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to minute r1 inclusive. Also, during the minute k she... | instruction | 0 | 48,425 | 4 | 96,850 |
Tags: implementation, math
Correct Solution:
```
l1, r1, l2, r2, k = map(int, input().split())
l = max(l1, l2)
r = min(r1, r2)
ans = max(r - l + 1, 0)
if k >= l and k <= r:
ans -= 1
print(ans)
``` | output | 1 | 48,425 | 4 | 96,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to min... | instruction | 0 | 48,426 | 4 | 96,852 |
Yes | output | 1 | 48,426 | 4 | 96,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to min... | instruction | 0 | 48,427 | 4 | 96,854 |
Yes | output | 1 | 48,427 | 4 | 96,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to min... | instruction | 0 | 48,428 | 4 | 96,856 |
Yes | output | 1 | 48,428 | 4 | 96,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to min... | instruction | 0 | 48,429 | 4 | 96,858 |
Yes | output | 1 | 48,429 | 4 | 96,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to min... | instruction | 0 | 48,430 | 4 | 96,860 |
No | output | 1 | 48,430 | 4 | 96,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to min... | instruction | 0 | 48,431 | 4 | 96,862 |
No | output | 1 | 48,431 | 4 | 96,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to min... | instruction | 0 | 48,432 | 4 | 96,864 |
No | output | 1 | 48,432 | 4 | 96,865 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!
Sonya is an owl and she sleeps during the day and stay awake from minute l1 to min... | instruction | 0 | 48,433 | 4 | 96,866 |
No | output | 1 | 48,433 | 4 | 96,867 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i-th of the shows is going from l_i-th to r_i-th minute, both ends inclusive.
You ... | instruction | 0 | 48,852 | 4 | 97,704 |
No | output | 1 | 48,852 | 4 | 97,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i-th of the shows is going from l_i-th to r_i-th minute, both ends inclusive.
You ... | instruction | 0 | 48,853 | 4 | 97,706 |
No | output | 1 | 48,853 | 4 | 97,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i-th of the shows is going from l_i-th to r_i-th minute, both ends inclusive.
You ... | instruction | 0 | 48,854 | 4 | 97,708 |
No | output | 1 | 48,854 | 4 | 97,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n TV shows you want to watch. Suppose the whole time is split into equal parts called "minutes". The i-th of the shows is going from l_i-th to r_i-th minute, both ends inclusive.
You ... | instruction | 0 | 48,855 | 4 | 97,710 |
No | output | 1 | 48,855 | 4 | 97,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,985 | 4 | 97,970 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
"""T=int(input())
for _ in range(0,T):
n=int(input())
a,b=map(int,input().split())
s=input()
s=[int(x) for x in input().split()]
for i in range(0,len(s)):
a,b=map(int,input().split())"""
"""n,x=map... | output | 1 | 48,985 | 4 | 97,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,986 | 4 | 97,972 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
n,x=map(int,input().split())
d=list(map(int,input().split()))*3
d.reverse
e=[i*(i+1)//2 for i in d]
def f(a,b):
c=a-b
return (a*(a+1))//2 - (c*(c+1))//2
ss=0
ee=0
whole=d[ee]
tsol=e[ee]
while(True):
ee+=1
if ... | output | 1 | 48,986 | 4 | 97,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,987 | 4 | 97,974 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
n, x = tuple(map(int, input().split()))
arr = list(map(int, input().split()))
arr += arr[::]
arr2 = [i * (i + 1) // 2 for i in arr]
ans = 0
for now_month in range(n, n * 2):
if now_month == n:
last_month = now_mon... | output | 1 | 48,987 | 4 | 97,975 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,988 | 4 | 97,976 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
n,x=map(int,input().split())
l=list(map(int,input().split()))
l*=2
num=0
ans=0
val=0
j=0
for i in range(n):
while num<x:
num+=l[j]
val+=(l[j]*(l[j]+1)//2)
j+=1
if j==n:
j=0
... | output | 1 | 48,988 | 4 | 97,977 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,989 | 4 | 97,978 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
# from functools import lru_cache
from sys import stdin, stdout
import sys
from math import *
# sys.setrecursionlimit(10**6)
input = stdin.readline
# print = stdout.write
# @lru_cache()
n,m=map(int,input().split())
ar=list(ma... | output | 1 | 48,989 | 4 | 97,979 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,990 | 4 | 97,980 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
import bisect
n,days=map(int, input().strip().split())
arr=list(map(int, input().strip().split())); arr=arr+arr;
pre1=[0]; pre2=[0]; res=0;
for i in range(2*n):
pre1.append(pre1[-1]+arr[i]); pre2.append(pre2[-1]+(arr[i]*(ar... | output | 1 | 48,990 | 4 | 97,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,991 | 4 | 97,982 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
n,x = map(int,input().split())
arr = list(map(int,input().split()))
arr += arr
prefix = []
prefix1 = []
Sum = 0
for i in arr:
Sum += i
prefix.append(Sum)
Sum = 0
for j in arr:
Sum += (j*(j+1))//2
prefix1.append(... | output | 1 | 48,991 | 4 | 97,983 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,992 | 4 | 97,984 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
import sys, math,os
from io import BytesIO, IOBase
from bisect import bisect_left as bl, bisect_right as br, insort
#from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
#from i... | output | 1 | 48,992 | 4 | 97,985 |
Provide tags and a correct Python 2 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,993 | 4 | 97,986 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
mod=10**9+7
def ni():
return int(raw_input())
def l... | output | 1 | 48,993 | 4 | 97,987 |
Provide tags and a correct Python 2 solution for this coding contest problem.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediately decided to take a vacation and visit Corona... | instruction | 0 | 48,994 | 4 | 97,988 |
Tags: binary search, brute force, greedy, implementation, two pointers
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
mod=10**9+7
def ni():
return int(raw_input())
def l... | output | 1 | 48,994 | 4 | 97,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediat... | instruction | 0 | 48,995 | 4 | 97,990 |
Yes | output | 1 | 48,995 | 4 | 97,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediat... | instruction | 0 | 48,996 | 4 | 97,992 |
Yes | output | 1 | 48,996 | 4 | 97,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediat... | instruction | 0 | 48,997 | 4 | 97,994 |
Yes | output | 1 | 48,997 | 4 | 97,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediat... | instruction | 0 | 48,998 | 4 | 97,996 |
Yes | output | 1 | 48,998 | 4 | 97,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediat... | instruction | 0 | 48,999 | 4 | 97,998 |
No | output | 1 | 48,999 | 4 | 97,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediat... | instruction | 0 | 49,000 | 4 | 98,000 |
No | output | 1 | 49,000 | 4 | 98,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediat... | instruction | 0 | 49,001 | 4 | 98,002 |
No | output | 1 | 49,001 | 4 | 98,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've been in love with Coronavirus-chan for a long time, but you didn't know where she lived until now. And just now you found out that she lives in a faraway place called Naha.
You immediat... | instruction | 0 | 49,002 | 4 | 98,004 |
No | output | 1 | 49,002 | 4 | 98,005 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!
Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The on... | instruction | 0 | 49,318 | 4 | 98,636 |
Tags: binary search, constructive algorithms, greedy, implementation, math
Correct Solution:
```
b, d, s = map(int, input().split())
days = max(b, d, s)
print(max(0, max(days - b - 1, 0)+ max(days - d - 1, 0)+ max(days - s - 1, 0)))
``` | output | 1 | 49,318 | 4 | 98,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!
Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The on... | instruction | 0 | 49,319 | 4 | 98,638 |
Tags: binary search, constructive algorithms, greedy, implementation, math
Correct Solution:
```
b, d, s = map(int, input().split())
def avg(x, y, z):
A = [x, y, z]
A.sort()
return A[1]
print(max(max(b, d, s) - min(b, d, s) - 1, 0) + max(max(b, d, s) - avg(b, d, s) - 1, 0))
``` | output | 1 | 49,319 | 4 | 98,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!
Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The on... | instruction | 0 | 49,320 | 4 | 98,640 |
Tags: binary search, constructive algorithms, greedy, implementation, math
Correct Solution:
```
from sys import stdin
b, d, s = map(int, stdin.readline().split())
def calculate(last_meal, b, d, s):
if last_meal == 'b':
if b > d and b > s:
return (b - d - 1) + (b - s - 1)
else:
... | output | 1 | 49,320 | 4 | 98,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!
Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The on... | instruction | 0 | 49,321 | 4 | 98,642 |
Tags: binary search, constructive algorithms, greedy, implementation, math
Correct Solution:
```
con = list(map(int, input().split()))
k = 0
con.sort()
for i in range(2):
if (con[2] - 1) > con[i]:
k += ((con[2] - 1) - con[i])
print(k)
``` | output | 1 | 49,321 | 4 | 98,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation!
Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in this order). The on... | instruction | 0 | 49,322 | 4 | 98,644 |
Tags: binary search, constructive algorithms, greedy, implementation, math
Correct Solution:
```
t = list(map(int,input().split()))
a= max(t)
b= min(t)
if a-b<=1:
print(0)
else:
t.sort()
ans=(a-b-1)
if t[1]+1<t[-1]:
ans+= t[-1]-t[1]-1
print(ans)
``` | output | 1 | 49,322 | 4 | 98,645 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.