编程之美 1.2 中国将帅问题


http://blog.csdn.net/caroline_wendy/article/details/20149075
输出一些互斥的组合, 可以抽象为:
即: 
1, 4, 7 除 3 余 1;
2, 5, 8 除 3 余 2;
3, 6, 9 除 3 余 0;
除3余数(%3)不相等即可;
使用一个字节存储变量是关键, 则需要对2进制数进行操作, unsigned char是占用一个字节;
  1. void Chess (void) {  
  2.     for (i.a=0; i.a<9; ++i.a)  
  3.         for (i.b=0; i.b<9; ++i.b)  
  4.             if (i.a%3 != i.b%3)  
  5.                 printf ("A=%d, B=%d \n", i.a+1, i.b+1);  
  6. }
解法2:
可以利用移位运算, 进行求解, 81=10000(3进制), 后两位为一个数字, 前两位为一个数字, 
除法(/)就是移位运算, 除以9就是移两位, 再进行比较余数(%);
  1. void Chess2 (void) {  
  2.     unsigned char  i = 81;  
  3.     while (i--) {  
  4.         if ((i/9%3) == (i%9%3))  
  5.             continue;  
  6.         printf ("A=%d, B=%d \n", i/9+1, i%9+1);  
  7.     }  
http://log4think.com/bop_1-2/
  3 void main()
  4 {
  5     short unsigned int x;
  6
  7     for (x = 0; (x & 0xF0) < 0x90; x += 0x10 ) {
  8         for ( x &= 0xF0; (x & 0x0F) < 9; x++)
  9             if ((x >> 4) % 3 != (x & 0x0F) % 3)
 10                 printf("A = %d, B = %d\n", (x >> 4) + 1, (x & 0x0F) + 1);
 11     }
 12 }
http://www.cnblogs.com/jiayith/p/3500497.html
struct myBits
{
    unsigned char a:4;   //4位可以表示0-15的值了
    unsigned char b:4;
};
int main(void)
{
    myBits my;
    for (my.a=0;my.a<=8;my.a++)
    {
        for (my.b=0;my.b<=8;my.b++)
        {
            if (my.a%3!=my.b%3)
            {
                cout<<"("<<(int)my.a<<","<<(int)my.b<<")"<<endl;
            }
        }
    }
    cin.get();
    return 0;
}
用一个char,我的机器八位,左4位表示将的位置,右位表示帅的位置,关键是怎么给一个8位的char的左右半边赋值再获得左右半边的值.位操作!
#define  FULLMASK 255                   // 11111111
#define  RMASK (FULLMASK>>4)   //00001111
#define  LMASK (FULLMASK<<4)   //11110000

/*下面是几个获得左右半边值的宏*/
#define GETR(t) (t&RMASK)   //获得右半边4位的值,用掩码,掩盖住左半边的值,注意这个位操作不改变原有值
#define GETL(t) ((t&LMASK)>>4)   //获得左半边4位的值,先掩盖右4位,再把值右移4位,注意这里要价格括号...我猜临时值放在某寄存器里 

/*下面是设置左右半边值的宏*/
#define SETR(t,val) (t=(t&LMASK)|val)//((t=t&LMASK),(t=t|val))   //用十进制val设置右4位,但要保证val可以用4位表示,即val表示值的位在低4位.(这里先清空右四位,再与左4位全是0而右4位是值的val或)
#define SETL(t,val) (t=((t&RMASK)|(val<<4)))//((t=t&RMASK),(t=t|(val<<4)))   //用十进制val设置左4位 (先清空左4位,再把val右边4位的值移动到左边,再与)

int main(void)
{
    using namespace std;

   unsigned char my;   //注意这里一定要用无符号的,要不放最高位为1就麻烦了.... 

    
    for (SETL(my,0);(int)GETL(my)<=8;SETL(my,(int)GETL(my)+1))
    {
        for (SETR(my,0);(int)GETR(my)<=8;SETR(my,(int)GETR(my)+1))
        {
            if (((int)GETL(my)%3)!=((int)GETR(my)%3))
            {
                cout<<"("<<(int)GETL(my)<<","<<(int)GETR(my)<<")\n";
            }
        }
    }

    cin.get();
    return 0;
}

Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts