vsooda的专栏

#include #include #include int a[1000010]; #define MAXN 1000010 unsigned int plist[60000],pcount; unsigned int isprime[(MAXN>>5)+1]; #define setbitzero(a) (isprime[(a)>>5]&=(~(1<<((a)&31)))) #define s

#include #include #include #include using namespace std; long long mod2(long long a,long long b,long long n) //计算a*b%n的，防止a*b的时候超过 long long的范围 {

#include #include #include #include using namespace std; double Randomf(double a, double b) { double c; c = (double)(a+(b-a)*1.0*rand()/RAND_M

#include #include #include using namespace std; #define N 1000000 double Randomf(double a, double b) { double c; c = (double)(a+(b-a)*1.0*rand()/RAND_MAX); return c; }

#include #include #include using namespace std; double Randomf(double a, double b) { double c; c = (double)(a+(b-a)*1.0*rand()/RAND_MAX); return c; }

#include #include #include using namespace std; const unsigned long maxshort=65536L; const unsigned long multiplier=1194211693L; const unsigned long adder=12345L; class RandomNumber { private: unsign

#include using namespace std; int mat[110][110]; int res; void Mincut(int n) { int node[110], dist[110]; bool visit[110]; int i, prev, maxj, j, k; for (i = 0; i < n; i++) node[i] = i; while (

#include #include #include int main() { // freopen("1.txt","r",stdin); int a[1001],t1,t2,flag=0,f=0; int i=0,n; char c[1001],temp,buf[1000]; memset(a,0,sizeof(a)); memset(buf,0,sizeof(buf)); fge