HR30 Day 9: Recursion 문서 원본 보기

==개요==
;<nowiki>Day 9: Recursion</nowiki>
* https://www.hackerrank.com/challenges/30-recursion/problem

{{HR30 헤더}}
{{HR30 0-9}}
|}

==Java==
<syntaxhighlight lang='java'>
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {
    // Complete the factorial function below.
    static int factorial(int n) {
        if( n <= 1 ) return 1;
        return n * factorial(n-1);
    }
    private static final Scanner scanner = new Scanner(System.in);
    public static void main(String[] args) throws IOException {
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
        int n = scanner.nextInt();
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
        int result = factorial(n);
        bufferedWriter.write(String.valueOf(result));
        bufferedWriter.newLine();
        bufferedWriter.close();
        scanner.close();
    }
}
</syntaxhighlight>

==PHP==
<syntaxhighlight lang='php'>
<?php
function factorial($n) {
    if( $n <= 1 ) return 1;
    return $n * factorial($n-1);
}
$fptr = fopen(getenv("OUTPUT_PATH"), "w");
$stdin = fopen("php://stdin", "r");
fscanf($stdin, "%d\n", $n);
$result = factorial($n);
fwrite($fptr, $result . "\n");
fclose($stdin);
fclose($fptr);
</syntaxhighlight>

==Python==
<syntaxhighlight lang='python'>
#!/bin/python3
import math
import os
import random
import re
import sys

# Complete the factorial function below.
def factorial(n):
    if n<=1: return 1
    return n * factorial(n-1)
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')
    n = int(input())
    result = factorial(n)
    fptr.write(str(result) + '\n')
    fptr.close()
</syntaxhighlight>