Mutare2

#include <iostream>
using namespace std;

void sumcif(int n,int &s,int &t)
{
    int c;
    s=0;t=0;
    while(n>0){
        c=n%10;
        (c%2==0)?s=s+c:t=t+c;
        n=n/10;
    }
}

void perm(int &n)
{
    int x=n,c,p=1;
    while(x>9){
        p=p*10;
        x=x/10;
    }
    c=x;
    n=n%p*10+c;
}

bool prim(int nr)
{
    int d=2;
    if(nr==0 ||nr==1)   return 0;
    for(d=2;d*d<=nr;d++){
        if(nr%d==0)  return 0;
    }
    return 1;
}

void modificare(int v[],int n)
{
    int a[10001]={},b[10001]={},k=-1,j=-1,poz,i; ///retin cele k nr din v care sunt prime in a

    for(int i=0;i<n;i++){
        if(prim(v[i])==1){
            k++;
            a[k]=v[i];
        }
        else{
            j++;
            b[j]=v[i];
        }
    }

    for(i=0;i<=k;i++){
        v[i]=a[i];
    }
    for(i=k+1;i<=n;i++){
        poz = i-k-1;
        v[i]=b[poz];
    }
}

int main(){
    int a[101]={42,36,7,53,27,15,29,40,39,2},n=10,b[10001];
   /// cout<<prim(2)<<endl;
    modificare(a,n);
    for(int i=0;i<n;i++){
        cout<<a[i]<<" ";
    }

	return 0;
}