def jumpingOnClouds(c, k):
    n = len(c)
    i = k % n
    jump_list = [c[0]]
    while (i != 0):
        jump_list.append(c[i])
        i = (i + k) % n
    energy = 100
    for i in jump_list:
        energy -= 1
        if i == 1:
            energy -= 2
    return energy

static int jumpingOnClouds(int[] c, int k) {
        int e = 100, jump = 0;
        while(true){
            e--;
            if(c[jump] == 1) e -= 2;
            jump = (jump + k) % c.length;
            if (jump == 0) break;
        }
        return e;
    }

function jumpingOnClouds(c, k) {
    let index = 0, e = 100;
    let n = c.length;
    do {
        if (c[index]==1) {
            e -= 2;
        }
        e--;
        index = (index + k) % n;
    } while (index!=0);
    return e;
}

 static int jumpingOnClouds(int[] c, int k) {
        int energy = 100;
        boolean stopFlag = true;
        int index = 0;
        
        while(stopFlag){
            energy--;
            if(c[index] == 1){
                energy -= 2;
            }
            index = (index + k) % c.length;
            if (index == 0){
                stopFlag = false;
            }
        }
        return energy;
    }

if (c.length % k && (c.length % 2 || k % 2)) 
        return 100 - (c.length + c.reduce((prev, curr) => prev + curr) * 2)
  
    return 100 - c.reduce((prev, curr, index) => {
        if (index % k === 0) prev += (curr ? 3 : 1)         
        return prev
    }, 0)