Codeforces Round #428A

Posted 2020-10-02 %%%%%

Arya and Bran

题意：A每天可以得到ai颗糖，每天A最多可以给B8颗糖，A的糖可以结余，问最少多少天可以B可以得到k颗糖

思路：没什么好说的

AC代码：

#include "iostream"
#include "iomanip"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define step(x) fixed<< setprecision(x)<<
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ll long long
#define endl ("\n")
#define ft first
#define sd second
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e5+100;
const ll mod=1e9+7;

int n,k;
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>k;
    int t=0,l=0;
    for(int i=1; i<=n; ++i){
        int x; cin>>x; l+=x;
        if(l>=8){
            t+=8;
            l-=8;
        }
        else{
            t+=l;
            l=0;
        }
        if(t>=k){
            cout<<i;
            return 0;
        }
    }
    cout<<-1;
    return 0;
}