xyzhk01的专栏

http://162.105.81.212/JudgeOnline/problem?id=1113/************* 凸包 1113pku Graham_scan */ #include //#include #include using namespace std; struct point{ double x,y;}one; //vector PointSet,ch; point PointSet[1005],ch[1005]; double dis(poin

<br />/*母函数G(x)=(1+x+x2+x3+x4+…)(1+x4+x8+x12+…)(1+x9+x18+x27+…)… hdu1398 */ #include <iostream> using namespace std; const int lmax=330; int c1[lmax+1],c2[lmax+1]; //下标表示x的几次方，c1[i]的值表示x的系数，即多少种； int main(void) { int n,i,j,k; n=300; for

<br />#include<iostream> #include<queue> using namespace std; #define VMAX 102 int s,t; int father[VMAX]; int c[VMAX][VMAX];//顶点从0--(n-1) int Ford_Fulkerson( ) { while(1) { queue <int> q; memset(father, -1, sizeof(fa

#include //#include //#include using namespace std; int mul(int a,int b,int m)//a * b % m { int ret = 0; while (b > 0) { if (b & 1) ret = (ret + a) % m; b >>= 1; a = (a 0) { if (

<br />#include<iostream> using namespace std; #define INF 0x111111 int ancs[101][101]; int dis[101];//结点1到其他点的距离 int min_rode; int Prim(int m) { int min,k; for(int i=2;i<=m;i++) dis[i]=ancs[1][i]; dis[1]=0; for(int i=1

<br />#include <string.h> #include <iostream> using namespace std; #define MAX_VERTEX_NUM 101 #define INFINITY 0x11111111 #define TRUE 1 #define FALSE 0 typedef struct{ //int info; }VertexType; typedef struct{ int val; //int inf