int jumpingOnClouds(vector<int> c, int k) {
    int position = 0, energie = 100;
    do{
        position = (position + k) % c.size();
        energie -= 1 + c[position] * 2;
    }while(position != 0);
    return energie;
}

// Complete the jumpingOnClouds function below.
  static int jumpingOnClouds(int[] clouds, int jumpLength) {
    int energy = 100;
    int cloudsLength = clouds.length;
    int cloudOn = 0;
    do{
      cloudOn = (cloudOn + jumpLength) % cloudsLength;
      if(clouds[cloudOn] == 1) energy -= 3;
      else energy -= 1;

    }while(cloudOn != 0);
    

    return energy;

  }

k = 3

[1, 1, 1, 0, 1, 1, 0, 0, 0, 0]

Expected Output
80

int jumpingOnClouds(vector<int> c, int k) {
    int sizeC = c.size();
    int es;
    int sum;
    if ((sizeC % k) == 0){
        es = sizeC / k;
        sum = es;
        for (int i = 0; i < es; i++){
            if (c[i*k] == 1){sum = sum + 2;}
        }
    } else {
        es = sizeC * k;
        sum = sizeC;
        for (int i = 0; i < sizeC; i++){
            int h;
            if (i*k > sizeC){h = (i*k) % sizeC;}
            else { h = i*k;}
            if (c[h] == 1){sum = sum + 2;}
        }
    }

    int result;
    result = 100 - sum;
    return result;
}