Codeforces Beta Round #98 (Div. 2) / 137A Postcards and photos (模拟)
来源:互联网 发布:大数据 个性化教育 编辑:程序博客网 时间:2024/05/19 23:00
Polycarpus has postcards and photos hung in a row on the wall. He decided to put them away to the closet and hang on the wall a famous painter's picture. Polycarpus does it like that: he goes from the left to the right and removes the objects consecutively. As Polycarpus doesn't want any mix-ups to happen, he will not carry in his hands objects of two different types. In other words, Polycarpus can't carry both postcards and photos simultaneously. Sometimes he goes to the closet and puts the objects there, thus leaving his hands free. Polycarpus must put all the postcards and photos to the closet. He cannot skip objects. What minimum number of times he should visit the closet if he cannot carry more than 5 items?
The only line of the input data contains a non-empty string consisting of letters "С" and "P" whose length does not exceed 100characters. If the i-th character in the string is the letter "С", that means that the i-th object (the numbering goes from the left to the right) on Polycarpus' wall is a postcard. And if the i-th character is the letter "P", than the i-th object on the wall is a photo.
Print the only number — the minimum number of times Polycarpus has to visit the closet.
CPCPCPC
7
CCCCCCPPPPPP
4
CCCCCCPPCPPPPPPPPPP
6
CCCCCCCCCC
2
In the first sample Polycarpus needs to take one item to the closet 7 times.
In the second sample Polycarpus can first take 3 postcards to the closet; then 3 more. He can take the 6 photos that are left in the similar way, going to the closet twice.
In the third sample Polycarpus can visit the closet twice, both times carrying 3 postcards. Then he can take there 2 photos at once, then one postcard and finally, he can carry the last 10 photos if he visits the closet twice.
In the fourth sample Polycarpus can visit the closet twice and take there all 10 postcards (5 items during each go).
以now为参考标准进行统计~
完整代码:
/*30ms,0KB*/#include<cstdio>#include<cstring>#include<cmath>char str[101];int main(){int count = 0, i = 0;scanf("%s", str);int len = strlen(str);char now = str[0];while (i < len){int nowcount = 1;while (++i < len && str[i] == now)++nowcount;count += ceil((double)nowcount / 5);now = str[i];}printf("%d", count);return 0;}
- Codeforces Beta Round #98 (Div. 2) / 137A Postcards and photos (模拟)
- Codeforces 137A-Postcards and photos(模拟+贪心)
- CodeForces-137A Postcards and photos
- A. Postcards and photos
- Codeforces Round #368 (Div. 2) A Brain's Photos
- Codeforces Round #368 (Div. 2)(A. Brain's Photos)
- Codeforces Round #368(Div.2)A. Brain's Photos
- Codeforces Round #368 (Div. 2) A. Brain's Photos
- Codeforces Round #368 (Div. 2)- A. Brain's Photos
- D - Postcards and photos
- Codeforces Round #361 (Div. 2) A. Mike and Cellphone ( 模拟 )
- Codeforces Round #410 (Div.2) A.Mike and palindrome-模拟
- Codeforces Round #417 (Div. 2)-A. Sagheer and Crossroads-模拟
- Codeforces Beta Round #35 (Div. 2) / 35A Shell Game(模拟)
- Codeforces Beta Round #92 (Div. 2) / 124A The number of positions 【简单模拟】【水题】
- Codeforces Round #137 (Div. 2) / 222A Shooshuns and Sequence (模拟)
- Codeforces Beta Round #98 (Div. 2)
- Codeforces Beta Round #98 (Div. 2)
- TextSwitcher的使用
- 商道网络与您分享精品软件源码
- 设计模式六大原则:依赖倒置原则
- 04年网易笔试题目
- python脚本初探---新手写的QQ邮箱发送脚本
- Codeforces Beta Round #98 (Div. 2) / 137A Postcards and photos (模拟)
- Ubuntu下用命令行快速打开各类型文件
- ZOJ 1456 最短路 输出路径
- 2009年网易笔试题
- Code Fragment-对于简单的数据类,通过覆盖toString方法,打印关键信息。
- java.lang.NullPointerException
- 2010年09月28日网易笔试题(西南交大)
- uva10382 - Watering Grass
- cifs记录