Category
Similar Problems
0110. Massiv10
Time limit : 1000 ms
Memory limit : 64 mb
Bir o`lchamli sonli massivni K yo`ki M ga teng elementlari ko`paytmasi xisoblansin
Kiruvchi ma`lumotlar: Birinchi satrda N ($1\le N \le100$). Ikkinchi satrda N ta butun son($0\le a[i] \le 100$). Uchinchi satrda K va M ($1\le K,M \le 100$);
Chiquvchi ma`lumotlar: Masala yechimi.
Input |
---|
5 7 11 83 18 31 31 3 |
Output |
31 |
Input |
---|
7 44 64 23 84 13 6 22 22 6 |
Output |
132 |