Update

Author: INIT-REF

023.asm

@@ -1,7 +1,9 @@
 section .data
     msg db "%d", 10, 0          ;return string for printf (just the result)
-    isabnum times 28124 dd 0    ;mark numbers as abundant
-    sums    times 28124 dd 0    ;list of sums of two abundant numbers
+
+section .bss
+    isabnum resq 440    ;28160 bits for flags
+    sums    resq 440    ;dito
 
 section .text
     extern printf
@@ -18,7 +20,7 @@ abnums:
     call    divsum                          ;get sum of divisors
     cmp     r8d, ecx                        ;check if sum is <= number
     jle     abnums                          ;if yes, try next number
-    mov     dword [isabnum + 4 * ecx], 1    ;else set number to abnum
+    bts     [isabnum], ecx                  ;else set number to abnum
     jmp     abnums                          ;try next number
 
 sum_init:
@@ -29,18 +31,18 @@ sum_outer:
     inc     eax                             ;next number
     cmp     eax, 28123                      ;finished?
     jge     result                          ;then calculate result
-    cmp     dword [isabnum + 4 * eax], 1    ;test if eax is abundandt
-    jne     sum_outer                       ;if not, try next number
+    bt      [isabnum], eax                  ;test if eax is abundandt
+    jnc     sum_outer                       ;if not, try next number
 
 sum_inner:
     inc     ebx                             ;next number
-    cmp     dword [isabnum + 4 * ebx], 1    ;check if ebx is abundant
-    jne     sum_inner                       ;if not, try next number
+    bt      [isabnum], ebx                  ;check if ebx is abundant
+    jnc     sum_inner                       ;if not, try next number
     mov     ecx, eax                        ;move eax to ecx
     add     ecx, ebx                        ;add ebx
     cmp     ecx, 28123                      ;check if sum < 28124
     jg      sum_outer                       ;if not, go to outer loop
-    mov     dword [sums + 4 * ecx], 1       ;set sums @ sum to 0
+    bts     [sums], ecx                     ;set sums @ sum to 1
     jmp     sum_inner
 
 result:
@@ -51,8 +53,8 @@ sum:
     inc     ebx                         ;next number
     cmp     ebx, 28123                  ;check if we are finished
     jge     print                       ;then print result
-    cmp     dword [sums + 4 * ebx], 1   ;else check if we have a sum
-    je      sum                         ;then skip that number
+    bt      [sums], ebx                 ;else check if we have a sum
+    jc      sum                         ;then skip that number
     add     ecx, ebx                    ;else add it to total
     jmp     sum                         ;repeat
 

061.asm

@@ -0,0 +1,141 @@
+section .data
+    msg db "%d", 10, 0              ;return string for printf (just the result)
+
+section .bss
+    nums resb 10000                 ;for bit flags
+    first resb 10000                ;for first two digits
+    last resb 10000                 ;for last two digits
+    nset resd 6                     ;for sets
+    
+    
+section .text
+    extern printf
+    global main
+
+main:
+    mov     edi, 1
+    xor     eax, eax
+    xor     ebx, ebx
+                                    ;set flags for all figurate numbers
+set_tri:
+    mov     bl, [nums + eax]
+    bts     ebx, 0
+    mov     [nums + eax], bl
+    add     eax, edi
+    inc     edi
+    cmp     eax, 10000
+    jl      set_tri
+    mov     edi, 1
+    xor     eax, eax
+
+set_squ:
+    mov     bl, [nums + eax]
+    bts     ebx, 1
+    mov     [nums + eax], bl
+    add     eax, edi
+    add     edi, 2
+    cmp     eax, 10000
+    jl      set_squ
+    mov     edi, 1
+    xor     eax, eax
+    
+set_pen:
+    mov     bl, [nums + eax]
+    bts     ebx, 2
+    mov     [nums + eax], bl
+    add     eax, edi
+    add     edi, 3
+    cmp     eax, 10000
+    jl      set_pen
+    mov     edi, 1
+    xor     eax, eax
+
+set_hex:
+    mov     bl, [nums + eax]
+    bts     ebx, 3
+    mov     [nums + eax], bl
+    add     eax, edi
+    add     edi, 4
+    cmp     eax, 10000
+    jl      set_hex
+    mov     edi, 1
+    xor     eax, eax
+
+set_hep:
+    mov     bl, [nums + eax]
+    bts     ebx, 4
+    mov     [nums + eax], bl
+    add     eax, edi
+    add     edi, 5
+    cmp     eax, 10000
+    jl      set_hep
+    mov     edi, 1
+    xor     eax, eax
+
+set_oct:
+    mov     bl, [nums + eax]
+    bts     ebx, 5
+    mov     [nums + eax], bl
+    add     eax, edi
+    add     edi, 6
+    cmp     eax, 10000
+    jl      set_oct
+    mov     edi, 1000
+    mov     ebx, 100
+
+get_first_last:                     ;get first/last two digits
+    mov     eax, edi
+    xor     edx, edx
+    div     ebx
+    mov     [first + edi], al
+    mov     [last + edi], dl
+    inc     edi
+    cmp     edi, 10000
+    jl      get_first_last
+    
+
+    xor     eax, eax                ;result
+    xor     ebx, ebx                ;for flags
+    xor     ecx, ecx                ;dito
+    mov     edi, 999                ;init n
+
+next_starter:
+    inc     edi
+    mov     bl, [nums + edi]
+    test    ebx, ebx
+    jz      next_starter
+    push    rdi                     ;remember starter
+    mov     [nset], edi
+    mov     r9b, [last + edi]
+    mov     esi, 1                  ;index for nset
+    mov     edi, 999
+
+next_follower:
+    inc     edi
+    cmp     edi, 10000
+    je      backtrack
+    mov     cl, [nums + edi]
+    or      ecx, ebx
+    cmp     ecx, ebx
+    je      next_follower
+    cmp     r9b, [first + edi]
+    jne     next_follower
+
+backtrack:
+    mov     byte [nest + esi], 0
+    dec     esi
+    mov     eax, edi
+
+print:
+    push    rbp
+    mov     edi, msg
+    mov     esi, eax
+    call    printf
+    pop     rbp
+
+exit:
+    mov     eax, 1
+    xor     edi, edi
+    syscall
+
+section .note.GNU-stack     ;just for gcc