title: Count Numbers That Dont Contain 3
signature: function countNumbersThatDontContain3(n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return Math.abs(actual - expected) < 1e-09;
  }
  
  function driver(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(85, 71.5);
    console.log(`TEST-0...${result}`);
  
    result = driver(86, 73.39999999999999);
    console.log(`TEST-1...${result}`);
  
    result = driver(3, 2.0);
    console.log(`TEST-2...${result}`);
  
    result = driver(35, 26.5);
    console.log(`TEST-3...${result}`);
  
    result = driver(59, 52.1);
    console.log(`TEST-4...${result}`);
  
    result = driver(38, 32.2);
    console.log(`TEST-5...${result}`);
  
    result = driver(33, 22.7);
    console.log(`TEST-6...${result}`);
  
    result = driver(15, 17.5);
    console.log(`TEST-7...${result}`);
  
    result = driver(75, 62.5);
    console.log(`TEST-8...${result}`);
  
    result = driver(74, 60.6);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def count_numbers_that_dont_contain_3(n):
      if (n < 3):
          return n
      elif ((n >= 3) and (n < 10)):
          return (n - 1)
      po = 1
      while ((n / po) > 9):
          po = (po * 10)
      msd = (n / po)
      if (msd != 3):
          return (((count_numbers_that_dont_contain_3(msd) * count_numbers_that_dont_contain_3((po - 1))) + count_numbers_that_dont_contain_3(msd)) + count_numbers_that_dont_contain_3((n % po)))
      else:
          return count_numbers_that_dont_contain_3(((msd * po) - 1))
source_cpp: int count_numbers_that_dont_contain_3(int n) {
    if ( n < 3 ) return n;
    if ( n >= 3 && n < 10 ) return n - 1;
    int po = 1;
    while ( n / po > 9 ) po = po * 10;
    int msd = n / po;
    if ( msd != 3 ) return count_numbers_that_dont_contain_3 ( msd ) * count_numbers_that_dont_contain_3 ( po - 1 ) + count_numbers_that_dont_contain_3 ( msd ) + count_numbers_that_dont_contain_3 ( n % po );
    else return count_numbers_that_dont_contain_3 ( msd * po - 1 );
  }