NUMERI AUREI: Somma divisori(x)=x Fino a 0xFFFF sono 6/28/496/8128 static unsigned int result[16]={ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }; -> { 6, 28, 496, 8128 ... } void main(void) { unsigned int res_pos=0,tested_num=0,divisor=0; unsigned long int acc=0; for(tested_num=1;tested_num<2;tested_num++) { for(acc=0,divisor=1;divisor 156.302.031 | 156.301.488 | 10.865.855.080 900: 543 -> 121.788.732 | 121.788.189 | 7.923.844.580 800: 543 -> 91.818.647 | 91.818.104 | 5.567.484.080 700: 543 -> 66.162.370 | 66.161.827 | 3.731.773.580 600: 543 -> 44.814.748 | 44.814.205 | 2.351.713.080 500: 543 -> 27.866.608 | 27.866.065 | 1.362.302.580 *497: 543 -> 27.430.121 | 27.429.578 | 1.337.976.265 496: 543 -> 27.284.097 | 27.283.554 | 1.329.932.320 400: 543 -> 15.384.865 | 15.384.322 | 698.542.080 300: 543 -> 7.308.541 | 7.307.998 | 295.431.580 200: 543 -> 3.178.553 | 3.178.010 | 87.971.080 100: 543 -> 826.875 | 826.332 | 11.160.580 50: 543 -> 218.618 | 218.075 | 1.436.580 *29: 543 -> 77.875 | 77.332 | 292.255 28: 543 -> 72.452 | 71.909 | 263.980 20: 543 -> 38.104 | 37.561 | 100.180 10: 543 -> 10.307 | 9.764 | 14.380 *7: 543 -> 5.411 | 4.868 | 5.540 6: 543 -> 3.778 | 3.235 | 3.720 5: 543 -> 2.849 | 2.306 | 2.355 4: 543 -> 1.813 | 1.270 | 1.380 3: 543 -> 1.182 | 639 | 730 2: 543 -> 700 | 157 | 340 1: 543 -> 623 | 80 | 145 quindi tempo di esecuzione e T(n), cioe' o(n^3) ********************************************* static unsigned int result[16]={ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }; word result[16] = 0x0100 void main(void) { unsigned int res_pos=0,tested_num=0,divisor=0; unsigned long int acc=0; 18BE A7 F6 AIS #-10 <----------- INGRESSO MAIN 18C0 95 TSX 18C1 6F 09 CLR 9,X 18C3 6F 08 CLR 8,X 18C5 6F 01 CLR 1,X 18C7 7F CLR ,X 18C8 6F 03 CLR 3,X 18CA 6F 02 CLR 2,X 18CC CD 19 51 JSR 0x1951 ; 0x1951 for(tested_num=1;tested_num<2;tested_num++) { 18CF 9E FF 01 STHX 1,SP 18D2 20 72 BRA *+116 ; 0x1946 18D4 AD 7B BSR *+125 ; 0x1951 18D6 9E FF 03 STHX 3,SP for(acc=0,divisor=1;divisor