随笔分类 -  online judge hdu

上一页 1 ··· 5 6 7 8 9 10 下一页
摘要:找新朋友 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description 新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会员N人,把会员从1到N编号,其中 阅读全文
posted @ 2016-05-05 21:44 jhz033 阅读(168) 评论(0) 推荐(0)
摘要:String Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description There is a string S.S only contain lower c 阅读全文
posted @ 2016-04-28 20:02 jhz033 阅读(218) 评论(0) 推荐(0)
摘要:Matrix Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem Description There is a matrix M that has n rows and  阅读全文
posted @ 2016-04-24 15:25 jhz033 阅读(136) 评论(0) 推荐(0)
摘要:Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Holion August will eat every thing he ha 阅读全文
posted @ 2016-04-24 13:33 jhz033 阅读(192) 评论(0) 推荐(0)
摘要:#include<iostream> #include<cstdio> #include<cmath> #include<string> #include<queue> #include<algorithm> #include<stack> #include<cstring> #include<ve 阅读全文
posted @ 2016-04-22 17:56 jhz033 阅读(197) 评论(0) 推荐(0)
摘要:Is It A Tree? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20222 Accepted Submission(s): 456 P 阅读全文
posted @ 2016-04-22 16:07 jhz033 阅读(156) 评论(0) 推荐(0)
摘要:Circle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Satiya August is in charge of souls. He fi 阅读全文
posted @ 2016-04-21 20:48 jhz033 阅读(189) 评论(0) 推荐(0)
摘要:Chinese remainder theorem again Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description 我知道部分同学最近在看中国剩余定理 阅读全文
posted @ 2016-04-21 18:29 jhz033 阅读(185) 评论(0) 推荐(0)
摘要:Hello Kiki Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description One day I was shopping in the supermar 阅读全文
posted @ 2016-04-21 17:20 jhz033 阅读(275) 评论(0) 推荐(0)
摘要:Biorhythms Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description Some people believe that there are thr 阅读全文
posted @ 2016-04-21 17:02 jhz033 阅读(168) 评论(0) 推荐(0)
摘要:X问题 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description 求在小于等于N的正整数中有多少个X满足:X mod a[0] = b[0], X mod 阅读全文
posted @ 2016-04-21 16:21 jhz033 阅读(413) 评论(0) 推荐(0)
摘要:Connections between cities Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description After World War X, a 阅读全文
posted @ 2016-04-19 00:15 jhz033 阅读(153) 评论(0) 推荐(0)
摘要:How far away ? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description There are n houses in the village 阅读全文
posted @ 2016-04-18 20:49 jhz033 阅读(177) 评论(0) 推荐(0)
摘要:Billboard Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description At the entrance to the university, the 阅读全文
posted @ 2016-04-17 11:07 jhz033 阅读(181) 评论(0) 推荐(0)
摘要:Segment Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Silen August does not like to talk with o 阅读全文
posted @ 2016-04-17 10:37 jhz033 阅读(489) 评论(0) 推荐(0)
摘要:A Magic Lamp Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Kiki likes traveling. One day she fi 阅读全文
posted @ 2016-04-13 19:54 jhz033 阅读(167) 评论(0) 推荐(0)
摘要:迷宫城堡 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description 为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和 阅读全文
posted @ 2016-04-05 23:32 jhz033 阅读(271) 评论(0) 推荐(0)
摘要:India and China Origins Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description A long time ago there are 阅读全文
posted @ 2016-04-04 17:19 jhz033 阅读(216) 评论(0) 推荐(0)
摘要:xiaoxin juju needs help Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1159 Accepted Submission( 阅读全文
posted @ 2016-03-28 21:32 jhz033 阅读(304) 评论(0) 推荐(0)
摘要:摘取于http://blog.csdn.net/kenden23/article/details/37519883; 找到规律之后本题就是水题了,不过找规律也不太容易的,证明这个规律成立更加不容易。 本题就是求step和mod如果GCD(最大公约数位1)那么就是Good Choice,否则为Bad 阅读全文
posted @ 2016-03-28 19:46 jhz033 阅读(162) 评论(0) 推荐(0)

上一页 1 ··· 5 6 7 8 9 10 下一页