0
#include<iostream>
#include<queue>
using namespace std;
queue<int> q;
int a[10001],t;
int main(){
int n;
cin>>n;
cin>>t;
cout<<t<<" ";
if(t%2==1){
for(int i=1;i<=n-1;i++){
cin>>a[i];
if(a[i]%2==1){
q.push(a[i]);
}
}
while(!q.empty()){
cout<<q.front()<<" ";
q.pop();
}
}
else{
for(int i=1;i<=n-1;i++){
cin>>a[i];
if(a[i]%2==1){
q.push(a[i]);
}
}
while(!q.empty()){
cout<<q.front()<<" ";
q.pop();
}
}
return 0;
}
WA40分,求找错
0
0
0
被禁言


中级光能
核心:
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
if(i==1){
cout<<a[i]<<" ";
}else if((a[i]+a[1])%2==0){
cout<<a[i]<<" ";
}
}
定义:
int a[101],n;
0
0