Algorithms for finding intimacy Pairs

Number of intimacy Pairs Algorithm

2. /** 
4. * An Algorithm for Finding intimacy pairs. <Br> 
6. * If the factor of A is equal to B, the factor of B is equal to a, and the factor of B is equal to a, and a is equal to B, then A and B are called intimacy pairs. 
8. * 
10. * @ Author Zhao Xueqing java2000.net 
12. */
14. Public ClassT {
16. Public Static VoidMain (string [] ARGs ){
18. IntNum;
20. For(IntI =2; I <=1000; I ++ ){
22. Num = getdivnumber (I );
24. If(Num> I ){
26. If(Getdivnumber (Num) = I ){
28. System. Out. println (I +"/"+ Num );
30. }
32. }
34. }
36. }
40. Public Static IntGetdivnumber (IntI ){
42. IntTotal =1;
44. IntTo = (Int) Math. SQRT (I );
46. For(IntJ =2; J <= to; j ++ ){
48. If(I % J =0){
50. Total + = J;
52. If(J! = I/J ){
54. Total + = I/J;
56. }
58. }
60. }
62. ReturnTotal;
64. }
66. }

 
/*** The search algorithm of the intimate number pair. <Br> * If the sum of A and B is equal to B, the sum of B is equal to a, and a is equal to B,, B is an intimate number pair ** @ author Zhao Xueqing java2000.net */public class t {public static void main (string [] ARGs) {int num; For (INT I = 2; I <= 1000; I ++) {num = getdivnumber (I); If (Num> I) {If (getdivnumber (Num) = I) {system. out. println (I + "/" + num) ;}}} public static int getdivnumber (int I) {int Total = 1; int to = (INT) math. SQRT (I); For (Int J = 2; j <= to; j ++ ) {If (I % J = 0) {total + = J; If (J! = I/J) {total + = I/J ;}} return total ;}}
 

running result
220/284