comparing b3ea9384b0dc206a41beeb11c04a585c7835b0e8 and main on treybastian.com/advent-of-code

.gitignore

···

       1
       +
       input.txt

     

       2
       +
       input_test.txt

+57

2024/day_07.f90

···

       1
       +
       module day_07_utils

     

       2
       +
          use iso_fortran_env, only: int64

     

       3
       +
          implicit none

     

       4
       +
       contains

     

       5
       +
          recursive function test_values(arr, target, next_idx, current_value) result(pass)

     

       6
       +
             implicit none

     

       7
       +
             integer(kind=int64), intent(in) :: target, current_value, arr(:)

     

       8
       +
             integer, intent(in) :: next_idx

     

       9
       +
             logical :: pass

     

       10
       +
             if(next_idx > size(arr)) then

     

       11
       +
                pass = current_value == target

     

       12
       +
                return

     

       13
       +
             end if

     

       14
       +
             pass = test_values(arr, target, next_idx + 1, current_value + arr(next_idx)) .or. &

     

       15
       +
                test_values(arr, target, next_idx + 1, current_value * arr(next_idx))

     

       16
       +
          end function test_values

     

       17
       +
          logical function is_calibrated(arr, target)

     

       18
       +
             implicit none

     

       19
       +
             integer(kind=int64), intent(in) :: target, arr(:)

     

       20
       +
             is_calibrated = test_values(arr, target, 2, arr(1))

     

       21
       +
          end function is_calibrated

     

       22
       +
       end module day_07_utils

     

       23
       +
       program day_07

     

       24
       +
          use iso_fortran_env, only: int64

     

       25
       +
          use day_07_utils

     

       26
       +
          implicit none

     

       27
       +
          integer(kind=int64) :: test_number, res

     

       28
       +
          integer(kind=int64), allocatable:: work(:)

     

       29
       +
          integer :: io, ios, idx, i, ct

     

       30
       +
          character(len=200) :: line, work_line

     

       31
       +
          logical :: pass

     

       32
       +
          res = 0

     

       33
       +
          open(newunit=io, file='./day_07_input.txt', status='old', action='read')

     

       34
       +
          do

     

       35
       +
             read(io, '(a)', iostat=ios) line

     

       36
       +
             if (ios /= 0) exit

     

       37
       +
             idx = index(line, ':')

     

       38
       +
             if (idx > 0) then

     

       39
       +
                read(line(1:idx-1), *) test_number

     

       40
       +
                ct = 0

     

       41
       +
                work_line = trim(line(idx+1:len(trim(line))))

     

       42
       +
                do i = 1 , len(trim(work_line))

     

       43
       +
                   if(work_line(i:i) == ' ') then

     

       44
       +
                      ct = ct + 1

     

       45
       +
                   end if

     

       46
       +
                end do

     

       47
       +
                allocate(work(ct))

     

       48
       +
                read(work_line, *) work(:)

     

       49
       +
             end if

     

       50
       +
             pass = is_calibrated(work, test_number)

     

       51
       +
             if(pass) then

     

       52
       +
                res = res + test_number

     

       53
       +
             end if

     

       54
       +
             deallocate(work)

     

       55
       +
          end do

     

       56
       +
          print*, "Result: ", res

     

       57
       +
       end program day_07

+68

2024/day_07_part_2.f90

···

       1
       +
       module day_07_part_2_utils

     

       2
       +
          use iso_fortran_env, only: int64

     

       3
       +
          implicit none

     

       4
       +
       contains

     

       5
       +
          recursive function test_values(arr, target, next_idx, current_value) result(pass)

     

       6
       +
             implicit none

     

       7
       +
             integer(kind=int64), intent(in) :: target, current_value, arr(:)

     

       8
       +
             integer, intent(in) :: next_idx

     

       9
       +
             character(len=20) :: str_1, str_2, concat_str

     

       10
       +
             integer(kind=int64) :: concat_value

     

       11
       +
             logical :: pass

     

       12
       +
       

     

       13
       +
             if(next_idx > size(arr)) then

     

       14
       +
                pass = current_value == target

     

       15
       +
                return

     

       16
       +
             end if

     

       17
       +
       

     

       18
       +
             write(str_1, '(I0)') current_value

     

       19
       +
             write(str_2, '(I0)') arr(next_idx)

     

       20
       +
             concat_str = trim(str_1) // trim(str_2)

     

       21
       +
             read(concat_str, '(I20)') concat_value

     

       22
       +
       

     

       23
       +
             pass = test_values(arr, target, next_idx + 1, current_value + arr(next_idx)) .or. &

     

       24
       +
                test_values(arr, target, next_idx + 1, current_value * arr(next_idx)) .or. &

     

       25
       +
                test_values(arr, target, next_idx + 1, concat_value)

     

       26
       +
          end function test_values

     

       27
       +
          logical function is_calibrated(arr, target)

     

       28
       +
             implicit none

     

       29
       +
             integer(kind=int64), intent(in) :: target, arr(:)

     

       30
       +
       

     

       31
       +
             is_calibrated = test_values(arr, target, 2, arr(1))

     

       32
       +
          end function is_calibrated

     

       33
       +
       end module day_07_part_2_utils

     

       34
       +
       program day_07_part_2

     

       35
       +
          use iso_fortran_env, only: int64

     

       36
       +
          use day_07_part_2_utils

     

       37
       +
          implicit none

     

       38
       +
          integer(kind=int64) :: test_number, res

     

       39
       +
          integer(kind=int64), allocatable:: work(:)

     

       40
       +
          integer :: io, ios, idx, i, ct

     

       41
       +
          character(len=200) :: line, work_line

     

       42
       +
          logical :: pass

     

       43
       +
          res = 0

     

       44
       +
          open(newunit=io, file='./day_07_input.txt', status='old', action='read')

     

       45
       +
          do

     

       46
       +
             read(io, '(a)', iostat=ios) line

     

       47
       +
             if (ios /= 0) exit

     

       48
       +
             idx = index(line, ':')

     

       49
       +
             if (idx > 0) then

     

       50
       +
                read(line(1:idx-1), *) test_number

     

       51
       +
                ct = 0

     

       52
       +
                work_line = trim(line(idx+1:len(trim(line))))

     

       53
       +
                do i = 1 , len(trim(work_line))

     

       54
       +
                   if(work_line(i:i) == ' ') then

     

       55
       +
                      ct = ct + 1

     

       56
       +
                   end if

     

       57
       +
                end do

     

       58
       +
                allocate(work(ct))

     

       59
       +
                read(work_line, *) work(:)

     

       60
       +
             end if

     

       61
       +
             pass = is_calibrated(work, test_number)

     

       62
       +
             if(pass) then

     

       63
       +
                res = res + test_number

     

       64
       +
             end if

     

       65
       +
             deallocate(work)

     

       66
       +
          end do

     

       67
       +
          print*, "Result: ", res

     

       68
       +
       end program day_07_part_2

+142

2024/day_08.f90

