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.
Vanya got an important task — he should enumerate books in the library and label each book with its number. Each of the n books should be assigned with a number from 1 to n. Naturally, distinct ... | instruction | 0 | 71,181 | 20 | 142,362 |
No | output | 1 | 71,181 | 20 | 142,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vanya got an important task — he should enumerate books in the library and label each book with its number. Each of the n books should be assigned with a number from 1 to n. Naturally, distinct ... | instruction | 0 | 71,182 | 20 | 142,364 |
No | output | 1 | 71,182 | 20 | 142,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vanya got an important task — he should enumerate books in the library and label each book with its number. Each of the n books should be assigned with a number from 1 to n. Naturally, distinct ... | instruction | 0 | 71,183 | 20 | 142,366 |
No | output | 1 | 71,183 | 20 | 142,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vanya got an important task — he should enumerate books in the library and label each book with its number. Each of the n books should be assigned with a number from 1 to n. Naturally, distinct ... | instruction | 0 | 71,184 | 20 | 142,368 |
No | output | 1 | 71,184 | 20 | 142,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integer k — the number of digits in n.
Magically, all the numbers were shuffled in arbitrary order while this note... | instruction | 0 | 71,233 | 20 | 142,466 |
Tags: brute force, constructive algorithms, strings
Correct Solution:
```
a = input()
b = input()
d = [0] * 10
n = 0
for j in range(1000100):
t = str(j)
if len(t) + j == len(a):
n = j
for x in str(n):
d[ord(x) - ord('0')] -= 1
for x in a:
d[ord(x) - ord('0')] += 1
for x in b:
d[ord(x) - ord(... | output | 1 | 71,233 | 20 | 142,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integer k — the number of digits in n.
Magically, all the numbers were shuffled in arbitrary order while this note... | instruction | 0 | 71,234 | 20 | 142,468 |
Tags: brute force, constructive algorithms, strings
Correct Solution:
```
import math
from collections import Counter
s = list(map(int, input()))
substr = input().rstrip()
t = list(map(int, substr))
m = len(s)
x, y = 0, m
z = (x + y) // 2
while z != x:
if z + math.floor(math.log10(z)) + 1 <= m:
x = z
... | output | 1 | 71,234 | 20 | 142,469 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integer k — the number of digits in n.
Magically, all the numbers were shuffled in arbitrary order while this note... | instruction | 0 | 71,235 | 20 | 142,470 |
Tags: brute force, constructive algorithms, strings
Correct Solution:
```
import sys
def main():
a = sys.stdin.readline().strip()
b = sys.stdin.readline().strip()
if a == "01" or a == "10":
print("0")
return
cnt = [0] * 256
for i in map(ord, a):
cnt[i] += 1
n = sum(cnt... | output | 1 | 71,235 | 20 | 142,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integer k — the number of digits in n.
Magically, all the numbers were shuffled in arbitrary order while this note... | instruction | 0 | 71,236 | 20 | 142,472 |
Tags: brute force, constructive algorithms, strings
Correct Solution:
```
def main():
s = input()
if s in ("01", "10"):
print(0)
return
cnt = [0] * 58
for j in map(ord, s):
cnt[j] += 1
n, s1 = sum(cnt), input()
for le in range(n - 1, 0, -1):
if len(str(le)) + le =... | output | 1 | 71,236 | 20 | 142,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integer k — the number of digits in n.
Magically, all the numbers were shuffled in arbitrary order while this note... | instruction | 0 | 71,237 | 20 | 142,474 |
Tags: brute force, constructive algorithms, strings
Correct Solution:
```
import sys
sys.stderr = sys.stdout
from collections import Counter
K = (0, 11, 102, 1003, 10004, 100005, 1000006)
def sf(S, C, C0):
if C0 == '0':
return True
if S[0] == '0':
return False
def g1():
yield f... | output | 1 | 71,237 | 20 | 142,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integer k — the number of digits in n.
Magically, all the numbers w... | instruction | 0 | 71,238 | 20 | 142,476 |
No | output | 1 | 71,238 | 20 | 142,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integer k — the number of digits in n.
Magically, all the numbers w... | instruction | 0 | 71,239 | 20 | 142,478 |
No | output | 1 | 71,239 | 20 | 142,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integer k — the number of digits in n.
Magically, all the numbers w... | instruction | 0 | 71,240 | 20 | 142,480 |
No | output | 1 | 71,240 | 20 | 142,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya decided to pass a very large integer n to Kate. First, he wrote that number as a string, then he appended to the right integer k — the number of digits in n.
Magically, all the numbers w... | instruction | 0 | 71,241 | 20 | 142,482 |
No | output | 1 | 71,241 | 20 | 142,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them.... | instruction | 0 | 71,277 | 20 | 142,554 |
Tags: *special
Correct Solution:
```
p = str(eval(input().replace('/', '//')))
lastnum = 0
for x in p:
num = ord(x)
if num > lastnum:
print('+' * (num - lastnum) + '.' )
else:
print('-' * (lastnum - num) + '.' )
lastnum = num
``` | output | 1 | 71,277 | 20 | 142,555 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them.... | instruction | 0 | 71,278 | 20 | 142,556 |
Tags: *special
Correct Solution:
```
a = eval(input())
s = str(a)
for i in s:
b = ""
for j in range(ord(i)):
b += "+"
b += '.>'
print (b)
``` | output | 1 | 71,278 | 20 | 142,557 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them.... | instruction | 0 | 71,279 | 20 | 142,558 |
Tags: *special
Correct Solution:
```
n = str(eval(input()))
for j in n:
for _ in range(ord(j)): print('+')
print('.')
for _ in range(ord(j)): print('-')
``` | output | 1 | 71,279 | 20 | 142,559 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them.... | instruction | 0 | 71,280 | 20 | 142,560 |
Tags: *special
Correct Solution:
```
line = input()
line = line.replace('+', ' +')
line = line.replace('-', ' -')
val = 0
for tok in line.split():
val += int(tok)
print('++++++++++++++++++++++++++++++++++++++++++++++++')
li = []
def foo(num):
if num < 10:
li.append(num)
return
foo(num//10... | output | 1 | 71,280 | 20 | 142,561 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them.... | instruction | 0 | 71,281 | 20 | 142,562 |
Tags: *special
Correct Solution:
```
exp = input()
ans = str(eval(exp))
print(ans)
for digit in ans:
print('+' * ord(ascii(int(digit))) + ".>", end='\n')
``` | output | 1 | 71,281 | 20 | 142,563 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them.... | instruction | 0 | 71,282 | 20 | 142,564 |
Tags: *special
Correct Solution:
```
n = eval(input())
for c in str(n):
print('>')
print('+' * ord(c) + '.')
``` | output | 1 | 71,282 | 20 | 142,565 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them.... | instruction | 0 | 71,283 | 20 | 142,566 |
Tags: *special
Correct Solution:
```
res = ''
for c in str(eval(input())):
res += '+'*ord(c) + '.>'
print(res)
``` | output | 1 | 71,283 | 20 | 142,567 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 255 and addition/subtraction signs between them.... | instruction | 0 | 71,284 | 20 | 142,568 |
Tags: *special
Correct Solution:
```
import re
def printNum(n):
for i in range(n):
print('+', end='')
string = input()
strings = re.split("([+-])", string)
terms = [int(strings[0])]
i = 1
while i < len(strings):
if strings[i] == '+':
terms.append(int(strings[i + 1]))
i += 2
i = 1
while i < len(strings):
... | output | 1 | 71,284 | 20 | 142,569 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 2... | instruction | 0 | 71,285 | 20 | 142,570 |
Yes | output | 1 | 71,285 | 20 | 142,571 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 2... | instruction | 0 | 71,286 | 20 | 142,572 |
Yes | output | 1 | 71,286 | 20 | 142,573 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 2... | instruction | 0 | 71,287 | 20 | 142,574 |
Yes | output | 1 | 71,287 | 20 | 142,575 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 2... | instruction | 0 | 71,288 | 20 | 142,576 |
Yes | output | 1 | 71,288 | 20 | 142,577 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 2... | instruction | 0 | 71,289 | 20 | 142,578 |
No | output | 1 | 71,289 | 20 | 142,579 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 2... | instruction | 0 | 71,290 | 20 | 142,580 |
No | output | 1 | 71,290 | 20 | 142,581 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 2... | instruction | 0 | 71,291 | 20 | 142,582 |
No | output | 1 | 71,291 | 20 | 142,583 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will write a simple generator of Brainfuck (<https://en.wikipedia.org/wiki/Brainfuck>) calculators.
You are given an arithmetic expression consisting of integers from 0 to 2... | instruction | 0 | 71,292 | 20 | 142,584 |
No | output | 1 | 71,292 | 20 | 142,585 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the a... | instruction | 0 | 71,314 | 20 | 142,628 |
Tags: brute force, math
Correct Solution:
```
n=int(input())
a=[]
for i in range(100,0,-1):
if n<=i:
continue
x=n-i
if sum(map(int,list(str(x))))==i:
a.append(x)
print(len(a))
for i in range(len(a)):
print(a[i])
``` | output | 1 | 71,314 | 20 | 142,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the a... | instruction | 0 | 71,315 | 20 | 142,630 |
Tags: brute force, math
Correct Solution:
```
# from debug import debug
from math import ceil, log2
def dig(n):
q = n
v = 0
while q:
v+=q%10
q //= 10
return v+n
n = int(input())
if n == 2:
print(1)
print(1)
else:
d = 0
q = n
while q:
q = q//10
d+=1
store = []
for i in range(max(0, n-9*d), n):
i... | output | 1 | 71,315 | 20 | 142,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the a... | instruction | 0 | 71,316 | 20 | 142,632 |
Tags: brute force, math
Correct Solution:
```
value = int(input())
def display(lst):
for item in sorted(lst):
print(item)
def sum_a_string(integer):
# print(integer)
return sum([int(d) for d in str(integer)])
def make_all_nine(lenght):
return '9' * lenght
def d_max(value):
svalue = str(... | output | 1 | 71,316 | 20 | 142,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the a... | instruction | 0 | 71,317 | 20 | 142,634 |
Tags: brute force, math
Correct Solution:
```
n=int(input())
m=[]
if n<=18:
a=0
else:
a=n-len(str(n))*9
for i in range(a,n):
x=i
for j in str(i):
x+=int(j)
if n==x:
m.append(i)
print(len(m))
[print(i) for i in m]
``` | output | 1 | 71,317 | 20 | 142,635 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the a... | instruction | 0 | 71,318 | 20 | 142,636 |
Tags: brute force, math
Correct Solution:
```
def sum(x):
l=str(x)
i=0
for j in range(len(l)):
i=i+int(l[j])
return i
x=int(input(''))
q=10*(len(str(x)))
q=max(x-q,0)
l=[]
for i in range(q,x):
if ((i+sum(i))==x):
l.append(i)
print(len(l))
for i in range(len(l)):
print(l[... | output | 1 | 71,318 | 20 | 142,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the a... | instruction | 0 | 71,319 | 20 | 142,638 |
Tags: brute force, math
Correct Solution:
```
def f(n):
ans = n
while n:
ans += n % 10
n //= 10
return ans
n = int(input())
a = []
for i in range(max(1, n - 200), n):
if f(i) == n:
a.append(i)
print(len(a))
for item in a:
print(item, end = ' ')
``` | output | 1 | 71,319 | 20 | 142,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the a... | instruction | 0 | 71,320 | 20 | 142,640 |
Tags: brute force, math
Correct Solution:
```
#!/usr/bin/env python3
def digsum(n):
s = 0
while n>0:
s += n%10
n //= 10
return s
def main():
n = int(input())
Sol = []
for d in range(min(n-1,9*9),0,-1):
if digsum(n-d)==d:
Sol.append(n-d)
print(len(Sol))
... | output | 1 | 71,320 | 20 | 142,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the a... | instruction | 0 | 71,321 | 20 | 142,642 |
Tags: brute force, math
Correct Solution:
```
n=int(input())
a=[]
no=0
i=0
while i<82 and i <=n:
b=n-i
b=list(str(b))
z=0
for ele in b:
z+=int(ele)
if i == z:
no+=1
a.append(n-i)
i+=1
a.sort()
print(no)
for ele in a:
print(ele)
``` | output | 1 | 71,321 | 20 | 142,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathemat... | instruction | 0 | 71,322 | 20 | 142,644 |
Yes | output | 1 | 71,322 | 20 | 142,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathemat... | instruction | 0 | 71,323 | 20 | 142,646 |
Yes | output | 1 | 71,323 | 20 | 142,647 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathemat... | instruction | 0 | 71,324 | 20 | 142,648 |
Yes | output | 1 | 71,324 | 20 | 142,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathemat... | instruction | 0 | 71,325 | 20 | 142,650 |
Yes | output | 1 | 71,325 | 20 | 142,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathemat... | instruction | 0 | 71,326 | 20 | 142,652 |
No | output | 1 | 71,326 | 20 | 142,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathemat... | instruction | 0 | 71,327 | 20 | 142,654 |
No | output | 1 | 71,327 | 20 | 142,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathemat... | instruction | 0 | 71,328 | 20 | 142,656 |
No | output | 1 | 71,328 | 20 | 142,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathemat... | instruction | 0 | 71,329 | 20 | 142,658 |
No | output | 1 | 71,329 | 20 | 142,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After learning about polynomial hashing, Heidi decided to learn about shift-xor hashing. In particular, she came across this interesting problem.
Given a bitstring y ∈ \{0,1\}^n find out the number of different k (0 ≤ k < n) such that there... | instruction | 0 | 71,728 | 20 | 143,456 |
Tags: brute force, number theory
Correct Solution:
```
import sys
import math
n = int(sys.stdin.readline().strip())
s = sys.stdin.readline().strip()
a = [1] * n
for c in s:
if c != '0':
a[0] = 0
for k in range(1, n):
if n % k == 0:
for i in range(k):
t = 0
for j in range(i, n, k):
if s[j] != '0':
... | output | 1 | 71,728 | 20 | 143,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After learning about polynomial hashing, Heidi decided to learn about shift-xor hashing. In particular, she came across this interesting problem.
Given a bitstring y ∈ \{0,1\}^n find out the number of different k (0 ≤ k < n) such that there... | instruction | 0 | 71,729 | 20 | 143,458 |
Tags: brute force, number theory
Correct Solution:
```
from collections import deque
import math
num = int(input())
x = tuple(map(int, list(input())))
#if x == "0"*num: print(num); exit()
integer = 0
dic = dict()
for i in range(1,num+1):
a = math.gcd(i,num)
if a in dic:
integer += dic[a]
else:
... | output | 1 | 71,729 | 20 | 143,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After learning about polynomial hashing, Heidi decided to learn about shift-xor hashing. In particular, she came across this interesting problem.
Given a bitstring y ∈ \{0,1\}^n find out the number of different k (0 ≤ k < n) such that there... | instruction | 0 | 71,730 | 20 | 143,460 |
Tags: brute force, number theory
Correct Solution:
```
import math
num = int(input())
x = tuple(map(int, list(input())))
integer = 0
dic = dict()
for i in range(1,num+1):
a = math.gcd(i,num)
if a in dic:
integer += dic[a]
else:
lijst = [0]*a
for j in range(num):
... | output | 1 | 71,730 | 20 | 143,461 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After learning about polynomial hashing, Heidi decided to learn about shift-xor hashing. In particular, she came across this interesting problem.
Given a bitstring y ∈ \{0,1\}^n find out the number of different k (0 ≤ k < n) such that there... | instruction | 0 | 71,731 | 20 | 143,462 |
Tags: brute force, number theory
Correct Solution:
```
import sys
import math
n = int(sys.stdin.readline().strip())
s = sys.stdin.readline().strip()
a = [1] * n
for c in s:
if c != '0':
a[0] = 0
for k in range(1, n):
if n % k == 0:
t = [0] * k
for i, c in enumerate(s):
if c != '0':
t[i % k] += 1
if ... | output | 1 | 71,731 | 20 | 143,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After learning about polynomial hashing, Heidi decided to learn about shift-xor hashing. In particular, she came across this interesting problem.
Given a bitstring y ∈ \{0,1\}^n find out the number of different k (0 ≤ k < n) such that there... | instruction | 0 | 71,732 | 20 | 143,464 |
Tags: brute force, number theory
Correct Solution:
```
from math import gcd
def canHash(n, ln):
if n == '0'*ln:
return ln
ans = 0
yes = []
for i in range(1, ln):
if ln%i == 0:
token = 1
for k in range(i):
a = sum([int(b) for b in n[k::i]])
... | output | 1 | 71,732 | 20 | 143,465 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.