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.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10. | instruction | 0 | 18,241 | 20 | 36,482 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
if n%10>5:
n=n-n%10+10
else:
n=n-n%10
print(n)
``` | output | 1 | 18,241 | 20 | 36,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10. | instruction | 0 | 18,242 | 20 | 36,484 |
Tags: implementation, math
Correct Solution:
```
z=input
n=int(z())
if n%10==0:
print(n)
exit()
t=str(n)
if int(t[-1])>=5:
j=10-int(t[-1])
print(n+j)
if int(t[-1])<5:
print(t[:-1]+'0')
``` | output | 1 | 18,242 | 20 | 36,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10. | instruction | 0 | 18,243 | 20 | 36,486 |
Tags: implementation, math
Correct Solution:
```
a = int(input())
if(a%10==0):
print(a)
elif(a%10<5):
print(a//10*10)
else:
print((a//10+1)*10)
``` | output | 1 | 18,243 | 20 | 36,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.
Submitted Solution:
```
n=int(input())
x=n%10
if x>=5:
x=10-x
n+=x
else:
n-=x
print(n)
``` | instruction | 0 | 18,244 | 20 | 36,488 |
Yes | output | 1 | 18,244 | 20 | 36,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.
Submitted Solution:
```
i = int(input())
if (i%10 <= 5):
print(i - i%10)
else:
i += 10
print(i - i%10)
``` | instruction | 0 | 18,245 | 20 | 36,490 |
Yes | output | 1 | 18,245 | 20 | 36,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.
Submitted Solution:
```
n = int(input())
a, b = 10 * (n // 10), 10 * (n // 10) + 10
if n - a < b - n:
print(a)
else:
print(b)
``` | instruction | 0 | 18,246 | 20 | 36,492 |
Yes | output | 1 | 18,246 | 20 | 36,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.
Submitted Solution:
```
a = int(input())
if a % 10 <= 5:
a = a // 10 * 10
else:
a = a // 10 * 10 + 9
a = a + 1
print(a)
``` | instruction | 0 | 18,247 | 20 | 36,494 |
Yes | output | 1 | 18,247 | 20 | 36,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.
Submitted Solution:
```
T=list(map(int,input()))
if len(T)==1:
if T[0]>5:
print("10")
else:
print("0")
else:
if T[-1]>5:
T[-2]+=1
T[-1]=0
else:
T[-1]=0
newT=[]
for i in range(len(T)):
newT.append(str(T[i]))
print("".join(newT))
``` | instruction | 0 | 18,248 | 20 | 36,496 |
No | output | 1 | 18,248 | 20 | 36,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.
Submitted Solution:
```
n=int(input())
r=n%10
if r==0:
print(n)
else:
print(n-r)
``` | instruction | 0 | 18,249 | 20 | 36,498 |
No | output | 1 | 18,249 | 20 | 36,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.
Submitted Solution:
```
n = input()
print(n[:len(n) - 1] + '0')
``` | instruction | 0 | 18,250 | 20 | 36,500 |
No | output | 1 | 18,250 | 20 | 36,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya has a non-negative integer n. He wants to round it to nearest integer, which ends up with 0. If n already ends up with 0, Vasya considers it already rounded.
For example, if n = 4722 answer is 4720. If n = 5 Vasya can round it to 0 or to 10. Both ways are correct.
For given n find out to which integer will Vasya round it.
Input
The first line contains single integer n (0 ≤ n ≤ 109) — number that Vasya has.
Output
Print result of rounding n. Pay attention that in some cases answer isn't unique. In that case print any correct answer.
Examples
Input
5
Output
0
Input
113
Output
110
Input
1000000000
Output
1000000000
Input
5432359
Output
5432360
Note
In the first example n = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.
Submitted Solution:
```
n =int(input())
while n%10 !=0:
n-=1
print(n)
``` | instruction | 0 | 18,251 | 20 | 36,502 |
No | output | 1 | 18,251 | 20 | 36,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28. | instruction | 0 | 18,252 | 20 | 36,504 |
Tags: binary search, brute force, dp, implementation, number theory
Correct Solution:
```
def check(x):
res = 0
t = x
while (t):
res += t % 10
t //= 10
return int(res == 10)
if __name__ == "__main__":
k = int(input())
#for i in range(19, 20000001):
i = 0
while (i <= 20000000):
k -= check(i)
if (not k):
print(i)
break
i += 1
``` | output | 1 | 18,252 | 20 | 36,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28. | instruction | 0 | 18,253 | 20 | 36,506 |
Tags: binary search, brute force, dp, implementation, number theory
Correct Solution:
```
def d():
k = int(input())
firstNum = 19
l = 1
while l < k:
firstNum+=9
tmp_num = firstNum
summ = 0
while tmp_num != 0:
summ+= tmp_num % 10
tmp_num = tmp_num // 10
if summ > 10:
break
if summ != 10:
continue
l+=1
print(firstNum)
d()
``` | output | 1 | 18,253 | 20 | 36,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28. | instruction | 0 | 18,255 | 20 | 36,510 |
Tags: binary search, brute force, dp, implementation, number theory
Correct Solution:
```
def function(N):
current=1
number=19
while current<N:
number+=9
if sum(int(x) for x in (list(str(number))))==10:
current+=1
return number
N=int(input())
print(function(N))
``` | output | 1 | 18,255 | 20 | 36,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28. | instruction | 0 | 18,256 | 20 | 36,512 |
Tags: binary search, brute force, dp, implementation, number theory
Correct Solution:
```
n=int(input())
a=19
while(1):
z=a
ans=0
while(z):
ans+=z%10
z//=10
if ans==10:
n-=1
if n<=0:
print(a)
break
a+=1
``` | output | 1 | 18,256 | 20 | 36,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28. | instruction | 0 | 18,257 | 20 | 36,514 |
Tags: binary search, brute force, dp, implementation, number theory
Correct Solution:
```
def go(x):
ans = 0
while (x > 0):
ans = ans + (x % 10)
x = x//10
if (ans == 10): return 1
else: return 0
def main():
k = int(input())
i = 19
while (True):
x = go(i)
if (x == 1):
k = k-1
if (k == 0):
print(i)
exit(0)
i = i+1
main()
``` | output | 1 | 18,257 | 20 | 36,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28. | instruction | 0 | 18,258 | 20 | 36,516 |
Tags: binary search, brute force, dp, implementation, number theory
Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Thu May 7 22:07:26 2020
@author: naveen
"""
def fun(n):
ans=0
while(n):
ans=ans+n%10
n=n//10
return ans
k=int(input())
ans=19
while(k>1):
ans+=9
if(fun(ans)==10):
k-=1
print(ans)
``` | output | 1 | 18,258 | 20 | 36,517 |
Provide tags and a correct Python 3 solution for this coding contest problem.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28. | instruction | 0 | 18,259 | 20 | 36,518 |
Tags: binary search, brute force, dp, implementation, number theory
Correct Solution:
```
"""
Some of the first numbers whose digits sum to 10:
19
28
37
46
55
64
73
82
91
109
118
127
136
145
154
...
Okay, so we know how to get the next one...
Perhaps we can use maths to find out how many of each length there are?
This is partitioning ten items into buckets where the first bucket must be non-empty and not all of the things can be in the first bucket.
That makes the formula for length n:
C((10 - 1) + (n - 1), n - 1) - 1
I.e., choose n-1 separators to separate nine objects into the n buckets, then one less because of the one disallowed case.
How about just skipping a few, then brute-forcing?
The input doesn't seem that massive, 10^5, so that's probably fine.
Maybe there's even a closed form expression for the number
But how about dynamic programming?
"""
import functools
def C(n, k):
if k > n:
return 0
if n - k < k:
k = n - k
result = 1
for denominator, enumerator in enumerate(range(n - k + 1, n + 1), 1):
result = (result*enumerator)//denominator
return result
def maths_attempt():
def of_length(n):
return C((10 - 1) + (n - 1), n - 1) - 1
k = int(input())
l = 2
while True:
n = of_length(l)
if n >= k:
# If the perfect number is of this length
break
k -= n
l += 1
res = 10**(l - 1) + 9
# Add 9s, then 90s, then 900s,....
# And add these sometimes:
# 9 = 9*(0 + 1)
# 18 = 9*(1 + 1)
# 108 = 9*(11 + 1)
# 1008 = 9*(111 + 1)
# 10008 = 9*(1111 + 1)
max_digit = 1
while k > 1:
for digit in range(max_digit):
m = 10**(max_digit + 1)
a = 9*10**max_digit
while res % m != 0 and k > 1:
res += a
k -= 1
max_digit += 1
print(res)
def partitions(n, k):
"""Number of ways of putting n objects into k buckets."""
return C(n + k - 1, n)
def perfect_numbers(n):
"""Total perfect numbers of length n."""
assert partitions(10 - 1, n) - 1 == C((10 - 1) + (n - 1), n - 1) - 1 # TODO: Remove
return partitions(10 - 1, n) - 1
def dp_attempt():
k = int(input()) # 1-based enumeration
print(dp_method(k))
def dp_method(k):
@functools.lru_cache(maxsize=None)
def get(length, digit_sum):
# 0 <= digit_sum <= 10
# 0 <= length
if length == 0:
return 1 if digit_sum == 0 else 0
if digit_sum == 0:
return 1
res = 0
for digit in range(1, 10) if digit_sum == 10 else range(digit_sum + 1):
res += get(length - 1, digit_sum - digit)
return res
# Figure out the length of our number
length = 2 # The length where the first perfect number exists
while True:
of_length = get(length, 10)
if k <= of_length:
# We are now looking for the kth perfect number of length n
break
k -= of_length
length += 1
digits = [0]*length
digit_sum = 0 # Sum of digits so far
for digit_index in range(length):
for digit in range(1 if digit_index == 0 else 0, 10): # The first digit cannot be a zero
of_length = get(length - digit_index - 1, 10 - digit_sum - digit)
if k <= of_length:
digits[digit_index] = digit
digit_sum += digit
break
k -= of_length
res = 0
for digit in digits:
res = 10*res + digit
return res
def super_sanity():
expected = (n for n in range(1, 10000000) if sum(map(int, str(n))) == 10)
result = (dp_method(n) for n in range(1, 10001))
for e, r in zip(expected, result):
if e != r:
print(e, "!=", r)
#super_sanity()
dp_attempt()
``` | output | 1 | 18,259 | 20 | 36,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28.
Submitted Solution:
```
def isSum10(num):
summ=0
while num:
summ+=num%10
num=num//10
if summ==10:
return True
else:
return False
num=int(input())
i=19
while num>1:
i+=9
if isSum10(i):
# print(i,end=' ')
num-=1
print(i)
``` | instruction | 0 | 18,260 | 20 | 36,520 |
Yes | output | 1 | 18,260 | 20 | 36,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28.
Submitted Solution:
```
n = int(input())
num = 1
i = 0
while i < n :
num = num + 9
tmp_1 = num
tmp_2 = 0
while tmp_1 > 0:
tmp_2 += tmp_1 % 10
tmp_1 = tmp_1 // 10
if tmp_2 == 10:
i+=1
print(num)
``` | instruction | 0 | 18,261 | 20 | 36,522 |
Yes | output | 1 | 18,261 | 20 | 36,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28.
Submitted Solution:
```
def dig(x):
s=0
while(x!=0):
s+=x%10
x=x//10
return(s)
k=int(input())
i=0
while(k!=0):
i+=1
if(dig(i)==10):
k-=1
print(i)
``` | instruction | 0 | 18,262 | 20 | 36,524 |
Yes | output | 1 | 18,262 | 20 | 36,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28.
Submitted Solution:
```
k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i)
``` | instruction | 0 | 18,263 | 20 | 36,526 |
Yes | output | 1 | 18,263 | 20 | 36,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28.
Submitted Solution:
```
def next(x):
x = list(x)
r = -1
while r >= -len(x) and x[r] == '1':
r -= 1
x[r] = chr(ord(x[r]) - 1)
r -= 1
while (r > -len(x) - 1 and x[r] == '9'):
r -= 1
if (r == -len(x) - 1):
y = ['1'] + ['0'] * (len(x) - 1) + ['9']
#print('\t\ty')
return y
x[r] = str(int(x[r]) + 1)
#print('r = ', r)
#print(x)
x[len(x) + r + 1:] = ['0'] * (abs(r + 1))
#print(x)
s = sum([int(z) for z in x])
x[-1] = str(10 - s + int(x[-1]))
return x
x = ['1', '9']
k = int(input())
for i in range(k - 1):
x = next(x)
#print('\t\t', x)
print(''.join(x))
``` | instruction | 0 | 18,264 | 20 | 36,528 |
No | output | 1 | 18,264 | 20 | 36,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28.
Submitted Solution:
```
n=int(input())
k=1
while(n !=1):
k=k+9
n=n-1
print(k)
``` | instruction | 0 | 18,265 | 20 | 36,530 |
No | output | 1 | 18,265 | 20 | 36,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28.
Submitted Solution:
```
k = int(input())
def sc(n):
res = 0
for i in str(n):
res+=int(i)
return res
count = 0
for i in range(1, 10001):
if sc(i)==10:
count+=1
if count==k:
print(i)
break
``` | instruction | 0 | 18,266 | 20 | 36,532 |
No | output | 1 | 18,266 | 20 | 36,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k, your task is to find the k-th smallest perfect positive integer.
Input
A single line with a positive integer k (1 ≤ k ≤ 10 000).
Output
A single number, denoting the k-th smallest perfect integer.
Examples
Input
1
Output
19
Input
2
Output
28
Note
The first perfect integer is 19 and the second one is 28.
Submitted Solution:
```
def verif(k) :
test=False
a=0
ch=str(k)
i=0
for i in range(len(ch)):
a+=int(ch[i])
if a==10:
test=True
return test
k=int(input("k="))
j=0
x=10
while 1 :
x=x+9
j=j+1
if not (verif(x)) :
j=j-1
continue
if j==k :
print(x)
break
``` | instruction | 0 | 18,267 | 20 | 36,534 |
No | output | 1 | 18,267 | 20 | 36,535 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Let S(x) be sum of digits in base 10 representation of x, for example, S(123) = 1 + 2 + 3 = 6, S(0) = 0.
Your task is to find two integers a, b, such that 0 ≤ a, b ≤ n, a + b = n and S(a) + S(b) is the largest possible among all such pairs.
Input
The only line of input contains an integer n (1 ≤ n ≤ 10^{12}).
Output
Print largest S(a) + S(b) among all pairs of integers a, b, such that 0 ≤ a, b ≤ n and a + b = n.
Examples
Input
35
Output
17
Input
10000000000
Output
91
Note
In the first example, you can choose, for example, a = 17 and b = 18, so that S(17) + S(18) = 1 + 7 + 1 + 8 = 17. It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, a = 5000000001 and b = 4999999999, with S(5000000001) + S(4999999999) = 91. It can be shown that it is impossible to get a larger answer. | instruction | 0 | 18,570 | 20 | 37,140 |
Tags: greedy
Correct Solution:
```
import math
n = int(input())
def S(n):
return sum(map(int,list(str(n))))
base = 10**int(math.log10(n))
a = base-1
res = 0
for i in range(10):
b = n-a
res = max(res, S(a)+S(b))
a+=base
if a > n:
break
print(res)
``` | output | 1 | 18,570 | 20 | 37,141 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Let S(x) be sum of digits in base 10 representation of x, for example, S(123) = 1 + 2 + 3 = 6, S(0) = 0.
Your task is to find two integers a, b, such that 0 ≤ a, b ≤ n, a + b = n and S(a) + S(b) is the largest possible among all such pairs.
Input
The only line of input contains an integer n (1 ≤ n ≤ 10^{12}).
Output
Print largest S(a) + S(b) among all pairs of integers a, b, such that 0 ≤ a, b ≤ n and a + b = n.
Examples
Input
35
Output
17
Input
10000000000
Output
91
Note
In the first example, you can choose, for example, a = 17 and b = 18, so that S(17) + S(18) = 1 + 7 + 1 + 8 = 17. It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, a = 5000000001 and b = 4999999999, with S(5000000001) + S(4999999999) = 91. It can be shown that it is impossible to get a larger answer. | instruction | 0 | 18,571 | 20 | 37,142 |
Tags: greedy
Correct Solution:
```
s = input()
m = sum(map(int, list(s)))
while (len(s) > 0 and s[-1] == '9'):
s = s[:-1]
print(m + 9 * max(0, len(s) - 1))
``` | output | 1 | 18,571 | 20 | 37,143 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Let S(x) be sum of digits in base 10 representation of x, for example, S(123) = 1 + 2 + 3 = 6, S(0) = 0.
Your task is to find two integers a, b, such that 0 ≤ a, b ≤ n, a + b = n and S(a) + S(b) is the largest possible among all such pairs.
Input
The only line of input contains an integer n (1 ≤ n ≤ 10^{12}).
Output
Print largest S(a) + S(b) among all pairs of integers a, b, such that 0 ≤ a, b ≤ n and a + b = n.
Examples
Input
35
Output
17
Input
10000000000
Output
91
Note
In the first example, you can choose, for example, a = 17 and b = 18, so that S(17) + S(18) = 1 + 7 + 1 + 8 = 17. It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, a = 5000000001 and b = 4999999999, with S(5000000001) + S(4999999999) = 91. It can be shown that it is impossible to get a larger answer. | instruction | 0 | 18,572 | 20 | 37,144 |
Tags: greedy
Correct Solution:
```
def su(a):
s=0
while(a!=0):
s+=a%10
a//=10
return s
n=int(input())
l=len(str(n))
p=(n//(10**(l-1)))*(10**(l-1))-1
q=n%(10**(l-1))+1
print(su(p)+su(q))
``` | output | 1 | 18,572 | 20 | 37,145 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Let S(x) be sum of digits in base 10 representation of x, for example, S(123) = 1 + 2 + 3 = 6, S(0) = 0.
Your task is to find two integers a, b, such that 0 ≤ a, b ≤ n, a + b = n and S(a) + S(b) is the largest possible among all such pairs.
Input
The only line of input contains an integer n (1 ≤ n ≤ 10^{12}).
Output
Print largest S(a) + S(b) among all pairs of integers a, b, such that 0 ≤ a, b ≤ n and a + b = n.
Examples
Input
35
Output
17
Input
10000000000
Output
91
Note
In the first example, you can choose, for example, a = 17 and b = 18, so that S(17) + S(18) = 1 + 7 + 1 + 8 = 17. It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, a = 5000000001 and b = 4999999999, with S(5000000001) + S(4999999999) = 91. It can be shown that it is impossible to get a larger answer. | instruction | 0 | 18,573 | 20 | 37,146 |
Tags: greedy
Correct Solution:
```
def s(a):
count=0
for x in str(a):
count=count+int(x)
return count
n=int(input())
a=9
while(a<n):
a=a*10+9
a=a//10
b=n-a
print(s(a)+s(b))
``` | output | 1 | 18,573 | 20 | 37,147 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Let S(x) be sum of digits in base 10 representation of x, for example, S(123) = 1 + 2 + 3 = 6, S(0) = 0.
Your task is to find two integers a, b, such that 0 ≤ a, b ≤ n, a + b = n and S(a) + S(b) is the largest possible among all such pairs.
Input
The only line of input contains an integer n (1 ≤ n ≤ 10^{12}).
Output
Print largest S(a) + S(b) among all pairs of integers a, b, such that 0 ≤ a, b ≤ n and a + b = n.
Examples
Input
35
Output
17
Input
10000000000
Output
91
Note
In the first example, you can choose, for example, a = 17 and b = 18, so that S(17) + S(18) = 1 + 7 + 1 + 8 = 17. It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, a = 5000000001 and b = 4999999999, with S(5000000001) + S(4999999999) = 91. It can be shown that it is impossible to get a larger answer. | instruction | 0 | 18,574 | 20 | 37,148 |
Tags: greedy
Correct Solution:
```
def S (num):
soma = 0
while num != 0:
soma += num%10
num = num//10
return soma
n = input()
a = []
for i in range(len(n)-1):
a.append(9)
aux = int(n[0]) - 1
a = [aux] + a
for i in range(len(a)):
a[i] = str(a[i])
a = "".join(a)
a = int(a)
n = int(n)
b = n - a
print(S(a) + S(b))
``` | output | 1 | 18,574 | 20 | 37,149 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Let S(x) be sum of digits in base 10 representation of x, for example, S(123) = 1 + 2 + 3 = 6, S(0) = 0.
Your task is to find two integers a, b, such that 0 ≤ a, b ≤ n, a + b = n and S(a) + S(b) is the largest possible among all such pairs.
Input
The only line of input contains an integer n (1 ≤ n ≤ 10^{12}).
Output
Print largest S(a) + S(b) among all pairs of integers a, b, such that 0 ≤ a, b ≤ n and a + b = n.
Examples
Input
35
Output
17
Input
10000000000
Output
91
Note
In the first example, you can choose, for example, a = 17 and b = 18, so that S(17) + S(18) = 1 + 7 + 1 + 8 = 17. It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, a = 5000000001 and b = 4999999999, with S(5000000001) + S(4999999999) = 91. It can be shown that it is impossible to get a larger answer. | instruction | 0 | 18,575 | 20 | 37,150 |
Tags: greedy
Correct Solution:
```
def max_sum(x):
digit = 0
carry = 0
result = 0
while x > 0:
digit = x % 10
x //= 10
if (digit == 9 and carry == 0) or x == 0:
result += (digit - carry)
carry = 0
else:
result += 10 + digit - carry
carry = 1
print(result)
max_sum(int(input()))
``` | output | 1 | 18,575 | 20 | 37,151 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Let S(x) be sum of digits in base 10 representation of x, for example, S(123) = 1 + 2 + 3 = 6, S(0) = 0.
Your task is to find two integers a, b, such that 0 ≤ a, b ≤ n, a + b = n and S(a) + S(b) is the largest possible among all such pairs.
Input
The only line of input contains an integer n (1 ≤ n ≤ 10^{12}).
Output
Print largest S(a) + S(b) among all pairs of integers a, b, such that 0 ≤ a, b ≤ n and a + b = n.
Examples
Input
35
Output
17
Input
10000000000
Output
91
Note
In the first example, you can choose, for example, a = 17 and b = 18, so that S(17) + S(18) = 1 + 7 + 1 + 8 = 17. It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, a = 5000000001 and b = 4999999999, with S(5000000001) + S(4999999999) = 91. It can be shown that it is impossible to get a larger answer. | instruction | 0 | 18,576 | 20 | 37,152 |
Tags: greedy
Correct Solution:
```
n=input()
m=len(n)
a='9'*(m-1)
if a=='':
a='0'
b=str(int(n)-int(a))
s=0
for i in (a+b):
s+=int(i)
print(s)
``` | output | 1 | 18,576 | 20 | 37,153 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer n.
Let S(x) be sum of digits in base 10 representation of x, for example, S(123) = 1 + 2 + 3 = 6, S(0) = 0.
Your task is to find two integers a, b, such that 0 ≤ a, b ≤ n, a + b = n and S(a) + S(b) is the largest possible among all such pairs.
Input
The only line of input contains an integer n (1 ≤ n ≤ 10^{12}).
Output
Print largest S(a) + S(b) among all pairs of integers a, b, such that 0 ≤ a, b ≤ n and a + b = n.
Examples
Input
35
Output
17
Input
10000000000
Output
91
Note
In the first example, you can choose, for example, a = 17 and b = 18, so that S(17) + S(18) = 1 + 7 + 1 + 8 = 17. It can be shown that it is impossible to get a larger answer.
In the second test example, you can choose, for example, a = 5000000001 and b = 4999999999, with S(5000000001) + S(4999999999) = 91. It can be shown that it is impossible to get a larger answer. | instruction | 0 | 18,577 | 20 | 37,154 |
Tags: greedy
Correct Solution:
```
c = int(input())
k1 = ((c//2)//10**(len(list(str(c//2)))-1)+1) * 10**(len(list(str(c//2)))-1) -1
k2 = c-k1
k1 = list(map(int,str(k1)))
k2 = list(map(int,str(k2)))
print(sum(k1)+sum(k2))
``` | output | 1 | 18,577 | 20 | 37,155 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO | instruction | 0 | 18,608 | 20 | 37,216 |
Tags: math
Correct Solution:
```
# a, b = map(int, input().split())
a = int(input())
b = int(input())
i = 0
while a ** i < b:
i += 1
if b == a ** i:
print("YES")
print(i - 1)
else:
print("NO")
``` | output | 1 | 18,608 | 20 | 37,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO | instruction | 0 | 18,609 | 20 | 37,218 |
Tags: math
Correct Solution:
```
k = int(input())
l = int(input())
b = k
p = 0
if k==l:
print('YES')
print(0)
else:
while b < l:
b = b * k
p = p + 1
if b==l:
print('YES')
print(p)
else:
print('NO')
``` | output | 1 | 18,609 | 20 | 37,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO | instruction | 0 | 18,610 | 20 | 37,220 |
Tags: math
Correct Solution:
```
c=0
def r():
k=int(input())
l=int(input())
t=k
while(t<=l):
if t==l:
return"YES"
global c
c+=1
t*=k
c=-1
return"NO"
print(r())
if c!=-1:print(c)
``` | output | 1 | 18,610 | 20 | 37,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO | instruction | 0 | 18,611 | 20 | 37,222 |
Tags: math
Correct Solution:
```
k=int(input())
L=int(input())
st,x=1,0
while st<L:
st*=k
x+=1
if st==L:
print("YES")
print(x-1)
else:
print("NO")
``` | output | 1 | 18,611 | 20 | 37,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO | instruction | 0 | 18,612 | 20 | 37,224 |
Tags: math
Correct Solution:
```
k=int(input())
l=int(input())
r=0
j=2
t=k
while(k<l):
k=t**j
r=r+1
j=j+1
if(k==l):
print("YES")
print(r)
else:
print("NO")
``` | output | 1 | 18,612 | 20 | 37,225 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO | instruction | 0 | 18,613 | 20 | 37,226 |
Tags: math
Correct Solution:
```
a = int(input())
b = int(input())
i = 0
c = a
while a < b:
a *= c
i += 1
if a == b:
print('YES')
print(i)
else:
print('NO')
``` | output | 1 | 18,613 | 20 | 37,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO | instruction | 0 | 18,614 | 20 | 37,228 |
Tags: math
Correct Solution:
```
n=int(input())
l=int(input())
a=[]
pow=0
i=1
while pow<=l+1:
pow=n**i
a.append(pow)
i+=1
#print(a)
if l in a :
print('YES')
print([a.index(l),'1'][n==1 and l==1])
else :
print('NO')
``` | output | 1 | 18,614 | 20 | 37,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO | instruction | 0 | 18,615 | 20 | 37,230 |
Tags: math
Correct Solution:
```
n=int(input())
l=int(input())
k=0
while l%n==0 and l!=n :
l=l//n
k=k+1
if l%n!=0 :
print('NO')
else :
print('YES')
print(k)
``` | output | 1 | 18,615 | 20 | 37,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO
Submitted Solution:
```
k, l, la = int(input()), int(input()), 0
la = 0
def find_root(l, k):
global la
if l == k:
return True
if l % k != 0 or l < k * k:
return False
la += 1
l /= k
return find_root(l, k)
if find_root(l, k):
print('YES')
print(la)
else:
print('NO')
``` | instruction | 0 | 18,616 | 20 | 37,232 |
Yes | output | 1 | 18,616 | 20 | 37,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO
Submitted Solution:
```
k=int(input())
kk=int(input())
d=-1
c=0
while kk>0:
if kk==1:
break
else:
if kk%k==0:
d=d+1
kk=kk//k
else:
c=-1
break
if c==-1:
print('NO')
else:
print('YES')
print(d)
``` | instruction | 0 | 18,617 | 20 | 37,234 |
Yes | output | 1 | 18,617 | 20 | 37,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO
Submitted Solution:
```
import sys
first_num = int(sys.stdin.readline())
second_num = int(sys.stdin.readline())
count = 0
first = first_num
while first < second_num:
first *= first_num
count += 1
if first == second_num:
print("YES")
print(count)
else:
print("NO")
``` | instruction | 0 | 18,618 | 20 | 37,236 |
Yes | output | 1 | 18,618 | 20 | 37,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO
Submitted Solution:
```
k=int(input())
l=int(input())
c=-1
r=k
while l%k==0:
l=l//k
c+=1
if l!=1:
print("NO")
else:
print("YES")
print(c)
``` | instruction | 0 | 18,619 | 20 | 37,238 |
Yes | output | 1 | 18,619 | 20 | 37,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO
Submitted Solution:
```
import sys
#my_file = sys.stdin
#my_file = open("input.txt", "r")
k = int(input())
l = int(input())
for i in range(1, int(l**(1/k))+1):
if k**i == l:
print("YES")
print(i-1)
break
else:
print("NO")
``` | instruction | 0 | 18,620 | 20 | 37,240 |
No | output | 1 | 18,620 | 20 | 37,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO
Submitted Solution:
```
def cifera():
k = int(input())
l = int(input())
la_counter = 0
temp = k
while k < l:
k *= temp
la_counter += 1
if k > l:
la_counter = 0
elif la_counter == 0 & k == 1:
print("YES\n", la_counter)
elif la_counter == 0 & k != 1:
print("NO\n")
elif la_counter > 0:
print("YES\n", la_counter)
if __name__ == '__main__':
cifera()
``` | instruction | 0 | 18,621 | 20 | 37,242 |
No | output | 1 | 18,621 | 20 | 37,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO
Submitted Solution:
```
from math import log, ceil
base = int(input())
power = int(input())
a = ceil(log(power)/log(base))
print('YES\n'+str(a-1) if base**a == power else 'NO')
``` | instruction | 0 | 18,622 | 20 | 37,244 |
No | output | 1 | 18,622 | 20 | 37,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.
Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number k. Moreover, petricium la petricium stands for number k2, petricium la petricium la petricium stands for k3 and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.
Petya's invention brought on a challenge that needed to be solved quickly: does some number l belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.
Input
The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).
Output
You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number l.
Examples
Input
5
25
Output
YES
1
Input
3
8
Output
NO
Submitted Solution:
```
import sys
import math
n = int(input().strip())
k = int(input().strip())
if n == k:
print("YES\n0")
sys.exit(0)
l = [n**i for i in range(1,int(math.sqrt(n)+1)) if n <= k]
if k in l:
print("YES\n{}".format(l.index(k)))
else:
print("NO")
``` | instruction | 0 | 18,623 | 20 | 37,246 |
No | output | 1 | 18,623 | 20 | 37,247 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.