1 solutions
-
0
C :
#include<stdio.h> #include<math.h> void panduan(int n) { int i; int a[10000]={1,1}; for(i=2;i<=sqrt(n);i++) { if(n%i==0) a[n]=1;break; } if(a[n]==0) printf("prime"); else printf("not prime"); } int main() { int n; scanf("%d",&n); panduan(n); }
C++ :
#include<iostream> #include<cmath> using namespace std; bool prime(int n) { int i,t=sqrt(n); for (i=2; i<=t; i++) if (n%i==0) break; return i>t; } int main() { int n; cin>>n; if (prime(n)) cout<<"prime"<<endl; else cout<<"not prime"<<endl; return 0; }
- 1
Information
- ID
- 2205
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By