#include <iostream>
#include <stdio.h>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
bool IsPrime(int nInteger)
{
if (nInteger < 2)
return false;
for (int i = 2; i*i <= nInteger; i++)
{
if ((nInteger % i)==0)
return false;
}
return true;
}
int main()
{
vector<int> V;
queue<int> Q;
stack<int> S1, S2;
int nTemp = 1;
while(cin >> nTemp && nTemp)
{
if (nTemp < 0)
V.push_back(nTemp);
else
{
if (IsPrime(nTemp))
Q.push(nTemp);
((nTemp % 2)==1) ? S2.push(nTemp) : S1.push(nTemp);
}
}
for (int i = 0; i < (int)V.size(); i++)
cout << V[i] << "\t";
cout << endl;
while (!Q.empty())
{
cout << Q.front() << "\t";
Q.pop();
}
cout << endl;
while (!S1.empty())
{
cout << S1.top() << "\t";
S1.pop();
}
cout << endl;
while (!S2.empty())
{
cout << S2.top() << "\t";
S2.pop();
}
cout << endl;
system("pause");//м╥нд╪Ч#include <cstdlib>
return 0;
}
栈、队列、向量
猜你喜欢
转载自blog.csdn.net/Almost_123/article/details/78127295
今日推荐
周排行