HACKERRANK jumping-on-the-clouds-revisited Solution

| July 23, 2016

The correct, optimal and working solution for programming question jumping-on-the-clouds-revisited on hackerrank

/*
 *  Author: Arpit Bhayani
 *  http://arpitbhayani.me
 */
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <iostream>
#include <list>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

#define ll long long

#define MIN(a, b) a < b ? a : b
#define MAX(a, b) a > b ? a : b

using namespace std;

int readline(char *str) {
    int i = 0;
    char ch;
    while((ch = getchar()) != '\n') {
        str[i++] = ch;
    }
    str[i] = '\0';
    return i;
}

int main(int argc, char *argv[]) {
    int n, k;
    cin >> n >> k;

    int arr[n];
    for(int i = 0 ; i < n; i++) {
        cin >> arr[i];
    }

    int e = 100;
    int start = 0;

    do {
        e--;
        start = (start + k) % n;

        if(arr[start] == 1) {
            e -= 2;
        }

    } while(start != 0);

    cout << e << endl;

    return 0;
}