Smallest Positive Integer
Practice
4.1 (9 votes)
Mathematics
Easy Medium
Problem
90% Success 13668 Attempts 30 Points 1s Time Limit 256MB Memory 1024 KB Max Code
Given a number X between 0 to 1000000006 find smallest positive integer Y such that the products of digits of Y modulo 1000000007 is X.
Input Format
A single integer - X
Output Format
A single integer - Y
Input Constraint
0 <= X <= 1000000006
Problem Setter: Practo Tech Team
Submissions
Please login to view your submissions
Similar Problems
Points:30
5 votes
Tags:
AlgorithmsDynamic ProgrammingEasyOpenTwo dimensional
Points:30
60 votes
Tags:
Easy-Medium
Points:30
52 votes
Tags:
AlgorithmsApprovedEasyGraphsMinimum spanning treeOpen
Editorial
No editorial available for this problem.