···

       1
       +
       module day_08_utils

     

       2
       +
          implicit none

     

       3
       +
          type node

     

       4
       +
             character :: c

     

       5
       +
             integer, allocatable :: x(:), y(:)

     

       6
       +
          end type node

     

       7
       +
       contains

     

       8
       +
          subroutine append_to_integer_array(arr, val)

     

       9
       +
             implicit none

     

       10
       +
             integer, allocatable, intent(inout) :: arr(:)

     

       11
       +
             integer, intent(in) :: val

     

       12
       +
             integer, allocatable :: temp(:)

     

       13
       +
             if(.not. allocated(arr)) then

     

       14
       +
                ERROR STOP 'Array not allocated'

     

       15
       +
             end if

     

       16
       +
             allocate(temp(size(arr) + 1))

     

       17
       +
             temp(1:size(arr)) = arr

     

       18
       +
             temp(size(arr) + 1) = val

     

       19
       +
             call move_alloc(temp, arr)

     

       20
       +
          end subroutine append_to_integer_array

     

       21
       +
       

     

       22
       +
          subroutine add_node(nodes, c, x, y)

     

       23
       +
             type(node), allocatable, intent(inout) :: nodes(:)

     

       24
       +
             type(node), allocatable :: temp(:)

     

       25
       +
             character, intent(in) :: c

     

       26
       +
             integer, intent(in) :: x, y

     

       27
       +
             integer :: i

     

       28
       +
             do i = 1, size(nodes)

     

       29
       +
                if (nodes(i)%c == c) then

     

       30
       +
                   if(.not. allocated(nodes(i)%x)) then

     

       31
       +
                      allocate(nodes(i)%x(1))

     

       32
       +
                      nodes(i)%x(1) = x

     

       33
       +
                   else

     

       34
       +
                      call append_to_integer_array(nodes(i)%x, x)

     

       35
       +
                   end if

     

       36
       +
                   if(.not. allocated(nodes(i)%y)) then

     

       37
       +
                      allocate(nodes(i)%y(1))

     

       38
       +
                      nodes(i)%y(1) = y

     

       39
       +
                   else

     

       40
       +
                      call append_to_integer_array(nodes(i)%y, y)

     

       41
       +
                   end if

     

       42
       +
                   return

     

       43
       +
                end if

     

       44
       +
             end do

     

       45
       +
             allocate(temp(size(nodes) + 1))

     

       46
       +
             temp(1:size(nodes)) = nodes

     

       47
       +
             allocate(temp(size(nodes) + 1)%x(1))

     

       48
       +
             allocate(temp(size(nodes) + 1)%y(1))

     

       49
       +
             temp(size(nodes) + 1)%c = c

     

       50
       +
             temp(size(nodes) + 1)%x(1) = x

     

       51
       +
             temp(size(nodes) + 1)%y(1) = y

     

       52
       +
             call move_alloc(temp, nodes)

     

       53
       +
          end subroutine add_node

     

       54
       +
       end module day_08_utils

     

       55
       +
       

     

       56
       +
       program day_08

     

       57
       +
          use day_08_utils

     

       58
       +
          implicit none

     

       59
       +
          character(len=50) :: lines(50)

     

       60
       +
          integer :: io, i, j, k, l, score, xdist, ydist

     

       61
       +
          integer, allocatable :: anti_x(:), anti_y(:)

     

       62
       +
          type(node), allocatable :: nodes(:)

     

       63
       +
          logical :: found

     

       64
       +
       

     

       65
       +
          open(newunit=io, file='day_08_input.txt', status='old', action='read')

     

       66
       +
          read(io, '(A)') lines

     

       67
       +
          score = 0

     

       68
       +
          do i = 1, 50

     

       69
       +
             do j = 1, 50

     

       70
       +
                if(lines(i)(j:j) /= '.') then

     

       71
       +
                   if(.not. allocated(nodes)) then

     

       72
       +
                      allocate(nodes(1))

     

       73
       +
                      nodes(1)%c = lines(i)(j:j)

     

       74
       +
                      allocate(nodes(1)%x(1))

     

       75
       +
                      allocate(nodes(1)%y(1))

     

       76
       +
                      nodes(1)%x(1) = j

     

       77
       +
                      nodes(1)%y(1) = i

     

       78
       +
                   else

     

       79
       +
                      call add_node(nodes, lines(i)(j:j), j, i)

     

       80
       +
                   end if

     

       81
       +
                end if

     

       82
       +
             end do

     

       83
       +
          end do

     

       84
       +
          do i = 1, size(nodes)

     

       85
       +
             do j = 1, size(nodes(i)%x)

     

       86
       +
                do l = 1, size(nodes(i)%x)

     

       87
       +
                   if(nodes(i)%x(j) == nodes(i)%x(l) .and. nodes(i)%y(j) == nodes(i)%y(l)) cycle ! don't compare same values

     

       88
       +
                   xdist = nodes(i)%x(j) - nodes(i)%x(l)

     

       89
       +
                   ydist = nodes(i)%y(j) - nodes(i)%y(l)

     

       90
       +
                   if(nodes(i)%x(j) + xdist > 0 .and. nodes(i)%x(j) + xdist <= 50 .and. &

     

       91
       +
                      nodes(i)%y(j) + ydist > 0 .and. nodes(i)%y(j) + ydist <= 50) then

     

       92
       +
                      if(.not. allocated(anti_x)) then

     

       93
       +
                         allocate(anti_x(1))

     

       94
       +
                         anti_x(1) = nodes(i)%x(j) + xdist

     

       95
       +
                         allocate(anti_y(1))

     

       96
       +
                         anti_y(1) = nodes(i)%y(j) + ydist

     

       97
       +
                         score = score + 1

     

       98
       +
                      else

     

       99
       +
                         found = .false.

     

       100
       +
                         do k = 1, size(anti_x)

     

       101
       +
                            if(anti_x(k) == nodes(i)%x(j) + xdist .and. anti_y(k) == nodes(i)%y(j) + ydist) then

     

       102
       +
                               found = .true.

     

       103
       +
                               exit

     

       104
       +
                            end if

     

       105
       +
                         end do

     

       106
       +
                         if(.not. found) then

     

       107
       +
                            call append_to_integer_array(anti_x, nodes(i)%x(j) + xdist)

     

       108
       +
                            call append_to_integer_array(anti_y, nodes(i)%y(j) + ydist)

     

       109
       +
       

     

       110
       +
                            score = score + 1

     

       111
       +
                         end if

     

       112
       +
                      end if

     

       113
       +
                   end if

     

       114
       +
                   if(nodes(i)%x(l) - xdist > 0 .and. nodes(i)%x(l) - xdist <= 50 .and. &

     

       115
       +
                      nodes(i)%y(l) - ydist > 0 .and. nodes(i)%y(l) - ydist <= 50) then

     

       116
       +
                      if(.not. allocated(anti_x)) then

     

       117
       +
                         allocate(anti_x(1))

     

       118
       +
                         anti_x(1) = nodes(i)%x(l) - xdist

     

       119
       +
                         allocate(anti_y(1))

     

       120
       +
                         anti_y(1) = nodes(i)%y(l) - ydist

     

       121
       +
                         score = score + 1

     

       122
       +
                      else

     

       123
       +
                         found = .false.

     

       124
       +
                         do k = 1, size(anti_x)

     

       125
       +
                            if(anti_x(k) == nodes(i)%x(l) - xdist .and. anti_y(k) == nodes(i)%y(l) - ydist) then

     

       126
       +
                               found = .true.

     

       127
       +
                               exit

     

       128
       +
                            end if

     

       129
       +
                         end do

     

       130
       +
                         if(.not. found) then

     

       131
       +
                            call append_to_integer_array(anti_x, nodes(i)%x(l) - xdist)

     

       132
       +
                            call append_to_integer_array(anti_y, nodes(i)%y(l) - ydist)

     

       133
       +
       

     

       134
       +
                            score = score + 1

     

       135
       +
                         end if

     

       136
       +
                      end if

     

       137
       +
                   end if

     

       138
       +
                end do

     

       139
       +
             end do

     

       140
       +
          end do

     

       141
       +
          print*, "Total : ", score

     

       142
       +
       end program day_08

