05 2017 档案

摘要:#include#include#include#include#include#include#include#include#include//STL数值算法头文件#include#include #include#include#include#include//模板类头文件u... 阅读全文
posted @ 2017-05-30 17:06 xushukui 阅读(179) 评论(0) 推荐(0) 编辑
摘要:描述 There are n lights in a circle numbered from 1 to n. The left of light 1 is light n, and the left of light k (1= 0), if the left of light i... 阅读全文
posted @ 2017-05-30 14:52 xushukui 阅读(164) 评论(0) 推荐(0) 编辑
摘要:GCD描述 The greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the lar... 阅读全文
posted @ 2017-05-26 21:33 xushukui 阅读(314) 评论(0) 推荐(0) 编辑
摘要:描述Some people believe that there are three cycles in a person's life that start the day he or she is born. These three cycles are the physical... 阅读全文
posted @ 2017-05-23 18:03 xushukui 阅读(149) 评论(0) 推荐(0) 编辑
摘要:Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transm... 阅读全文
posted @ 2017-05-22 19:04 xushukui 阅读(156) 评论(0) 推荐(0) 编辑
摘要:Problem Description === Op tech briefing, 2002/11/02 06:42 CST === “The item is locked in a Klein safe behind a painting in the second-floor l... 阅读全文
posted @ 2017-05-18 17:07 xushukui 阅读(183) 评论(0) 推荐(0) 编辑
摘要:Starship TroopersTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submiss... 阅读全文
posted @ 2017-05-11 19:15 xushukui 阅读(125) 评论(0) 推荐(0) 编辑
摘要:A school bought the first computer some time ago(so this computer’s id is 1). During the recent years the school bought N-1 new computers. Eac... 阅读全文
posted @ 2017-05-08 20:42 xushukui 阅读(132) 评论(0) 推荐(0) 编辑
摘要:题意: 有n个点组成一棵树,问至少要删除多少条边才能获得一棵有p个结点的子树?思路: 设dp[i][k]为以i为根,生成节点数为k的子树,所需剪掉的边数。 dp[i][1] = total(i.son) + 1,即剪掉与所有儿子(total(i.son))的边,还要剪掉与其父亲(+1... 阅读全文
posted @ 2017-05-07 19:04 xushukui 阅读(243) 评论(0) 推荐(0) 编辑
摘要:题意: 某公司要举办一次晚会,但是为了使得晚会的气氛更加活跃,每个参加晚会的人都不希望在晚会中见到他的直接上司,现在已知每个人的活跃指数和上司关系(当然不可能存在环),求邀请哪些人(多少人)来能使得晚会的总活跃指数最大。 解题思路: 任何一个点的取舍可以看作一种决策,那么状态就是在某... 阅读全文
posted @ 2017-05-07 16:28 xushukui 阅读(211) 评论(0) 推荐(0) 编辑
摘要:Problem Description Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toy... 阅读全文
posted @ 2017-05-04 19:37 xushukui 阅读(219) 评论(0) 推荐(0) 编辑
摘要:问题描述在 应 用 中,常 用 诸 如 点、圆 等 简 单 的 几 何 对 象 代 表 现 实 世 界 中 的实 体 。 在涉 及 这 些 几 何 对 象 的 问 题 中 ,常 需 要 了 解 其 邻 域 中 其 他... 阅读全文
posted @ 2017-05-04 19:09 xushukui 阅读(418) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示