1186D.md (1773B)
1 Source: https://codeforces.com/problemset/problem/1186/D 2 3 D. Vus the Cossack and Numbers 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 Vus the Cossack has $n$ real numbers $a_i$. It is known that the sum of all numbers is equal to $0$. He wants to choose a sequence $b$ the size of which is $n$ such that the sum of all numbers is $0$ and each $b_i$ is either $\lfloor a_i \rfloor$ or $\lceil a_i \rceil$. In other words, $b_i$ equals $a_i$ rounded up or down. It is not necessary to round to the nearest integer. 22 23 For example, if $a = [4.58413, 1.22491, -2.10517, -3.70387]$, then $b$ can be equal, for example, to $[4, 2, -2, -4]$. 24 25 Note that if $a_i$ is an integer, then there is no difference between $\lfloor a_i \rfloor$ and $\lceil a_i \rceil$, $b_i$ will always be equal to $a_i$. 26 27 Help Vus the Cossack find such sequence! 28 29 Input 30 31 The first line contains one integer $n$ ($1 \leq n \leq 10^5$) — the number of numbers. 32 33 Each of the next $n$ lines contains one real number $a_i$ ($|a_i| \lt 10^5$). It is guaranteed that each $a_i$ has exactly $5$ digits after the decimal point. It is guaranteed that the sum of all the numbers is equal to $0$. 34 35 Output 36 37 In each of the next $n$ lines, print one integer $b_i$. For each $i$, $|a_i-b_i| \lt 1$ must be met. 38 39 If there are multiple answers, print any. 40 41 Examples 42 43 Input 44 45 ``` 46 4 47 4.58413 48 1.22491 49 -2.10517 50 -3.70387 51 ``` 52 53 Output 54 55 ``` 56 4 57 2 58 -2 59 -4 60 ``` 61 62 Input 63 64 ``` 65 5 66 -6.32509 67 3.30066 68 -0.93878 69 2.00000 70 1.96321 71 ``` 72 73 Output 74 75 ``` 76 -6 77 3 78 -1 79 2 80 2 81 ``` 82 83 Note 84 85 The first example is explained in the legend. 86 87 In the second example, we can round the first and fifth numbers up, and the second and third numbers down. We can round the fourth number neither up, nor down.