+164

2024/day_08_part_2.f90

···

       1
       +
       module day_08_utils

     

       2
       +
          implicit none

     

       3
       +
          type node

     

       4
       +
             character :: c

     

       5
       +
             integer, allocatable :: x(:), y(:)

     

       6
       +
          end type node

     

       7
       +
       contains

     

       8
       +
          subroutine append_to_integer_array(arr, val)

     

       9
       +
             implicit none

     

       10
       +
             integer, allocatable, intent(inout) :: arr(:)

     

       11
       +
             integer, intent(in) :: val

     

       12
       +
             integer, allocatable :: temp(:)

     

       13
       +
             if(.not. allocated(arr)) then

     

       14
       +
                ERROR STOP 'Array not allocated'

     

       15
       +
             end if

     

       16
       +
             allocate(temp(size(arr) + 1))

     

       17
       +
             temp(1:size(arr)) = arr

     

       18
       +
             temp(size(arr) + 1) = val

     

       19
       +
             call move_alloc(temp, arr)

     

       20
       +
          end subroutine append_to_integer_array

     

       21
       +
       

     

       22
       +
          subroutine add_node(nodes, c, x, y)

     

       23
       +
             type(node), allocatable, intent(inout) :: nodes(:)

     

       24
       +
             type(node), allocatable :: temp(:)

     

       25
       +
             character, intent(in) :: c

     

       26
       +
             integer, intent(in) :: x, y

     

       27
       +
             integer :: i

     

       28
       +
             do i = 1, size(nodes)

     

       29
       +
                if (nodes(i)%c == c) then

     

       30
       +
                   if(.not. allocated(nodes(i)%x)) then

     

       31
       +
                      allocate(nodes(i)%x(1))

     

       32
       +
                      nodes(i)%x(1) = x

     

       33
       +
                   else

     

       34
       +
                      call append_to_integer_array(nodes(i)%x, x)

     

       35
       +
                   end if

     

       36
       +
                   if(.not. allocated(nodes(i)%y)) then

     

       37
       +
                      allocate(nodes(i)%y(1))

     

       38
       +
                      nodes(i)%y(1) = y

     

       39
       +
                   else

     

       40
       +
                      call append_to_integer_array(nodes(i)%y, y)

     

       41
       +
                   end if

     

       42
       +
                   return

     

       43
       +
                end if

     

       44
       +
             end do

     

       45
       +
             allocate(temp(size(nodes) + 1))

     

       46
       +
             temp(1:size(nodes)) = nodes

     

       47
       +
             allocate(temp(size(nodes) + 1)%x(1))

     

       48
       +
             allocate(temp(size(nodes) + 1)%y(1))

     

       49
       +
             temp(size(nodes) + 1)%c = c

     

       50
       +
             temp(size(nodes) + 1)%x(1) = x

     

       51
       +
             temp(size(nodes) + 1)%y(1) = y

     

       52
       +
             call move_alloc(temp, nodes)

     

       53
       +
          end subroutine add_node

     

       54
       +
       end module day_08_utils

     

       55
       +
       

     

       56
       +
       program day_08

     

       57
       +
          use day_08_utils

     

       58
       +
          implicit none

     

       59
       +
          character(len=50) :: lines(50)

     

       60
       +
          integer :: io, i, j, k, l, score, xdist, ydist, next_x, next_y

     

       61
       +
          integer, allocatable :: anti_x(:), anti_y(:)

     

       62
       +
          type(node), allocatable :: nodes(:)

     

       63
       +
          logical :: found

     

       64
       +
       

     

       65
       +
          open(newunit=io, file='day_08_input.txt', status='old', action='read')

     

       66
       +
          read(io, '(A)') lines

     

       67
       +
          score = 0

     

       68
       +
          do i = 1, 50

     

       69
       +
             do j = 1, 50

     

       70
       +
                if(lines(i)(j:j) /= '.') then

     

       71
       +
                   if(.not. allocated(nodes)) then

     

       72
       +
                      allocate(nodes(1))

     

       73
       +
                      nodes(1)%c = lines(i)(j:j)

     

       74
       +
                      allocate(nodes(1)%x(1))

     

       75
       +
                      allocate(nodes(1)%y(1))

     

       76
       +
                      nodes(1)%x(1) = j

     

       77
       +
                      nodes(1)%y(1) = i

     

       78
       +
                   else

     

       79
       +
                      call add_node(nodes, lines(i)(j:j), j, i)

     

       80
       +
                   end if

     

       81
       +
                end if

     

       82
       +
             end do

     

       83
       +
          end do

     

       84
       +
          do i = 1, size(nodes)

     

       85
       +
             do j = 1, size(nodes(i)%x)

     

       86
       +
                if(.not. allocated(anti_x)) then

     

       87
       +
                   allocate(anti_x(1))

     

       88
       +
                   anti_x(1) = nodes(i)%x(j)

     

       89
       +
                   allocate(anti_y(1))

     

       90
       +
                   anti_y(1) = nodes(i)%y(j)

     

       91
       +
                   score = score + 1

     

       92
       +
                else

     

       93
       +
                   found = .false.

     

       94
       +
                   do k = 1, size(anti_x)

     

       95
       +
                      if(anti_x(k) == nodes(i)%x(j) .and. anti_y(k) == nodes(i)%y(j)) then

     

       96
       +
                         found = .true.

     

       97
       +
                         exit

     

       98
       +
                      end if

     

       99
       +
                   end do

     

       100
       +
                   if(.not. found) then

     

       101
       +
                      call append_to_integer_array(anti_x, nodes(i)%x(j))

     

       102
       +
                      call append_to_integer_array(anti_y, nodes(i)%y(j))

     

       103
       +
       

     

       104
       +
                      score = score + 1

     

       105
       +
                   end if

     

       106
       +
                end if

     

       107
       +
                do l = 1, size(nodes(i)%x)

     

       108
       +
                   if(nodes(i)%x(j) == nodes(i)%x(l) .and. nodes(i)%y(j) == nodes(i)%y(l)) cycle ! don't compare same values

     

       109
       +
                   xdist = nodes(i)%x(j) - nodes(i)%x(l)

     

       110
       +
                   ydist = nodes(i)%y(j) - nodes(i)%y(l)

     

       111
       +
                   next_x = nodes(i)%x(j) + xdist

     

       112
       +
                   next_y = nodes(i)%y(j) + ydist

     

       113
       +
                   do

     

       114
       +
                      if(next_x> 0 .and. next_x <= 50 .and. &

     

       115
       +
                         next_y > 0 .and. next_y  <= 50) then

     

       116
       +
                         found = .false.

     

       117
       +
                         do k = 1, size(anti_x)

     

       118
       +
                            if(anti_x(k) == next_x .and. anti_y(k) == next_y) then

     

       119
       +
                               found = .true.

     

       120
       +
                               exit

     

       121
       +
                            end if

     

       122
       +
                         end do

     

       123
       +
                         if(.not. found) then

     

       124
       +
                            call append_to_integer_array(anti_x, next_x)

     

       125
       +
                            call append_to_integer_array(anti_y, next_y)

     

       126
       +
       

     

       127
       +
                            score = score + 1

     

       128
       +
                         end if

     

       129
       +
                         next_x = next_x + xdist

     

       130
       +
                         next_y = next_y + ydist

     

       131
       +
                      else

     

       132
       +
                         exit

     

       133
       +
                      end if

     

       134
       +
                   end do

     

       135
       +
                   next_x = nodes(i)%x(l) - xdist

     

       136
       +
                   next_y = nodes(i)%y(l) - ydist

     

       137
       +
                   do

     

       138
       +
                      if(next_x > 0 .and. next_x  <= 50 .and. &

     

       139
       +
                         next_y > 0 .and. next_y <= 50) then

     

       140
       +
                         found = .false.

     

       141
       +
                         do k = 1, size(anti_x)

     

       142
       +
                            if(anti_x(k) == next_x .and. anti_y(k) == next_y) then

     

       143
       +
                               found = .true.

     

       144
       +
                               exit

     

       145
       +
                            end if

     

       146
       +
                         end do

     

       147
       +
                         if(.not. found) then

     

       148
       +
                            call append_to_integer_array(anti_x, next_x)

     

       149
       +
                            call append_to_integer_array(anti_y, next_y)

     

       150
       +
       

     

       151
       +
                            score = score + 1

     

       152
       +
                         end if

     

       153
       +
                         next_x = next_x - xdist

     

       154
       +
                         next_y = next_y - ydist

     

       155
       +
       

     

       156
       +
                      else

     

       157
       +
                         exit

     

       158
       +
                      end if

     

       159
       +
                   end do

     

       160
       +
                end do

     

       161
       +
             end do

     

       162
       +
          end do

     

       163
       +
          print*, "Total : ", score

     

       164
       +
       end program day_08

