codeforces-scrape

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

135A.md (1420B)


      1 Source: https://codeforces.com/problemset/problem/135/A
      2 
      3 A. Replacement
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 Little Petya very much likes arrays consisting of *n* integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose exactly one element from the array and replace it with another integer that also lies in the range from 1 to 109, inclusive. It is not allowed to replace a number with itself or to change no number at all.
     22 
     23 After the replacement Petya sorted the array by the numbers' non-decreasing. Now he wants to know for each position: what minimum number could occupy it after the replacement and the sorting.
     24 
     25 Input
     26 
     27 The first line contains a single integer *n* (1 ≤ *n* ≤ 105), which represents how many numbers the array has. The next line contains *n* space-separated integers — the array's description. All elements of the array lie in the range from 1 to 109, inclusive.
     28 
     29 Output
     30 
     31 Print *n* space-separated integers — the minimum possible values of each array element after one replacement and the sorting are performed.
     32 
     33 Examples
     34 
     35 Input
     36 
     37 ```
     38 5  
     39 1 2 3 4 5
     40 ```
     41 
     42 Output
     43 
     44 ```
     45 1 1 2 3 4
     46 ```
     47 
     48 Input
     49 
     50 ```
     51 5  
     52 2 3 4 5 6
     53 ```
     54 
     55 Output
     56 
     57 ```
     58 1 2 3 4 5
     59 ```
     60 
     61 Input
     62 
     63 ```
     64 3  
     65 2 2 2
     66 ```
     67 
     68 Output
     69 
     70 ```
     71 1 2 2
     72 ```