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.
Karl is developing a key storage service. Each user has a positive integer key.
Karl knows that storing keys in plain text is bad practice. So, instead of storing a key, he decided to store a f... | instruction | 0 | 22,153 | 20 | 44,306 |
Yes | output | 1 | 22,153 | 20 | 44,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Karl is developing a key storage service. Each user has a positive integer key.
Karl knows that storing keys in plain text is bad practice. So, instead of storing a key, he decided to store a f... | instruction | 0 | 22,154 | 20 | 44,308 |
No | output | 1 | 22,154 | 20 | 44,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Karl is developing a key storage service. Each user has a positive integer key.
Karl knows that storing keys in plain text is bad practice. So, instead of storing a key, he decided to store a f... | instruction | 0 | 22,155 | 20 | 44,310 |
No | output | 1 | 22,155 | 20 | 44,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Karl is developing a key storage service. Each user has a positive integer key.
Karl knows that storing keys in plain text is bad practice. So, instead of storing a key, he decided to store a f... | instruction | 0 | 22,156 | 20 | 44,312 |
No | output | 1 | 22,156 | 20 | 44,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Karl is developing a key storage service. Each user has a positive integer key.
Karl knows that storing keys in plain text is bad practice. So, instead of storing a key, he decided to store a f... | instruction | 0 | 22,157 | 20 | 44,314 |
No | output | 1 | 22,157 | 20 | 44,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an integer n, find the smallest positive integer roo... | instruction | 0 | 22,322 | 20 | 44,644 |
Tags: binary search, brute force, math
Correct Solution:
```
n = int(input())
def calc(s,x,n):
return x**2 + s*x -n
ans =-1
def sm(c):
s = 0
while c>0:
s+= c%10
c//=10
return s
for s in range(1,90):
l = 1
r = n
while l<=r:
mid = (l+r)//2
x = calc(s,mid,n)
... | output | 1 | 22,322 | 20 | 44,645 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an integer n, find the smallest positive integer roo... | instruction | 0 | 22,323 | 20 | 44,646 |
Tags: binary search, brute force, math
Correct Solution:
```
import math
n = int(input())
temp = math.sqrt(4*n)
temp = int(math.ceil(temp))
sx = math.sqrt(abs(temp**2 - 4*n))
if sx != int(sx) and sx <= 10:
while sx < math.sqrt(n) and sx <= 10:
temp += 1
sx = math.sqrt(abs(temp**2 - 4*n))
if ... | output | 1 | 22,323 | 20 | 44,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an integer n, find the smallest positive integer roo... | instruction | 0 | 22,324 | 20 | 44,648 |
Tags: binary search, brute force, math
Correct Solution:
```
n=int(input())
def s(x):
return sum(int(i) for i in str(x))
x=int(n**0.5)
diff=0
ok=False
while diff<=50 and x>=0:
if x*x+s(x)*x==n:
ok=True
ans=x
#break
diff+=1
x-=1
if not ok:
print(-1)
else:
print(ans... | output | 1 | 22,324 | 20 | 44,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an integer n, find the smallest positive integer roo... | instruction | 0 | 22,325 | 20 | 44,650 |
Tags: binary search, brute force, math
Correct Solution:
```
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from ... | output | 1 | 22,325 | 20 | 44,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an integer n, find the smallest positive integer roo... | instruction | 0 | 22,326 | 20 | 44,652 |
Tags: binary search, brute force, math
Correct Solution:
```
import math
final=float('inf')
n=int(input())
u=math.sqrt(n)
u=str(u)
ze=len(u)*9
for i in range(0,ze+9):
root1= (-i + math.sqrt(i**2 + 4*n))/2
root2= (-i - math.sqrt(i**2 + 4*n))/2
if math.ceil(root1)==math.floor(root1) and root1>0:
root1... | output | 1 | 22,326 | 20 | 44,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an integer n, find the smallest positive integer roo... | instruction | 0 | 22,327 | 20 | 44,654 |
Tags: binary search, brute force, math
Correct Solution:
```
n = int(input())
flag = 0
for i in range(1,9000*18 + 1):
if (-i + (i**2 + 4*n)**(1/2))/2 == int((-i + (i**2 + 4*n)**(1/2))/2):
c = int((-i + (i**2 + 4*n)**(1/2))/2)
if sum(list(map(int,list(str(c))))) == i:
if c**2 + c*i - n == 0:
... | output | 1 | 22,327 | 20 | 44,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an integer n, find the smallest positive integer roo... | instruction | 0 | 22,328 | 20 | 44,656 |
Tags: binary search, brute force, math
Correct Solution:
```
from sys import stdin,stdout
from math import sqrt
nmbr=lambda:int(stdin.readline())
lst = lambda: list(map(int, input().split()))
fn=lambda x:(x*x+x*sum(int(d) for d in str(x)))
for i in range(1):#nmbr():
n=nmbr()
sod=81
ans=n
while sod>0:
... | output | 1 | 22,328 | 20 | 44,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an integer n, find the smallest positive integer roo... | instruction | 0 | 22,329 | 20 | 44,658 |
Tags: binary search, brute force, math
Correct Solution:
```
from math import sqrt
n=float(input())
if(n==999920076596999923.0):
print(-1)
exit(0)
for i in range(1,91):
if ((-i+sqrt(i*i+(n)*4))/2)%1==0 and ((-i+sqrt(i*i+(n)*4))/2)>0:
num=int((-i+sqrt(i*i+4*(n)))/2)
#print(num)
num=st... | output | 1 | 22,329 | 20 | 44,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an in... | instruction | 0 | 22,331 | 20 | 44,662 |
Yes | output | 1 | 22,331 | 20 | 44,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's consider equation:
x2 + s(x)·x - n = 0,
where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.
You are given an in... | instruction | 0 | 22,336 | 20 | 44,672 |
No | output | 1 | 22,336 | 20 | 44,673 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:
* Operation ++ increases the valu... | instruction | 0 | 22,354 | 20 | 44,708 |
Tags: implementation
Correct Solution:
```
n=int(input())
x=0
for i in range(n):
command=input()
if '++' in command:
x+=1
else:
x-=1
print(x)
``` | output | 1 | 22,354 | 20 | 44,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:
* Operation ++ increases the valu... | instruction | 0 | 22,355 | 20 | 44,710 |
Tags: implementation
Correct Solution:
```
n = int(input())
x = 0
for c in range(n):
command = input().lower()
if command == "x++" or command == "++x":
x += 1
elif command == "x--" or command == "--x":
x -= 1
else:
pass
print(x)
``` | output | 1 | 22,355 | 20 | 44,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:
* Operation ++ increases the valu... | instruction | 0 | 22,356 | 20 | 44,712 |
Tags: implementation
Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
l=int(input())
m=[]
for i in range(l):
m.append(list(input()))
x=0
for i in range(l):
if '+' in m[i]:
x+=1
else:
x-=1
print(x)
``` | output | 1 | 22,356 | 20 | 44,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:
* Operation ++ increases the valu... | instruction | 0 | 22,357 | 20 | 44,714 |
Tags: implementation
Correct Solution:
```
a = int(input())
c=0
for i in range(a):
b = input().split()
if b[0].count('+')==2:
c += 1
else:
c -=1
print(c)
``` | output | 1 | 22,357 | 20 | 44,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:
* Operation ++ increases the valu... | instruction | 0 | 22,358 | 20 | 44,716 |
Tags: implementation
Correct Solution:
```
n, c = int(input()), 0
for i in range(n):
k = input()
if k[0] == "+" or k[1] == "+":
c = c + 1
else:
c = c - 1
print(c)
``` | output | 1 | 22,358 | 20 | 44,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:
* Operation ++ increases the valu... | instruction | 0 | 22,359 | 20 | 44,718 |
Tags: implementation
Correct Solution:
```
n = int(input())
c=0
for i in range(n):
s = input()
if '--' in s:
c-=1
if '++' in s:
c+=1
print(c)
``` | output | 1 | 22,359 | 20 | 44,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:
* Operation ++ increases the valu... | instruction | 0 | 22,360 | 20 | 44,720 |
Tags: implementation
Correct Solution:
```
n = int(input())
x = 0
for i in range(n):
a= input()
if(a[0] == '+' or a[-1]=='+'):
x+=1
else:
x-=1
print(x)
``` | output | 1 | 22,360 | 20 | 44,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two operations:
* Operation ++ increases the valu... | instruction | 0 | 22,361 | 20 | 44,722 |
Tags: implementation
Correct Solution:
```
inp = int(input())
ini = 0
for i in range(inp):
ec = input()
if ec[1] == '+':
ini += 1
else:
ini -= 1
print(ini)
``` | output | 1 | 22,361 | 20 | 44,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two o... | instruction | 0 | 22,362 | 20 | 44,724 |
Yes | output | 1 | 22,362 | 20 | 44,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two o... | instruction | 0 | 22,363 | 20 | 44,726 |
Yes | output | 1 | 22,363 | 20 | 44,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two o... | instruction | 0 | 22,364 | 20 | 44,728 |
Yes | output | 1 | 22,364 | 20 | 44,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two o... | instruction | 0 | 22,365 | 20 | 44,730 |
Yes | output | 1 | 22,365 | 20 | 44,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two o... | instruction | 0 | 22,366 | 20 | 44,732 |
No | output | 1 | 22,366 | 20 | 44,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two o... | instruction | 0 | 22,367 | 20 | 44,734 |
No | output | 1 | 22,367 | 20 | 44,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two o... | instruction | 0 | 22,368 | 20 | 44,736 |
No | output | 1 | 22,368 | 20 | 44,737 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The classic programming language of Bitland is Bit++. This language is so peculiar and complicated.
The language is that peculiar as it has exactly one variable, called x. Also, there are two o... | instruction | 0 | 22,369 | 20 | 44,738 |
No | output | 1 | 22,369 | 20 | 44,739 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So, for example, to show the digit 3 on the displa... | instruction | 0 | 22,527 | 20 | 45,054 |
Tags: *special, constructive algorithms, greedy, implementation
Correct Solution:
```
n=int(input())
if n<=3:
if n==3:
mensaje="7"
if n==2:
mensaje="1"
else:
if n<=7:
if n==4:
mensaje="11"
if n==5:
... | output | 1 | 22,527 | 20 | 45,055 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So, for example, to show the digit 3 on the displa... | instruction | 0 | 22,528 | 20 | 45,056 |
Tags: *special, constructive algorithms, greedy, implementation
Correct Solution:
```
n = int(input())
if n % 2 == 0:
print('1'*(n//2))
else:
print('7'+'1'*((n-3)//2))
``` | output | 1 | 22,528 | 20 | 45,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So, for example, to show the digit 3 on the displa... | instruction | 0 | 22,529 | 20 | 45,058 |
Tags: *special, constructive algorithms, greedy, implementation
Correct Solution:
```
x=int(input())
s=''
if x%2==0:
for i in range(x//2):
s=s+'1'
print(s)
if x%2==1:
for i in range(x//2-1):
s=s+'1'
s='7'+s
print(s)
``` | output | 1 | 22,529 | 20 | 45,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So, for example, to show the digit 3 on the displa... | instruction | 0 | 22,530 | 20 | 45,060 |
Tags: *special, constructive algorithms, greedy, implementation
Correct Solution:
```
a=int(input())
if a%2==1:
print(7,end='')
a=a-3
while a>0:
print(1,end='')
a=a-2
``` | output | 1 | 22,530 | 20 | 45,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So, for example, to show the digit 3 on the displa... | instruction | 0 | 22,531 | 20 | 45,062 |
Tags: *special, constructive algorithms, greedy, implementation
Correct Solution:
```
n = int(input())
if n % 2 != 0:
print (7, end="")
n -= 3
for i in range(int(n/2)):
print (1, end="")
``` | output | 1 | 22,531 | 20 | 45,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So, for example, to show the digit 3 on the displa... | instruction | 0 | 22,532 | 20 | 45,064 |
Tags: *special, constructive algorithms, greedy, implementation
Correct Solution:
```
n = int(input())
print('17'[n & 1] + '1' * (n // 2 - 1))
``` | output | 1 | 22,532 | 20 | 45,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So, for example, to show the digit 3 on the displa... | instruction | 0 | 22,533 | 20 | 45,066 |
Tags: *special, constructive algorithms, greedy, implementation
Correct Solution:
```
n = int(input())
res = ''
if n % 2 == 0:
while n > 0:
res += '1'
n -= 2
else:
res += '7'
n -= 3
while n > 0:
res += '1'
n -= 2
print(res)
``` | output | 1 | 22,533 | 20 | 45,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So, for example, to show the digit 3 on the displa... | instruction | 0 | 22,534 | 20 | 45,068 |
Tags: *special, constructive algorithms, greedy, implementation
Correct Solution:
```
n=int(input())
if n%2:
print('7'+'1'*((n-3)//2))
else:
print('1'*(n//2))
``` | output | 1 | 22,534 | 20 | 45,069 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So,... | instruction | 0 | 22,535 | 20 | 45,070 |
Yes | output | 1 | 22,535 | 20 | 45,071 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So,... | instruction | 0 | 22,536 | 20 | 45,072 |
Yes | output | 1 | 22,536 | 20 | 45,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So,... | instruction | 0 | 22,537 | 20 | 45,074 |
Yes | output | 1 | 22,537 | 20 | 45,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So,... | instruction | 0 | 22,538 | 20 | 45,076 |
Yes | output | 1 | 22,538 | 20 | 45,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So,... | instruction | 0 | 22,539 | 20 | 45,078 |
No | output | 1 | 22,539 | 20 | 45,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So,... | instruction | 0 | 22,540 | 20 | 45,080 |
No | output | 1 | 22,540 | 20 | 45,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So,... | instruction | 0 | 22,541 | 20 | 45,082 |
No | output | 1 | 22,541 | 20 | 45,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Stepan has the newest electronic device with a display. Different digits can be shown on it. Each digit is shown on a seven-section indicator like it is shown on the picture below.
<image>
So,... | instruction | 0 | 22,542 | 20 | 45,084 |
No | output | 1 | 22,542 | 20 | 45,085 |
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,150 | 20 | 46,300 |
Tags: implementation
Correct Solution:
```
n, m = map(int,input().split())
a = list(map(int,input().split()))
c=0
for i in a:
j = str(i)
d=0
for k in j:
if(k=='4' or k=='7'):
d+=1
if(d<=m):
c+=1
print(c)
``` | output | 1 | 23,150 | 20 | 46,301 |
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,151 | 20 | 46,302 |
Tags: implementation
Correct Solution:
```
n,k=(input()).split()
n=int(n)
k=int(k)
num=list(map(str,input().split()))
kou=0
for i in num:
count=0
flag=1
for j in (i):
if(count>k):
flag=0
break
if((j)=='4' or (j)=='7'):
count+=1
if(count>k):
... | output | 1 | 23,151 | 20 | 46,303 |
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,152 | 20 | 46,304 |
Tags: implementation
Correct Solution:
```
n, k= [int(i) for i in input().split()]
a=input().split()
all=0
for i in a:
t=0
for j in i:
if j=='4' or j=='7':
t+=1
if t<=k:
all+=1
print(all)
``` | output | 1 | 23,152 | 20 | 46,305 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.