| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 2575 | 龚施宇 | 数的分类 | C++ | Wrong Answer | 0 | 0 MS | 360 KB | 384 | 2019-11-30 12:37:11 |
#include<iostream> using namespace std; int main(){ int num,j=0,o=0; int c[10001]={0}; int jn[10001]={0},on[10001]={0}; for(int i=1;i<=num;i++){ cin>>c[i]; if(c[i]%2==0){ o++; on[o]=c[i]; }else{ j++; jn[j]=c[i]; } } for(int i=1;i<=o;i++){ cout<<on[i]<<" "; } cout<<endl; for(int i=1;i<=j;i++){ cout<<jn[i]<<" "; } return 0; }