摘要：
#coding=utf-8"""@version: ??@author: Donny@Mail: wdm666666@gmail.com@license: Lan yu@file: ${NAME}.py@time: ${DATE} ${TIME}"""import sysimport... 阅读全文
摘要：
#include#include#include#include#include#include#include#include#include//STL数值算法头文件#include#include #include#include#include#include//模板类头文件u... 阅读全文
摘要：
描述 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... 阅读全文
摘要：
GCD描述 The greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the lar... 阅读全文
摘要：
描述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... 阅读全文
摘要：
Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transm... 阅读全文
摘要：
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... 阅读全文
摘要：
Starship TroopersTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submiss... 阅读全文
摘要：
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... 阅读全文
摘要：
题意： 有n个点组成一棵树，问至少要删除多少条边才能获得一棵有p个结点的子树？思路： 设dp[i][k]为以i为根，生成节点数为k的子树，所需剪掉的边数。 dp[i][1] = total(i.son) + 1，即剪掉与所有儿子（total(i.son)）的边，还要剪掉与其父亲（+1... 阅读全文