REPNUM - Repeated Numbers
We define a repeated number as a positive integer consisting of two or more instances of the same digit concatenated together. For example, 11 and 4444 are repeated numbers, while 5 and 11222 are not.
Given a positive integer n, your task is to find all repeated numbers that have fewer digits than n has.
Input
First an integer t (1 ≤ t ≤ 100), then on each of the next t lines an integer n (1 ≤ n < 1018).
Output
For each test case, print all repeated numbers that have fewer digits than n has, in ascending order.
Score
Your score is your source length.
Example
Input:
2 100 1234
Output:
11 22 33 44 55 66 77 88 99 11 22 33 44 55 66 77 88 99 111 222 333 444 555 666 777 888 999
hide comments
Mitch Schwartz:
2014-11-04 19:07:24
Problem statement updated. Although easy to solve, it has some interesting features for golf in various languages. |
|
Francky:
2014-11-04 00:21:30
@min_25 (about the reply to Mitch) : In that case, IO files could be broken, as with 13, we are waiting for only 11, not 11 22 ... 99. |
|
Min_25:
2014-11-03 23:49:21
@Mitch
|
|
Mitch Schwartz:
2014-11-03 23:16:18
Integer t on first line, then t lines each containing some integer n, and we print in ascending order the repeated numbers x such that 11 <= x <= n ?
|
|
Min_25:
2014-11-03 21:17:22
The I/O files seem to be O.K.
|
|
Sergey Skupoy:
2014-05-23 15:32:40
Can anybody tell me how program should read input data? For example if I have a solution in AWK, the script needs to read certain lines of input file, which lines (line numbers)? Last edit: 2014-05-23 15:33:09 |
|
Samil Vargas:
2014-01-01 21:23:33
why not PYTHON? |
|
Hector Monteo:
2013-12-17 02:15:53
Please, see my solution ID: 10678458 Last edit: 2013-12-17 02:15:59 |
|
Hector Monteo:
2013-12-17 02:13:50
I need more test cases.
|
Added by: | avinash |
Date: | 2013-02-20 |
Time limit: | 1s |
Source limit: | 140B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | GAWK C C++ 4.3.2 CPP C99 |