Category
Similar Problems
0116. Massiv16
Time limit : 1000 ms
Memory limit : 64 mb
Bir o`lchamli sonli massivni elementlarini massivni eng katta elementiga bo`lib chiqilsin
Kiruvchi ma`lumotlar: Birinchi satrda $N$ ($1\le N \le 100$). Ikkinchi satrda $N$ ta butun son ($1\le a[i] \le 100$).
Chiquvchi ma`lumtolar: $N$ ta son masala yechimi. Yechimlar $10^{-2}$ aniqlikda chiqarilsin
| Input |
|---|
| 5 91 51 75 85 29 |
| Output |
| 1.00 0.56 0.82 0.93 0.32 |
| Input |
|---|
| 8 30 31 30 94 61 41 74 78 |
| Output |
| 0.32 0.33 0.32 1.00 0.65 0.44 0.79 0.83 |