https://blog.youkuaiyun.com/jadedripzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/jadedrip/article/details/53980906https://blog.youkuaiyun.com/jadedrip/article/details/53980906jadedripMon, 02 Jan 2017 18:01:25 +0800https://blog.youkuaiyun.com/jadedrip/article/details/51726886https://blog.youkuaiyun.com/jadedrip/article/details/51726886jadedripTue, 21 Jun 2016 14:07:32 +0800https://blog.youkuaiyun.com/jadedrip/article/details/36437325https://blog.youkuaiyun.com/jadedrip/article/details/36437325jadedripWed, 02 Jul 2014 17:38:58 +0800... subje]]>https://blog.youkuaiyun.com/jadedrip/article/details/30039921https://blog.youkuaiyun.com/jadedrip/article/details/30039921jadedripWed, 11 Jun 2014 11:19:33 +0800https://blog.youkuaiyun.com/jadedrip/article/details/16947341https://blog.youkuaiyun.com/jadedrip/article/details/16947341jadedripMon, 25 Nov 2013 17:13:41 +0800https://blog.youkuaiyun.com/jadedrip/article/details/12844823https://blog.youkuaiyun.com/jadedrip/article/details/12844823jadedripThu, 17 Oct 2013 22:50:39 +0800https://blog.youkuaiyun.com/jadedrip/article/details/12153541https://blog.youkuaiyun.com/jadedrip/article/details/12153541jadedripSun, 29 Sep 2013 10:07:14 +0800https://blog.youkuaiyun.com/jadedrip/article/details/11059409https://blog.youkuaiyun.com/jadedrip/article/details/11059409jadedripWed, 04 Sep 2013 15:25:09 +0800https://blog.youkuaiyun.com/jadedrip/article/details/9859873https://blog.youkuaiyun.com/jadedrip/article/details/9859873jadedripThu, 15 Aug 2013 08:59:51 +0800https://blog.youkuaiyun.com/jadedrip/article/details/8864001https://blog.youkuaiyun.com/jadedrip/article/details/8864001jadedripSun, 28 Apr 2013 16:37:42 +0800https://blog.youkuaiyun.com/jadedrip/article/details/8650712https://blog.youkuaiyun.com/jadedrip/article/details/8650712jadedripFri, 08 Mar 2013 15:09:01 +0800https://blog.youkuaiyun.com/jadedrip/article/details/8514311https://blog.youkuaiyun.com/jadedrip/article/details/8514311jadedripThu, 17 Jan 2013 17:09:25 +0800https://blog.youkuaiyun.com/jadedrip/article/details/8505554https://blog.youkuaiyun.com/jadedrip/article/details/8505554jadedripTue, 15 Jan 2013 14:23:00 +0800https://blog.youkuaiyun.com/jadedrip/article/details/7701399https://blog.youkuaiyun.com/jadedrip/article/details/7701399jadedripFri, 29 Jun 2012 09:35:59 +0800https://blog.youkuaiyun.com/jadedrip/article/details/6660550https://blog.youkuaiyun.com/jadedrip/article/details/6660550jadedripThu, 04 Aug 2011 17:09:43 +0800https://blog.youkuaiyun.com/jadedrip/article/details/6620402https://blog.youkuaiyun.com/jadedrip/article/details/6620402jadedripWed, 20 Jul 2011 16:26:32 +0800https://blog.youkuaiyun.com/jadedrip/article/details/6411295https://blog.youkuaiyun.com/jadedrip/article/details/6411295jadedripWed, 11 May 2011 11:01:00 +0800编程之美里有个将帅问题蛮有意思的，该问题的具体描述是：（根据中国象棋的基本原则）在只有双的将帅棋盘上，找出所有双方可以落子的位置（将帅不能碰面），但只能使用一个变量。
 
解法一般也就是 循环然后判断去除重复位置。而对于只能用一个变量的限制一般通过把变量拆成2个来解决。
 
我有一个全新的思路，不做判断，不拆变量，直接用计算来解决问题。
附算法源程序：
int _tmain(int argc, _TCHAR* argv[]) { ]]>https://blog.youkuaiyun.com/jadedrip/article/details/6298383https://blog.youkuaiyun.com/jadedrip/article/details/6298383jadedripSat, 02 Apr 2011 15:03:00 +0800https://blog.youkuaiyun.com/jadedrip/article/details/5941241https://blog.youkuaiyun.com/jadedrip/article/details/5941241jadedripThu, 14 Oct 2010 17:03:00 +0800https://blog.youkuaiyun.com/jadedrip/article/details/5887706https://blog.youkuaiyun.com/jadedrip/article/details/5887706jadedripThu, 16 Sep 2010 10:16:00 +0800