\*zyeric*/

#include #include using namespace std; const int nMax = 111111; int num[nMax]; char s[nMax]; int a[nMax]; int sa[nMax], rank[nMax], height[nMax]; int wa[nMax], wb[nMax], wv[nMax], wd[nMax]; int cmp

#include "cstdio" #include "cstring" double d[1005][1005]; int n,s; double tn,ts; double solve(int p,int q) { if(d[p][q]!=-1) return d[p][q]; if(p==n&&q==s) return d[p][q]=0; if(p==n&&

#include #include #include #include using namespace std; #define MAX 5 using namespace std; typedef double i64; i64 a[MAX][MAX], b[MAX][MAX], c[MAX][MAX], buff[MAX][MAX], vec[MAX]; void matCp

#include "cstdio" #include "iostream" using namespace std; #define maxn 2002 #define MOD 1000000007 #define LL long long LL stirling[maxn][maxn]; LL calstirling(int n,int k){ if(stirling[n][k]

#include "cstdio" #include "cmath" #include "iostream" #include "algorithm" using namespace std; #define EPS 1e-8 double a,b,c; double l,r; double f(double x){ return sqrt((2.*a*x+b)*(2.*a*x+b)+1

#include #include #include #include using namespace std; const int maxn = 10000 + 5; #define eps 1e-10 int n; double k[maxn],e[maxn]; double a[maxn],b[maxn],c[maxn]; vector v[maxn]; bool dfs(i

#include "iostream" #include "cstdio" #include "cmath" #include "algorithm" #include "map" #define LL unsigned __int64 using namespace std; //返回ab mod n LL mul_mod(LL a,LL b,LL c) { LL ret=0,tmp=

#include "cstdio" #include "iostream" #include "algorithm" using namespace std; const int maxn = 262155; int Tree[maxn+10]; inline int lowbit(int x){ return (x&-x); } void add(int x,int value){

#include "cstdio" #include "algorithm" using namespace std; #define maxn 111111 #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 int a[maxn]; int lmax[maxn<<2],rmax[maxn<<2],mmax[maxn<<2]; void push

#include "cstdio" #include "cstring" const int N = 333;//点 const int M = 33333;//边 const int inf = 10000000; int min(int a,int b){return a<b ? a:b;} struct Node{//边，点f到点t，流量为c，费用为w int f, t, c, w; }e

#include "cstdio" #include "cstring" const int N = 1111;//点 const int M = 111111;//边 const int inf = 1000000000; int min(int a,int b){return a<b ? a:b;} int max(int a,int b){return a>b ? a:b;} struct

#include "cstdio" #include "cstring" const int N = 1111;//点 const int M = 111111;//边 const int inf = 1000000000; int min(int a,int b){return a<b ? a:b;} struct Node{//边，点f到点t，流量为c，费用为w int f, t, c, w

#include "cstdio" #include "vector" #include "queue" #include "cstring" using namespace std; struct edge{int to,cap,rev;}; #define max_v 222 #define inf 11111111 vector g[max_v]; int level[max_v]; in

#include "cstdio" #include "cstring" const int N = 111;//点 const int M = 1111;//边 const int inf = 1000000000; int min(int a,int b){return a<b ? a:b;} struct Node{//边，点f到点t，流量为c，费用为w int f, t, c, w; }

#include "cstdio" #include "cstring" double d[100011]; int n,m; int trans[100011]; /* double solve(int pos) { if(d[pos]<0) return d[pos]; if(pos>=n) return d[pos]=0; if(trans[pos]!=-1)