- 博客(12)
- 收藏
- 关注
RSS订阅原创 HDU.1023 Train Problem II【大数除法、卡特兰数】--用于求出栈的n种方式（3.15）
Train Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7570 Accepted Submission(s): 4077Problem DescriptionAs we all
2016-03-15 19:42:20
642
原创 HDU.1027 Ignatius and the Princess II【全排列：关于next_permutation问题】（3.14）
Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6434 Accepted Submission(s): 3808Problem Description
2016-03-14 21:34:05
342
原创 HDU.1022 Train Problem I【栈的简单应用】（3.14）
Train Problem ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29144 Accepted Submission(s): 11062Problem DescriptionAs the n
2016-03-14 20:54:56
307
原创 HDU.1017A Mathematical Curiosity【遍历求解】
A Mathematical CuriosityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35082 Accepted Submission(s): 11193Problem Description
2016-03-13 15:22:16
437
原创 HDU.1016 Prime Ring Problem【DFS递归+素数打表法】（3.12）
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38929 Accepted Submission(s): 17184Problem DescriptionA rin
2016-03-13 15:11:50
295
原创 HDU.1019Least Common Multiple【深搜求最小公倍数】（3.13）
题目描述：Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of
2016-03-13 14:54:49
302
原创 HDU.1014Uniform Generator【求最大公约数】
Uniform GeneratorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23916 Accepted Submission(s): 9470Problem DescriptionCompute
2016-03-05 20:53:53
308
原创 HDU.1013Digital Roots【有简便方法】
Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 65322 Accepted Submission(s): 20366Problem DescriptionThe digita
2016-03-05 20:32:15
436
1
原创 HDU.1012 u Calculate e【较简单】(3.3)
u Calculate eTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39470 Accepted Submission(s): 17936Problem DescriptionA simple m
2016-03-03 17:09:58
318
原创 HDU 1010.Tempter of the Bone【dfs应用】(3.3)
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 98525 Accepted Submission(s): 26713Problem DescriptionThe
2016-03-03 16:37:18
298
原创 用DFS求连通块
#include #include #include using namespace std;const int maxn = 100 + 5;char pic[maxn][maxn];int m, n, idx[maxn][maxn];void dfs(int r, int c, int id){ if(r=m || c=m) r
2016-03-03 15:28:51
777
原创 HDU 1008.Elevator(3.3)
#include #include using namespace std;int main(){ int n; int i,j; int floor[100]; while(cin>>n && n) { floor[0] = 0; for(i=1; i {
2016-03-03 15:10:14
296
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人