HR30 Day 25: Running Time and Complexity

1 개요

해커랭크 30 Days of Code
문제	풀이
20-29 Day e
HR30 Day 20: Sorting
HR30 Day 21: Generics
HR30 Day 22: Binary Search Trees
HR30 Day 23: BST Level-Order Traversal
HR30 Day 24: More Linked Lists
HR30 Day 25: Running Time and Complexity
HR30 Day 26: Nested Logic
HR30 Day 27: Testing
HR30 Day 28: RegEx, Patterns, and Intro to Databases
HR30 Day 29: Bitwise AND

2 Java

HR30 Day 25: Running Time and Complexity/Java 문서를 참고하십시오.

3 PHP

<?php
function is_prime($n) {
    if( $n<2 ) return false;
    for($i=2; $i<=sqrt($n); $i++) if($n%$i == 0) return false;
    return true;
}
$_fp = fopen("php://stdin", "r");
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
fscanf($_fp, '%d', $n);
while($n-- > 0)  {
    fscanf($_fp, '%d', $num);
    if( is_prime($num) ) echo "Prime\n";
    else echo "Not prime\n";
}