914-24 guruh Dasturlash amaliyot #2
Contest Problems
Problem Tasks
# | Date | State |
---|
Not Contest
# | Date | State |
---|
E. Massiv14
Time limit : 1000 ms
Memory limit : 64 mb
Bir o`lchamli sonli massivni $2$ ga yo`ki $5$ ga bo`linadigan elementlarini ko`paytmasini $sinusi$ topilsin
Kiruvchi ma`lumotlar: Birinchi satrda $N$ ($1\le N \le 100$). Ikkinchi satrda $N$ ta butun son ($0\le a[i] \le 100$).
Chiquvchi ma`lumotlar: Masala yechimi $10^{-2}$ aniqlikda chiqarilsin
Input |
---|
6 44 34 42 83 43 64 |
Output |
0.02 |
Input |
---|
15 62 54 24 95 67 62 25 17 77 50 38 12 90 59 7 |
Output |
0.64 |