Codeforces Round #428 (Div. 2) A. Arya and Bran

#include <bits/stdc++.h>using namespace std;const int MAXN = 110;int candy[MAXN];int main(){    ios::sync_with_stdio(false);    int n,k;    cin >> n >> k;    for(int i = 0; i < n; ++i)        cin >> candy[i];    int pre = 0;    int cnt = 0;    int day = 0;    for(int i = 0; i < n; ++i)    {        candy[i] += pre;        if(candy[i] >= 8)        {            pre = candy[i]-8;            cnt += 8;        }        else        {            pre = 0;            cnt += candy[i];        }        if(cnt >= k)        {            day = i+1;            break;        }    }    if(day)        cout << day <<endl;    else        cout <<-1 << endl;    return 0;}