Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int prim(int n)
- {
- bool OK=true;
- if(n<2)
- OK=false;
- else if(n!=2 && n%2==0)
- OK=false;
- for(int d=3;d*d<=n && OK==true;d+=2)
- {
- if(n%d==0)
- {
- OK=false;
- }
- }
- if(OK==false)
- return 0;
- else
- return 1;
- }
- int main()
- {
- int n, v[101], sorted[101];
- cin>>n;
- for(int i=1;i<=n;i++){
- cin>>v[i];
- sorted[k]=v[i];
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement