codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1263B.md (1954B)


      1 Source: https://codeforces.com/problemset/problem/1263/B
      2 
      3 B. PIN Codes
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 A PIN code is a string that consists of exactly $4$ digits. Examples of possible PIN codes: 7013, 0000 and 0990. Please note that the PIN code can begin with any digit, even with 0.
     22 
     23 Polycarp has $n$ ($2 \le n \le 10$) bank cards, the PIN code of the $i$-th card is $p_i$.
     24 
     25 Polycarp has recently read a recommendation that it is better to set different PIN codes on different cards. Thus he wants to change the minimal number of digits in the PIN codes of his cards so that all $n$ codes would become different.
     26 
     27 Formally, in one step, Polycarp picks $i$-th card ($1 \le i \le n$), then in its PIN code $p_i$ selects one position (from $1$ to $4$), and changes the digit in this position to any other. He needs to change the minimum number of digits so that all PIN codes become different.
     28 
     29 Polycarp quickly solved this problem. Can you solve it?
     30 
     31 Input
     32 
     33 The first line contains integer $t$ ($1 \le t \le 100$) — the number of test cases in the input. Then test cases follow.
     34 
     35 The first line of each of $t$ test sets contains a single integer $n$ ($2 \le n \le 10$) — the number of Polycarp's bank cards. The next $n$ lines contain the PIN codes $p_1, p_2, \dots, p_n$ — one per line. The length of each of them is $4$. All PIN codes consist of digits only.
     36 
     37 Output
     38 
     39 Print the answers to $t$ test sets. The answer to each set should consist of a $n + 1$ lines
     40 
     41 In the first line print $k$ — the least number of changes to make all PIN codes different. In the next $n$ lines output the changed PIN codes in the order corresponding to their appearance in the input. If there are several optimal answers, print any of them.
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 3
     49 2
     50 1234
     51 0600
     52 2
     53 1337
     54 1337
     55 4
     56 3139
     57 3139
     58 3139
     59 3139
     60 ```
     61 
     62 Output
     63 
     64 ```
     65 0
     66 1234
     67 0600
     68 1
     69 1337
     70 1237
     71 3
     72 3139
     73 3138
     74 3939
     75 6139
     76 ```