HUSTOJ
Toggle navigation
Home
Problem
Status
Rank
Contest
FAQ
Discuss
Login
Register
The 7th(2012) ACM Programming Contest of HUST - Preliminary Contest
From:
2012-11-17 12:00:00
To:
2012-11-17 17:00:00
Now:
2017-09-22 06:47:30
Status:
Public
Problem
Standing
Statistics
Status
Clarification
D - Substring
Time Limit:
2s
Memory Limit:
64MB
Submissions: 771 Solved: 174
Description
This problem is quiet easy.
Initially, there is a string A.
Then we do the following process infinity times.
A := A +
“HUSTACM”
+ A
For example, if a = “X”, then
After 1 step, A will become
“XHUSTACMX”
After 2 steps, A will become
“XHUSTACMXHUSTACMXHUSTACMX”
Let A = “X”, Now I want to know the characters from L to R of the final string.
Input
Multiple test cases, in each test case, there are only one line containing two numbers L and R.
1 <= L <= R <= 10^12
R-L <= 100
Output
For each test case, you should output exactly one line which containing the
substring
.
Sample Input
5 10
Sample Output
TACMXH
Hint
Source
Problem Setter : Yang Xiao
Submit
Summary
Discuss