摘要：
题目链接：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... 阅读全文