JumpingOnTheClouds:Revisited.cpp

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    int n;
    int k;
    cin >> n >> k;
    vector<int> c(n);
    for(int c_i = 0;c_i < n;c_i++){
       cin >> c[c_i];
    }
    
    int curr = 0, E = 100;
    
    do{
        E--;
        
        curr = (curr+k)%n;
        
        if(c[curr] == 1){
            E -= 2;
        }
    }while(curr != 0);
    
    cout << E << endl;
    
    return 0;
}