Author: | A. Klenin | Time limit: | 2 sec | |
Input file: | input.txt | Memory limit: | 64 Mb | |
Output file: | output.txt |
Colors on computer screen are represented by (r,g,b) triplets, where r,g,b are integer intensities of red, green and blue components.
Two colors (r1,g1,b1) and (r2,g2,b2) are distinct if min(|r1−r2|,|g1−g2|,|b1−b2|)≥D.
Your program will be given N (not necessarily distinct) colors. It must either calculate K new colors that are distinct from each other and from all initial colors, or determine that it is impossible.
No. | Input file (input.txt ) |
Output file (output.txt ) |
---|---|---|
1 |
|
|
2 |
|
|