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.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts a strain on the body and it is easy to catch a cold. Th... | instruction | 0 | 46,976 | 4 | 93,952 |
"Correct Solution:
```
i=0
for i in range(7):
a,b=map(int,input().split())
print(a-b)
i+=1
``` | output | 1 | 46,976 | 4 | 93,953 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts a strain on the body and it is easy to catch a cold. Th... | instruction | 0 | 46,977 | 4 | 93,954 |
"Correct Solution:
```
for i in range(7):
H,L=map(int,input().split())
print(H-L)
``` | output | 1 | 46,977 | 4 | 93,955 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts a strain on the body and it is easy to catch a cold. Th... | instruction | 0 | 46,978 | 4 | 93,956 |
"Correct Solution:
```
i=1
while i<8:
a_i,b_i=map(int,input().split())
x=a_i-b_i
print(x)
i=i+1
``` | output | 1 | 46,978 | 4 | 93,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts... | instruction | 0 | 46,979 | 4 | 93,958 |
Yes | output | 1 | 46,979 | 4 | 93,959 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts... | instruction | 0 | 46,980 | 4 | 93,960 |
Yes | output | 1 | 46,980 | 4 | 93,961 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts... | instruction | 0 | 46,981 | 4 | 93,962 |
Yes | output | 1 | 46,981 | 4 | 93,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts... | instruction | 0 | 46,982 | 4 | 93,964 |
Yes | output | 1 | 46,982 | 4 | 93,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts... | instruction | 0 | 46,983 | 4 | 93,966 |
No | output | 1 | 46,983 | 4 | 93,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts... | instruction | 0 | 46,984 | 4 | 93,968 |
No | output | 1 | 46,984 | 4 | 93,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts... | instruction | 0 | 46,985 | 4 | 93,970 |
No | output | 1 | 46,985 | 4 | 93,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. Physical condition management is important to participate in the event. It is said that at the turn of the season when the temperature fluctuates greatly, it puts... | instruction | 0 | 46,986 | 4 | 93,972 |
No | output | 1 | 46,986 | 4 | 93,973 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positive income means profit, negative income means l... | instruction | 0 | 47,157 | 4 | 94,314 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
from sys import stdin, stdout
def bn(l, mn, mx):
low = 0
high = len(l)-1
while low <= high:
mid = (low+high)//2
if l[mid] > mx:
high = mid-1
elif l[mid] < mn:
low = ... | output | 1 | 47,157 | 4 | 94,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positive income means profit, negative income means l... | instruction | 0 | 47,158 | 4 | 94,316 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import io
import os
def solve(N, A, X):
N2 = N // 2 # last half len
N1 = N - N2 # first half len
assert len(A) == N1
# Positive total can just take whole array
total = sum(A) + N2 * X
if total > 0:
... | output | 1 | 47,158 | 4 | 94,317 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positive income means profit, negative income means l... | instruction | 0 | 47,159 | 4 | 94,318 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
def main():
n = int(input())
a = list(map(int, input().split()))
Ax = int(input())
N = int((n+1)/2)
m = [0 for _ in range(N+1)]
psm = 0
for i in range(1, N+1):
psm += Ax - a[i-1]
m[i... | output | 1 | 47,159 | 4 | 94,319 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positive income means profit, negative income means l... | instruction | 0 | 47,160 | 4 | 94,320 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
# from bisect import bisect_left
N = int(input())
A = list(map(int, input().split()))
X = int(input())
# print(-1//4)
# print(N, A, X)
NS = N - len(A)
NN = len(A)
PS = [0]
for a in A:
PS.append(PS[-1]+a)
total = PS[-1] ... | output | 1 | 47,160 | 4 | 94,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positive income means profit, negative income means l... | instruction | 0 | 47,161 | 4 | 94,322 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
x = int(input())
a = [0] + a
f = list(a)
part = n // 2
sum = 0
for i in range(1, len(f)):
f[i] += f[i - 1]
sum += a[i]
sum += part * x
if sum > 0:
print(n)
e... | output | 1 | 47,161 | 4 | 94,323 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positive income means profit, negative income means l... | instruction | 0 | 47,162 | 4 | 94,324 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import os
import sys
if os.path.exists('/mnt/c/Users/Square/square/codeforces'):
f = iter(open('E.txt').readlines())
def input():
return next(f)
# input = lambda: sys.stdin.readline().strip()
else:
inp... | output | 1 | 47,162 | 4 | 94,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positive income means profit, negative income means l... | instruction | 0 | 47,163 | 4 | 94,326 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
import sys, heapq
from collections import *
from functools import lru_cache
sys.setrecursionlimit(10**6)
import operator as op
from functools import reduce
import bisect
def main():
# sys.stdin = open('input.txt', 'r')
... | output | 1 | 47,163 | 4 | 94,327 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positive income means profit, negative income means l... | instruction | 0 | 47,164 | 4 | 94,328 |
Tags: constructive algorithms, data structures, greedy, implementation
Correct Solution:
```
from bisect import *
from collections import *
from math import gcd,ceil,sqrt,floor,inf
from heapq import *
from itertools import *
from operator import add,mul,sub,xor,truediv,floordiv
from functools import *
#--------------... | output | 1 | 47,164 | 4 | 94,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positi... | instruction | 0 | 47,165 | 4 | 94,330 |
Yes | output | 1 | 47,165 | 4 | 94,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positi... | instruction | 0 | 47,166 | 4 | 94,332 |
Yes | output | 1 | 47,166 | 4 | 94,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positi... | instruction | 0 | 47,167 | 4 | 94,334 |
Yes | output | 1 | 47,167 | 4 | 94,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positi... | instruction | 0 | 47,168 | 4 | 94,336 |
Yes | output | 1 | 47,168 | 4 | 94,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positi... | instruction | 0 | 47,169 | 4 | 94,338 |
No | output | 1 | 47,169 | 4 | 94,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positi... | instruction | 0 | 47,170 | 4 | 94,340 |
No | output | 1 | 47,170 | 4 | 94,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positi... | instruction | 0 | 47,171 | 4 | 94,342 |
No | output | 1 | 47,171 | 4 | 94,343 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Levian works as an accountant in a large company. Levian knows how much the company has earned in each of the n consecutive months — in the i-th month the company had income equal to a_i (positi... | instruction | 0 | 47,172 | 4 | 94,344 |
No | output | 1 | 47,172 | 4 | 94,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can'... | instruction | 0 | 47,560 | 4 | 95,120 |
Tags: binary search, greedy, sortings
Correct Solution:
```
def check(m, mid, aa, dd, edays):
avail, ee = [True] * (m + 1), []
for i in range(mid, -1, -1):
day = edays[i]
exam = dd[day]
if avail[exam]:
avail[exam] = False
ee.append(day)
if len(ee) == m... | output | 1 | 47,560 | 4 | 95,121 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can'... | instruction | 0 | 47,561 | 4 | 95,122 |
Tags: binary search, greedy, sortings
Correct Solution:
```
def main():
n, m = map(int, input().split())
dd = list(map(int, input().split()))
aa = [0, *map(int, input().split())]
l = [True] * (m + 1)
l[0], total = False, sum(aa) + len(aa) - 2
for i, e in enumerate(dd, 1):
if l[e]:
... | output | 1 | 47,561 | 4 | 95,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can'... | instruction | 0 | 47,562 | 4 | 95,124 |
Tags: binary search, greedy, sortings
Correct Solution:
```
n, m = map(int, input().split())
a = list(map(int, input().split()))
required = list(map(int, input().split()))
visited = [False for i in range(m)]
count = 0
Sum = sum(required)
flag = False
for i in range(n):
if a[i]!=0:
if not visited[a[i]-1]:
... | output | 1 | 47,562 | 4 | 95,125 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can'... | instruction | 0 | 47,563 | 4 | 95,126 |
Tags: binary search, greedy, sortings
Correct Solution:
```
def check(i):
used = [0] * m
k = 0
for i in range(i, -1, -1):
if d[i] and not used[d[i] - 1]:
k += a[d[i] - 1]
used[d[i] - 1] = 1
elif k:
k -= 1
return (not k)
n, m = map(int, input().sp... | output | 1 | 47,563 | 4 | 95,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can'... | instruction | 0 | 47,564 | 4 | 95,128 |
Tags: binary search, greedy, sortings
Correct Solution:
```
from collections import defaultdict
def get_last_exam_day(D, limit):
last_exam_day = defaultdict(int)
for i,m in enumerate(D):
if (i > limit):
break
if (m != 0):
last_exam_day[m] = i
return last_exam_day
d... | output | 1 | 47,564 | 4 | 95,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can'... | instruction | 0 | 47,565 | 4 | 95,130 |
Tags: binary search, greedy, sortings
Correct Solution:
```
import math
global n,m,d,a
d=[]
a=[]
def intdec(x):
return int(x)-1
def check(x):
global n,m,d,a
vis=[0]*m
seq=[]
h=0; cnt=0
for i in range(x,-1,-1):
if d[i]<0 or vis[d[i]]:
if len(seq)<=h:
pass
... | output | 1 | 47,565 | 4 | 95,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can'... | instruction | 0 | 47,566 | 4 | 95,132 |
Tags: binary search, greedy, sortings
Correct Solution:
```
#!/usr/bin/env python3
from sys import stdin,stdout
def ri():
return map(int, stdin.readline().split())
def solve(ee):
dest = [-1 for i in range(m)]
for i in range(ee, -1, -1):
if d[i] != -1 and dest[d[i]] == -1:
dest[d[i]] = ... | output | 1 | 47,566 | 4 | 95,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can'... | instruction | 0 | 47,567 | 4 | 95,134 |
Tags: binary search, greedy, sortings
Correct Solution:
```
import sys
n,m=map(int,input().split())
di=list(map(int,input().split()))
ai=list(map(int,input().split()))
check=[False]*m
temp=0
summ=sum(ai)+m
for i in range(n):
if di[i]==0:
continue
else:
if not check[di[i]-1]:
if ai[di[i]-1]<=i:
... | output | 1 | 47,567 | 4 | 95,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be... | instruction | 0 | 47,568 | 4 | 95,136 |
Yes | output | 1 | 47,568 | 4 | 95,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be... | instruction | 0 | 47,569 | 4 | 95,138 |
Yes | output | 1 | 47,569 | 4 | 95,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be... | instruction | 0 | 47,570 | 4 | 95,140 |
Yes | output | 1 | 47,570 | 4 | 95,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be... | instruction | 0 | 47,571 | 4 | 95,142 |
Yes | output | 1 | 47,571 | 4 | 95,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be... | instruction | 0 | 47,572 | 4 | 95,144 |
No | output | 1 | 47,572 | 4 | 95,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be... | instruction | 0 | 47,573 | 4 | 95,146 |
No | output | 1 | 47,573 | 4 | 95,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be... | instruction | 0 | 47,574 | 4 | 95,148 |
No | output | 1 | 47,574 | 4 | 95,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be... | instruction | 0 | 47,575 | 4 | 95,150 |
No | output | 1 | 47,575 | 4 | 95,151 |
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,784 | 4 | 95,568 |
"Correct Solution:
```
str = input()
print('2018/' + str[5:])
``` | output | 1 | 47,784 | 4 | 95,569 |
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,785 | 4 | 95,570 |
"Correct Solution:
```
s=input()
t="2018"+s[4:]
print(t)
``` | output | 1 | 47,785 | 4 | 95,571 |
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,786 | 4 | 95,572 |
"Correct Solution:
```
s = input()
print(s.replace('7', '8', 1))
``` | output | 1 | 47,786 | 4 | 95,573 |
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,787 | 4 | 95,574 |
"Correct Solution:
```
s = input()
print(s[:3]+'8'+s[-6:])
``` | output | 1 | 47,787 | 4 | 95,575 |
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,788 | 4 | 95,576 |
"Correct Solution:
```
a = input()
print(a[:3]+'8'+a[4:])
``` | output | 1 | 47,788 | 4 | 95,577 |
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,789 | 4 | 95,578 |
"Correct Solution:
```
s = input()
x = "2018" + s[4:]
print(x)
``` | output | 1 | 47,789 | 4 | 95,579 |
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,790 | 4 | 95,580 |
"Correct Solution:
```
s=input();print(s[:3]+'8'+s[4:])
``` | output | 1 | 47,790 | 4 | 95,581 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.