title: Finding Power Prime Number P N 1
signature: findingPowerPrimeNumberPN1 :: Integer -> Integer -> Integer
  findingPowerPrimeNumberPN1 n p = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> Integer -> String
  driver n p expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n p) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (76) (43) (1) )
  
      printf "TEST-1...%s\n" (driver (77) (91) (0) )
  
      printf "TEST-2...%s\n" (driver (9) (42) (0) )
  
      printf "TEST-3...%s\n" (driver (59) (67) (0) )
  
      printf "TEST-4...%s\n" (driver (8) (52) (0) )
  
      printf "TEST-5...%s\n" (driver (97) (8) (13) )
  
      printf "TEST-6...%s\n" (driver (78) (24) (3) )
  
      printf "TEST-7...%s\n" (driver (41) (88) (0) )
  
      printf "TEST-8...%s\n" (driver (72) (61) (1) )
  
      printf "TEST-9...%s\n" (driver (71) (28) (2) )
  
source_py: def finding_power_prime_number_p_n_1(n, p):
      ans = 0
      temp = p
      while (temp <= n):
          ans += (n / temp)
          temp = (temp * p)
      return int(ans)
source_cpp: int finding_power_prime_number_p_n_1(int n, int p) {
    int ans = 0;
    int temp = p;
    while ( temp <= n ) {
      ans += n / temp;
      temp = temp * p;
    }
    return ans;
  }