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
Explanation
If x is 16 then y is 28 as (2*8)%1000000007 = 16
Code Editor
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Similar Problems
Points:20
9 votes
Tags:
CombinatoricsPigeonhole principleApprovedEasyMathematicsOpenProbability and Statistics
Points:20
3 votes
Tags:
Ad-HocData StructuresOpenApprovedEasyMathamatics
Points:30
2 votes
Tags:
Dynamic ProgrammingCombinatoricsAd-HocMediumAlgorithmsMathematicsOpenApproved
Editorial
No editorial available for this problem.
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Results
Custom Input
Run your code to see the output