Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Recursive tribonacci
!gfortran, gcc version 7.4.0 program hello implicit none integer::i,fib,n do i=0,n-1 write(*,*)fib(i) end do end program hello recursive function fib(n) result(s) implicit none integer::n,s if (n==0)then s=0; else if(n==1)then s=0; else if(n==2)then s=1; else s=fib(n-1)+fib(n-2)+fib(n-3) return end if end function
run
|
edit
|
history
|
help
0
IF GO TO
SIUM(3.7)
Fixed point for several variables
lcm and gcd using prime factorization
Cosine series
Rand
Rvc new
A_01 QN:3
fortran-genetic-algo
A1_Q1_Harsh