about | help | code help+videos | done | prefs |
First, solve this problem: https://codingbat.com/prob/p204297 and then come to the current problem. Define a function that when passed an integer, returns the number of prime factors of the number. Note that if a number is a prime, it has only one prime factor: the number itself. count_prime_factors(73) → 1 count_prime_factors(77) → 2 count_prime_factors(27161) → 2 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 6 Post-solution available
Copyright Nick Parlante 2017 - privacy