# 【cf435A】Queue on Bus Stop

## 描述 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 ai 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.

## 输入格式 InputFormat

The first line contains two integers n and m (1 ≤ n, m ≤ 100). The next line contains n integers: a1, a2, …, an (1 ≤ ai ≤ m).

## 输出格式 OutputFormat

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

6 4
1 3 2 3 4 1

5

Codeforces 435A

## 代码 Code

``````#include <stdio.h>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define inf 0x7fffffff/27.11
int a[1000];
int i,j,t,n,m,l,r,k,z,y,x;
int main()
{
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++) scanf("%d",&a[i]);
z=0;
for (i=1;i<=n;)
{
t=0;
while (t+a[i]<=m)
{
t+=a[i];
i++;
}
z++;
}
printf("%d\n",z);
return 0;
}``````