码迷,mamicode.com
首页 >  
搜索关键字:gtys gay friends    ( 1079个结果
模式识别(Pattern Recognition)书单
Recommended BooksHere is a list of books which I have read and feel it is worth recommending to friends who are interested in computer science.Machine...
分类:其他好文   时间:2015-05-02 19:25:25    阅读次数:127
解题报告 之 POJ2135 Farm Tour
POJ2135 Farm Tour 最大流 最小费用流 When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains the big barn. A total M (1 <...
分类:其他好文   时间:2015-04-29 11:54:17    阅读次数:151
BNU 4260 ——Trick or Treat——————【三分求抛物线顶点】
ial JudgePrevSubmitStatusStatisticsDiscussNextType:NoneTag it!Johnny and his friends have decided to spend Halloween night doing the usual candy colle...
分类:其他好文   时间:2015-04-28 22:38:57    阅读次数:428
Uva 11181 Probability|Given(概率dp)
Problem G Probability|Given Input: Standard Input Output: Standard Output   N friends go to the local super market together. The probability of their buying something from the market is respectiv...
分类:其他好文   时间:2015-04-28 09:49:46    阅读次数:145
hdu 3018 Ant Trip 算是一道欧拉通路的题目吧~
Problem Description Ant Country consist of N towns.There are M roads connecting the towns. Ant Tony,together with his friends,wants to go through every part of the country. They intend to visit every road , and every road must be visited for exact one t...
分类:其他好文   时间:2015-04-27 13:22:54    阅读次数:148
dig out deledted chat messages
One of my friends asked me to do a favor for her. She said her friend deleted some important chat messages by “accident”, and her friend want to recov...
分类:其他好文   时间:2015-04-26 10:48:03    阅读次数:276
POJ2923——背包DP(01+状压)——Relocation
DescriptionEmma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunately, they have a few friends helping ...
分类:其他好文   时间:2015-04-25 10:40:38    阅读次数:121
线段树
Problem DescriptionThere are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends...
分类:其他好文   时间:2015-04-24 01:00:17    阅读次数:177
HDU--5119Happy Matt Friends+dp
其实还是穷举子集类的dp,一般这种dp我们只需要用一个一维的滚动数组就可以了,但是这个题目状态转移的时候不但可能向后还有可能向前,所以这次得用二维数组. 状态方程 dp[i][j]=dp[i-1][j]+dp[i-1][j^num[i]],分别表示第i个数不取和第i个数取情况下状态.代码如下:#include #include #include...
分类:移动开发   时间:2015-04-23 00:07:15    阅读次数:155
ZOJ 3710 Friends(数学啊 )
ZOJ 3710 Friends(数学啊 )...
分类:其他好文   时间:2015-04-22 20:46:13    阅读次数:111
1079条   上一页 1 ... 66 67 68 69 70 ... 108 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!