通过代码:
#include <bits/stdc++.h> using namespace std; int n, a[501]; int main() { scanf("%d", &n); for(int i = 1; i <= n; i ++) scanf("%d", &a[i]); sort(a + 1, a + n + 1); bool patched = false; for(int i = 1; i <= n; i ++) if(a[i] % 2 == 1) { if(patched == true) printf(","); patched = true; printf("%d", a[i]); } return 0; }
1177:奇数单增序列
最新推荐文章于 2024-02-16 19:42:06 发布