Brothers, help! Solution algorithm, plus traditional flow chart. 1. Determine whether an integer is a prime number?

1, that is, through screening. LoOK at the cycle, the multiples of a prime number in a certain range are all eliminated, and the cycle is ok at the end. (Note that it is best to use Boolean array storage)

2. Store the first number in a variable, then cycle from the second number to the tenth number, and then compare. If there is a number greater than the number stored in the variable, you can assign it to the variable. You can also sort these ten numbers by sorting, such as bubbling, fast and merging.

4. It must be carried out circularly, but the difficulty lies in how to judge leap years. The number of years over the years can be divisible by four, which is a leap year; Divided by 100 but not divided by 400 is an average year; Leap years can be divisible by 100 or 400.

Specifically, you can hi me.