From e2f035d386b0775ca6266d5e5c427edf02e45c06 Mon Sep 17 00:00:00 2001 From: daviddoji Date: Mon, 28 Aug 2023 18:38:29 +0200 Subject: [PATCH] Refactor output --- src/Julia/Problems001-050/Problem023.jl | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/src/Julia/Problems001-050/Problem023.jl b/src/Julia/Problems001-050/Problem023.jl index d7a104d..5acca96 100644 --- a/src/Julia/Problems001-050/Problem023.jl +++ b/src/Julia/Problems001-050/Problem023.jl @@ -32,9 +32,9 @@ function Problem23() sum of two abundant numbers. =# LIMIT = 28123 - divisorsum = zeros(Int32,LIMIT) - for i in range(1, LIMIT, step=1) - for j in range(2i, LIMIT, step=i) + divisorsum = zeros(Int32, LIMIT) + for i in range(1, LIMIT, step = 1) + for j in range(2i, LIMIT, step = i) divisorsum[j] += i end end @@ -43,8 +43,8 @@ function Problem23() expressible = falses(LIMIT) for i in abundantnums for j in abundantnums - if i + j < LIMIT+1 - expressible[i + j] = true + if i + j < LIMIT + 1 + expressible[i+j] = true else break end