zoj
没有能与不能只有想与不想
这个作者很懒,什么都没留下…
展开
-
Building a Space Station 1718 (三维的 最小生成树)
Building a Space StationTime Limit: 2 Seconds Memory Limit: 65536 KB You are a member of the space station engineering team, and are assigned a task in the construction process of the s原创 2015-08-24 09:59:46 · 371 阅读 · 0 评论 -
ZOJ - 3869 Ace of Aces (水)
ZOJ - 3869Ace of AcesTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmitStatusDescriptionThere is a mysterious organization called Time-Sp原创 2016-05-01 15:12:28 · 366 阅读 · 0 评论 -
ZOJ - 3870 Team Formation (位运算)
ZOJ - 3870Team FormationTime Limit: 3000MS Memory Limit:原创 2016-05-01 15:31:10 · 323 阅读 · 0 评论 -
ZOJ - 3872 Beauty of Array (技巧&模拟)好题
ZOJ - 3872Beauty of ArrayTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format:原创 2016-05-01 15:46:29 · 367 阅读 · 0 评论 -
ZOJ - 3875 Lunch Time (模拟)水
ZOJ - 3875Lunch TimeTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format:原创 2016-05-01 15:50:10 · 299 阅读 · 0 评论 -
ZOJ - 3876 May Day Holiday (打表&模拟)
ZOJ - 3876May Day HolidayTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format:原创 2016-05-01 15:59:52 · 401 阅读 · 0 评论 -
ZOJ - 3878 Convert QWERTY to Dvorak (暴力)水&坑
ZOJ - 3878Convert QWERTY to DvorakTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format:原创 2016-05-01 16:04:44 · 449 阅读 · 0 评论 -
ZOJ - 3879 Capture the Flag (模拟)题意难懂的水题
ZOJ - 3879Capture the FlagTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format:原创 2016-05-01 16:26:32 · 342 阅读 · 0 评论 -
ZOJ - 3880 Demacia of the Ancients (水)
ZOJ - 3880Demacia of the AncientsTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format:原创 2016-05-01 16:30:38 · 452 阅读 · 0 评论 -
ZOJ 2016 3935
ZOJ Problem Set - 39352016Time Limit: 2 Seconds Memory Limit: 65536 KB In mathematics, a polygonal number is a number represented as dots or pebbles arranged in the shape of a regular原创 2016-04-19 18:05:26 · 332 阅读 · 0 评论 -
ZOJ - 3932 Handshakes (技巧)握手
ZOJ - 3932HandshakesTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionLast week, n students participated in the a原创 2016-04-19 19:11:56 · 578 阅读 · 0 评论 -
zoj Apples and Ideas (水)
Apples and IdeasTime Limit: 2 Seconds Memory Limit: 65536 KB "If you have an apple and I have an apple and we exchange these apples then you and I will still each have one apple. But if you原创 2016-04-23 17:32:38 · 285 阅读 · 0 评论 -
zoj Special Subsequence 3349 (DP+线段树优化) 好题***
Special SubsequenceTime Limit: 5000MS Memory Limit: 32768KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionThere a sequence S with n integers , and A is a sp原创 2015-12-06 21:55:22 · 331 阅读 · 0 评论 -
ZOJ More Divisors 2562 (反素数)
ZOJ Problem Set - 2562More DivisorsTime Limit: 2 Seconds Memory Limit: 65536 KB Everybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians say tha原创 2015-12-03 13:01:58 · 368 阅读 · 0 评论 -
zoj How Many Sets I 3556 (容斥原理&&规律)
How Many Sets ITime Limit: 2 Seconds Memory Limit: 65536 KB Give a set S, |S| = n, then how many ordered set group (S1, S2, ..., Sk) satisfies S1 ∩ S2 ∩ ... ∩ Sk = ∅. (Si is a subset原创 2015-12-16 19:04:37 · 375 阅读 · 0 评论 -
Diamond 1628 (字符匹配 细节)
DiamondTime Limit: 2 Seconds Memory Limit: 65536 KB Diamond mine is a mini-game which is played on an 8 * 8 board as you can see below.The board is filled with different colors of原创 2015-08-27 10:54:41 · 489 阅读 · 0 评论 -
Seeding 2100
Seeding Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 40 Accepted Submission(s) : 14Problem DescriptionIt is spring time and farmers h原创 2015-08-04 18:46:27 · 355 阅读 · 0 评论 -
Additive equations 1204 (搜索)
Additive equationsTime Limit: 10 Seconds Memory Limit: 32768 KB We all understand that an integer set is a collection of distinct integers. Now the question is: given an integer set, can you原创 2015-09-09 22:04:56 · 465 阅读 · 0 评论 -
Convert QWERTY to Dvorak (字符串)
ZOJ Problem Set - 3878Convert QWERTY to DvorakTime Limit: 2 Seconds Memory Limit: 65536 KB Edward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY K原创 2015-08-21 19:25:58 · 603 阅读 · 0 评论 -
Sum Up 2729 (进制模拟) 好题
Sum UpTime Limit: 2 Seconds Memory Limit: 65536 KB Vivid has stored a piece of private information, which consisted of a serial of integers in a secret number format. All the stored num原创 2015-09-26 21:24:40 · 430 阅读 · 0 评论 -
zoj S-Trees 1150 (二叉树模拟)
S-TreesTime Limit: 2 Seconds Memory Limit: 65536 KB A Strange Tree (S-tree) over the variable set Xn = {x1,x2,...,xn} is a binary tree representing a Boolean function f:{0,1}->{0,1}. Each pa原创 2015-08-23 11:31:07 · 378 阅读 · 0 评论 -
Walking Ant 1671 (广搜)
Walking AntTime Limit: 2 Seconds Memory Limit: 65536 KB Ants are quite diligent. They sometimes build their nests beneath flagstones.Here, an ant is walking in a rectangular area tile原创 2015-08-10 15:48:55 · 393 阅读 · 0 评论 -
zoj Modular Inverse 3609 (拓展欧几里德)
ZOJ Problem Set - 3609Modular InverseTime Limit: 2 Seconds Memory Limit: 65536 KB The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1原创 2015-10-24 22:25:30 · 302 阅读 · 0 评论 -
zoj Count the Colors 1610 (数组模拟&&线段树)好题
Count the ColorsTime Limit: 2 Seconds Memory Limit: 65536 KB Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your原创 2015-08-19 20:57:01 · 345 阅读 · 0 评论 -
zoj 1100&& poj2411 Mondriaan's Dream (dfs&&枚举&&状态压缩dp)好题
Mondriaan's DreamTime Limit: 10 Seconds Memory Limit: 32768 KB Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his原创 2015-11-01 15:56:53 · 387 阅读 · 0 评论 -
zoj How Many Sets II 3557 (组合数学&&转换)好题
How Many Sets IITime Limit: 2 Seconds Memory Limit: 65536 KB Given a set S = {1, 2, ..., n}, number m and p, your job is to count how many setT satisfies the following condition:原创 2015-12-16 20:06:09 · 507 阅读 · 0 评论 -
zoj Defuse the Bomb (模拟)
Defuse the BombTime Limit: 2 Seconds Memory Limit: 65536 KB The bomb is about to explode! Please defuse it as soon as possible! There is a display showing a number from 1 to 4 on the原创 2016-04-23 17:33:32 · 738 阅读 · 0 评论