message stringlengths 2 59.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 37 108k | cluster float64 20 20 | __index_level_0__ int64 74 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard ha... | instruction | 0 | 26,087 | 20 | 52,174 |
Yes | output | 1 | 26,087 | 20 | 52,175 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard ha... | instruction | 0 | 26,088 | 20 | 52,176 |
Yes | output | 1 | 26,088 | 20 | 52,177 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard ha... | instruction | 0 | 26,089 | 20 | 52,178 |
No | output | 1 | 26,089 | 20 | 52,179 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard ha... | instruction | 0 | 26,090 | 20 | 52,180 |
No | output | 1 | 26,090 | 20 | 52,181 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard ha... | instruction | 0 | 26,091 | 20 | 52,182 |
No | output | 1 | 26,091 | 20 | 52,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
While swimming at the beach, Mike has accidentally dropped his cellphone into the water. There was no worry as he bought a cheap replacement phone with an old-fashioned keyboard. The keyboard ha... | instruction | 0 | 26,092 | 20 | 52,184 |
No | output | 1 | 26,092 | 20 | 52,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This night wasn't easy on Vasya. His favorite team lost, and he didn't find himself victorious either — although he played perfectly, his teammates let him down every time. He had to win at least one more time, but the losestreak only grew l... | instruction | 0 | 26,219 | 20 | 52,438 |
Tags: brute force, combinatorics, math
Correct Solution:
```
#!/usr/bin/python3
def enc(t):
v = 0
for x in t:
v *= 20
v += x
return v
def dec(v, N):
a = []
for _ in range(N):
a.append(v % 20)
v //= 20
a.reverse()
return a
def cnt(C, ld, ud):
N = len(C... | output | 1 | 26,219 | 20 | 52,439 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This night wasn't easy on Vasya. His favorite team lost, and he didn't find himself victorious either — although he played perfectly, his teammates let him down every time. He had to win at least one more time, but the losestreak only grew l... | instruction | 0 | 26,220 | 20 | 52,440 |
Tags: brute force, combinatorics, math
Correct Solution:
```
u,t,r,s=map,sum,range,input()
a=[s.count(str(d)) for d in r(10)]
from math import factorial as f
from functools import reduce as d
from operator import mul as m
from itertools import product as p
print(t(f(t(x))//d(m,u(f,x) )-(f(t(x)-1)*x[0]//d(m,u(f,x))if x[... | output | 1 | 26,220 | 20 | 52,441 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This night wasn't easy on Vasya. His favorite team lost, and he didn't find himself victorious either — although he played perfectly, his teammates let him down every time. He had to win at least one more time, but the losestreak only grew l... | instruction | 0 | 26,222 | 20 | 52,444 |
Tags: brute force, combinatorics, math
Correct Solution:
```
import sys
S = sys.stdin.read()
#S = '''2028'''
S = int(S)
def fac(x):
if x < 2: return 1
return x * fac(x-1)
def mult(L):
i = 1
for j in L:
i *= j
return i
def comb(n, k):
return fac(n+k)/fac(n)/fac(k)
E = [0 for x in '... | output | 1 | 26,222 | 20 | 52,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This night wasn't easy on Vasya. His favorite team lost, and he didn't find himself victorious either — although he played perfectly, his teammates let him down every time. He had to win at least one more time, but the losestreak only grew l... | instruction | 0 | 26,225 | 20 | 52,450 |
Tags: brute force, combinatorics, math
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
mod = 10 ** 9 + 7
mod1 = 998244353
# ---------... | output | 1 | 26,225 | 20 | 52,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This night wasn't easy on Vasya. His favorite team lost, and he didn't find himself victorious either — although he played perfectly, his teammates let him down every time. He had to win at least one more time, but the losestreak only grew l... | instruction | 0 | 26,226 | 20 | 52,452 |
Tags: brute force, combinatorics, math
Correct Solution:
```
n=input()
rg=[0]*10
for i in n: rg[int(i)]+=1
rl=[]
ff=0
for i in range(len(rg)):
if rg[i]!=0:
rl.append(rg[i])
if i==0: ff=1
fact=[1]
fc=1
for i in range(1,20):
fc*=i
fact.append(fc)
rt=[]
t=0
def cfs(d):
if d==len(rl):
... | output | 1 | 26,226 | 20 | 52,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This night wasn't easy on Vasya. His favorite team lost, and he didn't find himself victorious either — although he played perfectly, his teammates let him down every time. He had to win at leas... | instruction | 0 | 26,227 | 20 | 52,454 |
Yes | output | 1 | 26,227 | 20 | 52,455 |
Provide a correct Python 3 solution for this coding contest problem.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word as 32 bits.
For a computer that represents one word in... | instruction | 0 | 26,411 | 20 | 52,822 |
"Correct Solution:
```
W = int(input())
bit = W * 32
print(bit)
``` | output | 1 | 26,411 | 20 | 52,823 |
Provide a correct Python 3 solution for this coding contest problem.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word as 32 bits.
For a computer that represents one word in... | instruction | 0 | 26,412 | 20 | 52,824 |
"Correct Solution:
```
print(int(input())*32)
``` | output | 1 | 26,412 | 20 | 52,825 |
Provide a correct Python 3 solution for this coding contest problem.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word as 32 bits.
For a computer that represents one word in... | instruction | 0 | 26,413 | 20 | 52,826 |
"Correct Solution:
```
print(32*int(input()))
``` | output | 1 | 26,413 | 20 | 52,827 |
Provide a correct Python 3 solution for this coding contest problem.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word as 32 bits.
For a computer that represents one word in... | instruction | 0 | 26,414 | 20 | 52,828 |
"Correct Solution:
```
def main():
stdin = int(input())
print(stdin * 32)
if __name__ == "__main__":
main()
``` | output | 1 | 26,414 | 20 | 52,829 |
Provide a correct Python 3 solution for this coding contest problem.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word as 32 bits.
For a computer that represents one word in... | instruction | 0 | 26,415 | 20 | 52,830 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
W=int(input())
n=W*32
print(n)
``` | output | 1 | 26,415 | 20 | 52,831 |
Provide a correct Python 3 solution for this coding contest problem.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word as 32 bits.
For a computer that represents one word in... | instruction | 0 | 26,416 | 20 | 52,832 |
"Correct Solution:
```
x=int(input())
y=x*32
print(y)
``` | output | 1 | 26,416 | 20 | 52,833 |
Provide a correct Python 3 solution for this coding contest problem.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word as 32 bits.
For a computer that represents one word in... | instruction | 0 | 26,417 | 20 | 52,834 |
"Correct Solution:
```
W=(int(input()))
print(W*32)
``` | output | 1 | 26,417 | 20 | 52,835 |
Provide a correct Python 3 solution for this coding contest problem.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word as 32 bits.
For a computer that represents one word in... | instruction | 0 | 26,418 | 20 | 52,836 |
"Correct Solution:
```
w=int(input())
n=w*32
print(n)
``` | output | 1 | 26,418 | 20 | 52,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word... | instruction | 0 | 26,419 | 20 | 52,838 |
Yes | output | 1 | 26,419 | 20 | 52,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word... | instruction | 0 | 26,420 | 20 | 52,840 |
Yes | output | 1 | 26,420 | 20 | 52,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The smallest unit of data handled by a computer is called a bit, and the amount of information that represents multiple bits together is called a word. Currently, many computers process one word... | instruction | 0 | 26,421 | 20 | 52,842 |
Yes | output | 1 | 26,421 | 20 | 52,843 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from the same contest and the solution of D2 solves th... | instruction | 0 | 26,637 | 20 | 53,274 |
Tags: combinatorics, math, number theory
Correct Solution:
```
import sys
import math
input = sys.stdin.readline
n=int(input())
arr=list(map(int,input().split()))
l=len(str(arr[0]))
p=998244353
ans=0
for i in range(l):
cur=0
for j in range(n):
cur+=int(str(arr[j])[i])
cur*=n
#print(cur)
ans+=cur*(10**(2*(l-i)-... | output | 1 | 26,637 | 20 | 53,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from the same contest and the solution of D2 solves th... | instruction | 0 | 26,638 | 20 | 53,276 |
Tags: combinatorics, math, number theory
Correct Solution:
```
n = int(input())
num = input().rstrip().split(" ")
ans = 0
length = [0 for _ in range(11)]
for k in num:
length[len(k)] += 1
for i in num:
check = len(i)
for j in range(11):
if check <= j:
for l in range(check):
... | output | 1 | 26,638 | 20 | 53,277 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from the same contest and the solution of D2 solves th... | instruction | 0 | 26,639 | 20 | 53,278 |
Tags: combinatorics, math, number theory
Correct Solution:
```
n = int(input())
mod = 998244353
ans = 0
ai = input().split()
lengths = [0] * 11
for i in range(n):
temp = len(ai[i])
lengths[temp] += 1
tens = [0] * 25
for i in range(25):
tens[i] = 10 ** i
for i in range(n):
temp = len(ai[i])
num = 0
... | output | 1 | 26,639 | 20 | 53,279 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from the same contest and the solution of D2 solves th... | instruction | 0 | 26,640 | 20 | 53,280 |
Tags: combinatorics, math, number theory
Correct Solution:
```
n = int(input())
s = input().split(' ')
out = 0
def f(a, b):
out = ''
for i in range(1, len(b) + 1):
out += b[len(b) - i]
out += a[len(a) - i]
return out[::-1]
for i in range(n):
out += int(f(s[i], s[i]))
out*=n
out%=... | output | 1 | 26,640 | 20 | 53,281 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from the same contest and the solution of D2 solves th... | instruction | 0 | 26,641 | 20 | 53,282 |
Tags: combinatorics, math, number theory
Correct Solution:
```
def f(a, step, mod):
i = 1;
answer = 0;
while a > 9:
c = a % 10
a //= 10
answer += (step[i] + step[i - 1]) * c % mod
i += 2
answer += (step[i] + step[i - 1]) * a % mod
return answer
def main():
an... | output | 1 | 26,641 | 20 | 53,283 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from the same contest and the solution of D2 solves th... | instruction | 0 | 26,642 | 20 | 53,284 |
Tags: combinatorics, math, number theory
Correct Solution:
```
def dig_cnt(n):
ans = 0
while n>=1:
ans += 1
n /= 10
return ans
n = int(input())
arr = [int(x) for x in input().split()]
dig_count = [0 for _ in range(11)]
for i in arr:
dig_count[dig_cnt(i)] += 1
ans = 0
mod = 998244353
for x in range(n):
gv = ... | output | 1 | 26,642 | 20 | 53,285 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from the same contest and the solution of D2 solves th... | instruction | 0 | 26,643 | 20 | 53,286 |
Tags: combinatorics, math, number theory
Correct Solution:
```
from sys import stdin, stdout, setrecursionlimit
input = stdin.readline
# setrecursionlimit(int(1e6))
inf = float('inf')
from functools import cmp_to_key
from collections import defaultdict as dd
from collections import Counter, deque
from heapq import *
im... | output | 1 | 26,643 | 20 | 53,287 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from the same contest and the solution of D2 solves th... | instruction | 0 | 26,644 | 20 | 53,288 |
Tags: combinatorics, math, number theory
Correct Solution:
```
from sys import stdin
def main():
n = int(input())
aa = input().split()
aad = [[int(ad) for ad in a] for a in aa]
sums = []
dcount = []
for a in aad:
l = len(a)
for i in range(l):
if i >= len(sums):
... | output | 1 | 26,644 | 20 | 53,289 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from th... | instruction | 0 | 26,645 | 20 | 53,290 |
Yes | output | 1 | 26,645 | 20 | 53,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from th... | instruction | 0 | 26,646 | 20 | 53,292 |
Yes | output | 1 | 26,646 | 20 | 53,293 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from th... | instruction | 0 | 26,647 | 20 | 53,294 |
Yes | output | 1 | 26,647 | 20 | 53,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from th... | instruction | 0 | 26,648 | 20 | 53,296 |
Yes | output | 1 | 26,648 | 20 | 53,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from th... | instruction | 0 | 26,649 | 20 | 53,298 |
No | output | 1 | 26,649 | 20 | 53,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from th... | instruction | 0 | 26,650 | 20 | 53,300 |
No | output | 1 | 26,650 | 20 | 53,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from th... | instruction | 0 | 26,651 | 20 | 53,302 |
No | output | 1 | 26,651 | 20 | 53,303 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This problem differs from the next one only in the presence of the constraint on the equal length of all numbers a_1, a_2, ..., a_n. Actually, this problem is a subtask of the problem D2 from th... | instruction | 0 | 26,652 | 20 | 53,304 |
No | output | 1 | 26,652 | 20 | 53,305 |
Provide tags and a correct Python 3 solution for this coding contest problem.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A... | instruction | 0 | 26,828 | 20 | 53,656 |
Tags: *special, graph matchings, implementation, trees
Correct Solution:
```
n = int(input())
A = []
sum = 0
for i in range(n):
x = int(input())
sum += x
A.append(sum/(i+1))
print('%.6f\n' % max(A))
``` | output | 1 | 26,828 | 20 | 53,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A... | instruction | 0 | 26,829 | 20 | 53,658 |
Tags: *special, graph matchings, implementation, trees
Correct Solution:
```
tux = int(input())
foo = 0
bar = 0
baz = 0
quz = 1
for i in range(0, tux):
pur = int(input())
foo += pur
bar += 1
if foo * quz > baz * bar:
baz = foo
quz = bar
print('%.6f'%(baz/quz))
``` | output | 1 | 26,829 | 20 | 53,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A... | instruction | 0 | 26,830 | 20 | 53,660 |
Tags: *special, graph matchings, implementation, trees
Correct Solution:
```
"""
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A PUR
GIMMEH PUR
PUR IS NOW A NUMBR
FOO R SUM OF FOO AN PUR
BAR R SUM OF BAR AN 1
BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ
O RLY?
YA RL... | output | 1 | 26,830 | 20 | 53,661 |
Provide tags and a correct Python 3 solution for this coding contest problem.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A... | instruction | 0 | 26,831 | 20 | 53,662 |
Tags: *special, graph matchings, implementation, trees
Correct Solution:
```
#in the name of god
#Mr_Rubik
#http://codeforces.com/problemset/problem/290/C
foo=baz=0;quz=1
for bar in range(1, int(input()) + 1):
foo+=int(input())
if foo*quz<baz*bar:
break
baz,quz=foo,bar
print(baz / quz)
... | output | 1 | 26,831 | 20 | 53,663 |
Provide tags and a correct Python 3 solution for this coding contest problem.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A... | instruction | 0 | 26,832 | 20 | 53,664 |
Tags: *special, graph matchings, implementation, trees
Correct Solution:
```
TUX = input()
FOO = 0
BAR = 0
BAZ = 0
QUZ = 1
TUX = int(TUX)
while TUX != 0:
PUR = input()
PUR = int(PUR)
FOO = FOO + PUR
BAR = BAR + 1
#if max(FOO * QUZ, BAR
if max(FOO * QUZ, BAR * BAZ) == FOO * QUZ:
#if BOTH SAEM... | output | 1 | 26,832 | 20 | 53,665 |
Provide tags and a correct Python 3 solution for this coding contest problem.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A... | instruction | 0 | 26,833 | 20 | 53,666 |
Tags: *special, graph matchings, implementation, trees
Correct Solution:
```
tux=int(input())
foo=0
bar=0
baz=0
quz=1
while tux>0:
tux-=1
pur=int(input())
foo+=pur
bar+=1
if max(foo*quz,bar*baz) == foo*quz:
baz=foo
quz=bar
print(baz/quz)
``` | output | 1 | 26,833 | 20 | 53,667 |
Provide tags and a correct Python 3 solution for this coding contest problem.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A... | instruction | 0 | 26,834 | 20 | 53,668 |
Tags: *special, graph matchings, implementation, trees
Correct Solution:
```
#in the name of god
#Mr_Rubik
#http://codeforces.com/problemset/problem/290/C
foo=baz=0;quz=1
for bar in range(1, int(input()) + 1):
foo+=int(input())
if foo*quz<baz*bar:
break
baz,quz=foo,bar
print(baz / quz)
``` | output | 1 | 26,834 | 20 | 53,669 |
Provide tags and a correct Python 3 solution for this coding contest problem.
HAI
I HAS A TUX
GIMMEH TUX
I HAS A FOO ITS 0
I HAS A BAR ITS 0
I HAS A BAZ ITS 0
I HAS A QUZ ITS 1
TUX IS NOW A NUMBR
IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0
I HAS A... | instruction | 0 | 26,835 | 20 | 53,670 |
Tags: *special, graph matchings, implementation, trees
Correct Solution:
```
foo = baz = 0
quz = 1
for bar in range(1, int(input()) + 1):
foo += int(input())
if foo * quz < baz * bar: break
baz, quz = foo, bar
print(baz / quz)
``` | output | 1 | 26,835 | 20 | 53,671 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive decimal number x.
Your task is to convert it to the "simple exponential notation".
Let x = a·10b, where 1 ≤ a < 10, then in general case the "simple exponential notation" looks like "aEb". If b equals to zero, the ... | instruction | 0 | 27,017 | 20 | 54,034 |
Tags: implementation, strings
Correct Solution:
```
s = input()
if "." not in s:
s += "."
left,right = s.strip("0").split(".")
if not left:
t = right.strip("0")
e = len(t) - len(right) - 1
l = t[0]
r = t[1:]
else:
e = len(left)-1
l = left[0]
r = (left[1:]+right).rstrip("0")
if l:
... | output | 1 | 27,017 | 20 | 54,035 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive decimal number x.
Your task is to convert it to the "simple exponential notation".
Let x = a·10b, where 1 ≤ a < 10, then in general case the "simple exponential notation" looks like "aEb". If b equals to zero, the ... | instruction | 0 | 27,018 | 20 | 54,036 |
Tags: implementation, strings
Correct Solution:
```
x = input()
pointindex = x.find('.')
if pointindex == -1:
y = x.lstrip('0')
print(y[0], end = '')
e = len(y)-1
z = y[1:].rstrip('0')
if z != '':
print('.' + z, end = '')
if e:
print('E' + str(e))
elif (x[:pointindex].lstrip('0')... | output | 1 | 27,018 | 20 | 54,037 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive decimal number x.
Your task is to convert it to the "simple exponential notation".
Let x = a·10b, where 1 ≤ a < 10, then in general case the "simple exponential notation" looks like "aEb". If b equals to zero, the ... | instruction | 0 | 27,019 | 20 | 54,038 |
Tags: implementation, strings
Correct Solution:
```
# in the name of god
import re
def get_expo(n):
result = ""
if n[len(n) - 1] == ".":
li = len(n) - 2
zeros = 0
fi = 0
while True:
if n[fi] == "0":
fi+=1
else :
break
... | output | 1 | 27,019 | 20 | 54,039 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.