--- --- restore content begins
One: print out all the "number of Narcissus", the so-called "number Narcissus" means a 3-digit number, which is equal to the digits of the cube and the number itself. For example, 153 is a "number daffodils."
Two: write Java programs, find the value of + 13-23 + 33-43 + 973-983 + 993-1003 ... of.
Three: Programming seek 1! +2! +3! + ... + 20!
Four: write Java programs, the calculation 8 + 88 + 888 + 10 ... and before it.
Five: If a number is exactly equal to the sum of its factors, this number is called the complete number. All finished programming the number of output within 1000.
VI: preparation of the application, output the maximum positive integer satisfying 1 + 2 + 3 + ... + n <8888's.
Seven: Use a for loop to print the graphic below.
Course Summary: This week JAVA study learned a lot, but I did not get to know many places, such as stack memory usage and meaning; there forcibly convert the data type of the method last say; also touch in the process of doing problems to many, many issues; start the first question you want to call pow function, but does not know how to use, there is a fourth title still do not know how the conversion of data types, no do it; I did not expect there to start the sixth title this way , I started to define i is less than 1000, make sum + = i> all i values of 8888, the minimum value of the output i-1 to meet the conditions, but finally do wrong, write up.