diff options
| author | Braxton Hall | 2022-10-24 03:38:31 +0000 |
|---|---|---|
| committer | GitHub | 2022-10-24 03:38:31 +0000 |
| commit | 40317f6d4228ad435c699d17a9b4545041c0f3ee (patch) | |
| tree | 0c661bc22bd5856c4d74588d65c92db280bc7799 /entries/ionathanch/fib.f90 | |
| parent | d0208871d8c9cf86541b56afe6b830c5a20eb2c2 (diff) | |
| parent | 4c717196fd630c5c207e114ffa9ca9c301eb1198 (diff) | |
Merge pull request #13 from ionathanch/main
Fortran :) (also moved my Agda file up a dir)
Diffstat (limited to 'entries/ionathanch/fib.f90')
| -rw-r--r-- | entries/ionathanch/fib.f90 | 21 |
1 files changed, 21 insertions, 0 deletions
diff --git a/entries/ionathanch/fib.f90 b/entries/ionathanch/fib.f90 new file mode 100644 index 0000000..3cf1850 --- /dev/null +++ b/entries/ionathanch/fib.f90 @@ -0,0 +1,21 @@ +PROGRAM main + ! The 93rd Fibonacci number is the largest that fits in 64 bits anyway + CHARACTER(3) :: kth + INTEGER :: k + CALL get_command_argument(1, kth) + READ(kth, *) k + WRITE(*, *) fib(k) +CONTAINS + +PURE RECURSIVE INTEGER*8 FUNCTION fib(k) RESULT(n) + INTEGER, INTENT (IN) :: k + IF (k == 0) THEN + n = 0 + ELSE IF (k == 1) THEN + n = 1 + ELSE + n = fib(k - 1) + fib(k - 2) + END IF +END FUNCTION fib + +END PROGRAM |