+152

2024/day_09.f90

···

       1
       +
       module day_09_utils

     

       2
       +
          implicit none

     

       3
       +
       contains

     

       4
       +
          subroutine swap_to_first_positive_integer_from_end(arr, idx)

     

       5
       +
             implicit none

     

       6
       +
             integer, allocatable, intent(inout) :: arr(:)

     

       7
       +
             integer, intent(in) :: idx

     

       8
       +
             integer, allocatable :: temp(:)

     

       9
       +
             integer :: i, res

     

       10
       +
             do i = 0, size(arr) - 1

     

       11
       +
                if(arr(size(arr) - i) > -1) then

     

       12
       +
                   arr(idx) = arr(size(arr) - i)

     

       13
       +
                   allocate(temp(size(arr) - (i +1)))

     

       14
       +
                   temp = arr(1:size(arr) - (i+1))

     

       15
       +
                   call move_alloc(temp, arr)

     

       16
       +
                   return

     

       17
       +
                end if

     

       18
       +
             end do

     

       19
       +
          end subroutine swap_to_first_positive_integer_from_end

     

       20
       +
          subroutine append_to_integer_array_times(arr, val, times)

     

       21
       +
             implicit none

     

       22
       +
             integer, allocatable, intent(inout) :: arr(:)

     

       23
       +
             integer, intent(in) :: val, times

     

       24
       +
             integer, allocatable :: temp(:)

     

       25
       +
             if(.not. allocated(arr)) then

     

       26
       +
                ERROR STOP 'Array not allocated'

     

       27
       +
             end if

     

       28
       +
             allocate(temp(size(arr) + times))

     

       29
       +
             temp(1:size(arr)) = arr

     

       30
       +
             temp(size(arr) + 1:size(temp)) = val

     

       31
       +
             call move_alloc(temp, arr)

     

       32
       +
          end subroutine append_to_integer_array_times

     

       33
       +
       end module day_09_utils

     

       34
       +
       program day_09

     

       35
       +
          use iso_fortran_env, only: int64

     

       36
       +
          use day_09_utils

     

       37
       +
          implicit none

     

       38
       +
          integer :: io, ios, i, j, block_n, ct, block_start, block_end, space_start, space_end

     

       39
       +
          integer(kind=int64) :: res

     

       40
       +
          character(len=1) :: c

     

       41
       +
          integer, allocatable :: system(:), work(:), done(:)

     

       42
       +
          logical :: is_space, space_block_start

     

       43
       +
       

     

       44
       +
          open(newunit=io, file='./day_09_input.txt', status='old', action='read', access='stream')

     

       45
       +
          is_space = .false.

     

       46
       +
          block_n = 0

     

       47
       +
          do

     

       48
       +
             read(io, iostat=ios) c

     

       49
       +
             if (ios /= 0) exit

     

       50
       +
             read(c, *, iostat=ios) i

     

       51
       +
             if(ios /= 0) exit

     

       52
       +
             if (i == 0) then

     

       53
       +
                is_space = .false.

     

       54
       +
                cycle

     

       55
       +
             end if

     

       56
       +
             if (.not. allocated(system)) then

     

       57
       +
                allocate(system(i))

     

       58
       +
                system(1:i) = block_n

     

       59
       +
                is_space = .true.

     

       60
       +
                block_n = block_n + 1

     

       61
       +
             else

     

       62
       +
                if (is_space) then

     

       63
       +
                   call append_to_integer_array_times(system, -1, i)

     

       64
       +
                   is_space = .false.

     

       65
       +
                else

     

       66
       +
                   call append_to_integer_array_times(system, block_n, i)

     

       67
       +
                   block_n = block_n + 1

     

       68
       +
                   is_space = .true.

     

       69
       +
                end if

     

       70
       +
             end if

     

       71
       +
          end do

     

       72
       +
          allocate(work(size(system)))

     

       73
       +
          work = system

     

       74
       +
          ct = count(work > -1)

     

       75
       +
          outer: do

     

       76
       +
             do i = 1, size(work)

     

       77
       +
                if (i == ct) exit outer ! we are done

     

       78
       +
                if(work(i) < 0) then

     

       79
       +
                   call swap_to_first_positive_integer_from_end(work, i)

     

       80
       +
                   exit

     

       81
       +
                end if

     

       82
       +
             end do

     

       83
       +
          end do outer

     

       84
       +
          res = 0

     

       85
       +
          do i = 1, size(work)

     

       86
       +
             if(work(i) > -1) then

     

       87
       +
                res = res + ((i-1) * work(i))

     

       88
       +
             else

     

       89
       +
             end if

     

       90
       +
          end do

     

       91
       +
          print *, res

     

       92
       +
          ! start_part_2

     

       93
       +
          res = 0

     

       94
       +
          deallocate(work)

     

       95
       +
          allocate(work(size(system)))

     

       96
       +
          work = system

     

       97
       +
          block_n = -1

     

       98
       +
          block_start = -1

     

       99
       +
          block_end = -1

     

       100
       +
          do i = size(work), 1, -1

     

       101
       +
             if(block_n == -1 .and. work(i) /= -1) then

     

       102
       +
                ! we are starting a block

     

       103
       +
                block_end = i

     

       104
       +
                block_n = work(i)

     

       105
       +
                if(allocated(done) .and. count(done == block_n) > 0) then

     

       106
       +
                   block_n = -1

     

       107
       +
                   block_start = -1

     

       108
       +
                   block_end = -1

     

       109
       +
                   cycle

     

       110
       +
                else if(.not. allocated(done)) then

     

       111
       +
                   allocate(done(1))

     

       112
       +
                   done(1) = block_n

     

       113
       +
                else

     

       114
       +
                   call append_to_integer_array_times(done, block_n, 1)

     

       115
       +
                end if

     

       116
       +
             else if (block_n /= -1 .and. block_n /= work(i)) then

     

       117
       +
                ! we are ending the block

     

       118
       +
                block_start = i

     

       119
       +
       

     

       120
       +
                ! lets try to move the block

     

       121
       +
                space_block_start = .true.

     

       122
       +
                do j = 1, size(work)

     

       123
       +
                   if (j > block_start) exit

     

       124
       +
                   if(space_block_start .and. work(j) == -1) then

     

       125
       +
                      space_start = j

     

       126
       +
                      space_block_start = .false.

     

       127
       +
                   else if (.not. space_block_start .and. work(j) /= -1) then

     

       128
       +
                      space_end = j

     

       129
       +
                      space_block_start = .true.

     

       130
       +
                      if(space_end - space_start >= block_end - block_start) then

     

       131
       +
                         work(space_start:space_start + (block_end - (block_start +1))) = block_n

     

       132
       +
                         work(block_start+1:block_end) = -1

     

       133
       +
                         exit

     

       134
       +
                      end if

     

       135
       +
                      space_end = -1

     

       136
       +
                      space_start = -1

     

       137
       +
                   end if

     

       138
       +
                end do

     

       139
       +
                block_n = work(i)

     

       140
       +
                block_end = i

     

       141
       +
                block_start = -1

     

       142
       +
             end if

     

       143
       +
          end do

     

       144
       +
          do i = 1, size(work)

     

       145
       +
             if(work(i) /= -1) then

     

       146
       +
                res = res + ((i-1) * work(i))

     

       147
       +
             end if

     

       148
       +
          end do

     

       149
       +
          print *, res

     

       150
       +
       end program day_09

     

       151
       +
       

     

       152
       +

