title: Finding Power Prime Number P N
signature: double findingPowerPrimeNumberPN(int n, int p) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(double actual, double expected){
      return abs(actual - expected) < 1e-09;
  }
  
  string driver(int n, int p, double expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, p), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(49, 30, 1.6333333333333333); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(80, 25, 3.2); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(10, 9, 1.1111111111111112); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(81, 57, 1.4210526315789473); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(11, 4, 2.75); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(45, 34, 1.3235294117647058); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(86, 90, 0.0); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(27, 78, 0.0); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(80, 60, 1.3333333333333333); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(97, 31, 3.129032258064516); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def finding_power_prime_number_p_n(n, p):
      ans = 0
      temp = p
      while (temp <= n):
          ans += (n / temp)
          temp = (temp * p)
      return ans
source_cpp: int finding_power_prime_number_p_n(int n, int p) {
    int ans = 0;
    int temp = p;
    while ( temp <= n ) {
      ans += n / temp;
      temp = temp * p;
    }
    return ans;
  }