Supernatural
Practice
3.6 (105 votes)
Basic programming
Math
Number theory
Problem
93% Success 22832 Attempts 20 Points 1s Time Limit 256MB Memory 1024 KB Max Code
You are given a number n.
A supernatural number is a number whose product of digits is equal to n, and in this number there is no digit 1.
Count the number of supernatural numbers for a given n.
Input
Contains a single integer n, 1 <= n <= 100.
Output
Print the number of supernatural numbers.
Sample Input
4
Sample Output
2
Explanation
There are only two natural numbers, the product of the digits of which is 4 - 4, 22.
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
Submissions
Please login to view your submissions
Similar Problems
1.Password
Points:20
92 votes
Tags:
Ad-HocApprovedBrute-force searchData StructuresEasyOpen
Points:20
12 votes
Tags:
ApprovedBasic ProgrammingBrute-force searchEasyOpen
Points:20
30 votes
Tags:
ImplementationBasic ProgrammingBasics of Greedy Algorithms
Editorial
Login to unlock the editorial
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