tut3-zad3

#include <iostream>
#include <deque>
#include <cmath>

bool DaLiJeProst(int n)
{
  if (n==2) return true;
    for(int i(3); i < n ; i ++)
    {
        if(n % i == 0)
            return false;

    return true;
}}

int main ()
{
    int n;

    std::cout<<"Unesite broj n: ";
    std::cin>>n;
    std::deque <int> DekA(0);
    std::deque <int> DekB(0), DekC(0);
    std::cout<<"Unesite elemente vektora A: "<<std::endl;
    for (int i(0); i<n; i++)
    {
        int br(0);
        std::cin>>br;
        DekA.push_front(br);

    }

    for (int x : DekA)
    {
        if (DaLiJeProst(x)==true) DekB.push_front(x);
        if (DaLiJeProst(x)==false) DekC.push_front (x);
    }
    std::cout<<std::endl;

    std::cout<<"Elementi vektora B: ";


    for (int i(0); i<DekB.size(); i++)
    { if (i==DekB.size()-1) std::cout<<DekB[i];
           else
    std::cout<<DekB[i]<<",";
     }

    std::cout<<std::endl;
    std::cout<<"Elementi vektora C: ";
    for (int i(0); i<DekC.size(); i++)
    { if (i==DekC.size()-1) std::cout<<DekC[i];
    else
        std::cout<<DekC[i]<<",";

    }

    return 0;
}