message stringlengths 2 59.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 37 108k | cluster float64 20 20 | __index_level_0__ int64 74 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, number... | instruction | 0 | 23,153 | 20 | 46,306 |
Tags: implementation
Correct Solution:
```
a, b = map(int, input().split())
ar = input().split()
rez = 0
for i in ar:
if i.count('4') + i.count('7') <= b:
rez += 1
print(rez)
``` | output | 1 | 23,153 | 20 | 46,307 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, number... | instruction | 0 | 23,154 | 20 | 46,308 |
Tags: implementation
Correct Solution:
```
# bsdk idhar kya dekhne ko aaya hai, khud kr!!!
# from math import *
# from itertools import *
# import random
n, k = map(int, input().split())
arr = list(map(str, input().split()))
count_ = 0
for i in arr:
if (i.count("4") + i.count("7")) > k:
continue
else:
... | output | 1 | 23,154 | 20 | 46,309 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, number... | instruction | 0 | 23,155 | 20 | 46,310 |
Tags: implementation
Correct Solution:
```
n,k = list(map(int,input().split()))
a = list(map(str,input().split()))
count=0
for i in a:
x=i.count('4')
y=i.count('7')
if x+y > k:
count+=1
print(len(a)-count)
``` | output | 1 | 23,155 | 20 | 46,311 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, number... | instruction | 0 | 23,156 | 20 | 46,312 |
Tags: implementation
Correct Solution:
```
n, k = map(int, input().split())
L = [int(x) for x in input().split()]
ct = 0
for pp in L :
c = 0
p = int(pp)
while (p >= 1) :
if (p % 10 == 4) or (p % 10 == 7) :
c = c + 1
p = int(p / 10)
if (c <= k) :
ct += 1
print(ct)
... | output | 1 | 23,156 | 20 | 46,313 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only contains lucky digits 4 and 7. For example, number... | instruction | 0 | 23,157 | 20 | 46,314 |
Tags: implementation
Correct Solution:
```
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
a,b=ml()
ans=0
l=list(input().split())... | output | 1 | 23,157 | 20 | 46,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only con... | instruction | 0 | 23,158 | 20 | 46,316 |
Yes | output | 1 | 23,158 | 20 | 46,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only con... | instruction | 0 | 23,159 | 20 | 46,318 |
Yes | output | 1 | 23,159 | 20 | 46,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only con... | instruction | 0 | 23,160 | 20 | 46,320 |
Yes | output | 1 | 23,160 | 20 | 46,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only con... | instruction | 0 | 23,161 | 20 | 46,322 |
Yes | output | 1 | 23,161 | 20 | 46,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only con... | instruction | 0 | 23,162 | 20 | 46,324 |
No | output | 1 | 23,162 | 20 | 46,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only con... | instruction | 0 | 23,163 | 20 | 46,326 |
No | output | 1 | 23,163 | 20 | 46,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only con... | instruction | 0 | 23,164 | 20 | 46,328 |
No | output | 1 | 23,164 | 20 | 46,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Roma (a popular Russian name that means 'Roman') loves the Little Lvov Elephant's lucky numbers.
Let us remind you that lucky numbers are positive integers whose decimal representation only con... | instruction | 0 | 23,165 | 20 | 46,330 |
No | output | 1 | 23,165 | 20 | 46,331 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of length n / k (n is divisible by k) a1, a2, ...,... | instruction | 0 | 23,310 | 20 | 46,620 |
Tags: binary search, math
Correct Solution:
```
n, k = map(int, input().split())
ara = list(map( int, input().split()))
arb = list(map( int, input().split()))
sum1 = 1;
p_k = 10**k
p_k1 = 10**(k - 1)
p_k2 = 10**(k - 2)
M = 10**9 + 7
for i in range(n // k):
k = 0
if (p_k % ara[i] == 0):
k = -1
if ((a... | output | 1 | 23,310 | 20 | 46,621 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of length n / k (n is divisible by k) a1, a2, ...,... | instruction | 0 | 23,311 | 20 | 46,622 |
Tags: binary search, math
Correct Solution:
```
n1=input()
q,w=n1.split()
n=int(q)
k=int(w)
n2=input()
A1=n2.split()
n3=input()
B1=n3.split()
x=""
y=""
A=[]
B=[]
for i in range(0,n//k):
A.append(int(A1[i]))
B.append(int(B1[i]))
for i in range(0,k-1):
x+='0'
y+='9'
fin=0
for i in range(0,n//k):
ans=int('9'+y)//A[i]... | output | 1 | 23,311 | 20 | 46,623 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of length n / k (n is divisible by k) a1, a2, ...,... | instruction | 0 | 23,312 | 20 | 46,624 |
Tags: binary search, math
Correct Solution:
```
def get_multypler(k, a, b):
res = (10 ** k - 1) // a + 1
bad_residue = (a - ((10 ** (k - 1)) * b) % a) % a
suf = (10 ** (k - 1)) - 1
minus = suf // a + (1 if (bad_residue <= suf % a) else 0)
return res - minus
n, k = map(int, input().split())
a = l... | output | 1 | 23,312 | 20 | 46,625 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of length n / k (n is divisible by k) a1, a2, ...,... | instruction | 0 | 23,313 | 20 | 46,626 |
Tags: binary search, math
Correct Solution:
```
from math import *
MOD = 1000000007
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
res = 1
for i in range(n // k):
cont = ceil(10**k / a[i]) - ceil((b[i] + 1) * 10**(k-1) / a[i]) + ceil(b[i] * 10**(k-1)... | output | 1 | 23,313 | 20 | 46,627 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of length n / k (n is divisible by k) a1, a2, ...,... | instruction | 0 | 23,314 | 20 | 46,628 |
Tags: binary search, math
Correct Solution:
```
n, k = [ int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = [int(_) for _ in input().split()]
MOD = 10**9 + 7
ans = 1
for i in range(n // k):
alls = (10 ** k - 1) // a[i] + 1
subt = ((b[i] * (10 ** (k - 1))) + (10 ** (k - 1) - 1)) // a[i]
subt... | output | 1 | 23,314 | 20 | 46,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of length n / k (n is divisible by k) a1, a2, ...,... | instruction | 0 | 23,315 | 20 | 46,630 |
Tags: binary search, math
Correct Solution:
```
def c(a, b, k):
v = (10 ** k - 1) // a + 1
v -= (10 ** (k - 1) * (b + 1) - 1) // a - (10 ** (k - 1) * b - 1) // a
return v
MOD, v = 1000000007, 1
n, k = map(int, input().split())
for a, b in zip(map(int, input().split()), map(int, input().split())):
v = (... | output | 1 | 23,315 | 20 | 46,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of length n / k (n is divisible by k) a1, a2, ...,... | instruction | 0 | 23,316 | 20 | 46,632 |
Tags: binary search, math
Correct Solution:
```
import math
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
c = 1
for i in range(n // k):
count = (10 ** k - 1) // a[i] + 1
mmin = b[i] * (10 ** (k-1))
mmax = (b[i] + 1) * (10 ** (k-1)) - ... | output | 1 | 23,316 | 20 | 46,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of length n / k (n is divisible by k) a1, a2, ...,... | instruction | 0 | 23,317 | 20 | 46,634 |
Tags: binary search, math
Correct Solution:
```
MOD=10**9+7
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
k1,k2,ans=10**k,10**(k-1),1
for i in range(n//k):
z,x=a[i],b[i]
if b[i]>0: c=(x*k2-1)//z+(k1-1)//z-((x+1)*k2-1)//z+1
else: c=(k1-1)//z-(k2-1)//z
ans=... | output | 1 | 23,317 | 20 | 46,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of ... | instruction | 0 | 23,318 | 20 | 46,636 |
Yes | output | 1 | 23,318 | 20 | 46,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of ... | instruction | 0 | 23,319 | 20 | 46,638 |
Yes | output | 1 | 23,319 | 20 | 46,639 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of ... | instruction | 0 | 23,320 | 20 | 46,640 |
Yes | output | 1 | 23,320 | 20 | 46,641 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of ... | instruction | 0 | 23,321 | 20 | 46,642 |
Yes | output | 1 | 23,321 | 20 | 46,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of ... | instruction | 0 | 23,322 | 20 | 46,644 |
No | output | 1 | 23,322 | 20 | 46,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of ... | instruction | 0 | 23,323 | 20 | 46,646 |
No | output | 1 | 23,323 | 20 | 46,647 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of ... | instruction | 0 | 23,324 | 20 | 46,648 |
No | output | 1 | 23,324 | 20 | 46,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pasha has recently bought a new phone jPager and started adding his friends' phone numbers there. Each phone number consists of exactly n digits.
Also Pasha has a number k and two sequences of ... | instruction | 0 | 23,325 | 20 | 46,650 |
No | output | 1 | 23,325 | 20 | 46,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second β number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column... | instruction | 0 | 24,080 | 20 | 48,160 |
Tags: implementation, math
Correct Solution:
```
__author__ = 'Darren'
from sys import stdin
def solve():
n = int(next(stdin))
while n > 0:
line = next(stdin).strip()
c_pos = line.find('C')
if line[0] == 'R' and line[1].isdigit() and c_pos != -1:
case_1(line[1:c_pos], line... | output | 1 | 24,080 | 20 | 48,161 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second β number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column... | instruction | 0 | 24,082 | 20 | 48,164 |
Tags: implementation, math
Correct Solution:
```
import re
import math
n = int(input())
inputList = []
outputList = []
#print(ord('A'))#65
#print(chr(98))#b
for i in range(n):#n iputs
inputList.append(input())
#CASE ONE:
#if it has two letters and the second char is a number
#that is an RXCY type
... | output | 1 | 24,082 | 20 | 48,165 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second β number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column... | instruction | 0 | 24,083 | 20 | 48,166 |
Tags: implementation, math
Correct Solution:
```
s=""
for n in range(int(input())):
x = input()
a=b=0
for c in x:
if '0' <= c <= '9':
b=10*b+int(c)
elif b:
a,b=x[1:].split('C')
b=int(b)
v=""
while b:
b-=1
... | output | 1 | 24,083 | 20 | 48,167 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second β number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column... | instruction | 0 | 24,084 | 20 | 48,168 |
Tags: implementation, math
Correct Solution:
```
# -*- coding: utf-8 -*-
import re
lst = []
k = int(input())
for i in range(k):
strg = input()
end = strg.find('C')
if end < 2 or strg[1:end].isalpha():
r_num = re.findall(r"\d+\.?\d*",strg)
c_num = re.findall(r"[A-Z]+",strg)
cc_l = []... | output | 1 | 24,084 | 20 | 48,169 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second β number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column... | instruction | 0 | 24,085 | 20 | 48,170 |
Tags: implementation, math
Correct Solution:
```
# coding: utf-8
# encoding = utf-8
import re
# δΈζ
MAX_NUMBER = 26
countInBitArray = [1]
def countInBit(w):
if w >= len(countInBitArray):
count = countInBit(w - 1) * MAX_NUMBER
countInBitArray.append(count)
return countInBitArray[w]
countBef... | output | 1 | 24,085 | 20 | 48,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second β number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column... | instruction | 0 | 24,086 | 20 | 48,172 |
Tags: implementation, math
Correct Solution:
```
import re
def to_num(val):
ans = 0
for c in val:
ans = 26*ans + ord(c) - ord('A') + 1
return ans
def to_let(val):
val = int(val)
ans = ""
while val:
ans = chr((val-1)%26 + ord('A')) + ans
val = (val-(val-1)%26)// 26
... | output | 1 | 24,086 | 20 | 48,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second β number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column... | instruction | 0 | 24,087 | 20 | 48,174 |
Tags: implementation, math
Correct Solution:
```
import re
def convertToNum(col):
result = 0
for i in range(len(col)):
result += (26 ** i) * (ord(col[len(col) - i - 1]) - 64)
return result
def convertToUgly(n):
if n <= 26:
return chr(n + 64)
else:
if n % 26 == 0:
... | output | 1 | 24,087 | 20 | 48,175 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.
Reliable sources h... | instruction | 0 | 24,232 | 20 | 48,464 |
Tags: greedy, math, strings
Correct Solution:
```
t = input()
last = int(t[-1])
even = [int(x) for x in t if int(x)%2]
last_even = None
for i,c in enumerate(t):
as_int = int(c)
if as_int%2: continue
last_even = i
if as_int>last:continue
print (t[:i] + t[-1] + t[i+1:-1] +t[i])
break
else:
... | output | 1 | 24,232 | 20 | 48,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.
Reliable sources h... | instruction | 0 | 24,236 | 20 | 48,472 |
Tags: greedy, math, strings
Correct Solution:
```
n=list(input())
f=True
z=-1
for i in range(len(n)):
if (int(n[i])%2==0):
if int(n[i])<int(n[-1]):
n[i],n[-1] = n[-1],n[i]
an = ''.join(n)
f= False
z=0
break
else:
z= i
if z==-1:
... | output | 1 | 24,236 | 20 | 48,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.
Reliable sources h... | instruction | 0 | 24,239 | 20 | 48,478 |
Tags: greedy, math, strings
Correct Solution:
```
n = input()
temp = index = -1
for i in range(len(n)):
digit = n[i]
if int(digit) % 2 == 0:
temp = i
if digit < n[-1]:
index = i
break
if index == -1:
if temp == -1:
print(-1)
exit()
index = temp
print(n[0:index] + n[-1] + n[index+1:-1] + n[index])
... | output | 1 | 24,239 | 20 | 48,479 |
Provide a correct Python 3 solution for this coding contest problem.
Sitting in a station waiting room, Joisino is gazing at her train ticket.
The ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).
In the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1... | instruction | 0 | 24,589 | 20 | 49,178 |
"Correct Solution:
```
n = input()
lis = ["+", "-"]
for x in lis:
for y in lis:
for z in lis:
p = n[0] + x + n[1] + y + n[2] + z + n[3]
if eval(p) == 7:
print(p + "=7")
exit()
``` | output | 1 | 24,589 | 20 | 49,179 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 24,968 | 20 | 49,936 |
Tags: constructive algorithms
Correct Solution:
```
a, b, u, v = map(int, input().split())
k = u - 1
x, y = u < v, k < v
d = min(a, b) < max(u, v) or abs(u - v) > 1 or a == b == u == v
t = '7' * x + '4' * (a - y - k) + '74' * k + '7' * (b - x - k) + '4' * y
if a == y + k: t = t[-2:] + t[:-2]
print(-1 if d else t)
``` | output | 1 | 24,968 | 20 | 49,937 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 24,969 | 20 | 49,938 |
Tags: constructive algorithms
Correct Solution:
```
from itertools import repeat
from math import floor,ceil
def fill(s,a1,a2,a3,a4,c4,c7):
if a1<c4 or a2<c7:
return None
f = s.index('4')
sv = s.rindex('7')
s = ''.join([s[:f],'4'*(a1-c4),s[f:sv],'7'*(a2-c7),s[sv:]])
return s
a1,a2,a3,a4 = [int(x) for x in input... | output | 1 | 24,969 | 20 | 49,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 24,970 | 20 | 49,940 |
Tags: constructive algorithms
Correct Solution:
```
from math import *
from fractions import *
from sys import *
def li():
return list(map(int, input().split(" ")))
a = li()
if abs(a[2]-a[3]) > 1:
print(-1)
exit()
if a[2] == a[3]:
ans = "47"*a[2]+"4"
elif a[2] > a[3]:
ans = "47"*a[2]
else:
ans = "74"*a[3]
f... | output | 1 | 24,970 | 20 | 49,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 24,971 | 20 | 49,942 |
Tags: constructive algorithms
Correct Solution:
```
a, b, c, d = input().strip().split()
a = int(a)
b = int(b)
c = int(c)
d = int(d)
if abs(c - d) > 1 or min(a, b) < max(c, d) or a == b == c == d:
print(-1)
exit()
if c == d:
if a == c:
ans = '74' * c + '7' * (b - c)
else:
ans = '4' * (... | output | 1 | 24,971 | 20 | 49,943 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 24,972 | 20 | 49,944 |
Tags: constructive algorithms
Correct Solution:
```
a, b, c, d = map(int, input().split(' '))
if (a+b) - (c+d) < 1:
print(-1)
quit()
if c == d:
if a == c:
if (b-a < 0):
print(-1)
quit()
print('74' * d + '7' * (b-a))
quit()
if ((b-c) < 0 or (a-c-1) < 0... | output | 1 | 24,972 | 20 | 49,945 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 24,973 | 20 | 49,946 |
Tags: constructive algorithms
Correct Solution:
```
A = [int(_) for _ in input().split()]
if abs(A[3]-A[2]) > 1: print(-1)
elif A[2] > A[3]:
if A[0] < A[2] or A[1] < A[2]: print(-1)
else:
A[0] -= A[2]
A[1] -= A[2]
print("4"*A[0]+"47"*A[2]+"7"*A[1])
elif A[3] > A[2]:
if A[0] < A[3] or A[1] < A[3]: print(-1)... | output | 1 | 24,973 | 20 | 49,947 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 24,974 | 20 | 49,948 |
Tags: constructive algorithms
Correct Solution:
```
a1,a2,a3,a4=map(int,input().split())
L=[]
def Solve(a1,a2,a3,a4):
if(a3-a4<-1 or a3-a4>1 or a1<a3 or a1<a4 or a2<a3 or a2<a4):
return -1
elif(a3-a4==0):
Ans="47"*a3
Ans+="4"
if(a1-a3==0 and a2-a4==0):
return -1
... | output | 1 | 24,974 | 20 | 49,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Petya loves long lu... | instruction | 0 | 24,975 | 20 | 49,950 |
Tags: constructive algorithms
Correct Solution:
```
import sys
a, b, c, d = map(int, sys.stdin.readline().split(' '))
if c == d + 1:
if a < c or b < c:
print(-1)
else:
ans = '4' * (a - c) + "47" * c + '7' * (b - c)
print (ans)
elif c + 1 == d:
if a < d or b < d:
print(-1)
... | output | 1 | 24,975 | 20 | 49,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are luc... | instruction | 0 | 24,976 | 20 | 49,952 |
Yes | output | 1 | 24,976 | 20 | 49,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are luc... | instruction | 0 | 24,977 | 20 | 49,954 |
Yes | output | 1 | 24,977 | 20 | 49,955 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.