ln的专栏

//*求最大公约数*/ int max_common_div(int a,int b){ if(a<b){ a=a+b; b=a-b; a=a-b; } int t=a%b; while(t!=0){ a=b; b=t; t=a%b; } return b; } void left_move(){ const int m=4; char ch[]="abc

随机数生成类 class RandNumber{ static const unsigned long maxshort=65536L; static const unsigned long multiplier=1194211693L; static const unsigned long adder=12345L; unsigned long randSeed; public:

#include #include using namespace std; static const bool RED=true; static const bool BLACK=false; //tree node template class TNode{ public: TNode* p;//parent TNode* left;// left son TNode* rig