Category
Similar Problems

0107. Massiv7

Time limit : 1000 ms
Memory limit : 64 mb

Bir o`lchamli sonli massivni barcha elementlari massivni eng katta 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
37 23 51 47 12 23 90 85 98
Output
0.38 0.23 0.52 0.48 0.12 0.23 0.92 0.87 1.00
Input
3
60 19 27
Output
1.00 0.32 0.45