当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
4693：Huge String
题目描述
You can get a huge string from a tiny one S by repeating doing following replacement N times.
What's the substring containing M characters starting at the index K?
What's the substring containing M characters starting at the index K?
输入解释
There are multiple test cases. Process to the End of File.
The first line of each test contains the string S made up of nonspacing graphic characters, whose length doesn't exceed 100. The second line contains three integers: 0 ≤ N ≤ 100, 1 ≤ M ≤ 200 and 0 ≤ K ≤ 1081.
The first line of each test contains the string S made up of nonspacing graphic characters, whose length doesn't exceed 100. The second line contains three integers: 0 ≤ N ≤ 100, 1 ≤ M ≤ 200 and 0 ≤ K ≤ 1081.
输出解释
For each test case, output the substring [K, min(length(S), K + M))
输入样例
W 2 4 8 ACM-ICPC 1 8 0
输出样例
W ACM-ICPC
提示
H.html download 方便图中文字复制 http://pan.baidu.com/share/link?shareid=463767611&uk=352484775
来自杭电HDUOJ的附加信息
| Author | Zejun Wu (watashi) |
| Recommend | zhuyuanchen520 |
最后修改于 2020-10-25T23:15:53+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
| 时间上限 | 内存上限 |
| 3000/3000MS(Java/Others) | 65535/65535K(Java/Others) |
登陆或注册以提交代码