随笔分类 - 广搜
摘要:#include #include #include #include #include using namespace std; const int maxn=1007; int main() { int T; scanf("%d", &T); while(T--) { int n, num; scanf("%d", &n...
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=1495 非常可乐 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=2612 Find a way Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submis
阅读全文
摘要:http://poj.org/problem?id=1426 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 30731 Accepted: 12788 Special Judge Description Given a posi
阅读全文
摘要:http://poj.org/problem?id=2251 Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 32885 Accepted: 12601 Description You are tra
阅读全文
摘要:#include #include #include #include #include #include using namespace std; const int maxn=100007; int n, k, vis[maxn];; struct node { int x, step; }; int bfs() { queueQ; node p, q; ...
阅读全文
摘要:题目链接:http://poj.org/problem?id=3126
阅读全文
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5652 Mean: 输入描述 输出描述 Sample Input 1 4 6 011010 000010 100001 001000 7 0 3 1 5 1 3 0 0 1 2 2 4 2 1 Sampl
阅读全文
摘要:题目链接:http://poj.org/problem?id=3414 Pots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14306 Accepted: 6033 Special Judge Description You
阅读全文

浙公网安备 33010602011771号