Fortran程序设计(第六章-循环结构(下.pptVIP

* * integer m, i, k read *,m k=sqrt(m); do i=2, k if (mod(m, I)= =0) exit if ( i=k+1) then print*,m,’ is a prime number’ else print *,m,’ is not a prime number’ endif enddo end 例4：歌德巴赫猜想（将一个100~200的偶数分解成两个素数之和） 程序： PROGRAM MAIN IMPLICIT NONE INTEGER::N,N1,N2,K,KEND LOGICAL PRIME N: DO N=100,200,2 N1=1 DO IF(N13)THEN N1=N1+1 ELSE N1=N1+2 ENDIF PRIME=.TRUE. KEND=SQRT(REAL(N1)) KK1: DO K=2,KEND IF(MOD(N1,K)==0)PRIME=.FALSE. ENDDO KK1 IF(.NOT.PRIME) CYCLE N