WEBSITE RETURNED, HOWEVER SUBMIT QUANTITY IS RESTRICTED PER DAY TO VERY LITTLE (UNDER JUDGE0 NEW POLICY, API PROVIDER). Therefore it is very much for you to pay attention TEST CAREFULLY CODE BEFORE SUBMIT.

Category: Loop

Nth Fibonacci number

Threads: Write a program that counts the n th Fibonacci sequence known sequence f(n) = f(n-1) + f(n-2), n > 2 and f(1) = 1, f(2) = 1. Input: A positive integer n single (0 < n <= 50). Output: A single integer f(n). For example: input:

Check primes

Threads: Write test program 1 there is prime number not? Prime number is a positive integer only 2 Convention is 1 and itself. Example No. 2, 3, 5,… Input: A single integer. Output: “TRUE” if it is prime, “FALSE”

Drawing HCN Empty

Threads: Write a program to height, width of the rectangle. Draw a rectangular hollow asterisk (*) size entered. Input: A line of 2 integer n, m separated by spaces respectively the height and width. (2 < n,m) Output: HCN

HCN Special Drawing

Threads: Write a program to height, width of the rectangle. Drawing special rectangular asterisk (*) size entered. Input: A line of 2 positive integers separated by spaces, respectively the height and width. Output: HCN asterisk.

Mantra

Threads: Sugar increases are very angry Sun Wukong. He wanted to punish mantra with n times. Write a program that prints out n times the mantra that. Input: The first line contains the number n – the number of times the mantra. The second line 2 is the magic word