URAL 1612. Tram Forum(字符串啊 )
2015-03-20 22:02
162 查看
题目链接:http://acm.timus.ru/problem.aspx?space=1&num=1612
Time limit: 0.5 second
Memory limit: 64 MB
Tram, trolleybus, and bus drivers talk at the tram forum. We have read all messages posted at the forum during last month and discovered an interesting rule. Users in whose messages the word “tram”
occurs more often than the word “trolleybus” are tram drivers. Similarly, users in whose messages the word “trolleybus” is more frequent than the word “tram” are trolleybus drivers. All other users of the tram forum are bus drivers. Given this information,
can you determine who has posted the latest message at the tram forum?
question marks. The total length of the message is at most 10000 symbols. Words consist of letters and can be separated by spaces, line breaks, and punctuation marks.
代码如下:
1612. Tram Forum
Time limit: 0.5 secondMemory limit: 64 MB
Tram, trolleybus, and bus drivers talk at the tram forum. We have read all messages posted at the forum during last month and discovered an interesting rule. Users in whose messages the word “tram”
occurs more often than the word “trolleybus” are tram drivers. Similarly, users in whose messages the word “trolleybus” is more frequent than the word “tram” are trolleybus drivers. All other users of the tram forum are bus drivers. Given this information,
can you determine who has posted the latest message at the tram forum?
Input
You are given the latest message at the tram forum. The message consists of lowercase English letters, spaces, line breaks, and punctuation marks: periods, commas, dashes, colons, and exclamation andquestion marks. The total length of the message is at most 10000 symbols. Words consist of letters and can be separated by spaces, line breaks, and punctuation marks.
Output
Output “Tram driver” if the user who has posted the latest message is a tram driver; output “Trolleybus driver” if she is a trolleybus driver; and output “Bus driver” if she is a bus driver.Samples
input | output |
---|---|
of course, tram is the best transport in the world! | Tram driver |
yes, yekaterinburg trams are the best trams in the world, but i like my trolleybus too. | Trolleybus driver |
read forum.tr.ru every day! you can learn much about tram drivers and trolleybus drivers. | Bus driver |
#include <cstdio> #include <cmath> #include <cstring> #include <string> #include <cstring> #include <vector> #include <map> #include <iostream> #include <algorithm> using namespace std; char s[10047]; int judge(char c) { if(c >= 'a' && c <= 'z') { return 1; } return 0; } int main() { char s1[17]; int a = 0, b = 0; while(~scanf("%s",&s)) { memset(s1, '\0',sizeof(s1)); int len = strlen(s); for(int i = 0; i < len; i++) { if(!judge(s[i])) { continue; } int k = 0; while(judge(s[i])) { s1[k++] = s[i]; i++; } if(strcmp(s1, "tram") == 0) { a++; } if(strcmp(s1, "trolleybus") == 0) { b++; } } } //printf("a:%d b:%d\n",a,b); if(a > b) { printf("Tram driver\n"); } else if(a < b) { printf("Trolleybus driver\n"); } else { printf("Bus driver\n"); } return 0; }
相关文章推荐
- URAL 1585. Penguins (字符串)
- [URAL-1517][求两个字符串的最长公共子串]
- 字符串专项:Ural 1723
- ural1989(字符串hash+线段树)
- 字符串专项:Ural 1102
- URAL 1989 Subpalindromes(线段树单点修改+字符串hash)
- 字符串专项:Ural 1354
- 字符串专项:Ural 1423
- ural1007 Code Words (字符串处理)
- Ural1094 && Ural1038(简单字符串)
- Ural1089(字符串处理)
- URAL 1989 Subpalindromes(字符串HASH&线段树单点更新)
- URAL 1486(二维字符串hash)
- URAL 1486 Equal Squares 二维字符串Hash + 邻接表分组
- URAL - 1989 Subpalindromes——字符串哈希 + 线段树
- 长度小于8000(varchar类型),以"逗号"分隔的字符串
- 字符串前的@符号的作用
- 汇编语言求字符串长度代码分析(10)
- c++(字符串处理函数)
- PC 110502 Reverse and Add //水题 字符串 模拟