CodeForces 709A Juicer

简单题。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<iostream>
using namespace std;
typedef long long LL;
const double pi=acos(-1.0),eps=1e-;
void File()
{
    freopen("D:\\in.txt","r",stdin);
    freopen("D:\\out.txt","w",stdout);
}
template <class T>
inline void read(T &x)
{
    char c = getchar(); x = ;while(!isdigit(c)) c = getchar();
    while(isdigit(c)) { x = x *  + c - ''; c = getchar();  }
}

const int maxn=;
int a[maxn],b,n,d;

int main()
{
    scanf("%d%d%d",&n,&b,&d);
    for(int i=;i<=n;i++) scanf("%d",&a[i]);

    int ans=,sum=;
    for(int i=;i<=n;i++)
    {
        if(a[i]>b) continue;
        sum=sum+a[i];
        if(sum>d) ans++,sum=;
    }
    printf("%d\n",ans);
    return ;
}