Supernatural
Practice
3.6 (105 votes)
Basic programming
Math
Number theory
Problem
93% Success 22811 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.
Submissions
Please login to view your submissions
Similar Problems
Points:20
15 votes
Tags:
Basic Programming
Points:20
29 votes
Tags:
Ad-HocAlgorithmsBasic ProgrammingBasics of ImplementationEasyImplementation
Points:20
38 votes
Tags:
ApprovedData StructuresEasyImplementationOpen
Editorial