Author: nguyenvanquan7826

Threads: Input 1 number, analysis of which achievement of the prime factors. Input: A positive integer. Output: Integrated chain of alternating prime factors by commas *. Factors Descending. For example: input: 6 output: 2*3

Threads: Enter a non-negative integer decimal system. Convert them to binary. Input: An integer n. Output: Binary number of n. For example: input: 2 output: 10

Threads: Enter an integer n. The sum of n and its reverse number. Input: Some n. Output: The total to be calculated. For example: input: 123 output: 444

Threads: Enter an integer n. Find the biggest digit digits that n. Input: Some n. Output: Some of the largest digit in n. For example: input: 123 output: 3

Threads: Enter an integer n (0 < n <= 10 billion). Print out the reverse of the n. Input: Some n. Output: Some are the reverse of n. For example: input: 123 output: 321

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.