sgu 127 Telephone directory
来源:互联网 发布:java logger级别 编辑:程序博客网 时间:2024/05/20 01:10
127. Telephone directory
time limit per test: 0.5 sec.
memory limit per test: 4096 KB
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
5101234567813451456167811115555678966665000
Sample Output
5很裸的暴力模拟一下 ,其实真的是水题。代码:#include<iostream>#include<cstring>#include<cstdio>#include<set>#include<algorithm>#include<vector>#include<cstdlib>#define inf 0xfffffff#define CLR(a,b) memset((a),(b),sizeof((a)))using namespace std;int const nMax = 4000;typedef int LL;typedef pair<LL,LL> pij;int a[10];char s[20];int k,n;int main(){ scanf("%d",&k); scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%s",s); a[s[0]-'0']++; } int ans=2; for(int i=1;i<10;i++){ if(i==8)continue; ans+=a[i]/k; if(a[i]%k)ans++; } printf("%d\n",ans); return 0;}
- SGU 127 Telephone directory
- sgu 127 Telephone directory
- SGU 127 Telephone directory (模拟)
- SGU - 127 - Telephone directory (水~)
- SGU 127 Telephone directory(水~)
- [SGU]127. Telephone directory
- SGU127-Telephone directory
- sgu127:Telephone directory
- SGU127 Telephone directory
- Telephone
- SGU
- SGU
- SGU
- SGU
- SGU
- SGU
- (SGU
- SGU
- sgu 126 Boxes
- iphone ipa图片资源提取
- oracle10g更改字符集WE8ISO8859P1为ZHS16GBK
- iOS:应用程序的线程安全性
- 《面向对象程序设计》第12章在线测试
- sgu 127 Telephone directory
- LAMP基础环境搭建
- CenterOS 6.3 64位mysql5.5.25安装及配置四部曲
- 测试MBP的手写功能
- 动手操作oracle细粒度访问控制(FGAC)一则
- MFC下全屏播放flash
- APK反破解之一:Android Java混淆(ProGuard)
- PV,EV和AC
- HDU 4445 Crazy Tank 三分+枚举+二分