Description: 1. Enter a few, and to its side length* component used to draw a square.
2. Solving Satisfied 1* 1+2* 2+ ... n* n < 1000 the i' s Maximum.
3. 1 ~ 1000 for the End
4. Enter a number and determine whether it is for the prime number (which is the return statement Using) 5. Output from 0 to 100 for all 3 should not be divisible by the number of
To Search:
File list (Check if you may need any files):
1.doc
Download