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.
Threads: Write test program 1 there is the perfect number does not? Perfect number is a positive integer equal the sum of the positive divisors 2 times it. example No. 6 the Convention 1, 2, 3, 6 and total 1 + 2 + 3 + 6 = 12 (equal 2 time
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:
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”
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
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.
Threads: Write a program to calculate S = 1 + 1/2 + 1/3 + … + 1/N Inputs: A positive integer N. Output: Results total S. Results rounded to 6 decimal. For example: input: 1 output: 1.000000
Threads: Enter a non-negative integer n, and print out n! Input: A non-negative integer n. Output: An integer value of n! For example: input: 2 output: 2
Threads: Enter an integer n. Refined total numbers from 1 to the N. Input: An integer n. Output: An integer is the sum of the number of words 1 to the N. For example: input: 3 output: 6
Threads: Enter an integer n. Print out the number from 1 to the N. Input: A single integer n Output: A line consists of numbers separated by spaces from 1 to the N. For example: input: 3 output: 1 2 3
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
