- 博客(9)
- 收藏
- 关注
原创 dfs代码
DFS#include#include#include#include#include#includeusing namespace std;struct oo{ char head,tail;}goubi[1000005];int vis[1000005],var,flag,j;char s[1000005];int dfs(char ch){ if
2015-04-26 11:47:15 627
原创 cf. Tavas and Nafas
题目链接:http://codeforces.com/problemset/problem/535/A英语渣渣表示知道怎么做,英文错wa了两次= =题目:A. Tavas and Nafastime limit per test1 secondmemory limit per test256 megabytesinpu
2015-04-22 09:33:59 462
原创 cf.Exam
题目链接:http://codeforces.com/problemset/problem/534/A题目:A. Examtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputs
2015-04-22 08:53:25 424
原创 cf. Polycarpus' Dice
题目链接;http://codeforces.com/problemset/problem/534/C这题主要是A,s会越界,导致一直在wa,目测wa了5次,终于AC!题目:C. Polycarpus' Dicetime limit per test1 secondmemory limit per test256 megabytes
2015-04-22 08:07:13 514
原创 cf. Covered Path
B. Covered Pathtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe on-board computer on Polycarp's car measured that
2015-04-21 13:12:01 842
原创 cf. Tavas and SaDDas
tle了,看来i++明显不行,但又不知道怎么办,日后想办法改进题目:B. Tavas and SaDDastime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output
2015-04-20 12:57:54 862
原创 hdu 1728 逃离迷宫
逃离迷宫Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17866 Accepted Submission(s): 4318Problem Description 给定一个m × n (m行, n列)
2015-04-14 21:12:01 450
原创 hdu 1372 Knight Moves
hdu 1372 Knight MovesTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64dDescriptionA friend of you is doing research on the Traveling Knight Problem (TKP)
2015-04-13 20:57:37 461
原创 HDU - 1195 Open the Lock
HDU - 1195Open the LockTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionNow an emergent task for you is to ope
2015-04-13 20:46:48 444
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人