Safecracker
摘要：
传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1015 分析：DFS#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;char s[27], res[6];int target, ok[27], flag, len;int cal( char * a ){ int t, sum = 0; for ( int i = 0; i < 5; i++ ) { t = 阅读全文
posted @ 2012-03-26 16:30 GQHero 阅读(173) 评论(0) 推荐(0) 编辑
