Ignatius

HDOJ 1098 Ignatius's puzzle

ProblemDescriptionIgnatiusispooratmath,hefallsacrossapuzzleproblem,sohehasnochoicebuttoappealtoEddy.thisproblemdescribesthat:f(x)=5*x^13+13*x^5+k*a*x,inputanonegativeintegerk(k<10000),tofindtheminimal
qq_26525215·2016-03-22 11:00

hdu1029 Ignatius and the Princess IV

IgnatiusandthePrincessIVTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32767K(Java/Others)TotalSubmission(s):24905    AcceptedSubmission(s):10480ProblemDescription"OK,youarenottoobad,em...But
su20145104009·2016-03-20 17:00

HDOJ 1027 Ignatius and the Princess II （DFS全排列）

IgnatiusandthePrincessIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):6449    AcceptedSubmission(s):3815ProblemDescriptionNowourherofindsthedoortotheBEe
helloiamclh·2016-03-16 08:00

hdu 1028 Ignatius and the Princess III（动态规划）

IgnatiusandthePrincessIIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):17069    AcceptedSubmission(s):12000ProblemDescription"Well,itseemsthefirstproble
zjw6463·2016-03-15 15:00

统计难题

Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每
lwd2621·2016-03-14 21:00

HDU 1253 胜利大逃亡（空间BFS）

ProblemDescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,
tomorrowtodie·2016-03-12 21:00

Hdu 1029 Ignatius and the Princess IV 动态规划

题意：奇数n个数，存在一个数出现的次数大于(n+1)/2次，求这个数；这个数出现的次数比其他数出现的次数加起来还多，那么当这个数出现时+1，其他的数出现时-1，最后得到的数为正数。假定一个数为特殊数，若当前数与特殊数相同则cnt++，若不相同则cnt--，如果这时cnt #include #include #include usingnamespacestd; intmain() { intn
zchahaha·2016-03-11 21:00

HDOJ 1029 Ignatius and the Princess IV（数位dp）

IgnatiusandthePrincessIVTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32767K(Java/Others)TotalSubmission(s):24545    AcceptedSubmission(s):10342ProblemDescription"OK,youarenottoobad,em...But
huatian5·2016-03-10 22:00

HDU杭电 1027 Ignatius and the Princess II

http://acm.hdu.edu.cn/showproblem.php?pid=1027IgnatiusandthePrincessIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):6406    AcceptedSubmission(s):3791Pr
yuzhiwei1995·2016-03-08 20:00

hdu1251 统计难题 字典树插入，查询模板和空间释放

Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表
winycg·2016-03-08 18:00

HDU-1253-胜利大逃亡

2000MSMemoryLimit:32768KB64bitIOFormat:%I64d&%I64uSubmitStatusPracticeHDU1253DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius
qq_32680617·2016-03-07 21:00

hdu 1028 Ignatius and the Princess III

ProblemDescription"Well,itseemsthefirstproblemistooeasy.Iwillletyouknowhowfoolishyouarelater."feng5166says."Thesecondproblemis,givenanpositiveintegerN,wedefineanequationlikethis:N=a[1]+a[2]+a[3]+...+a
zyq_19960204·2016-03-07 16:00

Ignatius and the Princess II（全排列）

IgnatiusandthePrincessIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):6359    AcceptedSubmission(s):3760ProblemDescriptionNowourherofindsthedoortotheBEe
handsomecui·2016-03-05 12:00

HDU1027 Ignatius and the Princess II

IgnatiusandthePrincessIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):6304    AcceptedSubmission(s):3729ProblemDescriptionNowourherofindsthedoortotheBEe
d_x_d·2016-03-04 20:00

HDU 1028 Ignatius and the Princess III|母函数

母函数裸题..套模板就OK#include #include #include #include #include #include #include #include #include #include usingnamespacestd; intc1[122],c2[122]; intmain() { intn; while(cin>>n) { for(inti=0;i<=n;i++) c1[
ws_yzy·2016-02-28 15:00

HDU 1026 Ignatius and the Princess I(BFS+优先队列)

ProblemDescriptionThePrincesshasbeenabductedbytheBEelzebubfeng5166,ourheroIgnatiushastorescueourprettyPrincess.Nowhegetsintofeng5166'scastle.Thecastleisalargelabyrinth.Tomaketheproblemsimply,weassumet
tomorrowtodie·2016-02-27 05:00

hdu1028——Ignatius and the Princess III

IgnatiusandthePrincessIIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):16849    AcceptedSubmission(s):11857ProblemDescription"Well,itseemsthefirstproble
qq_33110317·2016-02-21 20:00

hdu 1029 Ignatius and the Princess IV

题意：n个数字中找出出现次数至少为(n+1)/2的数。方法一：#include #include intA[1000000]; intmain() { intn,m,i,ok; while(scanf("%d",&n)!=EOF) { memset(A,0,sizeof(A)); for(i=0;i #include usingnamespacestd; intmain() { intn,
u014552756·2016-02-15 22:00

