1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; bool isPrime(int n) { if(n==0 || n==1) return 0; for(int i=2;i<=sqrt(n);i++) if(n%i==0) return 0; return 1; } int main() { int n; cin>>n; if(isPrime(n)) cout<<"1"; else cout<<"0"; }Java :
import java.util.Scanner; public class Main{ public static void main(String args[]){ int x,i,j; Scanner sc=new Scanner(System.in); x=sc.nextInt(); j=0; for(i=2;i<x;i++){ if(x%i==0){ j=j+1; } } if(j==0){ System.out.println("1") ; } else{ System.out.println("0") ; } } }
- 1
Information
- ID
- 19542
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By