08 2011 档案

ACM HDU 2516 取石子游戏（博弈）
摘要：取石子游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 812Accepted Submission(s): 435Problem Description1堆石子有n个,两人轮流取.先取者第1次可以取任意多个，但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".Input输入有多组.每组第1行是2<=n&l 阅读全文

posted @ 2011-08-30 12:52 kuangbin 阅读(1668) 评论(0) 推荐(0)

ACM HDU 2897 邂逅明下（博弈）
摘要：邂逅明下Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 678Accepted Submission(s): 323Problem Description当日遇到月，于是有了明。当我遇到了你，便成了侣。那天，日月相会，我见到了你。而且，大地失去了光辉，你我是否成侣？这注定是个凄美的故事。（以上是废话）小t和所有世俗的人们一样，期待那百年难遇的日食。驻足街头看天，看日月渐渐走近，小t的脖子那个酸呀（他坚持这个姿势已经有半个多小时啦）。他低下仰起的 阅读全文

posted @ 2011-08-30 12:05 kuangbin 阅读(889) 评论(0) 推荐(0)

ACM HDU 1851 A Simple Game（博弈）
摘要：A Simple GameTime Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/65535K (Java/Other)Total Submission(s) : 2Accepted Submission(s) : 2Problem DescriptionAgrael likes play a simple game with his friend Animal during the classes. In this Game there are n piles of stones numbered from 1 to n, the 阅读全文

posted @ 2011-08-29 22:50 kuangbin 阅读(1446) 评论(0) 推荐(0)

ACM HDU 2188 悼念512汶川大地震遇难同胞——选拔志愿者（巴什博弈）
摘要：悼念512汶川大地震遇难同胞——选拔志愿者Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1858Accepted Submission(s): 1050Problem Description对于四川同胞遭受的灾难，全国人民纷纷伸出援助之手，几乎每个省市都派出了大量的救援人员，这其中包括抢险救灾的武警部队，治疗和防疫的医护人员，以及进行心理疏导的心理学专家。根据要求，我校也有一个奔赴灾区救灾的名额，由于广大师生报名踊跃，学校不得不进行选拔来决定 阅读全文

posted @ 2011-08-29 19:50 kuangbin 阅读(568) 评论(0) 推荐(0)

ACM HDU 1849 Rabbit and Grass（博弈）
摘要：Rabbit and GrassTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 559Accepted Submission(s): 432Problem Description大学时光是浪漫的，女生是浪漫的，圣诞更是浪漫的，但是Rabbit和Grass这两个大学女生在今年的圣诞节却表现得一点都不浪漫：不去逛商场，不去逛公园，不去和AC男约会，两个人竟然猫在寝食下棋……说是下棋，其实只是一个简单的小游戏而已，游戏的规则是这样的：1、棋盘包含1* 阅读全文

posted @ 2011-08-29 19:40 kuangbin 阅读(1230) 评论(0) 推荐(0)

ACM POJ 2505 A multiplication game（博弈）
摘要：A multiplication gameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4108Accepted: 1981DescriptionStan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan always starts with p = 1, does his multiplication, then Ollie multiplies the number 阅读全文

posted @ 2011-08-29 19:18 kuangbin 阅读(765) 评论(0) 推荐(0)

ACM HDU 1517 A Multiplication Game（博弈）
摘要：A Multiplication GameTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1275Accepted Submission(s): 773Problem DescriptionStan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan always starts with 阅读全文

posted @ 2011-08-29 19:17 kuangbin 阅读(1648) 评论(2) 推荐(2)

ACM HDU 2509 Be the Winner（博弈）
摘要：Be the WinnerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 504Accepted Submission(s): 247Problem DescriptionLet's consider m apples divided into n groups. Each group contains no more than 100 apples, arranged in a line. You can take any numbe 阅读全文

posted @ 2011-08-29 16:29 kuangbin 阅读(781) 评论(0) 推荐(0)

ACM HDU 1907 John（博弈）
摘要：JohnTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 831Accepted Submission(s): 437Problem DescriptionLittle John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At first John has t 阅读全文

posted @ 2011-08-29 16:15 kuangbin 阅读(746) 评论(1) 推荐(0)

ACM HDU 1404 Digital Deletions（博弈）
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1404本文作者：kuangbin转载请注明出处。 www.cnblogs.com/kuangbin题目：Digital DeletionsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 785Accepted Submission(s): 287Problem DescriptionDigital deletions is a two-player 阅读全文

posted @ 2011-08-28 22:10 kuangbin 阅读(3003) 评论(0) 推荐(1)

【转】ACM博弈知识汇总
摘要：博弈知识汇总有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。 显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的法则：如果n=（m+1）r+s，（r为任意自然数，s≤m),那么先取者要拿. 阅读全文

posted @ 2011-08-28 22:00 kuangbin 阅读(23183) 评论(21) 推荐(17)

[转]ACM 取石子问题
摘要：取石子问题有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。 显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的 法则：如果n=（m+1）r+s，（r为任意自然数，s≤m),那么先取者要拿走 阅读全文

posted @ 2011-08-27 22:40 kuangbin 阅读(3200) 评论(0) 推荐(1)

ACM HDU Tiles of Tetris, NOT!（简单题）
摘要：Tiles of Tetris, NOT!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 569Accepted Submission(s): 229Problem DescriptionYou’ve really messed up this time. “Go buy some square tiles” your supervisor told you. But as usual, you were either busy reading 阅读全文

posted @ 2011-08-27 19:04 kuangbin 阅读(749) 评论(2) 推荐(1)

