message stringlengths 2 23.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 97 109k | cluster float64 0 0 | __index_level_0__ int64 194 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the following three conditions is satisfied:
* The l... | instruction | 0 | 98,814 | 0 | 197,628 |
Tags: bitmasks, brute force, divide and conquer, dp, implementation
Correct Solution:
```
from sys import setrecursionlimit,stdout,stdin
setrecursionlimit(100000)
def solve(l, r, c):
if r - l + 1 == 1:
return 1 - (s[l:r + 1] == c)
else:
mid = (r + l + 1) // 2
p1 = 0
p2 = 0
for i in range(l, mid):
p1 +... | output | 1 | 98,814 | 0 | 197,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the following three conditions is satisfied:
* The l... | instruction | 0 | 98,815 | 0 | 197,630 |
Tags: bitmasks, brute force, divide and conquer, dp, implementation
Correct Solution:
```
def get_cnt(start,k,char,s):
result = 0
for index in range(start,start + 2**k):
if s[index] != char:
result += 1
return result
def f(start,k,char,s):
if (k == 0):
if s[start] == char:
return 0
return 1
ret... | output | 1 | 98,815 | 0 | 197,631 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the foll... | instruction | 0 | 98,816 | 0 | 197,632 |
Yes | output | 1 | 98,816 | 0 | 197,633 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the foll... | instruction | 0 | 98,817 | 0 | 197,634 |
Yes | output | 1 | 98,817 | 0 | 197,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the foll... | instruction | 0 | 98,818 | 0 | 197,636 |
Yes | output | 1 | 98,818 | 0 | 197,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the foll... | instruction | 0 | 98,819 | 0 | 197,638 |
Yes | output | 1 | 98,819 | 0 | 197,639 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the foll... | instruction | 0 | 98,820 | 0 | 197,640 |
No | output | 1 | 98,820 | 0 | 197,641 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the foll... | instruction | 0 | 98,821 | 0 | 197,642 |
No | output | 1 | 98,821 | 0 | 197,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the foll... | instruction | 0 | 98,822 | 0 | 197,644 |
No | output | 1 | 98,822 | 0 | 197,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s[1 ... n] consisting of lowercase Latin letters. It is guaranteed that n = 2^k for some integer k ≥ 0.
The string s[1 ... n] is called c-good if at least one of the foll... | instruction | 0 | 98,823 | 0 | 197,646 |
No | output | 1 | 98,823 | 0 | 197,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may perform the following operation:
* add a ch... | instruction | 0 | 99,207 | 0 | 198,414 |
Tags: implementation, strings
Correct Solution:
```
if __name__ == '__main__':
n = int(input())
ss = input()
ans = n
for i in range(1, n // 2+1):
if ss[0: i] == ss[i:i+i]:
ans = n - i + 1
print(ans)
``` | output | 1 | 99,207 | 0 | 198,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may perform the following operation:
* add a ch... | instruction | 0 | 99,208 | 0 | 198,416 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
s = input()
size = 0
i = n-1
while i>-1:
if i%2 ==0:
size+=1
i-=1
elif s[:(i+1)//2]==s[(i+1)//2:(i+1)]:
size +=(i+1)//2+1
break
else:
size +=2
i-=2
print(size)
``` | output | 1 | 99,208 | 0 | 198,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may perform the following operation:
* add a ch... | instruction | 0 | 99,209 | 0 | 198,418 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
s = input()
m = ''
for i in range(1, len(s)):
if s[0:i] == s[i:i * 2] and len(s[0:i]) > len(m):
m = s[0:i]
if len(m) == 0:
print(len(s))
else:
print(len(s) - len(m) + 1)
``` | output | 1 | 99,209 | 0 | 198,419 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may perform the following operation:
* add a ch... | instruction | 0 | 99,210 | 0 | 198,420 |
Tags: implementation, strings
Correct Solution:
```
import getpass
import sys
import math
import random
import itertools
import bisect
import time
files = True
debug = False
if getpass.getuser() == 'frohenk' and files:
debug = True
sys.stdin = open("test.in")
# sys.stdout = open('test.out', 'w')
elif file... | output | 1 | 99,210 | 0 | 198,421 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may perform the following operation:
* add a ch... | instruction | 0 | 99,211 | 0 | 198,422 |
Tags: implementation, strings
Correct Solution:
```
n=int(input())
st = input()
c=0
x=0
ok = 0
for i in range(1,n//2+1):
# print(st[:x+1],st[x+1:2*x+2])
if st[ : i]==st[i:2*i]:
x=i
print(min([n,n-x+1]))
``` | output | 1 | 99,211 | 0 | 198,423 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may perform the following operation:
* add a ch... | instruction | 0 | 99,212 | 0 | 198,424 |
Tags: implementation, strings
Correct Solution:
```
L = int(input())
s = input()
for i in range(L//2, 2-1, -1):
if s[i:].startswith(s[:i]):
print(L-i+1)
break
else:
print(L)
``` | output | 1 | 99,212 | 0 | 198,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may perform the following operation:
* add a ch... | instruction | 0 | 99,213 | 0 | 198,426 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
s = input()
for l in range(n // 2, 0, -1):
if s[:l] == s[l:l * 2]:
print(len(s) - l + 1)
exit(0)
print(n)
``` | output | 1 | 99,213 | 0 | 198,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may perform the following operation:
* add a ch... | instruction | 0 | 99,214 | 0 | 198,428 |
Tags: implementation, strings
Correct Solution:
```
#codeforces_954B
n = int(input())
k = n
s = input()
rez = 0
while n>0:
if n & 1:
n -= 1
pass;
elif s[:n//2] == s[n//2:n]:
rez = n//2 +1
break;
else:
n -= 2
print(k-n+rez)
``` | output | 1 | 99,214 | 0 | 198,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may... | instruction | 0 | 99,215 | 0 | 198,430 |
Yes | output | 1 | 99,215 | 0 | 198,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may... | instruction | 0 | 99,216 | 0 | 198,432 |
Yes | output | 1 | 99,216 | 0 | 198,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may... | instruction | 0 | 99,217 | 0 | 198,434 |
Yes | output | 1 | 99,217 | 0 | 198,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may... | instruction | 0 | 99,218 | 0 | 198,436 |
Yes | output | 1 | 99,218 | 0 | 198,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may... | instruction | 0 | 99,219 | 0 | 198,438 |
No | output | 1 | 99,219 | 0 | 198,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may... | instruction | 0 | 99,220 | 0 | 198,440 |
No | output | 1 | 99,220 | 0 | 198,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may... | instruction | 0 | 99,221 | 0 | 198,442 |
No | output | 1 | 99,221 | 0 | 198,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.
Initially, you have an empty string. Until you type the whole string, you may... | instruction | 0 | 99,222 | 0 | 198,444 |
No | output | 1 | 99,222 | 0 | 198,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to construct such string s of minimum possible length ... | instruction | 0 | 99,476 | 0 | 198,952 |
Tags: implementation, strings
Correct Solution:
```
# Author: S Mahesh Raju
# Username: maheshraju2020
# Date: 18/07/2020
from sys import stdin,stdout
from math import gcd, ceil, sqrt
from collections import Counter
from bisect import bisect_left, bisect_right
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: ... | output | 1 | 99,476 | 0 | 198,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to construct such string s of minimum possible length ... | instruction | 0 | 99,477 | 0 | 198,954 |
Tags: implementation, strings
Correct Solution:
```
n,k=map(int,input().split())
t=input()
idx=0
for i in range(1,n):
if t[:n-i]==t[i:]:
idx=i
break
ans=t
appendix=""
if idx==0:
appendix=t
else:
appendix=t[n-idx:]
for i in range(k-1):
ans+=appendix
print(ans)
``` | output | 1 | 99,477 | 0 | 198,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to construct such string s of minimum possible length ... | instruction | 0 | 99,478 | 0 | 198,956 |
Tags: implementation, strings
Correct Solution:
```
n, k = map(int, input().split())
t = input()
merge_index = None
for i in range(1, n):
if t[i:] == t[:-i]:
merge_index = i
break
if merge_index is not None:
res = []
for i in range(k):
res.append(t[:merge_index])
res.append(t[me... | output | 1 | 99,478 | 0 | 198,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to construct such string s of minimum possible length ... | instruction | 0 | 99,479 | 0 | 198,958 |
Tags: implementation, strings
Correct Solution:
```
from collections import *
n,k = map(int,input().split())
s = input()
ind = n
for i in range(1,n):
if(s[:n-i] == s[i:]):
ind = i
break
t = s+(s[n-ind:])*(k-1)
print(t)
``` | output | 1 | 99,479 | 0 | 198,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to construct such string s of minimum possible length ... | instruction | 0 | 99,480 | 0 | 198,960 |
Tags: implementation, strings
Correct Solution:
```
n, k = (int(x) for x in input().split())
t = input()
t1 = ""
for i in range(1,n+1):
if t[:n-i] == t[i:]:
t1 += t[:i]*k
t1 += t[i:]
print(t1)
break
``` | output | 1 | 99,480 | 0 | 198,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to construct such string s of minimum possible length ... | instruction | 0 | 99,481 | 0 | 198,962 |
Tags: implementation, strings
Correct Solution:
```
n,k=map(int,input().split())
string=input()
counter=0
for i in range(1,len(string)):
if string[:i]==string[-i:]:
counter=i
print(string+string[counter:]*(k-1))
``` | output | 1 | 99,481 | 0 | 198,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to construct such string s of minimum possible length ... | instruction | 0 | 99,482 | 0 | 198,964 |
Tags: implementation, strings
Correct Solution:
```
k=int(input().split()[1])
t=input()
i=1
while t[i:]!=t[:-i]:i+=1
print(t[:i]*k+t[i:])
``` | output | 1 | 99,482 | 0 | 198,965 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to construct such string s of minimum possible length ... | instruction | 0 | 99,483 | 0 | 198,966 |
Tags: implementation, strings
Correct Solution:
```
n, k = map(int, input().split())
t = input()
P = [0] * n
for i in range(1, n):
j = P[i - 1]
while t[j] != t[i] and j > 0:
j = P[j - 1]
if t[i] == t[j]:
j += 1
P[i] = j
ans = t[:(n - P[n - 1])] * k
if P[n - 1] > 0:
ans += t[(n - P[n... | output | 1 | 99,483 | 0 | 198,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to cons... | instruction | 0 | 99,484 | 0 | 198,968 |
Yes | output | 1 | 99,484 | 0 | 198,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to cons... | instruction | 0 | 99,485 | 0 | 198,970 |
Yes | output | 1 | 99,485 | 0 | 198,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to cons... | instruction | 0 | 99,486 | 0 | 198,972 |
Yes | output | 1 | 99,486 | 0 | 198,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to cons... | instruction | 0 | 99,487 | 0 | 198,974 |
Yes | output | 1 | 99,487 | 0 | 198,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to cons... | instruction | 0 | 99,488 | 0 | 198,976 |
No | output | 1 | 99,488 | 0 | 198,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to cons... | instruction | 0 | 99,489 | 0 | 198,978 |
No | output | 1 | 99,489 | 0 | 198,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to cons... | instruction | 0 | 99,490 | 0 | 198,980 |
No | output | 1 | 99,490 | 0 | 198,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string t consisting of n lowercase Latin letters and an integer number k.
Let's define a substring of some string s with indices from l to r as s[l ... r].
Your task is to cons... | instruction | 0 | 99,491 | 0 | 198,982 |
No | output | 1 | 99,491 | 0 | 198,983 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One of the most important products of the R1 company is a popular @r1.com mail service. The R1 mailboxes receive and send millions of emails every day.
Today, the online news thundered with terrible information. The R1 database crashed and ... | instruction | 0 | 99,756 | 0 | 199,512 |
Tags: implementation
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 *
import math
from math ... | output | 1 | 99,756 | 0 | 199,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and start... | instruction | 0 | 99,861 | 0 | 199,722 |
Tags: dp
Correct Solution:
```
string=input()
n=len(string)
ans=0
for i in range(n-1):
if int(string[i])%4==0:
ans+=1
temp=string[i:i+2]
if temp[0]=='0':
temp=string[i+1]
if(int(temp)%4==0):
ans=ans+i+1
if(int(string[-1])%4==0):
ans=ans+1
print(ans)
``` | output | 1 | 99,861 | 0 | 199,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and start... | instruction | 0 | 99,862 | 0 | 199,724 |
Tags: dp
Correct Solution:
```
# Anuneet Anand
s = input()
n = len(s)
D = set()
for i in range(100):
if i%4==0:
x = str(i)
if i<10:
x = "0"+x
D.add(x)
c = 0
for i in range(n-1):
if s[i]+s[i+1] in D:
c = c+i+1
for i in range(n):
if int(s[i])%4==0:
c = c+1
print(c)
``` | output | 1 | 99,862 | 0 | 199,725 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and start... | instruction | 0 | 99,863 | 0 | 199,726 |
Tags: dp
Correct Solution:
```
s = [int(x) for x in input()]
ans = 0
if s[0] % 4 == 0:
ans += 1
for i in range(1, len(s)):
if s[i] % 4 == 0:
ans += 1
if (s[i] + 10 * s[i - 1]) % 4 == 0:
ans += i
print(ans)
``` | output | 1 | 99,863 | 0 | 199,727 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and start... | instruction | 0 | 99,864 | 0 | 199,728 |
Tags: dp
Correct Solution:
```
s=input()
c=0
for i in s:
if int(i)%4==0:
c+=1
for i in range(len(s)-1):
if int(s[i]+s[i+1])%4==0:
c+=(i+1)
print(c)
``` | output | 1 | 99,864 | 0 | 199,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and start... | instruction | 0 | 99,865 | 0 | 199,730 |
Tags: dp
Correct Solution:
```
s = input()
c = 0
for i in s:
if(int(i) % 4 == 0):
c += 1
i, j = len(s) - 1, len(s) - 2
while(j >= 0):
if(int(''.join(s[j : i + 1])) % 4 == 0):
c += len(s) - (len(s) - j) + 1
# print(i, j)
i -= 1
j -= 1
print(c)
``` | output | 1 | 99,865 | 0 | 199,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and start... | instruction | 0 | 99,866 | 0 | 199,732 |
Tags: dp
Correct Solution:
```
s=input()
a=[0]
count=0
ans=0
for i in range(1,len(s)):
p=int(s[i-1]+s[i])
#print(p)
if(p%4==0):
a.append(1)
else:
a.append(0)
#print(a)
for i in range(len(a)):
if(a[i]==1):
count=count+i
for i in s:
if(int(i)%4==0):
ans+=1
... | output | 1 | 99,866 | 0 | 199,733 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Max wants to buy a new skateboard. He has calculated the amount of money that is needed to buy a new skateboard. He left a calculator on the floor and went to ask some money from his parents. Meanwhile his little brother Yusuf came and start... | instruction | 0 | 99,867 | 0 | 199,734 |
Tags: dp
Correct Solution:
```
s = input()
count=0
if int(s[0])%4==0:
count+=1
for i in range(1,len(s)):
if int(s[i-1])%2==0 and (s[i] in '048'):
count+=(i+1)
elif int(s[i-1])%2==1 and s[i] in '26':
count+=i
elif int(s[i])%4==0:
count+=1
print(count)
``` | output | 1 | 99,867 | 0 | 199,735 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.