+51

2025/day_01.cbl

···

       1
       +
              IDENTIFICATION DIVISION.

     

       2
       +
              PROGRAM-ID. day_01.

     

       3
       +
              AUTHOR. Trey Bastian.

     

       4
       +
              ENVIRONMENT DIVISION.

     

       5
       +
              INPUT-OUTPUT SECTION.

     

       6
       +
              FILE-CONTROL.

     

       7
       +
              SELECT input-file ASSIGN TO "./input.txt"

     

       8
       +
                  ORGANIZATION IS LINE SEQUENTIAL.

     

       9
       +
              DATA DIVISION.

     

       10
       +
              FILE SECTION.

     

       11
       +
              FD input-file.

     

       12
       +
              01 input-line.

     

       13
       +
                02 direction PIC X.

     

       14
       +
                02 move-text PIC XXX.

     

       15
       +
              WORKING-STORAGE SECTION.

     

       16
       +
              01 dial-position PIC 9(2) VALUE 50.

     

       17
       +
              01 move-num PIC S9(3).

     

       18
       +
              01 zero-count PIC 9(4) VALUE ZEROS.

     

       19
       +
              01 eof PIC X.

     

       20
       +
                  88 eof-y VALUE "Y".

     

       21
       +
                  88 eof-n VALUE "N".

     

       22
       +
       

     

       23
       +
              

     

       24
       +
              PROCEDURE DIVISION.

     

       25
       +
                OPEN INPUT input-file.

     

       26
       +
                SET eof-n to TRUE.

     

       27
       +
                PERFORM UNTIL eof-y

     

       28
       +
                    READ input-file AT END

     

       29
       +
                        SET eof-y to TRUE

     

       30
       +
                    NOT AT END

     

       31
       +
                      MOVE FUNCTION NUMVAL(move-text) TO move-num

     

       32
       +
                      IF direction = "L"

     

       33
       +
                       COMPUTE move-num = 0 - move-num 

     

       34
       +
                      END-IF

     

       35
       +
                      

     

       36
       +
                      COMPUTE dial-position = FUNCTION MOD(dial-position +

     

       37
       +
                      move-num, 100) 

     

       38
       +
       

     

       39
       +
                      if dial-position < 0

     

       40
       +
                        ADD 100 to dial-position

     

       41
       +
                      END-IF

     

       42
       +
       

     

       43
       +
                      if dial-position = 0 

     

       44
       +
                        ADD 1 to zero-count

     

       45
       +
                      END-IF

     

       46
       +
                     END-READ

     

       47
       +
                END-PERFORM.

     

       48
       +
                CLOSE input-file.

     

       49
       +
                DISPLAY zero-count.

     

       50
       +
              STOP-RUN.

     

       51
       +

+67

2025/day_01_part2.cbl

