摘要: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3321回溯,dfs实现,注意要用long long, 9个100相乘最大数需要long long表示。#include <iostream>#include <cstdio>using namespace std;long long a[20];int n;int k;long long ans;const long long inf = 1000000000000000LL;long long myabs(long long nn){ return 阅读全文
posted @ 2009-09-05 23:31 zhwj184 阅读(105) 评论(0) 推荐(0) 编辑
摘要: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1875#include <vector>#include <iostream>#include<algorithm>#include <string>#include <cstring>using namespace std;int main(){ vector<string> phonelist; int testcast; cin >> testcast; while(testcast-- 阅读全文
posted @ 2009-09-05 16:28 zhwj184 阅读(146) 评论(0) 推荐(0) 编辑