1495 : 江莉时代,沸腾期待!
- 时间限制Time Limit
- 1 秒Sec
- 内存限制Memory Limit
- 128 兆MB
- 提交次数Submitted
- 0 次Times
- 通过次数Solved
- 0 次Times
标准评测 Standard
从标准输入读入,结果写到标准输出。评测将输出拆成 token,与标准答案逐项比较,不按整段逐字节比对。
Read from standard input and write to standard output. The judge splits the output into tokens and compares them with the official answer; it does not compare raw bytes.
| 比对Compare | token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored. |
|---|---|
| 不同则错Differs | token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ. |
| 输入Input | 标准输入,格式见题面。Standard input; format as in the statement. |
| 输出Output | 标准输出。Standard output. |
| 时间与内存Time and memory | 记这一份程序的 CPU 时间和内存峰值。题目上的时间限制、内存限制就是这一份的上限。The record is this program’s CPU time and peak memory. The limits on the problem apply to this one run. |
题目描述Description
You are given a string S of length N consisting of uppercase and lowercase English letters.
Find the position where Jiangly first appears as a (contiguous) substring in S.
In other words, find the smallest integer n that satisfies all of the following conditions.
- 1\le n\le N - 6
- The string obtained by extracting the n-th through (n + 6)-th characters of S is Jiangly.
If Jiangly does not appear in S, print xiaoheizi
输入格式Input
The input is given from Standard Input in the following format:
S
- 6\le |S|\le 100 (|S| is the length of the string S.)
- Each character of S is an uppercase or lowercase English letter.
输出格式Output
Print the position where Jiangly first appears as a substring in S, or xiaoheizi if it does not appear in S.
样例Sample
来源Source
深圳技术大学第四届程序设计竞赛
题目到此结束End of problem