subroutine find_factors(n) integer, intent(in) :: n integer :: div,next,rest integer :: i i=1 div=2 next=3 rest=n do while (rest/=1) do while (mod(rest,div)==0) print *,div i=i+1 rest=rest/div end do div=next next=next+2 end do end subroutine find_factors program enigma1681 integer :: e,n,i,g,m,a integer :: gemini,ann,ian,enigma,angie do e=0,9 do n=0,9 do i=0,9 do g=0,9 do m=0,9 do a=0,9 if (e/=n.and.e/=i.and.e/=g.and.e/=m.and.e/=a) then if (n/=i.and.n/=g.and.n/=m.and.n/=a) then if (i/=g.and.i/=m.and.i/=a) then if (g/=m.and.g/=a) then if (m/=a) then if (g/=0.and.a/=0.and.i/=0.and.e/=0) then if (a