···

       1
       +
              IDENTIFICATION DIVISION.

     

       2
       +
              PROGRAM-ID. day_01_part2.

     

       3
       +
              AUTHOR. Trey Bastian.

     

       4
       +
              ENVIRONMENT DIVISION.

     

       5
       +
              INPUT-OUTPUT SECTION.

     

       6
       +
              FILE-CONTROL.

     

       7
       +
              SELECT input-file ASSIGN TO "./input.txt"

     

       8
       +
                  ORGANIZATION IS LINE SEQUENTIAL.

     

       9
       +
              DATA DIVISION.

     

       10
       +
              FILE SECTION.

     

       11
       +
              FD input-file.

     

       12
       +
              01 input-line.

     

       13
       +
                02 direction PIC X.

     

       14
       +
                02 move-text PIC XXX.

     

       15
       +
              WORKING-STORAGE SECTION.

     

       16
       +
              01 dial-position PIC 9(2) VALUE 50.

     

       17
       +
              01 new-position PIC 9(2).

     

       18
       +
              01 move-num PIC S9(3).

     

       19
       +
              01 zero-count PIC 9(4) VALUE ZEROS.

     

       20
       +
              01 eof PIC X.

     

       21
       +
                  88 eof-y VALUE "Y".

     

       22
       +
                  88 eof-n VALUE "N".

     

       23
       +
       

     

       24
       +
              

     

       25
       +
              PROCEDURE DIVISION.

     

       26
       +
                OPEN INPUT input-file.

     

       27
       +
                SET eof-n to TRUE.

     

       28
       +
                PERFORM UNTIL eof-y

     

       29
       +
                    READ input-file AT END

     

       30
       +
                        SET eof-y to TRUE

     

       31
       +
                    NOT AT END

     

       32
       +
                      MOVE FUNCTION NUMVAL(move-text) TO move-num

     

       33
       +
                      IF move-num > 99 

     

       34
       +
                        COMPUTE zero-count = zero-count + (move-num / 100) 

     

       35
       +
                      END-IF

     

       36
       +
       

     

       37
       +
                      IF direction = "L"

     

       38
       +
                       COMPUTE move-num = 0 - move-num 

     

       39
       +
                      END-IF

     

       40
       +
                      

     

       41
       +
                      COMPUTE new-position = FUNCTION MOD(dial-position +

     

       42
       +
                      move-num, 100) 

     

       43
       +
       

     

       44
       +
                      if new-position < 0

     

       45
       +
                        ADD 100 to new-position

     

       46
       +
                      END-IF

     

       47
       +
       

     

       48
       +
                      EVALUATE new-position

     

       49
       +
                        WHEN 0

     

       50
       +
                          ADD 1 to zero-count

     

       51
       +
                         WHEN < dial-position AND direction = "R" AND

     

       52
       +
                           dial-position <> 0

     

       53
       +
                           ADD 1 to zero-count

     

       54
       +
                         WHEN > dial-position AND direction = "L" AND

     

       55
       +
                           dial-position <> 0

     

       56
       +
                           ADD 1 to zero-count

     

       57
       +
                       END-EVALUATE

     

       58
       +
       

     

       59
       +
                      

     

       60
       +
                      MOVE new-position TO dial-position

     

       61
       +
       

     

       62
       +
                     END-READ

     

       63
       +
                END-PERFORM.

     

       64
       +
                CLOSE input-file.

     

       65
       +
                DISPLAY zero-count.

     

       66
       +
              STOP-RUN.

     

       67
       +

+76

2025/day_02.cbl

···

       1
       +
              IDENTIFICATION DIVISION.

     

       2
       +
              PROGRAM-ID. day_02.

     

       3
       +
              AUTHOR. Trey Bastian.

     

       4
       +
              ENVIRONMENT DIVISION.

     

       5
       +
              INPUT-OUTPUT SECTION.

     

       6
       +
              FILE-CONTROL.

     

       7
       +
              SELECT input-file ASSIGN TO "./input.txt"

     

       8
       +
                  ORGANIZATION IS LINE SEQUENTIAL.

     

       9
       +
              DATA DIVISION.

     

       10
       +
              FILE SECTION.

     

       11
       +
              FD input-file.

     

       12
       +
              01 input-line PIC X(4096). 

     

       13
       +
              WORKING-STORAGE SECTION.

     

       14
       +
              01 ptr PIC 9(4) Value 1.

     

       15
       +
              01 len PIC 9(4).

     

       16
       +
              01 left-val PIC 9(32).

     

       17
       +
              01 right-val PIC 9(32).

     

       18
       +
              01 grouping PIC X(65).

     

       19
       +
       

     

       20
       +
              01 val-string PIC Z(32).

     

       21
       +
              01 val-string-len PIC 9(2).

     

       22
       +
              01 val-string-start-idx PIC 9(2).

     

       23
       +
              01 val-string-half PIC 9(2).

     

       24
       +
              01 result PIC 9(32) VALUE ZEROS.

     

       25
       +
       

     

       26
       +
              01 eof PIC X.

     

       27
       +
                  88 eof-y VALUE "Y".

     

       28
       +
                  88 eof-n VALUE "N".

     

       29
       +
              PROCEDURE DIVISION.

     

       30
       +
                OPEN INPUT input-file.

     

       31
       +
                SET eof-n to TRUE.

     

       32
       +
                PERFORM UNTIL eof-y

     

       33
       +
                    READ input-file AT END

     

       34
       +
                        SET eof-y to TRUE

     

       35
       +
                    NOT AT END

     

       36
       +
                     INSPECT input-line TALLYING len FOR CHARACTERS BEFORE

     

       37
       +
                     SPACE

     

       38
       +
       

     

       39
       +
                     PERFORM UNTIL ptr > len

     

       40
       +
                       UNSTRING input-line DELIMITED BY "," INTO grouping WITH

     

       41
       +
                       POINTER ptr

     

       42
       +
                       END-UNSTRING

     

       43
       +
       

     

       44
       +
                       UNSTRING grouping DELIMITED BY "-" INTO left-val,

     

       45
       +
                       right-val

     

       46
       +
                       END-UNSTRING

     

       47
       +
                       

     

       48
       +
                       PERFORM VARYING  left-val FROM left-val BY 1 UNTIL

     

       49
       +
                         left-val > right-val

     

       50
       +
                         MOVE left-val TO val-string

     

       51
       +
       

     

       52
       +
                         COMPUTE val-string-len = FUNCTION LENGTH(FUNCTION

     

       53
       +
                         TRIM(val-string))

     

       54
       +
                         IF FUNCTION MOD(val-string-len, 2) = 0

     

       55
       +
       

     

       56
       +
                           COMPUTE val-string-start-idx = 

     

       57
       +
                           (FUNCTION LENGTH(val-string) - val-string-len ) + 1

     

       58
       +
                           COMPUTE val-string-half = val-string-len / 2

     

       59
       +
       

     

       60
       +
                           IF val-string(val-string-start-idx:val-string-half) 

     

       61
       +
                             = val-string(val-string-start-idx +

     

       62
       +
                             val-string-half:val-string-half)

     

       63
       +
       

     

       64
       +
                             ADD left-val TO result 

     

       65
       +
                           END-IF

     

       66
       +
                         END-IF

     

       67
       +
                       END-PERFORM

     

       68
       +
       

     

       69
       +
                     END-PERFORM

     

       70
       +
       

     

       71
       +
                     END-READ

     

       72
       +
                END-PERFORM.

     

       73
       +
                CLOSE input-file.

     

       74
       +
                DISPLAY result.

     

       75
       +
              STOP-RUN.

     

       76
       +

+103

2025/day_02_part2.cbl

