Programming/BaekJoon
[C++] 백준 1475번 : 방 번호
TCBE
2019. 2. 18. 17:10
https://www.acmicpc.net/problem/1475
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int cnt=0;
int N_div=1;
int m = n;
while (1) {
if (m / 10 > 0) {
cnt++;
m = m / 10;
N_div = N_div * 10;
}
else
break;
}
int number[9];
for (int i = 0; i < 9; i++) number[i] = 0;
for (int i = 0; i <= cnt; i++) {
if (n / N_div == 9)
number[6]++;
else {
number[n / N_div]++;
}
n = n - (n / N_div)*N_div;
N_div = N_div / 10;
}
int most_N= number[0];
if (number[6] % 2)
number[6] = (number[6] + 1)/2;
else
number[6] = number[6]/ 2;
for (int i = 0; i < 9; i++) {
if (most_N <= number[i]) {
most_N = number[i];
}
}
cout << most_N << endl;
}