fork(1) download
  1. class Ideone
  2. {
  3. static int[] prime = { 2, 3, 5, 7, 11, 13, 17, 23, 29, 31 };
  4. static long limit = 10_0000_0000;
  5. static long maxNumber;
  6. static int maxYakusu;
  7.  
  8. public static void main(String[] args)
  9. {
  10. search(1, 1, 0, Integer.MAX_VALUE);
  11. System.out.printf("数値: %d, 約数の数: %d%n", maxNumber, maxYakusu);
  12. }
  13.  
  14. static void search(long number, int yakusu, int n, int l)
  15. {
  16. int newYakusu = yakusu;
  17. for (int i = 1; i <= l && number * prime[n] <= limit; i++)
  18. {
  19. newYakusu += yakusu;
  20. number *= prime[n];
  21. if (newYakusu > maxYakusu)
  22. {
  23. maxYakusu = newYakusu;
  24. maxNumber = number;
  25. }
  26. search(number, newYakusu, n + 1, i);
  27. }
  28. }
  29. }
Success #stdin #stdout 0.05s 320576KB
stdin
Standard input is empty
stdout
数値: 735134400, 約数の数: 1344