···

       1
       +
              IDENTIFICATION DIVISION.

     

       2
       +
              PROGRAM-ID. day_02_part2.

     

       3
       +
              AUTHOR. Trey Bastian.

     

       4
       +
              ENVIRONMENT DIVISION.

     

       5
       +
              INPUT-OUTPUT SECTION.

     

       6
       +
              FILE-CONTROL.

     

       7
       +
              SELECT input-file ASSIGN TO "./input.txt"

     

       8
       +
                  ORGANIZATION IS LINE SEQUENTIAL.

     

       9
       +
              DATA DIVISION.

     

       10
       +
              FILE SECTION.

     

       11
       +
              FD input-file.

     

       12
       +
              01 input-line PIC X(4096). 

     

       13
       +
              WORKING-STORAGE SECTION.

     

       14
       +
              01 ptr PIC 9(4) Value 1.

     

       15
       +
              01 len PIC 9(4).

     

       16
       +
              01 left-val PIC 9(32).

     

       17
       +
              01 right-val PIC 9(32).

     

       18
       +
              01 grouping PIC X(65).

     

       19
       +
       

     

       20
       +
              01 val-string PIC Z(32).

     

       21
       +
              01 val-string-len PIC 9(2).

     

       22
       +
              01 val-string-start-idx PIC 9(2).

     

       23
       +
              01 val-string-half PIC 9(2).

     

       24
       +
              01 val-window PIC 9(2) VALUE 1. 

     

       25
       +
              01 c-idx PIC 9(2).

     

       26
       +
              01 s-left PIC Z(16).

     

       27
       +
              01 s-right PIC Z(16).

     

       28
       +
              01 no-match PIC X VALUE "N".

     

       29
       +
              01 result PIC 9(32) VALUE ZEROS.

     

       30
       +
       

     

       31
       +
              01 eof PIC X.

     

       32
       +
                  88 eof-y VALUE "Y".

     

       33
       +
                  88 eof-n VALUE "N".

     

       34
       +
              PROCEDURE DIVISION.

     

       35
       +
                OPEN INPUT input-file.

     

       36
       +
                SET eof-n to TRUE.

     

       37
       +
                PERFORM UNTIL eof-y

     

       38
       +
                    READ input-file AT END

     

       39
       +
                        SET eof-y to TRUE

     

       40
       +
                    NOT AT END

     

       41
       +
                     INSPECT input-line TALLYING len FOR CHARACTERS BEFORE

     

       42
       +
                     SPACE

     

       43
       +
       

     

       44
       +
                     PERFORM UNTIL ptr > len

     

       45
       +
                       UNSTRING input-line DELIMITED BY "," INTO grouping WITH

     

       46
       +
                       POINTER ptr

     

       47
       +
                       END-UNSTRING

     

       48
       +
       

     

       49
       +
                       UNSTRING grouping DELIMITED BY "-" INTO left-val,

     

       50
       +
                       right-val

     

       51
       +
                       END-UNSTRING

     

       52
       +
                       

     

       53
       +
                       PERFORM VARYING  left-val FROM left-val BY 1 UNTIL

     

       54
       +
                         left-val > right-val

     

       55
       +
                         MOVE left-val TO val-string

     

       56
       +
       

     

       57
       +
                         COMPUTE val-string-len = FUNCTION LENGTH(FUNCTION

     

       58
       +
                         TRIM(val-string))

     

       59
       +
       

     

       60
       +
                         COMPUTE val-string-start-idx = 

     

       61
       +
                         (FUNCTION LENGTH(val-string) - val-string-len ) + 1

     

       62
       +
       

     

       63
       +
                         COMPUTE val-string-half = val-string-len / 2

     

       64
       +
       

     

       65
       +
                         PERFORM VARYING val-window FROM 1 BY 1 

     

       66
       +
                           UNTIL val-window > val-string-half

     

       67
       +
                           COMPUTE c-idx = val-string-start-idx + val-window

     

       68
       +
                           MOVE "N" to no-match

     

       69
       +
                           PERFORM VARYING c-idx 

     

       70
       +
                             FROM c-idx 

     

       71
       +
                             BY val-window

     

       72
       +
                             UNTIL c-idx

     

       73
       +
                             > FUNCTION LENGTH(val-string)  

     

       74
       +
       

     

       75
       +
                             MOVE val-string(val-string-start-idx:val-window)

     

       76
       +
                             TO s-left

     

       77
       +
       

     

       78
       +
                             IF (c-idx + val-window 

     

       79
       +
                               > FUNCTION LENGTH(val-string))

     

       80
       +
                                  MOVE val-string(c-idx:) TO s-right

     

       81
       +
                              ELSE

     

       82
       +
                                  MOVE val-string(c-idx:val-window) TO s-right

     

       83
       +
                              END-IF

     

       84
       +
                             

     

       85
       +
                             IF NOT s-left = s-right 

     

       86
       +
                               MOVE "Y" to no-match

     

       87
       +
                               EXIT PERFORM

     

       88
       +
                             END-IF

     

       89
       +
                           END-PERFORM

     

       90
       +
                           IF no-match = "N"

     

       91
       +
                             ADD left-val to result

     

       92
       +
                             EXIT PERFORM

     

       93
       +
                           END-IF

     

       94
       +
                         END-PERFORM

     

       95
       +
                       END-PERFORM

     

       96
       +
                     END-PERFORM

     

       97
       +
       

     

       98
       +
                     END-READ

     

       99
       +
                END-PERFORM.

     

       100
       +
                CLOSE input-file.

     

       101
       +
                DISPLAY result.

     

       102
       +
              STOP-RUN.

     

       103
       +

+63

2025/day_03.cbl

