acm
文章平均质量分 81
Cambridge_blue9
这个作者很懒,什么都没留下…
展开
-
HDU 1005.Number Sequence【用递归会超时】(2.5)
又到周五,假期完全没有星期几的概念。。。Number SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 141837 Accepted Submission(s): 34462Proble原创 2016-02-05 20:09:58 · 392 阅读 · 0 评论 -
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 · 440 阅读 · 0 评论 -
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 · 300 阅读 · 0 评论 -
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 · 311 阅读 · 0 评论 -
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 · 346 阅读 · 0 评论 -
成绩排序问题
排序 结构体 strcmp() 重载运算符 字符串与字符数组原创 2016-04-07 20:32:55 · 450 阅读 · 0 评论 -
HDU1512 Monkey King【并查集+左偏树】
Monkey KingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2543 Accepted Submission(s): 1064Problem DescriptionOnce in a for转载 2016-05-30 20:00:40 · 713 阅读 · 0 评论 -
HDU2602_01背包问题
01背包(ZeroOnePack): 有N件物品和一个容量为V的背包。(每种物品均只有一件,可以选择放或不放)第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使价值总和最大。用子问题定义状态:即f[i][v]表示前i件物品恰放入一个容量为v的背包可以获得的最大价值。则其状态转移方程便是:f[i][v]=max{f[i-1][v],f[i-1][v-c[i]原创 2016-04-24 20:35:20 · 343 阅读 · 0 评论 -
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 · 299 阅读 · 0 评论 -
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 · 306 阅读 · 0 评论 -
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 · 313 阅读 · 0 评论 -
acm及蓝桥杯中的【暴力求解法】(1)(2.14)
一、简单枚举【例题1】:输入一个整数n,按从小到大的顺序输出所有形如abcde/fghij=n的表达式,其中a~j恰好为数字0~9的一个排列(可以有前导0),2代码如下:#include #include bool vis[10];//【visit数组】用下标判断数字是否已经被访问过;char str[15];//vis里的数字是按照0123456789的顺序,str是原创 2016-02-14 17:18:09 · 2618 阅读 · 0 评论 -
acm及蓝桥杯中的【暴力求解法】(2)(2.16)
【例题三】:给你一个数k,求所有使得1/k = 1/x + 1/y成立的x≥y的整数对。题目分析:数论,枚举。首先通过x>=y这个条件化简已知条件,可以得出k+1枚举所有在区间(k+1,2k)上的y即可。当1/k - 1/y(通分)的结果分子为1即为一组解。代码如下:#include #include #include #include #include #incl原创 2016-02-16 22:27:38 · 518 阅读 · 0 评论 -
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 · 299 阅读 · 0 评论 -
用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 · 781 阅读 · 0 评论 -
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 · 646 阅读 · 0 评论 -
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 · 321 阅读 · 0 评论 -
HDU.1003【max-sum】---16.2.3
第一次开通博客,想以这样一个平台来记录我接下来的ACM的奋斗之路。 虽然是女生,但是我相信男生可以的我相信我就可以。 在不知道对手的情况下,只要奋发努力尽力做到最好就可以了。不说废话了,切入主题:Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Oth原创 2016-02-03 22:33:17 · 338 阅读 · 0 评论 -
HDU 1004.Let the Balloon Rise【找出出现次数最多的字符串】
Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 98469 Accepted Submission(s): 37708Problem DescriptionCon原创 2016-02-04 17:09:18 · 568 阅读 · 0 评论 -
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 · 440 阅读 · 1 评论 -
HDU_1114【完全背包】
完全背包(CompletePack):有N种物品和一个容量为V的背包,每种物品都有无限件可用。第i种物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (原创 2016-04-24 20:57:19 · 381 阅读 · 0 评论