摘要：
一、问题描述： 有n 个物品，它们有各自的重量和价值，现有给定容量的背包，如何让背包里装入的物品具有最大的价值总和？ 二、动态规划的原理及过程： eg：number＝4，capacity＝8 i 1 2 3 4 w(体积) 2 3 4 5 v(价值) 3 4 5 6 1.原理 动态规划是把大问题拆分 阅读全文
摘要：
Description Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 10 阅读全文
摘要：
Description Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. E 阅读全文
摘要：
Description Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into earth and destroy anything they 阅读全文
摘要：
图的深搜与广搜 一、介绍： BFS：这是一种基于队列这种数据结构的搜索方式，它的特点是由每一个状态可以扩展出许多状态，然后再以此扩展，直到找到目标状态或者队列中头尾指针相遇，即队列中所有状态都已处理完毕。 DFS：基于递归的搜索方式，它的特点是由一个状态拓展一个状态，然后不停拓展，直到找到目标或者无 阅读全文
摘要：
Description On a two-dimensional plane, give you n integer points. Your task is to figure out how many different regular polygon these points can make 阅读全文
摘要：
Description Steph is extremely obsessed with “sequence problems” that are usually seen on magazines: Given the sequence 11, 23, 30, 35, what is the ne 阅读全文
摘要：
Problem Description Derek and Alfia are good friends.Derek is Chinese,and Alfia is Austrian.This summer holiday,they both participate in the summer ca 阅读全文
摘要：
Description KazaQ wears socks everyday. At the beginning, he has nn pairs of socks numbered from 11 to nn in his closets. Every morning, he puts on a 阅读全文
摘要：
Description There is a youngster known for amateur propositions concerning several mathematical hard problems. Nowadays, he is preparing a thought-pro 阅读全文