Java語法練習SDUTOJ判斷素數(迴圈結構)
阿新 • • 發佈:2018-12-29
C語言實驗——判斷素數(迴圈結構)
Time Limit: 1000 ms Memory Limit: 65536 KiB
Problem Description
從鍵盤上輸入任意一個正整數,然後判斷該數是否為素數。
如果是素數則輸出"This is a prime."
否則輸出“This is not a prime.”
Input
輸入任意一個正整數n(1 <= n <= 1000000)。
Output
判斷n是否為素數,並輸出判斷結果:
如果n是素數則輸出"This is a prime."
否則輸出“This is not a prime.”
特別提醒:請注意對1的判定,1不是素數。
Sample Input
3
Sample Output
This is a prime.
Hint
Source
ACcode:
package test; import java.util.*; public class Main{ public static void main(String[] args) { Scanner in = new Scanner(System.in); int t = in.nextInt(); int flag = 0; if (t == 1) { System.out.println("This is not a prime."); flag = 1; } for (int i = 2; i <= Math.sqrt(t); i++) { if (t % i == 0) { flag = 1; System.out.println("This is not a prime."); break; } } if (flag == 0) System.out.println("This is a prime."); } }