摘要：RadarTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2280Accepted Submission(s): 897Problem Descri...
阅读全文
摘要：Best FinancingTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29Accepted Submission(s): 3Problem...
阅读全文
摘要：ChessTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24Accepted Submission(s): 10Problem Descripti...
阅读全文
摘要：Scenic PopularityTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 117Accepted Submission(s): 25Prob...
阅读全文
摘要：MosaicTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 213Accepted Submission(s): 50Problem Desc...
阅读全文
摘要：小明系列故事——女友的考验Time Limit: 500/200 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 654Accepted Submission(s): 136Problem Description 终于放寒假了，小明要和女朋友一起去看电影。这天，女朋友想给小明一个考验，在小明正准备出发的时候，女朋友告诉他，她在电影院等他，小明过来的路线必须满足给定的规则： 1、假设小明在的位置是1号点，女朋友在的位置是n号点，则他们之间有n-2个点可以走，小明每次走的时候只能走到比当..
阅读全文
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4818深深地补一个坑~~~现场赛坑在这题了，TAT。。。。今天把代码改了下，过掉了，TAT很明显的高斯消元的模型。现场一开始想的也大概是对的。根据度可以得到n个方程，加起来为1是一个方程，有一个是多余的。 加起来就是n个方程。只可能是无穷解和唯一解的情况。现场是先求解一遍，然后枚举所有可以加的，不停做高斯消元。但是因为高斯消元是O(n^3) 的， 再枚举的话就是n^4了。。。。这样做明显应该超时的，HDU交了这样做也是TLE，，，现场被坑死，一直返回WA， 然后程序就改得不成样子了。。。其实枚举那个
阅读全文
摘要：HS BDCTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 748Accepted Submission(s): 290Problem DescriptionIELTS is around the corner! love8909 has registered for the exam, but he still hasn’t got prepared. Now he decides to take actions. But when he t
阅读全文
摘要：Play on WordsTime Limit:1000MSMemory Limit:10000KTotal Submissions:8768Accepted:3065DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important
阅读全文
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4815简单的DP题。 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 using namespace std;12 const int MAXN = 40010;13 double dp[2][MAXN];14 int a[MAXN];15 int main()16 {17 //freopen("i...
阅读全文
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4821字符串题。现场使用字符串HASH乱搞的。枚举开头！ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 using namespace std; 12 13 int HASH; 14 const int MAXN = 100010; 15 int now ; 16 struct H...
阅读全文
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4813签到题。把一个字符串按照格式输出就可以了，很水 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 using namespace std;12 int main()13 {14 //freopen("in.txt","r",stdin);15 //freopen("ou
阅读全文
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4814进制转换。现场根据题目给的两个公式，不断更新！！！胡搞就可以了。现场3A，我艹，一次循环开大TLE,一次开小WA，太逗了，呵呵现场源码： 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 using namespace std;12 int a[200];13 int main()14 {15 ...
阅读全文
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=48162013长春区域赛的D题。很简单的几何题，就是给了一条折线。 然后一个矩形窗去截取一部分，求最大面积。现场跪在这题，最后时刻TLE到死，用的每一小段去三分，时间复杂度是O(n log n) , 感觉数据也不至于超时。卧槽！！！！代码拷回来，今天在HDU一交，一模一样的代码AC了，加输入外挂6s多，不加也8s多，都可AC，呵呵·····（估计HDU时限放宽了！！！）现场赛卡三分太SXBK了，我艹！！！！ 好好的一个现场赛绝杀错过了。以下是现场赛源
阅读全文
摘要：Just RandomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 87Accepted Submission(s): 34Problem Description Coach Pang and Uncle Yang both love numbers. Every morning they play a game with number together. In each game the following will be done: ..
阅读全文
摘要：Hard Disk DriveTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 83Accepted Submission(s): 48Problem Description Yesterday your dear cousin Coach Pang gave you a new 100MB hard disk drive (HDD) as a gift because you will get married next year. But ..
阅读全文
摘要：Fibonacci TreeTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 75Accepted Submission(s): 38Problem Description Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on Spanning Tree. So Coach Pang decides to s.
阅读全文
摘要：Electric resistanceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 326Accepted Submission(s): 156Problem DescriptionNow give you a circuit who has n nodes (marked from 1 to n) , please tell abcdxyzk the equivalent resistance of the circuit between
阅读全文
摘要：Paint ChainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 909Accepted Submission(s): 325Problem DescriptionAekdycoin and abcdxyzk are playing a game. They get a circle chain with some beads. Initially none of the beads is painted. They take turns
阅读全文
摘要：MonsterTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1383Accepted Submission(s): 363Problem DescriptionOne day, v11 encounters a group of monsters in a foreast. In order to defend the homeland, V11 picks up his weapon and fights!All the monsters
阅读全文
