Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- bool gran(int i, int j){
- return(i>j);
- }
- vector<int> par(vector<int> v){
- int i;
- bool primer=true;
- vector<int> c(1,0);
- for(i=0;i<v.size();++i){
- if(v[i]%2==0){
- if(!primer) c.push_back(v[i]);
- else{
- primer=false;
- c[0]=v[i];
- }
- }
- }
- return c;
- }
- vector<int> sen(vector<int> v){
- int i;
- bool primer=true;
- vector<int> c(1,0);
- for(i=0;i<v.size();++i){
- if(v[i]%2==1){
- if(!primer) c.push_back(v[i]);
- else{
- primer=false;
- c[0]=v[i];
- }
- }
- }
- return c;
- }
- int main(){
- int i=0,aux;
- while(cin>>aux){
- vector<int> v(1,0);
- v[0]=aux;
- i=0;
- while(v[i]!=0){
- ++i;
- cin>>aux;
- v.push_back(aux);
- }
- vector<int> q=par(v);
- vector<int> s=sen(v);
- sort(q.begin(),q.end());
- sort(s.begin(),s.end(),gran);
- if(q.size()>1){
- for(int j=1;j<q.size();++j){
- cout<<q[j];
- if(j!=q.size()-1)cout<<' ';
- }
- }
- cout<<endl;
- if(s[0]!=0){
- for(int j=0;j<s.size();++j){
- cout<<s[j];
- if(j!=s.size()-1)cout<<' ';
- }
- }
- cout<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement