| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 2519 | 倪邢暄 | 数的分类 | C++ | Accepted | 100 | 0 MS | 260 KB | 393 | 2019-11-28 21:42:59 |
#include<iostream> using namespace std; int main(){ int n,a[100]={0}; int j[100]={0},m[100]={0}; int jn=0,mn=0; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; if(a[i]%2==0){ mn++; m[mn]=a[i]; }else{ jn++; j[jn]=a[i]; } } for(int i=1;i<=mn;i++){ printf("%d ",m[i]); } cout<<endl; for(int i=1;i<=jn;i++){ printf("%d ",j[i]); } return 0; }