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.
Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time... | instruction | 0 | 26,195 | 4 | 52,390 |
Yes | output | 1 | 26,195 | 4 | 52,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time... | instruction | 0 | 26,196 | 4 | 52,392 |
Yes | output | 1 | 26,196 | 4 | 52,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time... | instruction | 0 | 26,197 | 4 | 52,394 |
Yes | output | 1 | 26,197 | 4 | 52,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time... | instruction | 0 | 26,198 | 4 | 52,396 |
Yes | output | 1 | 26,198 | 4 | 52,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time... | instruction | 0 | 26,199 | 4 | 52,398 |
No | output | 1 | 26,199 | 4 | 52,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time... | instruction | 0 | 26,200 | 4 | 52,400 |
No | output | 1 | 26,200 | 4 | 52,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time... | instruction | 0 | 26,201 | 4 | 52,402 |
No | output | 1 | 26,201 | 4 | 52,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time... | instruction | 0 | 26,202 | 4 | 52,404 |
No | output | 1 | 26,202 | 4 | 52,405 |
Provide a correct Python 3 solution for this coding contest problem.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the system developed by the ACM-ICPC OB / OG Association (Japa... | instruction | 0 | 26,504 | 4 | 53,008 |
"Correct Solution:
```
while True:
try:
s,y,m,d=input().split()
except:
break
if int(y)>31 or (int(y)==31 and int(m)>4):
print("?",str(int(y)-30),m,d)
else:
print(s,y,m,d)
``` | output | 1 | 26,504 | 4 | 53,009 |
Provide a correct Python 3 solution for this coding contest problem.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the system developed by the ACM-ICPC OB / OG Association (Japa... | instruction | 0 | 26,505 | 4 | 53,010 |
"Correct Solution:
```
while True:
s = input()
if s=="#":
break
g, y, m, d = s.split()
y, m, d = int(y), int(m), int(d)
if y>=32 or (y==31 and m>=5):
g = "?"
y -= 30
print(g, y, m, d)
``` | output | 1 | 26,505 | 4 | 53,011 |
Provide a correct Python 3 solution for this coding contest problem.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the system developed by the ACM-ICPC OB / OG Association (Japa... | instruction | 0 | 26,506 | 4 | 53,012 |
"Correct Solution:
```
while True :
try :
g, y, m, d = map(str, input().split())
y = int(y)
m = int(m)
d = int(d)
if(y <= 30) :
print('HEISEI', y, m, d)
elif(y == 31 and m <= 4):
print('HEISEI',y , m, d)
else:
y = y - 30
print('?', y, m, d)
except :
break
... | output | 1 | 26,506 | 4 | 53,013 |
Provide a correct Python 3 solution for this coding contest problem.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the system developed by the ACM-ICPC OB / OG Association (Japa... | instruction | 0 | 26,507 | 4 | 53,014 |
"Correct Solution:
```
while True:
s = input()
if s == "#":
break
g, y, m, d = s.split()
if int(y) >= 32:
g = "?"
y = str(int(y)-30)
elif int(y) == 31:
if int(m) >= 5:
g = "?"
y = str(int(y)-30)
print(g, y, m, d)
``` | output | 1 | 26,507 | 4 | 53,015 |
Provide a correct Python 3 solution for this coding contest problem.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the system developed by the ACM-ICPC OB / OG Association (Japa... | instruction | 0 | 26,508 | 4 | 53,016 |
"Correct Solution:
```
# 31年5月1日以降なら年号をマイナス60する
for _ in range(102):
input_str = str(input())
if (input_str[0] == '#'):
exit()
today = input_str.split()
if int(today[1]) > 31:
print(f'? {int(today[1])-30} {int(today[2])} {today[3]}')
continue
if int(today[1]) == 31 and int(t... | output | 1 | 26,508 | 4 | 53,017 |
Provide a correct Python 3 solution for this coding contest problem.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the system developed by the ACM-ICPC OB / OG Association (Japa... | instruction | 0 | 26,509 | 4 | 53,018 |
"Correct Solution:
```
ans = []
while True:
data = input().split()
g = data[0]
if g == '#':
break
y, m, d = map(int, data[1:])
if y > 30 and m > 4:
ans.append(("? %d %d %d") % (y-30, m, d))
elif y > 31:
ans.append(("? %d %d %d") % (y-30, m, d))
else:
ans.appen... | output | 1 | 26,509 | 4 | 53,019 |
Provide a correct Python 3 solution for this coding contest problem.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the system developed by the ACM-ICPC OB / OG Association (Japa... | instruction | 0 | 26,510 | 4 | 53,020 |
"Correct Solution:
```
while True:
a=list(input().split())
if(a[0]=="#"):
break
y=int(a[1])
m=int(a[2])
d=int(a[3])
if(y <= 30):
print(a[0],y,m,d)
elif(y == 31 and m<=4):
print(a[0],y,m,d)
else:
n=y-30
print("?",n,m,d)
``` | output | 1 | 26,510 | 4 | 53,021 |
Provide a correct Python 3 solution for this coding contest problem.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the system developed by the ACM-ICPC OB / OG Association (Japa... | instruction | 0 | 26,511 | 4 | 53,022 |
"Correct Solution:
```
while True:
s = input()
if s == "#": break
g, y, m, d = s.split()
if (int(y) == 31 and int(m) > 4) or int(y) > 31:
print("?", int(y)-30, m, d)
else:
print(g, y, m, d)
``` | output | 1 | 26,511 | 4 | 53,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the sy... | instruction | 0 | 26,512 | 4 | 53,024 |
Yes | output | 1 | 26,512 | 4 | 53,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the sy... | instruction | 0 | 26,513 | 4 | 53,026 |
Yes | output | 1 | 26,513 | 4 | 53,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the sy... | instruction | 0 | 26,514 | 4 | 53,028 |
Yes | output | 1 | 26,514 | 4 | 53,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the sy... | instruction | 0 | 26,515 | 4 | 53,030 |
Yes | output | 1 | 26,515 | 4 | 53,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the sy... | instruction | 0 | 26,516 | 4 | 53,032 |
No | output | 1 | 26,516 | 4 | 53,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the sy... | instruction | 0 | 26,517 | 4 | 53,034 |
No | output | 1 | 26,517 | 4 | 53,035 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the sy... | instruction | 0 | 26,518 | 4 | 53,036 |
No | output | 1 | 26,518 | 4 | 53,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Revised
The current era, Heisei, will end on April 30, 2019, and a new era will begin the next day. The day after the last day of Heisei will be May 1, the first year of the new era.
In the sy... | instruction | 0 | 26,519 | 4 | 53,038 |
No | output | 1 | 26,519 | 4 | 53,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible numbe... | instruction | 0 | 27,001 | 4 | 54,002 |
Tags: brute force, constructive algorithms, greedy, math
Correct Solution:
```
n = int(input())
print (n // 7 * 2 + max(0, n % 7 - 5), n // 7 * 2 + min(n % 7, 2))
``` | output | 1 | 27,001 | 4 | 54,003 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible numbe... | instruction | 0 | 27,002 | 4 | 54,004 |
Tags: brute force, constructive algorithms, greedy, math
Correct Solution:
```
n = int(input())
a = n // 7 * 2 + min(2, n % 7)
b = n // 7 * 2 + max(0, n % 7 - 5)
print(b, a)
``` | output | 1 | 27,002 | 4 | 54,005 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible numbe... | instruction | 0 | 27,003 | 4 | 54,006 |
Tags: brute force, constructive algorithms, greedy, math
Correct Solution:
```
# import re
# re.split(r'[;,\s]\s*', line)
n=int(input())
if n>=8:
ans1=((n-5)//7)*2 + min(2, (n-5)%7)
ans2=((n-2)//7)*2 + 2 + max(0, (n-2)%7-5)
elif n<=2:
ans1=0
ans2=n
elif n<=5:
ans1=0
ans2=2
elif n==6 :
... | output | 1 | 27,003 | 4 | 54,007 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible numbe... | instruction | 0 | 27,004 | 4 | 54,008 |
Tags: brute force, constructive algorithms, greedy, math
Correct Solution:
```
n=int(input())
o=2*(n//7)
l=n%7
if(l==0):
print(str(o)+" "+str(o))
elif(l<=5):
if(l>=2):
print(str(o)+" "+str(o+2))
else:
print(str(o) + " " + str(o + 1))
else:
print(str(o+1) + " " + str(o + 2))
``` | output | 1 | 27,004 | 4 | 54,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible numbe... | instruction | 0 | 27,005 | 4 | 54,010 |
Tags: brute force, constructive algorithms, greedy, math
Correct Solution:
```
a = [0, 0, 0, 0, 0, 0, 1]
b = [0, 1, 2, 2, 2, 2, 2]
n = int(input())
x = 2 * (n // 7) + a[n % 7]
y = 2 * (n // 7) + b[n % 7]
print(x, y)
``` | output | 1 | 27,005 | 4 | 54,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible numbe... | instruction | 0 | 27,006 | 4 | 54,012 |
Tags: brute force, constructive algorithms, greedy, math
Correct Solution:
```
import sys
if __name__ == "__main__":
n = int(sys.stdin.readline())
minimum_days_off = (n // 7) * 2 + max(n % 7 - 5, 0)
maximum_days_off = (n // 7) * 2 + min(n % 7, 2)
print(minimum_days_off, maximum_days_off)
``` | output | 1 | 27,006 | 4 | 54,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible numbe... | instruction | 0 | 27,007 | 4 | 54,014 |
Tags: brute force, constructive algorithms, greedy, math
Correct Solution:
```
n=int(input())
if n%7==1 :
max = 1+2*((n-1)//7)
min = 2*((n-1)//7)
elif n%7==2 :
max = 2+2*((n-2)//7)
min = 2*((n-2)//7)
elif n%7==3 :
max = 2+2*((n-3)//7)
min = 2*((n-3)//7)
elif n%7==4 :
max = 2+2*((n-4)//7)
... | output | 1 | 27,007 | 4 | 54,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible numbe... | instruction | 0 | 27,008 | 4 | 54,016 |
Tags: brute force, constructive algorithms, greedy, math
Correct Solution:
```
n = int(input())
div, mod = divmod(n, 7)
_min = 2 * div + max(0, mod - 5)
_max = 2 * div + min(2, mod)
print(_min, _max)
``` | output | 1 | 27,008 | 4 | 54,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the ... | instruction | 0 | 27,009 | 4 | 54,018 |
Yes | output | 1 | 27,009 | 4 | 54,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the ... | instruction | 0 | 27,010 | 4 | 54,020 |
Yes | output | 1 | 27,010 | 4 | 54,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the ... | instruction | 0 | 27,011 | 4 | 54,022 |
Yes | output | 1 | 27,011 | 4 | 54,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the ... | instruction | 0 | 27,012 | 4 | 54,024 |
Yes | output | 1 | 27,012 | 4 | 54,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the ... | instruction | 0 | 27,013 | 4 | 54,026 |
No | output | 1 | 27,013 | 4 | 54,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the ... | instruction | 0 | 27,014 | 4 | 54,028 |
No | output | 1 | 27,014 | 4 | 54,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the ... | instruction | 0 | 27,015 | 4 | 54,030 |
No | output | 1 | 27,015 | 4 | 54,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the ... | instruction | 0 | 27,016 | 4 | 54,032 |
No | output | 1 | 27,016 | 4 | 54,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently got a job as a cashier at a local store. His day at work is L minutes long. Vasya has already memorized n regular customers, the i-th of which comes after t_{i} minutes after ... | instruction | 0 | 27,421 | 4 | 54,842 |
Yes | output | 1 | 27,421 | 4 | 54,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently got a job as a cashier at a local store. His day at work is L minutes long. Vasya has already memorized n regular customers, the i-th of which comes after t_{i} minutes after ... | instruction | 0 | 27,422 | 4 | 54,844 |
Yes | output | 1 | 27,422 | 4 | 54,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently got a job as a cashier at a local store. His day at work is L minutes long. Vasya has already memorized n regular customers, the i-th of which comes after t_{i} minutes after ... | instruction | 0 | 27,423 | 4 | 54,846 |
Yes | output | 1 | 27,423 | 4 | 54,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently got a job as a cashier at a local store. His day at work is L minutes long. Vasya has already memorized n regular customers, the i-th of which comes after t_{i} minutes after ... | instruction | 0 | 27,424 | 4 | 54,848 |
Yes | output | 1 | 27,424 | 4 | 54,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently got a job as a cashier at a local store. His day at work is L minutes long. Vasya has already memorized n regular customers, the i-th of which comes after t_{i} minutes after ... | instruction | 0 | 27,425 | 4 | 54,850 |
No | output | 1 | 27,425 | 4 | 54,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently got a job as a cashier at a local store. His day at work is L minutes long. Vasya has already memorized n regular customers, the i-th of which comes after t_{i} minutes after ... | instruction | 0 | 27,426 | 4 | 54,852 |
No | output | 1 | 27,426 | 4 | 54,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently got a job as a cashier at a local store. His day at work is L minutes long. Vasya has already memorized n regular customers, the i-th of which comes after t_{i} minutes after ... | instruction | 0 | 27,427 | 4 | 54,854 |
No | output | 1 | 27,427 | 4 | 54,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has recently got a job as a cashier at a local store. His day at work is L minutes long. Vasya has already memorized n regular customers, the i-th of which comes after t_{i} minutes after ... | instruction | 0 | 27,428 | 4 | 54,856 |
No | output | 1 | 27,428 | 4 | 54,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Julia is going to cook a chicken in the kitchen of her dormitory. To save energy, the stove in the kitchen automatically turns off after k minutes after turning on.
During cooking, Julia goes t... | instruction | 0 | 28,009 | 4 | 56,018 |
Yes | output | 1 | 28,009 | 4 | 56,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Julia is going to cook a chicken in the kitchen of her dormitory. To save energy, the stove in the kitchen automatically turns off after k minutes after turning on.
During cooking, Julia goes t... | instruction | 0 | 28,011 | 4 | 56,022 |
No | output | 1 | 28,011 | 4 | 56,023 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.