> #include<iostream>
> #include<cstdio>
> #include<cstring>
> #include<cstdlib>
> #include<queue>
> #include<vector>
> using namespace std;
> 
> #define maxn 100100
> 
> int vst[maxn], que[maxn << 1], head, tail;
> int a, b, c, u;
> long long ret, h;
> 
> int main() {
> 	cin>>h>>a>>b>>c;
> 	while (head < tail) {
> 		u = que[head++];
> 		if (!u) {u = a; vst[u] = vst[0];}
> 		if (!vst[(u+b)%a] || vst[u]+(u+b>a)<vst[(u+b)%a]) {
> 			que[tail++] = (u+b)%a;
> 		}
> 		if (!vst[(u+c)%a] || vst[u]+(u+c>a)<vst[(u+c)%a]) {
> 			que[tail++] = (u+c)%a;
> 		}
> 	}
> 	ret = 0;
> 	for (int i=1;i<=a;++i)
> 		if (vst[i] && h >= i) {
> 			ret += (2 + (long long)(h-i)/(long long)a - (long long)vst[i]) >? 0;
> 		}
> 	cout<<ret<<endl;
> }

• 不胜感激 发至fzczx123@163.com 谢谢了 (0) abcdef 2010-03-31 21:13:36