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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
per nextum in unam tum XI conscribementis fac sic
vestibulo perlegementum da varo.
morde varo.
seqis cumula varum.
cis
per nextum in unam tum XI conscribementis fac sic
seqis dec... | instruction | 0 | 8,494 | 20 | 16,988 |
Tags: *special
Correct Solution:
```
from math import sqrt
f = lambda x: sqrt(abs(x))
g = lambda x: x**3*5
arr = []
for _ in range(11):
arr.append(int(input()))
arr.reverse()
for e in arr:
r = f(e)+g(e)
if 400 < r:
print("f(%d) = " % (e) + "MAGNA NIMIS!")
continue
print("f(%d) = %.2f" % ... | output | 1 | 8,494 | 20 | 16,989 |
Provide tags and a correct Python 3 solution for this coding contest problem.
per nextum in unam tum XI conscribementis fac sic
vestibulo perlegementum da varo.
morde varo.
seqis cumula varum.
cis
per nextum in unam tum XI conscribementis fac sic
seqis dec... | instruction | 0 | 8,497 | 20 | 16,994 |
Tags: *special
Correct Solution:
```
import math
def f(t):
return math.sqrt(abs(t)) + 5 * t ** 3
a = [int(input()) for _ in range(11)]
for i, t in reversed(list(enumerate(a))):
y = f(t)
if y > 400:
print('f(', t, ') = MAGNA NIMIS!', sep='')
else:
print('f(', t, ') = %.2f' % y, sep='') ... | output | 1 | 8,497 | 20 | 16,995 |
Provide tags and a correct Python 3 solution for this coding contest problem.
per nextum in unam tum XI conscribementis fac sic
vestibulo perlegementum da varo.
morde varo.
seqis cumula varum.
cis
per nextum in unam tum XI conscribementis fac sic
seqis dec... | instruction | 0 | 8,498 | 20 | 16,996 |
Tags: *special
Correct Solution:
```
from math import sqrt, pow
def f(x):
sign = 1 if x > 0 else -1 if x < 0 else 0
aresult = sqrt(abs(x))
bresult = pow(x, 3)*5
result = bresult + aresult
# result *= sign
return result
arr = []
for i in range(11):
x = int(input())
arr.append(x)
for x ... | output | 1 | 8,498 | 20 | 16,997 |
Provide tags and a correct Python 3 solution for this coding contest problem.
per nextum in unam tum XI conscribementis fac sic
vestibulo perlegementum da varo.
morde varo.
seqis cumula varum.
cis
per nextum in unam tum XI conscribementis fac sic
seqis dec... | instruction | 0 | 8,499 | 20 | 16,998 |
Tags: *special
Correct Solution:
```
from math import sqrt as s
def main():
inp = list()
for _ in range(11):
inp.append(int(input()))
for num in reversed(inp):
result = s(abs(num)) + num * num * num * 5
print(f"f({num}) = ", end = '', sep = '')
if result >= 400:
print('MAGNA NIMIS!')
else:
print('... | output | 1 | 8,499 | 20 | 16,999 |
Provide tags and a correct Python 3 solution for this coding contest problem.
per nextum in unam tum XI conscribementis fac sic
vestibulo perlegementum da varo.
morde varo.
seqis cumula varum.
cis
per nextum in unam tum XI conscribementis fac sic
seqis dec... | instruction | 0 | 8,500 | 20 | 17,000 |
Tags: *special
Correct Solution:
```
from math import sqrt
a = []
for i in range(11):
a.append(int(input()))
for i in range(10, -1, -1):
x = a[i]
aresult = sqrt(abs(x))
bresult = x * x * x * 5
result = aresult + bresult
print('f(' + str(x) + ') = ', sep='', end='')
if result >= 400:
... | output | 1 | 8,500 | 20 | 17,001 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Barbara was late for her math class so as a punishment the teacher made her solve the task on a sheet of paper. Barbara looked at the sheet of paper and only saw n numbers a_1, a_2, …, a_n without any mathematical symbols. The teacher explai... | instruction | 0 | 8,562 | 20 | 17,124 |
Tags: constructive algorithms, dp, greedy
Correct Solution:
```
# Author: yumtam
# Created at: 2020-12-28 23:43
from itertools import groupby, product
def main():
n = int(input())
ar = [int(t) for t in input().split()]
ops = set(input())
if len(ops) == 1:
ans = [ops.pop()] * (n-1)
e... | output | 1 | 8,562 | 20 | 17,125 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Barbara was late for her math class so as a punishment the teacher made her solve the task on a sheet of paper. Barbara looked at the sheet of paper and only saw n numbers a_1, a_2, …, a_n without any mathematical symbols. The teacher explai... | instruction | 0 | 8,563 | 20 | 17,126 |
Tags: constructive algorithms, dp, greedy
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
s = input()
usable = []
if "+" in s:
usable.append(0)
if "*" in s:
usable.append(1)
if "-" in s:
usable.append(2)
usable = tuple(usable)
if len(usable) == 1:
ans = [s] * (n-1)
ansPr = ... | output | 1 | 8,563 | 20 | 17,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Barbara was late for her math class so as a punishment the teacher made her solve the task on a sheet of paper. Barbara looked at the sheet of paper and only saw n numbers a_1, a_2, …, a_n without any mathematical symbols. The teacher explai... | instruction | 0 | 8,564 | 20 | 17,128 |
Tags: constructive algorithms, dp, greedy
Correct Solution:
```
# n = 10
# A = [random.randint(0, 9) for i in range(10)]
# symbols = ["+", "*"]
n = int(input())
A = list(map(int, input().split()))
symbols = list(input())
def solve1(array):
# "+" or "*"
# 2+1+1+1+1+1+2
# 2*1*1*1*2
j = 0
# we need... | output | 1 | 8,564 | 20 | 17,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Barbara was late for her math class so as a punishment the teacher made her solve the task on a sheet of paper. Barbara looked at the sheet of paper and only saw n numbers a_1, a_2, …, a_n without any mathematical symbols. The teacher explai... | instruction | 0 | 8,565 | 20 | 17,130 |
Tags: constructive algorithms, dp, greedy
Correct Solution:
```
#!/usr/bin/env python3
from itertools import accumulate, groupby
from functools import reduce
def prod(a):
return reduce(lambda x,y: min(x*y,10**6),a,1)
def solve_positive(a):
if a == '': return '+'
b = [''.join(v) for _,v in groupby(a, key=... | output | 1 | 8,565 | 20 | 17,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Barbara was late for her math class so as a punishment the teacher made her solve the task on a sheet of paper. Barbara looked at the sheet of paper and only saw n numbers a_1, a_2, …, a_n without any mathematical symbols. The teacher explai... | instruction | 0 | 8,566 | 20 | 17,132 |
Tags: constructive algorithms, dp, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int,input().split()))
ops = input().strip()
if len(ops) == 1:
print(ops.join(map(str, a)))
elif '+' in ops and '*' in ops:
seqs = [[a[0]]]
output = []
# split into seqs... | output | 1 | 8,566 | 20 | 17,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Barbara was late for her math class so as a punishment the teacher made her solve the task on a sheet of paper. Barbara looked at the sheet of paper and only saw n numbers a_1, a_2, …, a_n witho... | instruction | 0 | 8,569 | 20 | 17,138 |
No | output | 1 | 8,569 | 20 | 17,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Barbara was late for her math class so as a punishment the teacher made her solve the task on a sheet of paper. Barbara looked at the sheet of paper and only saw n numbers a_1, a_2, …, a_n witho... | instruction | 0 | 8,570 | 20 | 17,140 |
No | output | 1 | 8,570 | 20 | 17,141 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has found a piece of paper with an array written on it. The array consists of n integers a1, a2, ..., an. Vasya noticed that the following condition holds for the array ai ≤ ai + 1 ≤ 2·ai for any positive integer i (i < n).
Vasya want... | instruction | 0 | 8,609 | 20 | 17,218 |
Tags: greedy, math
Correct Solution:
```
n=int(input())
a=list(map(int,input().split(' ')))
temp_sgn=1
sgns=[]
curr_sum=0
for i in range(n):
if(curr_sum>=a[n-i-1]):
sgns.append(1)
sgns.append(-1)
curr_sum-=a[n-i-1]
else:
sgns.append(-1)
sgns.append(1)
curr_sum-=a[n-i-1]
curr_sum*=-1
sgns.reverse()
ans=... | output | 1 | 8,609 | 20 | 17,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has found a piece of paper with an array written on it. The array consists of n integers a1, a2, ..., an. Vasya noticed that the following condition holds for the array ai ≤ ai + 1 ≤ 2·ai for any positive integer i (i < n).
Vasya want... | instruction | 0 | 8,611 | 20 | 17,222 |
Tags: greedy, math
Correct Solution:
```
#!/usr/bin/python3
n = int(input())
a = list(map(int, input().split()))
s = a[-1]
ans = ['+']
for v in reversed(a[:-1]):
if s > 0:
s -= v
ans.append('-')
else:
s += v
ans.append('+')
if 0 <= s <= a[-1]:
print(''.join(reversed(ans)))
e... | output | 1 | 8,611 | 20 | 17,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has found a piece of paper with an array written on it. The array consists of n integers a1, a2, ..., an. Vasya noticed that the following condition holds for the array ai ≤ ai + 1 ≤ 2·ai for any positive integer i (i < n).
Vasya want... | instruction | 0 | 8,615 | 20 | 17,230 |
Tags: greedy, math
Correct Solution:
```
n = int(input())
t = list(map(int, input().split()))
t.reverse()
s, p = 0, [0] * n
for i, j in enumerate(t):
if s > 0:
p[i] = 1
s -= j
else: s += j
p.reverse()
if s < 0: print(''.join('-+'[i] for i in p))
else: print(''.join('+-'[i] for i in p))
``` | output | 1 | 8,615 | 20 | 17,231 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Peter wrote on the board a strictly increasing sequence of positive integers a1, a2, ..., an. Then Vasil replaced some digits in the numbers of this sequence by question marks. Thus, each question mark corresponds to exactly one lost digit.
... | instruction | 0 | 8,658 | 20 | 17,316 |
Tags: binary search, brute force, greedy, implementation
Correct Solution:
```
def solve(s, t, i, l):
if i == l:
return False
if s[i] == "?":
if solve(s, t, i + 1, l):
s[i] = t[i]
return True
elif t[i] == "9":
return False
s[i] = nxt[t[i]]
... | output | 1 | 8,658 | 20 | 17,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter wrote on the board a strictly increasing sequence of positive integers a1, a2, ..., an. Then Vasil replaced some digits in the numbers of this sequence by question marks. Thus, each questi... | instruction | 0 | 8,659 | 20 | 17,318 |
No | output | 1 | 8,659 | 20 | 17,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter wrote on the board a strictly increasing sequence of positive integers a1, a2, ..., an. Then Vasil replaced some digits in the numbers of this sequence by question marks. Thus, each questi... | instruction | 0 | 8,661 | 20 | 17,322 |
No | output | 1 | 8,661 | 20 | 17,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Peter wrote on the board a strictly increasing sequence of positive integers a1, a2, ..., an. Then Vasil replaced some digits in the numbers of this sequence by question marks. Thus, each questi... | instruction | 0 | 8,662 | 20 | 17,324 |
No | output | 1 | 8,662 | 20 | 17,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was solving arithmetical problems. He wrote down an expression a + b = c in his notebook. When the teacher checked Vasya's work it turned out that Vasya had solved the problem inco... | instruction | 0 | 8,684 | 20 | 17,368 |
No | output | 1 | 8,684 | 20 | 17,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was solving arithmetical problems. He wrote down an expression a + b = c in his notebook. When the teacher checked Vasya's work it turned out that Vasya had solved the problem inco... | instruction | 0 | 8,685 | 20 | 17,370 |
No | output | 1 | 8,685 | 20 | 17,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day Vasya was solving arithmetical problems. He wrote down an expression a + b = c in his notebook. When the teacher checked Vasya's work it turned out that Vasya had solved the problem inco... | instruction | 0 | 8,686 | 20 | 17,372 |
No | output | 1 | 8,686 | 20 | 17,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice numbers 2 and 4.
Vasya wants to split multiset s ... | instruction | 0 | 9,086 | 20 | 18,172 |
Tags: brute force, dp, greedy, implementation, math
Correct Solution:
```
from collections import Counter
n=int(input())
a=[int(o) for o in input().split()]
d=dict(Counter(a))
j=0
reserve=[]
resul=[-1]*n
for i in range(n):
if d[a[i]]==1:
if j%2==0:
resul[i]="A"
else:
resul[i]... | output | 1 | 9,086 | 20 | 18,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice numbers 2 and 4.
Vasya wants to split multiset s ... | instruction | 0 | 9,087 | 20 | 18,174 |
Tags: brute force, dp, greedy, implementation, math
Correct Solution:
```
from collections import Counter
if __name__ == '__main__':
n = int(input())
sarr = list(map(int, input().split()))
dct = Counter(sarr)
if dct.most_common(1)[0][1] == 1:
if n % 2:
print('NO')
else:
... | output | 1 | 9,087 | 20 | 18,175 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice numbers 2 and 4.
Vasya wants to split multiset s ... | instruction | 0 | 9,088 | 20 | 18,176 |
Tags: brute force, dp, greedy, implementation, math
Correct Solution:
```
from collections import Counter
n = int(input())
s = list(map(int, input().split()))
cn = Counter(s)
ones = set()
triple = set()
for key in cn.keys():
if cn[key] == 1:
ones.add(key)
if cn[key] >= 3:
triple.add(key)
l_1 = l... | output | 1 | 9,088 | 20 | 18,177 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice numbers 2 and 4.
Vasya wants to split multiset s ... | instruction | 0 | 9,089 | 20 | 18,178 |
Tags: brute force, dp, greedy, implementation, math
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
from collections import Counter,defaultdict
c=Counter(l)
l1=[]
for i in c:
if c[i]==1:
l1.append(i)
a=0
d=defaultdict(int)
for i in l1:
if a==0:
d[i]="A"
a=1
else... | output | 1 | 9,089 | 20 | 18,179 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice numbers 2 and 4.
Vasya wants to split multiset s ... | instruction | 0 | 9,090 | 20 | 18,180 |
Tags: brute force, dp, greedy, implementation, math
Correct Solution:
```
n=int(input())
s=list(map(int,input().split()))
num1=0
b=['A']*n
cnt={}
fst={}
for i in range(len(s)):
if(s[i]) in cnt:
cnt[s[i]]+=1
else:
cnt[s[i]]=1
fst[s[i]]=i
for i in range(len(s)):
if(cnt[s[i]]==1):
... | output | 1 | 9,090 | 20 | 18,181 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice numbers 2 and 4.
Vasya wants to split multiset s ... | instruction | 0 | 9,091 | 20 | 18,182 |
Tags: brute force, dp, greedy, implementation, math
Correct Solution:
```
from collections import deque
n = int(input())
arr = list(map(int, input().split(" ")))
dic = {}
for i in arr:
if i in dic:
dic[i] += 1
else:
dic[i] = 1
seta = set()
setb = set()
a = 0
b = 0
dic_ans = {}
ones = set()
twos = set()
more = ... | output | 1 | 9,091 | 20 | 18,183 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice numbers 2 and 4.
Vasya wants to split multiset s ... | instruction | 0 | 9,092 | 20 | 18,184 |
Tags: brute force, dp, greedy, implementation, math
Correct Solution:
```
n=int(input())
s=list(map(int,input().split()))
ct={}
a=[0]*(101)
for i in range(n):
ct[s[i]]=ct.get(s[i],0)+1
for i in ct:
a[ct[i]]+=1
if a[1]%2==0:
c='A'
print('YES')
ans=''
for i in range(n):
if ct[s[i]]==1:
... | output | 1 | 9,092 | 20 | 18,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice numbers 2 and 4.
Vasya wants to split multiset s ... | instruction | 0 | 9,093 | 20 | 18,186 |
Tags: brute force, dp, greedy, implementation, math
Correct Solution:
```
from collections import Counter
n=int(input())
s=list(map(int,input().split()))
sm=Counter(s)
su=set()
for i in sm.keys():
if sm[i]==1:
su.add(i)
j=-1
i=0
while i<n and j==-1:
if sm[s[i]]>=3:j=i
i+=1
if len(su)%2==1:
if j==-1:print("NO")
... | output | 1 | 9,093 | 20 | 18,187 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice num... | instruction | 0 | 9,094 | 20 | 18,188 |
Yes | output | 1 | 9,094 | 20 | 18,189 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice num... | instruction | 0 | 9,095 | 20 | 18,190 |
Yes | output | 1 | 9,095 | 20 | 18,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice num... | instruction | 0 | 9,096 | 20 | 18,192 |
Yes | output | 1 | 9,096 | 20 | 18,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice num... | instruction | 0 | 9,097 | 20 | 18,194 |
Yes | output | 1 | 9,097 | 20 | 18,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice num... | instruction | 0 | 9,098 | 20 | 18,196 |
No | output | 1 | 9,098 | 20 | 18,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice num... | instruction | 0 | 9,099 | 20 | 18,198 |
No | output | 1 | 9,099 | 20 | 18,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice num... | instruction | 0 | 9,100 | 20 | 18,200 |
No | output | 1 | 9,100 | 20 | 18,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a multiset s consisting of n integer numbers. Vasya calls some number x nice if it appears in the multiset exactly once. For example, multiset \{1, 1, 2, 3, 3, 3, 4\} contains nice num... | instruction | 0 | 9,101 | 20 | 18,202 |
No | output | 1 | 9,101 | 20 | 18,203 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Example
Input
1
Output
1 | instruction | 0 | 9,313 | 20 | 18,626 |
Tags: *special, math
Correct Solution:
```
a=int(input())
print(2-a*a)
``` | output | 1 | 9,313 | 20 | 18,627 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Example
Input
1
Output
1 | instruction | 0 | 9,314 | 20 | 18,628 |
Tags: *special, math
Correct Solution:
```
x = int(input())
print(2-(x**2))
``` | output | 1 | 9,314 | 20 | 18,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Example
Input
1
Output
1 | instruction | 0 | 9,315 | 20 | 18,630 |
Tags: *special, math
Correct Solution:
```
n = int(input())
print(2-int(n)**2)
``` | output | 1 | 9,315 | 20 | 18,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Example
Input
1
Output
1 | instruction | 0 | 9,316 | 20 | 18,632 |
Tags: *special, math
Correct Solution:
```
number=int(input())
print(2-(number)**2)
``` | output | 1 | 9,316 | 20 | 18,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Example
Input
1
Output
1 | instruction | 0 | 9,318 | 20 | 18,636 |
Tags: *special, math
Correct Solution:
```
(N,) = [int(x) for x in input().split()]
print(2 - N * N)
``` | output | 1 | 9,318 | 20 | 18,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Example
Input
1
Output
1 | instruction | 0 | 9,319 | 20 | 18,638 |
Tags: *special, math
Correct Solution:
```
import math
import sys
input = sys.stdin.readline
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input().strip()
return(list(s[:len(s)]))
def invr():
return(map(int,input().split()))
n=inp()
print(2-n**2)
... | output | 1 | 9,319 | 20 | 18,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Example
Input
1
Output
1 | instruction | 0 | 9,320 | 20 | 18,640 |
Tags: *special, math
Correct Solution:
```
#!/bin/python
from collections import Counter
from copy import deepcopy
from heapq import nlargest, nsmallest
import itertools
import math
#import os
import random
#import sys
x = int(input())
print(2 - x * x)
exit(0)
``` | output | 1 | 9,320 | 20 | 18,641 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A schoolboy Petya studies square equations. The equations that are included in the school curriculum, usually look simple:
x2 + 2bx + c = 0 where b, c are natural numbers.
Petya noticed that ... | instruction | 0 | 9,470 | 20 | 18,940 |
No | output | 1 | 9,470 | 20 | 18,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A schoolboy Petya studies square equations. The equations that are included in the school curriculum, usually look simple:
x2 + 2bx + c = 0 where b, c are natural numbers.
Petya noticed that ... | instruction | 0 | 9,471 | 20 | 18,942 |
No | output | 1 | 9,471 | 20 | 18,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A schoolboy Petya studies square equations. The equations that are included in the school curriculum, usually look simple:
x2 + 2bx + c = 0 where b, c are natural numbers.
Petya noticed that ... | instruction | 0 | 9,472 | 20 | 18,944 |
No | output | 1 | 9,472 | 20 | 18,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A schoolboy Petya studies square equations. The equations that are included in the school curriculum, usually look simple:
x2 + 2bx + c = 0 where b, c are natural numbers.
Petya noticed that ... | instruction | 0 | 9,473 | 20 | 18,946 |
No | output | 1 | 9,473 | 20 | 18,947 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today Tavas got his test result as an integer score and he wants to share it with his girlfriend, Nafas.
His phone operating system is Tavdroid, and its keyboard doesn't have any digits! He wants to share his score with Nafas via text, so h... | instruction | 0 | 9,474 | 20 | 18,948 |
Tags: brute force, implementation
Correct Solution:
```
import math
def need_to_name_it(num):
"""Returns something"""
abc = {0: "zero", 10: "ten", 1: "one", 11: "eleven", 2: "two", 12: "twelve", 20: "twenty", 3: "three",
13: "thirteen",
30: "thirty", 4: "four", 14: "fourteen", 40: "for... | output | 1 | 9,474 | 20 | 18,949 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.