Category
Similar Problems
0115. Kvadratlar yig`indisi
Time limit : 1000 ms
Memory limit : 64 mb
Bir o`lchamli sonli massivni $M$ dan kichik elementlarini kvadratlarini yig`indisi xisoblansin
Kiruvchi ma`lumotlar: Birinchi satrda $N$ ($1\le N \le 100$). Ikkinchi satrda $N$ ta butun son ($0\le a[i] \le 100$). Uchinchi satrda $M$ ($0\le M \le 100$).
Chiquvchi ma`lumtolar: Masala yechimi
Input |
---|
1 38 9 |
Output |
0 |
Input |
---|
14 85 15 57 68 18 67 7 45 69 21 1 5 98 34 92 |
Output |
28594 |