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.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous substrings starting with the sbegin and ending w... | instruction | 0 | 68,988 | 0 | 137,976 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
def calc_lcp(s, sa):
rank = [0 for _ in range(len(s))]
for i in range(len(s)):
rank[sa[i]] = i
lcp = [0 for _ in range(len(s) - 1)]
h = 0
for i in range(len(s)):
if rank[i] < len(s) - 1:
while max(... | output | 1 | 68,988 | 0 | 137,977 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous substrings starting with the sbegin and ending w... | instruction | 0 | 68,989 | 0 | 137,978 |
Tags: brute force, data structures, hashing, strings
Correct Solution:
```
def calc_lcp(s, sa):
n = len(s)
rank = [0 for _ in range(n)]
for i in range(n):
rank[sa[i]] = i
lcp = [0 for _ in range(n - 1)]
h = 0
for i in range(n):
if rank[i] < n - 1:
while max(i, sa[rank... | output | 1 | 68,989 | 0 | 137,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous s... | instruction | 0 | 68,990 | 0 | 137,980 |
Yes | output | 1 | 68,990 | 0 | 137,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous s... | instruction | 0 | 68,991 | 0 | 137,982 |
Yes | output | 1 | 68,991 | 0 | 137,983 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous s... | instruction | 0 | 68,992 | 0 | 137,984 |
Yes | output | 1 | 68,992 | 0 | 137,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous s... | instruction | 0 | 68,993 | 0 | 137,986 |
Yes | output | 1 | 68,993 | 0 | 137,987 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous s... | instruction | 0 | 68,994 | 0 | 137,988 |
No | output | 1 | 68,994 | 0 | 137,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous s... | instruction | 0 | 68,995 | 0 | 137,990 |
No | output | 1 | 68,995 | 0 | 137,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous s... | instruction | 0 | 68,996 | 0 | 137,992 |
No | output | 1 | 68,996 | 0 | 137,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous s... | instruction | 0 | 68,997 | 0 | 137,994 |
No | output | 1 | 68,997 | 0 | 137,995 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 69,188 | 0 | 138,376 |
Tags: brute force
Correct Solution:
```
aa = input()
bb = input()
if len(aa) >= len(bb):
p = aa
q = bb
else:
p = aa
q = bb
maxc = 0
for i in range(1,len(p)+len(q)):
k1 = max(0,i-len(q))
k2 = min(i,len(p))
a = p[k1:k2]
if i < len(q):
b = q[-i:]
elif i > len(p):
b = q[:... | output | 1 | 69,188 | 0 | 138,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 69,189 | 0 | 138,378 |
Tags: brute force
Correct Solution:
```
s = input()
u = input()
t = [0] * len(s)
d = {chr(i) : [] for i in range(ord('a'), ord('z')+1)}
for i, j in enumerate(s) :
d[j].append(i)
for i in u:
for j in d[i]:
t[j] += 1
t = [0] + t
print(len(u) - max(t))
``` | output | 1 | 69,189 | 0 | 138,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 69,190 | 0 | 138,380 |
Tags: brute force
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import*
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('input.txt', 'r')
... | output | 1 | 69,190 | 0 | 138,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 69,191 | 0 | 138,382 |
Tags: brute force
Correct Solution:
```
def check(ss):
tmp=0
for i in range(len(u)):
tmp+=ss[i]!=u[i]
return tmp
s = input()
u = input()
s = '#'*2000 + s + '#'*2000
ans=1000000000000
for i in range(len(s)-len(u)):
sub = s[i:i+len(u)]
ans = min(ans , check(sub))
print(ans)
``` | output | 1 | 69,191 | 0 | 138,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 69,192 | 0 | 138,384 |
Tags: brute force
Correct Solution:
```
s=input()
u=input()
t=[0]*len(s)
d={i :[] for i in "abcdefghijklmnopqrstuvwxyz" }
for i,j in enumerate(s) :
d[j].append(i)
for i in u:
for j in d[i]:
t[j]=t[j]+1
t=[0]+t
#print(t)
print(len(u)-max(t))
``` | output | 1 | 69,192 | 0 | 138,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 69,193 | 0 | 138,386 |
Tags: brute force
Correct Solution:
```
from sys import stdin
first = stdin.readline().strip()
second = stdin.readline().strip()
minChange = 2001
first = '@' * (len(second) - 1) + first + '@' * (len(second) - 1)
diff = len(first) - len(second)
for i in range(0, diff + 1):
line = '@' * i + second + '@' * (diff -... | output | 1 | 69,193 | 0 | 138,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 69,194 | 0 | 138,388 |
Tags: brute force
Correct Solution:
```
x,y=input(),input()
res=[0]*len(x)
dicc ={i:[] for i in "abcdefghijklmnopqrstuvwxyz"}
for i,j in enumerate(x):
dicc[j].append(i)
for i in y:
for j in dicc[i]:
res[j]+=1
res=[0]+res
print(len(y)-max(res))
``` | output | 1 | 69,194 | 0 | 138,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For example, string "aba" has six substrings: "a", "b... | instruction | 0 | 69,195 | 0 | 138,390 |
Tags: brute force
Correct Solution:
```
from sys import stdin, stdout
first, second = stdin.readline().strip(), stdin.readline().strip()
n, m = len(first), len(second)
first = '#' * m + first + '#' * m
ans = float('inf')
for i in range(n + m):
cnt = 0
for j in range(m):
if first[i + j] != second... | output | 1 | 69,195 | 0 | 138,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 69,196 | 0 | 138,392 |
Yes | output | 1 | 69,196 | 0 | 138,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 69,197 | 0 | 138,394 |
Yes | output | 1 | 69,197 | 0 | 138,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 69,198 | 0 | 138,396 |
Yes | output | 1 | 69,198 | 0 | 138,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 69,199 | 0 | 138,398 |
Yes | output | 1 | 69,199 | 0 | 138,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 69,200 | 0 | 138,400 |
No | output | 1 | 69,200 | 0 | 138,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 69,201 | 0 | 138,402 |
No | output | 1 | 69,201 | 0 | 138,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 69,202 | 0 | 138,404 |
No | output | 1 | 69,202 | 0 | 138,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dr. Moriarty is about to send a message to Sherlock Holmes. He has a string s.
String p is called a substring of string s if you can read it starting from some position in the string s. For ex... | instruction | 0 | 69,203 | 0 | 138,406 |
No | output | 1 | 69,203 | 0 | 138,407 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Fi... | instruction | 0 | 69,265 | 0 | 138,530 |
Tags: implementation, strings, two pointers
Correct Solution:
```
s = input()
n = len(s)
ans = 0
m = 0
for i in range(n - 5, -1, -1):
if s[i:i + 5] == "metal":
m += 1
elif s[i:i + 5] == "heavy":
ans += m
print(ans)
``` | output | 1 | 69,265 | 0 | 138,531 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Fi... | instruction | 0 | 69,266 | 0 | 138,532 |
Tags: implementation, strings, two pointers
Correct Solution:
```
str = input()
h=0
m=0
for i in range(len(str)-4):
if str[i:i+5] =="heavy":
h+=1
if str[i:i+5] == "metal":
m+=h
print(m)
``` | output | 1 | 69,266 | 0 | 138,533 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Fi... | instruction | 0 | 69,267 | 0 | 138,534 |
Tags: implementation, strings, two pointers
Correct Solution:
```
a=input()
st=''
if len(a)<5:
print(0)
else:
for i in range(4,len(a)):
if a[i-4]=='h' and a[i-3]=='e' and a[i-2]=='a' and a[i-1]=='v' and a[i]=='y':
st+='h'
elif a[i-4]=='m' and a[i-3]=='e' and a[i-2]=='t' and a[i-1]=='... | output | 1 | 69,267 | 0 | 138,535 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Fi... | instruction | 0 | 69,268 | 0 | 138,536 |
Tags: implementation, strings, two pointers
Correct Solution:
```
from sys import stdin,stdout
nmbr = lambda: int(stdin.readline())
lst = lambda: list(map(int,stdin.readline().split()))
for _ in range(1):#nmbr():
s=input()
n=len(s)
cnt=ans=0
for i in range(n):
if s[i-4:i+1]=='heavy':cnt+=1
... | output | 1 | 69,268 | 0 | 138,537 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Fi... | instruction | 0 | 69,269 | 0 | 138,538 |
Tags: implementation, strings, two pointers
Correct Solution:
```
from functools import reduce
from operator import *
from math import *
from sys import *
from string import *
from collections import *
setrecursionlimit(10**7)
dX= [-1, 1, 0, 0,-1, 1,-1, 1]
dY= [ 0, 0,-1, 1, 1,-1,-1, 1]
RI=lambda: list(map(int,input().s... | output | 1 | 69,269 | 0 | 138,539 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Fi... | instruction | 0 | 69,270 | 0 | 138,540 |
Tags: implementation, strings, two pointers
Correct Solution:
```
def finder(S, t):
n = len(S)
answer = []
i1 = 0
for i in range(n):
if S[i]==t[i1]:
i1+=1
if i1==len(t):
i1=0
answer.append(i-len(t)+1)
else:
i1=0
... | output | 1 | 69,270 | 0 | 138,541 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Fi... | instruction | 0 | 69,271 | 0 | 138,542 |
Tags: implementation, strings, two pointers
Correct Solution:
```
s=str(input())
s=s[::-1]
count=0
ans=0
for i in range(0,len(s)):
if s[i:i+5]=="latem":
count+=1
if s[i:i+5]=="yvaeh":
ans+=count
print(ans)
``` | output | 1 | 69,271 | 0 | 138,543 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Fi... | instruction | 0 | 69,272 | 0 | 138,544 |
Tags: implementation, strings, two pointers
Correct Solution:
```
z=r=0
for w in input().split("heavy"):
r+=w.count("metal")*z
z+=1
print(r)
``` | output | 1 | 69,272 | 0 | 138,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if i... | instruction | 0 | 69,273 | 0 | 138,546 |
Yes | output | 1 | 69,273 | 0 | 138,547 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if i... | instruction | 0 | 69,274 | 0 | 138,548 |
Yes | output | 1 | 69,274 | 0 | 138,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if i... | instruction | 0 | 69,275 | 0 | 138,550 |
Yes | output | 1 | 69,275 | 0 | 138,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if i... | instruction | 0 | 69,276 | 0 | 138,552 |
Yes | output | 1 | 69,276 | 0 | 138,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if i... | instruction | 0 | 69,277 | 0 | 138,554 |
No | output | 1 | 69,277 | 0 | 138,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if i... | instruction | 0 | 69,278 | 0 | 138,556 |
No | output | 1 | 69,278 | 0 | 138,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if i... | instruction | 0 | 69,279 | 0 | 138,558 |
No | output | 1 | 69,279 | 0 | 138,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if i... | instruction | 0 | 69,280 | 0 | 138,560 |
No | output | 1 | 69,280 | 0 | 138,561 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevin's score on one of the n questions of the olym... | instruction | 0 | 69,419 | 0 | 138,838 |
Tags: dp, greedy, math
Correct Solution:
```
n = int(input())
s = input()
print(min(n,sum(s[i]!=s[i-1] for i in range(1,n))+3))
``` | output | 1 | 69,419 | 0 | 138,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevin's score on one of the n questions of the olym... | instruction | 0 | 69,420 | 0 | 138,840 |
Tags: dp, greedy, math
Correct Solution:
```
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
# Copyright © 2016 missingdays <missingdays@missingdays>
#
# Distributed under terms of the MIT license.
"""
"""
n = int(input())
s = input()
res = 1
for i in range(1, n):
if s[i] != s[i-1]:
r... | output | 1 | 69,420 | 0 | 138,841 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevin's score on one of the n questions of the olym... | instruction | 0 | 69,421 | 0 | 138,842 |
Tags: dp, greedy, math
Correct Solution:
```
#! /bin/python
n = int(input())
tab = str(input())
d = 1
tmp = 1
changes = 1
for i in range(1, n):
if tab[i] != tab[i - 1]:
changes += 1
print(min(changes + 2, n))
``` | output | 1 | 69,421 | 0 | 138,843 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevin's score on one of the n questions of the olym... | instruction | 0 | 69,422 | 0 | 138,844 |
Tags: dp, greedy, math
Correct Solution:
```
from sys import stdin,stdout
nmbr = lambda: int(stdin.readline())
lst = lambda: list(map(int,stdin.readline().split()))
for _ in range(1):#nmbr()):
n=nmbr()
a=[int(ch) for ch in input()]
n=len(a)
dp=[[[0 for _ in range(2)]for _ in range(3)]for _ in range(n)]
... | output | 1 | 69,422 | 0 | 138,845 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevin's score on one of the n questions of the olym... | instruction | 0 | 69,423 | 0 | 138,846 |
Tags: dp, greedy, math
Correct Solution:
```
from math import *
from collections import *
from random import *
from decimal import Decimal
from bisect import *
import sys
#input=sys.stdin.readline
def lis():
return list(map(int,input().split()))
def ma():
return map(int,input().split())
def inp():
return in... | output | 1 | 69,423 | 0 | 138,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevin's score on one of the n questions of the olym... | instruction | 0 | 69,424 | 0 | 138,848 |
Tags: dp, greedy, math
Correct Solution:
```
from sys import maxsize, stdout, stdin,stderr
mod = int(1e9+7)
import sys
def I(): return int(stdin.readline())
def lint(): return [int(x) for x in stdin.readline().split()]
def S(): return input().strip()
def grid(r, c): return [lint() for i in range(r)]
from collections im... | output | 1 | 69,424 | 0 | 138,849 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevin's score on one of the n questions of the olym... | instruction | 0 | 69,425 | 0 | 138,850 |
Tags: dp, greedy, math
Correct Solution:
```
n=int(input())
b=input()
print(min(n,3+sum(x!=y for x,y in zip(b,b[1:]))))
``` | output | 1 | 69,425 | 0 | 138,851 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevin's score on one of the n questions of the olym... | instruction | 0 | 69,426 | 0 | 138,852 |
Tags: dp, greedy, math
Correct Solution:
```
ans = 1
n = int(input())
s = input()
for i in range(1, n):
ans += int(s[i]!=s[i-1])
print(min(n, ans+2))
``` | output | 1 | 69,426 | 0 | 138,853 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.