Java first time job

Source: Internet
Author: User
Tags greatest common divisor

"Program 1"???
Title: Classical Question: There is a pair of rabbits, from the first 3 months after birth, every one months have a pair of rabbits. The rabbit grows a pair of rabbits every one months after the third month. If the rabbits are not dead, what is the total number of rabbits every one months? ???
"Program 2"???
Title: How many primes are inferred between 101-200. and output all prime numbers.

?
Program Analysis: The method of inferring primes: Using a number to remove 2 to sqrt ( this number ), assuming that it can be divisible, it is indicated that this number is not a prime, and vice versa is a prime.

???
"Program 3"???
Title: Print out the total number of daffodils, the so-called " Narcissus number" refers to a three-digit number. Their numbers are cubic and equal to the number itself.

For example:153 is a " Narcissus number". Due to the 153=1 three times +5 of the three parties +3 three times.
"Program 4"???
Title: Decompose a positive integer into factorization.

For example: input,Print out90=2*3*3*5. ???
Program Analysis: ForNto decompose factorization. A minimum prime number should be found first.k, and then complete the following steps as follows:???
(1)assuming this prime number is exactly equal toN, the process of decomposing the factorization has ended. You can print it out. ???
(2)Assumptionsn?<>?k, butNcan bekdivisible, you should print outkvalue and use theNdivided bykthe Business,as the new positive integerN,run the first step repeatedly. ???
(3)AssumptionsNcannot bekdivisible, then usek+1as akthe value,run the first step repeatedly. ??
The program5"???
Title: Using the conditional operator (? :) is nested to complete this topic: Academic Performance>?=90points of the students withAsaid,60-89between the pointsBsaid, -Sub-useCrepresentation.

???
The program6"???
Title: Enter two positive integersmand theN, seeking its greatest common divisor and least common multiple. ???
/**in the loop. Only the divisor is not equal to0, dividing the larger number by the smaller number, the smaller number as the large number of the next round loop, the remainder as the smaller number of the next round cycle, so the loop until the value of the smaller number is0. Returns a larger number. This number is greatest common divisor, and least common multiple is the sum of two numbers divided by greatest common divisor. *?/
The program7"???
Title: Enter a line of characters. Statistics of the number of letters, spaces, numbers and other characters (to use the scanner object, reference materials related content).???
The program8"???
Title: Asks=a+aa+aaa+aaaa+aa...athe value, amongais a number. Like2+22+222+2222+22222 (at this time jointly owned5Add number), several numbers are added with keyboard control.

???
"Program 9"???
Title: A number hypothesis is exactly equal to the sum of its factors, and this number is called the " End number".

such as 6=1 + 2 + 3. programming ????? find the 1000 all the numbers within.

???
"Program "???
Title: A ball from the height of the free fall, each landing after the reverse jump back to the original height of half, and then fall, beg it in ? Section Ten How many meters are there after the landing? How high is the first rebound??

?

Requirements: within a week, next Thursday (March 10). Included) before the 10 program Java files (10 files named Q1.java, Q2.java, Q3 ...) compression, to " School name first job " Name (e.g. 13208101 three first jobs. rar) sent to [email protected]. The subject of the message is " study number name first job ". Program yourself. Plagiarism prohibited


Java first time job

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.