Telephone directory
Problem Description
CIA has decided to create a special telephone directory for its agents. The first 2 pages of the directory contain the name of the directory and instructions for agents, telephone number records begin on the third page. Each record takes exactly one line and consists of 2 parts: the phone number and the location of the phone. The phone number is 4 digits long. Phone numbers cannot start with digits 0 and 8. Each page of the telephone directory can contain not more then K lines. Phone numbers should be sorted in increasing order. For the first phone number with a new first digit, the corresponding record should be on a new page of the phone directory. You are to write a program, that calculates the minimal number P pages in the directory. For this purpose, CIA gives you the list of numbers containing N records, but since the information is confidential, without the phones locations.
Input
The first line contains a natural number K (0 < K < 255) - the maximum number of lines that one page can contain. The second line contains a natural N (0 < N < 8000) - number of phone numbers supplied. Each of following N lines contains a number consisting of 4 digits - phone numbers in any order, and it is known, that numbers in this list cannot repeat.
Output
First line should contain a natural number P - the number of pages in the telephone directory.
Sample Input
代码语言：javascript复制5
10
1234
5678
1345
1456
1678
1111
5555
6789
6666
5000Sample Output
代码语言：javascript复制5Solution
代码语言：javascript复制#include <bits/stdc .h>
int main() {
std::ios::sync_with_stdio(false);
int k;
int n;
std::cin >> k;
std::cin >> n;
std::vector<int> numbers(n, 0);
for(auto& num : numbers) {
std::cin >> num;
}
std::vector<int> counts(10, 0);
for(const auto& num : numbers) {
counts[num / 1000] = 1;
}
int res = 2;
for(int i = 1; i < 10; i ) {
res = int(std::ceil((std::max(counts[i] - k, 0) * 1.0 / k))) (counts[i] == 0 ? 0 : 1);
}
std::cout << res << std::endl;
return 0;
}