···

       1
       +
              IDENTIFICATION DIVISION.

     

       2
       +
              PROGRAM-ID. day_03.

     

       3
       +
              AUTHOR. Trey Bastian.

     

       4
       +
              ENVIRONMENT DIVISION.

     

       5
       +
              INPUT-OUTPUT SECTION.

     

       6
       +
              FILE-CONTROL.

     

       7
       +
              SELECT input-file ASSIGN TO "./input.txt"

     

       8
       +
                  ORGANIZATION IS LINE SEQUENTIAL.

     

       9
       +
              DATA DIVISION.

     

       10
       +
              FILE SECTION.

     

       11
       +
              FD input-file.

     

       12
       +
              01 input-line PIC Z(4096). 

     

       13
       +
              WORKING-STORAGE SECTION.

     

       14
       +
              01 idx PIC 9(4).

     

       15
       +
              01 idx-2 PIC 9(4).

     

       16
       +
              01 len PIC 9(4).

     

       17
       +
       

     

       18
       +
              01 maxim PIC 9 VALUE 0.

     

       19
       +
              01 digit PIC 9 VALUE 0.

     

       20
       +
       

     

       21
       +
              01 joltage PIC XX.

     

       22
       +
              01 result PIC 9(10) VALUE 0.

     

       23
       +
       

     

       24
       +
              

     

       25
       +
              01 eof PIC X.

     

       26
       +
                  88 eof-y VALUE "Y".

     

       27
       +
                  88 eof-n VALUE "N".

     

       28
       +
       

     

       29
       +
              PROCEDURE DIVISION.

     

       30
       +
                OPEN INPUT input-file.

     

       31
       +
                SET eof-n to TRUE.

     

       32
       +
                PERFORM UNTIL eof-y

     

       33
       +
                    READ input-file AT END

     

       34
       +
                        SET eof-y to TRUE

     

       35
       +
                    NOT AT END

     

       36
       +
                       MOVE FUNCTION LENGTH(FUNCTION TRIM(input-line)) TO len

     

       37
       +
                       MOVE 0 TO maxim

     

       38
       +
             *first pass leave something on the right

     

       39
       +
                       PERFORM VARYING idx FROM 1 UNTIL idx > len - 1 

     

       40
       +
                           MOVE FUNCTION NUMVAL(input-line(idx:1)) TO digit

     

       41
       +
                           IF maxim < digit

     

       42
       +
                             MOVE digit TO maxim

     

       43
       +
                             MOVE idx TO idx-2

     

       44
       +
                           END-IF

     

       45
       +
                       END-PERFORM 

     

       46
       +
             * need the next index 

     

       47
       +
                       MOVE maxim TO joltage(1:1)

     

       48
       +
                       MOVE 0 TO maxim

     

       49
       +
                       ADD 1 TO idx-2 

     

       50
       +
                       PERFORM VARYING idx-2 FROM idx-2  UNTIL idx-2 > len

     

       51
       +
                         MOVE FUNCTION NUMVAL(input-line(idx-2:1)) TO digit

     

       52
       +
                         IF maxim < digit

     

       53
       +
                           MOVE digit TO maxim

     

       54
       +
                         END-IF

     

       55
       +
                       END-PERFORM

     

       56
       +
                       MOVE maxim TO joltage(2:1)

     

       57
       +
                       ADD FUNCTION NUMVAL(joltage) TO result

     

       58
       +
                     END-READ

     

       59
       +
                END-PERFORM.

     

       60
       +
                CLOSE input-file.

     

       61
       +
                DISPLAY result.

     

       62
       +
              STOP-RUN.

     

       63
       +

+64

2025/day_03_part2.cbl

···

       1
       +
              IDENTIFICATION DIVISION.

     

       2
       +
              PROGRAM-ID. day_03_part2.

     

       3
       +
              AUTHOR. Trey Bastian.

     

       4
       +
              ENVIRONMENT DIVISION.

     

       5
       +
              INPUT-OUTPUT SECTION.

     

       6
       +
              FILE-CONTROL.

     

       7
       +
              SELECT input-file ASSIGN TO "./input.txt"

     

       8
       +
                  ORGANIZATION IS LINE SEQUENTIAL.

     

       9
       +
              DATA DIVISION.

     

       10
       +
              FILE SECTION.

     

       11
       +
              FD input-file.

     

       12
       +
              01 input-line PIC Z(4096). 

     

       13
       +
              WORKING-STORAGE SECTION.

     

       14
       +
              01 idx PIC 9(4) VALUE 1.

     

       15
       +
              01 idx-2 PIC 9(4).

     

       16
       +
              01 len PIC 9(4).

     

       17
       +
       

     

       18
       +
              01 maxim PIC 9 VALUE 0.

     

       19
       +
              01 digit PIC 9 VALUE 0.

     

       20
       +
              01 remaining PIC 99 VALUE 12.

     

       21
       +
              01 rem-idx PIC 99 VALUE 1.

     

       22
       +
       

     

       23
       +
              01 joltage PIC X(12).

     

       24
       +
              01 result PIC 9(32) VALUE 0.

     

       25
       +
       

     

       26
       +
              

     

       27
       +
              01 eof PIC X.

     

       28
       +
                  88 eof-y VALUE "Y".

     

       29
       +
                  88 eof-n VALUE "N".

     

       30
       +
       

     

       31
       +
              PROCEDURE DIVISION.

     

       32
       +
                OPEN INPUT input-file.

     

       33
       +
                SET eof-n to TRUE.

     

       34
       +
                PERFORM UNTIL eof-y

     

       35
       +
                    READ input-file AT END

     

       36
       +
                        SET eof-y to TRUE

     

       37
       +
                    NOT AT END

     

       38
       +
                       MOVE FUNCTION LENGTH(FUNCTION TRIM(input-line)) TO len

     

       39
       +
                       MOVE 1 TO idx

     

       40
       +
                       MOVE 12 TO remaining

     

       41
       +
                       MOVE 1 TO rem-idx

     

       42
       +
                       PERFORM UNTIL remaining < 1

     

       43
       +
                         MOVE 0 TO maxim

     

       44
       +
                         PERFORM VARYING idx FROM idx UNTIL idx > 

     

       45
       +
                           (len - remaining + 1)

     

       46
       +
                           MOVE FUNCTION NUMVAL(input-line(idx:1)) to digit

     

       47
       +
                           IF maxim < digit

     

       48
       +
                             MOVE digit TO maxim

     

       49
       +
                             MOVE idx TO idx-2

     

       50
       +
                           END-IF

     

       51
       +
                         END-PERFORM

     

       52
       +
                           MOVE maxim TO joltage(rem-idx:1)

     

       53
       +
                           ADD 1 TO rem-idx

     

       54
       +
                           SUBTRACT 1 FROM remaining

     

       55
       +
                           MOVE idx-2 TO idx

     

       56
       +
                           ADD 1 TO idx

     

       57
       +
                       END-PERFORM

     

       58
       +
                       ADD FUNCTION NUMVAL(joltage) TO result

     

       59
       +
                     END-READ

     

       60
       +
                END-PERFORM.

     

       61
       +
                CLOSE input-file.

     

       62
       +
                DISPLAY result.

     

       63
       +
              STOP-RUN.

     

       64
       +

+5 -2

README.md

···

       1
        
       # Advent of Code Repo

     

       2
        
       This repository contains my solutions to the Advent of Code challenges.

     

       3
        
       

     

       4
       -
       I stream all my solutions live on Twitch at [twitch.tv/treybastian](https://twitch.tv/treybastian).

     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       5
        
       

     

       6
        
       ## 2024 - Fortran

     

       7
        
       You'll need GNUFortran to run these solutions.

     

       8
        
       

     

       9
       -
       On MacOS, you can install it with Homebrew with `brew install gcc`.

···

       1
        
       # Advent of Code Repo

     

       2
        
       This repository contains my solutions to the Advent of Code challenges.

     

       3
        
       

     

       4
       +
       ## 2025 - COBOL 

     

       5
       +
       You'll need to install GNUCobol to run these solutions.

     

       6
       +
       

     

       7
       +
       On MacOS you can install it with Homebrew: `brew install gnucobol`

     

       8
        
       

     

       9
        
       ## 2024 - Fortran

     

       10
        
       You'll need GNUFortran to run these solutions.

     

       11
        
       

     

       12
       +
       On MacOS, you can install it with Homebrew:  `brew install gcc`.

Compare changes