Java classic algorithm _ 009 "" completions "is equal to the sum of all its factors. For example, 6 = 1 + 2 + 3, evaluate all completions within 1000.

Package com. WZS;/*** title: If a number is equal to the sum of its factors, this number is called "end number ". For example, 6 = 1 + 2 + 3. Program to find all the completion numbers within 1000. ** @ Author administrator **/public class test_wzs9 {public static void main (string [] ARGs) {test_wzs9.f ();} /*** final number */public static void F () {for (INT I = 1; I <1000; I ++) {int Total = 0; // sum stringbuffer sb = new stringbuffer (); For (Int J = 1; j <I; j ++) {if (I % J = 0) {total + = J; sb. append (J + "+") ;}} if (Total = I) {system. out. println (I + "=" + sb. tostring (). substring (0, sb. length ()-2 ));}}}}

Output result:

6 = 1 + 2 + 3 28 = 1 + 2 + 4 + 7 + 14 496 = 1 + 2 + 4 + 8 + 16 + 31 + 62 + 124 + 248