HDU 1028 Ignatius and the Princess III(母函数)

题目：HDU-1028 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1028题目：IgnatiusandthePrincessIIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):16806    Accept
qq_33171970·2016-02-14 18:00

HDU 1251 统计难题 （字符串-Trie树）

Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行
mengfanrong·2016-02-10 14:00

HDOJ 1027Ignatius and the Princess II(全排列)

ProblemDescriptionNowourherofindsthedoortotheBEelzebubfeng5166.Heopensthedoorandfindsfeng5166isabouttokillourprettyPrincess.ButnowtheBEelzebubhastobeatourherofirst.feng5166says,"Ihavethreequestionfory
u013555159·2016-02-09 22:00

HDU 1029 Ignatius and the Princess IV

题目：点击打开链接代码：#include #include #include #include usingnamespacestd; inta[1000000]; intb[1000000]; intmain() { intn; while(~scanf("%d",&n)) { memset(b,0,sizeof(b)); for(inti=0;i=(n+1)/2) {printf("%d\n"
qq_32473657·2016-02-05 23:00

HDU——1027Ignatius and the Princess II（next_permutation函数）

IgnatiusandthePrincessIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):6191    AcceptedSubmission(s):3664ProblemDescriptionNowourherofindsthedoortotheBEe
a88770202·2016-02-03 14:00

HDU-1026 Ignatius and the Princess I (BFS)

    题目：HDU-1026    题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1026    题目：IgnatiusandthePrincessITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):15647 
qq_33171970·2016-02-02 22:00

HDU 1029 Ignatius and the Princess IV

Description"OK,youarenottoobad,em...Butyoucanneverpassthenexttest."feng5166says."IwilltellyouanoddnumberN,andthenNintegers.Therewillbeaspecialintegeramongthem,youhavetotellmewhichintegeristhespecial
qq_33638791·2016-02-01 23:00

HDU 1253 胜利大逃亡(BFS)

题目链接ProblemDescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C
ACMSaga·2016-01-28 22:00

K - Ignatius and the Princess IV

Description       "OK,youarenottoobad,em...Butyoucanneverpassthenexttest."feng5166says.        "IwilltellyouanoddnumberN,andthenNintegers.Therewillbeaspecialintegeramongthem,youhavetotellmewhichintege
阿飞的小蝴蝶蝶·2016-01-28 18:00

hdoj-1028 Ignatius and the Princess III【母函数】

IgnatiusandthePrincessIIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):16744    AcceptedSubmission(s):11785ProblemDescription"Well,itseemsthefirstproble
liu6886·2016-01-28 18:00

ACM之Ignatius and the Princess IV解题报告

IgnatiusandthePrincessIVTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32767K(Java/Others)TotalSubmission(s):6624AcceptedSubmission(s):2369ProblemDescription“OK,youarenottoobad,em…Butyoucanneverp
Ethan-Walker·2016-01-28 15:40

HUD 1029Ignatius and the Princess IV

原题链接：[kuangbin带你飞]专题十二基础DP1B-IgnatiusandthePrincessIV题意：第一行输入n，表示有n个元素n小于一百万第二行输入n个元素输出n个元素中出现次数大于二分之n的元素思路打表#include"stdafx.h"#include#include#include#includeusingnamespacestd;intn,t,ans;inta[1000000
Tony L.Du·2016-01-28 11:09

HUD 1029Ignatius and the Princess IV

原题链接：[kuangbin带你飞]专题十二基础DP1B-IgnatiusandthePrincessIV题意：第一行输入n，表示有n个元素n小于一百万第二行输入n个元素输出n个元素中出现次数大于二分之n的元素思路打表#include"stdafx.h" #include #include #include #include usingnamespacestd; intn,t,ans; inta
Dextrad_ihacker·2016-01-28 11:00

HDOJ 1028 Ignatius and the Princess III(母函数—整数拆分模板题)

IgnatiusandthePrincessIIITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):16743    AcceptedSubmission(s):11784ProblemDescription"Well,itseemsthefirstprob
zwj1452267376·2016-01-28 02:00

胜利大逃亡--hdu --1253(bfs)

ProblemDescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,
大姑娘龟先生·2016-01-27 16:00

HDU 1029 Ignatius and the Princess IV

找出现次数最多的数因为n是个奇数，所求的数个数至少出现(n+1)/2次，每次去掉两个不一样的最后剩下的那个数一定是正确答案。。。其实还可以用其他解法，因为除了所求的数字，其他的数字出现次数小于(n+1)/2，因此输出唯一的次数大于(n+1)/2的数就ac了（很简单吧=.=） 1#include 2#include 3#include 4usingnamespacestd; 5 6intm
闪耀子·2016-01-27 13:00

D - 胜利大逃亡

