Bin-Laden

HDU 1085 Holding Bin-Laden Captive! （母函数）

HoldingBin-LadenCaptive!TimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):13861    AcceptedSubmission(s):6230ProblemDescriptionWeallknowthatBin-Ladenisanoto
IAccepted·2014-04-24 23:00

[ACM] hdu 1085 Holding Bin-Laden Captive! （母函数变形）

HoldingBin-LadenCaptive!TimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):13505    AcceptedSubmission(s):6094ProblemDescription WeallknowthatBin-Ladenisanot
sr19930829·2014-03-26 20:00

HDU1085 Holding Bin-Laden Captive!

ProblemDescriptionWeallknowthatBin-Ladenisanotoriousterrorist,andhehasdisappearedforalongtime.Butrecently,itisreportedthathehidesinHangZhouofChina! “Oh,God!Howterrible!”Don’tbesoafraid,guys.Althoughhe
starcuan·2014-02-15 18:00

HDU1085 Holding Bin-Laden Captive!

HoldingBin-LadenCaptive!TimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):13132    AcceptedSubmission(s):5882ProblemDescriptionWeallknowthatBin-Ladenisanoto
guodongxiaren·2014-01-18 13:00

杭电ACM hdu 1085 Holding Bin-Laden Captive! 解题报告（母函数）

ProblemDescriptionWeallknowthatBin-Ladenisanotoriousterrorist,andhehasdisappearedforalongtime.Butrecently,itisreportedthathehidesinHangZhouofChina! “Oh,God!Howterrible!”Don’tbesoafraid,guys.Althoughhe
u012077163·2013-11-30 16:00

hdu 题目1085 Holding Bin-Laden Captive! （母函数及其应用）

HoldingBin-LadenCaptive!TimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):12346    AcceptedSubmission(s):5536ProblemDescriptionWeallknowthatBin-Ladenisanoto
u011282069·2013-08-27 14:00

hdu1085 Holding Bin-Laden Captive!

/.......................................................................................................................................................................................................
u010138811·2013-07-18 19:00

hdu 21085 Holding Bin-Laden Captive! （母函数的应用）

#include #include #defineN8010 intmain() { inti,j,k,n1,n2,n3,a[N],b[N],c[N]; while(scanf("%d%d%d",&n1,&n2,&n3)==3&&(n1||n2||n3)) { memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); memset(c,0,sizeof(c));k
u010679062·2013-06-07 14:00

hdu1085-Holding Bin-Laden Captive!

http://acm.hdu.edu.cn/showproblem.php?pid=1085#include #include #include usingnamespacestd; intnum[10]; intc1[100000],c2[100000]; intmain() { inti,j,k; while(cin>>num[1]>>num[2]>>num[5]) { if(num[1]
liujie619406439·2013-05-29 13:00

杭电acm1085.Holding Bin-Laden Captive!（母函数）

/******************************** 题目大意：不可以用num1个1，num2个2，num3个5组合得到的最小数； 题目解析：求（1+x+.....+x^num1）(1+x^2+....+x^(2*num2))(1+x^5+....X^(5*num3)) 的系数为零的指数；若系数都不为零，则最小数为sum+1; 错误分析：1.不能确定j的循环次数； 2.没有把M数值开
u010270403·2013-04-21 14:00

hdu 1085 Holding Bin-Laden Captive!

此题在前题1082上增加了些变化，硬币的个数有限。指数的范围变成不确定，最大可能为sum=a[0]+a[1]*2+a[2]*5。第3层循环控制硬币的个数。另外，j是第一个括号的指数，虽然第1趟时j usingnamespacestd; constintiNum=8005; intc1[iNum],c2[iNum]; intmain() { intn,i,j,k,sum; intelem[3]={1
jjike·2013-02-16 17:00

杭电OJ——1085 Holding Bin-Laden Captive!（母函数解答！）

HoldingBin-LadenCaptive!ProblemDescriptionWeallknowthatBin-Ladenisanotoriousterrorist,andhehasdisappearedforalongtime.Butrecently,itisreportedthathehidesinHangZhouofChina! “Oh,God!Howterrible!”Don’tbe
lishuhuakai·2012-12-07 08:00

Hdu 1085 - Holding Bin-Laden Captive!

数学题 分类  把特殊情况列出来，所有的情况都能分出来。 AC代码：#include #include intmain() { inta,b,c,min; while(scanf("%d%d%d",&a,&b,&c)!=EOF) { if(a==0&&b==0&&c==0) break; if((a>=2&&b>=1)||(a>=1&&b>=2)||(a>=4)||(a>=4&&b==0)) {
Chuck_0430·2012-11-02 12:00

HDU 1085 Holding Bin-Laden Captive

这是用找规律的方法，和母函数比起来，果然很强大，ac才是王道。。。#includeintmain(){   int i,j,k,n1,n2,n5;   while(scanf("%d%d%d",&n1,&n2,&n5)!=EOF,n1+n2+n5)   {       if(n1==0)printf("1\n");       elseif(n1+n2*2<4)printf("%d\n",n1+n
Wss0130·2012-09-12 21:00

hdu1085Holding Bin-Laden Captive!-简单题

hdu1085HoldingBin-LadenCaptive!#include usingnamespacestd; intmain() { intn1,n2,n5; while(scanf("%d%d%d",&n1,&n2,&n5),n1+n2+n5) { if(n1==0)printf("1\n"); elseif(2*n2+n1<4)printf("%d\n",2*n2+n1+1); e
dellaserss·2012-09-04 21:00

hdu 1085 Holding Bin-Laden Captive! （母函数）

跟模版有点变化，这里的硬币是有个数的所以要变一下#include"stdio.h" intmain() { intc1[8005],c2[8005],num[3],coin[3]={1,2,5}; inti,j,k,sum; while(scanf("%d%d%d",&num[0],&num[1],&num[2])!=EOF) { if(!num[0]&&!num[1]&&!num[2])brea
yyf573462811·2012-07-28 09:00

HDU1085 Holding Bin-Laden Captive!，母函数

虽然有些变化，但是只要理解清楚母函数的定义，就很容易搞定了。/******************************************************************************* #Author:NeoFung #Email:[email protected] #Lastmodified:2012-06-2619:44 #Filename:HDU1085
neofung·2012-06-26 19:00

HDU 1085 Holding Bin-Laden Captive!（母函数）

题目链接：Click here~~ 母函数第三题。 题意是给你一定数目的1,2,5分的硬币，让你找出不能被这些硬币表示的最小价值。 与前两题相比，关键是确定max的大小。 #include <stdio.h> #include <string.h> const int MAX=8000; int main() { int z,max,c1[MAX+5],
lovnet·2012-03-23 14:00

HDU 1085 Holding Bin-Laden Captive!（母函数）

题目链接：Clickhere~~母函数第三题。题意是给你一定数目的1,2,5分的硬币，让你找出不能被这些硬币表示的最小价值。与前两题相比，关键是确定max的大小。#include #include constintMAX=8000; intmain() { intz,max,c1[MAX+5],c2[MAX+5],num[4],money[4]={0,1,2,5}; while(scanf("%d
dgq8211·2012-03-23 14:00

HDOJ/HDU 1085 母函数 Holding Bin-Laden Captive!

HoldingBin-LadenCaptive!TimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):6600    AcceptedSubmission(s):2894ProblemDescriptionWeallknowthatBin-Ladenisanotor
xieshimao·2011-08-07 16:00

母函数~Holding Bin-Laden Captive!

母函数~HoldingBin-LadenCaptive!HoldingBin-LadenCaptive!TimeLimit:2000/1000ms(Java/Other)   MemoryLimit:65536/32768K(Java/Other)TotalSubmission(s):132   AcceptedSubmission(s):69Font:TimesNewRoman|Verdana|
Yiner的ACM·2011-02-15 18:00

hdu 1085 Holding Bin-Laden Captive!

http://acm.hdu.edu.cn/showproblem.php?pid=1085//1304713 2009-04-24 16:34:31 Accepted 1085 156MS 324K 728 B C++ no way #includeusing namespace std;int main(){    int num[3];    int t[3]={1,2,5};    whi
Dreams·2009-04-24 16:00

1085Holding Bin-Laden Captive!(HDU)母函数模板，来自teddy

1085HoldingBin-LadenCaptive!(HDU)母函数模板，来自teddy 1 #include  2 using namespace std; 3 int c1[10001],c2[10001]; 4 int main() 5 { 6     int num1,num2,num5,i,j,k,u,o; 7     while (cin>>num1>>num2>>num5 && 
混沌的云@HDU~·2009-01-28 22:00
上一页 1 2 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他