<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[WNNSCNS的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/WNNSCNS</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; WNNSCNS]]></copyright><item><title><![CDATA[STL heap 的用法]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/51113384</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/51113384</guid><author>WNNSCNS</author><pubDate>Sun, 10 Apr 2016 16:05:15 +0800</pubDate><description><![CDATA[STL中并没有把heap作为一种容器组件，heap的实现亦需要更低一层的容器组件（诸如list,array,vector）作为其底层机制。Heap是一个类属算法，包含在algorithm头文件中。虽然STL中关于heap默认调整成的是大顶堆，但却可以让用户利用自定义的compare_fuction函数实现大顶堆或小顶堆。heap的低层机制vector本身就是一个类模板，heap基于vector便实]]></description><category></category></item><item><title><![CDATA[求一个十进制数的二进制形式的1的个数]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/51003949</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/51003949</guid><author>WNNSCNS</author><pubDate>Tue, 29 Mar 2016 11:06:17 +0800</pubDate><description><![CDATA[对于一个十进制数，当它为二进制形式的时候，如何知道它有多少个1呢？下面 我从三种方法来进行说明：


1. 除2的方法：
例如1011010，当它除2之后，结果为101101
101101，再除2，结果为10110，也就是说，当一个数%2 == 1时，说明存在一个1，这时候记录一次，直到这个数变成0之后，记录结束。


#include 
using namespace std;
]]></description><category></category></item><item><title><![CDATA[2006年google的一道笔试题]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/50957604</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/50957604</guid><author>WNNSCNS</author><pubDate>Tue, 22 Mar 2016 19:21:54 +0800</pubDate><description><![CDATA[题目：在一个字符串中找到第一个只出现一次的字符。如输入abaccdeff，则输出b。


分析：这题的思路是将字符分别对应到数组中去，第一遍遍历字符串将字母出现的次数记录下来，第二遍同样是从头到尾遍历字符串，找到只出现一次的字母并输出。
#include 
#include 
#include 
#include 
#include 
#include 
using namespace s]]></description><category></category></item><item><title><![CDATA[2010年中兴面试题]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/50957574</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/50957574</guid><author>WNNSCNS</author><pubDate>Tue, 22 Mar 2016 19:14:24 +0800</pubDate><description><![CDATA[输入两个整数n和m，从数列1、2、3…….n中随意取几个数，使其和等于m，要求将其中所有的可能组合列出来。Answer：第一眼反应就是DFS，其中需要考虑的问题是去除重复的组合，其他没什么难度，简单的DFS#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cstring>
#]]></description><category></category></item><item><title><![CDATA[数据库中超码、候选码、主码的区别]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48622923</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48622923</guid><author>WNNSCNS</author><pubDate>Mon, 21 Sep 2015 10:24:07 +0800</pubDate><description><![CDATA[码是数据系统中的基本概念。所谓码就是能唯一标识实体的属性，他是整个实体集的性质，而不是单个实体的性质。它包括超码，候选码，主码。　　超码是一个或多个属性的集合，这些属性可以让我们在一个实体集中唯一地标识一个实体。如果K是一个超码，那么K的任意超集也是超码，也就是说如果K是超码，那么所有包含K的集合也是超码。　　候选码是从超码中选出的，自然地候选码也是一个或多个属性的集合。因为超码的范围太广，很多是]]></description><category></category></item><item><title><![CDATA[HDOJ 1864 最大报销额]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274961</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274961</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:30:48 +0800</pubDate><description><![CDATA[最大报销额
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 19685    Accepted Submission(s): 5832


Problem Description
现有一笔经费可以报销一定额度的发票。允许报销的]]></description><category></category></item><item><title><![CDATA[1072 Nightmare]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274927</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274927</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:29:20 +0800</pubDate><description><![CDATA[Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb explodes. The initial]]></description><category></category></item><item><title><![CDATA[HDOJ 1010 Tempter of the Bone]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274905</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274905</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:28:05 +0800</pubDate><description><![CDATA[Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 91427    Accepted Submission(s): 24865


Problem Description
The dogg]]></description><category></category></item><item><title><![CDATA[1181 变形课]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274885</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274885</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:26:39 +0800</pubDate><description><![CDATA[变形课
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 15858    Accepted Submission(s): 5723


Problem Description
呃......变形课上Harry碰到了一点小麻烦]]></description><category></category></item><item><title><![CDATA[1045  Fire Net]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274841</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274841</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:23:51 +0800</pubDate><description><![CDATA[Fire Net
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7140    Accepted Submission(s): 4066


Problem Description
Suppose that we have ]]></description><category></category></item><item><title><![CDATA[2660 Accepted Necklace]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274831</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274831</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:22:58 +0800</pubDate><description><![CDATA[Accepted Necklace
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2938    Accepted Submission(s): 1156


Problem Description
I have N pre]]></description><category></category></item><item><title><![CDATA[1194 Beat the Spread!]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274821</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274821</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:22:10 +0800</pubDate><description><![CDATA[Beat the Spread!
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5225    Accepted Submission(s): 2723


Problem Description
Superbowl Sun]]></description><category></category></item><item><title><![CDATA[1241 Oil Deposits]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274797</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274797</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:21:27 +0800</pubDate><description><![CDATA[Oil Deposits
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15592    Accepted Submission(s): 8943


Problem Description
The GeoSurvComp ]]></description><category></category></item><item><title><![CDATA[1501 Zipper]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274751</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274751</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:18:14 +0800</pubDate><description><![CDATA[Zipper
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7417    Accepted Submission(s): 2622


Problem Description
Given three strings, yo]]></description><category></category></item><item><title><![CDATA[2147 kiki's game]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274659</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274659</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:14:25 +0800</pubDate><description><![CDATA[kiki's game
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 40000/10000 K (Java/Others)
Total Submission(s): 8453    Accepted Submission(s): 5036


Problem Description
Recently kiki has ]]></description><category></category></item><item><title><![CDATA[1564 Play a game]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274613</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274613</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:12:36 +0800</pubDate><description><![CDATA[Play a game
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1907    Accepted Submission(s): 1533


Problem Description
New Year is Coming]]></description><category></category></item><item><title><![CDATA[1312 棋盘问题]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274577</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274577</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:10:12 +0800</pubDate><description><![CDATA[Description

在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。

Input

输入含有多组测试数据。 
每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n]]></description><category></category></item><item><title><![CDATA[1564 Sum It Up]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274513</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/48274513</guid><author>WNNSCNS</author><pubDate>Mon, 07 Sep 2015 22:08:50 +0800</pubDate><description><![CDATA[Description

Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t = 4, n = 6, and the list is [4, 3, 2, 2, 1, 1]]]></description><category></category></item><item><title><![CDATA[HDOJ 2066 一个人的旅行]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/44982487</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/44982487</guid><author>WNNSCNS</author><pubDate>Fri, 10 Apr 2015 17:29:23 +0800</pubDate><description><![CDATA[一个人的旅行
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 22020    Accepted Submission(s): 7632


Problem Description
虽然草儿是个路痴（就是在杭电待了一年多，居然]]></description><category></category></item><item><title><![CDATA[角色控制器 Character Controller]]></title><link>https://blog.youkuaiyun.com/WNNSCNS/article/details/44850989</link><guid>https://blog.youkuaiyun.com/WNNSCNS/article/details/44850989</guid><author>WNNSCNS</author><pubDate>Fri, 03 Apr 2015 09:21:43 +0800</pubDate><description><![CDATA[The Character Controller is mainly used for third-person or first-person player control that does not make use of Rigidbody physics.

角色控制器主要用于第三人称或第一人称游戏主角控制，并不使用刚体物理效果。


The Character Controll]]></description><category></category></item></channel></rss>