fork download
  1. class Kaijou {
  2. public static void main(String[] args) {
  3. for (long i = 0L; i <= 20L; i++) {
  4. System.out.println(i + "の階乗は" + kaijou(i));
  5. }
  6. }
  7. public static long kaijou(long num) {
  8. if (num == 0L) { return 1L; }
  9. if (num >= 1L) {
  10. return ( num * kaijou(num - 1L) );
  11. }
  12. return 0L;
  13. }
  14. }
Success #stdin #stdout 0.09s 27544KB
stdin
Standard input is empty
stdout
0の階乗は1
1の階乗は1
2の階乗は2
3の階乗は6
4の階乗は24
5の階乗は120
6の階乗は720
7の階乗は5040
8の階乗は40320
9の階乗は362880
10の階乗は3628800
11の階乗は39916800
12の階乗は479001600
13の階乗は6227020800
14の階乗は87178291200
15の階乗は1307674368000
16の階乗は20922789888000
17の階乗は355687428096000
18の階乗は6402373705728000
19の階乗は121645100408832000
20の階乗は2432902008176640000