AIM Tech Round 3 (Div. 2) A.Juicer

A. Juicer

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Kolya is going to make fresh orange juice. He has n oranges of sizes a1, a2, ..., an. Kolya will put them in the juicer in the fixed order, starting with orange of size a1, then orange of size a2 and so on. To be put in the juicer the orange must have size not exceeding b, so if Kolya sees an orange that is strictly greater he throws it away and continues with the next one.

The juicer has a special section to collect waste. It overflows if Kolya squeezes oranges of the total size strictly greater than d. When it happens Kolya empties the waste section (even if there are no more oranges) and continues to squeeze the juice. How many times will he have to empty the waste section?

Input

The first line of the input contains three integers n, b and d (1 ≤ n ≤ 100 000, 1 ≤ b ≤ d ≤ 1 000 000) — the number of oranges, the maximum size of the orange that fits in the juicer and the value d, which determines the condition when the waste section should be emptied.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1 000 000) — sizes of the oranges listed in the order Kolya is going to try to put them in the juicer.

Output

Print one integer — the number of times Kolya will have to empty the waste section.

Examples

input

2 7 10
5 6

output

1

input

1 5 10
7

output

0

input

3 10 10
5 7 7

output

1

input

1 1 1
1

output

0

Note

In the first sample, Kolya will squeeze the juice from two oranges and empty the waste section afterwards.

In the second sample, the orange won't fit in the juicer so Kolya will have no juice at all.

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
int main(){
	int n,b,d;
	int a,sum=0;
	int cnt=0;
	scanf("%d %d %d",&n,&b,&d);
	while(n--){
		scanf("%d",&a);
		if(a<=b){
			sum+=a;
		}
		if(sum>d){
			cnt++;
			sum=0;
		}
//		cout<<sum<<endl;
	}
	printf("%d\n",cnt);
}

这题题意理解很关键呀。

题意：你有n个橙子，把它们按顺序放进容量为d的榨汁机，每次最大只能放入大小为b的橙子（严格大于b则舍弃）；一旦榨汁机容量严格超过d时，清空里面所有的橙子；求清空次数；

题意理解了好像也没什么会WA的点，主要是清空时sum=0需要注意；

（明明还没有过main test就来写博客的窝XD……）