[Hacker Rank] Extra Long Factorials (Go)
Problem (문제) The factorial of the integer n, written n!, is defined as: 정수 n의 팩토리얼, n!은 다음과 같다. n!=n*(n-1)*(n-2)*···*3*2*1 Calculate and print the factorial of a given integer. 주어진 정수의 팩토리얼을 계산하고 출력하세요. For example, if n=30, we calculate 30*29*28*···*2*1 and get 265252859812191058636308480000000. 예를 들어, n=30일 때, 30*29*28*···*2*1을 계산하면 265252859812191058636308480000000입니다. Function Description (함..
[Hacker Rank] Apple and Orange (Javascript)
Problem (문제) Sam's house has an apple tree and an orange tree that yield an abundance of fruit. In the diagram below, the red region denotes his house, where s is the start point, and t is the endpoint. The apple tree is to the left of his house, and the orange tree is to its right. You can assume the trees are located on a single point, where the apple tree is at point a, and the orange tree is..
[Hacker Rank] Birthday Cake Candles (Javascript)
Difficulty Easy Language Javascript Problem (문제) You are in charge of the cake for your niece's birthday and have decided the cake will have one candle for each year of her total age. When she blows out the candles, she’ll only be able to blow out the tallest ones. Your task is to find out how many candles she can successfully blow out. 당신은 당신의 조카 생일을 위해 케이크를 담당하고 있으며 케이크는 그녀의 연령만큼 양초를 가질 것이라고 결..