Supernatural
Practice
3.6 (105 votes)
Basic programming
Math
Number theory
Problem
93% Success 22828 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.
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
178 votes
Tags:
GeometryHiringApprovedEasy
Points:20
7 votes
Tags:
Basic ProgrammingBasics of ImplementationEasyImplementationString Manipulation
Points:20
45 votes
Tags:
Ad-HocApprovedEasyOpen
Editorial
Login to unlock the editorial