Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
41280 | jiabokai | 奇数单增序列 | C++ | Wrong Answer | 0 MS | 248 KB | 302 | 2024-02-20 11:23:08 |
#include<bits/stdc++.h> using namespace std; int a[1000],b[1000]; int main() { int n,top=0; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; if((a[i]%2==1)&&a[i]!=0){ b[top]=a[i]; top++; } } sort(b,b+top+1); for(int i=0;i<=top-1;i++){ cout<<b[i]<<","; } cout<<b[top]; }