MemoryLimit:32768KB     64bitIOFormat:%I64d&%I64uSubmit StatusDescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius
AcmLzq·2016-01-25 10:00

HDU 1026 Ignatius and the Princess I(BFS+记录路径)

IgnatiusandthePrincessITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):15576    AcceptedSubmission(s):4937SpecialJudgeProblemDescriptionThePrincesshasbeen
xky1306102chenhong·2016-01-24 15:00

hdu 1029 Ignatius and the Princess IV

ProblemDescription"OK,youarenottoobad,em...Butyoucanneverpassthenexttest."feng5166says."IwilltellyouanoddnumberN,andthenNintegers.Therewillbeaspecialintegeramongthem,youhavetotellmewhichintegeristhesp
LeeHolmes·2016-01-24 15:00

HDU 1029 Ignatius and the Princess IV(水题亦有妙法)

题目链接：[kuangbin带你飞]专题十二基础DP1B-IgnatiusandthePrincessIV题意给n(奇数)个数，定义特殊的数为在序列中出现次数不少于(n+1)/2次的数，找出这个特殊的数思路我ac的思路是直接排序，然后一次循环进行对出现次数最大值的判断。还有一种方法是排序后找第n/2大的数，因为特殊数出现次数超过一半，所以排序后中位数一定是特殊数。看了大牛博客才发现还有更妙的一种方
to_be_better·2016-01-21 21:00

D - 胜利大逃亡 hdu1253

DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会. 
maqinyao5566·2016-01-21 17:00

杭电 hdu 1026 Ignatius and the Princess I（BFS+优先队列+墨迹人的输出）

IgnatiusandthePrincessITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):15516    AcceptedSubmission(s):4911SpecialJudgeProblemDescriptionThePrincesshasbeen
mengxiang000000·2016-01-19 12:00

HDU【1026】Ignatius and the Princess I

IgnatiusandthePrincessITimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):15492    AcceptedSubmission(s):4904SpecialJudgeProblemDescriptionThePrincesshasbeen
chen_ze_hua·2016-01-18 19:00

HDU 1029 Ignatius and the Princess IV

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1029题意：给出n个数，找出出现次数(n+1)/2以上的数思路：说是dp的题，不过感觉和dp没什么关系，数据比较水似乎直接暴力或者用map容器都可以通过，因为要找的数必定占该序列一半以上，所以将2个不一样的数消掉，最后剩下的数必定是要找的数#include #include #include #incl
csdn364988181·2016-01-15 16:00

HDU 1253:胜利大逃亡【BFS】

TotalSubmission(s):30474    AcceptedSubmission(s):11407ProblemDescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius
lin14543·2016-01-09 22:00

HDOJ 1029 Ignatius and the Princess IV (水题)

IgnatiusandthePrincessIVTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32767K(Java/Others)TotalSubmission(s):23299    AcceptedSubmission(s):9760ProblemDescription"OK,youarenottoobad,em...Buty
helloiamclh·2016-01-08 10:00

HDU 1027.Ignatius and the Princess II【全排列】【数学】【1月3】

IgnatiusandthePrincessIIProblemDescriptionNowourherofindsthedoortotheBEelzebubfeng5166.Heopensthedoorandfindsfeng5166isabouttokillourprettyPrincess.ButnowtheBEelzebubhastobeatourherofirst.feng5166says
a995549572·2016-01-03 20:00

HDU 1089.Ignatius's puzzle【数学题】【2016年1月2】

Ignatius'spuzzleProblemDescriptionIgnatiusispooratmath,hefallsacrossapuzzleproblem,sohehasnochoicebuttoappealtoEddy.thisproblemdescribesthat
a995549572·2016-01-02 00:00

HDOJ 1028 Ignatius and the Princess III(整数划分)

IgnatiusandthePrincessIIITimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):16512AcceptedSubmission(s):11636ProblemDescription"Well,itseemsthefirstproblemistooea
Lost_in_wine·2015-12-22 15:49

HDU 1026 Ignatius and the Princess I(优先队列bfs)

题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1026;题意:给你一个地图，上面有障碍和怪兽，障碍不可以走，怪兽有hp值，每点hp有消耗一秒时间去攻击，起点在(0,0)，终点在(n-1,m-1)，还要把路径输出.#include #include #include #include #include #include #include #inclu
dml_96·2015-12-18 13:00

hdu-1251-统计难题(字典树)

只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius
qq_21120027·2015-12-18 09:00

hdu-1029 Ignatius and the Princess IV

#include inta[1000010]={0}; intmain() { intn,m,i,k; while(~scanf("%d",&n)) { for(i=1;i=(n+1)/2) k=m; } printf("%d\n",k); } return0; }//方法比我的好，我的提交的时候超时了，看到这个方法时眼前一亮，还是自己知道的少啊
wojiaohuangyu·2015-12-17 13:00
上一页 2 3 4 5 6 7 8 9 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他