java基础练习（java基础练习）.docVIP

java基础练习（java基础练习） 1, given 3 numbers, to find the maximum number of 3 figures. 2, the preparation of Java procedures, seeking 13+23+33+43+, +973+983+993+1003 and 3, write Java program, ask 13-23+33-43+ / +973-983+993-1003 value 4. The inverse ordinal number: an inverse ordinal is an integer that inverted an integer, such as integer 12345, which is 54321. Requirement: the inverse ordinal number of any given integer. 5, narcissus number: refers to a three or more figures, the number of bits in each of its N times the sum of power is itself. For example: 153=1*1*1+5*5*5+3*3*3 Demand 1: determine the number of users entering three digits, narcissus number? Demand 2: seek between 100-1000 cents flower number. 6, determine how many primes between 101-200, and output all primes. Program analysis: determine the prime number method: with a number of 2, respectively, to sqrt (this number), if you can be divisible, it shows that this number is not prime, and vice versa is a prime number. 7. Decompose a positive integer into a prime factor. For example: enter 90 and print out 90=2*3*3*5. Program analysis: when factoring the N, we should first find a minimum prime number, K, and then complete the following steps: (1) if the prime number is exactly n, the process of factoring the quality factor is over and printed out. (2) if nk, but n can be divisible by K, the value of K should be printed, and N divided by the quotient of K is used as the new positive integer n, and second steps are executed repeatedly. (3) if n cannot be divisible by K, then use k+1 as the value of K, and repeat the second step. 8, the use of nested operators to complete this problem: academic achievement =90 points of the students with A said, between 60-89 points with B said, 60 points following C expressed. 9, the output of 9*9 formulas. Program analysis: branch and column considered, a total of 9 lines, 9 columns, I control line, J control column. 10, isosceles triangle print arbitrary line number: progra