信息学集训队作业ural竞赛

1、题目来源Ural 1612. Tram Forum题目描述得到一系列的字符，计算其中 tram trolleybus 出现的次数（必须单独出现，后面不能有其他字母）如果 tram 次数大于 trolleybus 则输出Tram driver，小于输出 Trolleybus driver 等于输出 Bus driver算法描述模拟算法实现用两个标号 k1,k2现在已经比较到第几个字符，如果读入字符不是字母若 k1=4 则出现了一次 tram若 k14 则k1:=0如果读入字符是字母比较 ch 与 tram 第 k1+1 位，相等 k1:=k1+1 否则 k1；=0；*可以将标准串最后一位添加不可

2、能出的字符，则可满足“后面不能有其他字母”的条件同理比较 k2 得出结果源代码const st1:string=tram1;st2:string=trolleybus1; var ch:char;k1,k2,a1,a2:eger; beginrepeatread(ch);if not (ch=a)and(cha2 then wri if a1a2 then wriend.n(Bus driver);n(Tram driver); n(Trolleybus driver);原题1612. Tram Forum Time Limit: 0.5 secondMemory Limit: 64 MBTr

3、am, trolleybus, and bus drivers talk at the tram forum. We have read allmessagested at the forum during last monnd discovered aneresting n therule. Users in whose messages the word “tram” occurs more oftenword “trolleybus” are tram drivers. Similarly, users in whose messages the word“trolleybus” is

4、more frequentn the word “tram” are trolleybus drivers. Allother users of the tram forum are bus drivers. Given this information, can youdetermine who hasted the latest message at the tram forum?InputYou are given the latest message at the tram forum. The message consists oflowercase English letters,

5、 spa, line breaks, and punctuation marks: periods,commas, dashes, colons, and exclamation and question marks. The total length of the message is at most 10000 symbols. Words consist of letters andcan be separated by spa, line breaks, and punctuation marks.OutputOutput “Tram driver” if the user who h

6、asted the latest message is a tramdriver; output “Trolleybus driver” if she is a trolleybus driver; and output “Bus driver” if she is a bus driver.Slesinputof course, tram is the best transport he world!yes, yekaterinburg trams are theoutputTram driverbest tramshe world, butTrolleybus driveri like my trolleybus too.read forum.tr.ru every day!you can learn much about tram drivers and trolleybus drivers.Bus driverProblem Author: Alexander Ipatov (