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.
Let's define a function f(x) (x is a positive integer) as follows: write all digits of the decimal representation of x backwards, then get rid of the leading zeroes. For example, f(321) = 123, f... | instruction | 0 | 34,485 | 20 | 68,970 |
Yes | output | 1 | 34,485 | 20 | 68,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's define a function f(x) (x is a positive integer) as follows: write all digits of the decimal representation of x backwards, then get rid of the leading zeroes. For example, f(321) = 123, f... | instruction | 0 | 34,486 | 20 | 68,972 |
Yes | output | 1 | 34,486 | 20 | 68,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's define a function f(x) (x is a positive integer) as follows: write all digits of the decimal representation of x backwards, then get rid of the leading zeroes. For example, f(321) = 123, f... | instruction | 0 | 34,487 | 20 | 68,974 |
Yes | output | 1 | 34,487 | 20 | 68,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's define a function f(x) (x is a positive integer) as follows: write all digits of the decimal representation of x backwards, then get rid of the leading zeroes. For example, f(321) = 123, f... | instruction | 0 | 34,488 | 20 | 68,976 |
No | output | 1 | 34,488 | 20 | 68,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's define a function f(x) (x is a positive integer) as follows: write all digits of the decimal representation of x backwards, then get rid of the leading zeroes. For example, f(321) = 123, f... | instruction | 0 | 34,489 | 20 | 68,978 |
No | output | 1 | 34,489 | 20 | 68,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's define a function f(x) (x is a positive integer) as follows: write all digits of the decimal representation of x backwards, then get rid of the leading zeroes. For example, f(321) = 123, f... | instruction | 0 | 34,490 | 20 | 68,980 |
No | output | 1 | 34,490 | 20 | 68,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's define a function f(x) (x is a positive integer) as follows: write all digits of the decimal representation of x backwards, then get rid of the leading zeroes. For example, f(321) = 123, f... | instruction | 0 | 34,491 | 20 | 68,982 |
No | output | 1 | 34,491 | 20 | 68,983 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remi... | instruction | 0 | 34,540 | 20 | 69,080 |
Tags: greedy, sortings
Correct Solution:
```
n=int(input())
s=input()
z=len(s)//2
s1=list(s[0:len(s)//2])
s2=list(s[len(s)//2:len(s)])
f=0
s1.sort(reverse=True)
s2.sort(reverse=True)
if all(s1[i]>s2[i] for i in range(z)):
f=1
s1.sort()
s2.sort()
if all(s1[i]<s2[i] for i in range(z)):
f=1
print('YES' if f else... | output | 1 | 34,540 | 20 | 69,081 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remi... | instruction | 0 | 34,541 | 20 | 69,082 |
Tags: greedy, sortings
Correct Solution:
```
n = int(input())
s = input()
l1, l2 = [int(i) for i in s[0:n]], [int(j) for j in s[n:]]
l1.sort()
l2.sort()
f = 0
if l1[0]>l2[0]:
for i in range(1,n):
if l1[i]<=l2[i]:
f=1
break
elif l1[0]<l2[0]:
for i in range(1,n):
if l1[i]>=... | output | 1 | 34,541 | 20 | 69,083 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remi... | instruction | 0 | 34,542 | 20 | 69,084 |
Tags: greedy, sortings
Correct Solution:
```
class CodeforcesTask160BSolution:
def __init__(self):
self.result = ''
self.n = 0
self.ticket = ''
def read_input(self):
self.n = int(input())
self.ticket = input()
def process_task(self):
p1 = [int(x) for x in se... | output | 1 | 34,542 | 20 | 69,085 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remi... | instruction | 0 | 34,543 | 20 | 69,086 |
Tags: greedy, sortings
Correct Solution:
```
n = int(input())
s = input()
n1 = [int(i) for i in s[:n]]
n2 = [int(i) for i in s[n:]]
n1.sort()
n2.sort()
for i in range(n):
if n1[i] == n2[i]:
print('NO')
break
if (n1[i] < n2[i]) ^ (n1[0] < n2[0]):
print('NO')
break
else:
print(... | output | 1 | 34,543 | 20 | 69,087 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remi... | instruction | 0 | 34,544 | 20 | 69,088 |
Tags: greedy, sortings
Correct Solution:
```
n = int(input())
digits = input()
# split digits into 2
first_half = digits[0:n]
second_half = digits[n:len(digits)]
# sort both halves
sorted_first_half = sorted(first_half)
sorted_second_half = sorted(second_half)
# cycle through both halves simultaneously to see if each ... | output | 1 | 34,544 | 20 | 69,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remi... | instruction | 0 | 34,545 | 20 | 69,090 |
Tags: greedy, sortings
Correct Solution:
```
n=int(input())
w=input()
z=zip(sorted(w[:n]),sorted(w[n:]))
print('YES' if abs(sum((x>y)-(x<y) for x,y in z))==n else 'NO')
``` | output | 1 | 34,545 | 20 | 69,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remi... | instruction | 0 | 34,546 | 20 | 69,092 |
Tags: greedy, sortings
Correct Solution:
```
n = int(input())
num = list(map(int, list(input())))
def parse(num):
mid = len(num) // 2
beg = num[:mid]
end = num[mid:]
beg.sort()
end.sort()
if beg == end:
return "NO"
results = []
for i in range(len(beg)):
if beg[i] == end... | output | 1 | 34,546 | 20 | 69,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remi... | instruction | 0 | 34,547 | 20 | 69,094 |
Tags: greedy, sortings
Correct Solution:
```
n = int(input())
tic = input()
a, b = list(tic[:n]), list(tic[n:])
a.sort()
b.sort()
if a[0] > b[0]:
a, b = b, a
for i in range(n):
if a[i] >= b[i]:
print("NO")
break
else:
print("YES")
``` | output | 1 | 34,547 | 20 | 69,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually ... | instruction | 0 | 34,548 | 20 | 69,096 |
Yes | output | 1 | 34,548 | 20 | 69,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually ... | instruction | 0 | 34,549 | 20 | 69,098 |
Yes | output | 1 | 34,549 | 20 | 69,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually ... | instruction | 0 | 34,550 | 20 | 69,100 |
Yes | output | 1 | 34,550 | 20 | 69,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually ... | instruction | 0 | 34,551 | 20 | 69,102 |
Yes | output | 1 | 34,551 | 20 | 69,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually ... | instruction | 0 | 34,552 | 20 | 69,104 |
No | output | 1 | 34,552 | 20 | 69,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually ... | instruction | 0 | 34,553 | 20 | 69,106 |
No | output | 1 | 34,553 | 20 | 69,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually ... | instruction | 0 | 34,554 | 20 | 69,108 |
No | output | 1 | 34,554 | 20 | 69,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually ... | instruction | 0 | 34,555 | 20 | 69,110 |
No | output | 1 | 34,555 | 20 | 69,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nick is attracted by everything unconventional. He doesn't like decimal number system any more, and he decided to study other number systems. A number system with base b caught his attention. Be... | instruction | 0 | 34,556 | 20 | 69,112 |
No | output | 1 | 34,556 | 20 | 69,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nick is attracted by everything unconventional. He doesn't like decimal number system any more, and he decided to study other number systems. A number system with base b caught his attention. Be... | instruction | 0 | 34,557 | 20 | 69,114 |
No | output | 1 | 34,557 | 20 | 69,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nick is attracted by everything unconventional. He doesn't like decimal number system any more, and he decided to study other number systems. A number system with base b caught his attention. Be... | instruction | 0 | 34,558 | 20 | 69,116 |
No | output | 1 | 34,558 | 20 | 69,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nick is attracted by everything unconventional. He doesn't like decimal number system any more, and he decided to study other number systems. A number system with base b caught his attention. Be... | instruction | 0 | 34,559 | 20 | 69,118 |
No | output | 1 | 34,559 | 20 | 69,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argu... | instruction | 0 | 34,713 | 20 | 69,426 |
No | output | 1 | 34,713 | 20 | 69,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argu... | instruction | 0 | 34,714 | 20 | 69,428 |
No | output | 1 | 34,714 | 20 | 69,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argu... | instruction | 0 | 34,715 | 20 | 69,430 |
No | output | 1 | 34,715 | 20 | 69,431 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let S(n) denote the number that represents the digits of n in sorted order. For example, S(1) = 1, S(5) = 5, S(50394) = 3459, S(353535) = 333555.
Given a number X, compute <image> modulo 109 + 7.
Input
The first line of input will contain... | instruction | 0 | 34,860 | 20 | 69,720 |
Tags: dp, math
Correct Solution:
```
# Problem G
num = input()
num_list = []
for i in range(len(num)):
num_list.append(int(num[i]))
myMod = (10 ** 9) + 7
length = len(num_list)
f = [0] * (length + 1)
t = [1] * (length + 1)
for i in range(length):
f[i+1] = (f[i] * 10 + 1) % myMod
t[i+1] = (t[i] * 10) % myMod
... | output | 1 | 34,860 | 20 | 69,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let S(n) denote the number that represents the digits of n in sorted order. For example, S(1) = 1, S(5) = 5, S(50394) = 3459, S(353535) = 333555.
Given a number X, compute <image> modulo 109 + ... | instruction | 0 | 34,861 | 20 | 69,722 |
No | output | 1 | 34,861 | 20 | 69,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let S(n) denote the number that represents the digits of n in sorted order. For example, S(1) = 1, S(5) = 5, S(50394) = 3459, S(353535) = 333555.
Given a number X, compute <image> modulo 109 + ... | instruction | 0 | 34,862 | 20 | 69,724 |
No | output | 1 | 34,862 | 20 | 69,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let S(n) denote the number that represents the digits of n in sorted order. For example, S(1) = 1, S(5) = 5, S(50394) = 3459, S(353535) = 333555.
Given a number X, compute <image> modulo 109 + ... | instruction | 0 | 34,863 | 20 | 69,726 |
No | output | 1 | 34,863 | 20 | 69,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let S(n) denote the number that represents the digits of n in sorted order. For example, S(1) = 1, S(5) = 5, S(50394) = 3459, S(353535) = 333555.
Given a number X, compute <image> modulo 109 + ... | instruction | 0 | 34,864 | 20 | 69,728 |
No | output | 1 | 34,864 | 20 | 69,729 |
Provide a correct Python 3 solution for this coding contest problem.
Professor Abacus has just built a new computing engine for making numerical tables. It was designed to calculate the values of a polynomial function in one variable at several points at a time. With the polynomial function f(x) = x2 + 2x + 1, for ins... | instruction | 0 | 35,100 | 20 | 70,200 |
"Correct Solution:
```
from functools import reduce
EPSILON = 1e-5
d = 0
Vs = []
times = lambda x,y: x*y
def interpolate(x, e):
return sum(
reduce(
times, [(x-j)/(i-j) for j in range(len(Vs)) if j not in [i,x,e]]
)*v for i,v in enumerate(Vs) if i not in [x,e])
def outlier(e):
... | output | 1 | 35,100 | 20 | 70,201 |
Provide a correct Python 3 solution for this coding contest problem.
Professor Abacus has just built a new computing engine for making numerical tables. It was designed to calculate the values of a polynomial function in one variable at several points at a time. With the polynomial function f(x) = x2 + 2x + 1, for ins... | instruction | 0 | 35,101 | 20 | 70,202 |
"Correct Solution:
```
from itertools import combinations
def build(X, Y):
A = []
for x in X:
res = 1
for xi in X:
if x == xi:
continue
res *= x - xi
A.append(Y[x] / res)
return A
def calc(X, A, x):
base = 1
for xi in X:
base ... | output | 1 | 35,101 | 20 | 70,203 |
Provide a correct Python 3 solution for this coding contest problem.
Professor Abacus has just built a new computing engine for making numerical tables. It was designed to calculate the values of a polynomial function in one variable at several points at a time. With the polynomial function f(x) = x2 + 2x + 1, for ins... | instruction | 0 | 35,102 | 20 | 70,204 |
"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**13
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,-1)]
def LI(): return [int... | output | 1 | 35,102 | 20 | 70,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Abacus has just built a new computing engine for making numerical tables. It was designed to calculate the values of a polynomial function in one variable at several points at a time. ... | instruction | 0 | 35,103 | 20 | 70,206 |
No | output | 1 | 35,103 | 20 | 70,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Professor Abacus has just built a new computing engine for making numerical tables. It was designed to calculate the values of a polynomial function in one variable at several points at a time. ... | instruction | 0 | 35,104 | 20 | 70,208 |
No | output | 1 | 35,104 | 20 | 70,209 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC's math teacher always gives the class some interesting math problems so that they don't get bored. Today the problem is as follows. Given an integer n, you can perform the following operations zero or more times:
* mul x: multiplies ... | instruction | 0 | 35,155 | 20 | 70,310 |
Tags: greedy, math, number theory
Correct Solution:
```
from math import ceil, log
d=dict()
def pf(n):
i=2
while(i*i<= n):
while(n%i==0):
d[i]=d.get(i,0)+1
n=n//i
i+=1
if(n!=1):
d[n]=d.get(n,0)+1
n=int(input())
if(n==1):
print(1,0)
else:
pf(n)
m= max(d.values())
steps=0
flag=Fal... | output | 1 | 35,155 | 20 | 70,311 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC's math teacher always gives the class some interesting math problems so that they don't get bored. Today the problem is as follows. Given an integer n, you can perform the following operations zero or more times:
* mul x: multiplies ... | instruction | 0 | 35,157 | 20 | 70,314 |
Tags: greedy, math, number theory
Correct Solution:
```
from math import log
from math import ceil
A=int(input())
a=A
m=[]
i=2
def Z(x):
return round(x)==x
b=round(a**0.5 + 1)
while i<=b:
if a%i==0:
m+=[[i,0],]
while a%i==0:
m[-1][1]+=1
a//=i
i+=1
if a!=1:
m+=[[a,1],]
f=True... | output | 1 | 35,157 | 20 | 70,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
JATC's math teacher always gives the class some interesting math problems so that they don't get bored. Today the problem is as follows. Given an integer n, you can perform the following operations zero or more times:
* mul x: multiplies ... | instruction | 0 | 35,160 | 20 | 70,320 |
Tags: greedy, math, number theory
Correct Solution:
```
import sys
from math import sqrt, log, ceil
input_file = sys.stdin
n = int(input_file.readline())
def factor(n):
lst = []
prod = 1
for i in range(2, n+1):
if n % i == 0:
prod *= i
lst.append(0)
while n % i ... | output | 1 | 35,160 | 20 | 70,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya has a number co... | instruction | 0 | 35,252 | 20 | 70,504 |
Tags: strings
Correct Solution:
```
"""
Author - Satwik Tiwari .
2nd NOV , 2020 - Monday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
impor... | output | 1 | 35,252 | 20 | 70,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya has a number co... | instruction | 0 | 35,253 | 20 | 70,506 |
Tags: strings
Correct Solution:
```
# 447 or 477 start with odd
n, k = map(int, input().split())
s = input()
s = list(s)
for i in range(n - 1):
if not k:
break
if s[i] != '4':
continue
tt = ''.join(s[i:i + 3])
if tt in ('447', '477') and i % 2 == 0:
if k % 2 == 1 and tt == '44... | output | 1 | 35,253 | 20 | 70,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya has a number co... | instruction | 0 | 35,254 | 20 | 70,508 |
Tags: strings
Correct Solution:
```
n, k = map(int, input().split())
s = list(input())
cnt = 0
for i in range(n - 1):
if cnt == k:
break
if s[i] == '4' and s[i + 1] == '7':
if i & 1:
if s[i - 1] == '4':
if (cnt - k) & 1:
s[i] = '7'
... | output | 1 | 35,254 | 20 | 70,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya has a number co... | instruction | 0 | 35,255 | 20 | 70,510 |
Tags: strings
Correct Solution:
```
n, m = map(int, input().split())
luckstring = list(input())
start = 0
idx = 0
while m:
idx = start
while idx < len(luckstring) - 1:
if luckstring[idx] == '4' and luckstring[idx + 1] == '7':
break
idx += 1
if idx == len(luckstring) - 1:
... | output | 1 | 35,255 | 20 | 70,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya has a number co... | instruction | 0 | 35,256 | 20 | 70,512 |
Tags: strings
Correct Solution:
```
n, k = map(int, input().split())
s = [i for i in input()]
flag = False
for i in range(len(s)-1):
if k == 0:
break
if s[i] == "4" and s[i+1] == "7":
if i % 2 == 0:
s[i] = "4"
s[i+1] = "4"
k -= 1
else:
if... | output | 1 | 35,256 | 20 | 70,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya has a number co... | instruction | 0 | 35,257 | 20 | 70,514 |
Tags: strings
Correct Solution:
```
import sys
input=sys.stdin.readline
from math import *
n,m=map(int,input().split())
s=list(input().rstrip())
for i in range(n-1):
if m==0:
break
if i>0:
if s[i-1]=='4' and s[i]=='4' and s[i+1]=='7' and i%2==1:
if m%2==1:
s[i]='7'
... | output | 1 | 35,257 | 20 | 70,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya has a number co... | instruction | 0 | 35,258 | 20 | 70,516 |
Tags: strings
Correct Solution:
```
from math import *
from collections import deque
from copy import deepcopy
import sys
def inp(): return sys.stdin.readline().rstrip("\r\n") #for fast input
def multi(): return map(int,input().split())
def strmulti(): return map(str, inp().split())
def lis(): return list(map(int, inp(... | output | 1 | 35,258 | 20 | 70,517 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.