ACM HDU 3354 Probability One（简单题）
摘要：Probability OneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 301Accepted Submission(s): 224Problem DescriptionNumber guessing is a popular game between elementary-school kids. Teachers encourage pupils to play the game as it enhances their arithm 阅读全文

posted @ 2011-08-27 17:29 kuangbin 阅读(766) 评论(0) 推荐(0)

ACM HDU 3353 Not So Flat After All（简单题）
摘要：Not So Flat After AllTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 517Accepted Submission(s): 209Problem DescriptionAny positive integer v can be written as p1 a1 * p2 a2 * . . . pnan where pi is a prime number and ai >= 0. For example: 24 = 2 阅读全文

posted @ 2011-08-27 17:28 kuangbin 阅读(531) 评论(0) 推荐(0)

ACM POJ 1459 Power Network（最大流算法）
摘要：Power NetworkTime Limit: 2000MSMemory Limit: 32768KTotal Submissions: 15399Accepted: 8201DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 阅读全文

posted @ 2011-08-26 21:17 kuangbin 阅读(1395) 评论(0) 推荐(0)

ACM POJ 2723 Get Luffy Out（2-SAT入门）
摘要：题目链接：http://poj.org/problem?id=2723【题目大意】有2n把钥匙，分成2组，给你每组的钥匙信息，并且每组的钥匙只能用一个。有m个门，每个门有2个锁，只要打开一个锁这个门就开了。（顺序遇见m个门）问你最多能够打开多少个门。【解题思路】因为只能门只能按照顺序打开，所以很自然二分是个很好的选择。建图的依据：１、每对钥匙a,b有(a->!b),(b->!a) 也就是 a and b = 0　a被用b不被用，或b被用a不被用，或a,b都不被用２、每善门对应锁的钥匙a,b有(!a->b),(!b->a) 也就是 a or b = 1，用a能打开用b不能 阅读全文

posted @ 2011-08-24 15:08 kuangbin 阅读(744) 评论(0) 推荐(0)

POJ 3207 Ikki's Story IV - Panda's Trick（2-SAT入门）
摘要：讲解见：http://hi.baidu.com/chinaeli/blog/item/dd00463cdb40eecf9f3d62c7.htmlhttp://blog.163.com/lfw2565295@126/blog/static/12200516201102012251212/代码：#include<stdio.h>#include<math.h>#include<iostream>using namespace std;const int MAXN=1005;const int MAXM=1000005;struct Node{ int l,r;} 阅读全文

posted @ 2011-08-23 02:04 kuangbin 阅读(342) 评论(0) 推荐(0)

ACM HDU 3715 Go Deeper
摘要：Go DeeperTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 309Accepted Submission(s): 122Problem DescriptionHere is a procedure's pseudocode:go(int dep, int n, int m)beginoutput the value of dep.if dep < m and x[a[dep]] + x[b[dep]] != c[dep] t 阅读全文

posted @ 2011-08-22 23:56 kuangbin 阅读(749) 评论(0) 推荐(0)

