D✅

int countNecklaces(int maxPearls, int startMagnificence, int endMagnificence) {
    int count = 0;
    for (int pearls = 1; pearls <= maxPearls; pearls++) {
        for (int magnificence = startMagnificence; magnificence <= endMagnificence; magnificence++) {
            if (pearls == 1) {
                count++;
            } else {
                int prevCount = count;
                for (int prevMagnificence = startMagnificence; prevMagnificence <= magnificence; prevMagnificence++) {
                    count += prevCount;
                }
            }
        }
    }
    return count;
}

C++✅
Charles and Neckless

B✅

C✅

A✅

D✅

B✅

A✅

A✅

B✅

1025400 to 10254255255 C✅

D✅

C✅

B✅

B✅

A✅

Stocks Code
Python 3✅