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.
Consider the infinite sequence of integers: 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5.... The sequence is built in the following way: at first the number 1 is written out, then the numbers from 1 to 2, then the numbers from 1 to 3, then th... | instruction | 0 | 59,289 | 20 | 118,578 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
r=int((-1+((1+8*n)**.5))//2)
print(r if n-r*(r+1)//2==0 else n-r*(r+1)//2)
``` | output | 1 | 59,289 | 20 | 118,579 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The only line of the input contains a string of digits. The length of the string is between 1 and 10, inclusive.
Output
Output "Yes" or "No".
Examples
Input
373
Output
Yes
Input
121
Output
No
Input
436
Output
Yes | instruction | 0 | 59,349 | 20 | 118,698 |
Tags: *special, implementation
Correct Solution:
```
mp = [ 8, -1, -1, 3, 6, 9, 4, 7, 0, 5 ]
str = input()
for i in range( len( str ) ):
if ord( str[ i ] ) - ord( '0' ) != mp[ ord( str[ len( str ) - 1 - i ] ) - ord( '0' ) ]:
exit( print( "No" ) )
print( "Yes" )
``` | output | 1 | 59,349 | 20 | 118,699 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The only line of the input contains a string of digits. The length of the string is between 1 and 10, inclusive.
Output
Output "Yes" or "No".
Examples
Input
373
Output
Yes
Input
121
Output
No
Input
436
Output
Yes | instruction | 0 | 59,350 | 20 | 118,700 |
Tags: *special, implementation
Correct Solution:
```
n = input()
for i in range(len(n)):
if (n[i] == '1' or n[i] == '2'):
print("No")
exit(0)
elif ((n[i] == '3' or n[i] == '7') and n[-i - 1] != n[i]):
print("No")
exit(0)
elif (n[i] == '4' and n[-i - 1] != '6'):
print("No")
exit(0)
elif (n[i] == '6' and... | output | 1 | 59,350 | 20 | 118,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The only line of the input contains a string of digits. The length of the string is between 1 and 10, inclusive.
Output
Output "Yes" or "No".
Examples
Input
373
Output
Yes
Input
121
Output
No
Input
436
Output
Yes | instruction | 0 | 59,351 | 20 | 118,702 |
Tags: *special, implementation
Correct Solution:
```
s=input()
s1=''
for i in s:
if i=='0':
s1+='8'
elif i=='1':
s1+=''
elif i=='2':
s1+=''
elif i=='3':
s1+='3'
elif i=='4':
s1+='6'
elif i=='5':
s1+='9'
elif i=='6':
s1+='4'
elif i==... | output | 1 | 59,351 | 20 | 118,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The only line of the input contains a string of digits. The length of the string is between 1 and 10, inclusive.
Output
Output "Yes" or "No".
Examples
Input
373
Output
Yes
Input
121
Output
No
Input
436
Output
Yes | instruction | 0 | 59,352 | 20 | 118,704 |
Tags: *special, implementation
Correct Solution:
```
a=input()
d={"0":"8","1":"-","2":"-","3":"3","4":"6","5":"9","6":"4","7":"7","8":"0","9":"5"}
for i in range(len(a)):
if d[a[i]]!=a[len(a)-i-1]:
print("No")
exit(0)
print("Yes")
``` | output | 1 | 59,352 | 20 | 118,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The only line of the input contains a string of digits. The length of the string is between 1 and 10, inclusive.
Output
Output "Yes" or "No".
Examples
Input
373
Output
Yes
Input
121
Output
No
Input
436
Output
Yes | instruction | 0 | 59,353 | 20 | 118,706 |
Tags: *special, implementation
Correct Solution:
```
m={}
m['0']='8'
m['1']='x'
m['2']='x'
m['3']='3'
m['4']='6'
m['5']='9'
m['6']='4'
m['7']='7'
m['8']='0'
m['9']='5'
x = list(input())
y = list(reversed([m[c] for c in x]))
print('Yes' if x==y else 'No')
``` | output | 1 | 59,353 | 20 | 118,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The only line of the input contains a string of digits. The length of the string is between 1 and 10, inclusive.
Output
Output "Yes" or "No".
Examples
Input
373
Output
Yes
Input
121
Output
No
Input
436
Output
Yes | instruction | 0 | 59,354 | 20 | 118,708 |
Tags: *special, implementation
Correct Solution:
```
# β β β β β β β β β β
# 1234567890
R = [
("1", "' "),
("2", ": "),
("3", "''"),
("4", "':"),
("5", "'."),
("6", ":'"),
("7", "::"),
("8", ":."),
("9", ".'"),
("0", ".:"),
]
s = input()
for a,b in R:
s = s.replace(a,b)
print("Yes" ... | output | 1 | 59,354 | 20 | 118,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The only line of the input contains a string of digits. The length of the string is between 1 and 10, inclusive.
Output
Output "Yes" or "No".
Examples
Input
373
Output
Yes
Input
121
Output
No
Input
436
Output
Yes | instruction | 0 | 59,355 | 20 | 118,710 |
Tags: *special, implementation
Correct Solution:
```
a={'3':'3','4':'6','6':'4','5':'9','9':'5','7':'7','8':'0','0':'8','1':'x','2':'x'}
s=input()
f=1
for i in range(len(s)):
if s[i]!=a[s[len(s)-i-1]]:f=0
if f:print("Yes")
else:print("No")
``` | output | 1 | 59,355 | 20 | 118,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Input
The only line of the input contains a string of digits. The length of the string is between 1 and 10, inclusive.
Output
Output "Yes" or "No".
Examples
Input
373
Output
Yes
Input
121
Output
No
Input
436
Output
Yes | instruction | 0 | 59,356 | 20 | 118,712 |
Tags: *special, implementation
Correct Solution:
```
import sys
import time
for line in sys.stdin:
ll = len(line) - 1
fail = 0
for i in range(ll):
if i == ll - 1 - i:
if int(line[i]) not in [3, 7]:
fail = 1
continue
x = int(line[i])
y = int(li... | output | 1 | 59,356 | 20 | 118,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not allowed.
Numbers in this system are written as ... | instruction | 0 | 59,415 | 20 | 118,830 |
Tags: brute force, combinatorics, dp, greedy, math
Correct Solution:
```
non_representable = {
1: 46,
2: 89,
3: 128,
4: 162,
5: 190,
6: 212,
7: 228,
8: 238,
9: 244,
10: 247,
}
n = int(input())
print(49 * n + 1 - non_representable.get(n, 248))
``` | output | 1 | 59,415 | 20 | 118,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not allowed.
Numbers in this system are written as ... | instruction | 0 | 59,416 | 20 | 118,832 |
Tags: brute force, combinatorics, dp, greedy, math
Correct Solution:
```
def c(n):
ans = 0
if n > 15:
ans += (49 * (n - 15))
n = 15
l = set()
for i in range(max(n+1,441)):
for j in range(max(n-i+1,196)):
for k in range(n-i-j+1):
l.add(i*4+j*9+k*49... | output | 1 | 59,416 | 20 | 118,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not allowed.
Numbers in this system are written as ... | instruction | 0 | 59,417 | 20 | 118,834 |
Tags: brute force, combinatorics, dp, greedy, math
Correct Solution:
```
def answer(n):
# brute-force
sums = set()
for d1 in range(n + 1):
for d5 in range(n + 1 - d1):
for d10 in range(n + 1 - d1 - d5):
d50 = n - d1 - d5 - d10
sums.add(d1 * 1 + d5 * 5 + d1... | output | 1 | 59,417 | 20 | 118,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not allowed.
Numbers in this system are written as ... | instruction | 0 | 59,418 | 20 | 118,836 |
Tags: brute force, combinatorics, dp, greedy, math
Correct Solution:
```
x=[0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292]
n=int(input())
print(x[n] if n<=11 else 292+(n-11)*49)
``` | output | 1 | 59,418 | 20 | 118,837 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not allowed.
Numbers in this system are written as ... | instruction | 0 | 59,419 | 20 | 118,838 |
Tags: brute force, combinatorics, dp, greedy, math
Correct Solution:
```
a=[0,4,10,20,35,56,83,116,155,198,244]
n=int(input())
if n<=10:
print(a[n])
else:
print(49*n-247)
``` | output | 1 | 59,419 | 20 | 118,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not allowed.
Numbers in this system are written as ... | instruction | 0 | 59,420 | 20 | 118,840 |
Tags: brute force, combinatorics, dp, greedy, math
Correct Solution:
```
from collections import defaultdict
n = int(input())
if n > 11:
print(292 + 49 * (n - 11))
else:
d = defaultdict(list)
for L in range(n + 1):
for X in range(n + 1 - L):
for V in range(n + 1 - X - L):
... | output | 1 | 59,420 | 20 | 118,841 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not allowed.
Numbers in this system are written as ... | instruction | 0 | 59,421 | 20 | 118,842 |
Tags: brute force, combinatorics, dp, greedy, math
Correct Solution:
```
ans = [1, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341, 390, 439]
n = int(input())
if (n < 12):
print(ans[n])
else:
print(292 + (n - 11) * 49)
``` | output | 1 | 59,421 | 20 | 118,843 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not allowed.
Numbers in this system are written as ... | instruction | 0 | 59,422 | 20 | 118,844 |
Tags: brute force, combinatorics, dp, greedy, math
Correct Solution:
```
n = int(input())
if n < 20:
q = []
i = 0
while i <= n:
j = 0
while j <= n-i:
k = 0
while k <= n-i-j:
t = n - i - j - k
q.append(i*1+j*5+k*10+t*50)
... | output | 1 | 59,422 | 20 | 118,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not a... | instruction | 0 | 59,423 | 20 | 118,846 |
Yes | output | 1 | 59,423 | 20 | 118,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not a... | instruction | 0 | 59,424 | 20 | 118,848 |
Yes | output | 1 | 59,424 | 20 | 118,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not a... | instruction | 0 | 59,425 | 20 | 118,850 |
Yes | output | 1 | 59,425 | 20 | 118,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not a... | instruction | 0 | 59,426 | 20 | 118,852 |
Yes | output | 1 | 59,426 | 20 | 118,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not a... | instruction | 0 | 59,427 | 20 | 118,854 |
No | output | 1 | 59,427 | 20 | 118,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not a... | instruction | 0 | 59,428 | 20 | 118,856 |
No | output | 1 | 59,428 | 20 | 118,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not a... | instruction | 0 | 59,429 | 20 | 118,858 |
No | output | 1 | 59,429 | 20 | 118,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers 1, 5, 10 and 50 respectively. The use of other roman digits is not a... | instruction | 0 | 59,430 | 20 | 118,860 |
No | output | 1 | 59,430 | 20 | 118,861 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:
* f(0) = 0;
* f(2Β·x) = f(x);
* f(2Β·x +... | instruction | 0 | 60,055 | 20 | 120,110 |
Tags: implementation, math
Correct Solution:
```
def f(x):
return str(bin(x)).count('1')
n = int(input())
a = list(map(int, input().split()))
ans = [f(x) for x in a]
# print(ans)
s = set(ans)
counts = {x:ans.count(x) for x in s}
# print(counts)
count = 0
for item in counts:
count += (counts[item]*(counts[item]-1)... | output | 1 | 60,055 | 20 | 120,111 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:
* f(0) = 0;
* f(2Β·x) = f(x);
* f(2Β·x +... | instruction | 0 | 60,056 | 20 | 120,112 |
Tags: implementation, math
Correct Solution:
```
input();res=[0]*(10**5);ans=0;a=list(map(int,input().split()))
for i in a:res[bin(i).count('1')]+=1
for i in range(10**5):ans+=res[i]*(res[i]-1)//2
print(ans)
``` | output | 1 | 60,056 | 20 | 120,113 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:
* f(0) = 0;
* f(2Β·x) = f(x);
* f(2Β·x +... | instruction | 0 | 60,057 | 20 | 120,114 |
Tags: implementation, math
Correct Solution:
```
def f(x):
return str(bin(x)).count('1')
n = int(input())
a = list(map(int, input().split()))
ans = [f(x) for x in a]
s = set(ans)
counts = {x:ans.count(x) for x in s}
ans = 0
for i in counts:
ans += (counts[i]*(counts[i]-1))//2
print(ans)
``` | output | 1 | 60,057 | 20 | 120,115 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:
* f(0) = 0;
* f(2Β·x) = f(x);
* f(2Β·x +... | instruction | 0 | 60,058 | 20 | 120,116 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
x=[bin(int(i)).count('1') for i in input().split()]
s=0
for i in range(max(x)+1):
s=s+x.count(i)*(x.count(i)-1)
print(int(s/2))
# Made By Mostafa_Khaled
``` | output | 1 | 60,058 | 20 | 120,117 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:
* f(0) = 0;
* f(2Β·x) = f(x);
* f(2Β·x +... | instruction | 0 | 60,059 | 20 | 120,118 |
Tags: implementation, math
Correct Solution:
```
n = int( input() )
a = list( map( int, input().split() ) )
def f( n ):
return ( sum( [ 1 for i in n if i == '1' ] ) )
cnt = {}
for i in range( n ):
tmp = f( bin( a[i] )[2:] )
if tmp not in cnt:
cnt[ tmp ] = 1
else:
cnt[ tmp ] += 1
#pr... | output | 1 | 60,059 | 20 | 120,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:
* f(0) = 0;
* f(2Β·x) = f(x);
* f(2Β·x +... | instruction | 0 | 60,060 | 20 | 120,120 |
Tags: implementation, math
Correct Solution:
```
import array
def helper(x):
ret = 0
while x > 0 :
if x % 2 == 0: x //= 2
else:
ret+=1
x //= 2
return ret
n = int(input())
a = list(map(int, input().split()))
d = [0]*10000
for element in a:
res = helper(element)
... | output | 1 | 60,060 | 20 | 120,121 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:
* f(0) = 0;
* f(2Β·x) = f(x);
* f(2Β·x +... | instruction | 0 | 60,061 | 20 | 120,122 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
p=[int(x) for x in input().split()]
for i in range (0,n):
p[i]=str(bin(p[i])).count('1')
s=set(p)
t=0
for j in s:
t+=p.count(j)*(p.count(j)-1)/2
print(int(t))
``` | output | 1 | 60,061 | 20 | 120,123 |
Provide a correct Python 3 solution for this coding contest problem.
The nth triangular number is defined as the sum of the first n positive integers. The nth tetrahedral number is defined as the sum of the first n triangular numbers. It is easy to show that the nth tetrahedral number is equal to n(n+1)(n+2) β 6. For ... | instruction | 0 | 60,584 | 20 | 121,168 |
"Correct Solution:
```
from collections import defaultdict, deque
sq = [i for i in range(200)]
for i in range(199):
sq[i + 1] += sq[i]
for i in range(199):
sq[i + 1] += sq[i]
ss = []
for s in sq:
if s % 2:
ss.append(s)
dp = defaultdict(lambda: False)
check = defaultdict(lambda: False)
for s in sq:
... | output | 1 | 60,584 | 20 | 121,169 |
Provide a correct Python 3 solution for this coding contest problem.
The nth triangular number is defined as the sum of the first n positive integers. The nth tetrahedral number is defined as the sum of the first n triangular numbers. It is easy to show that the nth tetrahedral number is equal to n(n+1)(n+2) β 6. For ... | instruction | 0 | 60,585 | 20 | 121,170 |
"Correct Solution:
```
def main():
INIT = 100
query = []
ans = []
while True:
q = int(input())
if q == 0:
break
query.append(q)
MAX = max(query)
table = [INIT] * (MAX + 1)
table[0] = 0
all_item = [i * (i + 1) * (i + 2) // 6 for i in range(1, 181)]
odd_item = [i for i in all_ite... | output | 1 | 60,585 | 20 | 121,171 |
Provide a correct Python 3 solution for this coding contest problem.
The nth triangular number is defined as the sum of the first n positive integers. The nth tetrahedral number is defined as the sum of the first n triangular numbers. It is easy to show that the nth tetrahedral number is equal to n(n+1)(n+2) β 6. For ... | instruction | 0 | 60,586 | 20 | 121,172 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: print('Yes' if b else 'No')
YESNO=lambda b: print('YES' if b else 'NO')
def main():
Q=[]
while True:
N=int(input())
if N==0:
... | output | 1 | 60,586 | 20 | 121,173 |
Provide a correct Python 3 solution for this coding contest problem.
The nth triangular number is defined as the sum of the first n positive integers. The nth tetrahedral number is defined as the sum of the first n triangular numbers. It is easy to show that the nth tetrahedral number is equal to n(n+1)(n+2) β 6. For ... | instruction | 0 | 60,587 | 20 | 121,174 |
"Correct Solution:
```
def main():
INIT = 100
query = []
ans = []
while True:
q = int(input())
if q == 0:
break
query.append(q)
MAX = max(query)
table = [INIT] * (MAX + 1)
table[0] = 0
all_item = [i * (i + 1) * (i + 2) // 6 for i in range(1, 181)]
odd_item = [i for i in all_ite... | output | 1 | 60,587 | 20 | 121,175 |
Provide a correct Python 3 solution for this coding contest problem.
The nth triangular number is defined as the sum of the first n positive integers. The nth tetrahedral number is defined as the sum of the first n triangular numbers. It is easy to show that the nth tetrahedral number is equal to n(n+1)(n+2) β 6. For ... | instruction | 0 | 60,588 | 20 | 121,176 |
"Correct Solution:
```
import sys
input = lambda: sys.stdin.readline().rstrip()
def resolve():
tetrahedral_num = [i*(i+1)*(i+2)//6 for i in range(1, 201)]
tetrahedral_num_odd = [i for i in tetrahedral_num if i%2==1]
n = []
while True:
tmp = int(input())
if tmp==0:
break
... | output | 1 | 60,588 | 20 | 121,177 |
Provide a correct Python 3 solution for this coding contest problem.
The nth triangular number is defined as the sum of the first n positive integers. The nth tetrahedral number is defined as the sum of the first n triangular numbers. It is easy to show that the nth tetrahedral number is equal to n(n+1)(n+2) β 6. For ... | instruction | 0 | 60,589 | 20 | 121,178 |
"Correct Solution:
```
import copy
item = [i *(i +1) * (i+2) //6 for i in range(1,181)]
q = []
while True:
in_ = int(input())
if in_ == 0:
break
q.append(in_)
INIT = 1000
MAX = max(q) +10
ans = [INIT] *MAX
ans[0] = 0
odd_item = [i for i in item if i % 2 ==0 ]
even_item = [i for i in item if not(i ... | output | 1 | 60,589 | 20 | 121,179 |
Provide a correct Python 3 solution for this coding contest problem.
The nth triangular number is defined as the sum of the first n positive integers. The nth tetrahedral number is defined as the sum of the first n triangular numbers. It is easy to show that the nth tetrahedral number is equal to n(n+1)(n+2) β 6. For ... | instruction | 0 | 60,590 | 20 | 121,180 |
"Correct Solution:
```
# https://onlinejudge.u-aizu.ac.jp/problems/1167
def porok(n):
return n * (n+1) * (n+2) // 6
def dp_1(n):
for j in poroks_odd:
for i in range(j, n+1):
tmp = dp[i-j] + 1
if dp[i-j] + 1 < dp[i]:
dp[i] = dp[i-j] + 1
def dp_2(n):
for j... | output | 1 | 60,590 | 20 | 121,181 |
Provide a correct Python 3 solution for this coding contest problem.
The nth triangular number is defined as the sum of the first n positive integers. The nth tetrahedral number is defined as the sum of the first n triangular numbers. It is easy to show that the nth tetrahedral number is equal to n(n+1)(n+2) β 6. For ... | instruction | 0 | 60,591 | 20 | 121,182 |
"Correct Solution:
```
n=1000001
i=1
p=[]
po=[]
nn=1
while nn<n:
p.append(nn)
if nn%2==1:
po.append(nn)
i+=1
nn= i*(i+1)*(i+2)//6
np=len(p)
npo=len(po)
pp=[]
def dpf(nn,pp,nnp):
dpm=[i for i in range(nn+1)]
for ppi in pp[1:nnp]:
if ppi>nn:
break
for j in r... | output | 1 | 60,591 | 20 | 121,183 |
Provide a correct Python 3 solution for this coding contest problem.
D: Many Decimal Integers
problem
Given a string S consisting only of numbers (0-9) and a string T consisting only of numbers and `?`. S and T are the same length.
Consider changing each `?` That exists in T to one of the numbers from 0 to 9 to cre... | instruction | 0 | 60,603 | 20 | 121,206 |
"Correct Solution:
```
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.st... | output | 1 | 60,603 | 20 | 121,207 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove... | instruction | 0 | 61,091 | 20 | 122,182 |
Tags: brute force, dp, math
Correct Solution:
```
z,zz=input,lambda:list(map(int,z().split()))
zzz=lambda:[int(i) for i in stdin.readline().split()]
szz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())
from string import *
from re import *
from collections import *
from queue import *
from sys import ... | output | 1 | 61,091 | 20 | 122,183 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove... | instruction | 0 | 61,092 | 20 | 122,184 |
Tags: brute force, dp, math
Correct Solution:
```
s=input()
n=len(s)
if n>2:
for x in range(n):
if int(s[x])%8==0:
print("YES")
print(s[x])
break
else:
pass
if int(s[x])%8==0:
pass
else:
for x in range(n-1):
for y in... | output | 1 | 61,092 | 20 | 122,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove... | instruction | 0 | 61,093 | 20 | 122,186 |
Tags: brute force, dp, math
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**10
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,... | output | 1 | 61,093 | 20 | 122,187 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove... | instruction | 0 | 61,094 | 20 | 122,188 |
Tags: brute force, dp, math
Correct Solution:
```
from itertools import combinations
# input 6 digit
def eight_divisibility(num, no_leading=False):
if no_leading:
comb = combinations(num, 1)
for c in comb:
cc = ''.join(i for i in c)
N = int(cc)
if N % 8 == 0:
... | output | 1 | 61,094 | 20 | 122,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove... | instruction | 0 | 61,095 | 20 | 122,190 |
Tags: brute force, dp, math
Correct Solution:
```
# # non 100**3 solution
# a=[]
# for i in range(1000):
# if(i%8==0):
# arr=[0]*10
# x=list(map(int,list(str(i))))
# for j in x:
# arr[j-1]+=1
# a.append(arr)
# # print(len(str(100)))
# print(a)
# print(len(a))
# n=list(... | output | 1 | 61,095 | 20 | 122,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove... | instruction | 0 | 61,096 | 20 | 122,192 |
Tags: brute force, dp, math
Correct Solution:
```
from itertools import combinations
n=input()
if '8' in n:
print('YES')
print(8)
elif '0' in n:
print('YES')
print(0)
else:
a=list(combinations(n,2))+list(combinations(n,3))
res=-1
for x in a:
num=int(''.join(x))
if num%8... | output | 1 | 61,096 | 20 | 122,193 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove... | instruction | 0 | 61,097 | 20 | 122,194 |
Tags: brute force, dp, math
Correct Solution:
```
n=[char for char in str(input())]
n.reverse()
p = len(n)
d_by_eight = []
for i in range(125):
d_by_eight.append(str(8*i))
for num in d_by_eight:
num_copy = num
num = [char for char in num]
num.reverse()
length = len(num) # num of digits
n_index = 0
int_index = 0
... | output | 1 | 61,097 | 20 | 122,195 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove... | instruction | 0 | 61,098 | 20 | 122,196 |
Tags: brute force, dp, math
Correct Solution:
```
def solve(n):
l = len(n)
for i in range(l):
c = n[i]
if c % 8 == 0: return c
for j in range(i + 1, l):
c = n[i]*10 + n[j]
if c % 8 == 0: return c
for k in range(j + 1, l):
c = n[i]*100 +... | output | 1 | 61,098 | 20 | 122,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to... | instruction | 0 | 61,099 | 20 | 122,198 |
Yes | output | 1 | 61,099 | 20 | 122,199 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.