1const e=`A. Chewbacca and Number 2time limit per test: 1 second 3memory limit per test: 256 megabytes 4 5Luke Skywalker gave Chewbacca an integer number x. Chewbacca isn't good at numbers but he loves inverting digits in them. Inverting digit t means replacing it with digit 9 - t. 6 7Help Chewbacca to transform the initial number x to the minimum possible positive number by inverting some (possibly, zero) digits. The decimal representation of the final number shouldn't start with a zero. 8 9Input 10The first line contains a single integer x (1 ⤠x ⤠10^18) â the number that Luke Skywalker gave to Chewbacca. 11 12Output 13Print the minimum possible positive number that Chewbacca can obtain after inverting some digits. The number shouldn't contain leading zeroes. 14 15Examples 16 17Input 1827 19 20Output 2122 22 23Input 244545 25 26Output 274444 28 29Write a complete solution in code. 30`;export{e as default};
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.