Google Code Jam 2009资格赛 题目C Welcome to Code Jam
来源:互联网 发布:ai软件怎么截图 编辑:程序博客网 时间:2024/05/16 08:50
Problem
So you've registered. We sent you a welcoming email, to welcome you to code jam. But it's possible that you still don't feel welcomed to code jam. That's why we decided to name a problem "welcome to code jam." After solving this problem, we hope that you'll feel very welcome. Very welcome, that is, to code jam.
If you read the previous paragraph, you're probably wondering why it's there. But if you read it very carefully, you might notice that we have written the words "welcome to code jam" several times: 400263727 times in total. After all, it's easy to look through the paragraph and find a 'w'; then find an 'e' later in the paragraph; then find an 'l' after that, and so on. Your task is to write a program that can take any text and print out how many times that text contains the phrase "welcome to code jam".
To be more precise, given a text string, you are to determine how many times the string "welcome to code jam" appears as a sub-sequence of that string. In other words, find a sequence s of increasing indices into the input string such that the concatenation of input[s[0]], input[s[1]], ..., input[s[18]] is the string "welcome to code jam".
The result of your calculation might be huge, so for convenience we would only like you to find the last 4 digits.
Input
The first line of input gives the number of test cases, N. The next N lines of input contain one test case each. Each test case is a single line of text, containing only lower-case letters and spaces. No line will start with a space, and no line will end with a space.
Output
For each test case, "Case #x: dddd", where x is the case number, and dddd is the last four digits of the answer. If the answer has fewer than 4 digits, please add zeroes at the front of your answer to make it exactly 4 digits long.
Limits
1 ≤ N ≤ 100
Small dataset
Each line will be no longer than 30 characters.
Large dataset
Each line will be no longer than 500 characters.
Sample
Input
Output
3
elcomew elcome to code jam
wweellccoommee to code qps jam
welcome to codejam
Case #1: 0001
Case #2: 0256
Case #3: 0000
- Google Code Jam 2009资格赛 题目C Welcome to Code Jam
- Google Code Jam 2009 资格赛题目A
- Google Code Jam 2009资格赛 题目B Watersheds
- Google Code Jam 2009 资格赛题目B 分析
- Google Code Jam 2009 资格赛题目B 程序
- Google Code Jam 2009预选赛第三题----Welcome to Code Jam
- google code jam 2009资格赛(pass)
- Google Code Jam 2015资格赛
- Google Code Jam 2016 资格赛
- Google Code Jam 2017 资格赛
- 练习题 welcome to code jam
- google code jam 08 资格赛A题
- Google Code Jam 2012 资格赛1
- Google Code Jam 2012 资格赛2
- Google Code Jam 2012 资格赛3
- google code jam 2009 round1 c
- Google Code Jam 2014 -- C
- Google Code Jam 2006
- VC按钮的鼠标滑过效果的实现
- 导出到excel,word,避免了分页导致的导出不全问题
- ADROID 2.1 架构解析 1 语言定制
- SEO 优化
- WinCE上BINFS实现详解
- Google Code Jam 2009资格赛 题目C Welcome to Code Jam
- 这些道理不懂,你注定就是穷打工的命
- 测试
- ORACLE绑定变量的使用--摘抄自一片帖子
- 描述tablespace和datafile之间的关系
- Symbian 模拟按键关机
- 输入子系统--event层分析
- Android事件处理分析
- Android底层和中间层共同学习系列之android键盘映射