ACM HDU 3622 Bomb Game(2-SAT）
摘要：Bomb GameTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1543Accepted Submission(s): 492Problem DescriptionRobbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N rounds in the game. At each 阅读全文

posted @ 2011-08-22 21:22 kuangbin 阅读(1003) 评论(0) 推荐(0)

ACM POJ 3648 Wedding（2-SAT入门）
摘要：题目链接：http://poj.org/problem?id=3648本文作者：kuangbin（转载请注明出处，博客：www.cnblogs.com/kuangbin)【题目大意】很多对夫妇参加一对新人的婚礼。分别做在长桌子的两侧。新郎、新娘分别坐两侧，新娘只能看到她对面的人。新娘不想看到她对面有夫妇。而且有一些人是有通奸关系的（男的和男的有，女的和男的、女的和女的都可能有，而且新郎也可能和别人有通奸关系），新娘不想看到有通奸关系一对人。也就是有通奸关系的不能一起坐在新娘对面。输入是：_n对夫妇（包括新郎新娘在女的，编号为0-(n-1)，新郎、新娘那一对的编号为0）,_m对通奸关系。接下来_ 阅读全文

posted @ 2011-08-22 16:23 kuangbin 阅读(2259) 评论(0) 推荐(0)

【转】2-SAT问题及其算法
摘要：原文地址：http://www.cppblog.com/MatoNo1/archive/2011/07/13/150766.aspx为了便于查看，只有转载下来了，免得找不到了【2-SAT问题】现有一个由N个布尔值组成的序列A，给出一些限制关系，比如A[x]AND A[y]=0、A[x]OR A[y]OR A[z]=1等，要确定A[0..N-1]的值，使得其满足所有限制关系。这个称为SAT问题，特别的，若每种限制关系中最多只对两个元素进行限制，则称为2-SAT问题。由于在2-SAT问题中，最多只对两个元素进行限制，所以可能的限制关系共有11种：A[x]NOT A[x]A[x] AND A[y]A 阅读全文

posted @ 2011-08-19 12:00 kuangbin 阅读(1333) 评论(0) 推荐(0)

ACM POJ 3321 Apple Tree（树状数组）
摘要：Apple TreeTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 11282Accepted: 3214DescriptionThere is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.The tree has N f 阅读全文

posted @ 2011-08-16 22:31 kuangbin 阅读(2480) 评论(3) 推荐(1)

ACM HDU 1255 覆盖的面积（矩形面积交，线段树+离散化）
摘要：覆盖的面积Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1415Accepted Submission(s): 677Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.Input输入数据的第一行是一个正整数T(1<=T<=100),代表测试数据的数量.每个测试数据的第一行是一个正整数N(1<=N<=1000),代表矩形的数量,然后是N行数据,每一行包含四个浮点数,代表 阅读全文

posted @ 2011-08-16 16:38 kuangbin 阅读(3630) 评论(0) 推荐(0)

ACM POJ1151 (HDU 1542) Atlantis（矩形面积并，线段树+离散化+扫描线）
摘要：AtlantisTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9693Accepted: 3791DescriptionThere are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, these maps describe different 阅读全文

posted @ 2011-08-16 13:57 kuangbin 阅读(4934) 评论(0) 推荐(1)

ACM POJ 2528 Mayor's posters（线段树+离散化）
摘要：题目链接：http://poj.org/problem?id=2528类型：线段树+离散化。本文作者：kuangbin.转载请注明writed by kuangbin (博客www.cnblogs.com/kuangbin)这到题目纠结了我一天，主要是离散化，刚接触线段树不是很熟练。现在对离散化也有... 阅读全文

posted @ 2011-08-15 22:43 kuangbin 阅读(6034) 评论(4) 推荐(3)

ACM HDU 1166 敌兵布阵（简单的线段树）
摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8754Accepted Submission(s): 3647Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都 阅读全文

posted @ 2011-08-15 20:48 kuangbin 阅读(2146) 评论(1) 推荐(1)

ACM POJ 3468 A Simple Problem with Integers（线段树） by kuangbin
摘要：题目链接：http://poj.org/problem?id=3468本文作者：kuangbin 博客地址：http://www.cnblogs.com/kuangbin/题目：A Simple Problem with IntegersTime Limit: 5000MSMemory Limit:... 阅读全文

posted @ 2011-08-14 20:36 kuangbin 阅读(6143) 评论(0) 推荐(0)

ACM POJ 3264 Balanced Lineup（线段树）
摘要：题目链接：http://poj.org/problem?id=3264作者：kuangbin（转载请注明出处，谢谢！！）更多详细文章，请访问博客：www.cnblogs.com/kuangbinACM POJ 3264 Balanced Lineup这到题目是线段树的练习题目。很简单，练练手！！AC程序：/*POJ 3264 Balanced Lineup题目意思：给定Q（1<=Q<=200000)个数A1,A2,```,AQ,多次求任一区间Ai-Aj中最大数和最小数的差 */#include<stdio.h>#include<algorithm>#incl 阅读全文

posted @ 2011-08-14 13:29 kuangbin 阅读(3262) 评论(0) 推荐(0)

ACM HDU 3910 Liang Guo Sha（数学题，读懂题目）
摘要：Liang Guo ShaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 214Accepted Submission(s): 162Problem DescriptionMaybe you know “San Guo Sha”, but I guess you didn’t hear the game: “Liang Guo Sha”!Let me introduce this game to you. Unlike “San Guo Sha 阅读全文

posted @ 2011-08-13 13:49 kuangbin 阅读(1447) 评论(0) 推荐(0)

ACM HDU 1177 "Accepted today?"（简单题）
摘要："Accepted today?"Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1476Accepted Submission(s): 649Problem DescriptionDo you remember a sentence "Accepted today?" Yes, the sentence is mentioned frequently in lcy's course " 阅读全文

posted @ 2011-08-12 17:03 kuangbin 阅读(935) 评论(0) 推荐(0)

ACM HDU 1174 爆头（数学题，求空间点到直线的距离，用叉积）
摘要：爆头Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 752Accepted Submission(s): 275Problem Descriptiongameboy是一个CS高手，他最喜欢的就是扮演警察，手持M4爆土匪的头。也许这里有人没玩过CS，有必要介绍一下“爆头”这个术语：所谓爆头，就是子弹直接命中对方的头部，以秒杀敌人。现在用一个三维的直角坐标系来描述游戏中的三维空间（水平面为xoy平面，z轴正方向是上方）。假设游戏中角色的头是一个标准 阅读全文

posted @ 2011-08-12 14:42 kuangbin 阅读(1585) 评论(1) 推荐(0)

2011-ACM/ICPC亚洲区中国大陆5个赛区信息汇集
摘要：大连赛区(大连理工大学) 网络赛(DLUT-OJ)：2011.09.03 12:00-17:00现场赛时间：2011.09.24-25竞赛主页：http://icpc.dlut.edu.cn上海赛区(复旦大学)网络赛(HDOJ)：2011.09.10 12:00-17:00现场赛时间：2011.10.15-16竞赛主页：http://www.cs.fudan.edu.cn/computer/acm/ 北京赛区(北京邮电大学)网络赛(BUPT-OJ)：2011.09.18 12:00-17:00现场赛时间：2011.10.22-23竞赛主页：http://acm.bupt.edu.cn成都赛区( 阅读全文

posted @ 2011-08-12 13:31 kuangbin 阅读(1380) 评论(0) 推荐(0)

ACM HDU 1173 采矿（很爽的水题）
摘要：采矿Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 694Accepted Submission(s): 385Special JudgeProblem Description某天gameboy玩魔兽RPG。有一个任务是在一个富含金矿的圆形小岛上建一个基地，以最快的速度采集完这个小岛上的所有金矿。这个小岛上有n(0<n<1000000)个金矿，每个金矿的矿藏量是相等的。而且这个小岛的地势非常平坦，所以基地可以建在小岛的任何位置，每 阅读全文

posted @ 2011-08-12 13:29 kuangbin 阅读(1190) 评论(1) 推荐(0)

ACM HDU 1172 猜数字 （枚举法）
摘要：猜数字Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 852Accepted Submission(s): 481Problem Description猜数字游戏是gameboy最喜欢的游戏之一。游戏的规则是这样的：计算机随机产生一个四位数，然后玩家猜这个四位数是什么。每猜一个数，计算机都会告诉玩家猜对几个数字，其中有几个数字在正确的位置上。比如计算机随机产生的数字为1122。如果玩家猜1234,因为1,2这两个数字同时存在于这两个数中，而 阅读全文

posted @ 2011-08-12 13:13 kuangbin 阅读(3258) 评论(0) 推荐(0)

二分图匹配（Hopcroft-Carp的算法）模版：
摘要：/**********************************************二分图匹配（Hopcroft-Carp的算法）。初始化：g[][]邻接矩阵调用：res=MaxMatch(); Nx,Ny要初始化！！！时间复杂大为 O(V^0.5 E)适用于数据较大的二分匹配 ***********************************************/ const int MAXN=3001;const int INF=1<<28;int g[MAXN][MAXN],Mx[MAXN],My[MAXN],Nx,Ny;int dx[MAXN],dy[MA 阅读全文

posted @ 2011-08-12 11:19 kuangbin 阅读(1936) 评论(0) 推荐(0)

ACM HDU 2389 Rain on your Parade（二分匹配 Hopcroft-Carp的算法）
摘要：Rain on your ParadeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 1310Accepted Submission(s): 373Problem DescriptionYou’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sun 阅读全文

posted @ 2011-08-12 11:18 kuangbin 阅读(815) 评论(0) 推荐(0)

ACM HDU 2819 Swap （二分图匹配，记录过程）
摘要：SwapTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 459Accepted Submission(s): 129Special JudgeProblem DescriptionGiven an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the 阅读全文

posted @ 2011-08-11 14:47 kuangbin 阅读(1196) 评论(0) 推荐(1)

ACM HDU 1281 棋盘游戏 (二分匹配，方格的建图，找关键点）
摘要：棋盘游戏Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 5Accepted Submission(s) : 4Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description小希和Gardon在玩一个游戏：对一个N*M的棋盘，在格子里放尽量多的一些国际象棋里面的“车”，并且使得他们不能互相攻击，这当然很简单，但是Gardon限制了只有某些格子才可以放，小希还是很轻 阅读全文

posted @ 2011-08-10 22:16 kuangbin 阅读(900) 评论(0) 推荐(0)

ACM HDU 1083 Courses（二分匹配，最大匹配）
摘要：题目大意：有p个课程和n个学生，每个学生可以自由选择课程（0到p个），现在要建立一个委员会，问是否能找到每个课程都有学生代表的集合，一个学生只能代表一个课程题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1083简单的二分匹配，用匈牙利算法就可以，主要是练习模板，固定方法解题！程序：#include<stdio.h>#include<iostream>using namespace std;#define MAXN 305int g[MAXN][MAXN];int uN,vN;int linker[MAXN];bool us 阅读全文

posted @ 2011-08-10 20:57 kuangbin 阅读(733) 评论(0) 推荐(0)

ACM HDU 2444 The Accomodation of Students（判断是否为二部图，然后求最大匹配）
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2444题意： 有n个学生，有m对人是认识的，每一对认识的人能分到一间房，问能否把n个学生分成两部分，每部分内的学生互不认识，而两部分之间的学生认识。如果可以分成两部分，就算出房间最多需要多少间，否则就输出No。分析：先是要判断是否为二部图，然后求最大匹配。这里的程序hungary()用vector实现/*HDU 2444 The Accomodation of Students*/#include<iostream>#include<string.h>#include< 阅读全文

posted @ 2011-08-10 16:51 kuangbin 阅读(724) 评论(0) 推荐(1)

HDU 1045 Fire Net（建模，用二分匹配）
摘要：Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2349Accepted Submission(s): 1342Problem DescriptionSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a st 阅读全文

posted @ 2011-08-09 21:34 kuangbin 阅读(3333) 评论(0) 推荐(0)

二分图匹配（匈牙利算法模板）
摘要：一、最大匹配——匈牙利算法/****************************************************二分图匹配（匈牙利算法的DFS实现）INIT：g[][]两边定点划分的情况CALL:res=hungary();输出最大匹配数优点：适于稠密图，DFS找增广路快，实现简洁易于理解时间复杂度:O(VE);****************************************************/const int MAXN=1000;int uN,vN; //u,v数目int g[MAXN][MAXN];//编号是0~n-1的 int linker[M 阅读全文

posted @ 2011-08-09 21:32 kuangbin 阅读(5398) 评论(5) 推荐(2)

POJ 1220 NUMBER BASE CONVERSION（高精度进制转换）
摘要：NUMBER BASE CONVERSIONTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 3231Accepted: 1394DescriptionWrite a program to convert numbers in one base to numbers in a second base. There are 62 different digits: { 0-9,A-Z,a-z } HINT: If you make a sequence of base conversions using the output of 阅读全文

posted @ 2011-08-09 16:28 kuangbin 阅读(746) 评论(0) 推荐(0)

高精度的进制转换！！！！
摘要：前面的内容来源于：http://www.cnblogs.com/phinecos/archive/2009/09/11/1564975.html引用原文：在数据结构课关于栈的这一章中，我们都学过用“模2取余法”来将一个10进制数转换为一个二进制数，进而可以推广到“模n取余法”，经其转换为n进制（n任意指定）。确实，这是一个很基础的题目，可你是否想过如果这个10进制数是一个大数（其位数可能上千位，此时用一般数据类型肯定是会溢出的），那么这个问题又如何来求解呢？当然，也许你会说很简单嘛，自己写一个大数类（当然至少要写一个大数除法才行），或者你用的是Java这种现代化语言，就更轻松了，直接用BigI 阅读全文

posted @ 2011-08-09 16:23 kuangbin 阅读(6712) 评论(0) 推荐(2)

ACM HDU 2063 过山车（简单的二分匹配）
摘要：过山车Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2978Accepted Submission(s): 1222Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，Grass只 阅读全文

posted @ 2011-08-08 16:55 kuangbin 阅读(731) 评论(0) 推荐(0)

ACM HDU 3466 Proud Merchants（某种顺序下的背包）
摘要：Proud MerchantsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 925Accepted Submission(s): 368Problem DescriptionRecently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result 阅读全文

posted @ 2011-08-08 16:16 kuangbin 阅读(443) 评论(1) 推荐(0)

ACM HDU 3460 Ancient Printer（简单题）
摘要：Ancient PrinterTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 704Accepted Submission(s): 309Problem DescriptionThe contest is beginning! While preparing the contest, iSea wanted to print the teams' names separately on a single paper.Unfortuna 阅读全文

posted @ 2011-08-08 12:51 kuangbin 阅读(917) 评论(0) 推荐(0)

POJ 3180 The Cow Prom （求强连通分量结点数>=2的个数）
摘要：The Cow PromTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 643Accepted: 384DescriptionThe N (2 <= N <= 10,000) cows are so excited: it's prom night! They are dressed in their finest gowns, complete with corsages and new shoes. They know that tonight they will each try to perform 阅读全文

posted @ 2011-08-07 22:53 kuangbin 阅读(867) 评论(0) 推荐(0)

POJ 1236 Network Of Schools (强连通分量缩点求出度为0的和入度为0的分量个数）
摘要：这个结合上题，类似的代码解决的：http://www.cnblogs.com/kuangbin/archive/2011/08/07/2130062.htmlNetwork of SchoolsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 5354Accepted: 2106DescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each sch 阅读全文

posted @ 2011-08-07 21:31 kuangbin 阅读(4023) 评论(0) 推荐(2)

POJ 2186 Popular Cows（强连通分量）
摘要：Popular CowsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 13835Accepted: 5484DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that t 阅读全文

posted @ 2011-08-07 15:56 kuangbin 阅读(2624) 评论(0) 推荐(0)

ACM POJ 2421 Constructing Roads（简单最小生成树）
摘要：Constructing RoadsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 14128Accepted: 5682DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only 阅读全文

posted @ 2011-08-06 19:45 kuangbin 阅读(546) 评论(0) 推荐(0)

ACM POJ 1258 Agri-Net （简单最小生成树）
摘要：Agri-NetTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 22951Accepted: 9047DescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer John ordered a high speed con 阅读全文

posted @ 2011-08-06 19:38 kuangbin 阅读(536) 评论(0) 推荐(0)

ACM HDU 1283 最简单的计算机（简单水题）
摘要：最简单的计算机Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1781Accepted Submission(s): 1054Problem Description一个名叫是PigHeadThree的研究组织设计了一台实验用的计算机，命名为PpMm。PpMm只能执行简单的六种命令A，B，C，D，E，F；只有二个内存M1，M2；三个寄存器R1，R2，R3。六种命令的含义如下：命令A：将内存M1的数据装到寄存器R1中；命令B：将内存M2的数据装到寄 阅读全文

posted @ 2011-08-06 14:42 kuangbin 阅读(1948) 评论(0) 推荐(0)

ACM HDU 1282 回文数猜想（简单水题）
摘要：回文数猜想Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1524Accepted Submission(s): 945Problem Description一个正整数，如果从左向右读（称之为正序数）和从右向左读（称之为倒序数）是一样的，这样的数就叫回文数。任取一个正整数，如果不是回文数，将该数与他的倒序数相加，若其和不是回文数，则重复上述步骤，一直到获得回文数为止。例如：68变成154（68+86），再变成605（154+451），最后变成1 阅读全文

posted @ 2011-08-06 14:32 kuangbin 阅读(3540) 评论(0) 推荐(0)

ACM HDU 1279 验证角谷猜想（简单水题）
摘要：验证角谷猜想Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2209Accepted Submission(s): 1137Problem Description数论中有许多猜想尚未解决，其中有一个被称为“角谷猜想”的问题，该问题在五、六十年代的美国多个著名高校中曾风行一时，这个问题是这样描述的：任何一个大于一的自然数，如果是奇数，则乘以三再加一；如果是偶数，则除以二；得出的结果继续按照前面的规则进行运算，最后必定得到一。现在请你编写一个程序验 阅读全文

posted @ 2011-08-06 14:18 kuangbin 阅读(2177) 评论(0) 推荐(0)

HDU 1266 Reverse Number （很简单的水题）
摘要：Reverse NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2047Accepted Submission(s): 926Problem DescriptionWelcome to 2006'4 computer college programming contest!Specially, I give my best regards to all freshmen! You are the future of HDU 阅读全文

posted @ 2011-08-06 14:08 kuangbin 阅读(820) 评论(0) 推荐(0)

ACM HDU 1248 寒冰王座（水题，用母函数完成的）
摘要：寒冰王座Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4537Accepted Submission(s): 2151Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前.死亡骑士:"我要买道具!"地精商人:"我们这里有三种道具,血瓶150块一个,魔法药200块一个,无敌药水3 阅读全文

posted @ 2011-08-06 13:40 kuangbin 阅读(799) 评论(0) 推荐(0)

ACM HDU 1142 A Walk Through the Forest（单源最短路，记忆DFS）
摘要：A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2121Accepted Submission(s): 756Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a 阅读全文

posted @ 2011-08-06 12:28 kuangbin 阅读(494) 评论(0) 推荐(0)

ACM HDU 1217 Arbitrage(Floyed算法）
摘要：ArbitrageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1186Accepted Submission(s): 547Problem DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same curr 阅读全文

posted @ 2011-08-06 02:25 kuangbin 阅读(2699) 评论(0) 推荐(3)

ACM HDU 1301 Jungle Roads （简单最小生成树问题）
摘要：Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1728Accepted Submission(s): 1254Problem DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages 阅读全文

posted @ 2011-08-06 01:01 kuangbin 阅读(585) 评论(0) 推荐(0)

ACM HDU 1162 Eddy's picture （简单最小生成树，开始练习使用模板了）
摘要：Eddy's pictureTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2454Accepted Submission(s): 1184Problem DescriptionEddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his smal 阅读全文

posted @ 2011-08-05 21:45 kuangbin 阅读(1096) 评论(0) 推荐(0)

ACM HDU 1260 Tickets
摘要：TicketsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 385Accepted Submission(s): 192Problem DescriptionJesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets 阅读全文

posted @ 2011-08-05 10:52 kuangbin 阅读(823) 评论(0) 推荐(0)

ACM HDU 1176 免费馅饼（DP）
摘要：免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9307Accepted Submission(s): 3011Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人，所以他只能在 阅读全文

posted @ 2011-08-05 01:11 kuangbin 阅读(628) 评论(0) 推荐(0)

ACM HUD 1203 I NEED A OFFER!（简单 背包）
摘要：I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6119Accepted Submission(s): 2129Problem DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。他将在m个学校中选择若干的（当然要在他的 阅读全文

posted @ 2011-08-05 01:10 kuangbin 阅读(576) 评论(0) 推荐(0)

ACM HDU 1257 最少拦截系统
摘要：最少拦截系统Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5453Accepted Submission(s): 2077Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套 阅读全文

posted @ 2011-08-05 00:05 kuangbin 阅读(1425) 评论(0) 推荐(0)

ACM HDU 1160FatMouse's Speed
摘要：FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3610Accepted Submission(s): 1522Special JudgeProblem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a c 阅读全文

posted @ 2011-08-04 21:34 kuangbin 阅读(2986) 评论(6) 推荐(0)

ACM HDU 1114 Piggy-Bank (完全背包问题）
摘要：Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2795Accepted Submission(s): 1379Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes f 阅读全文

posted @ 2011-08-04 20:04 kuangbin 阅读(4871) 评论(0) 推荐(2)

ACM HDU 1074 Doing Homework(位运算，搜索，状态压缩DP）
摘要：Doing HomeworkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1950Accepted Submission(s): 685Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of han 阅读全文

posted @ 2011-08-04 16:56 kuangbin 阅读(3536) 评论(1) 推荐(2)

HDU 1087 Super Jumping! Jumping! Jumping! （求最大上升子序列和，动态规划）
摘要：Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9053Accepted Submission(s): 3693Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good 阅读全文

posted @ 2011-08-04 15:19 kuangbin 阅读(521) 评论(0) 推荐(0)

ACM HDU 1069 Monkey and Banana (动态规划）
摘要：Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2599Accepted Submission(s): 1345Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, an 阅读全文

posted @ 2011-08-04 14:09 kuangbin 阅读(5319) 评论(0) 推荐(2)

HDU 1231 最大连续子序列（和HDU1003 Max Sum类似的）
摘要：最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7999Accepted Submission(s): 3335Problem Description给定K个整数的序列{ N1, N2, ..., NK }，其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj }，其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个， 例如给定序列{ -2, 11, -4, 13, 阅读全文

posted @ 2011-08-04 12:42 kuangbin 阅读(566) 评论(0) 推荐(0)

HDU 1024 Max Sum Plus Plus（动态规划，给定一个数组，求其分成m个不相交子段和最大值的问题）
摘要：Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6725Accepted Submission(s): 2251Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves t 阅读全文

posted @ 2011-08-04 11:10 kuangbin 阅读(14977) 评论(1) 推荐(7)

HDU 1003 Max Sum(连续子列的最大和，动态规划）
摘要：Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 55792Accepted Submission(s): 12580Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max 阅读全文

posted @ 2011-08-04 10:12 kuangbin 阅读(527) 评论(0) 推荐(0)

ACM POJ 1015 Jury Compromise（陪审团的人选，动态规划题，难）
摘要：Jury CompromiseTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 18378Accepted: 4516Special JudgeDescriptionIn Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general public. Every time a trial is set to begin, a jury has to be s 阅读全文

posted @ 2011-08-04 01:16 kuangbin 阅读(6601) 评论(3) 推荐(2)

ACM POJ 1458 Common Subsequence (最长公共子序列，动态规划）
摘要：Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 25178Accepted: 9726DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > 阅读全文

posted @ 2011-08-03 20:13 kuangbin 阅读(1448) 评论(0) 推荐(1)

ACM POJ 1661 Help Jimmy(动态规划）
摘要：Help JimmyTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 6593Accepted: 2066Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。 Jimmy老鼠在时刻0从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当Jimmy落到某个平台上时，游戏者选择让它向左还是向右跑，它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时，开始继续下落。Jimmy每次下落的高度不能超过MAX 阅读全文

posted @ 2011-08-03 19:50 kuangbin 阅读(681) 评论(0) 推荐(0)

Triple ACM HDU 3908 （数学题，找多少种组合）
摘要：TripleTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 387Accepted Submission(s): 153Problem DescriptionGiven many different integers, find out the number of triples (a, b, c) which satisfy a, b, c are co-primed each other or are not co-primed each 阅读全文

posted @ 2011-08-03 15:09 kuangbin 阅读(710) 评论(0) 推荐(0)

Swordsman ACM HDU 3902（判断n边形是不是轴对称图形，暴力求解了~~~~）
摘要：SwordsmanTime Limit: 10000/4000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 308Accepted Submission(s): 116Problem DescriptionMr. AC is a swordsman. His dream is to be the best swordsman in the world. To achieve his goal, he practices every day. There are many ways 阅读全文

posted @ 2011-08-03 14:47 kuangbin 阅读(1183) 评论(0) 推荐(0)

ACM POJ 2533Longest Ordered Subsequence(最长上升子序列，简单DP）
摘要：Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 19643Accepted: 8501DescriptionA numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 < 阅读全文

posted @ 2011-08-03 11:10 kuangbin 阅读(3145) 评论(0) 推荐(0)

ACM HDU 1236 排名(简单水题）
摘要：排名Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7425Accepted Submission(s): 2796Problem Description今天的上机考试虽然有实时的Ranklist，但上面的排名只是根据完成的题数排序，没有考虑 每题的分值，所以并不是最后的排名。给定录取分数线，请你写程序找出最后通过分数线的 考生，并将他们的成绩按降序打印。 Input测试输入包含若干场考试的信息。每场考试信息的第1行给出考生人数N ( 0 &l 阅读全文

posted @ 2011-08-02 19:08 kuangbin 阅读(2329) 评论(0) 推荐(0)

ACM HDU 1235 统计同成绩学生人数(超级简单水题）
摘要：统计同成绩学生人数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7066Accepted Submission(s): 4118Problem Description读入N名学生的成绩，将获得某一给定分数的学生人数输出。Input测试输入包含若干测试用例，每个测试用例的格式为第1行：N第2行：N名学生的成绩，相邻两数字用一个空格间隔。第3行：给定分数当读到N=0时输入结束。其中N不超过1000，成绩分数为（包含）0到100之间的一个整数。Ou 阅读全文

posted @ 2011-08-02 18:27 kuangbin 阅读(708) 评论(0) 推荐(1)

ACM HDU 1234 开门人和关门人(简单水题）
摘要：开门人和关门人Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5372Accepted Submission(s): 2773Problem Description每天第一个到机房的人要把门打开，最后一个离开的人要把门关好。现有一堆杂乱的机房签 到、签离记录，请根据记录找出当天开门和关门的人。 Input测试输入的第一行给出记录的总天数N ( > 0 )。下面列出了N天的记录。 每天的记录在第一行给出记录的条目数M ( > 0 )， 阅读全文

posted @ 2011-08-02 18:20 kuangbin 阅读(818) 评论(0) 推荐(0)

ACM HDU 1219 AC me（简单题，但是花了很长时间才AC）
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1219简单题。收获：gets()的使用。AC MeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5280Accepted Submission(s): 2388Problem DescriptionIgnatius is doing his homework now. The teacher gives him some articles and 阅读全文

posted @ 2011-08-02 17:04 kuangbin 阅读(1927) 评论(0) 推荐(0)

ACM HDU 1205 吃糖果（简单题，注意数据范围）
摘要：吃糖果Time Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 6890Accepted Submission(s): 1997Problem DescriptionHOHO，终于从Speakless手上赢走了所有的糖果，是Gardon吃糖果时有个特殊的癖好，就是不喜欢将一样的糖果放在一起吃，喜欢先吃一种，下一次吃另一种，这样；可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完？请你写个程序帮忙计算一下。Input第一行有一个整数T， 阅读全文

posted @ 2011-08-02 16:37 kuangbin 阅读(864) 评论(5) 推荐(1)

ACM HDU 1202 The calculation of GPA(简单题）
摘要：The calculation of GPATime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9186Accepted Submission(s): 2110Problem Description每学期的期末，大家都会忙于计算自己的平均成绩，这个成绩对于评奖学金是直接有关的。国外大学都是计算GPA(grade point average) 又称GPR(grade point ratio)，即成绩点数与学分的加权平均值来代表一个学生的成绩的。那么如 阅读全文

posted @ 2011-08-01 23:21 kuangbin 阅读(1095) 评论(0) 推荐(0)

ACM HDU 1201 18岁生日(简单水题）
摘要：18岁生日Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7131Accepted Submission(s): 2209Problem DescriptionGardon的18岁生日就要到了，他当然很开心，可是他突然想到一个问题，是不是每个人从出生开始，到达18岁生日时所经过的天数都是一样的呢？似乎并不全都是这样，所以他想请你帮忙计算一下他和他的几个朋友从出生到达18岁生日所经过的总天数，让他好来比较一下。Input一个数T，后面T行每行有一 阅读全文

posted @ 2011-08-01 22:57 kuangbin 阅读(1309) 评论(0) 推荐(1)

ACM HDU 1197 Specialized Four-Digit Numbers(简单进制转换）
摘要：Specialized Four-Digit NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1431Accepted Submission(s): 1017Problem DescriptionFind and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals 阅读全文

posted @ 2011-08-01 22:19 kuangbin 阅读(2382) 评论(0) 推荐(0)

ACM HDU 1196 Lowest Bit（简单水题）
摘要：Lowest BitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3399Accepted Submission(s): 2426Problem DescriptionGiven an positive integer A (1 <= A <= 100), output the lowest bit of A.For example, given A = 26, we can write A in binary form as 1 阅读全文

posted @ 2011-08-01 20:56 kuangbin 阅读(1064) 评论(0) 推荐(0)

ACM HDU 1194 Beat the Spread!（简单的水题）
摘要：Beat the Spread!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1723Accepted Submission(s): 899Problem DescriptionSuperbowl Sunday is nearly here. In order to pass the time waiting for the half-time commercials and wardrobe malfunctions, the local 阅读全文

posted @ 2011-08-01 20:48 kuangbin 阅读(1537) 评论(0) 推荐(0)

ACM POJ 2109 Power of Cryptography
摘要：http://poj.org/problem?id=2109Power of CryptographyTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 10904Accepted: 5626DescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted 阅读全文

posted @ 2011-08-01 20:10 kuangbin 阅读(348) 评论(0) 推荐(0)

ACM HDU 1070 Milk
摘要：MilkTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5689Accepted Submission(s): 1291Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermar 阅读全文

posted @ 2011-08-01 19:19 kuangbin 阅读(785) 评论(0) 推荐(0)

ACM HDU 1106 排序 (简单题）
摘要：排序Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15676Accepted Submission(s): 4032Problem Description输入一行数字，如果我们把这行数字中的‘5’都看成空格，那么就得到一行用空格分割的若干非负整数（可能有些整数以‘0’开头，这些头部的‘0’应该被忽略掉，除非这个整数就是由若干个‘0’组成的，这时这个整数就是0）。你的任务是：对这些分割得到的整数，依从小到大的顺序排序输出。Input输入包含多组 阅读全文

posted @ 2011-08-01 19:16 kuangbin 阅读(2724) 评论(2) 推荐(0)

ACM HDU 1108 最小公倍数(完全的水题）
摘要：最小公倍数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14564Accepted Submission(s): 7651Problem Description给定两个正整数，计算这两个数的最小公倍数。Input输入包含多组测试数据，每组只有一行，包括两个不大于1000的正整数.Output对于每个测试用例，给出这两个数的最小公倍数，每个实例输出一行。Sample Input10 14Sample Output70SourcePOJ Reco 阅读全文

posted @ 2011-08-01 19:14 kuangbin 阅读(1573) 评论(0) 推荐(0)

ACM HDU 1157 Who's in the Middle （完全的水题，排序找中值的）
摘要：Who's in the MiddleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3360Accepted Submission(s): 1646Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of 阅读全文

posted @ 2011-08-01 19:04 kuangbin 阅读(2481) 评论(0) 推荐(0)

ACM HDU 1163 Eddy's digital Roots(数根，找规律）
摘要：Eddy's digital RootsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1609Accepted Submission(s): 947Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit 阅读全文

posted @ 2011-08-01 19:01 kuangbin 阅读(461) 评论(0) 推荐(0)

ACM HDU 1164 Eddy's research I(素数分解，水题）
摘要：Eddy's research ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2443Accepted Submission(s): 1492Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divi 阅读全文

posted @ 2011-08-01 18:55 kuangbin 阅读(439) 评论(0) 推荐(0)

ACM HDU 1170 Balloon Comes! （完全的水题，加减乘除）
摘要：Balloon Comes!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10546Accepted Submission(s): 3623Problem DescriptionThe contest starts now! How excited it is to see balloons floating around. You, one of the best programmers in HDU, can get a very bea 阅读全文

posted @ 2011-08-01 18:49 kuangbin 阅读(3587) 评论(0) 推荐(0)

【转】2011 Multi-University Training Contest 3 - Host by BIT
摘要：T1:Inverting Cups题意是给出A个杯子，一开始都朝上，每次可以翻B个杯子，问最少需要翻转多少次可以让所有杯子都朝下。分类讨论：首先对于A%B==0一类情况，直接输出。对于A>=3B，让A减到[2B,3B)区间内，翻转次数累加上A/B-2。当A>=2B时，分奇偶讨论：A为奇数B为偶数显然无解；AB同奇偶时最多需要3次，A偶数B奇数最多需要4次。当A<2B时，分奇偶讨论：AB同奇偶时最多需要3次，A奇数B偶数无解，A偶数B奇数时，有F(A,B)=F(A,A-B)成立，可以转换成上面的情况求解即可。具体证明画画图就知道了，将两个B分别放到对称的位置上，想办法调整使得每 阅读全文

posted @ 2011-08-01 16:25 kuangbin 阅读(380) 评论(0) 推荐(0)

ACM HDU 1098Ignatius's puzzle
摘要：Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2716Accepted Submission(s): 1788Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that 阅读全文

posted @ 2011-08-01 10:49 kuangbin 阅读(656) 评论(0) 推荐(0)

A hard puzzle ACM HDU1097
摘要：A hard puzzleTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13437Accepted Submission(s): 4677Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,s 阅读全文

posted @ 2011-08-01 10:23 kuangbin 阅读(1607) 评论(4) 推荐(0)

导航

JAVASCRIPT: