新博客：https://aping-dev.com/

#include "iostream" #include "ctime"using namespace std;const unsigned long maxshort = 65536L; const unsigned long multiplier = 1194211693L; const unsigned long adder = 12345L;class RandomNumber {

#include "iostream" #include "ctime" #include "cmath" #include "random.h"using namespace std;int key;template<class Type> bool majority(Type T[], int n) //判断主元素的蒙特卡洛方法 { int i; RandomNumber rn

#include "iostream" #include "ctime" #include "iomanip"using namespace std;const unsigned long maxshort = 65536L; const unsigned long multiplier = 1194211693L; const unsigned long adder = 12345L;class

#include "cstdio" #include "time.h"using namespace std;const unsigned long maxshort = 65536L; const unsigned long multiplier = 1194211693L; const unsigned long adder = 12345L;class RandomNumber { p

#include "iostream" #include "ctime" #include "iomanip"using namespace std;const unsigned long maxshort = 65536L; const unsigned long multiplier = 1194211693L; const unsigned long adder = 12345L;class

#include "iostream" #include "cmath" #include "cstdlib" #include "ctime" using namespace std;class Queen { public: friend void nQueen(int); private: int *x, *y; //解向量 int n; //皇后个数

#include "iostream" #include "ctime" #include "cmath" #include "random.h" //自己编写的头文件using namespace std;//Fermat： 如果n是素数，a是整数且不能被n整除，则a^(n-1) % n = 1 //二次探测：如果n是素数，x是整数且0<x<n，则 x^2 % n = 1 void power

#include <iostream> #include <stdlib.h> //rand() srand() #include <time.h> using namespace std;//产生[low, high)之间的随机数 double randval(double low, double high) { double val; val = ((d

//产生[low, high)之间的随机数 int randval(int low, int high) { int val; val = floor( ((double)(rand()%RAND_MAX)/RAND_MAX)*(high - low) + low); return val; }