fork(1) download 
  1. read*,n
  2. If(n.lt.2)stop
  3. Do i=2,n/2
  4. If(mod(n,i).eq.0)then
  5. Print*,n,'is prime'
  6. Stop
  7. Else
  8. Print*,n,'is not prime'
  9. Endif 
  10. Enddo
  11. Stop
  12. end
Success #stdin #stdout 0.01s 5272KB
comments (?)
stdin 
11
stdout 
          11 is not prime
          11 is not prime
          11 is not prime
          11 is not prime
https://ideone.com/VKXscy
language:
Fortran (gfortran 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!