import java.util.Scanner; public class Main{ public static void main(String[] args){ int n = new Scanner(System.in).nextInt(); System.out.print(judge(n)); } public static String judge(int n){ if(0 == n || 1==n || 0 >n){ return "no"; } for(int i=2;i<=n/2;i++){ if(0 == n%i){ return "no"; } } return "yes"; } }
#define _CRT_SECURE_NO_WARNINGS #include <cmath> #include <iostream> using namespace std; bool judge(int n) { if (n == 0 || n == 1 || n < 0) { return false; } int pos = sqrt(n); for (int i = 2; i <= pos; i++) { if (n % i == 0) { return false; } } return true; } int main() { int n; while (cin >> n) { if (judge(n)) { cout << "yes" << endl; } else { cout << "no" << endl; } } return EXIT_SUCCESS; }
#include <bits/stdc++.h> using namespace std; bool Judge(int x){ bool flag = true; if(x<2) flag = false; else{ for(int i=2;i*i<=x;i++){ if(x%i==0) flag = false; } } return flag; } int main(){ int n; while(cin>>n){ if(Judge(n)) cout<<"yes"<<endl; else cout<<"no"<<endl; } }
//注意1不是素数 #include<iostream> using namespace std; int main(){ int n; while(cin>>n){ bool judge=1; for(int i=2;i<n;i++) if(n%i==0){ judge=0; break; } if(n==1) cout<<"no"<<endl; else if(judge||n==2) cout<<"yes"<<endl; else cout<<"no"<<endl; } }
#include<stdio.h> #include<math.h> int main(){ int n; while(scanf("%d",&n)!=EOF){ if(n<=1){ printf("no\n"); } else{ int m=(int)sqrt(n)+1; int flag=0; for(int i=2;i<m;i++){ if(n%i==0){ flag=1; break; } } if(flag==0){ printf("yes\n"); } else printf("no\n"); } } return 0; }
#include<stdio.h> #include<math.h> bool judge(int n) { if (n <= 1) return 0; else { int a = sqrt(n); //不用取整加1,在下面用 i <= a 一样的效果; for (int i = 2; i <= a; i++) { if (n%i == 0) return 0; } return 1; } } int main() { int n; while (scanf("%d", &n) != EOF) { puts(judge(n) ? "yse" : "no"); } return 0; }
//大家好,我是yishuihan; #include<iostream> #include<cmath> using namespace std; bool isPrime(int number) { if(number<=1) return false; if(number==2) return true; if(number==3) return true; for(int i=2;i<=sqrt(number);i++) { if(number%i==0) return false; } return true; } int main() { int number; while(cin>>number) { if(isPrime(number)) cout<<"yes"<<endl; else cout<<"no"<<endl; } return 0; }
#include<stdio.h> int main (){//the shorter,the better. int n,i; for(;~scanf("%d",&n);){ for (i = 2;i*i<=n&&n%i;i++); printf((n<2||i*i<=n)?"no\n":"yes\n"); } }
#include<iostream> #include<cmath> using namespace std; bool isprime(int x){ if(x<2) return false; int bound=sqrt(x); for(int i=2;i<=bound;i++){ if(x%i==0) return false; } return true; } int main() { int n; while(cin>>n){ cout<<(isprime(n)==true?"yes":"no")<<endl; } }
#include <iostream> #include <cmath> using namespace std; bool isPrime(int n) { //判断是否为质数 if (n < 2) { //小于2必定不是质数 return false; } int bound = sqrt(n); //判断上界(保证sqrt运算只进行一次) for (int i = 2; i <= bound; i++) { if (n % i == 0) { return false; } } return true; } int main() { int n; while (cin >> n) { cout << (isPrime(n) ? "yes" : "no") << endl; } return 0; }
#include <iostream> #include <cmath> using namespace std; bool func(int n){//判断一个数是不是素数 bool tag=true; for(int i=2;i<=sqrt(n);i++){ if(n%i==0){ tag=false; break; } } return tag; } int main() { int n; while(cin>>n){ if(n>1){//如果这个数大于1进行继续判断,否则不是素数 if(func(n)){ cout<<"yes"<<endl; } else{ cout<<"no"<<endl; } } else{ cout<<"no"<<endl; } } }
#include <stdio.h> #include <math.h> int Fun(int x){ if (x<2) { return 0; } int n = (int)sqrt(x); for (int i = 2; i<=n; i ++) { if (x%i==0) { return 0; } } return 1; } int main(){ int x; scanf("%d", &x); printf("%s\n", Fun(x)?"yes":"no"); return 0; }