Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
evaluation
!gfortran, gcc version 7.4.0 program hello implicit none integer::n real::s=0.0,m=1.0,i n=10; do i=1,n s=s+(sqrt(i))/(i**2+1); end do print'(A15)','summation value :' print*,s do i=1,n m=m*((i-1)**2)/(sqrt(i)); end do print'(A15)','product value :' print*,m end program hello
run
|
edit
|
history
|
help
0
A_02 JACOBIAN NEWTON'S METHOD
Practice cheby
Gauss forward elimination
Pivot
A_03 RUNGE KUTTA METHOD O(4)
euler-cromer
Summation of 1 to 100 square integer namber
underoverflow
machine epsilon
A_01 NEWTON_RM(B(II))