Category
Similar Problems

0108. Massiv8

Time limit : 1000 ms
Memory limit : 64 mb

Bir o`lchamli sonli massivni barcha elementlari massivni eng kichik elementiga bo`lib chiqilsin

Kiruvchi ma`lumotlar: Birinchi satrda N ($1\le N \le100$). Ikkinchi satrda N ta butun son($0\le a[i] \le 100$).

Chiquvchi ma`lumotlar: Masala yechimlari $10^{-2}$ aniqlikda

Input
9
69 48 58 45 57 55 88 89 85
Output
1.53 1.07 1.29 1.00 1.27 1.22 1.96 1.98 1.89
Input
3
4 84 79
Output
1.00 21.00 19.75