Problems
Contests
Topic
IDE
Events
PacketHub
Login
Description
Editorial
My Submission
1080.Recycled Numbers
Look up all submission
Status
Time
Memory
Lang.
Submit Date
1080.Recycled Numbers
Time Limit:2000MS Memory Limit:65535KB
Description
Do you ever become frustrated with television because you keep seeing the same things, recycled over and over again? Well I personally don't care about television, but I do sometimes feel that way about numbers. Let's say a pair of distinct positive integers (n, m) is recycled if you can obtain m by moving some digits from the back of n to the front without changing their order. For example, (12345, 34512) is a recycled pair since you can obtain 34512 by moving 345 from the end of 12345 to the front. Note that n and m must have the same number of digits in order to be a recycled pair. Neither n nor m can have leading zeros. Given integers **A** and **B** with the same number of digits and no leading zeros, how many distinct recycled pairs (n, m) are there with **A** ≤ n \< m ≤**B?**
Input
The first line of the input gives the number of test cases, **T** . **T** test cases follow. Each test case consists of a single line containing the integers **A** and **B** . ### Limits 1 ≤ **T** ≤ 50. 1 ≤ **A** ≤ **B** ≤ 2000000. **A** and **B** have the same number of digits.
Output
For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1), and y is the number of recycled pairs (n, m) with **A** ≤ n < m ≤ **B**.
Sample test
Sample input
4 1 9 10 40 100 500 1111 2222
Sample output
Case #1: 0 Case #2: 3 Case #3: 156 Case #4: 287
Note
#### Are we sure about the output to Case #4? Yes, we're sure about the output to Case #4. Many contestants got stuck in this problem because of the sample test case number 4. Let's say *n* is 1212, then after moving 1 or 3 digits you will get 2121, hence the pair (1212, 2121) will be counted twice if you count all possible moves. You can avoid this by breaking out of the loop once you reach the original number again, which will happen after moving 2 digits in the above example.
Tags
Post editorial
Editorials
GNU C++ 9.3.0
GNU C 9.3.0
Python 3.8.4
Lua 5.3
GO 1.12.4
JS - (nodejs 10.19.0)
Login before submit
Test Input
Test Output
4 1 9 10 40 100 500 1111 2222
Please run you code firstly.
Console
IDE Setting
字体设置
调整适合你的字体大小。
12px
13px
14px
15px
16px
18px
20px
主题设置
切换不同的代码编辑器主题，选择适合你的语法高亮。
Visual Studio
Visual Studio Dark
High Contrast Dark
行宽限制
设置每一行代码的最大字符个数，设置为0则不限制。
0
80
100
120
Login before submit
