| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 77711 | sh25_wanghy | 直方图 | C++ | Accepted | 1 MS | 252 KB | 482 | 2025-12-26 14:42:17 |
#include <iostream> #include <iomanip> #include <cmath> using namespace std; int main() { int a,b,m=0,z[1001],count=0; cin>>a; for(int i=0;i<a;i++){ cin>>b; m=max(b,m); z[i]=b; } for(int j=0;j<=m;j++){ for(int k=0;k<a;k++){ if(j==z[k]){ count=count+1; } } cout<<count<<endl; count=0; } return 0; }