等待最好的两个人！

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4287#include#include#include#includeusing namespace std;const int maxn = 5500;const int maxm = 1e6;int num[maxm];int map[26] = { 2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9 };int a[7] = {1,10,100,1000,10000,100000};int main(){ //freopen("E: 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4280#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#includeusing namespace std;const int maxn = 100005;const int maxe = 500000;const int INF = 0x3f3f3f;struct Edge{ int v,flow,cap; int next; Edge(int v=0 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4278#include#include#include#includeusing namespace std;int map1[11] = {0,1,2,0,3,4,5,6,0,7,8};int map2[11] = {1,8,64,512,4096,32768,262144,2097152,16777216,134217728,1073741824};int main(){ //freopen("E:\\acm\\input.txt","r",stdin); 阅读全文

摘要： #include#include#include#includeusing namespace std;const int INF = 32000;const int maxn = 105;int a[maxn];char ans[maxn]; //a[i] = 1代表+，2代表-，3代表*，4代表/ ;int len,goal;bool vis[maxn][INF+1][2]; // vis[i][j][1]=1 表示计算完前i个数字的某种组合可以得到正j，dp[i][j][0]=1则为负jbool dfs(int u,int sum){ if(u == 1){ i... 阅读全文

摘要： 题目链接：http://poj.org/problem?id=1011#include#include#include#includeusing namespace std;const int maxn = 100;int a[maxn];int N;int sum;int len,cnt;bool used[maxn];bool cmp(int a,int b){ return a > b;}bool dfs(int u,int curlen,int num){ if(num == cnt) return true; for(int i=u;i>N && N){ 阅读全文

摘要： 好苦逼，为啥数组开小了，不会runtime error，还得我WA了几个小时，我泪流满面。题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4620#include#include#include#include#includeusing namespace std;const int maxn = 35;struct Cut{ int T; int icnt; int bef_id; int a[11]; bool operator anspv){ anspv = deep; copy(t... 阅读全文

摘要： 题目链接：http://lightoj.com/volume_showproblem.php?problem=1031#include#include#include#includeusing namespace std;const int maxn = 105;int dp[maxn][maxn]; //dp[i][j] 表示先手从i到j比后手多的分差。int sum[maxn],a[maxn];int N;int main(){ // freopen("E:\\acm\\input.txt","r",stdin); int T; cin>> 阅读全文

摘要： 题目链接：http://lightoj.com/volume_showproblem.php?problem=1030#include#include#include#includeusing namespace std;const int maxn = 105;const int INF = 0x3f3f3f3f;double dp[maxn];int a[maxn];int main(){ //freopen("E:\\acm\\input.txt","r",stdin); int T; cin>>T; for(int cas=1;cas 阅读全文

摘要： 题目链接：http://lightoj.com/volume_showproblem.php?problem=1027#include#include#include#includeusing namespace std;int sum,ans,n,m;int Gcd(int a,int b){ if(a%b == 0) return b; return Gcd(b,a%b);}int main(){ //freopen("E:\\acm\\input.txt","r",stdin); int T; cin>>T; for(int cas=1 阅读全文

摘要： 题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3329参考网址：http://blog.csdn.net/morgan_xww/article/details/6775853#include#include#include#includeusing namespace std;const int maxn = 525;double A[maxn],B[maxn];int sta[maxn],icnt;int n,k1,k2,k3,a,b,c;int main(){ //freopen("E:\\ac 阅读全文