Error
|
|
---|---|
@Ibrahim Nash | 6379 |
@blackshadows | 6329 |
@mb1973 | 5358 |
@Quandray | 5231 |
@akhayrutdinov | 5111 |
@saiujwal13083 | 4510 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3522 |
@sushant_a | 3459 |
@verma_ji | 3357 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@ritiksethi21 | 1050 |
@aroranayan999 | 807 |
@RizulBansal | 685 |
@ashishtrehan002 | 538 |
@hemantgarg923 | 528 |
@simrangoyal | 526 |
@ronaldo77 | 520 |
@thanosagain | 505 |
@anishrajan | 505 |
@ssparteek470 | 495 |
@rahul2312 | 491 |
Complete Leaderboard |
Given a string s consists of lower case English alphabets or digits. The task is to replace each occurrence of digit with '*' or '@' or '!'. The task is to print all possible distinct strings in lexicographical order with space separation.
Note: ASCII value of '!' less than '*' and ASCII value of '*' is less than '@'
Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains a string s.
Output: For each test case, print all possible distinct strings in lexicographical order with space separation
Constraints:
1. 1 <= T <= 3
2. 1<= size of string <= 10
Example:
Input:
2
a1b2
abcdef
Output:
a!b! a!b* a!b@ a*b! a*b* a*b@ a@b! a@b* a@b@
abcdef
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes