0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-10 04:58:48 +00:00

P1239 计数器

R40245675
This commit is contained in:
Baoshuo Ren 2020-10-21 21:16:32 +08:00 committed by Baoshuo Ren
parent 332460ff29
commit 204eb6c70a
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

20
problem/P1239/P1239.cpp Normal file
View File

@ -0,0 +1,20 @@
#include <bits/stdc++.h>
using namespace std;
int n, ans[15], t;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
t = i;
while (t) {
ans[t % 10]++;
t /= 10;
}
}
for (int i = 0; i < 10; i++) {
cout << ans[i] << endl;
}
return 0;
}