提交时间:2026-04-10 14:41:01
运行 ID: 86898
#include <iostream> #include <algorithm> using namespace std; int main() { int n, a[10005], cnt[10005] = {0}; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; } int max_val = *max_element(a, a + n); for (int i = 0; i < n; i++) { cnt[a[i]]++; } for (int i = 0; i <= max_val; i++) { cout << cnt[i] << endl; } return 0; }