Queue on Bus Stop

最新推荐文章于 2022-11-21 22:47:25 发布

踢树叶

最新推荐文章于 2022-11-21 22:47:25 发布

阅读量415

点赞数

CC 4.0 BY-SA版权

分类专栏： AC路漫漫

本文链接：https://blog.youkuaiyun.com/geekdoe/article/details/50455389

AC路漫漫专栏收录该内容

180 篇文章

订阅专栏

本文探讨了俄罗斯人们在夏季前往乡村小屋时，如何通过公交车进行集体出行的问题。具体而言，文章详细介绍了如何计算所需公交车数量，以确保所有小组都能顺利到达目的地。包括输入和输出说明，以及一个具体的示例来展示解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

It's that time of the year when the Russians flood their countryside summer cottages (dachas) and the bus stop has a lot of people. People rarely go to the dacha on their own, it's usually a group, so the people stand in queue by groups.

The bus stop queue has n groups of people. The i-th group from the beginning has a_i people. Every 30 minutes an empty bus arrives at the bus stop, it can carry at most m people. Naturally, the people from the first group enter the bus first. Then go the people from the second group and so on. Note that the order of groups in the queue never changes. Moreover, if some group cannot fit all of its members into the current bus, it waits for the next bus together with other groups standing after it in the queue.

Your task is to determine how many buses is needed to transport all n groups to the dacha countryside.

Input

The first line contains two integers n and m(1 ≤ n, m ≤ 100). The next line contains n integers: a₁, a₂, ..., a_n(1 ≤ a_i ≤ m).

Output

Print a single integer — the number of buses that is needed to transport all n groups to the dacha countryside.

Sample Input

Input

4 3
2 3 2 1

Output

Input

3 4
1 2 1

Output

#include<cstdio>
#include<iostream>
using namespace std;

int a[105];

int main(){
    int n,m,i,ans,now;
    while(cin>>n>>m){
        for(i=0;i<n;i++){
            cin>>a[i];
        }
        ans=1;
        now=m;
        for(i=0;i<n;){
            if(a[i]<=now){
                now-=a[i];
                i++;
            }
            else{
                now=m;
                ans++;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}