ABCD1234

#include#includeusing namespace std;int c1[10000];int c2[10000];int num[4];int main(){ while(scanf("%d%d%d", &num[1], &num[2], &num[3])&&(num[1]||num[2]||num[3])) { int _max = n

首先看看hdu的ppt；http://wenku.baidu.com/view/415ed1bcc77da26925c5b098.html 接着看看 大神的总结： http://www.wutianqi.com/?p=596 模板： #include using namespace std;const int _max = 100001;int c1

#include #include using namespace std;const int maxn = 10000;int c1[maxn], c2[maxn], c3[maxn];int main(){ for(int i = 0; i <= 310; i++) { c1[i] = 1; c2[i] = 0

#include #include using namespace std;const int maxn = 10000;int c1[maxn], c2[maxn], c3[maxn];int main(){ int n; while(cin >> n) { for(int i = 0; i <= n; i++)

#include #include using namespace std;int c1[105], c2[105], a[105], b[105];int n, m;int main(){ while(cin >> n >> m) { for(int i = 0; i < 105; i++) c1[i]

#include #include #include using namespace std;int c1[250010], c2[250010];int value[55];int amount[55];int nNum;int main(){ while(scanf("%d", &nNum) && nNum>0) {

是个天平 可以相减， #include #include using namespace std;const int maxn = 10100;int c1[maxn], c2[maxn];int num[101], f[maxn];int n;int main(){ while(cin >> n) { int su

#include #include #include using namespace std;int main(){ int c1[1001], c2[1001], a[30]; int t; scanf("%d", &t); while(t--) { int sum = 0; int m, b;