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.
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it... | instruction | 0 | 86,050 | 4 | 172,100 |
No | output | 1 | 86,050 | 4 | 172,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it... | instruction | 0 | 86,051 | 4 | 172,102 |
No | output | 1 | 86,051 | 4 | 172,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it... | instruction | 0 | 86,052 | 4 | 172,104 |
No | output | 1 | 86,052 | 4 | 172,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.
Vasily has a candles.When Vasily lights up a new candle, it first burns for an hour and then it... | instruction | 0 | 86,053 | 4 | 172,106 |
No | output | 1 | 86,053 | 4 | 172,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of... | instruction | 0 | 86,255 | 4 | 172,510 |
Yes | output | 1 | 86,255 | 4 | 172,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of... | instruction | 0 | 86,256 | 4 | 172,512 |
Yes | output | 1 | 86,256 | 4 | 172,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of... | instruction | 0 | 86,257 | 4 | 172,514 |
Yes | output | 1 | 86,257 | 4 | 172,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of... | instruction | 0 | 86,258 | 4 | 172,516 |
Yes | output | 1 | 86,258 | 4 | 172,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of... | instruction | 0 | 86,259 | 4 | 172,518 |
No | output | 1 | 86,259 | 4 | 172,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of... | instruction | 0 | 86,261 | 4 | 172,522 |
No | output | 1 | 86,261 | 4 | 172,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba has got n buckets, the i-th bucket allows her to water some continuous subsegment of garden of... | instruction | 0 | 86,262 | 4 | 172,524 |
No | output | 1 | 86,262 | 4 | 172,525 |
Provide a correct Python 3 solution for this coding contest problem.
You are the God of Wind.
By moving a big cloud around, you can decide the weather: it invariably rains under the cloud, and the sun shines everywhere else.
But you are a benign God: your goal is to give enough rain to every field in the countryside... | instruction | 0 | 86,489 | 4 | 172,978 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int... | output | 1 | 86,489 | 4 | 172,979 |
Provide a correct Python 3 solution for this coding contest problem.
You are the God of Wind.
By moving a big cloud around, you can decide the weather: it invariably rains under the cloud, and the sun shines everywhere else.
But you are a benign God: your goal is to give enough rain to every field in the countryside... | instruction | 0 | 86,490 | 4 | 172,980 |
"Correct Solution:
```
from collections import deque
while True:
n=int(input())
if n==0:
exit()
data = []
for i in range(n):
tmp = list(map(int,input().split()))
tmp = [tmp[:4],tmp[4:8],tmp[8:12],tmp[12:]]
d = [ [0 for i in range(3)]for i in range(3)]
for i in ran... | output | 1 | 86,490 | 4 | 172,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assume that Vova woke up exactly at the beginning o... | instruction | 0 | 86,753 | 4 | 173,506 |
Tags: dp, implementation
Correct Solution:
```
n, h, l, r = map(int, input().split())
a = list(map(int, input().split()))
cursum = [0] * (n + 1)
for i in range(n):
cursum[i + 1] += cursum[i] + a[i]
cursum[i + 1] %= h
dp = [[0] * (n + 1) for i in range(n + 1)]
for i in range(n):
for j in range(i + 1):
... | output | 1 | 86,753 | 4 | 173,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assume that Vova woke up exactly at the beginning o... | instruction | 0 | 86,754 | 4 | 173,508 |
Tags: dp, implementation
Correct Solution:
```
z=lambda:map(int,input().split());a,b,c,d=z();e=[-10000000000]*b;f=list(map(int,input().split()));e[0]=0
for i in range(a):
k=[]
for j in range(b):
o=max(e[(j-f[i])%b],e[(j-f[i]+1)%b])
if c<=j<=d:o+=1
k+=[o]
e=k
print(max(e))
``` | output | 1 | 86,754 | 4 | 173,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assume that Vova woke up exactly at the beginning o... | instruction | 0 | 86,755 | 4 | 173,510 |
Tags: dp, implementation
Correct Solution:
```
n, h, l, r = map(int, input().split())
a = list(map(int, input().split()))
cur = [-3000] * h
cur[0] = 0
for x in a:
new = []
for i in range(h):
f = max(cur[(i-x)%h], cur[(i-x+1)%h])
if l<=i<=r:
f += 1
new += [f]
cur = new
... | output | 1 | 86,755 | 4 | 173,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assume that Vova woke up exactly at the beginning o... | instruction | 0 | 86,756 | 4 | 173,512 |
Tags: dp, implementation
Correct Solution:
```
# https://codeforces.com/problemset/problem/1324/E
n, h,l,r = list(map(int,input().strip().split()))
arr = list(map(int,input().strip().split()))
dp_arr = [[0 for j in range(h)] for i in range(n+1)]
pre_set = set([0])
for i in range(n):
# print(arr[i],pre_set)
te... | output | 1 | 86,756 | 4 | 173,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assume that Vova woke up exactly at the beginning o... | instruction | 0 | 86,757 | 4 | 173,514 |
Tags: dp, implementation
Correct Solution:
```
n, h, l, r = map(int, input().split())
a = list(map(int, input().split()))
MINN = -int(1e9)
dp = [[MINN] * (n + 1) for i in range(n + 1)]
dp[0][0] = 0
s = 0
for i in range(n):
s += a[i]
for j in range(n + 1):
dp[i + 1][j] = max(dp[i + 1][j],dp[i][j] + int((... | output | 1 | 86,757 | 4 | 173,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assume that Vova woke up exactly at the beginning o... | instruction | 0 | 86,758 | 4 | 173,516 |
Tags: dp, implementation
Correct Solution:
```
n, h, l, r = map(int, input().split())
dp = [[0] * h for _ in range(n + 1)]
possible = [set() for i in range(n + 1)]
possible[0].add(0)
for i, length in zip(range(1, n + 1), map(int, input().split())):
for time in possible[i - 1]:
trans0 = (time + length) % h
... | output | 1 | 86,758 | 4 | 173,517 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assume that Vova woke up exactly at the beginning o... | instruction | 0 | 86,759 | 4 | 173,518 |
Tags: dp, implementation
Correct Solution:
```
n,h,l,r=map(int,input().split())
a=list(map(int,input().split()))
b=[a[0]]
for i in a[1:]:b.append(b[-1]+i)
dp=[(n+1)*[0]for _ in range(n)]
if l<=a[0]<=r:dp[0][0]=1
if l<=a[0]-1<=r:dp[0][1]=1
for i in range(1,n):
for j in range(i+2):
if j==0:
dp[i][j]=dp[i-1][j... | output | 1 | 86,759 | 4 | 173,519 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assume that Vova woke up exactly at the beginning o... | instruction | 0 | 86,760 | 4 | 173,520 |
Tags: dp, implementation
Correct Solution:
```
from math import *
n, h, l, r = map(int, input().split())
a = [int(i) for i in input().split()]
dp = []
for i in range(n):
dp.append([0] * (n+1))
s = sum(a)
for i in range(n - 1, -1, -1):
for j in range(i + 2):
if r >= (s - j) % h >= l:
dp[i]... | output | 1 | 86,760 | 4 | 173,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assu... | instruction | 0 | 86,761 | 4 | 173,522 |
Yes | output | 1 | 86,761 | 4 | 173,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assu... | instruction | 0 | 86,762 | 4 | 173,524 |
Yes | output | 1 | 86,762 | 4 | 173,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assu... | instruction | 0 | 86,763 | 4 | 173,526 |
Yes | output | 1 | 86,763 | 4 | 173,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assu... | instruction | 0 | 86,764 | 4 | 173,528 |
Yes | output | 1 | 86,764 | 4 | 173,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assu... | instruction | 0 | 86,765 | 4 | 173,530 |
No | output | 1 | 86,765 | 4 | 173,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assu... | instruction | 0 | 86,766 | 4 | 173,532 |
No | output | 1 | 86,766 | 4 | 173,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assu... | instruction | 0 | 86,767 | 4 | 173,534 |
No | output | 1 | 86,767 | 4 | 173,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova had a pretty weird sleeping schedule. There are h hours in a day. Vova will sleep exactly n times. The i-th time he will sleep exactly after a_i hours from the time he woke up. You can assu... | instruction | 0 | 86,768 | 4 | 173,536 |
No | output | 1 | 86,768 | 4 | 173,537 |
Provide a correct Python 3 solution for this coding contest problem.
D: Sunburn-Suntan-
story
Aizunyan is a second-year student who belongs to the programming contest club of Wakagamatsu High School, commonly known as the Prokon club. Cute like an angel. Aizu Nyan is planning to participate in this summer festival, ... | instruction | 0 | 87,478 | 4 | 174,956 |
"Correct Solution:
```
# AOJ 2801: Suntan
# Python3 2018.7.11 bal4u
from bisect import bisect_left
T, N = int(input()), int(input())
a, s, t = [0], [0], [0]
for i in range(N):
_s, _t = map(int, input().split())
s.append(_s)
t.append(_t)
a.append(a[-1]+_t-_s)
s.append(1<<62)
t.append(1<<62)
ans = 0
k = bisect_left... | output | 1 | 87,478 | 4 | 174,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha has many hamsters and he makes them work out. Today, n hamsters (n is even) came to work out. The hamsters lined up and each hamster either sat down or stood up.
For another exercise, Pasha needs exactly <image> hamsters to stand up a... | instruction | 0 | 87,916 | 4 | 175,832 |
Tags: implementation
Correct Solution:
```
import sys
from functools import reduce
from collections import Counter
import time
import datetime
from math import sqrt,gcd
# def time_t():
# print("Current date and time: " , datetime.datetime.now())
# print("Current year: ", datetime.date.today().strftime("%Y"))
#... | output | 1 | 87,916 | 4 | 175,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan has n pens. Every day he uses them, and on the i-th day he uses the pen number i. On the (n + 1)-th day again he uses the pen number 1, on the (n + 2)-th — he uses the pen number 2 and so on.
On every working day (from Monday to Satu... | instruction | 0 | 88,031 | 4 | 176,062 |
Tags: *special, binary search, number theory
Correct Solution:
```
import sys
def Min(x, y):
if x > y:
return y
else:
return x
def Gcd(x, y):
if x == 0:
return y
else:
return Gcd(y % x, x)
def Lcm(x, y):
return x * y // Gcd(x, y)
n = int(input())
a = [int(i) for i... | output | 1 | 88,031 | 4 | 176,063 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has n pens. Every day he uses them, and on the i-th day he uses the pen number i. On the (n + 1)-th day again he uses the pen number 1, on the (n + 2)-th — he uses the pen number 2 and so... | instruction | 0 | 88,032 | 4 | 176,064 |
No | output | 1 | 88,032 | 4 | 176,065 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has n pens. Every day he uses them, and on the i-th day he uses the pen number i. On the (n + 1)-th day again he uses the pen number 1, on the (n + 2)-th — he uses the pen number 2 and so... | instruction | 0 | 88,033 | 4 | 176,066 |
No | output | 1 | 88,033 | 4 | 176,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has n pens. Every day he uses them, and on the i-th day he uses the pen number i. On the (n + 1)-th day again he uses the pen number 1, on the (n + 2)-th — he uses the pen number 2 and so... | instruction | 0 | 88,034 | 4 | 176,068 |
No | output | 1 | 88,034 | 4 | 176,069 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
Input
The input is a sequence of datasets. The end of t... | instruction | 0 | 88,263 | 4 | 176,526 |
"Correct Solution:
```
# Aizu Problem 0027: What day is today?
#
import sys, math, os, datetime
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
DAY = ["Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"]
while True:
m, d = [i... | output | 1 | 88,263 | 4 | 176,527 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
Input
The input is a sequence of datasets. The end of t... | instruction | 0 | 88,264 | 4 | 176,528 |
"Correct Solution:
```
from datetime import date
week=["Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"]
while True:
a,b=map(int,input().split())
if a==0:
break
print(week[date(2004,a,b).weekday()])
``` | output | 1 | 88,264 | 4 | 176,529 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
Input
The input is a sequence of datasets. The end of t... | instruction | 0 | 88,265 | 4 | 176,530 |
"Correct Solution:
```
# -*- coding:utf-8 -*-
import datetime
def main(a, b):
dt = datetime.datetime(2004, a, b)
week_num = dt.weekday()
if week_num == 0:
print('Monday')
elif week_num == 1:
print('Tuesday')
elif week_num == 2:
print('Wednesday')
elif week_num == 3:
... | output | 1 | 88,265 | 4 | 176,531 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
Input
The input is a sequence of datasets. The end of t... | instruction | 0 | 88,266 | 4 | 176,532 |
"Correct Solution:
```
import datetime
for e in iter(input,'0 0'):print(['Mon','Tues','Wednes','Thurs','Fri','Satur','Sun'][datetime.date(2004,*map(int,e.split())).weekday()]+'day')
``` | output | 1 | 88,266 | 4 | 176,533 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
Input
The input is a sequence of datasets. The end of t... | instruction | 0 | 88,267 | 4 | 176,534 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def convert(y, m, d):
if m <= 2:
m += 12
y -= 1
mjd = int(365.25*y) + (y//400) - (y//100) + int(30.59*(m-2)) + d - 678912
return mjd
youbi = [
"Monday",
"Tuesday",
"Wednesday",
"Thursda... | output | 1 | 88,267 | 4 | 176,535 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
Input
The input is a sequence of datasets. The end of t... | instruction | 0 | 88,268 | 4 | 176,536 |
"Correct Solution:
```
ndays = [31,29,31,30,31,30,31,31,30,31,30,31]
days = ["Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"]
offset = 3
while(1):
m,d = [int(i) for i in input().split()]
if m == 0 and d == 0:
break
tot_d = sum(ndays[:m-1]) + d
print(days[(tot_d + offset - 1)%7])
``... | output | 1 | 88,268 | 4 | 176,537 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
Input
The input is a sequence of datasets. The end of t... | instruction | 0 | 88,269 | 4 | 176,538 |
"Correct Solution:
```
while(True):
m,d = map(int,input().split())
if m==0 and d==0:
break
dn = sum([[31,29,31,30,31,30,31,31,30,31,30,31][a] for a in range(m-1)]) + d-1
print(["Thursday","Friday","Saturday","Sunday","Monday","Tuesday","Wednesday"][dn%7])
``` | output | 1 | 88,269 | 4 | 176,539 |
Provide a correct Python 3 solution for this coding contest problem.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
Input
The input is a sequence of datasets. The end of t... | instruction | 0 | 88,270 | 4 | 176,540 |
"Correct Solution:
```
# AOJ 0027 What day is today?
# Python3 2018.6.11 bal4u
def Zeller(y, m, d):
if m == 1 or m == 2:
y -= 1
m += 12
return (y + y//4 - y//100 + y//400 + (13*m + 8)//5 + d) % 7
import sys
week = ["Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"]
... | output | 1 | 88,270 | 4 | 176,541 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
... | instruction | 0 | 88,271 | 4 | 176,542 |
Yes | output | 1 | 88,271 | 4 | 176,543 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
... | instruction | 0 | 88,272 | 4 | 176,544 |
Yes | output | 1 | 88,272 | 4 | 176,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
... | instruction | 0 | 88,273 | 4 | 176,546 |
Yes | output | 1 | 88,273 | 4 | 176,547 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
... | instruction | 0 | 88,274 | 4 | 176,548 |
Yes | output | 1 | 88,274 | 4 | 176,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
... | instruction | 0 | 88,275 | 4 | 176,550 |
No | output | 1 | 88,275 | 4 | 176,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
... | instruction | 0 | 88,276 | 4 | 176,552 |
No | output | 1 | 88,276 | 4 | 176,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Your task is to write a program which reads a date (from 2004/1/1 to 2004/12/31) and prints the day of the date. Jan. 1, 2004, is Thursday. Note that 2004 is a leap year and we have Feb. 29.
... | instruction | 0 | 88,277 | 4 | 176,554 |
No | output | 1 | 88,277 | 4 | 176,555 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.