Category
Similar Problems

0125. Massiv25

Time limit : 1000 ms
Memory limit : 64 mb

Bir o`lchamli sonli massivni $k$-elementidan $l-$ elementigacha bo`lgan elementlarining kublari yigindisi xisoblansin

Kiruvchi ma`lumotlar: Birinchi satrda $N$ ($1\le N \le 100$). Ikkinchi satrda $N$ ta butun son ($-100\le a[i] \le 100$). Uchinchi satrda $k,l$ ($1\le k,l \le 100$).

Chiquvchi ma`lumotlar: Masala yechimi

Input
3
45 65 -52
1 2
Output
365750
Input
2
24 9
1 2
Output
14553