Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,a[1001],nr,k=0,prim,ok,aux;
- cin>>n;
- for(int i=1;i<=n;i++)
- {
- cin>>nr;
- prim=1;
- if(nr==0)
- prim=0;
- if(nr==1)
- prim=0;
- if(nr==2)
- prim=1;
- for(int d=2;d*d<=nr;d++)
- {
- if(nr%d==0)
- {
- prim=0;
- }
- }
- if(prim==1)
- {
- k++;
- a[k]=nr;
- }
- }
- do{
- ok=1; ///pp ca sirul este sortat
- for(int i=1;i<=k-1;i++) ///verific toate elem consecutive
- {
- if(a[i]>a[i+1])
- {
- aux=a[i];
- a[i]=a[i+1];
- a[i+1]=aux;
- ok=0; ///sirul nu este ordonat
- }
- }
- }while(ok==0);
- for(int i=1;i<=k;i++)
- {
- cout<<a[i]<<" ";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement