govnokod

JavaScript

/*
Take a Number And Sum Its Digits Raised To The Consecutive Powers And ….¡Eureka!!
The number 89 is the first integer with more than one digit that fulfills the property partially introduced in the title of this kata. What's the use of saying "Eureka"? Because this sum gives the same number.

In effect: 89 = 8^1 + 9^2

The next number in having this property is 135.

See this property again: 135 = 1^1 + 3^2 + 5^3

We need a function to collect these numbers, that may receive two integers a, b that defines the range [a, b] (inclusive) and outputs a list of the sorted numbers in the range that fulfills the property described above.
*/
function sumDigPow(a, b) {
    var i;
    const arr = [];
    var sum;
    for (i = a; i <= b; ++i) {
        var iFirstNumber = Math.floor(i / 1000000);
        var iSecondNumber = Math.floor((i - iFirstNumber * 1000000) / 100000);
        var iThirdNumber = Math.floor((i - iFirstNumber * 1000000 - iSecondNumber * 100000) / 10000);
        var iFourthNumber = Math.floor((i - iFirstNumber * 1000000 - iSecondNumber * 100000 - iThirdNumber * 10000) / 1000);
        var iFifthNumber = Math.floor((i - iFirstNumber * 1000000 - iSecondNumber * 100000 - iThirdNumber * 10000 - iFourthNumber * 1000) / 100);
        var iSixthNumber = Math.floor((i - iFirstNumber * 1000000 - iSecondNumber * 100000 - iThirdNumber * 10000 - iFourthNumber * 1000 - iFifthNumber * 100) / 10);
        var iSeventhNumber = Math.floor(i - iFirstNumber * 1000000 - iSecondNumber * 100000 - iThirdNumber * 10000 - iFourthNumber * 1000 - iFifthNumber * 100 - iSixthNumber * 10)
            if (i < 10){
                sum = i;
            }else if (i < 100) {
                sum = iSeventhNumber * iSeventhNumber + iSixthNumber;
            }else if (i < 1000) {
                sum = iSeventhNumber * iSeventhNumber * iSeventhNumber + iSixthNumber * iSixthNumber + iFifthNumber;
            }else if (i < 10000){
                sum = iSeventhNumber * iSeventhNumber *...