Powerful Digit Counts

#include <iostream>
#include <cmath>

int powerful_digit_counts() {
    int count = 0;
    for (int a = 1; a <= 9; ++a) {
        double log_a = std::log10(static_cast<double>(a));
        int max_n = static_cast<int>(1.0 / (1.0 - log_a));
        count += max_n;
    }
    return count;
}

#if ! defined UNITTEST_MODE
int main(int argc, char const *argv[]) {
    std::cout << powerful_digit_counts() << std::endl;
}
#endif

package org.tvarley.euler.solutions;

import org.tvarley.euler.Solution;

public class Solution063 implements Solution {
  public String solve() {
    int count = 0;
    for (int a = 1; a <= 9; a++) {
      double logA = Math.log10(a);
      int maxN = (int) (1.0 / (1.0 - logA));
      count += maxN;
    }
    return String.valueOf(count);
  }
}

function powerfulDigitCounts() {
  let count = 0;
  for (let a = 1; a <= 9; a++) {
    const logA = Math.log10(a);
    const maxN = Math.floor(1.0 / (1.0 - logA));
    count += maxN;
  }
  return count;
}

module.exports = {
  answer: () => powerfulDigitCounts()
};

import math

def solve():
    count = 0
    for a in range(1, 10):
        log_a = math.log10(a)
        max_n = int(1.0 / (1.0 - log_a))
        count += max_n
    return count

package main

import (
  "fmt"
  "math"
)

func powerfulDigitCounts() int {
  count := 0
  for a := 1; a <= 9; a++ {
    logA := math.Log10(float64(a))
    maxN := int(1.0 / (1.0 - logA))
    count += maxN
  }
  return count
}

func main() {
  fmt.Println(powerfulDigitCounts())
}

pub fn powerful_digit_counts() -> u32 {
    let mut count = 0;
    for a in 1..=9 {
        let log_a = (a as f64).log10();
        let max_n = (1.0 / (1.0 - log_a)) as u32;
        count += max_n;
    }
    count
}