摘要：
Count Color Description Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get 阅读全文
摘要：
Description You have N integers, A1, A2, … , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to e 阅读全文
摘要：
The first blood HDU 2041 超级楼梯 Problem Description 有一楼梯共M级，刚开始时你在第一级，若每次只能跨上一级或二级，要走上第M级，共有多少种走法？ Input 输入数据首先包含一个整数N，表示测试实例的个数，然后是N行数据，每行包含一个整数M（1<=M< 阅读全文
摘要：
Problem Description The inversion number of a given number sequence a1, a2, …, an is the number of pairs (ai, aj) that satisfy i < j and ai > aj. For 阅读全文
摘要：
题目描述 Eddy was a contestant participating in ACM ICPC contests. ACM is short for Algorithm, Coding, Math. Since in the ACM contest, the most important 阅读全文
摘要：
题目描述 Eddy likes to play cards game since there are always lots of randomness in the game. For most of the cards game, the very first step in the game 阅读全文
摘要：
1 向量 这里就不介绍向量的加法和减法，着重介绍一下向量的叉积的作用和代码实现 a), 可以判断点在直线的左边还是右边 ad: POJ2318(当时poj挂了进不去) b), 计算三角形的面积 ( 两个向量的叉积的1/2的绝对值 ) c),在计算凸包中起到了重要作用 ( 下面会讲 ) 当然了可能会用 阅读全文
摘要：
数论基本定理 (1).唯一分解定理 一句话： 任何大于１的自然数，都可以唯一分解成有限个质数的乘积 例如对于大于1的自然数n， N = p1r1p1r1 * p2r2p2r2 * p3r3p3r3 * * * * * * pnrnpnrn ( ps: p1,p2,p2都是质数 ) 代码实现： 用途： 阅读全文
摘要：
Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 41010 Accepted Submission(s): 19775 阅读全文
摘要：
I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 96984 Accepted Submission(s): 36624 Pr 阅读全文