随笔分类 -  hdoj

上一页 1 2 3 4 5 6 7 8 下一页
hdu 2289 Cup (二分法)
摘要：CupTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3533Accepted Submission(s): 1136Problem DescriptionThe WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height?T 阅读全文
posted @ 2014-04-08 22:31 heaventouch 阅读(236) 评论(0) 推荐(0)
hdu 3501 Calculation 2 (欧拉函数)
摘要：Calculation 2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1923Accepted Submission(s): 812Problem DescriptionGiven a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said 阅读全文
posted @ 2014-04-08 19:34 heaventouch 阅读(182) 评论(0) 推荐(0)
hdu 1787 GCD Again (欧拉函数)
摘要：GCD AgainTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2257Accepted Submission(s): 908Problem DescriptionDo you have spent some time to think and try to solve those unsolved problem after one ACM contest?No? Oh, you must do this when you want to 阅读全文
posted @ 2014-04-08 12:15 heaventouch 阅读(213) 评论(0) 推荐(0)
hdu 2824 The Euler function (欧拉函数)
摘要：The Euler functionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3333Accepted Submission(s): 1368Problem DescriptionThe Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which are smalle 阅读全文
posted @ 2014-04-08 09:53 heaventouch 阅读(230) 评论(0) 推荐(0)
hdu 1286 找新朋友 (欧拉函数)
摘要：找新朋友Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6952Accepted Submission(s): 3612Problem Description新年快到了，“猪头帮协会”准备搞一个聚会，已经知道现有会员N人，把会员从1到N编号，其中会长的号码是N号，凡是和会长是老朋友的，那么该会员的号码肯定和N有大于1的公约数，否则都是新朋友，现在会长想知道究竟有几个新朋友？请你编程序帮会长计算出来。Input第一行是测试数据的组数CN（Case 阅读全文
posted @ 2014-04-08 09:32 heaventouch 阅读(212) 评论(0) 推荐(0)
hdu 4707 Pet
摘要：PetTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1054Accepted Submission(s): 528Problem DescriptionOne day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use 阅读全文
posted @ 2014-04-03 21:02 heaventouch 阅读(173) 评论(0) 推荐(0)
hdu 3584 Cube (三维树状数组)
摘要：CubeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1307Accepted Submission(s): 674Problem DescriptionGiven an N*N*N cube A, whose elements are either 0 or 1. A[i, j, k] means the number in the i-th row , j-th column and k-th layer. Initially we h 阅读全文
posted @ 2014-04-01 21:50 heaventouch 阅读(202) 评论(0) 推荐(0)
hdu 3038 How Many Answers Are Wrong (并查集)
摘要：How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2045Accepted Submission(s): 807Problem DescriptionTT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to play the follo 阅读全文
posted @ 2014-03-28 09:53 heaventouch 阅读(265) 评论(0) 推荐(0)
hdu 1166 敌兵布阵 (线段树)
摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36121Accepted Submission(s): 15282Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人 阅读全文
posted @ 2014-03-27 10:34 heaventouch 阅读(230) 评论(0) 推荐(0)
hdu 3357 Stock Chase (图论froyd变形)
摘要：Stock ChaseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1201Accepted Submission(s): 363Problem DescriptionI have to admit, the solution I proposed last year for solving the bank cash crisis didn’t solve the whole economic crisis. As it turns out 阅读全文
posted @ 2014-03-26 17:32 heaventouch 阅读(329) 评论(0) 推荐(0)
hdu 1251 统计难题 (字典树)
摘要：统计难题Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 15844Accepted Submission(s): 6777Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统 阅读全文
posted @ 2014-03-25 12:39 heaventouch 阅读(498) 评论(0) 推荐(0)
hdu 1247 Hat’s Words (字典树)
摘要：Hat’s WordsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6648Accepted Submission(s): 2456Problem DescriptionA hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.You are to find all the ha 阅读全文
posted @ 2014-03-25 11:42 heaventouch 阅读(989) 评论(0) 推荐(0)
hdu 1285 确定比赛名次 (拓扑)
摘要：确定比赛名次Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9840Accepted Submission(s): 3837Problem Description有N个比赛队（1 5 #include 6 int g[505][505]; 7 int in[505],ans[505],n,m; 8 void topo() 9 {10 for(int i=1;i<=n;i++)11 for(int j=1;j<=n;j++... 阅读全文
posted @ 2014-03-24 23:02 heaventouch 阅读(209) 评论(0) 推荐(0)
hdu 3172 Virtual Friends (并查集)
摘要：Virtual FriendsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3677Accepted Submission(s): 1059Problem DescriptionThese days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, 阅读全文
posted @ 2014-03-24 20:31 heaventouch 阅读(337) 评论(0) 推荐(0)
hdu 3635 Dragon Balls (并查集)
摘要：Dragon BallsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2373Accepted Submission(s): 926Problem DescriptionFive hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gath 阅读全文
posted @ 2014-03-24 13:15 heaventouch 阅读(552) 评论(0) 推荐(0)
hdu 1598 find the most comfortable road (并查集)
摘要：find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3240Accepted Submission(s): 1373Problem DescriptionXX星有许多城市，城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构）进行交流，每条SARS都对行驶在上面的Flycar限制了固定的Speed，同时XX星人对 Flycar的“舒 阅读全文
posted @ 2014-03-23 11:55 heaventouch 阅读(331) 评论(0) 推荐(0)
hdu 1856 More is better （并查集）
摘要：More is betterTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 12171Accepted Submission(s): 4481Problem DescriptionMr Wang wants some boys to help him with a project. Because the project is rather complex,the more boys come, the better it will be. 阅读全文
posted @ 2014-03-22 17:10 heaventouch 阅读(254) 评论(0) 推荐(0)
hdu 2821 Pusher (dfs)
摘要：PusherTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 754Accepted Submission(s): 264Special JudgeProblem DescriptionPusherBoy is an online game http://www.hacker.org/push . There is an R * C grid, and there are piles of blocks on some positions. Th 阅读全文
posted @ 2014-03-22 15:01 heaventouch 阅读(344) 评论(0) 推荐(0)
hdu 1829 A Bug's Life (并查集)
摘要：A Bug's LifeTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7176Accepted Submission(s): 2330Problem DescriptionBackgroundProfessor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different 阅读全文
posted @ 2014-03-21 18:28 heaventouch 阅读(795) 评论(0) 推荐(0)
hdu 1211 RSA (逆元)
摘要：RSATime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1243Accepted Submission(s): 901Problem DescriptionRSA is one of the most powerful methods to encrypt data. The RSA algorithm is described as follow:> choose two large prime integer p, q> calc 阅读全文
posted @ 2014-03-20 21:23 heaventouch 阅读(494) 评论(0) 推荐(0)

上一页 1 2 3 4 5 6 7 8 下一页