light oj
文章平均质量分 83
leibniz_zhang
欢天喜地小企鹅
展开
-
LightOJ 1258 Making Huge Palindromes 【Manacher算法】
题目链接:传送Making Huge PalindromesTime Limit: 1000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit Status uDebugDescriptionA string is said to be a palin原创 2016-08-10 11:48:23 · 359 阅读 · 0 评论 -
LightOJ - 1067 数论<100000左右的组合数取模求法《逆元》>
题目链接: LightOJ - 1067 对于组合数取模的问题----数值10e6且询问的次数很多的情况--我们可以通过打表降低时间复杂度先说一下:C(n,m)= n!/(m!*(n-m)!)-----C(n ,m)=(n*(n-1)*....*(n-m+1))/(1*2*..........*m)=(n*(n-1)*(n-2)*....1)/((n-m)*(n-m原创 2016-08-06 21:54:11 · 729 阅读 · 0 评论 -
LightOJ 1166 <置换群之最小自身分群>
Old SortingTime Limit: 2000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit Status uDebugDescriptionGiven an array containing a permutation of 1 to n, you ha原创 2016-07-25 12:10:45 · 400 阅读 · 0 评论 -
LightOJ 1010 Knights in Chessboard <贪心思维>
Knights in ChessboardTime Limit: 1000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit Status uDebugDescriptionGiven an m x n chessboard where you want to place原创 2016-07-24 18:16:33 · 288 阅读 · 0 评论 -
LightOJ 1245 Harmonic Number (II) <思维---数学>
Harmonic Number (II)Time Limit: 3000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit Status uDebugDescriptionI was trying to solve problem '1234 - Harmonic Num原创 2016-07-24 15:27:45 · 432 阅读 · 0 评论 -
LightOJ 1275 Internet Service Providers <一元二次函数的最值>
Internet Service ProvidersTime Limit: 2000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit Status uDebugDescriptionA group of N Internet Service Provider com原创 2016-07-24 13:12:28 · 450 阅读 · 0 评论 -
light oj 1138 - Trailing Zeroes (III)《《二分》》
D - DTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionYou task is to find minimal natural number N, so that N! contains exactly Q zeroes on原创 2016-03-23 22:00:26 · 318 阅读 · 0 评论 -
Light oj 1048Conquering Keokradong
J - Conquering KeokradongTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1048DescriptionThis winter we are going on a trip原创 2016-04-22 07:15:21 · 328 阅读 · 0 评论 -
light oj 1076 - Get the Containers
K - Get the ContainersTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1076DescriptionA conveyor belt has a number of vessel原创 2016-04-21 21:01:37 · 644 阅读 · 0 评论 -
1369 - Answering Queries<数>
E - Answering QueriesTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThe problem you need to solve here is pretty simple. You are give a f原创 2016-05-02 10:19:42 · 312 阅读 · 0 评论 -
Light oj 1197 - Help Hanzo
1197 - Help Hanzo PDF (English)Statistics ForumTime Limit: 2 second(s) Memory Limit: 32 MBAmakusa, the evil spiritual leader has captured the beautiful princess Nakururu. The reason behin原创 2016-04-11 23:26:07 · 310 阅读 · 0 评论 -
暑假结束--我们终于要滚蛋啦!(last)【light oj 专项】
B - B 圆周率用acos(-1.0) 使用longlongTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1305 uDebugDescriptionA parallelogram is a q原创 2016-08-25 22:04:07 · 540 阅读 · 0 评论