摘要: //四川麻将胡牌算法(不支持风、花牌):支持缺一门,七小对,正常胡牌,带杠//感谢 华仔 对我的代码提出了宝贵的意见,华仔很适合做测试啊!!#include <stdio.h>#include <memory.h>#include <string.h>#define TEST 0#if TEST#define LOG(fmt, ...) printf(fmt"\n", ##__VA_ARGS__)#else#define LOG(fmt, ...)#endifconst char g_typedef[3] = {'W', 阅读全文
posted @ 2012-12-01 00:54 疯狂青蛙 阅读(1871) 评论(0) 推荐(0) 编辑
摘要: DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.``This supercomputer is great,'' remarked Chip. ``I only wish Timothy were here to see these r 阅读全文
posted @ 2012-09-12 00:01 疯狂青蛙 阅读(182) 评论(0) 推荐(0) 编辑
摘要: DescriptionProblems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.This problem requires that you write a program to compute the exact value of Rn where R i 阅读全文
posted @ 2012-09-11 23:56 疯狂青蛙 阅读(236) 评论(0) 推荐(0) 编辑
摘要: typedef void* POS; // 定位标志template <class T>class CIIList{protected: struct SNode { SNode *pPrev; SNode *pNext; T data; }; SNode* GetNodeAt(int i_nIndex) const;private: CIIList(const CIIList& i_yList){} CIIList& operator = (const CIIList& i_yList){return *this;}public: CIIList(); ~ 阅读全文
posted @ 2012-09-07 22:44 疯狂青蛙 阅读(267) 评论(0) 推荐(0) 编辑
摘要: #include <iostream>using namespace std;struct Info{ int nNo; char szNo[20];};struct InfoListNode{ Info info; InfoListNode *next; InfoListNode *prev;};InfoListNode *g_list = NULL;//插入队首void insertBegin(InfoListNode *pList){ g_list->next->prev = pList; pList->next = g_list->next; pLi 阅读全文
posted @ 2012-09-06 23:25 疯狂青蛙 阅读(126) 评论(0) 推荐(0) 编辑