Captive

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

word list 6

cane手杖canvas帆布cape斗篷capsule胶囊warehouse仓库garage修车厂caption字幕captive被俘虏的cardinal红衣主教，最重要的carve切碎carveout
xiazdong·2010-09-04 21:00

FreeBSD7.0+opengate+ipfw(网页网关认证)Captive Portal(3)

#AllowIPfragmentstopassthrough$fwcmdaddpassallfromanytoanyfrag#AllowRIPng###ForwardingIPv4httpconnectionfromunauthclient$fwcmdadd60000fwdlocalhosttcpfrom${inet}:${imask}toany80$fwcmdadd60000fwdlocalho
fanwenbo·2010-08-05 11:00

FreeBSD7.0+opengate+ipfw(网页网关认证)Captive Portal(2)

安装apache22#cd/usr/ports/www/apache22#makeinstallclean;rehash做一个SSL的privatekey,因为后面要用的SSL来验证..#cd/usr/local/etc/apache22#mkdirssl.keyssl.crt#chmod700ssl.keyssl.crt#/usr/bin/opensslgenrsa-out/usr/local/
fanwenbo·2010-08-05 11:00

FreeBSD7.0+opengate+ipfw(网页网关认证)Captive Portal(1)

FreeBSD7.0+opengate+ipfwCaptivePortal(网页认证)介绍.................................................................................................................................................2安装FREEBSD
fanwenbo·2010-08-05 11:00

FreeBSD7.0+opengate+ipfw(网页网关认证)Captive Portal(1)

FreeBSD7.0+opengate+ipfwCaptivePortal(网页认证)介绍.................................................................................................................................................2安装FREEBSD
fanwenbo·2010-08-05 11: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 3 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他