Light OJ
文章平均质量分 87
Shyazhut
One:自控,早睡早起身体好。
Three:自由并不是想做什么就做什么,而是想不什么就不做什么。
Two:他AC而我没AC的基本上是难题,我AC他没AC的一般是水题.....
展开
-
LightOJ 1137 Expanding Rods(加热变化的路,二分)
1137 - Expanding Rods(进入题目) PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MBWhen a thin rod of length L is heated n degrees, i原创 2016-07-27 21:46:30 · 437 阅读 · 0 评论 -
Lightoj 1414 - February 29 (闰年统计,容斥定理)
http://lightoj.com/volume_showproblem.php?problem=14141414 - February 29 PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBIt原创 2016-11-05 19:23:30 · 500 阅读 · 0 评论 -
ww
卡壳,map不会啦原创 2016-11-03 09:12:16 · 457 阅读 · 0 评论 -
LightOJ 1198
题目链接(为什么我的密码不对)题意:和田忌赛马一个类型的贪心问题求解。思路:要是知道是贪心再写不出来我就没办法了。看来要把贪心算法--田忌赛马好好看看,再敲一遍了。代码:暂无原创 2016-07-31 22:27:04 · 264 阅读 · 0 评论 -
LightOJ 1410 - Consistent Verdicts
http://lightoj.com/volume_showproblem.php?problem=14101410 - Consistent Verdicts PDF (English)StatisticsForumTime Limit: 5 second(s)Memory Limit: 32 MB原创 2016-11-03 09:20:07 · 255 阅读 · 0 评论 -
LightOj 1001 - Opposite Task (数值和的拆分)
http://www.lightoj.com/volume_showproblem.php?problem=10011001 - Opposite Task PDF (English)StatisticsForumTime Limit: 0.5 second(s)Memory Limit: 32 MB原创 2016-09-08 11:39:27 · 1006 阅读 · 0 评论 -
Lightoj 1003 - Drunk(喝酒问题,拓扑排序环的判断)
http://www.lightoj.com/volume_showproblem.php?problem=10031003 - Drunk PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBOne o原创 2016-09-08 11:36:10 · 506 阅读 · 0 评论 -
LightOJ 1305 Area of a Parallelogram
http://lightoj.com/volume_showproblem.php?problem=13051305 - Area of a Parallelogram PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MB原创 2016-08-25 21:07:14 · 388 阅读 · 0 评论 -
LightOJ 1104 Birthday Paradox(生日悖论,思维)
http://lightoj.com/volume_showproblem.php?problem=11041104 - Birthday Paradox PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MB原创 2016-08-13 17:15:33 · 490 阅读 · 0 评论 -
LightOJ 1294 Positive Negative Sign 求和的升级版 暑期练习T
T - TTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionGiven two integers: n and m and n is divisible by 2m, you have to write down the first n原创 2016-06-05 11:24:35 · 390 阅读 · 0 评论 -
Lightoj 1282 Leading and Trailing(前三后三位,学习fmod())
题目:http://lightoj.com/volume_showproblem.php?problem=12821282 - Leading and Trailing PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MB原创 2016-08-09 11:43:57 · 1081 阅读 · 0 评论 -
LightOJ 1045 Digits of Factorial(大数进制)
http://lightoj.com/volume_showproblem.php?problem=10451045 - Digits of Factorial PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MB原创 2016-08-23 21:04:03 · 411 阅读 · 0 评论 -
Light OJ - 1008- Fibsieve`s Fantabulous Birthday 暑期小练习
Light OJ - 1008- Fibsieve`s Fantabulous BirthdayS - STime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionFibsieve had afantabulous (yes, it's an原创 2016-06-14 14:46:16 · 395 阅读 · 0 评论 -
LightOJ 1259 Goldbach`s Conjecture(素数问题,思维)
1259 - Goldbach`s Conjecture点击打开链接 PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGoldbach's conjecture is one of the oldest un原创 2016-08-09 15:30:25 · 577 阅读 · 0 评论 -
Light oj 1094 Farthest Nodes in a Tree(树的最大直径)
1094 - Farthest Nodes in a Tree PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGiven a tree (a connected graph with no cycles原创 2016-08-02 11:55:17 · 291 阅读 · 0 评论 -
LightOJ 1078 Integer Divisibility (同余定理)
Integer Divisibility(答题)Time Limit: 2000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit Status uDebugDescriptionIf an integer is notdivisible by 2 or原创 2016-07-31 22:42:48 · 467 阅读 · 0 评论 -
LightOJ 1062 Crossed Ladders(大楼距离,二分)
Cable masterTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionInhabitants of the Wonderland have decided to hold a regional progra原创 2016-07-27 10:09:53 · 440 阅读 · 0 评论 -
light oj 1109 - False Ordering
开刷水题1107 - How Cow PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBMr Kopa Samsu is a farmer. He has a land of rectangular原创 2017-04-07 20:02:00 · 365 阅读 · 0 评论