SYMBOL INDEX (3923 symbols across 1218 files) FILE: ACM 模板代码/f-0-1分数规划/f-0-1分数规划/main.cpp function main (line 25) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-2-SAT/f-2-SAT/main.cpp function dfs (line 24) | void dfs(int w) function Tarjan (line 58) | void Tarjan(int N) function solve (line 77) | int solve() function check (line 90) | int check(int Mid) function main (line 104) | int main() FILE: ACM 模板代码/f-AC自动机/f-AC自动机/main.cpp type Trie (line 17) | struct Trie method newnode (line 21) | int newnode() method init (line 31) | void init() method insert (line 37) | void insert(char buf[]) method build (line 52) | void build() method query (line 87) | int query(char buf[]) method debug (line 106) | void debug() function main (line 123) | int main() FILE: ACM 模板代码/f-Baby-Step Giant-Step/f-Baby-Step Giant-Step/main.cpp function insert (line 26) | void insert(int x, int y) function find (line 36) | int find(int x) function BSGS (line 49) | long long BSGS(int a, int b, int n) function main (line 78) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-DAG的深度优先搜索标记/f-DAG的深度优先搜索标记/main.cpp function dfsTag (line 24) | void dfsTag(int cur, int n) function main (line 58) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-FFT/f-FFT/main.cpp type Complex (line 27) | struct Complex method Complex (line 30) | Complex(double _x = 0.0, double _y = 0.0) method Complex (line 35) | Complex operator - (const Complex &b) const method Complex (line 39) | Complex operator + (const Complex &b) const method Complex (line 43) | Complex operator * (const Complex &b) const function change (line 52) | void change(Complex y[], int len) function fft (line 80) | void fft(Complex y[], int len, int on) function main (line 113) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-FWT/f-FWT/main.cpp function FWT (line 19) | inline void FWT(int c[], int N, int tf_utf) // tf_utf 1:tf; 0:utf FILE: ACM 模板代码/f-Floyd求最小环/f-Floyd求最小环/main.cpp function solve (line 18) | int solve(int i, int j, int k) function main (line 31) | int main() FILE: ACM 模板代码/f-GCD/f-GCD/main.cpp function gcd (line 14) | int gcd(int x, int y) function kgcd (line 25) | int kgcd(int a, int b) function extgcd (line 58) | int extgcd(int a, int b, int &x, int &y) function main (line 73) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-Graham求凸包/f-Graham求凸包/main.cpp type point (line 17) | struct point function mult (line 22) | bool mult(point sp, point ep, point op) function graham (line 32) | int graham(point pnt[], int n, point res[]) FILE: ACM 模板代码/f-KMP算法/f-KMP算法/main.cpp function getNext (line 111) | void getNext(char *T, int *next, int len) function indexKMP (line 134) | int indexKMP(char *S, char *T, int *next, int pos, int lenS, int lenT) FILE: ACM 模板代码/f-Karp-Rabin算法/f-Karp-Rabin算法/main.cpp function init (line 68) | void init() function hash (line 78) | void hash() function read (line 114) | void read() function solve (line 129) | int solve() function main (line 152) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-LCA/f-LCA/main.cpp type Edge (line 316) | struct Edge function addedge (line 322) | void addedge(int u, int v) function init (line 329) | void init() function BFS (line 338) | void BFS(int root) function LCA (line 366) | int LCA(int u, int v) function main (line 399) | int main() FILE: ACM 模板代码/f-Liuctic的计算几何库/f-Liuctic的计算几何库/main.cpp type Lpoint (line 37) | struct Lpoint type Llineseg (line 41) | struct Llineseg type Ldir (line 45) | struct Ldir type Lline (line 49) | struct Lline type Lrad (line 54) | struct Lrad type Lround (line 59) | struct Lround function p2pdis (line 67) | double p2pdis(Lpoint p1, Lpoint p2) function xmulti (line 81) | double xmulti(Lpoint p1, Lpoint p2, Lpoint p0) function mx (line 88) | double mx(double t1, double t2) function mn (line 96) | double mn(double t1, double t2) function lsinterls (line 104) | int lsinterls(Llineseg u, Llineseg v) function ponls (line 111) | int ponls(Llineseg l, Lpoint p) function Euqal_Point (line 118) | int Euqal_Point(Lpoint p1, Lpoint p2) function lsinterls_A (line 128) | int lsinterls_A(Llineseg u, Llineseg v) function pinplg (line 139) | int pinplg(int vcount, Lpoint Polygon[], Lpoint q) function area_of_polygon (line 165) | double area_of_polygon(int vcount, double x[], double y[], Lpoint plg[]) function equa (line 186) | int equa(double A, double B, double C, double &x1, double &x2) function format (line 200) | void format(Lline ln, double &A, double &B, double &C) function p2ldis (line 210) | double p2ldis(Lpoint a, Lline ln) function lncrossc (line 219) | int lncrossc(Lline ln, Lround Y, Lpoint &p1, Lpoint &p2) function samedir (line 249) | bool samedir(Lrad ln, Lpoint P) function lrcrossc (line 269) | int lrcrossc(Lrad ln, Lround Y, Lpoint &P) function Lpoint (line 300) | Lpoint mirror(Lpoint P, Lline ln) function angle_LL (line 312) | double angle_LL(Lline line1, Lline line2) FILE: ACM 模板代码/f-MST/f-MST/main.cpp function steiner (line 31) | void steiner(int n, int a) function main (line 94) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-Manacher算法/f-Manacher算法/main.cpp function Manacher (line 21) | void Manacher(char s[], int len) function main (line 59) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-Polya计数/f-Polya计数/main.cpp function gcd (line 16) | int gcd(int a, int b) function main (line 21) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-RMQ/f-RMQ/main.cpp function initRMQ (line 59) | void initRMQ(int n, int m) function rmq (line 94) | int rmq(int x1, int y1, int x2, int y2) function main (line 103) | int main() FILE: ACM 模板代码/f-SPFA/f-SPFA/main.cpp function relax (line 104) | int relax(int u, int v, int c) function addedge (line 114) | inline void addedge(int u, int v, int c) function SPFA (line 123) | int SPFA(int src, int n) function main (line 164) | int main() FILE: ACM 模板代码/f-Sunday Algorithm/f-Sunday Algorithm/main.cpp function SUNDAY (line 27) | void SUNDAY(char *text, char *patt) function main (line 61) | int main(void) FILE: ACM 模板代码/f-Tarian强连通分量/f-Tarian强连通分量/main.cpp function tarjan (line 22) | void tarjan(int v, int n) // vertex: 0 ~ n-1 function main (line 53) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-Treap/f-Treap/main.cpp function gcd (line 11) | long long gcd(long long a, long long b) type Treap (line 26) | struct Treap method Init (line 35) | void Init() method random (line 43) | bool random(double p) method newnode (line 47) | int newnode(int val, int _status) method del (line 65) | void del(int r) method push_up (line 76) | void push_up(int r) method merge (line 92) | void merge(int &p, int x, int y) method split (line 110) | void split(int p, int &x, int &y, int k) method build (line 132) | void build(int &p, int l, int r) method debug (line 145) | void debug(int root) function main (line 160) | int main() FILE: ACM 模板代码/f-Trie树/f-Trie树/main.cpp type trie (line 89) | struct trie function init (line 95) | void init() function sear (line 101) | int sear(char *s) // 失败返回0 function insert (line 121) | void insert(char *s, int rk = 1) // rk: 权或者标记 function delt (line 147) | void delt(char *s) // 假定s已经存在,只做标记 function profix (line 164) | int profix(char *s) // 最长前缀 FILE: ACM 模板代码/f-Ugly Numbers/f-Ugly Numbers/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-simpson积分/f-simpson积分/main.cpp function F (line 19) | double F(double x) function simpson (line 29) | double simpson(double a, double b) function asr (line 36) | double asr(double a, double b, double eps, double A) function asr (line 48) | double asr(double a, double b, double eps) function main (line 53) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-strstr函数/f-strstr函数/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-一般图匹配带花树/f-一般图匹配带花树/main.cpp function CreateGraph (line 25) | void CreateGraph() function Push (line 36) | void Push(int u) function Pop (line 42) | int Pop() function FindCommonAncestor (line 48) | int FindCommonAncestor (int u, int v) function ResetTrace (line 73) | void ResetTrace(int u) function BlossomContract (line 88) | void BlossomContract(int u, int v) function FindAugmentingPath (line 115) | void FindAugmentingPath() function AugmentPath (line 155) | void AugmentPath() function Edmonds (line 169) | void Edmonds() function PrintMatch (line 186) | void PrintMatch() function main (line 206) | int main() FILE: ACM 模板代码/f-主席树/f-主席树/main.cpp type Query (line 495) | struct Query function Init_hash (line 501) | void Init_hash(int k) function hash_ (line 508) | int hash_(int x) function build (line 513) | int build(int l, int r) function Insert (line 526) | int Insert(int root, int pos, int val) function lowbit (line 555) | int lowbit(int x) function add (line 562) | void add(int x, int pos, int val) function sum (line 571) | int sum(int x) function Query (line 582) | int Query(int left, int right, int k) function Modify (line 632) | void Modify(int x, int p, int d) function main (line 642) | int main() FILE: ACM 模板代码/f-二分图匹配/f-二分图匹配/main.cpp function searchP (line 411) | bool searchP() function DFS (line 452) | bool DFS(int u) function MaxMatch (line 473) | int MaxMatch() FILE: ACM 模板代码/f-二分图多重匹配/f-二分图多重匹配/main.cpp function dfs (line 19) | bool dfs(int u) function hungary (line 44) | int hungary() function main (line 64) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-二分查找/f-二分查找/main.cpp function bs (line 47) | int bs(int a[], int l, int h, int v) FILE: ACM 模板代码/f-二叉排序树/f-二叉排序树/main.cpp type BiTNode (line 14) | struct BiTNode type BiTNode (line 17) | struct BiTNode function Status (line 24) | Status SearchBST(BiTree T, int Key, BiTree f, BiTree *p) function Status (line 48) | Status InserBST(BiTree *T, int Key) function Status (line 78) | Status Delete(BiTree *p) function Status (line 123) | Status DeleteBST(BiTree *T, int Key) function main (line 146) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-二叉查找树/f-二叉查找树/main.cpp class BSTNode (line 12) | class BSTNode method BSTNode (line 20) | BSTNode(T key , BSTNode *lchild, BSTNode *rchild, BSTNode *parent) : class BSTree (line 25) | class BSTree method BSTree (line 30) | BSTree() : _Root(NULL) {} function T (line 256) | T BSTree::minimumKey() function T (line 268) | T BSTree::maximumKey() function main (line 439) | int main() FILE: ACM 模板代码/f-伸展数/f-伸展数/main.cpp function Treavel (line 30) | void Treavel(int x) function debug (line 41) | void debug() function NewNode (line 49) | void NewNode(int &r, int father, int k) function Update_Rev (line 69) | void Update_Rev(int r) function Update_Same (line 81) | void Update_Same(int r, int v) function push_up (line 94) | void push_up(int r) function push_down (line 106) | void push_down(int r) function Build (line 123) | void Build(int &x, int l, int r, int father) function Init (line 137) | void Init() function Rotate (line 155) | void Rotate(int x,int kind) function Splay (line 171) | void Splay(int r, int goal) function Get_kth (line 209) | int Get_kth(int r, int k) function Insert (line 228) | void Insert(int pos, int tot) function erase (line 243) | void erase(int r) function Delete (line 256) | void Delete(int pos, int tot) function Make_Same (line 269) | void Make_Same(int pos, int tot, int c) function Reverse (line 280) | void Reverse(int pos, int tot) function Get_Sum (line 291) | int Get_Sum(int pos, int tot) function Get_MaxSum (line 299) | int Get_MaxSum(int pos, int tot) function InOrder (line 306) | void InOrder(int r) function main (line 319) | int main() FILE: ACM 模板代码/f-使序列有序的最少交换次数/f-使序列有序的最少交换次数/main.cpp function getMinSwaps (line 74) | int getMinSwaps() function main (line 105) | int main() FILE: ACM 模板代码/f-划分树/f-划分树/main.cpp function build (line 22) | void build(int l, int r, int dep) function query (line 62) | int query(int L, int R, int l, int r, int dep, int k) function main (line 84) | int main() FILE: ACM 模板代码/f-判断线段相交/f-判断线段相交/main.cpp type point (line 13) | struct point function min (line 18) | double min(double a, double b) function max (line 23) | double max(double a, double b) function inter (line 28) | bool inter(point a, point b, point c, point d) FILE: ACM 模板代码/f-动态树/f-动态树/main.cpp function Update_Add (line 26) | void Update_Add(int r, int d) function Update_Rev (line 38) | void Update_Rev(int r) function push_down (line 49) | void push_down(int r) function push_up (line 66) | void push_up(int r) function Rotate (line 72) | void Rotate(int x) function P (line 92) | void P(int r) function Splay (line 101) | void Splay(int r) function Access (line 124) | int Access(int x) function judge (line 137) | bool judge(int u, int v) function mroot (line 151) | void mroot(int r) function lca (line 161) | void lca(int &u, int &v) function link (line 179) | void link(int u, int v) function cut (line 192) | void cut(int u, int v) function ADD (line 209) | void ADD(int u, int v, int w) function query (line 224) | void query(int u, int v) type Edge (line 236) | struct Edge function addedge (line 243) | void addedge(int u, int v) function dfs (line 251) | void dfs(int u) function main (line 266) | int main() FILE: ACM 模板代码/f-区间最大频率/f-区间最大频率/main.cpp type NODE (line 37) | struct NODE function main (line 47) | int main() function build (line 69) | int build(int a, int b) // 建立线段树 function query (line 113) | int query(int index, int a, int b) FILE: ACM 模板代码/f-半平面交/f-半平面交/main.cpp function sgn (line 148) | int sgn(double x) type Point (line 164) | struct Point method Point (line 167) | Point() {} method Point (line 168) | Point(double _x, double _y) method Point (line 173) | Point operator - (const Point &b)const function CalcArea (line 188) | double CalcArea(Point p[], int n) function Get_equation (line 199) | void Get_equation(Point p1, Point p2, double &a, double &b, double &c) function Point (line 208) | Point Intersection(Point p1, Point p2, double a, double b, double c) method Point (line 167) | Point() {} method Point (line 168) | Point(double _x, double _y) method Point (line 173) | Point operator - (const Point &b)const function Cut (line 219) | void Cut(double a, double b, double c, Point p[], int &cnt) function solve (line 255) | bool solve(int id) function main (line 295) | int main() FILE: ACM 模板代码/f-双连通分支/f-双连通分支/main.cpp type Edge (line 161) | struct Edge function addedge (line 176) | void addedge(int u, int v) function dfs (line 184) | bool dfs(int u, int col) // 染色判断二分图 function Tarjan (line 210) | void Tarjan(int u, int pre) function solve (line 264) | void solve(int n) function init (line 288) | void init() function main (line 296) | int main() FILE: ACM 模板代码/f-取第k个元素/f-取第k个元素/main.cpp function elem_t (line 18) | elem_t kth_element(int n, elem_t *a, int k) FILE: ACM 模板代码/f-合数相关/f-合数相关/main.cpp function gerPrime (line 23) | void gerPrime() function gerFactors (line 48) | int gerFactors(long long x) function main (line 74) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-后缀数组/f-后缀数组/main.cpp function c0 (line 245) | int c0(int *r, int a, int b) function c12 (line 250) | int c12(int k, int *r, int a, int b) function sort (line 262) | void sort(int *r, int *a, int *b, int n, int m) function dc3 (line 287) | void dc3(int *r, int *sa, int n, int m) function da (line 348) | void da(int str[], int sa[], int rank[], int height[], int n,int m) FILE: ACM 模板代码/f-后缀自动机/f-后缀自动机/main.cpp type SAM_Node (line 14) | struct SAM_Node method SAM_Node (line 19) | SAM_Node(){} method SAM_Node (line 20) | SAM_Node(int _len) function SAM_Node (line 30) | SAM_Node *newSAM_Node(int len) method SAM_Node (line 19) | SAM_Node(){} method SAM_Node (line 20) | SAM_Node(int _len) function SAM_Node (line 36) | SAM_Node *newSAM_Node(SAM_Node *p) method SAM_Node (line 19) | SAM_Node(){} method SAM_Node (line 20) | SAM_Node(int _len) function SAM_init (line 41) | void SAM_init() function SAM_add (line 47) | void SAM_add(int x, int len) function SAM_build (line 74) | void SAM_build(char *s) FILE: ACM 模板代码/f-周期性方程/f-周期性方程/main.cpp function run (line 30) | void run() function main (line 60) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-培训作业/f-培训作业/main.cpp function jia (line 163) | void jia(long long &x,long long y) { x+=y; if (x>=Mo) x-=Mo; } function ll (line 171) | ll modAdd(ll a, ll b) { function ll (line 175) | ll modMul(ll a , ll b) { function multiply (line 180) | void multiply(const vector &Q, vector &Qr) { function cal (line 196) | void cal(long long *A,long long n,long long k,long long *C) function power (line 240) | int power(int x,int y) function guass (line 251) | void guass(int n) function Count (line 276) | int Count(vector A,long long R) function main (line 289) | int main() FILE: ACM 模板代码/f-堆/f-堆/main.cpp function scan_d (line 22) | inline void scan_d(T &ret) function main (line 35) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-堆栈/f-堆栈/main.cpp function swap (line 14) | inline void swap(int i, int j) function Parent (line 22) | inline int Parent(int i) function Left (line 27) | inline int Left(int i) function Right (line 32) | inline int Right(int i) function MaxHeapify (line 37) | void MaxHeapify(int i) function BuildMaxHeap (line 60) | void BuildMaxHeap(int *arr, int n) function HeapSort (line 70) | void HeapSort(int *arr, int n) FILE: ACM 模板代码/f-多项式求根（牛顿法）/f-多项式求根（牛顿法）/main.cpp function fabs (line 19) | double fabs(double x) function f (line 24) | double f(int m, double c[], double x) function newton (line 35) | int newton(double x0, double *r, double c[], double cp[], int n, double ... function Polynomial_Root (line 65) | double Polynomial_Root(double c[], int n, double a, double b, double eps) FILE: ACM 模板代码/f-大数取模的二进制方法/f-大数取模的二进制方法/main.cpp function mod_exp (line 19) | int mod_exp(int a, int b_0, int n) //return a^b0 % n function main (line 47) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-大数平方根（字符串数组表示）/f-大数平方根（字符串数组表示）/main.cpp function Sqrt (line 13) | void Sqrt(char *str) function main (line 61) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-大数运算/f-大数运算/main.cpp function main (line 231) | int main() function Add (line 266) | void Add(char *str1, char *str2, char *str3) function Minus (line 306) | void Minus(char *str1, char *str2, char *str3) function Mul (line 362) | void Mul(char *str1, char *str2, char *str3) function Div (line 408) | void Div(char *str1, char *str2, char *str3) FILE: ACM 模板代码/f-字符串 HASH/f-字符串 HASH/main.cpp function hashA (line 18) | unsigned int hashA(char *url, int mod) function hashB (line 29) | unsigned int hashB(char *url, int mod) function hashC (line 46) | unsigned int hashC(char *p, int prime = 25013) function main (line 63) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-容斥/f-容斥/main.cpp function dfs (line 19) | void dfs(int x, int tot, double sum) // dfs(1, 0, ?) function main (line 43) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-左偏树/f-左偏树/main.cpp type node (line 30) | struct node function iroot (line 36) | int iroot(int i) function merge (line 49) | int merge(int rx, int ry) function ins (line 82) | int ins(int i, typec key, int root) function del (line 90) | int del(int i) function node (line 129) | node top(int root) function node (line 134) | node pop(int &root) function add (line 144) | int add(int i, typec val) // tr[i].key += val function init (line 160) | void init(int n) function main (line 171) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-带权值的并查集/f-带权值的并查集/main.cpp type lset (line 17) | struct lset method link (line 20) | void link(int x, int y) method makeset (line 40) | void makeset(int n) method findset (line 50) | int findset(int x) method unin (line 58) | void unin(int x, int y) method compress (line 63) | void compress() FILE: ACM 模板代码/f-平衡二叉树/f-平衡二叉树/main.cpp type BiTNode (line 18) | struct BiTNode type BiTNode (line 22) | struct BiTNode function R_Rotate (line 26) | void R_Rotate(BiTree *p) function L_Rotate (line 37) | void L_Rotate(BiTree *p) function LeftBalance (line 48) | void LeftBalance(BiTree *T) function RightBalance (line 84) | void RightBalance(BiTree *T) function InsertAVL (line 120) | bool InsertAVL(BiTree *T, int e, bool *taller) function main (line 184) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-平面最近点对/f-平面最近点对/main.cpp type Point (line 18) | struct Point function main (line 33) | int main() function closest (line 58) | double closest(Point a[],Point b[],Point c[],int p,int q) function dis (line 121) | double dis(Point p, Point q) function merge (line 127) | int merge(Point p[], Point q[], int s, int m, int t) function cmp_x (line 153) | int cmp_x(const void *p, const void *q) function cmp_y (line 170) | int cmp_y(const void *p, const void *q) function min (line 187) | inline double min(double p, double q) FILE: ACM 模板代码/f-弦图判断/f-弦图判断/main.cpp function mcs (line 33) | void mcs(int n) function peo (line 60) | int peo(int n) FILE: ACM 模板代码/f-弦图的PERFECT ELIMINATION点排列/f-弦图的PERFECT ELIMINATION点排列/main.cpp function cardinality (line 19) | void cardinality(int n) function main (line 48) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-快排/f-快排/main.cpp function ksort (line 13) | void ksort(int l, int h, int a[]) FILE: ACM 模板代码/f-所有数位相加/f-所有数位相加/main.cpp function dig (line 21) | int dig(int x) function dig_ (line 38) | int dig_(int x) function main (line 43) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-扩展KMP/f-扩展KMP/main.cpp function preEKMP (line 17) | void preEKMP(char x[], int m, int next[]) function EKMP (line 49) | void EKMP(char x[], int m, char y[], int n, int next[], int extend[]) function main (line 81) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-拓扑排序/f-拓扑排序/main.cpp function TopoOrder (line 19) | void TopoOrder(int n) function main (line 54) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-排列组合/f-排列组合/main.cpp function unrepeat_combination (line 366) | void unrepeat_combination(int l, int p) function read_data (line 390) | int read_data() function main (line 418) | int main() FILE: ACM 模板代码/f-散列表查找/f-散列表查找/main.cpp function InitHashTable (line 21) | int InitHashTable(HashTable *H) function Hash (line 37) | int Hash(int key) function InserHash (line 43) | void InserHash(HashTable *H, int key) function SearchHash (line 57) | int SearchHash(HashTable H, int key, int *addr) function main (line 72) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-旋转卡壳/f-旋转卡壳/main.cpp function sgn (line 206) | int sgn(double x) type Point (line 222) | struct Point method Point (line 225) | Point(double _x = 0, double _y = 0) method Point (line 230) | Point operator - (const Point &b)const method input (line 242) | void input() type Line (line 248) | struct Line method Line (line 251) | Line(){} method Line (line 252) | Line(Point _s, Point _e) function dist (line 260) | double dist(Point a, Point b) function Point (line 266) | Point NearestPointToLineSeg(Point P, Line L) method Point (line 225) | Point(double _x = 0, double _y = 0) method Point (line 230) | Point operator - (const Point &b)const method input (line 242) | void input() function _cmp (line 297) | bool _cmp(Point p1, Point p2) function Graham (line 314) | void Graham(int n) function pointtoseg (line 357) | double pointtoseg(Point p0, Point p1, Point p2) function dispallseg (line 363) | double dispallseg(Point p0, Point p1, Point p2, Point p3) function Get_angle (line 371) | double Get_angle(Point a1, Point a2, Point b1, Point b2) function rotating_calipers (line 376) | double rotating_calipers(Point p[], int np, Point q[], int nq) function solve (line 414) | double solve(Point p[], int n, Point q[], int m) function main (line 421) | int main() FILE: ACM 模板代码/f-无向图找桥/f-无向图找桥/main.cpp function main (line 71) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-无向图最小割/f-无向图最小割/main.cpp function typec (line 26) | typec minCut(int n) function main (line 78) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-无向图连通分支/f-无向图连通分支/main.cpp function search (line 19) | void search(int n, int mat[][MAXN], int* dfn, int* low, int now, int& cn... function find_components (line 53) | int find_components(int n, int mat[][MAXN], int* id) function main (line 67) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-无向图连通度（割）/f-无向图连通度（割）/main.cpp function dfs (line 27) | void dfs(int cur, int father, int dep, int n) function main (line 63) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-星期问题/f-星期问题/main.cpp function main (line 17) | int main() FILE: ACM 模板代码/f-曼哈顿最小生成树/f-曼哈顿最小生成树/main.cpp type Point (line 17) | struct Point function cmp (line 24) | bool cmp(Point a, Point b) type BIT (line 37) | struct BIT method init (line 41) | void init() type Edge (line 49) | struct Edge function cmpEdge (line 56) | bool cmpEdge(Edge a, Edge b) function find (line 65) | int find(int x) function addEdge (line 77) | void addEdge(int u, int v, int d) function lowbit (line 85) | int lowbit(int x) function update (line 91) | void update(int i, int val, int pos) function ask (line 106) | int ask(int i, int m) function dist (line 122) | int dist(Point a, Point b) function ManhattanMinimumSpanningTree (line 127) | void ManhattanMinimumSpanningTree(int n, Point p[]) function solve (line 173) | int solve(int k) function main (line 197) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-最佳点割集/f-最佳点割集/main.cpp function max_flow (line 14) | int max_flow(int n, int mat[][MAXN], int source, int sink) function best_vertex_cut (line 55) | int best_vertex_cut(int n, int mat[][MAXN], int *cost, int source, int s... FILE: ACM 模板代码/f-最佳边割集/f-最佳边割集/main.cpp function max_flow (line 13) | int max_flow(int n, int mat[][MAXN], int source, int sink) function best_edge_cut (line 54) | int best_edge_cut(int n, int mat[][MAXN], int source, int sink, int set[... function main (line 103) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-最大1矩阵/f-最大1矩阵/main.cpp function Run (line 19) | int Run(const int &m, const int &n) // a[1...m][1...n] function main (line 74) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-最大团问题/f-最大团问题/main.cpp function dfs (line 24) | int dfs(int n, int ns, int dep) function clique (line 60) | int clique(int n) function main (line 78) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-最大流/f-最大流/main.cpp type Edge (line 583) | struct Edge function init (line 592) | void init() function addedge (line 599) | void addedge(int u, int v, int w, int rw = 0) function BFS (line 615) | void BFS(int start, int end) function sap (line 642) | int sap(int start, int end, int N) FILE: ACM 模板代码/f-最小树形图/f-最小树形图/main.cpp type Edge (line 25) | struct Edge function zhuliu (line 34) | int zhuliu(int root, int n, int m) function main (line 113) | int main() FILE: ACM 模板代码/f-最小点割集/f-最小点割集/main.cpp function max_flow (line 16) | int max_flow(int n, int mat[][MAXN], int source, int sink) function min_vertex_cut (line 57) | int min_vertex_cut(int n, int mat[][MAXN], int source, int sink, int *set) function main (line 116) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-最小生成树/f-最小生成树/main.cpp type Edge (line 74) | struct Edge function addEdge (line 83) | void addEdge(int u, int v, int w) function cmp (line 91) | bool cmp(Edge a, Edge b) function find (line 97) | int find(int x) function Kruskal (line 109) | int Kruskal(int n) //传入点数，返回最小生成树的权值，如果不连通则返回-1 function main (line 144) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-最小费用流/f-最小费用流/main.cpp type edge (line 152) | struct edge method edge (line 157) | edge (int x, int y, typef cu, typef cv, typec cc) :u(x), v(y), cuv(cu)... method other (line 158) | int other(int p) method typef (line 162) | typef cap(int p) method typec (line 166) | typec ecost(int p) method addFlow (line 181) | void addFlow(int p, typef f) type network (line 187) | struct network function typec (line 247) | typec network::mincost(int ss, int tt) function main (line 307) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-最小路径覆盖/f-最小路径覆盖/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-最小边割集/f-最小边割集/main.cpp function max_flow (line 14) | int max_flow(int n, int mat[][MAXN], int source, int sink) function min_edge_cut (line 55) | int min_edge_cut(int n, int mat[][MAXN], int source, int sink, int set[]... function main (line 104) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-最少找钱币问题/f-最少找钱币问题/main.cpp function main (line 22) | int main() function DFS (line 48) | void DFS(int total, int p) FILE: ACM 模板代码/f-最短公共祖先/f-最短公共祖先/main.cpp function max (line 24) | inline int max(int a, int b) function kmp (line 29) | int kmp(int &i, int &j, char* str, char* pat) function main (line 68) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-最短路/f-最短路/main.cpp type Edge (line 206) | struct Edge method Edge (line 210) | Edge(int _v = 0, int _cost = 0) : v(_v), cost(_cost){} function addEdge (line 215) | void addEdge(int u, int v, int w) function SPFA (line 224) | bool SPFA(int start, int n) function main (line 269) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-最长公共子序列/f-最长公共子序列/main.cpp function LCS (line 15) | int LCS(const char *s1, const char *s2) function main (line 49) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-最长公共递增子序列/f-最长公共递增子序列/main.cpp function gcis (line 19) | int gcis(int a[], int la, int b[], int lb, int ans[]) FILE: ACM 模板代码/f-最长有序子序列/f-最长有序子序列/main.cpp function bsearch (line 17) | int bsearch(const int *f, int size, const int &a) function LIS (line 39) | int LIS(const int *a, const int &n) function main (line 58) | int main() FILE: ACM 模板代码/f-有上下界的流/f-有上下界的流/main.cpp function maxflow (line 29) | void maxflow(int n, int src, int sink) function limitflow (line 68) | int limitflow(int n, int src, int sink) function main (line 113) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-有向图强连通分支/f-有向图强连通分支/main.cpp function find_components (line 17) | int find_components(int n, int mat[][MAXN], int* id) function main (line 68) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-有向图最小树形图/f-有向图最小树形图/main.cpp type Edge (line 27) | struct Edge function iroot (line 33) | int iroot(int i) function dirTree (line 42) | int dirTree(int root, int nv, int ne) // root:树根 FILE: ACM 模板代码/f-有向图最小点基/f-有向图最小点基/main.cpp function base_vertex (line 18) | int base_vertex(int n, int mat[][MAXN], int* sets) function main (line 43) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-有向图的强连通分量/f-有向图的强连通分量/main.cpp type Edge (line 109) | struct Edge function addedge (line 123) | void addedge(int u, int v) function DFS1 (line 134) | void DFS1(int u) function DFS2 (line 148) | void DFS2(int u) function solve (line 163) | void solve(int n) // 点的编号从1开始 function main (line 188) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-树状数组/f-树状数组/main.cpp function Lowbit (line 47) | inline int Lowbit(const int &x) function Sum (line 52) | int Sum(int i, int j) function Update (line 68) | void Update(int i, int j, int num) FILE: ACM 模板代码/f-树链剖分/f-树链剖分/main.cpp type Edge (line 204) | struct Edge function init (line 219) | void init() function addedge (line 228) | void addedge(int u, int v) function dfs1 (line 236) | void dfs1(int u, int pre, int d) // 第一遍dfs求出fa,deep,num,son function getpos (line 256) | void getpos(int u,int sp) // 第二遍dfs求出top和p type Node (line 278) | struct Node function build (line 284) | void build(int i, int l, int r) function push_up (line 299) | void push_up(int i) function update (line 304) | void update(int i, int k, int val) // 更新线段树的第k个值为val function query (line 324) | int query(int i, int l, int r) // 查询线段树中[l,r]的最大值 function find (line 345) | int find(int u,int v) // 查询u->v边的最大值 function main (line 373) | int main() FILE: ACM 模板代码/f-棋盘分割/f-棋盘分割/main.cpp function main (line 36) | int main() function input (line 78) | void input() function reset (line 93) | void reset() function caluate (line 115) | double caluate(int i1, int j1, int i2, int j2) function dp (line 129) | void dp(int m, int si, int sj, int ei, int ej) FILE: ACM 模板代码/f-模线性方程（组）/f-模线性方程（组）/main.cpp function extgcd (line 19) | int extgcd(int a, int b, int &x, int &y) // 扩展GCD function modeq (line 34) | void modeq(int a, int b, int n) function china (line 61) | int china(int b[], int w[], int k) function main (line 85) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-次小生成树/f-次小生成树/main.cpp function Prim (line 30) | int Prim(int cost[][MAXN], int n) function main (line 81) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-欧拉函数PHI/f-欧拉函数PHI/main.cpp function phi_and_prime_table (line 104) | void phi_and_prime_table(int N) FILE: ACM 模板代码/f-母函数/f-母函数/main.cpp function main (line 24) | int main() FILE: ACM 模板代码/f-求A^B的约数之和/f-求A^B的约数之和/main.cpp function getPrime (line 18) | void getPrime() function getFactors (line 43) | int getFactors(long long x) function pow_m (line 76) | long long pow_m(long long a, long long n) function sum (line 93) | long long sum(long long p, long long n) function solve (line 114) | long long solve(long long A, long long B) function main (line 126) | int main() FILE: ACM 模板代码/f-求多边形重心/f-求多边形重心/main.cpp type point (line 15) | struct point function point (line 20) | point bcenter(point pnt[], int n) FILE: ACM 模板代码/f-求逆元/f-求逆元/main.cpp function powM (line 69) | long long powM(long long a, long long b, long long m) function inv (line 92) | long long inv(long long a, long long m) function main (line 97) | int main() FILE: ACM 模板代码/f-汉诺塔/f-汉诺塔/main.cpp function main (line 27) | int main() FILE: ACM 模板代码/f-生成树计数/f-生成树计数/main.cpp function sgn (line 105) | int sgn(double x) function det (line 122) | double det(double a[][MAXN], int n) function main (line 177) | int main() FILE: ACM 模板代码/f-稳定婚姻问题/f-稳定婚姻问题/main.cpp type People (line 15) | struct People method Init (line 21) | void Init() type R (line 27) | struct R function main (line 37) | int main() function Input (line 46) | void Input() function stableMatching (line 71) | void stableMatching() function Output (line 115) | void Output() FILE: ACM 模板代码/f-第K短路/f-第K短路/main.cpp type node (line 111) | struct node function init (line 126) | int init() function solve (line 160) | int solve() function main (line 201) | int main() FILE: ACM 模板代码/f-素数相关/f-素数相关/main.cpp function witness (line 186) | int witness(int a, int n) function miller (line 206) | int miller(int n, int s = 50) FILE: ACM 模板代码/f-约瑟夫环问题/f-约瑟夫环问题/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-线性方程组/f-线性方程组/main.cpp function gaussCpivot (line 25) | int gaussCpivot(int n, double a[][MAXN], double b[]) function gaussTpivot (line 78) | int gaussTpivot(int n, double a[][MAXN], double b[]) function main (line 158) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-线段树/f-线段树/main.cpp type node (line 199) | struct node function build (line 205) | void build(int st, int ed, int v) // 建树,区间为[st, ed] function UpData (line 220) | void UpData(int v) // 更新结点区间的测度 function insert (line 246) | void insert(int st, int ed, int v) function Delete (line 267) | void Delete(int st, int ed, int v) type line (line 288) | struct line function cmp (line 294) | bool cmp(line t1, line t2) // 为线段排序的函数,方便从左向右的扫描 function main (line 301) | int main() function cal_C (line 338) | void cal_C(int n) FILE: ACM 模板代码/f-线索二叉树/f-线索二叉树/main.cpp type BiThrNode (line 18) | struct BiThrNode type BiThrNode (line 21) | struct BiThrNode function CreateBiThrTree (line 30) | void CreateBiThrTree(BiThrTree *T) function InThreading (line 53) | void InThreading(BiThrTree T) function InOrderThreading (line 78) | void InOrderThreading(BiThrTree *p, BiThrTree T) function visit (line 101) | void visit(char c) function InOrderTraverse (line 109) | void InOrderTraverse( BiThrTree T ) function main (line 135) | int main() FILE: ACM 模板代码/f-组合数C(n, r)/f-组合数C(n, r)/main.cpp function com (line 13) | int com(int n, int r) // return C(n, r) function main (line 31) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-莫比乌斯反演/f-莫比乌斯反演/main.cpp function Moblus (line 22) | void Moblus() function main (line 54) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-莫队算法/f-莫队算法/main.cpp type Point (line 134) | struct Point function cmp (line 139) | bool cmp(Point a, Point b) type BIT (line 152) | struct BIT method init (line 155) | void init() type Edge (line 163) | struct Edge function cmpedge (line 168) | bool cmpedge(Edge a, Edge b) function find (line 177) | int find(int x) function addedge (line 189) | void addedge(int u, int v, int d) type Graph (line 197) | struct Graph function _addedge (line 204) | void _addedge(int u, int v) function lowbit (line 212) | int lowbit(int x) function update (line 217) | void update(int i, int val, int pos) function ask (line 231) | int ask(int i, int m) function dist (line 246) | int dist(Point a, Point b) function Manhattan_minimum_spanning_tree (line 251) | void Manhattan_minimum_spanning_tree(int n, Point p[]) type Ans (line 314) | struct Ans function add (line 321) | void add(int l, int r) function del (line 332) | void del(int l, int r) function dfs (line 343) | void dfs(int l1, int r1, int l2, int r2, int idx, int pre) function gcd (line 391) | long long gcd(long long a, long long b) function main (line 403) | int main() FILE: ACM 模板代码/f-赫夫曼编码/f-赫夫曼编码/huffman.cpp function htTree (line 15) | htTree *buildTree(char *inputString) function traverseTree (line 74) | void traverseTree(htNode *treeNode, hlTable ** table, int k, char code[2... function hlTable (line 112) | hlTable *buildTable(htTree *huffmanTree) function encode (line 126) | void encode(hlTable *table, char *stringToEncode) function decode (line 146) | void decode(htTree *tree, char *stringToDecode) FILE: ACM 模板代码/f-赫夫曼编码/f-赫夫曼编码/huffman.hpp type _htNode (line 14) | struct _htNode // 树结点 type _htNode (line 17) | struct _htNode type _htTree (line 20) | struct _htTree // 树 type _hlNode (line 25) | struct _hlNode // 表结点 type _hlNode (line 29) | struct _hlNode type _hlTable (line 32) | struct _hlTable // 表 FILE: ACM 模板代码/f-赫夫曼编码/f-赫夫曼编码/main.cpp function main (line 12) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-赫夫曼编码/f-赫夫曼编码/queue.cpp function initPQueue (line 13) | void initPQueue(pQueue **queue) function addPQueue (line 22) | void addPQueue(pQueue **queue, TYPE val, unsigned int priority) function TYPE (line 80) | TYPE getPQueue(pQueue **queue) FILE: ACM 模板代码/f-赫夫曼编码/f-赫夫曼编码/queue.hpp type _pQueueNode (line 18) | struct _pQueueNode // 队列结点 type _pQueueNode (line 22) | struct _pQueueNode type _pQueue (line 25) | struct _pQueue // 队列 FILE: ACM 模板代码/f-逆序数/f-逆序数/main.cpp function main (line 81) | int main() FILE: ACM 模板代码/f-邻接表/f-邻接表/main.cpp type Edge (line 14) | struct Edge type Edge (line 18) | struct Edge type Table (line 22) | struct Table function main (line 28) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-阶乘最后非零位/f-阶乘最后非零位/main.cpp function lastDigit (line 19) | int lastDigit(char *buf) function main (line 44) | int main(int argc, const char * argv[]) FILE: ACM 模板代码/f-集合划分问题/f-集合划分问题/main.cpp function NGetM (line 22) | void NGetM(int m, int n) // m 个数 n 个集合 function compute (line 53) | void compute(int m) function main (line 69) | int main(int argc, const char * argv[]) { FILE: ACM 模板代码/f-集合相关问题/f-集合相关问题/main.cpp class SeqList (line 326) | class SeqList method SeqList (line 329) | SeqList(){length=0;} method SeqList (line 330) | SeqList(T a[],int n)//带参构造函数 method SeqList (line 338) | SeqList(const SeqList&A)//A中元素的值不变 method Length (line 344) | int Length()//求长度 method T (line 348) | T Get(int i) method Locate (line 352) | int Locate(T item)//查找相同的元素 method Insert (line 363) | void Insert(int i,T item)//插入操作，在第i个位置前插入一个元素item method T (line 381) | T Delete(int i)//删除操作 method display (line 398) | void display()//输出操作 method empty (line 403) | int empty()//判断是否为空 method clear (line 409) | void clear()//清理 function Union (line 418) | SeqListUnion(SeqListA,SeqList B)//集合的交集运算 function Toge (line 444) | SeqListToge(SeqListA,SeqList B)//集合的并集运算 function Subm (line 478) | SeqListSubm(SeqListA,SeqList B)//集合的差集运算 function main (line 511) | int main() FILE: ACM 模板代码/f-高斯消元/f-高斯消元/main.cpp function Gauss (line 27) | int Gauss() function main (line 74) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/51Nod/f-51Nod-1000-A+B/f-51Nod-1000-A+B/main.c function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1001-数组中和等于K的数对/f-51Nod-1001-数组中和等于K的数对/main.cpp type node (line 68) | struct node function cmp (line 73) | int cmp(node x, node y) function main (line 82) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1002-数塔取数问题/f-51Nod-1002-数塔取数问题/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1003-阶乘后面的0的数量/f-51Nod-1003-阶乘后面的0的数量/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1004-n^n的末位数字/f-51Nod-1004-n^n的末位数字/main.c function main (line 12) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1005-大数加法/f-51Nod-1005-大数加法/main.c function Carrying (line 17) | void Carrying(int tag, int i, int *p) function Abdicate (line 30) | void Abdicate(int tag, int i, int *p) function size (line 43) | void size(int numOneLen, int numTwoLen) function addOrSub (line 82) | void addOrSub(int numOneLen, int numTwoLen, int flag) //flag加法为1减法为0 function print (line 140) | void print() function main (line 158) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1006-Tick and Tick/f-51Nod-1006-Tick and Tick/main.cpp function MAX (line 30) | inline double MAX(double a, double b, double c) function MIN (line 44) | inline double MIN(double a, double b, double c) function main (line 58) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1006-最长公共子序列Lcs/f-51Nod-1006-最长公共子序列Lcs/main.c function max (line 17) | short max(short a, short b, short c) function main (line 26) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1007-正整数分组/f-51Nod-1007-正整数分组/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1008-N的阶乘 mod P/f-51Nod-1008-N的阶乘 mod P/main.c function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1009-数字1的数量/f-51Nod-1009-数字1的数量/main.cpp function getlen (line 80) | int getlen(int n) function main (line 91) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1010-只包含2 3 5的数/f-51Nod-1010-只包含2 3 5的数/main.cpp function init (line 28) | void init() function bs (line 56) | int bs(ull a[], int l, int h, ull v) function main (line 74) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1011-最大公约数GCD/f-51Nod-1011-最大公约数GCD/main.c function gcd (line 11) | long gcd(long a, long b) function main (line 24) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1012-最小公倍数LCM/f-51Nod-1012-最小公倍数LCM/main.c function lcm (line 29) | long long lcm(long long A, long long B) function main (line 44) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1013-3的幂的和/f-51Nod-1013-3的幂的和/main.c type ll (line 140) | typedef long long ll; function ll (line 142) | ll mod_pow(ll x,ll n) function main (line 155) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1014-X^2 Mod P/f-51Nod-1014-X^2 Mod P/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1015-水仙花数/f-51Nod-1015-水仙花数/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1016-水仙花数 V2/f-51Nod-1016-水仙花数 V2/main.c function compare (line 12) | int compare(char *a, char *b, int len) function main (line 28) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1018-排序/f-51Nod-1018-排序/main.c function swap (line 12) | void swap(long *A, int low, int high) function Partition (line 24) | int Partition(long *A, int low, int high) function QSort (line 43) | void QSort(long *A, int low, int high) function sort (line 54) | void sort(long *A, int N) function main (line 59) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1019-逆序数/f-51Nod-1019-逆序数/main.c function merge (line 162) | void merge(int *a, int *b, int m, int mid, int n) function Mergesort (line 184) | void Mergesort(int *a, int *b, int i, int j) function main (line 197) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1020-逆序排序/f-51Nod-1020-逆序排序/main.cpp function init (line 19) | void init() function main (line 36) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1021-石子归并/f-51Nod-1021-石子归并/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1022-石子归并 V2/f-51Nod-1022-石子归并 V2/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1023-石子归并 V3/f-51Nod-1023-石子归并 V3/main.cpp function dfs (line 24) | void dfs(int now) function main (line 48) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1024-矩阵中不重复的元素/f-51Nod-1024-矩阵中不重复的元素/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1027-大数乘法/f-51Nod-1027-大数乘法/main.c function main (line 14) | int main(int argc, const char * argv[]) function Carrying (line 65) | void Carrying(int tag,int i,int j,int *p) FILE: 按 OJ 分类/51Nod/f-51Nod-1028-大数乘法 V2/f-51Nod-1028-大数乘法 V2/main.cpp type Complex (line 19) | struct Complex method Complex (line 22) | Complex(double _x = 0.0, double _y = 0.0) method Complex (line 27) | Complex operator - (const Complex &b) const method Complex (line 31) | Complex operator + (const Complex &b) const method Complex (line 35) | Complex operator * (const Complex &b) const function change (line 44) | void change(Complex y[], int len) function fft (line 72) | void fft(Complex y[], int len, int on) function conv (line 102) | void conv(Complex a[], Complex b[], int ans[], int len) function turn (line 120) | void turn(int ans[], int len, int unit) function init (line 134) | void init(char str_1[], char str_2[]) function solve (line 170) | void solve() function main (line 187) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1029-大数除法/f-51Nod-1029-大数除法/main.cpp function powermod (line 18) | int powermod(int a, int exp, int moder) function addminus (line 32) | void addminus(int *a, int *b, int &lengtha, int &lengthb, int type) type BigInteger (line 43) | struct BigInteger method BigInteger (line 53) | BigInteger() method clear (line 59) | void clear() method read (line 65) | void read() method write (line 80) | void write() method T (line 97) | T tointeger() method equal (line 107) | bool equal(const BigInteger &p) const & method greater (line 123) | bool greater(const BigInteger &p) const & method leftshift (line 147) | void leftshift(int dis) method rightshift (line 157) | void rightshift(int dis) method addone (line 171) | void addone() method minusone (line 193) | void minusone() method absgreaterequal (line 200) | bool absgreaterequal(BigInteger &q) method abs (line 220) | void abs() method neg (line 225) | void neg() method assign (line 230) | void assign(BigInteger &q) method assign (line 239) | void assign(T q) method add (line 254) | void add(BigInteger &q) method minus (line 283) | void minus(BigInteger &q) method NTT (line 290) | void NTT(int *a, int length, int type) method mult (line 328) | void mult(BigInteger &q) method mult (line 356) | void mult(int q) method power (line 379) | void power(int exp) method divide (line 398) | void divide(BigInteger &q) method divide (line 451) | int divide(int q) method sqrt (line 474) | void sqrt() function main (line 525) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1030-大数进制转换/f-51Nod-1030-大数进制转换/main.cpp function cTon (line 33) | int cTon(char c) function convert (line 43) | void convert() function solve (line 58) | void solve() function print_d (line 88) | inline void print_d(T x) function output (line 97) | void output() function init (line 113) | void init() function main (line 126) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1031-骨牌覆盖/f-51Nod-1031-骨牌覆盖/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1032-骨牌覆盖 V2/f-51Nod-1032-骨牌覆盖 V2/main.cpp function dfs (line 27) | void dfs(int col, int pre, int now) function mul (line 44) | void mul(ll ret[][MAXN], ll a[][MAXN], ll b[][MAXN]) function main (line 62) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1033-骨牌覆盖 V2/f-51Nod-1033-骨牌覆盖 V2/main.cpp function dfs (line 27) | void dfs(int col, int pre, int now) function mul (line 44) | void mul(ll ret[][MAXN], ll a[][MAXN], ll b[][MAXN]) function main (line 62) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1035-最长的循环节/f-51Nod-1035-最长的循环节/main.cpp function euler (line 14) | int euler(int n) function main (line 37) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1038-X^A Mod P/f-51Nod-1038-X^A Mod P/main.cpp function ll (line 21) | ll qk_pow(ll a, ll b, ll mod) function ll (line 36) | ll ex_gcd(ll a, ll b, ll &x, ll &y) function check (line 54) | bool check(ll g, ll p) function ll (line 68) | ll primitive_root(ll p) type sa (line 98) | struct sa function ll (line 114) | ll discerte_log(ll x, ll n, ll m) function residue (line 154) | vector residue(ll p, ll n, ll a) function main (line 193) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1040-最大公约数之和/f-51Nod-1040-最大公约数之和/main.cpp function euler (line 17) | unsigned euler(unsigned x) function main (line 38) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1042-数字0~9的数量/f-51Nod-1042-数字0~9的数量/main.cpp function init (line 22) | void init() function ll (line 33) | ll count(ll x, int place) // 数是x，查询的数位是place function main (line 76) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1043-幸运号码/f-51Nod-1043-幸运号码/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1046-A^B Mod C/f-51Nod-1046-A^B Mod C/main.c function PowerMod (line 36) | long PowerMod(long long A, long long B, long long C) function main (line 52) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1049-最大子段和/f-51Nod-1049-最大子段和/main.c function solve (line 52) | long long solve() function main (line 66) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1050-循环数组最大子段和/f-51Nod-1050-循环数组最大子段和/main.cpp function ll (line 21) | ll MaxSubStringOne(ll *A, int n) function ll (line 34) | ll MaxSubStringTwo(ll *A, int n, ll sum) function main (line 47) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1051-最大子矩阵和/f-51Nod-1051-最大子矩阵和/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1052-最大M子段和/f-51Nod-1052-最大M子段和/main.cpp function main (line 27) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1053-最大M子段和 V2/f-51Nod-1053-最大M子段和 V2/main.cpp function scan_d (line 23) | inline bool scan_d(T &ret) function _erase (line 51) | void _erase(int x) function main (line 64) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1054-最长等差数列/f-51Nod-1054-最长等差数列/main.cpp function main (line 20) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1055-最长等差数列/f-51Nod-1055-最长等差数列/main.cpp function main (line 18) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1056-最长等差数列 V2/f-51Nod-1056-最长等差数列 V2/main.cpp function read (line 26) | inline int read(){ function exist (line 32) | inline bool exist(int v){ function insert (line 38) | inline void insert(int v){ function main (line 42) | int main(){ FILE: 按 OJ 分类/51Nod/f-51Nod-1057-N的阶乘/f-51Nod-1057-N的阶乘/main.c function main (line 83) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1058-N的阶乘的长度/f-51Nod-1058-N的阶乘的长度/main.c function main (line 58) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1059-N的阶乘 V2/f-51Nod-1059-N的阶乘 V2/main.cpp type complex (line 18) | struct complex method complex (line 22) | complex(double real1 = 0.0, double imag1 = 0.0) function complex (line 35) | complex operator * (const complex &n1, const complex &n2) method complex (line 22) | complex(double real1 = 0.0, double imag1 = 0.0) function complex (line 40) | complex operator + (const complex &n1, const complex &n2) method complex (line 22) | complex(double real1 = 0.0, double imag1 = 0.0) function complex (line 45) | complex operator - (const complex &n1, const complex &n2) method complex (line 22) | complex(double real1 = 0.0, double imag1 = 0.0) type BigInteger (line 66) | struct BigInteger function Reverse (line 75) | void Reverse(int N, int bitlength) function DFT (line 88) | void DFT(complex *A, complex *w1, complex *e, int N) function Multiplication (line 123) | void Multiplication(int l1, int r1, int l2, int r2, int *a, int *b, int ... function Print (line 208) | void Print(int len, int *a) function factorial (line 264) | void factorial() function init (line 303) | void init(int n) function main (line 364) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1060-最复杂的数/f-51Nod-1060-最复杂的数/main.cpp function dfs (line 20) | void dfs(ll cur, ll num, int key, ll pre) // 当前值/当前约数数量/当前深度/上一个数 function solve (line 54) | void solve() function main (line 63) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1062-序列中的最大数/f-51Nod-1062-序列中的最大数/main.cpp function init (line 20) | void init() function main (line 51) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1063-序列中最大的数 V2/f-51Nod-1063-序列中最大的数 V2/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/51Nod/f-51Nod-1065-最小正子段和/f-51Nod-1065-最小正子段和/main.cpp type node (line 15) | struct node function cmp (line 21) | bool cmp(node &a, node &b) function main (line 26) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1066-Bash游戏/f-51Nod-1066-Bash游戏/main.c function bash (line 18) | int bash(int N, int K) function main (line 25) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1067-Bash游戏 V2/f-51Nod-1067-Bash游戏 V2/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1068-Bash游戏 V3/f-51Nod-1068-Bash游戏 V3/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1069-Nim游戏/f-51Nod-1069-Nim游戏/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1070-Bash游戏 V4/f-51Nod-1070-Bash游戏 V4/main.cpp function init (line 16) | void init() function bs (line 28) | int bs(int a[], int l, int h, int N) function main (line 50) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1072-威佐夫游戏/f-51Nod-1072-威佐夫游戏/main.c function main (line 12) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1073-约瑟夫环/f-51Nod-1073-约瑟夫环/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1074-约瑟夫环 V2/f-51Nod-1074-约瑟夫环 V2/main.cpp function main (line 15) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1076-2条不相交的路径/f-51Nod-1076-2条不相交的路径/main.cpp function init (line 34) | void init() function tarjan (line 46) | void tarjan(int u, int fa) function solve (line 81) | void solve() function main (line 92) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1079-中国剩余定理/f-51Nod-1079-中国剩余定理/main.c function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1080-两个数的平方和/f-51Nod-1080-两个数的平方和/main.cpp function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1081-子段求和/f-51Nod-1081-子段求和/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1082-与7无关的数/f-51Nod-1082-与7无关的数/main.cpp function debug (line 20) | void debug() function init (line 29) | void init() function solve (line 55) | void solve() function main (line 73) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1083-矩阵取数问题/f-51Nod-1083-矩阵取数问题/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1084-矩阵取数问题 V2/f-51Nod-1084-矩阵取数问题 V2/main.cpp function input (line 24) | void input() function solve (line 37) | void solve() function main (line 65) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1085-背包问题/f-51Nod-1085-背包问题/main.c function KanpSack (line 15) | int KanpSack(int N, int *Wi, int *Pi, int W) function main (line 45) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1086-背包问题 V2/f-51Nod-1086-背包问题 V2/main.cpp function ZeroOnepark (line 130) | void ZeroOnepark(int val, int vol) function Completepark (line 139) | void Completepark(int val, int vol) function Multiplepark (line 148) | void Multiplepark(int val, int vol, int amount) function main (line 170) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1087-1 10 100 1000/f-51Nod-1087-1 10 100 1000/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1088-最长回文子串/f-51Nod-1088-最长回文子串/main.c function main (line 69) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1089-最长回文子串 V2（Manacher算法）/f-51Nod-1089-最长回文子串 V2（Manacher算法）/main.c function main (line 16) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1090-3个数和为0/f-51Nod-1090-3个数和为0/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1091-线段的重叠/f-51Nod-1091-线段的重叠/main.cpp type line (line 17) | struct line function cmp (line 22) | bool cmp(line a, line b) function main (line 27) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1092-回文字符串/f-51Nod-1092-回文字符串/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1093-骆驼和香蕉/f-51Nod-1093-骆驼和香蕉/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1094-和为k的连续区间/f-51Nod-1094-和为k的连续区间/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1095-Anigram单词/f-51Nod-1095-Anigram单词/main.cpp function main (line 16) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1096-距离之和最小/f-51Nod-1096-距离之和最小/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1097-拼成最小的数/f-51Nod-1097-拼成最小的数/main.cpp type num (line 20) | struct num function cmp (line 27) | bool cmp(num a, num b) function main (line 79) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1098-最小方差/f-51Nod-1098-最小方差/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1099-任务执行顺序/f-51Nod-1099-任务执行顺序/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1100-斜率最大/f-51Nod-1100-斜率最大/main.cpp type point (line 17) | struct point function cmp_p (line 23) | bool cmp_p(point a, point b) type line (line 28) | struct line function cmp_l (line 34) | bool cmp_l(line a, line b) function main (line 39) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1101-换零钱/f-51Nod-1101-换零钱/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1102-面积最大的矩形/f-51Nod-1102-面积最大的矩形/main.cpp type a (line 19) | struct a function main (line 26) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1103-N的倍数/f-51Nod-1103-N的倍数/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1105-第K大的数/f-51Nod-1105-第K大的数/main.cpp function ll (line 29) | ll check(ll x) function main (line 50) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1106-质数检测/f-51Nod-1106-质数检测/main.c function main (line 17) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1107-斜率小于0的连线数量/f-51Nod-1107-斜率小于0的连线数量/main.cpp type node (line 107) | struct node function cmp (line 122) | inline bool cmp(const node &nd1, const node &nd2) function sum (line 127) | inline int sum(int i, int *bit) function add (line 137) | inline void add(int i, int adder, int *bit) function main (line 145) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1108-距离之和最小 V2/f-51Nod-1108-距离之和最小 V2/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1109-01组成的N的倍数/f-51Nod-1109-01组成的N的倍数/main.cpp type node (line 17) | struct node function DFS (line 27) | void DFS(int pos) function BFS (line 40) | void BFS() function main (line 78) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1110-距离之和最小 V3/f-51Nod-1110-距离之和最小 V3/main.cpp type point (line 16) | struct point function cmp (line 22) | bool cmp(point a, point b) function main (line 27) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1112-KGold/f-51Nod-1112-KGold/main.cpp function intersection (line 118) | pair intersection(ll x1, ll y1, ll x2, ll y2, ll x3, ll ... type node (line 134) | struct node type RESULT (line 146) | struct RESULT function cmp_1 (line 152) | bool cmp_1(const node &nd1, const node &nd2) function cmp_2 (line 157) | bool cmp_2(const RESULT &p1, const RESULT &p2) function g_times (line 170) | int g_times(int time) function main (line 188) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1113-矩阵快速幂/f-51Nod-1113-矩阵快速幂/main.cpp type mat (line 20) | struct mat function mat (line 26) | mat operator * (mat a, mat b) function init_unit (line 45) | void init_unit() function mat (line 54) | mat pow_mat(mat a, LL n) function main (line 70) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1116-K进制下的大数/f-51Nod-1116-K进制下的大数/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1117-聪明的木匠/f-51Nod-1117-聪明的木匠/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1118-机器人走方格/f-51Nod-1118-机器人走方格/main.c function path (line 37) | int path(int M, int N) function main (line 52) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1119-机器人走方格 V2/f-51Nod-1119-机器人走方格 V2/main.cpp function ll (line 18) | ll extend_gcd(ll a, ll b, ll &x, ll &y) function ll (line 37) | ll mod_reverse(ll a, ll n) function ll (line 51) | ll c(ll m, ll n) function main (line 66) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1120-机器人走方格 V3/f-51Nod-1120-机器人走方格 V3/main.cpp function QPow (line 20) | int QPow(int x, int n) function init (line 38) | void init() function C (line 52) | inline int C(int n, int m) function lucas (line 61) | inline int lucas(int n, int m) function main (line 66) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1122-机器人走方格 V4/f-51Nod-1122-机器人走方格 V4/main.cpp type mat (line 23) | struct mat function mat (line 29) | mat operator * (mat a, mat &b) function init_unit (line 50) | void init_unit() function mat (line 59) | mat pow_mat(mat a, LL n) function main (line 74) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1124-N!的非0最低位/f-51Nod-1124-N!的非0最低位/main.cpp function last_digit (line 18) | int last_digit() function main (line 48) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1125-交换机器的最小代价/f-51Nod-1125-交换机器的最小代价/main.cpp type machin (line 17) | struct machin function solve (line 26) | long long solve(int k) function cmp (line 44) | bool cmp(const machin a, const machin b) function main (line 49) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1126-求递推序列的第N项/f-51Nod-1126-求递推序列的第N项/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1127-最短的包含字符串/f-51Nod-1127-最短的包含字符串/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1128-正整数分组 V2/f-51Nod-1128-正整数分组 V2/main.cpp function check (line 21) | int check(ll num) function ll (line 44) | ll bs(ll l, ll r) function main (line 61) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1130-N的阶乘的长度 V2（斯特林近似）/f-51Nod-1130-N的阶乘的长度 V2（斯特林近似）/main.c function main (line 14) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1131-覆盖数字的数量/f-51Nod-1131-覆盖数字的数量/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1133-不重叠的线段/f-51Nod-1133-不重叠的线段/main.cpp type line (line 17) | struct line function cmp (line 22) | bool cmp(line a, line b) function main (line 27) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1134-最长递增子序列/f-51Nod-1134-最长递增子序列/main.c function upper_bound (line 48) | int upper_bound(int len, int A) function list (line 61) | int list(int n) function main (line 71) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1135-原根/f-51Nod-1135-原根/main.c function store (line 19) | void store() function QPow (line 44) | long long QPow(long long x, long long n) function check (line 63) | int check(int g) function solve (line 76) | int solve() function main (line 88) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1136-欧拉函数/f-51Nod-1136-欧拉函数/main.cpp function euler (line 14) | long long euler(long long x) function main (line 35) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1137-矩阵乘法/f-51Nod-1137-矩阵乘法/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1138-连续整数的和/f-51Nod-1138-连续整数的和/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1140-矩阵相乘结果的判断/f-51Nod-1140-矩阵相乘结果的判断/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1149-Pi的递推式/f-51Nod-1149-Pi的递推式/main.cpp function QPow (line 26) | int QPow(int x, int y) function C (line 43) | int C(int n, int m) function init (line 49) | void init() function main (line 63) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1153-选择子序列/f-51Nod-1153-选择子序列/main.cpp function max_ (line 81) | int max_(int a, int b) function main (line 86) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1154-回文串划分/f-51Nod-1154-回文串划分/main.cpp function search (line 22) | int search(int pos) function search_ (line 41) | int search_(int pos) function main (line 63) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1157-全是1的最大子矩阵/f-51Nod-1157-全是1的最大子矩阵/main.cpp function Run (line 18) | int Run(const int &m, const int &n) // a[1...m][1...n] function main (line 74) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1158-全是1的最大子矩阵/f-51Nod-1158-全是1的最大子矩阵/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1161-Partial Sums/f-51Nod-1161-Partial Sums/main.cpp function getInv (line 21) | void getInv() function init (line 32) | void init(int n, int k) function main (line 41) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1163-最高的奖励/f-51Nod-1163-最高的奖励/main.cpp type task (line 76) | struct task function cmp (line 85) | bool cmp(const task a, const task b) function find (line 90) | int find(int x) function main (line 106) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1166-大数开平方/f-51Nod-1166-大数开平方/main.cpp class BigInteger (line 20) | class BigInteger method apply (line 30) | void apply(int length) method destroy (line 40) | void destroy() method resize (line 50) | void resize(int length) method BigInteger (line 70) | BigInteger(int length) : length(length), sig(0) method BigInteger (line 75) | BigInteger(const BigInteger &p, int length) : length(length), sig(p.sig) method absgreaterequal (line 81) | bool absgreaterequal(const BigInteger &q) const & method BigInteger (line 101) | BigInteger operator << (const int &dis) const & method BigInteger (line 114) | BigInteger operator >> (const int &dis) const & method powermod (line 126) | int powermod(int a, int exp) const & method NTT (line 140) | void NTT(int *a, int length, int type) const & method divide (line 176) | int divide(BigInteger &p, const int &q) const & method BigInteger (line 204) | BigInteger() : length(0), sig(0) { a = nullptr; } method BigInteger (line 205) | BigInteger(const BigInteger &p) : length(p.length), sig(p.sig) method getlength (line 210) | int getlength() { return length; } method positive (line 211) | bool positive() { return sig > 0; } method iszero (line 212) | bool iszero() { return !sig; } method negative (line 213) | bool negative() { return sig < 0; } method even (line 214) | bool even() { return !sig || !(a[0] & 1); } method BigInteger (line 216) | BigInteger &operator = (const BigInteger &p) method BigInteger (line 227) | BigInteger &operator = (const T &p) method read (line 241) | void read() method write (line 269) | void write() method T (line 286) | T tointeger() method BigInteger (line 336) | BigInteger &operator ++ () method BigInteger (line 354) | BigInteger &operator -- () method BigInteger (line 362) | BigInteger operator ++ (int) method BigInteger (line 369) | BigInteger operator -- (int) method BigInteger (line 376) | BigInteger operator + (const BigInteger &p) const & method BigInteger (line 409) | BigInteger operator - () const & method BigInteger (line 416) | BigInteger operator - (const BigInteger &p) const & { return *this + (... method BigInteger (line 418) | BigInteger operator * (const BigInteger &p) const & method BigInteger (line 448) | BigInteger operator * (const int &p) const & method BigInteger (line 474) | BigInteger operator / (const BigInteger &p) const & method BigInteger (line 520) | BigInteger operator / (const int &p) const & method BigInteger (line 528) | BigInteger sqrt() const & method BigInteger (line 578) | BigInteger operator % (const BigInteger &p) const & method BigInteger (line 597) | BigInteger operator * (const int &q, const BigInteger &p) { return p *... method BigInteger (line 598) | BigInteger &operator += (const BigInteger &p) { *this = *this + p; ret... method BigInteger (line 599) | BigInteger &operator -= (const BigInteger &p) { *this = *this - p; ret... method BigInteger (line 600) | BigInteger &operator *= (const BigInteger &p) { *this = *this * p; ret... method BigInteger (line 601) | BigInteger &operator *= (const int &p) { *this = *this * p; return *th... method BigInteger (line 602) | BigInteger &operator /= (const BigInteger &p) { *this = *this / p; ret... method BigInteger (line 603) | BigInteger &operator /= (const int &p) { *this = *this / p; return *th... method BigInteger (line 604) | BigInteger &operator %= (const BigInteger &p) { *this = *this % p; ret... method BigInteger (line 605) | BigInteger &operator %= (const int &p) { *this = *this % p; return *th... method BigInteger (line 608) | BigInteger power(T exp) const & function main (line 626) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1174-区间中最大数/f-51Nod-1174-区间中最大数/main.cpp function initRMQ (line 22) | void initRMQ(int n, int b[]) function rmq (line 40) | int rmq(int x, int y) function main (line 46) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1175-区间中第K大的数/f-51Nod-1175-区间中第K大的数/main.cpp function Init_hash (line 22) | void Init_hash() function build (line 32) | int build(int l, int r) function hash_ (line 44) | int hash_(int x) function update (line 49) | int update(int root, int pos, int val) function query (line 78) | int query(int left_root, int right_root, int k) function main (line 101) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1179-最大的最大公约数/f-51Nod-1179-最大的最大公约数/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1181-质数中的质数（质数筛法）/f-51Nod-1181-质数中的质数（质数筛法）/main.cpp function getPrime (line 22) | void getPrime() function main (line 42) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1182-完美字符串/f-51Nod-1182-完美字符串/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1183-编辑距离/f-51Nod-1183-编辑距离/main.cpp function main (line 23) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1184-第N个质数/f-51Nod-1184-第N个质数/main.cpp function ll (line 22) | ll g(ll n, int m) function check (line 50) | bool check(ll x) function init (line 56) | void init() function main (line 87) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1185-威佐夫游戏 V2/f-51Nod-1185-威佐夫游戏 V2/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1186-质数检测 V2/f-51Nod-1186-质数检测 V2/main.cpp type bnum (line 19) | struct bnum method read (line 24) | void read() method bnum (line 54) | bnum & operator = (const int x) method bnum (line 61) | bnum operator + (const bnum &x) method bnum (line 74) | bnum operator - (const bnum &x) method bnum (line 95) | bnum operator % (const bnum &x) method bnum (line 112) | bnum & div2() method is_odd (line 124) | bool is_odd() method is_zero (line 129) | bool is_zero() function mulmod (line 142) | void mulmod(bnum &a0, bnum &b0, bnum &p, bnum &ans) function powmod (line 157) | void powmod(bnum &a0, bnum &b0, bnum &p, bnum &ans) function MillerRabinTest (line 172) | bool MillerRabinTest(bnum &p, int iter) function main (line 239) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1188-最大公约数之和 V2/f-51Nod-1188-最大公约数之和 V2/main.cpp function get_phi (line 25) | void get_phi() function init (line 58) | void init() function scan_d (line 85) | inline void scan_d(T &ret) function print_d (line 97) | inline void print_d(T x) function main (line 106) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1189-阶乘分数/f-51Nod-1189-阶乘分数/main.cpp function getPrime (line 29) | void getPrime() function ll (line 49) | ll qPow(ll a, ll n) function main (line 64) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1191-消灭兔子/f-51Nod-1191-消灭兔子/main.cpp function main (line 128) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1192-Gcd表中的质数/f-51Nod-1192-Gcd表中的质数/main.cpp function init (line 26) | void init() function main (line 68) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1195-斐波那契数列的循环节/f-51Nod-1195-斐波那契数列的循环节/main.cpp function getFib (line 18) | void getFib() function main (line 26) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1196-字符串的数量/f-51Nod-1196-字符串的数量/main.cpp function add (line 327) | void add(ll &x, ll y) function ll (line 349) | ll modAdd(ll a, ll b) function ll (line 355) | ll modMul(ll a , ll b) function multiply (line 361) | void multiply(const vector &Q, vector &Qr) function cal (line 380) | void cal(ll *A, ll n, ll k, ll *C) function power (line 432) | int power(ll x, ll y) function guass (line 446) | void guass(ll n) function Count (line 487) | long long Count(vector A, ll R) function main (line 503) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1197-字符串的数量 V2/f-51Nod-1197-字符串的数量 V2/main.cpp function add (line 22) | void add(ll &x, ll y) function ll (line 44) | ll modAdd(ll a, ll b) function ll (line 50) | ll modMul(ll a , ll b) function multiply (line 56) | void multiply(const vector &Q, vector &Qr) function cal (line 75) | void cal(ll *A, ll n, ll k, ll *C) function power (line 127) | int power(ll x, ll y) function guass (line 141) | void guass(ll n) function Count (line 182) | long long Count(vector A, ll R) function main (line 198) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1198-字符串的数量 V3/f-51Nod-1198-字符串的数量 V3/main.cpp function add (line 22) | void add(ll &x, ll y) function ll (line 44) | ll modAdd(ll a, ll b) function ll (line 50) | ll modMul(ll a , ll b) function multiply (line 56) | void multiply(const vector &Q, vector &Qr) function cal (line 75) | void cal(ll *A, ll n, ll k, ll *C) function power (line 127) | int power(ll x, ll y) function guass (line 141) | void guass(ll n) function Count (line 182) | long long Count(vector A, ll R) function main (line 198) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1199-Money out of Thin Air/f-51Nod-1199-Money out of Thin Air/main.cpp type edge (line 22) | struct edge method edge (line 27) | edge() function read (line 37) | int read() function add (line 52) | void add(int p, int pos) type node (line 69) | struct node function dfsI (line 78) | void dfsI(int x = 1, int pre = 0) function dfsII (line 96) | void dfsII(int x = 1) function build (line 113) | void build(int l = 1, int r = N, int x = 1) function pushdown (line 127) | void pushdown(int x, int cnt) function update1 (line 154) | void update1(int p, int add, int l, int r, int x) function update2 (line 167) | void update2(int tl, int tr, int add, int l, int r, int x) function ll (line 195) | ll query1(int p, int l, int r, int x) function ll (line 206) | ll query2(int tl, int tr, int l, int r, int x) function main (line 226) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1201-整数划分/f-51Nod-1201-整数划分/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1202-子序列个数/f-51Nod-1202-子序列个数/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1203-JZPLCM/f-51Nod-1203-JZPLCM/main.cpp type note (line 21) | struct note function QPow (line 39) | int QPow(int x, int y) function add (line 53) | void add(int x, int y) function find (line 61) | int find(int x) function main (line 72) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1204-Parity/f-51Nod-1204-Parity/main.cpp function find (line 16) | int find(int x) function join (line 25) | void join(int x, int y) function init (line 33) | void init() function main (line 41) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1205-流水线调度/f-51Nod-1205-流水线调度/main.cpp type task (line 17) | struct task function cmpA (line 23) | bool cmpA(task a, task b) function cmpB (line 28) | bool cmpB(task a, task b) function main (line 33) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1208-Stars in Your Window/f-51Nod-1208-Stars in Your Window/main.cpp type node1 (line 20) | struct node1 type node2 (line 26) | struct node2 type sta (line 33) | struct sta function cmp_1 (line 43) | bool cmp_1(double a, double b) function cmp_2 (line 48) | bool cmp_2(const node2 a, const node2 b) function build_tree (line 60) | void build_tree(int root, int L, int R) function add_tree (line 75) | void add_tree(int root, int L, int R, int c) function main (line 102) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1212-无向图最小生成树/f-51Nod-1212-无向图最小生成树/main.cpp function updata (line 27) | void updata(int x, int y, int v) function Prim (line 34) | int Prim(int cost[][MAXN], int n) // 0 ~ n - 1 function main (line 72) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1215-数组的宽度/f-51Nod-1215-数组的宽度/main.cpp type num (line 16) | struct num method num (line 22) | num() : maxLeft(1), maxRight(1), minLeft(1), minRight(1) {} function stackClear (line 30) | void stackClear() function getMax (line 38) | void getMax() function getMin (line 70) | void getMin() function solve (line 102) | void solve() function main (line 111) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1217-Minimum Modular/f-51Nod-1217-Minimum Modular/main.cpp function read (line 134) | inline void read(int &x) function main (line 148) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1220-约数之和/f-51Nod-1220-约数之和/main.cpp function inc (line 27) | inline void inc(int &x, int y) function dec (line 36) | inline void dec(int &x, int y) function num1 (line 45) | inline int num1(int x) function num1 (line 50) | inline int num1(int L, int R) function calc_imu (line 57) | int calc_imu(int x) function calc_imu (line 78) | inline int calc_imu(int L, int R) function calc_g (line 85) | int calc_g(int n) function calc_h (line 96) | int calc_h(int n) function main (line 107) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1222-最小公倍数计数/f-51Nod-1222-最小公倍数计数/main.cpp function init (line 27) | void init() function ll (line 57) | ll calc(ll n) function main (line 92) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1225-余数之和/f-51Nod-1225-余数之和/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1227-平均最小公倍数/f-51Nod-1227-平均最小公倍数/main.cpp function HX (line 28) | int HX(int q) function ll (line 39) | ll SM(ll s, ll t) function ll (line 44) | ll Gphi(int q) function ll (line 69) | ll Gans(int n) function init (line 81) | void init() function main (line 114) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1228-序列求和/f-51Nod-1228-序列求和/main.cpp function init (line 26) | void init() function main (line 56) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1230-幸运数/f-51Nod-1230-幸运数/main.cpp function init (line 29) | void init() function ll (line 52) | ll dfs(int pos, int sum, int sqrt_sum, int flag) function ll (line 76) | ll solve(ll n) function main (line 87) | int main(void) FILE: 按 OJ 分类/51Nod/f-51Nod-1232-完美数/f-51Nod-1232-完美数/main.cpp function ll (line 27) | ll gcd(ll x, ll y) function init (line 39) | void init() function ll (line 54) | ll dfs(ll n, ll tag = 1, ll lcm = 1, ll num = 0) function ll (line 92) | ll solve(ll x) function main (line 109) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1237-最大公约数之和 V3/f-51Nod-1237-最大公约数之和 V3/main.cpp function hash_ (line 27) | int hash_(ll x) function ll (line 37) | ll Gphi(ll n) function init (line 63) | void init() function main (line 98) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1238-最小公倍数之和 V3/f-51Nod-1238-最小公倍数之和 V3/main.cpp function HX (line 27) | int HX(ll q) function ll (line 37) | ll SM(ll s, ll t) function ll (line 47) | ll PF(ll q) function ll (line 53) | ll Gphi(ll q) function init (line 78) | void init() function main (line 112) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1239-欧拉函数之和/f-51Nod-1239-欧拉函数之和/main.cpp function add (line 32) | void add(int x, ll y, ll z) function ll (line 40) | ll cal(ll x) function init (line 67) | void init() function main (line 101) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1240-莫比乌斯函数/f-51Nod-1240-莫比乌斯函数/main.cpp function MOD (line 16) | int MOD(int a, int b) function miu (line 21) | int miu(int n) function main (line 49) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1241-特殊的排序/f-51Nod-1241-特殊的排序/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1242-斐波那契数列的第N项/f-51Nod-1242-斐波那契数列的第N项/main.cpp type MATRIX (line 17) | struct MATRIX function ANS_Cf (line 25) | void ANS_Cf(MATRIX a) function MATRIX (line 32) | MATRIX MATRIX_Cf(MATRIX a, MATRIX b) function MATRIX (line 53) | MATRIX MATRIX_Pow(MATRIX a, long long n) function main (line 72) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1243-排船的问题/f-51Nod-1243-排船的问题/main.cpp function judge (line 20) | int judge(int d) function bs (line 50) | int bs(int left, int right) function main (line 70) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1244-莫比乌斯函数之和/f-51Nod-1244-莫比乌斯函数之和/main.cpp function add (line 30) | void add(int x, ll y, int z) function ll (line 38) | ll cal(ll x) function init (line 64) | void init() function main (line 99) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1246-罐子和硬币/f-51Nod-1246-罐子和硬币/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1247-可能的路径/f-51Nod-1247-可能的路径/main.cpp function ll (line 17) | ll kgcd(ll a, ll b) function main (line 45) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1249-近似有序区间/f-51Nod-1249-近似有序区间/main.cpp function build (line 25) | void build(int rt, int l, int r) function query (line 40) | int query(int rt, int l, int r, int x, int y, int mx) function main (line 68) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1254-最大子段和 V2/f-51Nod-1254-最大子段和 V2/main.cpp function scan_d (line 26) | inline bool scan_d(T &ret) function main (line 48) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1255-字典序最小的子序列/f-51Nod-1255-字典序最小的子序列/main.cpp function main (line 96) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1256-乘法逆元/f-51Nod-1256-乘法逆元/main.cpp function extendGcd (line 17) | long long extendGcd(long long a, long long b, long long &x, long long &y) function modReverse (line 35) | long long modReverse(long long a, long long n) function main (line 49) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1257-背包问题 V3/f-51Nod-1257-背包问题 V3/main.cpp type article (line 21) | struct article function gcd (line 27) | int gcd(int a, int b) function cmp (line 36) | int cmp(article a, article b) function charge (line 41) | int charge(int &x, int &y, double m) function main (line 68) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1258-序列求和 V4/f-51Nod-1258-序列求和 V4/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/51Nod/f-51Nod-1259-整数划分 V2/f-51Nod-1259-整数划分 V2/main.cpp function main (line 21) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1262-扔球/f-51Nod-1262-扔球/main.cpp function euler (line 17) | unsigned euler(unsigned x) function main (line 38) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1264-线段相交/f-51Nod-1264-线段相交/main.cpp type point (line 15) | struct point function min (line 20) | double min(double a, double b) function max (line 25) | double max(double a, double b) function inter (line 30) | bool inter(point a, point b, point c, point d) function main (line 44) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1265-四点共面/f-51Nod-1265-四点共面/main.cpp type point (line 14) | struct point method point (line 17) | point operator - (point &o) function dot_product (line 27) | double dot_product(const point &a, const point &b) function point (line 32) | point cross_product(const point &a, const point &b) method point (line 17) | point operator - (point &o) function main (line 41) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1266-蚂蚁/f-51Nod-1266-蚂蚁/main.cpp function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1267-4个数和为0/f-51Nod-1267-4个数和为0/main.cpp type node (line 96) | struct node function init (line 104) | void init() function insert_hash (line 111) | int insert_hash(int x) function check_hash (line 121) | int check_hash(int x) function main (line 134) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1268-和为K的组合/f-51Nod-1268-和为K的组合/main.cpp function solve (line 133) | void solve() function main (line 177) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1270-数组的最大代价/f-51Nod-1270-数组的最大代价/main.cpp function main (line 52) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1272-最大距离/f-51Nod-1272-最大距离/main.cpp type node (line 80) | struct node function main (line 85) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1273-旅行计划/f-51Nod-1273-旅行计划/main.cpp type node (line 21) | struct node function add (line 29) | void add(int u, int v) type node2 (line 36) | struct node2 method node2 (line 40) | node2(int x_, int d_, int cnt_ = 0) : x(x_), d(d_), cnt(cnt_) {} function dfs (line 53) | void dfs(int x, int pr) function cmp (line 77) | bool cmp(node2 a, node2 b) function main (line 84) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1274-最长递增路径/f-51Nod-1274-最长递增路径/main.cpp type edge (line 16) | struct edge function cmp (line 25) | bool cmp(edge a, edge b) function main (line 30) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1275-连续子段的差异/f-51Nod-1275-连续子段的差异/main.cpp function solve (line 23) | void solve() function main (line 66) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1276-岛屿的数量/f-51Nod-1276-岛屿的数量/main.cpp type island (line 22) | struct island type query (line 28) | struct query function cmpI (line 34) | bool cmpI(island a, island b) function cmpQ (line 39) | bool cmpQ(query a, query b) function work (line 44) | void work() function main (line 96) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1277-字符串中的最大值/f-51Nod-1277-字符串中的最大值/main.cpp function getNext (line 21) | void getNext() function main (line 38) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1278-相离的圆/f-51Nod-1278-相离的圆/main.cpp type line (line 17) | struct line function cmp (line 23) | bool cmp(line a, line b) function bs (line 30) | int bs(line a[], int l, int h, int v) function main (line 48) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1279-扔盘子/f-51Nod-1279-扔盘子/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1280-前缀后缀集合/f-51Nod-1280-前缀后缀集合/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1281-山峰和旗子/f-51Nod-1281-山峰和旗子/main.cpp function get_peak_dis (line 104) | int get_peak_dis(int n) function get_peak (line 123) | int get_peak(int n) function can_value (line 138) | bool can_value(int n, int k) function search_value (line 156) | int search_value(int n) function main (line 175) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1282-时钟/f-51Nod-1282-时钟/main.cpp function input (line 144) | void input() function getMin (line 165) | int getMin(int *C) function solve (line 198) | void solve() function main (line 220) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1283-最小周长/f-51Nod-1283-最小周长/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1284-2 3 5 7的倍数/f-51Nod-1284-2 3 5 7的倍数/main.c type ll (line 11) | typedef long long ll; function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1285-山峰和分段/f-51Nod-1285-山峰和分段/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1287-加农炮/f-51Nod-1287-加农炮/main.cpp function main (line 74) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1288-汽油补给/f-51Nod-1288-汽油补给/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1289-大鱼吃小鱼/f-51Nod-1289-大鱼吃小鱼/main.c function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1293-球与切换器/f-51Nod-1293-球与切换器/main.cpp function main (line 144) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1294-修改数组/f-51Nod-1294-修改数组/main.cpp function bsearch (line 24) | int bsearch(const int *f, int size, const int &a) function LIS (line 46) | int LIS(const int *a, const int &n) function main (line 71) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1295-XOR key/f-51Nod-1295-XOR key/main.cpp function scan_d (line 26) | inline void scan_d(T &ret) function insert (line 37) | void insert(int v, int &x, int y) function find (line 49) | int find(int v, int x, int y) function main (line 62) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1296-有限制的排列/f-51Nod-1296-有限制的排列/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1298-圆与三角形/f-51Nod-1298-圆与三角形/main.cpp function ll (line 24) | ll distance(Point *p_1, Point *p_2) function segOnCircle (line 30) | int segOnCircle(Point *p_1, Point *p_2) function intersect (line 64) | int intersect() function main (line 81) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1299-监狱逃离/f-51Nod-1299-监狱逃离/main.cpp function dfs (line 27) | void dfs(int x, int pre) function init (line 65) | void init() function main (line 73) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1307-绳子与重物/f-51Nod-1307-绳子与重物/main.cpp type line (line 16) | struct line function main (line 25) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1310-Chandrima and XOR/f-51Nod-1310-Chandrima and XOR/main.cpp function init (line 22) | void init() function BToD (line 31) | long long BToD() function main (line 41) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1315-合法整数集/f-51Nod-1315-合法整数集/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1316-回文矩阵/f-51Nod-1316-回文矩阵/main.cpp function next (line 27) | void next(int &x) function main (line 42) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1319-跳跃游戏/f-51Nod-1319-跳跃游戏/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1320-合法尾数序列/f-51Nod-1320-合法尾数序列/main.cpp function init (line 23) | void init() function solve (line 46) | void solve(int n) function main (line 86) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1322-关于树的函数/f-51Nod-1322-关于树的函数/main.cpp type edge (line 31) | struct edge function tii (line 39) | tii dfs_(int last, int root) function dfs (line 72) | void dfs(int last, int root) function main (line 85) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1328-比赛往事/f-51Nod-1328-比赛往事/main.cpp function ins (line 21) | void ins(int *a, int k, int x) function main (line 31) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1330-雕像投影/f-51Nod-1330-雕像投影/main.cpp function charge (line 28) | int charge(int x, int y, int z) function dfs (line 53) | void dfs(int x, int y, int z) function charge_ (line 69) | int charge_() function main (line 144) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1333-无聊的数学家们/f-51Nod-1333-无聊的数学家们/main.cpp function getPrime (line 126) | void getPrime() function main (line 154) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1335-子序列翻转/f-51Nod-1335-子序列翻转/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1337-翻转游戏/f-51Nod-1337-翻转游戏/main.cpp function init (line 18) | void init() function main (line 27) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1341-混合序列/f-51Nod-1341-混合序列/main.cpp type matrix (line 20) | struct matrix method matrix (line 23) | matrix() method output (line 27) | void output() function matrix (line 40) | matrix mat(matrix &a, matrix &b) method matrix (line 23) | matrix() method output (line 27) | void output() function extgcd (line 57) | void extgcd(ll a, ll b, ll &d, ll &x, ll &y) function ll (line 73) | ll inverse(ll a,ll n) function ll (line 80) | ll pow_mod(ll x, ll n) function ll (line 97) | ll solve(ll n) function main (line 123) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1344-走格子/f-51Nod-1344-走格子/main.cpp function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1345-画点集/f-51Nod-1345-画点集/main.cpp function check (line 25) | bool check(pair &s, pair &e, bool tag) function solve (line 70) | int solve(int n) function main (line 182) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1346-递归/f-51Nod-1346-递归/main.cpp function get_c (line 95) | inline int get_c(int x, int y) function main (line 116) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1347-旋转字符串/f-51Nod-1347-旋转字符串/main.c function main (line 12) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1349-最大值/f-51Nod-1349-最大值/main.cpp type node (line 22) | struct node method node (line 29) | node() : left(1), right(1) {} function get_max (line 37) | void get_max() function get_b (line 71) | void get_b() function get_c (line 81) | void get_c() function main (line 90) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1350-斐波那契表示/f-51Nod-1350-斐波那契表示/main.cpp function ll (line 85) | ll F(ll n) function main (line 97) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1351-吃点心/f-51Nod-1351-吃点心/main.cpp type dessert (line 16) | struct dessert function cmpA (line 22) | bool cmpA(dessert a, dessert b) function cmpB (line 27) | bool cmpB(dessert a, dessert b) function main (line 32) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1352-集合计数/f-51Nod-1352-集合计数/main.cpp function ll (line 19) | ll extgcd(ll a, ll b, ll &x, ll &y) function ll (line 34) | ll solve() function main (line 67) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1353-树/f-51Nod-1353-树/main.cpp type edge (line 24) | struct edge function AND_MOD (line 30) | void AND_MOD(int &x, int y) function dfs (line 39) | void dfs(int u, int fa) function main (line 66) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1354-选数字/f-51Nod-1354-选数字/main.cpp function main (line 79) | int main(void) FILE: 按 OJ 分类/51Nod/f-51Nod-1355-斐波那契的最小公倍数/f-51Nod-1355-斐波那契的最小公倍数/main.cpp function scan_d (line 21) | inline void scan_d(T &ret) function ll (line 32) | ll QPow(ll x, ll n) function ll (line 50) | inline ll get_inv(ll a) function init (line 60) | void init() function main (line 84) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1358-浮波那契/f-51Nod-1358-浮波那契/main.cpp type matrix (line 23) | struct matrix function matrix (line 28) | matrix mu(matrix A, matrix B) function matrix (line 49) | matrix multi(matrix mat, long long x) function input (line 73) | void input() function solve (line 78) | void solve() function main (line 109) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1359-循环探求/f-51Nod-1359-循环探求/main.cpp function init (line 36) | void init() function read (line 44) | void read() function mul (line 59) | void mul(ll res[], ll scr[]) function solve (line 77) | void solve() function print (line 148) | void print() function main (line 165) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1363-最小公倍数之和/f-51Nod-1363-最小公倍数之和/main.cpp function ll (line 24) | ll qpow(ll x, ll y) function init (line 38) | void init() function main (line 61) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1364-最大字典序排列/f-51Nod-1364-最大字典序排列/main.cpp type node (line 26) | struct node function push_up (line 33) | void push_up(int root) function build_tree (line 48) | void build_tree(int root, int l, int r) function update (line 71) | void update(int root, int pos) function query (line 92) | void query(int root, int l, int r) function query_k (line 116) | int query_k(int root, int k) function query_sum (line 133) | int query_sum(int root, int l, int r) function main (line 152) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1366-贫富差距/f-51Nod-1366-贫富差距/main.cpp function Floyd (line 189) | void Floyd(MGraph G) FILE: 按 OJ 分类/51Nod/f-51Nod-1371-填数字/f-51Nod-1371-填数字/main.cpp function main (line 23) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1376-最长递增子序列的数量/f-51Nod-1376-最长递增子序列的数量/main.cpp function read (line 19) | inline int read() function get (line 35) | inline int get(int c, int x) function main (line 53) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1377-最慢的快排/f-51Nod-1377-最慢的快排/main.cpp function main (line 23) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1378-夹克老爷的愤怒/f-51Nod-1378-夹克老爷的愤怒/main.cpp function dfs (line 27) | void dfs(int x, int pre) function main (line 61) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1379-索函数/f-51Nod-1379-索函数/main.cpp function init (line 22) | void init() function ll (line 32) | ll pow_mod(ll x, ll n) function main (line 47) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1380-夹克老爷的逢三抽一/f-51Nod-1380-夹克老爷的逢三抽一/main.cpp function del (line 24) | void del(int x) function main (line 31) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1381-硬币游戏/f-51Nod-1381-硬币游戏/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1383-整数分解为2的幂/f-51Nod-1383-整数分解为2的幂/main.cpp function init (line 19) | void init() function main (line 34) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1384-全排列/f-51Nod-1384-全排列/main.cpp function main (line 102) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1385-凑数字/f-51Nod-1385-凑数字/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1388-六边形平面/f-51Nod-1388-六边形平面/main.cpp function countX (line 142) | void countX(int l, int r) function dfs (line 188) | void dfs() function canFind (line 203) | void canFind(int sti, int stj, int tox, int toy, int step) function findOddCycle (line 234) | void findOddCycle() function main (line 265) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1390-游戏得分/f-51Nod-1390-游戏得分/main.cpp function main (line 136) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1391-01串/f-51Nod-1391-01串/main.cpp function main (line 23) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1393-0和1相等串/f-51Nod-1393-0和1相等串/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1394-差和问题/f-51Nod-1394-差和问题/main.cpp type o (line 24) | struct o function lowbit (line 35) | int lowbit(int x) function add (line 40) | void add(int x, ll y, ll arr[]) function ll (line 49) | ll sum(int x, ll arr[]) function discretize (line 61) | void discretize() function build (line 77) | void build() function scan_d (line 93) | inline void scan_d(T &ret) function Out (line 105) | void Out(T a) function main (line 114) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1396-还是01串/f-51Nod-1396-还是01串/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1398-等公交/f-51Nod-1398-等公交/main.cpp function main (line 25) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1400-序列分解/f-51Nod-1400-序列分解/main.cpp function dfs (line 22) | void dfs(int posA, int posB, int posC) function main (line 64) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1402-最大值/f-51Nod-1402-最大值/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1403-有趣的堆栈/f-51Nod-1403-有趣的堆栈/main.cpp function solve (line 20) | void solve(int l, int r) function scan_d (line 33) | inline void scan_d(T &ret) function out (line 44) | inline void out(int x) function main (line 53) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1405-树的距离之和/f-51Nod-1405-树的距离之和/main.cpp function DFS (line 107) | void DFS(int a, int last) function main (line 135) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1406-与查询/f-51Nod-1406-与查询/main.cpp function in (line 22) | void in(int &res) function out (line 37) | void out(int a) function main (line 54) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1409-加强版贪吃蛇/f-51Nod-1409-加强版贪吃蛇/main.cpp function bfs (line 30) | void bfs(int x, int y) function scan_d (line 65) | inline bool scan_d(T &ret) function main (line 87) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1412-AVL树的种类/f-51Nod-1412-AVL树的种类/main.cpp function init (line 81) | void init() function main (line 101) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1413-权势二进制/f-51Nod-1413-权势二进制/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1414-冰雕/f-51Nod-1414-冰雕/main.cpp function calc (line 66) | int calc(int cnt, int step) function main (line 82) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1416-两点/f-51Nod-1416-两点/main.cpp function solve (line 22) | void solve(int x, int y, int tag) function main (line 76) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1417-天堂里的游戏/f-51Nod-1417-天堂里的游戏/main.cpp function gcd (line 14) | long long gcd(long long x, long long y) function main (line 24) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1418-放球游戏/f-51Nod-1418-放球游戏/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1419-最小公倍数挑战/f-51Nod-1419-最小公倍数挑战/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1420-数袋鼠好有趣/f-51Nod-1420-数袋鼠好有趣/main.cpp function bs (line 19) | int bs(int l, int h, int v) function main (line 37) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1421-最大MOD值/f-51Nod-1421-最大MOD值/main.cpp function scan_d (line 21) | inline void scan_d(T &ret) function main (line 32) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1422-沙拉酱前缀/f-51Nod-1422-沙拉酱前缀/main.cpp type ope (line 22) | struct ope function input (line 33) | void input() function solve (line 53) | void solve() function main (line 86) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1423-最大二"货"/f-51Nod-1423-最大二"货"/main.cpp function scan_d (line 22) | inline void scan_d(T &ret) function main (line 33) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1424-零树/f-51Nod-1424-零树/main.cpp function scan_d (line 27) | inline bool scan_d(T &ret) function dfs (line 49) | void dfs(int root, int pre) function main (line 66) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1425-减减数/f-51Nod-1425-减减数/main.cpp function pll (line 21) | pll dfs(ll mx, ll n) function main (line 44) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1428-活动安排问题/f-51Nod-1428-活动安排问题/main.cpp type party (line 17) | struct party function addParty (line 25) | void addParty(int Begin, int End) function cmp (line 33) | bool cmp(party a, party b) function main (line 38) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1429-巧克力/f-51Nod-1429-巧克力/main.cpp function get_cnt (line 111) | void get_cnt(int &cnt_A, int & cnt_B, int div) function main (line 125) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1430-奇偶游戏/f-51Nod-1430-奇偶游戏/main.cpp function D_win (line 13) | void D_win() function S_win (line 18) | void S_win() function main (line 25) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1431-快乐排队/f-51Nod-1431-快乐排队/main.cpp function scan_d (line 17) | inline void scan_d(T &ret) function main (line 31) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1432-独木舟/f-51Nod-1432-独木舟/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1433-0和5/f-51Nod-1433-0和5/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1434-区间LCM/f-51Nod-1434-区间LCM/main.cpp function main (line 95) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1435-位数阶乘/f-51Nod-1435-位数阶乘/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1436-方程的解数/f-51Nod-1436-方程的解数/main.cpp type matrix (line 21) | struct matrix function ans_cf (line 28) | void ans_cf(matrix a) function matrix (line 34) | matrix matrix_cf(matrix a, matrix b) function matrix (line 53) | matrix matrix_pow(matrix a, ll n) function ll (line 71) | ll qpow(ll a, ll b) function init (line 87) | void init() function main (line 93) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1437-迈克步/f-51Nod-1437-迈克步/main.cpp type num (line 18) | struct num method num (line 23) | num() : minLeft(1), minRight(1) {} function stackClear (line 30) | void stackClear() function getMin (line 38) | void getMin() function solve (line 72) | void solve() function scan_d (line 86) | inline void scan_d(T &ret) function Out (line 97) | void Out(int a) function main (line 111) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1438-方阵与完全平方数/f-51Nod-1438-方阵与完全平方数/main.cpp function sear (line 26) | long long sear(long long num) function dfs (line 38) | void dfs(int x, int y, long long value) function main (line 153) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1439-互质对/f-51Nod-1439-互质对/main.cpp function dfs (line 26) | void dfs(int pos, int mul, int sym, int flag) function init (line 48) | void init() function main (line 64) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1441-士兵的数字游戏/f-51Nod-1441-士兵的数字游戏/main.cpp function scan (line 147) | inline void scan(int &a) function getPrime (line 164) | void getPrime() function main (line 186) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1442-士兵的旅行/f-51Nod-1442-士兵的旅行/main.cpp type edge (line 23) | struct edge method edge (line 27) | edge(int a, int b, int c) function add_edge (line 39) | void add_edge(int from, int to, int cap) function bfs (line 45) | void bfs(int s) function dfs (line 69) | int dfs(int v, int t, int f) function max_flow (line 94) | int max_flow(int s, int t) function main (line 117) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1443-路径和树/f-51Nod-1443-路径和树/main.cpp type Edge (line 30) | struct Edge method Edge (line 34) | Edge(int U = -1, int V = -1, ll C = -1) function find (line 49) | int find(int x) function merge (line 61) | void merge(int x, int y) function spfa (line 72) | void spfa(int star) function ll (line 107) | ll Kruskal() function main (line 130) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1444-破坏道路/f-51Nod-1444-破坏道路/main.cpp function bfs (line 26) | void bfs() function charge (line 56) | bool charge(int s1, int t1, int s2, int t2, int i, int j) function main (line 61) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1445-变色DNA/f-51Nod-1445-变色DNA/main.cpp function init (line 16) | void init() function dijkstra (line 33) | void dijkstra(int pos) function main (line 61) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1448-二染色问题/f-51Nod-1448-二染色问题/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1449-砝码称重/f-51Nod-1449-砝码称重/main.cpp function main (line 13) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1451-合法三角形/f-51Nod-1451-合法三角形/main.cpp function solve (line 26) | void solve() function main (line 65) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1452-加括号/f-51Nod-1452-加括号/main.cpp function main (line 26) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1453-抽彩球/f-51Nod-1453-抽彩球/main.cpp function LL (line 89) | LL ppow(LL x, LL y) function LL (line 104) | LL work(LL m, LL i) function main (line 109) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1454-升排列/f-51Nod-1454-升排列/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1455-宝石猎人/f-51Nod-1455-宝石猎人/main.cpp function solve (line 93) | void solve() function main (line 144) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1456-小K的技术/f-51Nod-1456-小K的技术/main.cpp function find (line 29) | int find(int x) function Tarjan (line 41) | void Tarjan(int u) function solve (line 71) | void solve() function scan_d (line 128) | inline void scan_d(T &ret) function init (line 139) | void init() function main (line 159) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1459-迷宫游戏/f-51Nod-1459-迷宫游戏/main.cpp function Dij (line 25) | void Dij(int v) function main (line 70) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1460-连接小岛/f-51Nod-1460-连接小岛/main.cpp type node (line 22) | struct node function input (line 44) | void input() function solve (line 72) | void solve() function main (line 89) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1461-稳定桌/f-51Nod-1461-稳定桌/main.cpp function scan_d (line 24) | inline void scan_d(T &ret) type leg (line 35) | struct leg type node (line 44) | struct node function pushup (line 53) | inline void pushup(int k) function build (line 59) | void build(int l, int r, int k) function update (line 76) | void update(int l, int r, int k) function ll (line 102) | ll query(int l, int r, int k) function main (line 121) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1463-找朋友/f-51Nod-1463-找朋友/main.cpp type node (line 21) | struct node type interval (line 29) | struct interval // 区间 function build (line 51) | void build(int root, int l, int r) function query (line 66) | void query(int root, int l, int r) function insert (line 89) | void insert(int root, int pos, int val) function main (line 107) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1464-半回文/f-51Nod-1464-半回文/main.cpp type Tree (line 225) | struct Tree method Tree (line 230) | Tree() function init (line 237) | void init() function insert_tree (line 267) | void insert_tree(Tree *ptemp, char *s) function dfs (line 290) | void dfs(Tree *ptemp) function solve (line 308) | void solve() function main (line 325) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1467-旋转绳/f-51Nod-1467-旋转绳/main.cpp type snag (line 21) | struct snag function bs (line 30) | int bs(int x) function scan_d (line 50) | inline bool scan_d(T &ret) function out_d (line 73) | inline void out_d(T a) function main (line 87) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1468-小Y的IP地址/f-51Nod-1468-小Y的IP地址/main.cpp function main (line 23) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1469-淋漓尽致子串/f-51Nod-1469-淋漓尽致子串/main.cpp function cmp (line 26) | int cmp(int *r, int a, int b, int l) function da (line 31) | void da(char str[], int n, int m) function solve (line 120) | int solve(int len) function main (line 177) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1473-等幂映射/f-51Nod-1473-等幂映射/main.cpp function ll (line 138) | ll gcd(ll a, ll b) function ll (line 143) | ll lcm(ll a, ll b) function main (line 150) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1475-建设国家/f-51Nod-1475-建设国家/main.cpp type city (line 17) | struct city function cmp (line 25) | bool cmp(city a, city b) function main (line 30) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1476-括号序列的最小代价/f-51Nod-1476-括号序列的最小代价/main.cpp function main (line 24) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1478-括号序列的最长合法子段/f-51Nod-1478-括号序列的最长合法子段/main.cpp function main (line 103) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1480-打广告/f-51Nod-1480-打广告/main.cpp function scan_d (line 21) | inline void scan_d(T &ret) type node (line 32) | struct node function cmp (line 42) | bool cmp(node a, node b) function main (line 47) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1483-化学变换/f-51Nod-1483-化学变换/main.cpp function F (line 22) | void F(int temp, int cnt) function main (line 32) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1484-猜数游戏/f-51Nod-1484-猜数游戏/main.cpp function pri (line 19) | void pri(int i) function dfs (line 43) | void dfs(ll L, ll R, int high) function main (line 119) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1485-字母排序/f-51Nod-1485-字母排序/main.cpp function split (line 26) | void split(int p) function merge (line 82) | void merge(int l, int r, int k) function scan_d (line 106) | inline void scan_d(T &ret) function main (line 117) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1486-大大走格子/f-51Nod-1486-大大走格子/main.cpp type node (line 21) | struct node function cmp (line 30) | int cmp(node a, node b) function ll (line 35) | ll pow(ll x, ll k) function init (line 50) | void init() function main (line 66) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1487-占领资源/f-51Nod-1487-占领资源/main.cpp function RMQ_init (line 113) | void RMQ_init(int n) function RMQ_max (line 128) | int RMQ_max(int L, int R) function max_ (line 138) | bool max_(int &a, int b) function ID (line 148) | inline int ID(int x, int y) function solve (line 153) | int solve() function main (line 220) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1489-蜥蜴和地下室/f-51Nod-1489-蜥蜴和地下室/main.cpp function main (line 122) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1490-多重游戏/f-51Nod-1490-多重游戏/main.cpp function init (line 25) | void init() function inser (line 32) | void inser(char *s) function losses (line 52) | int losses(int u) function gains (line 85) | int gains(int u) function main (line 113) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1491-黄金系统/f-51Nod-1491-黄金系统/main.cpp function judge (line 20) | bool judge(char C[], int i) function main (line 31) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1493-数据关联/f-51Nod-1493-数据关联/main.cpp function scan_d (line 23) | inline void scan_d(T &ret) function main (line 34) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1494-选举拉票/f-51Nod-1494-选举拉票/main.cpp function update (line 29) | void update(int rt, int l, int r, int x) function query (line 51) | int query(int rt, int l, int r, int x) function scan_d (line 74) | inline void scan_d(T &ret) function main (line 85) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1495-中国好区间/f-51Nod-1495-中国好区间/main.cpp function solve (line 20) | void solve() function main (line 63) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1496-最小异或和/f-51Nod-1496-最小异或和/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1499-图/f-51Nod-1499-图/main.cpp type Edge (line 70) | struct Edge function addedge (line 81) | void addedge(int from, int to, int cap) function bfs (line 87) | void bfs(int S) function dfs (line 110) | int dfs(int v, int t, int f) function maxflow (line 135) | int maxflow(int S, int T) function main (line 156) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1500-苹果曼和树/f-51Nod-1500-苹果曼和树/main.cpp function dfs (line 24) | void dfs(int r, int pre) function main (line 48) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1503-猪和回文/f-51Nod-1503-猪和回文/main.cpp function add (line 18) | void add(int &x, int y) function main (line 27) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1509-加长棒/f-51Nod-1509-加长棒/main.cpp function ll (line 15) | ll Solve(ll a, ll b, ll c, ll L) // a是三边之间最大的 function main (line 30) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1510-最小化序列/f-51Nod-1510-最小化序列/main.cpp function scan_d (line 23) | inline bool scan_d(T &ret) function main (line 45) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1513-树上的回文/f-51Nod-1513-树上的回文/main.cpp function dfs (line 28) | void dfs(int x, int h) function solve (line 45) | int solve(int x, int h) function init (line 68) | void init() function scan_d (line 79) | inline void scan_d(T &ret) function main (line 90) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1515-明辨是非/f-51Nod-1515-明辨是非/main.cpp function find (line 22) | int find(int x) function main (line 27) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1519-拆方块/f-51Nod-1519-拆方块/main.cpp function scan_d (line 22) | inline void scan_d(T &ret) function main (line 33) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1521-一维战舰/f-51Nod-1521-一维战舰/main.cpp function main (line 70) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1522-上下序列/f-51Nod-1522-上下序列/main.cpp function charge (line 27) | bool charge(int t1, int t2, int l, int r) function main (line 63) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1523-非回文/f-51Nod-1523-非回文/main.cpp function check (line 130) | bool check(int v) function solve (line 143) | bool solve(int v) function main (line 180) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1524-可除图的最大团/f-51Nod-1524-可除图的最大团/main.cpp function scan_d (line 21) | inline void scan_d(T &ret) function main (line 32) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1525-重组公司/f-51Nod-1525-重组公司/main.cpp function find (line 20) | int find(int x) function merge_1 (line 25) | void merge_1(int x, int y) function merge_2 (line 35) | void merge_2(int x, int y) function scan_d (line 46) | inline void scan_d(T &ret) function init (line 57) | void init() function main (line 66) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1526-分配笔名/f-51Nod-1526-分配笔名/main.cpp function dfs (line 26) | void dfs(int x) function main (line 47) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1530-稳定方块/f-51Nod-1530-稳定方块/main.cpp function judge (line 28) | bool judge(int a, int b) function scan_d (line 55) | inline bool scan_d(T &ret) function main (line 77) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1533-一堆的堆/f-51Nod-1533-一堆的堆/main.cpp function lowbit (line 25) | int lowbit(int x) function add (line 30) | void add(int x, int d) function query (line 39) | int query(int x) function solve (line 50) | void solve () function scan_d (line 79) | inline bool scan_d(T &ret) function main (line 101) | int main(void) FILE: 按 OJ 分类/51Nod/f-51Nod-1534-棋子游戏/f-51Nod-1534-棋子游戏/main.cpp function solve (line 16) | void solve() function main (line 44) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1535-深海探险/f-51Nod-1535-深海探险/main.cpp function dfs (line 19) | void dfs(int st) function main (line 31) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1536-不一样的猜数游戏/f-51Nod-1536-不一样的猜数游戏/main.cpp function getPrime (line 24) | void getPrime(int n) function main (line 47) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1540-俄罗斯赌轮盘/f-51Nod-1540-俄罗斯赌轮盘/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1548-欧姆诺姆和糖果/f-51Nod-1548-欧姆诺姆和糖果/main.cpp type candy (line 16) | struct candy function main (line 23) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1552-白兰地定位系统/f-51Nod-1552-白兰地定位系统/main.cpp function scan_d (line 24) | inline void scan_d(T &ret) function main (line 35) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1554-欧姆诺姆和项链/f-51Nod-1554-欧姆诺姆和项链/main.cpp function get_nt (line 19) | void get_nt() function main (line 36) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1556-计算/f-51Nod-1556-计算/main.cpp function ll (line 22) | ll inv(ll a, ll m) function main (line 36) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1557-两个集合/f-51Nod-1557-两个集合/main.cpp function bs (line 21) | int bs(int l, int h, int v) function main (line 43) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1560-扔人游戏/f-51Nod-1560-扔人游戏/main.cpp function near (line 27) | int near(int s) function dfs (line 41) | void dfs(int d) function main (line 129) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1562-玻璃切割/f-51Nod-1562-玻璃切割/main.cpp function scan_d (line 112) | inline void scan_d(int &ret) function findW (line 123) | int findW(int x) function joinW (line 132) | void joinW(int x, int y) function findH (line 147) | int findH(int x) function joinH (line 156) | void joinH(int x, int y) function init (line 172) | void init() function main (line 189) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1563-坐标轴上的最大团/f-51Nod-1563-坐标轴上的最大团/main.cpp type node (line 18) | struct node function cmp (line 26) | bool cmp(node a, node b) function main (line 35) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1564-区间的价值/f-51Nod-1564-区间的价值/main.cpp function solve (line 23) | void solve(int l, int r) function main (line 55) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1571-最近等对/f-51Nod-1571-最近等对/main.cpp type node (line 21) | struct node function cmp (line 34) | int cmp(node a, node b) function build (line 39) | void build(int rt, int l, int r) function pushup (line 51) | void pushup(int rt) function pushdown (line 56) | void pushdown(int rt) function update (line 68) | void update(int rt, int l, int r, int l_, int r_, int v) function query (line 90) | int query(int rt, int l, int r, int l_, int r_) function slove (line 112) | void slove() function scan_d (line 141) | inline bool scan_d(T &ret) function print_d (line 164) | inline void print_d(T x) function main (line 173) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1572-宝岛地图/f-51Nod-1572-宝岛地图/main.cpp type node (line 143) | struct node type order (line 148) | struct order function ok (line 158) | bool ok(int x, int y) function Sum (line 163) | int Sum(int a, int b, int c, int d) function charge (line 168) | bool charge(int x, int y) function main (line 224) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1573-美丽的集合/f-51Nod-1573-美丽的集合/main.cpp function scan_d (line 26) | inline void scan_d(T &ret) function find (line 37) | int find(int x) function main (line 42) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1574-排列转换/f-51Nod-1574-排列转换/main.cpp function abs (line 22) | int abs(int a) function main (line 27) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1580-铺管道/f-51Nod-1580-铺管道/main.cpp function solve (line 24) | void solve(bool T[][MAXN], int n, int m, int flag) function main (line 81) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1581-摆放骨牌/f-51Nod-1581-摆放骨牌/main.cpp function BFS (line 26) | void BFS(int x, int y) function main (line 70) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1582-n叉树/f-51Nod-1582-n叉树/main.cpp type Matrix (line 23) | struct Matrix function Matrix (line 28) | Matrix mul(Matrix x, Matrix y) function Matrix (line 50) | Matrix qpow(Matrix x, int k) function main (line 76) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1586-约数和/f-51Nod-1586-约数和/main.cpp function scan_d (line 22) | inline void scan_d(T &ret) function print_d (line 34) | inline void print_d(T x) function main (line 43) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1589-移数博弈/f-51Nod-1589-移数博弈/main.cpp function del (line 27) | void del(int now) function main (line 33) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1593-公园晨跑/f-51Nod-1593-公园晨跑/main.cpp type point (line 23) | struct point method point (line 28) | point() type Seg (line 34) | struct Seg method Seg (line 40) | Seg() method push_up (line 45) | void push_up(point &a, int rt) method update (line 59) | void update(int x, int l, int r, int rt) method update (line 76) | void update(int x, ll k) method query (line 82) | void query(int l, int r, int L, int R, int rt) method query (line 102) | int query(int l, int r) function scan_d (line 117) | inline void scan_d(T &ret) function print_d (line 129) | inline void print_d(T x) function main (line 138) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1594-Gcd and Phi/f-51Nod-1594-Gcd and Phi/main.cpp function solve (line 28) | void solve() function main (line 94) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1595-回文度/f-51Nod-1595-回文度/main.cpp function Manacher (line 20) | void Manacher(int len) function main (line 45) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1596-搬货物/f-51Nod-1596-搬货物/main.cpp function scan_d (line 20) | inline void scan_d(T &ret) function main (line 31) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1597-有限背包计数问题/f-51Nod-1597-有限背包计数问题/main.cpp function main (line 28) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1603-限高二叉排列树/f-51Nod-1603-限高二叉排列树/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1605-棋盘问题/f-51Nod-1605-棋盘问题/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1607-卷积和/f-51Nod-1607-卷积和/main.cpp function ll (line 24) | ll dfs(int len, int pos) function ll (line 101) | ll solve(ll x) function init (line 116) | void init() function main (line 138) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1610-路径计数/f-51Nod-1610-路径计数/main.cpp function ll (line 35) | ll dfs(int u, int d) function ll (line 53) | ll cal(int u) function main (line 72) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1612-合法表达式/f-51Nod-1612-合法表达式/main.cpp function main (line 21) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1613-翻硬币/f-51Nod-1613-翻硬币/main.cpp function main (line 15) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1615-跳跃的杰克/f-51Nod-1615-跳跃的杰克/main.cpp function main (line 13) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1616-最小集合/f-51Nod-1616-最小集合/main.cpp function scan_d (line 21) | inline void scan_d(T &ret) function kgcd (line 32) | int kgcd(int a, int b) function main (line 60) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1617-奇偶数组/f-51Nod-1617-奇偶数组/main.cpp function cal (line 17) | long long cal(long long a, long long b, long long c) function _cal (line 43) | long long _cal(long long ll, long long rr, long long c, int d) function main (line 79) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1618-树或非树/f-51Nod-1618-树或非树/main.cpp type node (line 22) | struct node method put (line 30) | void put(int i, int j) method lazy (line 40) | void lazy(int i) method rt (line 47) | void rt(int i, int j) method splay (line 78) | void splay(int i, int j) method update (line 98) | void update(int i) method access (line 104) | void access(int i) method cover (line 115) | void cover(int i) function link (line 124) | void link(int a, int b) function find (line 131) | int find(int i) function dfs1 (line 136) | void dfs1(int i, int h) function dfs2 (line 161) | void dfs2(int i, int h) function scan_d (line 174) | inline void scan_d(T &ret) function main (line 185) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1619-完全二叉树的方差/f-51Nod-1619-完全二叉树的方差/main.cpp function ll (line 27) | ll Ml(ll x, ll y) function ll (line 46) | ll Mr(ll x, ll y) function ll (line 61) | ll check(ll x) function cmp (line 88) | bool cmp(ll x, ll y) function scan_d (line 94) | inline void scan_d(T &ret) function main (line 105) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1621-花钱买车牌/f-51Nod-1621-花钱买车牌/main.cpp function get_AB (line 22) | void get_AB(int tmp[], int tot) function cmp_AB (line 49) | bool cmp_AB() function main (line 66) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1622-集合对/f-51Nod-1622-集合对/main.cpp function ll (line 19) | ll QPow(ll x, ll n) function main (line 37) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1623-完美消除/f-51Nod-1623-完美消除/main.cpp function change (line 26) | int change(int s, int x) function ll (line 39) | ll dfs(int len, int cnt, int tag, int flag) function ll (line 72) | ll solve(ll x) function main (line 86) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1625-夹克爷发红包/f-51Nod-1625-夹克爷发红包/main.cpp function count (line 143) | int count(int num) function cmp (line 157) | bool cmp(const LL &a, const LL &b) function main (line 162) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1629-B君的圆锥/f-51Nod-1629-B君的圆锥/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1630-B君的竞技场/f-51Nod-1630-B君的竞技场/main.cpp function get_dp (line 20) | void get_dp(int x, int y, double z[], double w[]) function get_res (line 32) | double get_res(int x, int y) function main (line 43) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1631-小鲨鱼在51Nod小学/f-51Nod-1631-小鲨鱼在51Nod小学/main.cpp type Node (line 120) | struct Node function cmp (line 131) | bool cmp(const Node &p1, const Node &p2) function main (line 136) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1635-第K个幸运排列/f-51Nod-1635-第K个幸运排列/main.cpp function ll (line 27) | ll dp(ll x) function reverse_cantor (line 86) | void reverse_cantor(ll n, ll k, ll base) function check (line 110) | bool check(ll n) function init (line 128) | void init() function main (line 141) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1636-教育改革/f-51Nod-1636-教育改革/main.cpp type lesson (line 23) | struct lesson function _max (line 36) | void _max(ll &a, ll b) function main (line 41) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1637-幸运数字转换/f-51Nod-1637-幸运数字转换/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1638-字符串重组/f-51Nod-1638-字符串重组/main.cpp function kmp (line 21) | void kmp() function exkmp (line 54) | void exkmp() function main (line 95) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1639-绑鞋带/f-51Nod-1639-绑鞋带/main.cpp function main (line 14) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1640-天气晴朗的魔法/f-51Nod-1640-天气晴朗的魔法/main.cpp type edge (line 22) | struct edge function addEdge (line 31) | void addEdge(int u, int v, int w) function cmp_0 (line 40) | bool cmp_0(edge a, edge b) function cmp_1 (line 46) | bool cmp_1(edge a, edge b) function find (line 51) | int find(int x) function Kruskal_0 (line 64) | int Kruskal_0(int n) // 传入点数，返回最小生成树的最大边权值，如果不连通返回-1 function ll (line 102) | ll Kruskal_1(int n) // 传入点数，返回最大生成树的权值，如果不连通返回-1 function main (line 140) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1645-中位数变换/f-51Nod-1645-中位数变换/main.cpp function scan_d (line 22) | inline void scan_d(T &ret) function main (line 33) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1649-齐头并进/f-51Nod-1649-齐头并进/main.cpp function init (line 25) | void init() function dijkstra (line 31) | void dijkstra(int map[][MAXN]) function main (line 63) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1650-穿越无人区/f-51Nod-1650-穿越无人区/main.cpp function main (line 16) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1661-黑板上的游戏/f-51Nod-1661-黑板上的游戏/main.cpp function ll (line 26) | ll SG(ll x) function main (line 36) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1670-打怪兽/f-51Nod-1670-打怪兽/main.cpp function init (line 24) | void init() function ll (line 34) | ll exp_mod(ll a, ll b) function input (line 49) | void input() function solve (line 61) | void solve() function main (line 84) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1671-货物运输/f-51Nod-1671-货物运输/main.cpp function check (line 21) | bool check(int m) function main (line 48) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1673-树有几多愁/f-51Nod-1673-树有几多愁/main.cpp function scan_d (line 33) | inline void scan_d(T &ret) function dfs (line 44) | void dfs(int u, int pre) function main (line 66) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1674-区间的价值 V2/f-51Nod-1674-区间的价值 V2/main.cpp function cinDiy (line 17) | int cinDiy() function solve (line 38) | void solve(int l, int r) function main (line 79) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1675-序列变换/f-51Nod-1675-序列变换/main.cpp function Mobius (line 80) | void Mobius() function ll (line 117) | ll cal(int t) function main (line 135) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1677-treecnt/f-51Nod-1677-treecnt/main.cpp function ll (line 23) | ll QPow(ll x, ll n) function init (line 41) | void init() function ll (line 55) | ll C(ll a, ll b) function ll (line 75) | ll dfs(ll s) function main (line 99) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1678-lyk与gcd/f-51Nod-1678-lyk与gcd/main.cpp function init (line 25) | void init() function update (line 36) | void update(int pos, int b) function getFactors (line 61) | void getFactors(int x) function solve (line 82) | long long solve(int x) function scan_d (line 115) | inline void scan_d(T &ret) function out (line 127) | inline void out(T x) function main (line 136) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1679-连通率/f-51Nod-1679-连通率/main.cpp type Edge (line 22) | struct Edge function addEdge (line 27) | void addEdge(int u, int v) function dfs (line 35) | void dfs(int rt, int pre) function init (line 55) | void init() function scan_d (line 65) | inline void scan_d(T &ret) function main (line 76) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1681-公共祖先/f-51Nod-1681-公共祖先/main.cpp type node (line 27) | struct node type Edge (line 32) | struct Edge function init (line 37) | void init() function addedge (line 44) | void addedge(int u, int v) function dfs (line 51) | void dfs(int u, int pre, int flag) function scan_d (line 84) | inline void scan_d(T &ret) function update (line 95) | void update(int &rt, int l, int r, int num) function query (line 116) | int query(int x, int y, int L, int R, int l, int r) function main (line 135) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1684-子集价值/f-51Nod-1684-子集价值/main.cpp function get_mod (line 23) | void get_mod(int &x) function get (line 31) | int get(int x, int y) function main (line 52) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1685-第K大区间2/f-51Nod-1685-第K大区间2/main.cpp function add (line 28) | void add(int rt, int x, int y = 1) function get_sum (line 41) | int get_sum(int rt, int x) function ll (line 55) | ll check(int x) function scan_d (line 75) | inline void scan_d(T &ret) function main (line 86) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1686-第K大区间/f-51Nod-1686-第K大区间/main.cpp function ll (line 21) | ll mul(ll x) function ll (line 30) | ll cala(int x) function main (line 55) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1689-逛街/f-51Nod-1689-逛街/main.cpp function scan_d (line 27) | inline void scan_d(T &ret) function main (line 38) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1693-水群/f-51Nod-1693-水群/main.cpp function spfa_bfs (line 23) | int spfa_bfs(int n) function main (line 65) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1705-七星剑/f-51Nod-1705-七星剑/main.cpp function scan_d (line 21) | inline void scan_d(T &ret) function main (line 38) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1711-平均数/f-51Nod-1711-平均数/main.cpp type note (line 20) | struct note function cmp (line 26) | bool cmp(note a, note b) function lowbit (line 31) | inline int lowbit(int t) function add (line 42) | void add(int x) function ll (line 50) | ll find(int x) function check (line 61) | bool check(double m) function scan_d (line 98) | inline void scan_d(T &ret) function main (line 109) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1712-区间求和/f-51Nod-1712-区间求和/main.cpp function in (line 23) | void in(uint &w) function uint (line 38) | uint mult(uint a, uint b) function main (line 53) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1714-B君的游戏/f-51Nod-1714-B君的游戏/main.cpp function getSG (line 24) | void getSG(int n) FILE: 按 OJ 分类/51Nod/f-51Nod-1716-多项式?/f-51Nod-1716-多项式?/main.cpp function main (line 15) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1718-"多项式"/f-51Nod-1718-"多项式"/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1719-数值计算/f-51Nod-1719-数值计算/main.cpp function main (line 20) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1732-51Nod婚姻介绍所/f-51Nod-1732-51Nod婚姻介绍所/main.cpp function cmp (line 36) | bool cmp(int *r, int a, int b, int l) function da (line 41) | void da(int str[], int sa[], int rank[], int height[], int n, int m) function initRMQ (line 133) | void initRMQ(int n) function askRMQ (line 162) | int askRMQ(int a, int b) function lcp (line 172) | int lcp(int a, int b) function scan_d (line 187) | inline void scan_d(int &ret) function prin_d (line 199) | inline void prin_d(int x) function main (line 209) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1737-配对/f-51Nod-1737-配对/main.cpp function init (line 37) | void init() function dfs (line 49) | void dfs(int r) function dfs_ (line 72) | void dfs_(int x) function main (line 86) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1742-开心的小Q/f-51Nod-1742-开心的小Q/main.cpp function getPrime (line 25) | void getPrime() function init (line 47) | void init() function ll (line 66) | ll F(int n) function ll (line 81) | ll S(int n) function main (line 95) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1747-近似多项式/f-51Nod-1747-近似多项式/main.cpp function mod_inv (line 25) | inline int mod_inv(int x) function init (line 30) | void init() function main (line 46) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1753-相似子串/f-51Nod-1753-相似子串/main.cpp type FastIO (line 23) | struct FastIO method IO_fread (line 28) | void IO_fread() method s_read (line 34) | void s_read(char *s) method c_read (line 76) | char c_read() // 读取一个字符 不读 空格换行 method read (line 103) | int read() type HASH (line 152) | struct HASH method HASH (line 156) | HASH(int k1 = 0, int k2 = 0, int k3 = 0) : k1(k1), k2(k2), k3(k3) {} method HASH (line 162) | HASH operator + (const HASH &a) const method HASH (line 166) | HASH operator - (const HASH &a) const type node (line 172) | struct node method node (line 176) | node(int k = 0, int d = -1) : k(k), d(d) {} function Pow (line 193) | int Pow(int a, int b, int mod) function init (line 212) | void init() type bf (line 233) | struct bf method clear (line 237) | void clear() method bf (line 245) | bf() method find (line 250) | int find(int a) method merg (line 260) | void merg(int a, int b) function camp (line 272) | int camp(int b) function main (line 324) | int main () FILE: 按 OJ 分类/51Nod/f-51Nod-1765-谷歌的恐龙/f-51Nod-1765-谷歌的恐龙/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1766-树上的最远点对/f-51Nod-1766-树上的最远点对/main.cpp function scan_d (line 22) | inline void scan_d(T &ret) function print_d (line 34) | void print_d(T a) type ST (line 50) | struct ST method init (line 54) | void init(int n) method query (line 70) | int query(int a, int b) // 查询[a,b]之间最小值的下标 type Edge (line 81) | struct Edge function init (line 96) | void init() function add_edge (line 102) | void add_edge(int u, int v, int w) function dfs (line 110) | void dfs(int u, int pre, int dep) function LCA_init (line 129) | void LCA_init(int root, int node_num) // 查询LCA前的初始化 function query_lca (line 136) | int query_lca(int u, int v) // 查询u,v的lca编号 function get_dis (line 141) | int get_dis(int a, int b) type node (line 147) | struct node function cal (line 154) | void cal(int root, int a, int b) function push_up (line 165) | void push_up(int root) function build (line 175) | void build(int root, int l, int r) function get_ft (line 195) | void get_ft(int a, int b, int &len) function query (line 205) | void query(int root, int l, int r, int &ta, int &tb) function main (line 241) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1773-A国的贸易/f-51Nod-1773-A国的贸易/main.cpp function scan_d (line 20) | inline void scan_d(T &ret) function print_d (line 32) | inline void print_d(T x) function FWT (line 44) | inline void FWT(int c[], int tf_utf) // tf_utf 1:tf; 0:utf function QPow (line 77) | int QPow(int a, int k) function main (line 95) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1779-逆序对统计/f-51Nod-1779-逆序对统计/main.cpp function main (line 23) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1780-完美序列/f-51Nod-1780-完美序列/main.cpp function scan_d (line 29) | inline bool scan_d(T &ret) function init (line 51) | void init() function main (line 63) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1781-Pinball/f-51Nod-1781-Pinball/main.cpp type node (line 25) | struct node function build (line 31) | void build(int rt, int l, int r) function update (line 46) | void update(int rt, int a, ll c) function ll (line 65) | ll query(int rt, int a, int b) function scan_d (line 91) | inline void scan_d(T &ret) function main (line 102) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1785-数据流中的算法/f-51Nod-1785-数据流中的算法/main.cpp function read (line 18) | inline void read(int &ret) function variance (line 30) | double variance() function midNum (line 44) | double midNum() function main (line 73) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1791-合法括号子段/f-51Nod-1791-合法括号子段/main.cpp function solve (line 28) | void solve(int l, int r) function main (line 71) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1799-二分答案/f-51Nod-1799-二分答案/main.cpp function ll (line 19) | ll fac(ll x) function main (line 33) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1800-汉诺塔/f-51Nod-1800-汉诺塔/main.cpp function cal (line 23) | int cal() function main (line 34) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1803-森林直径/f-51Nod-1803-森林直径/main.cpp function scan_d (line 35) | inline void scan_d(T &ret) function dfs (line 46) | void dfs(int x) function init (line 100) | void init() function main (line 112) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1804-小C的多边形/f-51Nod-1804-小C的多边形/main.cpp function intToChar (line 22) | void intToChar(int &pos, int a) function main (line 36) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1805-小树/f-51Nod-1805-小树/main.cpp function ll (line 20) | ll QPow(ll x, ll n) function init (line 38) | void init() function ll (line 52) | ll C(ll a, ll b) function main (line 65) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1806-wangyurzee的树/f-51Nod-1806-wangyurzee的树/main.cpp function ll (line 29) | ll QPow(ll x, ll n) function init (line 47) | void init() function scan_d (line 62) | inline void scan_d(T &ret) function main (line 73) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1810-连续区间/f-51Nod-1810-连续区间/main.cpp function scan_d (line 27) | inline void scan_d(T &ret) function solve (line 38) | void solve(int l, int r) function main (line 124) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1811-联通分量计数/f-51Nod-1811-联通分量计数/main.cpp function scan_d (line 30) | inline void scan_d(T &ret) function ll (line 41) | ll get_n(int n) function add (line 46) | void add(int x, int y) function ins (line 53) | void ins(int &x, int l, int r, int a) function merge (line 122) | int merge(int x, int y, int l, int r) function dfs (line 188) | void dfs(int rt, int pre) function main (line 204) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1815-调查任务/f-51Nod-1815-调查任务/main.cpp type node (line 21) | struct node function add_edge (line 33) | void add_edge(int u, int v) function add_edge_23 (line 39) | void add_edge_23(int u, int v) function tarjan (line 57) | void tarjan(int x) function BFS (line 111) | void BFS() function scan_d (line 182) | inline void scan_d(T &ret) function main (line 193) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1821-最优集合/f-51Nod-1821-最优集合/main.cpp function scan_d (line 24) | inline bool scan_d(T &ret) function exc (line 36) | int exc(int n, int m) function main (line 56) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1829-函数/f-51Nod-1829-函数/main.cpp function ll (line 22) | ll QPow(ll x, ll n) function init (line 40) | void init() function ll (line 54) | ll C(ll a, ll b) function main (line 67) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1831-小C的游戏/f-51Nod-1831-小C的游戏/main.cpp function init (line 85) | void init() function main (line 131) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1832-先序遍历与后序遍历/f-51Nod-1832-先序遍历与后序遍历/main.cpp type BigInt (line 16) | struct BigInt method BigInt (line 24) | BigInt() method BigInt (line 30) | BigInt(int v) method BigInt (line 42) | BigInt operator * (const BigInt &b) const method output (line 68) | void output() function get_id (line 86) | int get_id(int l, int r, int num) function calc (line 99) | int calc(int num) function dfs (line 113) | void dfs(int a_l, int a_r, int b_l, int b_r) function main (line 140) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1833-环/f-51Nod-1833-环/main.cpp function scan_d (line 24) | inline void scan_d(T &ret) function cal (line 35) | int cal(int x) function main (line 50) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1835-完全图/f-51Nod-1835-完全图/main.cpp function ll (line 22) | ll QPow(ll x, ll n) function init (line 40) | void init() function main (line 52) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1836-战忽局的手段/f-51Nod-1836-战忽局的手段/main.cpp function __float128 (line 13) | __float128 QPow(__float128 x, long long p) function main (line 33) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1837-砝码称重/f-51Nod-1837-砝码称重/main.cpp function main (line 16) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1849-Clarke and package/f-51Nod-1849-Clarke and package/main.cpp function scan_d (line 20) | inline void scan_d(T &ret) type package (line 31) | struct package function cmp (line 36) | bool cmp(const package &x, const package &y) function main (line 45) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1859-Clarke and number/f-51Nod-1859-Clarke and number/main.cpp function ll (line 19) | ll sqrt(ll x) function main (line 42) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1868-彩色树/f-51Nod-1868-彩色树/main.cpp function scan_d (line 20) | inline void scan_d(T &ret) function addEdge (line 36) | void addEdge(int x, int y) function cal (line 43) | int cal(int x) function dfs (line 55) | void dfs(int rt, int pre) function main (line 77) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1874-字符串排序/f-51Nod-1874-字符串排序/main.cpp function MergeSort (line 28) | void MergeSort(char *a, int l, int r) function main (line 70) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1946-特殊表示法/f-51Nod-1946-特殊表示法/main.cpp function main (line 21) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1952-栈/f-51Nod-1952-栈/main.cpp function scan_d (line 26) | inline void scan_d(T &ret) function main (line 37) | signed main() FILE: 按 OJ 分类/51Nod/f-51Nod-1962-区间计数/f-51Nod-1962-区间计数/main.cpp function scan_d (line 19) | inline void scan_d(T &ret) function ins (line 38) | int ins(pii x, pii y) function main (line 51) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1967-路径定向/f-51Nod-1967-路径定向/main.cpp function dfs (line 30) | void dfs(int x) function main (line 52) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1969-Fire!/f-51Nod-1969-Fire!/main.cpp function scan_d (line 23) | inline void scan_d(T &ret) function init (line 34) | void init() function main (line 45) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-1981-如何愉快地与STL玩耍/f-51Nod-1981-如何愉快地与STL玩耍/main.cpp type node (line 26) | struct node function scan_d (line 32) | inline void scan_d(T &ret) function print_d (line 44) | void print_d(T x) function _insert (line 53) | void _insert(int l, int r) function query (line 74) | void query(int l, int r) function check (line 95) | inline size_t check(int m) function solve (line 101) | void solve() function init (line 135) | void init() function main (line 145) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-1995-三子棋/f-51Nod-1995-三子棋/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-2000-四边形分割平面/f-51Nod-2000-四边形分割平面/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-2006-飞行员配对（二分图最大匹配）/f-51Nod-2006-飞行员配对（二分图最大匹配）/main.cpp type edge (line 23) | struct edge function add_edge (line 40) | void add_edge(int x, int y, int flow) function init (line 56) | void init() function SPFA (line 73) | bool SPFA() function Dinic (line 115) | void Dinic() function solve (line 178) | void solve() function main (line 186) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-2020-排序相减/f-51Nod-2020-排序相减/main.cpp function cmp (line 19) | bool cmp(const int &a, const int &b) function main (line 24) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-TalkingData数据科学精英夏令营挑战赛-A-初中的算术/f-51Nod-TalkingData数据科学精英夏令营挑战赛-A-初中的算术/main.cpp type BigNum (line 17) | struct BigNum function find_dot (line 25) | int find_dot(char a, char str[]) function print (line 38) | void print(struct BigNum s) function trans (line 55) | void trans(BigNum &a, char str[]) function BigNum (line 82) | BigNum mul(BigNum a, BigNum b) function main (line 122) | int main() FILE: 按 OJ 分类/51Nod/f-51Nod-TalkingData数据科学精英夏令营挑战赛-B-丢手绢/f-51Nod-TalkingData数据科学精英夏令营挑战赛-B-丢手绢/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-TalkingData数据科学精英夏令营挑战赛-C-好数/f-51Nod-TalkingData数据科学精英夏令营挑战赛-C-好数/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-TalkingData数据科学精英夏令营挑战赛-D-数据流中的算法-众数/f-51Nod-TalkingData数据科学精英夏令营挑战赛-D-数据流中的算法-众数/main.cpp type SetCmp (line 23) | struct SetCmp function scan_d (line 34) | inline void scan_d(int &ret) function Out (line 45) | inline void Out(int a) function main (line 54) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-TalkingData数据科学精英夏令营挑战赛-E-路径定向/f-51Nod-TalkingData数据科学精英夏令营挑战赛-E-路径定向/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/51Nod/f-51Nod-算法马拉松13-A-取余最长路/f-51Nod-算法马拉松13-A-取余最长路/main.c function init (line 18) | void init(int n) function map (line 39) | void map(int n) function main (line 53) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-算法马拉松13-B-数有几多愁/f-51Nod-算法马拉松13-B-数有几多愁/main.c function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/51Nod/f-51Nod-算法马拉松13-C-比大小/f-51Nod-算法马拉松13-C-比大小/main.c type ll (line 11) | typedef long long ll; function ll (line 16) | ll setA(ll N) function main (line 26) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-算法马拉松15（脱欧专场）-A-B君的游戏/f-51Nod-算法马拉松15（脱欧专场）-A-B君的游戏/main.cpp function scanDIY (line 16) | inline void scanDIY(T &ret) function main (line 26) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-算法马拉松16-A-B君的连通/f-51Nod-算法马拉松16-A-B君的连通/main.cpp function ll (line 48) | ll power(ll a, ll b) function init (line 64) | void init() function main (line 75) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-51Nod-算法马拉松16-B-卷积和/51Nod-算法马拉松16-B-卷积和/main.cpp function init (line 20) | void init() function main (line 34) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-BSG白山极客挑战赛-A-数数字/f-BSG白山极客挑战赛-A-数数字/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-BSG白山极客挑战赛-B-AVL树的种类/f-BSG白山极客挑战赛-B-AVL树的种类/main.c function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-算法马拉松17（告别奥运）-B-分解/f-算法马拉松17（告别奥运）-B-分解/main.cpp type Matrix (line 18) | struct Matrix method Matrix (line 22) | Matrix() function Matrix (line 33) | Matrix isit(Matrix x, long long c) method Matrix (line 22) | Matrix() function Matrix (line 46) | Matrix Matlab(Matrix x, Matrix s) method Matrix (line 22) | Matrix() function FastMatrix (line 65) | long long FastMatrix(Matrix tmp, long long n) function main (line 98) | int main() FILE: 按 OJ 分类/51Nod/f-算法马拉松18-A-染色问题/f-算法马拉松18-A-染色问题/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/51Nod/f-算法马拉松18-B-非010串/f-算法马拉松18-B-非010串/main.cpp function mat_ab (line 24) | void mat_ab(E *a, E *b) // a*b-->a function mat_aa (line 41) | void mat_aa(E *a, E *b) // a^2-->b function init (line 56) | void init() function ll (line 68) | ll solve(ll n) function main (line 95) | int main () FILE: 按 OJ 分类/BNUOJ/f-BNUOJ-4052-BT马/f-BNUOJ-4052-BT马/main.c type step (line 13) | struct step type step (line 20) | struct step function main (line 22) | int main() FILE: 按 OJ 分类/BZOJ/f-BZOJ-2301-[HAOI2011]Problem b/f-BZOJ-2301-[HAOI2011]Problem b/main.cpp function Moblus (line 28) | void Moblus() function solve (line 64) | long long solve(int n, int m) function main (line 79) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CCF/f-CCF模拟-1-出现次数最多的数/f-CCF模拟-1-出现次数最多的数/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CCF/f-CCF模拟-2-ISBN号码/f-CCF模拟-2-ISBN号码/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CCF/f-CCF模拟-3-最大的矩阵/f-CCF模拟-3-最大的矩阵/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CCF/f-CCF模拟-4-有趣的数/f-CCF模拟-4-有趣的数/main.cpp function main (line 21) | int main() FILE: 按 OJ 分类/CCF/f-CCF模拟-5-I’m stuck!/f-CCF模拟-5-I’m stuck!/main.cpp function dfsS (line 24) | void dfsS(int x, int y) function dfsT (line 75) | void dfsT(int x, int y, int preX, int preY) function main (line 122) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CDOJ/f-CDOJ-2016-A-柱爷与咸鱼神功/f-CDOJ-2016-A-柱爷与咸鱼神功/main.c function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CDOJ/f-CDOJ-2016-B-柱爷与最大区间和/f-CDOJ-2016-B-柱爷与最大区间和/main.c function main (line 64) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CDOJ/f-CDOJ-2016-C-柱爷的下凡/f-CDOJ-2016-C-柱爷的下凡/main.c function MIN (line 13) | int MIN(int a, int b, int c) function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CDOJ/f-CDOJ-2016-F-柱爷与三叉戟不得不说的故事/f-CDOJ-2016-F-柱爷与三叉戟不得不说的故事/main.c function dfs (line 18) | int dfs(int i, int ans) function main (line 54) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-BNU Training 2016.07.29 Div. 2-B-Levko and Table/f-BNU Training 2016.07.29 Div. 2-B-Levko and Table/main.cpp function main (line 11) | int main() FILE: 按 OJ 分类/CF/f-CF-Avito Code Challenge 2018-A-Antipalindrome/f-CF-Avito Code Challenge 2018-A-Antipalindrome/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Avito Code Challenge 2018-B-Businessmen Problems/f-CF-Avito Code Challenge 2018-B-Businessmen Problems/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Avito Code Challenge 2018-C-Useful Decomposition/f-CF-Avito Code Challenge 2018-C-Useful Decomposition/main.cpp function dfs (line 21) | void dfs(int u, int pre) function main (line 38) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Avito Code Challenge 2018-D-Bookshelves/f-CF-Avito Code Challenge 2018-D-Bookshelves/main.cpp function main (line 23) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Avito Code Challenge 2018-E-Addition on Segments/f-CF-Avito Code Challenge 2018-E-Addition on Segments/main.cpp type Q (line 16) | struct Q function main (line 28) | int main() FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #210 (Div. 1)-A-Levko and Array Recovery/f-CF-Codeforces Round #210 (Div. 1)-A-Levko and Array Recovery/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #365 (Div. 2)-A-Mishka and Game/f-CF-Codeforces Round #365 (Div. 2)-A-Mishka and Game/main.cpp function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #365 (Div. 2)-B-Mishka and trip/f-CF-Codeforces Round #365 (Div. 2)-B-Mishka and trip/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #366 (Div. 2)-A-Hulk/f-CF-Codeforces Round #366 (Div. 2)-A-Hulk/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #377 (Div. 2)-A-Buy a Shovel/f-CF-Codeforces Round #377 (Div. 2)-A-Buy a Shovel/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #377 (Div. 2)-B-Cormen — The Best Friend Of a Man/f-CF-Codeforces Round #377 (Div. 2)-B-Cormen — The Best Friend Of a Man/main.cpp type value (line 17) | struct value function main (line 24) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #392 (Div. 2)-A-Holiday Of Equality/f-CF-Codeforces Round #392 (Div. 2)-A-Holiday Of Equality/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #392 (Div. 2)-B-Blown Garland/f-CF-Codeforces Round #392 (Div. 2)-B-Blown Garland/main.cpp function init (line 19) | void init() function main (line 24) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-A-Vicious Keyboard/f-CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-A-Vicious Keyboard/main.cpp function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-B-Valued Keys/f-CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-B-Valued Keys/main.cpp function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-C-Voltage Keepsake/f-CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-C-Voltage Keepsake/main.cpp type device (line 17) | struct device function main (line 30) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-D-Volatile Kite/f-CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-D-Volatile Kite/main.cpp function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #410 (Div. 2)-A-Mike and palindrome/f-CF-Codeforces Round #410 (Div. 2)-A-Mike and palindrome/main.cpp function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #410 (Div. 2)-B-Mike and strings/f-CF-Codeforces Round #410 (Div. 2)-B-Mike and strings/main.cpp function main (line 112) | int main() FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #410 (Div. 2)-C-Mike and gcd problem/f-CF-Codeforces Round #410 (Div. 2)-C-Mike and gcd problem/main.cpp function gcd (line 19) | int gcd(int x, int y) function main (line 29) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #410 (Div. 2)-D-Mike and distribution/f-CF-Codeforces Round #410 (Div. 2)-D-Mike and distribution/main.cpp function main (line 154) | int main() FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #418 (Div. 2)-C-An impassioned circulation of affection/f-CF-Codeforces Round #418 (Div. 2)-C-An impassioned circulation of affection/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #420 (Div. 2)-A-Okabe and Future Gadget Laboratory/f-CF-Codeforces Round #420 (Div. 2)-A-Okabe and Future Gadget Laboratory/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #420 (Div. 2)-B-Okabe and Banana Trees/f-CF-Codeforces Round #420 (Div. 2)-B-Okabe and Banana Trees/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #420 (Div. 2)-C-Okabe and Boxes/f-CF-Codeforces Round #420 (Div. 2)-C-Okabe and Boxes/main.cpp function main (line 20) | int main() FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #420 (Div. 2)-D-Okabe and City/f-CF-Codeforces Round #420 (Div. 2)-D-Okabe and City/main.cpp type edge (line 27) | struct edge method edge (line 30) | edge() {} method edge (line 31) | edge(int to_, int cost_) : to(to_), cost(cost_) {} function add_edge (line 34) | void add_edge(vector G[], int r, int c) function dijkstra (line 59) | void dijkstra(int s) function main (line 91) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #420 (Div. 2)-E-Okabe and El Psy Kongroo/f-CF-Codeforces Round #420 (Div. 2)-E-Okabe and El Psy Kongroo/main.cpp type Matrix (line 21) | struct Matrix function mat (line 28) | mat matrix_mul(mat a, mat b, int len) function init (line 49) | void init() function Matrix (line 73) | Matrix matrix_quick_power(mat a, ll k, int len) function main (line 93) | int main() FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #483 (Div. 2)-A-Game/f-CF-Codeforces Round #483 (Div. 2)-A-Game/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #483 (Div. 2)-B-Minesweeper/f-CF-Codeforces Round #483 (Div. 2)-B-Minesweeper/main.cpp type cell (line 21) | struct cell function judge (line 30) | bool judge(int x, int y) function change (line 40) | void change(int x, int y) function main (line 55) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #483 (Div. 2)-C-Finite or not?/f-CF-Codeforces Round #483 (Div. 2)-C-Finite or not?/main.cpp function ll (line 20) | ll gcd(ll x, ll y) function main (line 32) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #483 (Div. 2)-D-XOR-pyramid/f-CF-Codeforces Round #483 (Div. 2)-D-XOR-pyramid/main.cpp function fun_dp (line 20) | int fun_dp(int l, int r) function fun_dp_1 (line 33) | int fun_dp_1(int l, int r) function main (line 46) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #485 (Div. 2)/A-Infinity Gauntlet/main.cpp function init (line 25) | static void init() function main (line 35) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #485 (Div. 2)/B-High School: Become Human/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #485 (Div. 2)/C-Three displays/main.cpp function main (line 27) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #485 (Div. 2)/D-Fair/main.cpp function solve (line 32) | void solve() function main (line 62) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #485 (Div. 2)/E-Petr and Permutations/main.cpp function main (line 50) | int main() FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #487 (Div. 2)/A-A Blend of Springtime/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #487 (Div. 2)/B-A Tide of Riverscape/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #487 (Div. 2)/C-A Mist of Florescence/main.cpp function output (line 22) | void output() function main (line 35) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Codeforces Round #487 (Div. 2)/D-A Shade of Moonlight/main.cpp function main (line 23) | int main() FILE: 按 OJ 分类/CF/f-CF-Educational Codeforces Round 15-A-Maximum Increase/f-CF-Educational Codeforces Round 15-A-Maximum Increase/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Educational Codeforces Round 15-B-Powers of Two/CF-Educational Codeforces Round 15-B-Powers of Two/main.cpp function cinDiy (line 20) | inline void cinDiy(int &ret) function main (line 31) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-A-Chess Placing/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-A-Chess Placing/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-B-Switches and Lamps/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-B-Switches and Lamps/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-C-Liebig's Barrels/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-C-Liebig's Barrels/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-D-Sand Fortress/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-D-Sand Fortress/main.cpp function cal (line 15) | double cal(double x) function check (line 22) | bool check(ll m) function main (line 45) | int main() FILE: 按 OJ 分类/CF/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-E-Pencils and Boxes/f-CF-Educational Codeforces Round 44 (Rated for Div. 2)-E-Pencils and Boxes/main.cpp function main (line 68) | int main() FILE: 按 OJ 分类/CF/f-CF-Tinkoff Challenge-Elimination Round-A-Oleg and shares/f-CF-Tinkoff Challenge-Elimination Round-A-Oleg and shares/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Tinkoff Challenge-Elimination Round-B-Igor and his way to work/f-CF-Tinkoff Challenge-Elimination Round-B-Igor and his way to work/main.cpp function main (line 23) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/CF/f-CF-Tinkoff Challenge-Elimination Round-C-Mice problem/f-CF-Tinkoff Challenge-Elimination Round-C-Mice problem/main.cpp function getT (line 21) | void getT(double mx, double mvx, double mtx, double mtx_) function main (line 62) | int main() FILE: 按 OJ 分类/CF/f-CF-Tinkoff Challenge-Elimination Round-D-Presents in Bankopolis/f-CF-Tinkoff Challenge-Elimination Round-D-Presents in Bankopolis/main.cpp function init (line 27) | void init() function getDP (line 33) | int getDP(int st, int ed, int k, int dir) function main (line 72) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/EOJ/f-EOJ-大学生程序设计邀请赛（华东师范大学）-A-拼音魔法/f-EOJ-大学生程序设计邀请赛（华东师范大学）-A-拼音魔法/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/EOJ/f-EOJ-大学生程序设计邀请赛（华东师范大学）-B-分词/f-EOJ-大学生程序设计邀请赛（华东师范大学）-B-分词/main.cpp function format (line 25) | void format(int x) function main (line 44) | int main() FILE: 按 OJ 分类/EOJ/f-EOJ-大学生程序设计邀请赛（华东师范大学）-C-袋鼠妈妈找孩子/f-EOJ-大学生程序设计邀请赛（华东师范大学）-C-袋鼠妈妈找孩子/main.cpp function dfs (line 21) | bool dfs(int x, int y, int lim) function main (line 60) | int main() FILE: 按 OJ 分类/EOJ/f-EOJ-大学生程序设计邀请赛（华东师范大学）-D-实验室传染病/f-EOJ-大学生程序设计邀请赛（华东师范大学）-D-实验室传染病/main.cpp function update (line 24) | void update() function update_ (line 63) | void update_() function main (line 102) | int main() FILE: 按 OJ 分类/EOJ/f-EOJ-大学生程序设计邀请赛（华东师范大学）-E-黑心啤酒厂/f-EOJ-大学生程序设计邀请赛（华东师范大学）-E-黑心啤酒厂/main.cpp function gcd (line 13) | long long gcd(long long x, long long y) function main (line 23) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/EOJ/f-EOJ-大学生程序设计邀请赛（华东师范大学）-F-丽娃河的狼人传说/f-EOJ-大学生程序设计邀请赛（华东师范大学）-F-丽娃河的狼人传说/main.cpp type section (line 19) | struct section function cmp (line 26) | bool cmp(section a, section b) function main (line 35) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/EOJ/f-EOJ-大学生程序设计邀请赛（华东师范大学）-G-铁路修复计划/f-EOJ-大学生程序设计邀请赛（华东师范大学）-G-铁路修复计划/main.cpp type Edge (line 29) | struct Edge function addEdge (line 38) | void addEdge(int u, int v, double w) function addEdge0 (line 46) | void addEdge0(int u, int v, double w) function addEdge1 (line 54) | void addEdge1(int u, int v, double w) function cmp (line 62) | bool cmp(Edge a, Edge b) function find (line 68) | int find(int x) function Kruskal (line 82) | double Kruskal(int n) // 传入点数，返回最小生成树的权值，如果不连通则返回-1 function charge (line 126) | bool charge(double mid) function main (line 145) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/EOJ/f-EOJ-大学生程序设计邀请赛（华东师范大学）-H-法国传统舞蹈/f-EOJ-大学生程序设计邀请赛（华东师范大学）-H-法国传统舞蹈/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/EOJ/f-EOJ-大学生程序设计邀请赛（华东师范大学）-I-七巧板/f-EOJ-大学生程序设计邀请赛（华东师范大学）-I-七巧板/main.cpp type Lpoint (line 21) | struct Lpoint function area_of_polygon (line 30) | double area_of_polygon(int vcount, Lpoint plg[]) function main (line 49) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/GDUT/f-GDUT-1164-找出出现次数超过一半的数/f-GDUT-1164-找出出现次数超过一半的数/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Qingdao Online-1001-Apple/ICPC Asia Regional Qingdao Online-1001-Apple/main.cpp function main (line 242) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/ICPC Asia Regional Qingdao Online-1003-The Dominator of Strings/ICPC Asia Regional Qingdao Online-1003-The Dominator of Strings/main.cpp function main (line 23) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Qingdao Online-1008-Chinese Zodiac/ICPC Asia Regional Qingdao Online-1008-Chinese Zodiac/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Qingdao Online-1009-Smallest Minimum Cut/ICPC Asia Regional Qingdao Online-1009-Smallest Minimum Cut/main.cpp function ll (line 26) | ll min(ll a, ll b) type EDGE (line 38) | struct EDGE function edgeini (line 44) | void edgeini() function edgemake (line 50) | void edgemake(int from, int to, ll c) function make (line 58) | void make(int from, int to, ll c) function makelevel (line 64) | bool makelevel(int s, int t) function ll (line 91) | ll dfs(int now, int t, ll maxf) function ll (line 120) | ll maxflow(int s, int t) function main (line 130) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Qingdao Online-1010-Brute Force Sorting/ICPC Asia Regional Qingdao Online-1010-Brute Force Sorting/main.cpp function main (line 28) | int main(void) FILE: 按 OJ 分类/HDU/ICPC Asia Regional Qingdao Online-1011-A Cubic number and A Cubic Number/ICPC Asia Regional Qingdao Online-1011-A Cubic number and A Cubic Number/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Shenyang Online-1001-string string string/ICPC Asia Regional Shenyang Online-1001-string string string/main.cpp class SAM (line 19) | class SAM method clear (line 33) | void clear(char *_s) method extend (line 50) | void extend(char ch) method build (line 88) | void build() method calc (line 102) | void calc(int k) function main (line 143) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Shenyang Online-1002-cable cable cable/ICPC Asia Regional Shenyang Online-1002-cable cable cable/main.cpp function main (line 15) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Shenyang Online-1004-array array array/ICPC Asia Regional Shenyang Online-1004-array array array/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Shenyang Online-1005-number number number/ICPC Asia Regional Shenyang Online-1005-number number number/main.cpp function mull (line 23) | void mull(ll a[2][2], ll b[2][2]) function mul_pow (line 39) | void mul_pow(ll n) function main (line 54) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Shenyang Online-1008-transaction transaction transaction/ICPC Asia Regional Shenyang Online-1008-transaction transaction transaction/main.cpp type Node (line 24) | struct Node function AddEdge (line 29) | void AddEdge(int u, int v, int w) function spfa (line 37) | void spfa(int s) function init (line 67) | void init() function main (line 73) | int main() FILE: 按 OJ 分类/HDU/ICPC Asia Regional Shenyang Online-1012-card card card/ICPC Asia Regional Shenyang Online-1012-card card card/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/HDU/f-2016"百度之星"-资格赛-1001-A/f-2016"百度之星"-资格赛-1001-A/main.c function inv (line 24) | int inv(int a, int b) //b = MOD - 2 function main (line 39) | int main() FILE: 按 OJ 分类/HDU/f-2017"百度之星"程序设计大赛-资格赛-1002-度度熊的王国战略/f-2017"百度之星"程序设计大赛-资格赛-1002-度度熊的王国战略/main.cpp function find (line 23) | int find(int x) function main (line 32) | int main(void) FILE: 按 OJ 分类/HDU/f-2017"百度之星"程序设计大赛-资格赛-1003-度度熊与邪恶大魔王/f-2017"百度之星"程序设计大赛-资格赛-1003-度度熊与邪恶大魔王/main.cpp function main (line 29) | int main() FILE: 按 OJ 分类/HDU/f-2017"百度之星"程序设计大赛-资格赛-1004-度度熊的午饭时光/f-2017"百度之星"程序设计大赛-资格赛-1004-度度熊的午饭时光/main.cpp type meal (line 22) | struct meal function main (line 32) | int main() FILE: 按 OJ 分类/HDU/f-HDOJ-2066-一个人的旅行/f-HDOJ-2066-一个人的旅行/main.c type Status (line 109) | typedef void Status; type QElemType (line 110) | typedef int QElemType; type node (line 112) | struct node type SqQueue (line 128) | typedef struct function Status (line 136) | Status InitQueue(SqQueue *Q) function QueueLength (line 144) | int QueueLength(SqQueue Q) function Status (line 150) | Status EnQueue(SqQueue *Q, QElemType e) function Status (line 163) | Status DeQueue(SqQueue *Q) function init (line 173) | void init() function add (line 182) | void add(int a, int b, int time) function spfa (line 191) | void spfa(int neiCity) function main (line 225) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1003-Max Sum/f-HDU-1003-Max Sum/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1004-Let the Balloon Rise/f-HDU-1004-Let the Balloon Rise/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1005-Number Sequence/f-HDU-1005-Number Sequence/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1007-Quoit Design/f-HDU-1007-Quoit Design/main.cpp type Point (line 19) | struct Point function main (line 34) | int main() function closest (line 59) | double closest(Point a[],Point b[],Point c[],int p,int q) function dis (line 122) | double dis(Point p, Point q) function merge (line 128) | int merge(Point p[], Point q[], int s, int m, int t) function cmp_x (line 154) | int cmp_x(const void *p, const void *q) function cmp_y (line 171) | int cmp_y(const void *p, const void *q) function min (line 188) | inline double min(double p, double q) FILE: 按 OJ 分类/HDU/f-HDU-1008-Elevator/f-HDU-1008-Elevator/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1009-FatMouse' Trade/f-HDU-1009-FatMouse' Trade/main.cpp type room (line 16) | struct room function cmp (line 23) | bool cmp(room a, room b) function main (line 28) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1010-Tempter of the Bone/f-HDU-1010-Tempter of the Bone/main.cpp function init (line 27) | void init() function dfs (line 60) | void dfs(int x, int y, int steps) function main (line 98) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1011-Starship Troopers/f-HDU-1011-Starship Troopers/main.cpp function max (line 27) | inline int max(int a, int b) function dfs (line 32) | void dfs(int p) function main (line 58) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1021-Fibonacci Again/f-HDU-1021-Fibonacci Again/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1050-Moving Tables/f-HDU-1050-Moving Tables/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/HDU/f-HDU-1102-Constructing Roads/f-HDU-1102-Constructing Roads/main.cpp function updata (line 29) | void updata(int x, int y, int v) function Prim (line 36) | int Prim(int cost[][MAXN], int n) // 0 ~ n - 1 function main (line 74) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1142-A Walk Through the Forest/f-HDU-1142-A Walk Through the Forest/main.cpp function Dijkstra (line 26) | void Dijkstra(int cost[][MAXN], int lowcost[], int n, int beg) function dfs (line 67) | int dfs(int s, int n) function main (line 91) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1162-Eddy's picture/f-HDU-1162-Eddy's picture/main.cpp type land (line 17) | struct land type land (line 34) | struct land function updata (line 37) | void updata(int x, int y, double v) function Prim (line 44) | double Prim(double cost[][MAXN], int n) // 0 ~ n - 1 function main (line 82) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1166-敌兵布阵/f-HDU-1166-敌兵布阵/main.cpp type node (line 21) | struct node method node (line 28) | node() function Tree (line 34) | Tree *CreateTree(int a, int b) function update (line 57) | void update(Tree *r, int a, int b) function find (line 76) | void find(Tree* r, int a, int b) function main (line 99) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1176-免费馅饼/f-HDU-1176-免费馅饼/main.cpp function main (line 21) | int main ( ) FILE: 按 OJ 分类/HDU/f-HDU-1198-Farm Irrigation/f-HDU-1198-Farm Irrigation/main.cpp function find (line 31) | int find(int x) function join (line 49) | void join(int x, int y) function main (line 102) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1213-How Many Tables/f-HDU-1213-How Many Tables/main.cpp function find (line 22) | int find(int x) function join (line 40) | void join(int x, int y) function main (line 51) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1217-Arbitrage/f-HDU-1217-Arbitrage/main.cpp function Floyd (line 135) | void Floyd(typec edges[][MAXN], int n) function main (line 158) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1224-Free DIY Tour/f-HDU-1224-Free DIY Tour/main.cpp type A (line 14) | struct A function main (line 25) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1232-畅通工程/f-HDU-1232-畅通工程/main.cpp function find (line 23) | int find(int x) function join (line 41) | void join(int x, int y) function main (line 53) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1233-还是畅通工程/f-HDU-1233-还是畅通工程/main.cpp function updata (line 29) | void updata(int x, int y, int v) function Prim (line 36) | int Prim(int cost[][MAXN], int n) // 0 ~ n - 1 function main (line 74) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1245-Saving James Bond/f-HDU-1245-Saving James Bond/main.cpp type cro (line 18) | struct cro type cro (line 24) | struct cro function dijkstra (line 39) | void dijkstra(int st, int n) function getDis (line 86) | double getDis(struct cro a, struct cro b) function getDis_ (line 92) | double getDis_(struct cro c) function main (line 101) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1272-小希的迷宫/f-HDU-1272-小希的迷宫/main.cpp function find (line 25) | int find(int x) function join (line 43) | void join(int x, int y) function main (line 69) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1286-找新朋友/f-HDU-1286-找新朋友/main.cpp function phi_and_prime_table (line 28) | void phi_and_prime_table(int N) function main (line 61) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1301-Jungle Roads/f-HDU-1301-Jungle Roads/main.cpp function updata (line 29) | void updata(int x, int y, int v) function Prim (line 36) | int Prim(int cost[][MAXN], int n) // 0 ~ n - 1 function main (line 74) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1317-XYZZY/f-HDU-1317-XYZZY/main.cpp type edge (line 23) | struct edge function floyd (line 30) | void floyd() function bellman_ford (line 44) | bool bellman_ford(int s) function main (line 75) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1325-Is It A Tree?/f-HDU-1325-Is It A Tree?/main.cpp function init (line 145) | void init() function find_root (line 156) | int find_root(int a) function union_set (line 165) | void union_set(int a, int b) function main (line 176) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1385-Minimum Transport Cost/f-HDU-1385-Minimum Transport Cost/main.cpp function Floyd (line 26) | void Floyd(int n) function main (line 59) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1394-Minimum Inversion Number/f-HDU-1394-Minimum Inversion Number/main.cpp function pushUp (line 18) | void pushUp(int root) function build (line 23) | void build(int root, int l, int r) function update (line 36) | void update(int root, int val, int l, int r) function query (line 57) | int query(int L, int R, int l, int r, int root) function main (line 79) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1402-A*B Problem Plus/f-HDU-1402-A*B Problem Plus/main.cpp type Complex (line 27) | struct Complex method Complex (line 30) | Complex(double _x = 0.0, double _y = 0.0) method Complex (line 35) | Complex operator - (const Complex &b) const method Complex (line 39) | Complex operator + (const Complex &b) const method Complex (line 43) | Complex operator * (const Complex &b) const function change (line 52) | void change(Complex y[], int len) function fft (line 80) | void fft(Complex y[], int len, int on) function main (line 113) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1512-Monkey King/f-HDU-1512-Monkey King/main.cpp type node (line 16) | struct node function init (line 25) | void init(int p, int k) function find (line 33) | int find(int x) function merge (line 45) | int merge(int x, int y) function del (line 79) | int del(int x) function solve (line 89) | int solve(int x, int y) function main (line 101) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1532-Drainage Ditches/f-HDU-1532-Drainage Ditches/main.cpp type edge (line 26) | struct edge function addedge (line 34) | void addedge(int x, int y, typec c) function typec (line 49) | typec flow(int n, int s, int t) function main (line 123) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1535-Invitation Cards/f-HDU-1535-Invitation Cards/main.cpp type Edge (line 19) | struct Edge method Edge (line 23) | Edge(int _v = 0, int _cost = 0) : v(_v), cost(_cost) {} function init (line 28) | void init() function addEdge (line 36) | void addEdge(int u, int v, int w) function SPFA (line 45) | bool SPFA(int start, int n) function main (line 94) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1546-Idiomatic Phrases Game/f-HDU-1546-Idiomatic Phrases Game/main.cpp function dijkstra (line 23) | void dijkstra(int n, int beg) function store (line 63) | void store(int n) function main (line 97) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1548-A strange lift/f-HDU-1548-A strange lift/main.cpp function Dijkstra (line 26) | void Dijkstra(int cost[][MAXN], int lowcost[], int n, int beg) function main (line 66) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1558-Segment set/f-HDU-1558-Segment set/main.cpp type point (line 14) | struct point type edge (line 19) | struct edge type edge (line 27) | struct edge function min (line 29) | double min(double a, double b) function max (line 34) | double max(double a, double b) function inter (line 39) | bool inter(point a, point b, point c, point d) function find (line 53) | int find(int x) function join (line 71) | void join(int x, int y) function main (line 84) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1573-X问题/f-51Nod-1573-X问题/main.cpp function ll (line 17) | ll extgcd(ll a, ll b, ll &x, ll &y) function main (line 35) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1576-A÷B/f-HDU-1576-A÷B/main.cpp function extgcd (line 15) | int extgcd(int a, int b, int &x, int &y) function modeq (line 32) | int modeq(int a, int b, int n) function main (line 43) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1595-find the longest of the shortest/f-HDU-1595-find the longest of the shortest/main.cpp function Dijkstra (line 25) | void Dijkstra(int cost[][MAXN], int lowcost[], int n, int beg, int flag) function main (line 71) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1596-find the safest road/f-HDU-1596-find the safest road/main.cpp function Floyd (line 20) | void Floyd(int n) function main (line 40) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1598-find the most comfortable road/f-HDU-1598-find the most comfortable road/main.cpp type Edge (line 21) | struct Edge function addEdge (line 30) | void addEdge(int u, int v, int w) function cmp (line 38) | bool cmp(Edge a, Edge b) function find (line 44) | int find(int x) function join (line 56) | void join(int x, int y) function init (line 67) | void init(int n) function main (line 75) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1599-find the mincost route/f-HDU-1599-find the mincost route/main.cpp function solve (line 22) | int solve(int i, int j, int k) function main (line 35) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1688-Sightseeing/f-HDU-1688-Sightseeing/main.cpp type Edge (line 21) | struct Edge type node (line 26) | struct node function init (line 48) | void init() function Dijstra (line 58) | void Dijstra(int st, int ed) function main (line 125) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1690-Bus System/f-HDU-1690-Bus System/main.cpp function ll (line 25) | ll getC(ll dis) function floyd (line 46) | void floyd(int n) function main (line 60) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1695-GCD/f-HDU-1695-GCD/main.cpp function init (line 22) | void init() function main (line 52) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1698-Just a Hook/f-HDU-1698-Just a Hook/main.cpp type node (line 15) | struct node function build (line 25) | void build(int root, int left, int right) function updata (line 45) | void updata(int root, int left, int right, int data) function main (line 88) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1754-I Hate It/f-HDU-1754-I Hate It/main.cpp function build (line 27) | int build(int root, int left, int right) function find (line 48) | int find(int root, int left, int right) function update (line 67) | int update(int root, int pos, int val) function main (line 88) | int main () FILE: 按 OJ 分类/HDU/f-HDU-1811-Rank of Tetris/f-HDU-1811-Rank of Tetris/main.cpp type node (line 212) | struct node function find (line 220) | int find(int u) function join (line 229) | void join(int a, int b) function addEdge (line 239) | void addEdge(int a, int b) type rel (line 246) | struct rel function main (line 253) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1829-A Bug's Life/f-HDU-1829-A Bug's Life/main.cpp function init (line 17) | void init(int n) function find (line 27) | int find(int x) function join (line 39) | void join(int x, int y) function main (line 60) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1839-Delay Constrained Maximum Capacity Path/f-HDU-1839-Delay Constrained Maximum Capacity Path/main.cpp type Edge (line 21) | struct Edge function init (line 35) | void init() function addEdge (line 41) | void addEdge(int u, int v, int c, int d) function Dijkstra (line 50) | int Dijkstra(int src) function main (line 85) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1846-Brave Game/f-HDU-1846-Brave Game/main.cpp function bash (line 17) | int bash(int N, int K) function main (line 26) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1847-Good Luck in CET-4 Everybody!/f-HDU-1847-Good Luck in CET-4 Everybody!/main.cpp function get_SG (line 22) | void get_SG(int n) function main (line 45) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1850-Being a Good Boy in Spring Festival/f-HDU-1850-Being a Good Boy in Spring Festival/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1856-More is better/f-HDU-1856-More is better/main.cpp function find (line 25) | int find(int x) function join (line 43) | void join(int x, int y) function main (line 65) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1863-畅通工程/f-HDU-1863-畅通工程/main.cpp function updata (line 29) | void updata(int x, int y, int v) function Prim (line 36) | int Prim(int cost[][MAXN], int n) // 0 ~ n - 1 function main (line 74) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1869-六度分离/f-HDU-1869-六度分离/main.cpp function Floyd (line 24) | void Floyd(int n) function main (line 46) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1874-畅通工程续/f-HDU-1874-畅通工程续/main.cpp function Dijkstra (line 26) | void Dijkstra(int cost[][MAXN], int lowcost[], int n, int beg) function main (line 67) | int main() FILE: 按 OJ 分类/HDU/f-HDU-1875-畅通工程再续/f-HDU-1875-畅通工程再续/main.cpp type land (line 17) | struct land type land (line 34) | struct land function updata (line 37) | void updata(int x, int y, double v) function Prim (line 44) | double Prim(double cost[][MAXN], int n) // 0 ~ n - 1 function main (line 82) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-1879-继续畅通工程/f-HDU-1879-继续畅通工程/main.cpp function updata (line 29) | void updata(int x, int y, int v) function Prim (line 36) | int Prim(int cost[][MAXN], int n) // 0 ~ n - 1 function main (line 74) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2000-ASCII码排序/f-HDU-2000-ASCII码排序/main.cpp function main (line 5) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2007-平方和与立方和/f-HDU-2007-平方和与立方和/main.cpp function main (line 13) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2010-水仙花数/f-HDU-2010-水仙花数/main.cpp function main (line 13) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛1-1001-Add More Zero/f-HDU-2017 多校训练赛1-1001-Add More Zero/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛1-1002-Balala Power!/f-HDU-2017 多校训练赛1-1002-Balala Power!/main.cpp type node (line 140) | struct node function cmp (line 148) | bool cmp(node &A, node &B) function main (line 163) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛1-1003-Colorful Tree/f-HDU-2017 多校训练赛1-1003-Colorful Tree/main.cpp type Edge (line 26) | struct Edge function ll (line 31) | inline ll get_cnt(int x) function dfs (line 36) | int dfs(int rt, int pre) function scan_d (line 57) | inline void scan_d(T &ret) function main (line 68) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛1-1006-Function/f-HDU-2017 多校训练赛1-1006-Function/main.cpp type Node (line 19) | struct Node function Tarjan (line 38) | void Tarjan(int u) function init (line 72) | void init() function solve (line 81) | int solve() function AddEdge (line 102) | void AddEdge(int u, int v) function main (line 110) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛1-1008-Hints of sd0061/f-HDU-2017 多校训练赛1-1008-Hints of sd0061/main.cpp type xxx (line 21) | struct xxx function rng61 (line 32) | inline unsigned rng61() function main (line 45) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛1-1011-KazaQ's Socks/f-HDU-2017 多校训练赛1-1011-KazaQ's Socks/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛10-1001-Admiral/f-HDU-2017 多校训练赛10-1001-Admiral/main.cpp type node (line 26) | struct node function ll (line 34) | ll _hash(node &t) function bfs (line 51) | int bfs(node &s, node &t) function main (line 116) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛10-1002-Array Challenge/f-HDU-2017 多校训练赛10-1002-Array Challenge/main.cpp type matrix (line 22) | struct matrix method matrix (line 26) | matrix() function init (line 35) | void init() function matrix (line 46) | matrix mul(matrix a, matrix b) method matrix (line 26) | matrix() function matrix (line 63) | matrix pow(matrix p, ll k) method matrix (line 26) | matrix() function main (line 80) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛10-1008-Monkeys/f-HDU-2017 多校训练赛10-1008-Monkeys/main.cpp type FastIO (line 24) | struct FastIO method FastIO (line 31) | FastIO() : wpos(0) {} method xchar (line 33) | inline int xchar() method xint (line 51) | inline int xint() function main (line 81) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛10-1010-Schedule/f-HDU-2017 多校训练赛10-1010-Schedule/main.cpp type node (line 22) | struct node function cmp (line 27) | bool cmp(node a, node b) function main (line 34) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛10-1011-Two Paths/f-HDU-2017 多校训练赛10-1011-Two Paths/main.cpp type Edge (line 28) | struct Edge method Edge (line 32) | Edge() {} method Edge (line 33) | Edge(int _u, int _v, ll _c) : u(_u), v(_v), c(_c) {} type qnode (line 36) | struct qnode method qnode (line 41) | qnode() {} method qnode (line 43) | qnode(int _v, ll _c) : v(_v), c(_c) {} function addedge (line 51) | void addedge(int u, int v, ll c) function dij (line 60) | void dij(int src) function ll (line 94) | ll a_star(int src) function main (line 127) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛2-1001-Is Derek lying?/f-HDU-2017 多校训练赛2-1001-Is Derek lying?/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛2-1003-Maximum Sequence/f-HDU-2017 多校训练赛2-1003-Maximum Sequence/main.cpp function scan_d (line 25) | inline void scan_d(T &ret) function main (line 36) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛2-1006-Funny Function/f-HDU-2017 多校训练赛2-1006-Funny Function/main.cpp function ll (line 17) | ll QPow(ll x, ll n) function ll (line 32) | ll inv(ll x) function main (line 41) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛2-1008-To my boyfriend/f-HDU-2017 多校训练赛2-1008-To my boyfriend/main.cpp type node (line 18) | struct node method node (line 21) | node() {} method node (line 22) | node(int a, int b) function get_cnt (line 36) | int get_cnt(int l, int r, int i, int j, int col) function scan_d (line 65) | inline void scan_d(T &ret) function main (line 76) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛2-1009-TrickGCD/f-HDU-2017 多校训练赛2-1009-TrickGCD/main.cpp function mobius (line 22) | void mobius(int x) function ll (line 37) | ll QPow(ll x, int y) function scan_d (line 54) | inline void scan_d(T &ret) function main (line 65) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛2-1011-Regular polygon/f-HDU-2017 多校训练赛2-1011-Regular polygon/main.cpp type Node (line 16) | struct Node type hashTable (line 21) | struct hashTable method hashTable (line 26) | hashTable() function insert (line 35) | void insert(int k) function find (line 61) | bool find(int x, int y) function main (line 87) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛3-1001-simple counting problem/f-HDU-2017 多校训练赛3-1001-simple counting problem/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛3-1003-Kanade’s sum/f-HDU-2017 多校训练赛3-1003-Kanade’s sum/main.cpp function scan_d (line 21) | inline void scan_d(T &ret) function erase (line 39) | void erase(int x) function solve (line 54) | void solve() function main (line 88) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛3-1004-Kanade's trio/f-HDU-2017 多校训练赛3-1004-Kanade's trio/main.cpp function scan_d (line 20) | inline void scan_d(T &ret) function main (line 38) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛3-1005-RXD and dividing/f-HDU-2017 多校训练赛3-1005-RXD and dividing/main.cpp type Edge (line 26) | struct Edge method Edge (line 30) | Edge(int a = 0, int b = 0, int c = 0) : to(a), dis(b), net(c) {} function add (line 33) | void add(int u, int v, int w) function bfs (line 39) | void bfs(int src) function solve (line 71) | void solve() function main (line 81) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛3-1008-RXD and math/f-HDU-2017 多校训练赛3-1008-RXD and math/main.cpp function ll (line 20) | ll QPow(ll x, ll n) function main (line 38) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛3-1011-RXD's date/f-HDU-2017 多校训练赛3-1011-RXD's date/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛4-1003-Counting Divisors/f-HDU-2017 多校训练赛4-1003-Counting Divisors/main.cpp function init (line 24) | void init() function solve (line 45) | void solve() function main (line 91) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛4-1004-Dirt Ratio/f-HDU-2017 多校训练赛4-1004-Dirt Ratio/main.cpp function pushdown (line 29) | inline void pushdown(int rt) function build (line 41) | void build(int rt, int l, int r, double w) function update (line 55) | void update(int rt, int l, int r, int ql, int qr) function query (line 77) | void query(int rt, int l, int r, int p) function scan_d (line 98) | inline void scan_d(T &ret) function main (line 109) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛4-1007-Matching In Multiplication/f-HDU-2017 多校训练赛4-1007-Matching In Multiplication/main.cpp function add (line 23) | inline void add(int x, int y, int z) function go (line 38) | inline int go(int x) function get (line 51) | inline int get(int x, int y) function init (line 64) | void init() function main (line 74) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛4-1009-Questionnaire/f-HDU-2017 多校训练赛4-1009-Questionnaire/main.cpp function main (line 15) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛4-1011-Time To Get Up/f-HDU-2017 多校训练赛4-1011-Time To Get Up/main.cpp function check (line 21) | int check() function main (line 73) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛4-1012-Wavel Sequence/f-HDU-2017 多校训练赛4-1012-Wavel Sequence/main.cpp function get_mod (line 19) | inline void get_mod(int &x, int y) function main (line 28) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛5-1001-Rikka with Candies/f-HDU-2017 多校训练赛5-1001-Rikka with Candies/main.cpp function solve (line 22) | void solve(int mk) function scan_d (line 41) | inline void scan_d(T &ret) function main (line 52) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛5-1006-Rikka with Graph/f-HDU-2017 多校训练赛5-1006-Rikka with Graph/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛5-1008-Rikka with Subset/f-HDU-2017 多校训练赛5-1008-Rikka with Subset/main.cpp function solve (line 24) | void solve() function main (line 44) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛5-1011-Rikka with Competition/f-HDU-2017 多校训练赛5-1011-Rikka with Competition/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛6-1002-Mindis/f-HDU-2017 多校训练赛6-1002-Mindis/main.cpp function get_dis (line 23) | double get_dis(const point &P1, const point &P2) function main (line 30) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛6-1003-Inversion/f-HDU-2017 多校训练赛6-1003-Inversion/main.cpp type node (line 17) | struct node function cmp (line 22) | bool cmp(node x, node y) function solve (line 29) | int solve(int x) function scan_d (line 40) | inline void scan_d(T &ret) function main (line 51) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛6-1007-GCDispower/f-HDU-2017 多校训练赛6-1007-GCDispower/main.cpp type array (line 20) | struct array // 树状数组 method clear (line 25) | void clear() method array (line 30) | array() method lowbit (line 36) | int lowbit(int x) method add (line 41) | void add(int x, ll key) method ll (line 50) | ll sum(int x) // 查询前x个元素 method ll (line 61) | ll get(int L, int R) type node (line 67) | struct node method node (line 71) | node(int L, int R, int id) : L(L), R(R), id(id) {} method node (line 73) | node() function get_miu (line 87) | void get_miu() function init (line 102) | void init() function solve (line 121) | void solve() function main (line 164) | int main () FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛6-1008-Kirinriki/f-HDU-2017 多校训练赛6-1008-Kirinriki/main.cpp function check (line 25) | void check() function solve (line 40) | void solve() function main (line 68) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛6-1010-Gameia/f-HDU-2017 多校训练赛6-1010-Gameia/main.cpp function dfs (line 21) | void dfs(int u) function init (line 41) | void init() function main (line 50) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛6-1011-Classes/f-HDU-2017 多校训练赛6-1011-Classes/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛7-1002-Build a tree/f-HDU-2017 多校训练赛7-1002-Build a tree/main.cpp function ll (line 24) | ll HR(ll a, ll n, ll k) function ll (line 34) | ll HL(ll a, ll n, ll k) function ll (line 45) | ll slove(ll L, ll R, ll n, ll k) function ll (line 79) | ll cal(ll n, ll m) function main (line 99) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛7-1005-Euler theorem/f-HDU-2017 多校训练赛7-1005-Euler theorem/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛7-1008-Hard challenge/f-HDU-2017 多校训练赛7-1008-Hard challenge/main.cpp type node (line 17) | struct node function cmp (line 31) | bool cmp(node a, node b) function main (line 38) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛7-1010-Just do it/f-HDU-2017 多校训练赛7-1010-Just do it/main.cpp function main (line 16) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛7-1011-Kolakoski/f-HDU-2017 多校训练赛7-1011-Kolakoski/main.cpp function init (line 18) | void init() function main (line 43) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛8-1002-Battlestation Operational/f-HDU-2017 多校训练赛8-1002-Battlestation Operational/main.cpp function Mobius (line 28) | void Mobius() function main (line 79) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛8-1006-Fleet of the Eternal Throne/f-HDU-2017 多校训练赛8-1006-Fleet of the Eternal Throne/main.cpp type AC (line 18) | struct AC function clear (line 31) | void clear(AC *node) function AC (line 43) | AC *create() function insert (line 53) | void insert(AC *root, char *word) function init (line 70) | void init() function input (line 79) | void input() function build (line 94) | void build() function search (line 130) | void search(char *word, int f) function query (line 155) | void query(char *word, int f) function solve (line 183) | void solve() function main (line 198) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛8-1008-Hybrid Crystals/f-HDU-2017 多校训练赛8-1008-Hybrid Crystals/main.cpp function main (line 18) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛8-1011-Killer Names/f-HDU-2017 多校训练赛8-1011-Killer Names/main.cpp function ll (line 22) | ll QPow(ll x, ll n) function init (line 40) | void init() function main (line 53) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛9-1002-Ch’s gift/f-HDU-2017 多校训练赛9-1002-Ch’s gift/main.cpp function init (line 33) | void init(int n) function low (line 43) | int low(int *a, int pos, int R) function builde (line 66) | void builde(int l, int r, int &o) function update (line 81) | void update(int last, int l, int r, int pos, int &o) function ll (line 103) | ll query(int ll, int rr, int l, int r) function LCA (line 124) | int LCA(int p, int q) function preprocess (line 157) | void preprocess(int n) function dfs (line 180) | void dfs(int u, int p, int m) function low1 (line 199) | int low1(int *a, int pos, int R) function main (line 219) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛9-1005-FFF at Valentine/f-HDU-2017 多校训练赛9-1005-FFF at Valentine/main.cpp function add_edge (line 24) | void add_edge(int u, int v) function dfs_1 (line 30) | void dfs_1(int x) function dfs_2 (line 42) | void dfs_2(int x) function init (line 54) | void init() function main (line 64) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛9-1006-Senior Pan/f-HDU-2017 多校训练赛9-1006-Senior Pan/main.cpp type Edge (line 23) | struct Edge type node (line 28) | struct node function addedge (line 46) | void addedge(int u, int v, int val) function ll (line 54) | ll dijkstra() function init (line 79) | void init() function ll (line 90) | ll solve(int k) function main (line 129) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛9-1008-Numbers/f-HDU-2017 多校训练赛9-1008-Numbers/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017 多校训练赛9-1010-Two strings/f-HDU-2017 多校训练赛9-1010-Two strings/main.cpp function main (line 97) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017"百度之星"程序设计大赛-初赛(B)-1001-Chess/f-HDU-2017"百度之星"程序设计大赛-初赛(B)-1001-Chess/main.cpp function ll (line 22) | ll QPow(ll x, ll n) function init (line 40) | void init() function ll (line 54) | ll C(ll a, ll b) function main (line 67) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017"百度之星"程序设计大赛-初赛(B)-1002-Factory/f-HDU-2017"百度之星"程序设计大赛-初赛(B)-1002-Factory/main.cpp type edge (line 19) | struct edge method edge (line 22) | edge(int x, int w) : x(x), w(w) {} function dfs (line 33) | void dfs(int x, int p) function lca (line 54) | int lca(int x, int y) function scan_d (line 85) | inline void scan_d(T &ret) function main (line 96) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017"百度之星"程序设计大赛-初赛(B)-1005-度度熊的交易计划/f-HDU-2017"百度之星"程序设计大赛-初赛(B)-1005-度度熊的交易计划/main.cpp type Edge (line 20) | struct Edge method Edge (line 23) | Edge() {} method Edge (line 24) | Edge(int v, int c, int w, int next) : v(v), c(c), w(w), next(next) {} function addedges (line 35) | void addedges(int u, int v, int c, int w) function spfa (line 43) | bool spfa() function mfmc (line 89) | int mfmc() function init (line 96) | void init() function scan_d (line 108) | inline void scan_d(T &ret) function work (line 119) | void work() function main (line 174) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017"百度之星"程序设计大赛-初赛(B)-1006-小小粉丝度度熊/f-HDU-2017"百度之星"程序设计大赛-初赛(B)-1006-小小粉丝度度熊/main.cpp type node (line 22) | struct node function cmp (line 27) | int cmp(node a, node b) function main (line 36) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017"百度之星"程序设计大赛-复赛-1001-Arithmetic of Bomb/f-HDU-2017"百度之星"程序设计大赛-复赛-1001-Arithmetic of Bomb/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017"百度之星"程序设计大赛-复赛-1003-Pokémon GO/f-HDU-2017"百度之星"程序设计大赛-复赛-1003-Pokémon GO/main.cpp function init (line 18) | void init() function main (line 33) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017"百度之星"程序设计大赛-复赛-1005-Valley Numer/f-HDU-2017"百度之星"程序设计大赛-复赛-1005-Valley Numer/main.cpp function dfs (line 24) | int dfs(int pos, int pre, int up, int down, int flag, int tag, int len) function cal (line 74) | int cal() function main (line 84) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017"百度之星"程序设计大赛-复赛-1006-Valley Numer II/f-HDU-2017"百度之星"程序设计大赛-复赛-1006-Valley Numer II/main.cpp function main (line 25) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1001-Vertex Cover/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1001-Vertex Cover/main.cpp function solve (line 20) | void solve() function output (line 38) | void output() function main (line 52) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1003-Friend-Graph/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1003-Friend-Graph/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1004-A Secret/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1004-A Secret/main.cpp function get_nt (line 22) | void get_nt(char *p, int *nt, int *val) function KMP_Count (line 46) | int KMP_Count(char *p, int *nt, char *t, int *val) function main (line 67) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1005-CaoHaha's staff/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1005-CaoHaha's staff/main.cpp function init (line 21) | void init() function main (line 40) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1006-Subsequence Count/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1006-Subsequence Count/main.cpp function scan_d (line 29) | inline void scan_d(T &ret) function print_d (line 41) | inline void print_d(T x) function read_S (line 50) | void read_S() function main (line 61) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1007-Palindrome Function/f-HDU-2017中国大学生程序设计竞赛-网络选拔赛-1007-Palindrome Function/main.cpp function init (line 27) | void init() function check (line 59) | bool check() function cal (line 77) | int cal(int key) function solve (line 122) | void solve() function scan_d (line 158) | inline void scan_d(T &ret) function main (line 169) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2050-折线分割平面/f-HDU-2050-折线分割平面/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2058-The sum problem/f-HDU-2058-The sum problem/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/HDU/f-HDU-2066-一个人的旅行/f-HDU-2066-一个人的旅行/main.cpp function Dijkstra (line 26) | void Dijkstra(int cost[][MAXN], int lowcost[], int n, int beg) function main (line 68) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2112-HDU Today/f-HDU-2112-HDU Today/main.cpp function Dijkstra (line 167) | void Dijkstra(int cost[][MAXN], int lowcost[], int n, int beg) function main (line 209) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2121-Ice_cream’s world II/f-HDU-2121-Ice_cream’s world II/main.cpp type Edge (line 24) | struct Edge function zhuliu (line 34) | int zhuliu(int root, int n, int m) function main (line 109) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2211-杀人游戏/f-HDU-2211-杀人游戏/main.cpp function f (line 16) | int f(int n) function main (line 27) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2224-The shortest path/f-HDU-2224-The shortest path/main.cpp type node (line 21) | struct node function dist (line 26) | double dist(node a, node b) function solve (line 34) | void solve() function main (line 55) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2363-Cycling/f-HDU-2363-Cycling/main.cpp function Dijkstra (line 33) | void Dijkstra(int n, int beg, ll low, ll high) function main (line 74) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2377-Bus Pass/f-HDU-2377-Bus Pass/main.cpp function cmp (line 28) | bool cmp(int a, int b) function spfa (line 33) | void spfa(int st) function buildGraph (line 66) | void buildGraph() function main (line 88) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2473-Junk-Mail Filter/f-HDU-2473-Junk-Mail Filter/main.cpp function init (line 22) | void init() function find (line 31) | int find(int x) function join (line 41) | void join(int x, int y) function main (line 53) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2489-Minimal Ratio Tree/f-HDU-2489-Minimal Ratio Tree/main.cpp function prim (line 26) | double prim() function dfs (line 83) | void dfs(int u, int num) function main (line 109) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2490-Parade/f-HDU-2490-Parade/main.cpp function scan_d (line 27) | inline bool scan_d(T &ret) type node (line 49) | struct node method node (line 53) | node() {} method node (line 54) | node(int h, int d) : hap(h), dis(d) {} function main (line 57) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2516-取石子游戏/f-HDU-2516-取石子游戏/main.cpp function init (line 18) | void init() function main (line 26) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2544-最短路/f-HDU-2544-最短路/main.cpp function Dijkstra (line 25) | void Dijkstra(int cost[][MAXN], int lowcost[], int n, int beg) function main (line 65) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2586-How far away ？/f-HDU-2586-How far away ？/main.cpp type ST (line 20) | struct ST method init (line 24) | void init(int n) method query (line 40) | int query(int a,int b) // 查询[a,b]之间最小值的下标 type Edge (line 52) | struct Edge function init (line 65) | void init() function addedge (line 72) | void addedge(int u, int v, int w) // 加边,无向边需要加两次 function dfs (line 81) | void dfs(int u, int pre, int dep) function LCA_init (line 100) | void LCA_init(int root, int node_num) // 查询LCA前的初始化 function query_lca (line 107) | int query_lca(int u, int v) // 查询u,v的lca编号 function main (line 114) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2588-GCD/f-HDU-2588-GCD/main.cpp function Euler (line 12) | int Euler(int n) function solve (line 40) | int solve(int n, int m) function main (line 65) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2680-Choose the best route/f-HDU-2680-Choose the best route/main.cpp function dijkstra (line 22) | void dijkstra(int n, int beg) function main (line 57) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2722-Here We Go(relians) Again/f-HDU-2722-Here We Go(relians) Again/main.cpp type Edge (line 24) | struct Edge function addEdge (line 36) | void addEdge(int u, int v, int w) function init (line 44) | void init() function Dijkstra (line 51) | void Dijkstra(int src) function main (line 80) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2795-Billboard/f-HDU-2795-Billboard/main.cpp function build (line 20) | void build(int l, int r, int u) function query (line 32) | int query(int x, int l, int r, int u) function main (line 55) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2807-The Shortest Path/f-HDU-2807-The Shortest Path/main.cpp type Matrix (line 22) | struct Matrix method Matrix (line 26) | Matrix() method Matrix (line 31) | Matrix(const Matrix &a) method Matrix (line 36) | Matrix & operator = (const Matrix &a) method set_size (line 42) | void set_size(int row, int column) method Matrix (line 47) | Matrix operator * (const Matrix &a, const Matrix &b) function init (line 93) | void init() function floyd (line 98) | void floyd() function main (line 115) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2818-Building Block/f-HDU-2818-Building Block/main.cpp function find (line 21) | int find(int x) function join (line 32) | void join(int x, int y) function main (line 45) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2833-WuKong/f-HDU-2833-WuKong/main.cpp function init (line 130) | void init() function dijkstra (line 142) | void dijkstra(int u, int lowc[]) function dfs (line 179) | int dfs(int a, int b) function main (line 222) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2874-Connections between cities/f-HDU-2874-Connections between cities/main.cpp type ST (line 21) | struct ST method init (line 25) | void init(int n) method query (line 41) | int query(int a,int b) // 查询[a,b]之间最小值的下标 type Edge (line 53) | struct Edge function init (line 66) | void init() function addedge (line 74) | void addedge(int u, int v, int w) // 加边,无向边需要加两次 function dfs (line 83) | void dfs(int u, int pre, int dep) function LCA_init (line 103) | void LCA_init(int node_num) // 查询LCA前的初始化 function query_lca (line 109) | int query_lca(int u, int v) // 查询u,v的lca编号 function find (line 116) | int find(int x) function join (line 125) | void join(int x, int y) function main (line 136) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2888-Check Corners/f-HDU-2888-Check Corners/main.cpp function initRMQ (line 21) | void initRMQ(int n, int m) function rmq (line 56) | int rmq(int x1, int y1, int x2, int y2) function main (line 65) | int main() FILE: 按 OJ 分类/HDU/f-HDU-2923-Einbahnstrasse/f-HDU-2923-Einbahnstrasse/main.cpp function Dijkstra (line 35) | void Dijkstra(int cost[][MAXN], int lowcost[], int n, int beg) function main (line 74) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-2962-Trucking/f-HDU-2962-Trucking/main.cpp type edge (line 21) | struct edge function spfa (line 33) | int spfa(int beg, int end, int lim) function init (line 69) | void init () function main (line 77) | int main () FILE: 按 OJ 分类/HDU/f-HDU-3035-War/f-HDU-3035-War/main.cpp type node (line 20) | struct node method node (line 23) | node(int _v, int _d) : v(_v), d(_d) {} type Edge (line 33) | struct Edge method Edge (line 36) | Edge() {} method Edge (line 37) | Edge(int _v, int _w, int _next) : v(_v), w(_w), next(_next) {} function add (line 40) | inline void add(int u, int v, int w) function initGraph (line 52) | void initGraph() function dijstra (line 122) | void dijstra() function main (line 160) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3038-How Many Answers Are Wrong/f-HDU-3038-How Many Answers Are Wrong/main.cpp function init (line 20) | void init() function find (line 29) | int find(int x) function join (line 43) | bool join(int x, int y, int m) function main (line 61) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3047-Zjnu Stadium/f-HDU-3047-Zjnu Stadium/main.cpp function init (line 20) | void init() function find (line 29) | int find(int x) function join (line 43) | bool join(int x, int y, int m) function main (line 61) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3138-Coconuts/f-HDU-3138-Coconuts/main.cpp type Edge (line 29) | struct Edge function init (line 36) | void init() function addedge (line 42) | void addedge (int u,int v,int w,int rw=0) function sap (line 51) | int sap(int start,int end, int N) function build (line 115) | void build() function main (line 136) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3172-Virtual Friends/f-HDU-3172-Virtual Friends/main.cpp function find (line 23) | int find(int x) function join (line 32) | int join(int x, int y) function main (line 46) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3183-A Magic Lamp/f-HDU-3183-A Magic Lamp/main.cpp function main (line 15) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3191-How Many Paths Are There/f-HDU-3191-How Many Paths Are There/main.cpp type Edge (line 21) | struct Edge type node (line 26) | struct node function init (line 48) | void init() function Dijstra (line 58) | void Dijstra(int st, int ed) function main (line 125) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3237-Help Bubu/f-HDU-3237-Help Bubu/main.cpp function init (line 28) | void init() function main (line 42) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3308-LCIS/f-HDU-3308-LCIS/main.cpp type SegmentTree (line 18) | struct SegmentTree method dist (line 22) | int dist() function PushUp (line 30) | void PushUp(int root) function build (line 40) | void build(int root, int left, int right) function update (line 55) | void update(int root, int pos, int k) function query (line 73) | int query(int root, int left, int right) function main (line 100) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3311-Dig The Wells/f-HDU-3311-Dig The Wells/main.cpp function add (line 23) | void add(int x, int y, int z) function init (line 29) | void init() function Min (line 56) | int Min(int x, int y) function spfa (line 61) | void spfa() function solve (line 85) | void solve() function main (line 131) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3339-In Action/f-HDU-3339-In Action/main.cpp function Dijkstra (line 26) | void Dijkstra(int cost[][MAXN], int lowcost[], int n, int beg) function main (line 68) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3364-Lanterns/f-HDU-3364-Lanterns/main.cpp function Gauss (line 27) | int Gauss() function scan_d (line 93) | inline void scan_d(T &ret) function main (line 108) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3367-Pseudoforest/f-HDU-3367-Pseudoforest/main.cpp type Edge (line 27) | struct Edge function addEdge (line 36) | void addEdge(int u, int v, int w) function cmp (line 44) | bool cmp(Edge a, Edge b) function find (line 50) | int find(int x) function Kruskal (line 62) | int Kruskal(int n) // 传入点数，返回最小生成树的权值，如果不连通则返回-1 function main (line 97) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-3371-Connect the Cities/f-HDU-3371-Connect the Cities/main.cpp type Edge (line 22) | struct Edge function init (line 33) | void init(int n) function addEdge (line 42) | void addEdge(int u, int v, int w) function cmp (line 56) | int cmp(const void *a, const void *b) function find (line 62) | int find(int x) function join (line 81) | bool join(int x, int y) function Kruskal (line 93) | int Kruskal(int n) // 传入点数，返回最小生成树的权值，如果不连通则返回-1 function main (line 133) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-3397-Sequence operation/f-HDU-3397-Sequence operation/main.cpp type node (line 21) | struct node function makeXOR (line 30) | void makeXOR(int u) function PushUp (line 38) | void PushUp(int u) function PushDown (line 74) | void PushDown(int u) function Build (line 106) | void Build(int u, int l, int r) function Update (line 126) | void Update(int u, int l, int r, int op) function Query (line 160) | int Query(int u, int l, int r, int op) function main (line 196) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3461-Code Lock/f-HDU-3461-Code Lock/main.cpp function find (line 17) | int find(int x) function join (line 36) | void join(int x, int y) function power (line 48) | long long power(int n) function main (line 66) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3486-Interviewe/f-HDU-3486-Interviewe/main.cpp function initRMQ (line 26) | void initRMQ(int n, int b[]) function rmq (line 44) | int rmq(int x, int y) function solve (line 50) | int solve() function main (line 80) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3549-Flow Problem/f-HDU-3549-Flow Problem/main.cpp type edge (line 26) | struct edge function addedge (line 34) | void addedge(int x, int y, typec c) function typec (line 49) | typec flow(int n, int s, int t) function main (line 123) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3572-Task Schedule/f-HDU-3572-Task Schedule/main.cpp type edge (line 26) | struct edge function addedge (line 34) | void addedge(int x, int y, typec c) function typec (line 49) | typec flow(int n, int s, int t) function main (line 123) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3631-Shortest Path/f-HDU-3631-Shortest Path/main.cpp function init (line 23) | void init() function floyd (line 36) | void floyd(int s) function main (line 47) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3635-Dragon Balls/f-HDU-3635-Dragon Balls/main.cpp function find (line 21) | int find(int x) function join (line 32) | void join(int x, int y) function main (line 46) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3672-Caves/f-HDU-3672-Caves/main.cpp function dfs (line 29) | void dfs(int x) function main (line 47) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3757-Evacuation Plan/f-HDU-3757-Evacuation Plan/main.cpp type node (line 22) | struct node function cmp_dis (line 31) | bool cmp_dis(const node &a, const node &b) function cmp_pos (line 36) | bool cmp_pos(const node &a, const node &b) function get_she (line 41) | void get_she(int i, int j) function main (line 50) | int main(int argc, char const *argv[]) FILE: 按 OJ 分类/HDU/f-HDU-3768-Shopping/f-HDU-3768-Shopping/main.cpp function add (line 35) | void add(int u, int v, int w) function add_ (line 43) | void add_(int u, int v, int w) function spfa (line 51) | void spfa(int s, int n, int *dis) function dfs (line 83) | int dfs(int s, int res, int n, int c) function main (line 110) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3790-最短路径问题/f-HDU-3790-最短路径问题/main.cpp function dijkstra (line 35) | void dijkstra(int st) function main (line 81) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3832-Earth Hour/f-HDU-3832-Earth Hour/main.cpp type node (line 18) | struct node function judge (line 28) | int judge(int i, int j) function spfa (line 41) | void spfa(int s, int n, int *dis) function main (line 73) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3860-Circuit Board/f-HDU-3860-Circuit Board/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/HDU/f-HDU-3870-Catch the Theves/f-HDU-3870-Catch the Theves/main.cpp type point (line 19) | struct point function SPFA (line 30) | int SPFA() function main (line 67) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3923-Invoker/f-HDU-3923-Invoker/main.cpp function gcd (line 22) | int gcd(int a, int b) function qpow (line 27) | long long qpow(long long a, long long n) function main (line 43) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-3926-Hand in Hand/f-HDU-3926-Hand in Hand/main.cpp function find (line 23) | int find(int x) function join (line 46) | void join(int x, int y) function main (line 66) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3938-Portal/f-HDU-3938-Portal/main.cpp type edge (line 18) | struct edge type order (line 23) | struct order function cmp (line 35) | bool cmp(edge a, edge b) function find (line 40) | int find(int x) function join (line 59) | int join(int s, int t) function cmp_ (line 77) | bool cmp_(order a, order b) function main (line 82) | int main() FILE: 按 OJ 分类/HDU/f-HDU-3986-Harry Potter and the Final Battle/f-HDU-3986-Harry Potter and the Final Battle/main.cpp type Edge (line 143) | struct Edge method Edge (line 148) | Edge(int _v = 0, int _cost = 0, int _used = 0) : v(_v), cost(_cost), u... function addEdge (line 153) | void addEdge(int u, int v, int w) function SPFA (line 165) | bool SPFA(int start, int n) function init (line 218) | void init() function main (line 230) | int main() FILE: 按 OJ 分类/HDU/f-HDU-4009-Transfer water/f-HDU-4009-Transfer water/main.cpp type Edge (line 26) | struct Edge function zhuliu (line 35) | int zhuliu(int root, int n, int m) type Node (line 107) | struct Node function getDis (line 114) | int getDis(Node a, Node b) function main (line 119) | int main() FILE: 按 OJ 分类/HDU/f-HDU-4081-Qin Shi Huang's National Road System/f-HDU-4081-Qin Shi Huang's National Road System/main.cpp type city (line 18) | struct city type city (line 25) | struct city function Prim (line 42) | double Prim(double cost[][MAXN], int n) function getDis (line 93) | inline double getDis(double x, double y, double x_, double y_) function main (line 98) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-4114-Disney's FastPass/f-HDU-4114-Disney's FastPass/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/HDU/f-HDU-4179-Difficult Routes/f-HDU-4179-Difficult Routes/main.cpp function add (line 43) | void add(int a, int b, double c) function get_dis (line 55) | double get_dis(node a, node b) function get_d (line 63) | int get_d(node a, node b) function spfa (line 77) | void spfa(int s, int n, int list[], double dis[], vect E[]) function main (line 111) | int main () FILE: 按 OJ 分类/HDU/f-HDU-4405-Aeroplane chess/f-HDU-4405-Aeroplane chess/main.cpp function main (line 21) | int main() FILE: 按 OJ 分类/HDU/f-HDU-4609-3-idiots/f-HDU-4609-3-idiots/main.cpp type Complex (line 23) | struct Complex method Complex (line 26) | Complex(double _x = 0.0, double _y = 0.0) method Complex (line 31) | Complex operator - (const Complex &b) const method Complex (line 35) | Complex operator + (const Complex &b) const method Complex (line 39) | Complex operator * (const Complex &b) const function change (line 48) | void change(Complex y[], int len) function fft (line 76) | void fft(Complex y[], int len, int on) function main (line 110) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-4651-Partition/f-HDU-4651-Partition/main.cpp function init (line 23) | void init() function main (line 55) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-4658-Integer Partition/f-HDU-4658-Integer Partition/main.cpp function init (line 20) | void init() function solve (line 54) | int solve(int n, int k) function main (line 81) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-4841-圆桌问题/f-HDU-4841-圆桌问题/main.cpp function main (line 24) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5512-Pagodas/f-HDU-5512-Pagodas/main.cpp function extgcd (line 19) | int extgcd(int a, int b, int &x, int &y) function main (line 34) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-5514-Frogs/f-HDU-5514-Frogs/main.cpp function ll (line 19) | ll gcd(ll a, ll b) function ll (line 34) | ll Phi(ll x) function main (line 56) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5517-Triple/f-HDU-5517-Triple/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/HDU/f-HDU-5534-Partial Tree/f-HDU-5534-Partial Tree/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5556-Land of Farms/f-HDU-5556-Land of Farms/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/HDU/f-HDU-5558-Alice's Classified Message/f-HDU-5558-Alice's Classified Message/main.cpp type Suffix_Automation (line 20) | struct Suffix_Automation type State (line 22) | struct State method init (line 32) | void init(int _val = 0) method State (line 47) | State *newState(int val = 0) method init (line 32) | void init(int _val = 0) method initSAM (line 53) | void initSAM() method extend (line 60) | void extend(int w, int head) method solve (line 103) | void solve(char *s) function main (line 140) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5559-Frog and String/f-HDU-5559-Frog and String/main.cpp function draw (line 20) | void draw(int id, int n) function print_Im (line 29) | void print_Im() function main (line 34) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5572-An Easy Physics Problem/f-HDU-5572-An Easy Physics Problem/main.cpp function cmp (line 18) | int cmp(double x) type node (line 30) | struct node method read (line 34) | void read() type circle (line 43) | struct circle method read (line 48) | void read() function node (line 54) | node operator + (node a, node b) method read (line 34) | void read() function node (line 59) | node operator - (node a, node b) method read (line 34) | void read() function node (line 64) | node operator * (double p, node a) method read (line 34) | void read() function dot (line 69) | double dot(node a, node b) function dis (line 74) | double dis(node a) function cross (line 79) | double cross(node a, node b) function node (line 84) | node GetLine(node P, node A, node B) method read (line 34) | void read() function GetAnglePoint (line 94) | void GetAnglePoint(point PA, speed SA, circle C) function main (line 113) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5575-Discover Water Tank/f-HDU-5575-Discover Water Tank/main.cpp function merge (line 29) | int merge(int x, int y) function init (line 53) | inline int init(int x) function insert (line 61) | inline int insert(int x, int y) function top (line 67) | inline int top(int x) function pop (line 73) | inline int pop(int x) function empty (line 79) | inline bool empty(int x) function initHeap (line 85) | void initHeap() function initSet (line 95) | void initSet() function find (line 104) | int find(int x) function Union (line 110) | inline void Union(int x, int y) function main (line 137) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5584-LCM Walk/f-HDU-5584-LCM Walk/main.cpp function gcd (line 13) | int gcd(int x, int y) function main (line 20) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5698-瞬间移动/f-HDU-5698-瞬间移动/main.c type LL (line 12) | typedef long long LL; function LL (line 15) | LL quickPower(LL a, LL b) function LL (line 31) | LL c(LL n, LL m) function LL (line 48) | LL lucas(LL n, LL m) function main (line 57) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-5700-区间交/f-HDU-5700-区间交/main.c type LL (line 18) | typedef long long LL; type route (line 22) | typedef struct type seg (line 29) | struct seg function scanfDiyLL (line 35) | void scanfDiyLL(LL *ret) function scanfDiyInt (line 45) | void scanfDiyInt(int *ret) function cmp (line 55) | int cmp(const void *a, const void *b) function pushUp (line 66) | void pushUp(int tag) function buildTree (line 72) | void buildTree(int tag, int L, int R) function upDate (line 86) | void upDate(int tag, int L, int R, int id) function query (line 105) | int query(int tag, int L, int R, int k) function main (line 121) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-5701-中位数计数/f-HDU-5701-中位数计数/main.c function scanfDiy (line 20) | void scanfDiy(int *ret) function main (line 36) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-5791-Two/f-HDU-5791-Two/main.cpp function main (line 21) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5833-Zhu and 772002/f-HDU-5833-Zhu and 772002/main.cpp function Gauss (line 34) | int Gauss() function isprime (line 81) | void isprime() function ll (line 99) | ll quick_mod(ll a, ll b) function main (line 115) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5874-Friends and Enemies/f-HDU-5874-Friends and Enemies/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-5877-Weak Pair/f-HDU-5877-Weak Pair/main.cpp function prepare (line 30) | void prepare() function ll (line 45) | ll lowbit(ll x) // 计算lowbit function add (line 50) | void add(ll k, int val) // 将第 k 个元素值加 val function sum (line 59) | int sum(ll x) // 求前x项和 function dfs (line 70) | void dfs(int s, int cnt = 0) function main (line 87) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5878-I Count Two Three/f-HDU-5878-I Count Two Three/main.cpp function init (line 22) | void init() function main (line 42) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5879-Cure/f-HDU-5879-Cure/main.cpp function init (line 18) | void init() function main (line 28) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5881-Tea/f-HDU-5881-Tea/main.cpp function ll (line 17) | ll solve(ll l, ll r) function main (line 38) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5883-The Best Path/f-HDU-5883-The Best Path/main.cpp function main (line 21) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5884-Sort/f-HDU-5884-Sort/main.cpp function charge (line 22) | bool charge(int k) function main (line 114) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5886-Tower Defence/f-HDU-5886-Tower Defence/main.cpp function init (line 37) | void init() function add (line 47) | void add(int u, int v, int w) function dfs1 (line 59) | void dfs1(int pre, int r) function dfs2 (line 87) | void dfs2(int pre, int r) function main (line 151) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5889-Barricade/f-HDU-5889-Barricade/main.cpp type node (line 19) | struct node method node (line 22) | node(int v_, int w_) : v(v_), w(w_) {} function spfa (line 31) | void spfa() type edge (line 61) | struct edge method edge (line 64) | edge(int u, int v, int c, int f) : from(u), to(v), cap(c), flow(f) {} type Dinic (line 67) | struct Dinic method init (line 76) | void init() method addEdge (line 85) | void addEdge(int from, int to, int cap) method bfs (line 94) | bool bfs() method dfs (line 122) | int dfs(int x, int a) method Maxflow (line 148) | int Maxflow(int s, int t) function main (line 164) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5912-Fraction/f-HDU-5912-Fraction/main.cpp function gcd (line 19) | int gcd(int a, int b) function main (line 24) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5933-ArcSoft's Office Rearrangement/f-HDU-5933-ArcSoft's Office Rearrangement/main.cpp function main (line 21) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5935-Car/f-HDU-5935-Car/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5943-Kingdom of Obsession/f-HDU-5943-Kingdom of Obsession/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-5955-Guessing the Dice Roll/f-HDU-5955-Guessing the Dice Roll/main.cpp type Aho (line 33) | struct Aho method newnode (line 37) | int newnode() // 静态创建新节点 method init (line 45) | void init() method insert (line 51) | void insert(int s[], int id) // 插入字符串构建ac自动机，构建trie树 method getfail (line 67) | void getfail() // 构建自动机fail指针 function Gauss (line 118) | int Gauss() function init_guass (line 168) | void init_guass(int n, int m) function build (line 178) | void build() // 建立方程组 function main (line 199) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5982-Relic Discovery/f-HDU-5982-Relic Discovery/main.cpp function main (line 15) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5984-Pocky/f-HDU-5984-Pocky/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/HDU/f-HDU-5985-Lucky Coins/f-HDU-5985-Lucky Coins/main.cpp function solve (line 27) | void solve() function main (line 62) | int main() FILE: 按 OJ 分类/HDU/f-HDU-6000-Wash/f-HDU-6000-Wash/main.cpp type node (line 21) | struct node function main (line 34) | int main() FILE: 按 OJ 分类/HDU/f-HDU-6004-Periodical Cicadas/f-HDU-6004-Periodical Cicadas/main.cpp type node (line 20) | struct node function _hash (line 27) | inline int _hash(int x, int y) function ll (line 32) | ll exgcd(ll a, ll b, ll &x, ll &y) function node (line 49) | node merge(node x, node y) function init (line 70) | void init() function main (line 84) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HDU/f-HDU-6006-Engineer Assignment/f-HDU-6006-Engineer Assignment/main.cpp function init (line 27) | void init() function main (line 36) | int main() FILE: 按 OJ 分类/HDU/f-HDU-6008-Worried School/f-HDU-6008-Worried School/main.cpp function main (line 26) | int main() FILE: 按 OJ 分类/HDU/f-HDU-6010-Daylight Saving Time/f-HDU-6010-Daylight Saving Time/main.cpp type time (line 18) | struct time function init (line 51) | void init() function main (line 86) | int main() FILE: 按 OJ 分类/HDU/f-HDU-6249-Alice’s Stamps/f-HDU-6249-Alice’s Stamps/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/HENUOJ/f-HENUOJ-1036-B-小女♂孩采蘑菇/f-HENUOJ-1036-B-小女♂孩采蘑菇/main.cpp function main (line 23) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/HOJ/f-HOJ-1983-Beautiful numbers/f-HOJ-1983-Beautiful numbers/main.cpp function gcd (line 24) | int gcd(int a, int b) function lcm (line 33) | int lcm(int a, int b) function ll (line 38) | ll dfs(int pos, int num, int mod, bool flag) function ll (line 61) | ll calc(ll x) function init (line 77) | void init() function main (line 94) | int main() FILE: 按 OJ 分类/HPU/f-HPU-1008-Mod/f-HPU-1008-Mod/main.cpp function init (line 29) | void init() function main (line 90) | int main() FILE: 按 OJ 分类/HRBUST/f-HRBUST-1025-JiaoZhu and WAR3/f-HRBUST-1025-JiaoZhu and WAR3/main.cpp type circle (line 18) | struct circle function main (line 25) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-A-谷神的赌博游戏/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-A-谷神的赌博游戏/main.cpp function main (line 69) | int main() FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-B-一个简单的问题/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-B-一个简单的问题/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-C-来简单地数个数/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-C-来简单地数个数/main.cpp function init (line 21) | void init() function main (line 53) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-D-简单图形输出/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-D-简单图形输出/main.cpp function init (line 21) | void init() function main (line 54) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-E-简单的RMQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-E-简单的RMQ/main.cpp function solve (line 23) | void solve(int n) function main (line 38) | int main() FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-F-一道简单的递推题/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-F-一道简单的递推题/main.cpp type mat (line 145) | struct mat function mat (line 151) | mat operator * (mat a, mat &b) function init_unit (line 172) | void init_unit() function mat (line 181) | mat pow_mat(mat &a, ll n) function main (line 198) | int main() FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-G-那么大奶牛之神/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-G-那么大奶牛之神/main.cpp function main (line 15) | int main() FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-H-简单的机械臂设计/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-H-简单的机械臂设计/main.cpp function which_son (line 22) | bool which_son(int o) function update_rev (line 27) | void update_rev(int o){ function push_up (line 34) | void push_up(int o){ function push_down (line 38) | void push_down(int o){ function build (line 46) | void build(int &o,int l,int r,int fa){ function init (line 60) | void init(int n){ function rotate (line 67) | void rotate(int o,int d){ function splay (line 82) | void splay(int o,int goal){ function get_max (line 111) | int get_max(int o){ function remove (line 120) | void remove(){ type node (line 136) | struct node{ function main (line 144) | int main(){ FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-I-一道不简单的题目/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-I-一道不简单的题目/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NEUQ/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-J-简单的变位词/f-图灵杯-第四届“图灵杯”NEUQ-ACM 程序设计竞赛-J-简单的变位词/main.cpp function cmp (line 26) | bool cmp(vector a, vector b) function main (line 42) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-2016河南ACM省赛-A-表达式求值/f-2016河南ACM省赛-A-表达式求值/main.cpp function sMax (line 19) | int sMax(int x, int y) function getNum (line 37) | int getNum(int *key) function main (line 48) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-1070-诡异的电梯[Ⅰ]/f-NYOJ-1070-诡异的电梯[Ⅰ]/main.c function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-108-士兵杀敌（一）/f-NYOJ-108-士兵杀敌（一）/main.cpp function cinDiy (line 16) | void cinDiy(int &ret) function coutDiy (line 26) | void coutDiy(int a) function main (line 34) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-110-剑客决斗/f-NYOJ-110-剑客决斗/main.c function init (line 15) | void init(int n) function solve (line 33) | int solve(int n) function main (line 66) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-116-士兵杀敌（二）/f-NYOJ-116-士兵杀敌（二）/main.cpp function cinDiy (line 18) | void cinDiy(int &ret) function coutDiy (line 31) | void coutDiy(int a) function lowbit (line 41) | int lowbit(int x) function add (line 46) | void add(int k, int h) function sum (line 55) | int sum(int k) function main (line 66) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-12-喷水装置（二）/f-NYOJ-12-喷水装置（二）/main.c function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-1235-A÷B Problem/f-NYOJ-1235-A÷B Problem/main.cpp function extendGcd (line 19) | long long extendGcd(long long a, long long b, long long &x, long long &y) function modReverse (line 37) | long long modReverse(long long a, long long n) function main (line 51) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-1236-挑战密室/f-NYOJ-1236-挑战密室/main.cpp function init (line 19) | void init() function main (line 33) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-1237-最大岛屿/f-NYOJ-1237-最大岛屿/main.cpp function dfs (line 26) | void dfs(int x, int y) function main (line 42) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-1238-最少换乘/f-NYOJ-1238-最少换乘/main.cpp function spfa (line 24) | void spfa(int s) function main (line 51) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-1239-引水工程/f-NYOJ-1239-引水工程/main.cpp type Edge (line 26) | struct Edge function init (line 36) | void init() function addEdge (line 46) | void addEdge(int u, int v, int w) function cmp (line 53) | bool cmp(Edge a, Edge b) function find (line 58) | int find(int x) function Kruskal (line 70) | int Kruskal(int n) function dfs (line 113) | void dfs(int root) function main (line 130) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-1249-物资调度/f-NYOJ-1249-物资调度/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-1250-机器人/f-NYOJ-1250-机器人/main.cpp function ll (line 16) | ll exgcd(ll a, ll b, ll &x, ll &y) function main (line 31) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-1251-山区修路/f-NYOJ-1251-山区修路/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-1252-世界之威/f-NYOJ-1252-世界之威/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-1255-Rectangles/f-NYOJ-1255-Rectangles/main.cpp type Rct (line 21) | struct Rct function cmp (line 26) | bool cmp(Rct a, Rct b) function main (line 35) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-1273-宣传墙/f-NYOJ-1273-宣传墙/main.cpp type mat (line 18) | struct mat method mat (line 22) | mat() method mat (line 27) | mat operator * (const mat &a) const function cmp (line 47) | bool cmp(int i, int j) // 状态 j 对状态 i 是否可行 j 是 col 列的状态 i 是 col - 1 列的状态 function unit (line 89) | void unit() function slove (line 100) | int slove(int n) function main (line 120) | int main () FILE: 按 OJ 分类/NYOJ/f-NYOJ-1276-机器设备/f-NYOJ-1276-机器设备/main.cpp type gear (line 26) | struct gear function charge (line 36) | int charge(int i, int j) function bfs (line 48) | void bfs() function main (line 75) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-14-会场安排问题/f-NYOJ-14-会场安排问题/main.c type Party (line 12) | typedef struct function swap (line 19) | void swap(Party *P, int i, int j) function Partition (line 31) | int Partition(Party *P, int low, int high) function QSort (line 52) | void QSort(Party *L, int low, int high) function main (line 63) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-15-括号匹配（二）/f-NYOJ-15-括号匹配（二）/main.c function main (line 141) | int main() function isMatch (line 186) | int isMatch(char a, char b) FILE: 按 OJ 分类/NYOJ/f-NYOJ-16-矩形嵌套/f-NYOJ-16-矩形嵌套/main.c type rec (line 104) | typedef struct function main (line 110) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-17-单调递增最长子序列/f-NYOJ-17-单调递增最长子序列/main.c function upper_bound (line 13) | int upper_bound(int A, int key) function main (line 25) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-18-The Triangle/f-NYOJ-18-The Triangle/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-19-擅长排列的小明/f-NYOJ-19-擅长排列的小明/main.c function dfs (line 64) | void dfs(int n, int m, int number) function main (line 83) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-2-括号配对问题/f-NYOJ-2-括号配对问题/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-20-吝啬的国度/f-NYOJ-20-吝啬的国度/main.c function solve (line 78) | void solve(int key) function main (line 109) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-201-作业题/f-NYOJ-201-作业题/main.cpp type node (line 14) | struct node function cmp (line 22) | bool cmp(Node a, Node b) function main (line 27) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-21-三个水杯/f-NYOJ-21-三个水杯/main.c type State (line 11) | typedef struct State function init (line 25) | void init() function haveSame (line 35) | int haveSame() function judge (line 48) | int judge(int Ei, int Ej, int Ek, int Step) function solve (line 59) | void solve() function main (line 179) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-24-素数距离问题/f-NYOJ-24-素数距离问题/main.c function main (line 88) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-26-孪生素数问题/f-NYOJ-26-孪生素数问题/main.c function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-27-水池数目/f-NYOJ-27-水池数目/main.c function fill_pond (line 15) | void fill_pond(int i, int j) function main (line 28) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-28-大数阶乘/f-NYOJ-28-大数阶乘/main.c function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-32-组合数/f-NYOJ-32-组合数/main.c function dfs (line 15) | void dfs(int place, int rule, int num) //非全排列，保持高位始终大于低位 function main (line 33) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-33-蛇形填数/f-NYOJ-33-蛇形填数/main.c function main (line 82) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-35-表达式求值/f-NYOJ-35-表达式求值/main.c function StrToInt (line 330) | int StrToInt(char s[], int * pc, float *pout) function swi (line 351) | void swi(int *key, char sym) function perform (line 370) | void perform(int suf, int *_key) function main (line 395) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-37-回文字符串/f-NYOJ-37-回文字符串/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-417-死神来了/f-NYOJ-417-死神来了/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-46-最少乘法次数/f-NYOJ-46-最少乘法次数/main.cpp function main (line 12) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-5-Binary String Matching/f-NYOJ-5-Binary String Matching/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-6-喷水装置（一）/f-NYOJ-6-喷水装置（一）/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-7-街区最短路径问题/f-NYOJ-7-街区最短路径问题/main.c function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-739-笨蛋难题四/f-NYOJ-739-笨蛋难题四/main.cpp function cinDiy (line 16) | void cinDiy(int &ret) function main (line 29) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NYOJ/f-NYOJ-8-一种排序/f-NYOJ-8-一种排序/main.c function main (line 82) | int main() FILE: 按 OJ 分类/NYOJ/f-NYOJ-999-师傅又被妖怪抓走了/f-NYOJ-999-师傅又被妖怪抓走了/main.cpp function check (line 39) | bool check(int x, int y) function getCharValue (line 49) | char getCharValue(char otype, char type) function setMap (line 59) | void setMap(int x, int y, char type) function isLegal (line 81) | bool isLegal(path p) function bfs_ (line 90) | int bfs_(path startp, char type) function bfs (line 122) | void bfs() function main (line 169) | int main() FILE: 按 OJ 分类/NYOJ/f-河南第十届ACM省赛-C-最小密钥/f-河南第十届ACM省赛-C-最小密钥/main.cpp function charge (line 21) | bool charge(int x) function main (line 33) | int main() FILE: 按 OJ 分类/NYOJ/f-河南第十届ACM省赛-D-年终奖金/f-河南第十届ACM省赛-D-年终奖金/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/NYOJ/f-河南第十届ACM省赛-E-八纵八横/f-河南第十届ACM省赛-E-八纵八横/main.cpp type node (line 21) | struct node function read (line 31) | inline int read() function bst (line 51) | bst Read() function insert (line 64) | void insert(int x, int y, bst v) function find (line 76) | int find(int x) function dfs (line 81) | void dfs(int x, int pre) function updata (line 93) | void updata(int x, bst y) function output (line 142) | void output() function main (line 177) | int main() FILE: 按 OJ 分类/NYOJ/f-河南第十届ACM省赛-I-Transmit information/f-河南第十届ACM省赛-I-Transmit information/main.cpp function floyd (line 25) | void floyd(int c[][MAXN], int a[][MAXN], int b[][MAXN]) function copy (line 42) | void copy(int a[][MAXN], int b[][MAXN]) function slove (line 53) | void slove(int k) function init (line 70) | void init() function main (line 82) | int main() FILE: 按 OJ 分类/NZAU/f-NZAU-C-Mine Sweeping Game/f-NZAU-C-Mine Sweeping Game/main.c function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/NZAU/f-NZAU-F-The Nearest Same Chocolate/f-NZAU-F-The Nearest Same Chocolate/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/PAT/f-PAT-2017年团体程序设计天梯赛-大区赛-L2-4-功夫传人/f-PAT-2017年团体程序设计天梯赛-大区赛-L2-4-功夫传人/main.cpp function dfs (line 24) | void dfs(int root) function main (line 41) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/PAT/f-PAT-L1-006-连续因子/f-PAT-L1-006-连续因子/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/PAT/f-PAT-天梯赛习题集-L2-018-多项式A除以B/f-PAT-天梯赛习题集-L2-018-多项式A除以B/main.cpp function sub (line 24) | void sub() function solve (line 65) | void solve() function main (line 91) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/PAT/f-PAT-天梯赛习题集-L3-013-非常弹的球/f-PAT-天梯赛习题集-L3-013-非常弹的球/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/PAT/f-PAT-天梯赛习题集-L3-014-周游世界/f-PAT-天梯赛习题集-L3-014-周游世界/main.cpp type qNode (line 26) | struct qNode method qNode (line 30) | qNode(int _v = 0, int _c = 0) : v(_v), c(_c) {} type Edge (line 37) | struct Edge method Edge (line 41) | Edge(int _v = 0, int _cost = 0) : v(_v), cost(_cost) {} function Dijkstra (line 51) | void Dijkstra(int n, int start) // 点的编号从1开始 function addEdge (line 130) | void addEdge(int u, int v, int w, int c) type way (line 135) | struct way function getWay (line 141) | void getWay(int ed, int mt) function main (line 173) | int main() FILE: 按 OJ 分类/PAT/f-PAT-天梯赛习题集-L3-015-球队“食物链”/f-PAT-天梯赛习题集-L3-015-球队“食物链”/main.cpp function dfs (line 23) | void dfs(int n, int last) function main (line 60) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/POJ/f-POJ-1061-青蛙的约会/f-POJ-1061-青蛙的约会/main.c type LL (line 10) | typedef long long LL; function LL (line 12) | LL e_gcd(LL a, LL b) function LL (line 27) | LL cal(LL a, LL b, LL c) function main (line 48) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/POJ/f-POJ-1681-Painter's Problem/f-POJ-1681-Painter's Problem/main.cpp function Gauss (line 31) | int Gauss() function init (line 94) | void init() function solve (line 127) | void solve() function main (line 194) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/POJ/f-POJ-1729-Jack and Jill/f-POJ-1729-Jack and Jill/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/POJ/f-POJ-1811-Prime Test/f-POJ-1811-Prime Test/main.cpp function mult_mod (line 21) | long long mult_mod(long long a, long long b, long long c) function pow_mod (line 48) | long long pow_mod(long long a, long long n, long long mod) function check (line 67) | bool check(long long a, long long n, long long x, long long t) function Miller_Rabin (line 94) | bool Miller_Rabin(long long n) function gcd (line 134) | long long gcd(long a, long b) function pollard_rho (line 154) | long long pollard_rho(long long x, long long c) function findfac (line 183) | void findfac(long long n, int k) function main (line 206) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/POJ/f-POJ-1845-Sumdiv/f-POJ-1845-Sumdiv/main.cpp function main (line 14) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/POJ/f-POJ-1961-Period/f-POJ-1961-Period/main.cpp function getnxt (line 20) | void getnxt() function main (line 40) | int main() FILE: 按 OJ 分类/POJ/f-POJ-1985-Cow Marathon/f-POJ-1985-Cow Marathon/main.cpp type node (line 17) | struct node function init (line 29) | void init() function addedge (line 36) | void addedge(int x, int y, int z) function bfs (line 46) | void bfs(int x) function main (line 78) | int main() FILE: 按 OJ 分类/POJ/f-POJ-2096-Collecting Bugs/f-POJ-2096-Collecting Bugs/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/POJ/f-POJ-2185-Milking Grid/f-POJ-2185-Milking Grid/main.cpp function main (line 24) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/POJ/f-POJ-2406-Power Strings/f-POJ-2406-Power Strings/main.cpp function getnxt (line 19) | void getnxt() function main (line 39) | int main() FILE: 按 OJ 分类/POJ/f-POJ-2752-Seek the Name, Seek the Fame/f-POJ-2752-Seek the Name, Seek the Fame/main.cpp function getnxt (line 22) | void getnxt() function main (line 42) | int main() FILE: 按 OJ 分类/POJ/f-POJ-3461-Oulipo/f-POJ-3461-Oulipo/main.cpp function KMP_Pre (line 14) | void KMP_Pre(char x[], int m, int next[]) function KMP_Count (line 32) | int KMP_Count(char x[], int m, char y[], int n) function main (line 57) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/POJ/f-POJ-3744-Scout YYF I/f-POJ-3744-Scout YYF I/main.cpp type Matrix (line 17) | struct Matrix function Matrix (line 22) | Matrix mul(Matrix a, Matrix b) function Matrix (line 40) | Matrix QPow_M(Matrix a, int n) function main (line 68) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/POJ/f-POJ-3866-Exclusive Access 2/f-POJ-3866-Exclusive Access 2/main.cpp function main (line 33) | int main() FILE: 按 OJ 分类/POJ/f-POJ-机加工表面/f-POJ-机加工表面/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/Project Eular/f-Project Eular-71-Ordered fractions/f-Project Eular-71-Ordered fractions/main.cpp function solve (line 23) | void solve(int x, int y, int &a, int &b, int d) function main (line 36) | int main() FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-A-黑白图像直方图/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-A-黑白图像直方图/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-B-神无月排位赛/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-B-神无月排位赛/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-C-I Love ces/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-C-I Love ces/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-D-添加好友/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-D-添加好友/main.cpp function ll (line 17) | ll QPow(ll x, ll n) function main (line 37) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-E-字符串进制转换/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-E-字符串进制转换/main.cpp function init (line 24) | void init() function main (line 32) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-F-A序列/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-F-A序列/main.cpp function bsearch (line 25) | int bsearch(const int *f, int size, const int &a) function LIS (line 47) | int LIS(const int *a, int *d, const int &n) function main (line 72) | int main() FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-G-战斗/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-G-战斗/main.cpp type node (line 16) | struct node function judge (line 24) | bool judge() function dfs (line 52) | bool dfs(int pos) function main (line 80) | int main() FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-H-调和序列/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-H-调和序列/main.cpp function cmp (line 23) | bool cmp(int a, int b) function init (line 28) | void init() function scan_d (line 43) | inline void scan_d(T &ret) function print_d (line 55) | inline void print_d(T x) function main (line 64) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-I-丢史蒂芬妮/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-I-丢史蒂芬妮/main.cpp function dfs (line 22) | bool dfs(int x, int y) function init (line 48) | void init() function main (line 76) | int main() FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-J-膜一下将带给你好运/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-J-膜一下将带给你好运/main.cpp function get_phi (line 24) | int get_phi(int x) function init (line 45) | void init() function main (line 67) | int main() FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-K-购买装备/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-K-购买装备/main.cpp type equ (line 17) | struct equ function cmp (line 25) | bool cmp(const equ &x, const equ &y) function cmp_ (line 30) | bool cmp_(const equ &x, const equ &y) function check (line 35) | int check(int x) function scan_d (line 56) | inline void scan_d(T &ret) function print_d (line 68) | inline void print_d(T x) function main (line 77) | int main() FILE: 按 OJ 分类/SHU/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-M-风力观测/f-SHU-“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛-M-风力观测/main.cpp function pushdown (line 27) | void pushdown(int rt) function update (line 57) | void update(int L, int R, int A, int l = 1, int r = n, int rt = 1) function query (line 84) | void query(int &mx_, int &mn_, int x, int l = 1, int r = n, int rt = 1) function scan_d (line 105) | inline bool scan_d(T &ret) function main (line 127) | int main() FILE: 按 OJ 分类/THU/f-THU-2016-3-1-TSP/f-THU-2016-3-1-TSP/main.cpp type edge (line 19) | struct edge method edge (line 22) | edge() function add (line 35) | void add(int u, int v, int w) function DFS (line 44) | int DFS(int s) function find (line 59) | void find(int s, int w) function main (line 79) | int main() FILE: 按 OJ 分类/THU/f-THU-2016-3-2-Pokeface/f-THU-2016-3-2-Pokeface/main.cpp type point (line 16) | struct point method point (line 21) | point() type Btree (line 27) | struct Btree method Btree (line 31) | Btree() method init (line 35) | int init(int l, int r, int k) // 初始化函数 method _insert (line 48) | void _insert(int L, int R, int l, int r, int k) method _Query (line 92) | int _Query(int L, int R, int l, int r, int k) method insert (line 126) | void insert(int l, int r) method Query (line 130) | int Query(int l, int r) function main (line 136) | int main () FILE: 按 OJ 分类/UVA/f-UVA-11600-Masud Rana/f-UVA-11600-Masud Rana/main.cpp function dfs (line 27) | void dfs(int x) function num (line 40) | int num(int x) function get_dp (line 54) | double get_dp(int u, int st) function main (line 79) | int main() FILE: 按 OJ 分类/UVA/f-UVA-12260-Free Goodies/f-UVA-12260-Free Goodies/main.cpp type Node (line 19) | struct Node function main (line 37) | int main() FILE: 按 OJ 分类/UVALive/f-UVALive-4394-String painter/f-UVALive-4394-String painter/main.cpp function main (line 23) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/UVALive/f-UVALive-7500-Boxes and Balls/f-UVALive-7500-Boxes and Balls/main.cpp function main (line 18) | int main() FILE: 按 OJ 分类/UVALive/f-UVALive-7509-Dome and Steles/f-UVALive-7509-Dome and Steles/main.cpp function scan_d (line 19) | inline void scan_d(T &ret) function calc (line 33) | double calc(double x) function main (line 59) | int main() FILE: 按 OJ 分类/UVALive/f-UVALive-7512-November 11th/f-UVALive-7512-November 11th/main.cpp function main (line 21) | int main() FILE: 按 OJ 分类/VJ/f-[kuangbin带你飞]专题二-搜索进阶-A-Eight/f-[kuangbin带你飞]专题二-搜索进阶-A-Eight/main.cpp type node (line 30) | struct node function hash_cantor (line 37) | int hash_cantor(int a[]) function bfs (line 58) | void bfs(node end) function init (line 93) | void init() function printRes (line 114) | void printRes(int n) function main (line 123) | int main() FILE: 按 OJ 分类/VJ/f-[kuangbin带你飞]专题二-搜索进阶-B-Eight II/f-[kuangbin带你飞]专题二-搜索进阶-B-Eight II/main.cpp type node (line 43) | struct node function hash_cantor (line 50) | int hash_cantor(int a[]) function bfs (line 71) | void bfs(int op, node end) function init (line 107) | void init() function main (line 133) | int main() FILE: 按 OJ 分类/VJ/f-[kuangbin带你飞]专题二-搜索进阶-C-哈密顿绕行世界问题/f-[kuangbin带你飞]专题二-搜索进阶-C-哈密顿绕行世界问题/main.cpp function print (line 22) | void print() function dfs (line 32) | void dfs(int pos = 1) function main (line 70) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/VJ/f-[kuangbin带你飞]专题二-搜索进阶-D-Escape/f-[kuangbin带你飞]专题二-搜索进阶-D-Escape/main.cpp type castle (line 25) | struct castle type node (line 31) | struct node method node (line 35) | node(int x_, int y_, int s_) : x(x_), y(y_), step(s_) {} function init (line 39) | void init() function check (line 46) | bool check(int x,int y) function bfs (line 55) | void bfs() function main (line 225) | int main() FILE: 按 OJ 分类/ZOJ/f-ZOJ-3329-One Person Game/f-ZOJ-3329-One Person Game/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZOJ/f-ZOJ-People Counting/f-ZOJ-People Counting/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZOJ/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-A-Cooking Competition/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-A-Cooking Competition/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZOJ/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-B-Problem Preparation/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-B-Problem Preparation/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZOJ/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-C-What Kind of Friends Are You?/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-C-What Kind of Friends Are You?/main.cpp function init (line 32) | void init() function Hash (line 40) | int Hash(int *state) function main (line 50) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZOJ/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-D-Let's Chat/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-D-Let's Chat/main.cpp type Node (line 17) | struct Node function bs (line 25) | int bs(int l, int r, int k) function main (line 43) | int main() FILE: 按 OJ 分类/ZOJ/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-E-Seven Segment Display/f-ZOJ-The 14th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple-E-Seven Segment Display/main.cpp function init (line 30) | void init() function HtoD (line 38) | int HtoD(char ch) function ll (line 50) | ll count(int place) // 数是x，查询的数位是place function ll (line 73) | ll solve(ll x) function main (line 93) | int main() FILE: 按 OJ 分类/ZZUACM/f-ZZUACM-Tutti!/f-ZZUACM-Tutti!/main.c type Status (line 13) | typedef int Status; type Edge (line 15) | struct Edge function buildMap (line 23) | void buildMap(int m, Edge E) function main (line 41) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZZUACM/f-ZZUACM-最长匹配子串/f-ZZUACM-最长匹配子串/main.c type Status (line 16) | typedef int Status; type SElemType (line 17) | typedef int SElemType; type SqStack (line 19) | typedef struct function Status (line 25) | Status Push (SqStack *S, SElemType e) function Status (line 36) | Status Pop (SqStack *S) function main (line 46) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZZUACM/f-ZZUACM-词法分析器/f-ZZUACM-词法分析器/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZZUACM/f-ZZUACM-追踪术/f-ZZUACM-追踪术/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZZULIOJ/f-ZZULIOJ-多校训练（985专场）-A-985的字符串难题/f-ZZULIOJ-多校训练（985专场）-A-985的字符串难题/main.cpp function init (line 33) | void init() function insert (line 41) | void insert(char *s, int rank = 1) function sear (line 58) | int sear(char *s) // 失败返回0 function delt (line 70) | void delt(char *s) // 只做标记, 假定s一定存在 function prefix (line 81) | int prefix(char *s) // 最长前缀 function main (line 95) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZZULIOJ/f-ZZULIOJ-多校训练（985专场）-C-985的方格难题/f-ZZULIOJ-多校训练（985专场）-C-985的方格难题/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZZULIOJ/f-ZZULIOJ-多校训练（985专场）-D-985的0-1串难题/f-ZZULIOJ-多校训练（985专场）-D-985的0-1串难题/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/ZZULIOJ/f-轻院选拔赛-最后一题/f-轻院选拔赛-最后一题/main.c function seek (line 15) | int seek() function main (line 44) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/hiho/f-hiho-hihoCoder挑战赛29-A-序列的值/f-hiho-hihoCoder挑战赛29-A-序列的值/main.cpp function init (line 25) | void init() function main (line 34) | int main() FILE: 按 OJ 分类/hiho/f-hiho-hihoCoder挑战赛29-B-快速乘法/f-hiho-hihoCoder挑战赛29-B-快速乘法/main.cpp function main (line 71) | int main() FILE: 按 OJ 分类/hiho/f-hiho-hihoCoder挑战赛29-D-不上升序列/f-hiho-hihoCoder挑战赛29-D-不上升序列/main.cpp function main (line 60) | int main() FILE: 按 OJ 分类/出处遗忘/f-2016CCPC-A-A water problem/f-2016CCPC-A-A water problem/main.cpp function mod (line 21) | int mod(char str[],int num) function main (line 33) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-2016CCPC-B-Zhu and 772002/f-2016CCPC-B-Zhu and 772002/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-2016CCPC-D-Danganronpa/f-2016CCPC-D-Danganronpa/main.cpp function main (line 15) | int main() FILE: 按 OJ 分类/出处遗忘/f-2016年多大学培训大赛4-1012-Bubble Sort/f-2016年多大学培训大赛4-1012-Bubble Sort/main.cpp function QuickSort (line 22) | void QuickSort(int h, int t, int a[]) function main (line 58) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-C/mainOne.cpp function main (line 3) | int main() FILE: 按 OJ 分类/出处遗忘/f-C/mainTwo.c function foo (line 4) | void foo(char *bar) function main (line 12) | int main(int argc, char *argv[]) FILE: 按 OJ 分类/出处遗忘/f-DES(C)/f-DES(C)/main.cpp function CharToBit (line 114) | void CharToBit(const char input[], int output[], int bits) function BitToChar (line 129) | void BitToChar(const int intput[], char output[], int bits) function Xor (line 144) | void Xor(int *INA, int *INB, int len) function IP_Init_Rep (line 156) | void IP_Init_Rep(const int input[64], int output[64], const int table[64]) function E_Extend (line 168) | void E_Extend(const int input[32], int output[48], const int table[48]) function P_Rep (line 180) | void P_Rep(const int input[32], int output[32], const int table[32]) function IP_Inv_Rep (line 192) | void IP_Inv_Rep(const int input[64], int output[64], const int table[64]) function PC_1 (line 204) | void PC_1(const int input[64], int output[56], const int table[56]) function PC_2 (line 216) | void PC_2(const int input[56], int output[48], const int table[48]) function S_Comp (line 228) | void S_Comp(const int input[48], int output[32], const int table[8][4][16]) function F_func (line 253) | void F_func(const int input[32], int output[32], int subKey[48]) function RotateL (line 268) | void RotateL(const int input[28], int output[28], int leftCount) function subKey_fun (line 281) | void subKey_fun(const int input[64], int subKey[16][48]) function DES_Efun (line 333) | void DES_Efun(const char input[8], char inKey[8], int output[64]) function DES_Dfun (line 382) | void DES_Dfun(const int input[64], char inKey[8], char output[8]) function main (line 430) | int main() FILE: 按 OJ 分类/出处遗忘/f-DES/f-DES/DES.hpp class DES (line 24) | class DES FILE: 按 OJ 分类/出处遗忘/f-DES/f-DES/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-GSJS/f-GSJS/main.cpp function main (line 16) | int main(int argc, char** argv) FILE: 按 OJ 分类/出处遗忘/f-GSJS/f-GSJS/radianToAngle.cpp function RTA (line 16) | double RTA(double ra) FILE: 按 OJ 分类/出处遗忘/f-NOI-30-字符环/f-NOI-30-字符环/main.c function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-NOIP-2009-分数线划定/f-NOIP-2009-分数线划定/main.c type people (line 11) | struct people function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-Permutations/f-Permutations/main.c function main (line 11) | int main() FILE: 按 OJ 分类/出处遗忘/f-cdecl/f-cdecl/main.cpp type type_tag (line 20) | enum type_tag type token (line 25) | struct token type token (line 32) | struct token type token (line 33) | struct token function classify_string (line 35) | enum type_tag classify_string() // 推断标识符的类型 function gettoken (line 101) | void gettoken() // 读取下一个标记到 this_ function read_to_first_identifier (line 127) | void read_to_first_identifier() function deal_with_arrays (line 140) | void deal_with_arrays() function deal_with_function_args (line 158) | void deal_with_function_args() function deal_with_pointers (line 169) | void deal_with_pointers() function deal_with_declarator (line 177) | void deal_with_declarator() function main (line 207) | int main() FILE: 按 OJ 分类/出处遗忘/f-kwic/f-kwic/main.cpp type line (line 15) | struct line type words (line 22) | struct words function cmp (line 29) | bool cmp(const words &a, const words &b) function main (line 64) | int main() FILE: 按 OJ 分类/出处遗忘/f-work2/f-work2/file.hpp class File (line 16) | class File method File (line 23) | File(std::string fileName_, int n_, int *num_) : fileName(fileName_), ... FILE: 按 OJ 分类/出处遗忘/f-work2/f-work2/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-乐视2017实习-偶数大翻转/f-乐视2017实习-偶数大翻转/main.cpp function flip (line 13) | int flip(int x) function main (line 32) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-乐视2017实习-兵临城下/f-乐视2017实习-兵临城下/main.cpp function dfs (line 21) | void dfs(int p) function main (line 39) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-乐视2017实习-幻兽交易/f-乐视2017实习-幻兽交易/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-交谊舞/f-交谊舞/main.c type Status (line 16) | typedef int Status; type SElemType (line 17) | typedef char SElemType; type SqStack (line 19) | typedef struct function Status (line 26) | Status Push (SqStack *S, SElemType e) function main (line 48) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-今日头条2018校招-字母交换/f-今日头条2018校招-字母交换/main.cpp function dp (line 24) | int dp(int i, int j, int a[]) function main (line 40) | int main() FILE: 按 OJ 分类/出处遗忘/f-树的遍历/f-树的遍历/main.c type TElemType (line 12) | typedef char TElemType; type BiTNode (line 15) | typedef struct BiTNode //结点结构 function BinaryTreeFromOrderings (line 22) | void BinaryTreeFromOrderings(char *mid, char *last, int len) function main (line 49) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-湖南人文科技-1659-不一样的解密/f-湖南人文科技-1659-不一样的解密/main.c function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-爱奇艺2018秋招-最后一位/f-爱奇艺2018秋招-最后一位/main.cpp function get_sum (line 15) | long long get_sum(long long x) function main (line 26) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-爱奇艺2018秋招-缺失的括号/f-爱奇艺2018秋招-缺失的括号/main.cpp function findIndex (line 17) | int findIndex(string s) function solve (line 29) | size_t solve(string s) function main (line 49) | int main() FILE: 按 OJ 分类/出处遗忘/f-生日相同2.0/f-生日相同2.0/main.c function swap (line 20) | void swap(int i, int j) function dic (line 43) | int dic(int i, int j) function sequence (line 61) | void sequence() function print (line 99) | void print() function main (line 134) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-百度2016实习-XML文档/f-爱奇艺2018秋招-XML文档/main.cpp function main (line 23) | int main() FILE: 按 OJ 分类/出处遗忘/f-百度2016实习-乘法表/f-百度2016实习-乘法表/main.cpp function ll (line 15) | ll solve (ll n, ll m, ll k) function main (line 41) | int main () FILE: 按 OJ 分类/出处遗忘/f-百度2016实习-编号转换/f-百度2016实习-编号转换/main.cpp function isrc (line 17) | bool isrc(string &s) function string (line 39) | string int2str(int num) function string (line 61) | string rc2(string &rc) function string (line 76) | string fun(int num) function string (line 89) | string i2rc(string &s) function main (line 109) | int main() FILE: 按 OJ 分类/出处遗忘/f-腾讯2017暑期实习生编程题-A-构造回文/f-腾讯2017暑期实习生编程题-A-构造回文/main.cpp function LCS (line 19) | int LCS(const char *s1, const char *s2) function main (line 53) | int main() FILE: 按 OJ 分类/出处遗忘/f-腾讯2017暑期实习生编程题-B-算法基础-字符移位/f-腾讯2017暑期实习生编程题-B-算法基础-字符移位/main.cpp function main (line 43) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-腾讯2017暑期实习生编程题-C-有趣的数字/f-腾讯2017暑期实习生编程题-C-有趣的数字/main.cpp function main (line 19) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-计算对角线元素之和/f-计算对角线元素之和/main.c function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/f-阿里编程测试-问答题1/f-阿里编程测试-问答题1/main.cpp function main (line 24) | int main() FILE: 按 OJ 分类/出处遗忘/二路插入.cpp function PrintArray (line 4) | void PrintArray(int a[], int len){ function BinInsertSort (line 9) | void BinInsertSort(int a[], int len){ function main10 (line 36) | int main10(){ FILE: 按 OJ 分类/出处遗忘/今日头条2018测试/4.cpp type point (line 8) | struct point function solve (line 23) | void solve() function main (line 41) | int main() FILE: 按 OJ 分类/出处遗忘/今日头条2018测试/5.cpp function init (line 15) | void init() function main (line 24) | int main() FILE: 按 OJ 分类/出处遗忘/今日头条2018算法/3.cpp type point (line 8) | struct point function solve (line 23) | void solve() function main (line 41) | int main() FILE: 按 OJ 分类/出处遗忘/今日头条2018算法/4.cpp function init (line 15) | void init() function main (line 24) | int main() FILE: 按 OJ 分类/出处遗忘/今日头条2018算法/5.cpp type idea (line 7) | struct idea function cmp_post (line 22) | bool cmp_post(const idea &a, const idea &b) function cmp_priority (line 28) | bool cmp_priority(const idea &a, const idea &b) function cmp_cost (line 45) | bool cmp_cost(const idea &a, const idea &b) function main (line 54) | int main() FILE: 按 OJ 分类/出处遗忘/归并.cpp function MergeSort (line 7) | void MergeSort(int *array, int begin, int end) function main6 (line 52) | int main6() FILE: 按 OJ 分类/出处遗忘/拼多多2018内推/1.cpp function check_max (line 12) | void check_max(int x) function check_min (line 28) | void check_min(int x) function check_max_neg (line 40) | void check_max_neg(int x) function main (line 56) | int main() FILE: 按 OJ 分类/出处遗忘/拼多多2018内推/2.cpp function Carrying (line 6) | void Carrying(int tag,int i,int j,int *p) function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/出处遗忘/拼多多2018内推/3.cpp function main (line 8) | int main() FILE: 按 OJ 分类/出处遗忘/拼多多2018内推/4.cpp type node (line 13) | struct node method node (line 16) | node(int x, int y, int k, int step) : x(x), y(y), k(k), step(step) {} function bfs (line 19) | int bfs(int sX, int sY) function main (line 65) | int main() FILE: 按 OJ 分类/出处遗忘/红黑树.cpp type color_t (line 11) | enum color_t type rb_node_t (line 17) | struct rb_node_t type rb_node_t (line 19) | struct rb_node_t function main (line 30) | int main() function rb_node_t (line 75) | static rb_node_t* rb_new_node(key_t key, data_t data) type rb_node_t (line 19) | struct rb_node_t function rb_node_t (line 96) | static rb_node_t* rb_rotate_left(rb_node_t* node, rb_node_t* root) type rb_node_t (line 19) | struct rb_node_t function rb_node_t (line 133) | static rb_node_t* rb_rotate_right(rb_node_t* node, rb_node_t* root) type rb_node_t (line 19) | struct rb_node_t function rb_node_t (line 163) | static rb_node_t* rb_insert_rebalance(rb_node_t *node, rb_node_t *root) type rb_node_t (line 19) | struct rb_node_t function rb_node_t (line 228) | static rb_node_t* rb_erase_rebalance(rb_node_t *node, rb_node_t *parent,... type rb_node_t (line 19) | struct rb_node_t function rb_node_t (line 324) | static rb_node_t* rb_search_auxiliary(key_t key, rb_node_t* root, rb_nod... type rb_node_t (line 19) | struct rb_node_t function rb_node_t (line 355) | rb_node_t* rb_insert(key_t key, data_t data, rb_node_t* root) type rb_node_t (line 19) | struct rb_node_t function rb_node_t (line 389) | rb_node_t* rb_search(key_t key, rb_node_t* root) type rb_node_t (line 19) | struct rb_node_t function rb_node_t (line 394) | rb_node_t* rb_erase(key_t key, rb_node_t *root) type rb_node_t (line 19) | struct rb_node_t FILE: 按 OJ 分类/出处遗忘/网易2018校园招聘编程题真题集合/1.cpp function solve (line 8) | void solve() function main (line 25) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校园招聘编程题真题集合/2.cpp function main (line 7) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校园招聘编程题真题集合/3.cpp function main (line 7) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校园招聘编程题真题集合/4.cpp function main (line 10) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校园招聘编程题真题集合/5.cpp function main (line 7) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校园招聘编程题真题集合/6.cpp function charge (line 9) | bool charge(string str) function main (line 32) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校园招聘编程题真题集合/7.cpp function main (line 13) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校园招聘编程题真题集合/8.cpp type point (line 9) | struct point function main (line 14) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校招内推编程题集合/1.cpp function main (line 8) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校招内推编程题集合/2.cpp function string (line 10) | string solve() function main (line 26) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校招内推编程题集合/3.cpp function main (line 7) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校招内推编程题集合/4.cpp function main (line 10) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校招内推编程题集合/5.cpp function main (line 7) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校招内推编程题集合/6.cpp function solve (line 12) | void solve() function main (line 36) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校招内推编程题集合/7.cpp function main (line 11) | int main() FILE: 按 OJ 分类/出处遗忘/网易2018校招内推编程题集合/8.cpp function main (line 12) | int main() FILE: 按 OJ 分类/出处遗忘/辗转相除法.c function main (line 3) | int main () FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-初赛 A 轮/1-遥控按键/main.cpp type location (line 23) | struct location function init (line 28) | void init() function main (line 40) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-初赛 A 轮/2-下棋/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-初赛 A 轮/3-城市漫游/main.cpp type node (line 27) | struct node type nn (line 34) | struct nn function add_edge (line 48) | void add_edge(int x_, int y_, ll z_, int id) function lowit (line 58) | int lowit(int x) function add (line 63) | void add(int a, ll b) function ll (line 71) | ll query(int rt) function create (line 83) | void create(int l, int r, int rt) function LCA (line 100) | int LCA(int l, int r, int rt) function dfs (line 122) | void dfs(int rt) function main (line 150) | int main() FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-初赛 B 轮/1-开关灯/main.cpp type engineer (line 26) | struct engineer function cmp (line 33) | bool cmp(const engineer &A, const engineer &B) function main (line 49) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-初赛 B 轮/3-低位值/main.cpp function init (line 22) | void init() function main (line 30) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-初赛 B 轮/4-神奇盘子/main.cpp function dis (line 24) | double dis(double x, double y, double x1, double y1) function main (line 29) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-资格赛/1-下单/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-资格赛/2-可乐/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-资格赛/3-世界杯/main.cpp function main (line 24) | int main() FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-资格赛/4-分数/main.cpp type person (line 20) | struct person function main (line 36) | int main() FILE: 按 OJ 分类/牛客网/f-牛客网-2018 美团 CodeM 编程大赛-资格赛/5-你的城市/main.cpp type node (line 23) | struct node method node (line 27) | node(int v_ = 0, int c_ = 0) : v(v_), c(c_) {} type edge (line 35) | struct edge method edge (line 39) | edge(int v_ = 0, int cost_ = 0) : v(v_), cost(cost_) {} function Dijkstra (line 48) | void Dijkstra(int n, int start) function addedge (line 90) | void addedge(int u, int v, int w) function dfs (line 95) | bool dfs(int u) function main (line 127) | int main() FILE: 按 OJ 分类/牛客网/f-牛客网-剑指Offer/二维数组中的查找/main.cpp class Solution (line 17) | class Solution method Find (line 20) | bool Find(int target, vector> array) function main (line 50) | int main() FILE: 按 OJ 分类/牛客网/f-牛客网-剑指Offer/从尾到头打印链表/main.cpp type ListNode (line 18) | struct ListNode type ListNode (line 21) | struct ListNode method ListNode (line 22) | ListNode(int x) : val(x), next(NULL) {} class Solution (line 25) | class Solution method printListFromTailToHead (line 28) | vector printListFromTailToHead(ListNode *head) function main (line 48) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/牛客网/f-牛客网-剑指Offer/替换空格/main.cpp class Solution (line 18) | class Solution method replaceSpace (line 21) | void replaceSpace(char *str,int length) function main (line 50) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/玲珑杯/f-"玲珑杯“ ACM热身赛 # 0.5-A-Alarm/f-"玲珑杯“ ACM热身赛 # 0.5-A-Alarm/main.cpp function getPrime (line 28) | void getPrime() function init (line 49) | void init() function main (line 59) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/玲珑杯/f-"玲珑杯“ ACM热身赛 # 0.5-B-Battle/f-"玲珑杯“ ACM热身赛 # 0.5-B-Battle/main.cpp function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/玲珑杯/f-“玲珑杯”ACM比赛 Round #1-A-Absolute Defeat/f-“玲珑杯”ACM比赛 Round #1-A-Absolute Defeat/main.cpp function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/玲珑杯/f-“玲珑杯”ACM比赛 Round #10-A-Black and White/f-“玲珑杯”ACM比赛 Round #10-A-Black and White/main.cpp function init (line 20) | void init() function main (line 26) | int main() FILE: 按 OJ 分类/百炼/f-百练-2456-Aggressive cows/f-百练-2456-Aggressive cows/main.cpp function check (line 21) | bool check(int m) function main (line 41) | int main() FILE: 按 OJ 分类/码农谷/f-2016码农谷全国大学生程序设计邀请赛（测试赛）-试题一-将字符串中的字符按规则重新排列/f-2016码农谷全国大学生程序设计邀请赛（测试赛）-试题一-将字符串中的字符按规则重新排列/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/码农谷/f-2016码农谷全国大学生程序设计邀请赛（测试赛）-试题三-将数分成两组，使得两组中各元素的和相等/f-2016码农谷全国大学生程序设计邀请赛（测试赛）-试题三-将数分成两组，使得两组中各元素的和相等/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/码农谷/f-2016码农谷全国大学生程序设计邀请赛（测试赛）-试题二-统计出以某个字符串为前缀的单词数量/f-2016码农谷全国大学生程序设计邀请赛（测试赛）-试题二-统计出以某个字符串为前缀的单词数量/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/码农谷/f-2016码农谷全国大学生程序设计邀请赛（测试赛）-试题四-求二进制数字符串的和/f-2016码农谷全国大学生程序设计邀请赛（测试赛）-试题四-求二进制数字符串的和/main.cpp function carry (line 20) | void carry(int i) function main (line 31) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/码农谷/f-2016码农谷全国大学生程序设计邀请赛（第一轮资格赛）-试题一 对码农的编程水平进行排名/f-2016码农谷全国大学生程序设计邀请赛（第一轮资格赛）-试题一 对码农的编程水平进行排名/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/码农谷/f-2016码农谷全国大学生程序设计邀请赛（第一轮资格赛）-试题三 将一个英文语句以单词为单位逆序排序/f-2016码农谷全国大学生程序设计邀请赛（第一轮资格赛）-试题三 将一个英文语句以单词为单位逆序排序/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/码农谷/f-2016码农谷全国大学生程序设计邀请赛（第一轮资格赛）-试题二 奇怪的数字：6174/f-2016码农谷全国大学生程序设计邀请赛（第一轮资格赛）-试题二 奇怪的数字：6174/main.cpp function main (line 17) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/码农谷/f-2016码农谷全国大学生程序设计邀请赛（第一轮资格赛）-试题四 小码农挑选资源的方案数/f-2016码农谷全国大学生程序设计邀请赛（第一轮资格赛）-试题四 小码农挑选资源的方案数/main.cpp function solve (line 19) | void solve(int n, int s, int q) function main (line 34) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-ADV-1-两条直线/f-ADV-1-两条直线/main.c function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-ADV-144-01背包/f-ADV-144-01背包/main.c function max (line 12) | int max(int a,int b) function Sack (line 20) | int Sack(int n, int *w, int *v, int C) function main (line 43) | int main() FILE: 按 OJ 分类/蓝桥杯/f-ADV-158-新建Microsoft Word文档/f-ADV-158-新建Microsoft Word文档/main.c function New (line 15) | void New() function Delete (line 28) | void Delete(char *p) function main (line 50) | int main() FILE: 按 OJ 分类/蓝桥杯/f-ADV-200-求最大值/f-ADV-200-求最大值/main.c function swap (line 16) | void swap(int a, int b) function solve (line 24) | void solve(int i, int d, int aiSum, int biSum) function main (line 43) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-ADV-3-金属采集/f-ADV-3-金属采集/main.c type ll (line 13) | typedef long long ll; function addage (line 24) | void addage(int x, int y, int w) function dfs (line 34) | void dfs(int S) function main (line 56) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-ALGO-116-最大的算式/f-ALGO-116-最大的算式/main.c function main (line 138) | int main() FILE: 按 OJ 分类/蓝桥杯/f-ALGO-133-Tricky and Clever Password/f-ALGO-133-Tricky and Clever Password/main.c function main (line 11) | int main(int argc, const char * argv[]) { FILE: 按 OJ 分类/蓝桥杯/f-ALGO-137-Lift and Throw/f-ALGO-137-Lift and Throw/main.c function near (line 111) | int near(int s) function dfs (line 124) | void dfs(int d) function main (line 212) | int main() FILE: 按 OJ 分类/蓝桥杯/f-ALGO-142-P1103/f-ALGO-142-P1103/main.c type plu (line 11) | typedef struct plural //结构体－－复数 type plural (line 16) | struct plural type plural (line 16) | struct plural type plural (line 17) | struct plural type plural (line 17) | struct plural type plural (line 18) | struct plural type plural (line 18) | struct plural type plural (line 19) | struct plural type plural (line 19) | struct plural function main (line 23) | int main(int argc, const char * argv[]) function add (line 58) | void add(struct plural *p, struct plural *q) function sub (line 65) | void sub(struct plural *p, struct plural *q) function mul (line 72) | void mul(struct plural *p, struct plural *q) function did (line 79) | void did(struct plural *p, struct plural *q) FILE: 按 OJ 分类/蓝桥杯/f-ALGO-144-2-3逆序打印数字/f-ALGO-144-2-3逆序打印数字/main.c function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-ALGO-4-结点选择/f-ALGO-4-结点选择/main.c type point (line 14) | struct point function addEdge (line 24) | void addEdge(int from, int to) function dfs (line 38) | void dfs(int x, int pre) function main (line 55) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-ALGO-48-关联矩阵/f-ALGO-48-关联矩阵/main.c function main (line 12) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-ALGO-6-安慰奶牛/f-ALGO-6-安慰奶牛/main.c type Edge (line 14) | typedef struct Edge //边 function cmp (line 29) | int cmp(const void *a, const void *b) function find (line 37) | int find(int x) function Union (line 57) | void Union(int S, int E) function Kruskal (line 78) | int Kruskal() function main (line 105) | int main () FILE: 按 OJ 分类/蓝桥杯/f-ALGO-87-字串统计/f-ALGO-87-字串统计/main.c function isSubStr (line 13) | int isSubStr(char *S, int indexOne, int indexTwo, int len) function repeat (line 27) | int repeat(char *S, int index, int len) function main (line 41) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-ALGO-90-出现次数最多的整数/f-ALGO-90-出现次数最多的整数/main.c function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-BASIC-12-十六进制转八进制/f-BASIC-12-十六进制转八进制/main.c function Fun (line 13) | void Fun(int i, int state) function main (line 42) | int main() FILE: 按 OJ 分类/蓝桥杯/f-PREV-2-打印十字图/f-PREV-2-打印十字图/main.c function centre (line 12) | void centre(int n) function vertical (line 25) | void vertical(int n) function horizontal (line 37) | void horizontal(int n) function corner (line 49) | void corner(int n) function main (line 68) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-PREV-3-带分数/f-PREV-3-带分数/main.c function main (line 11) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-PREV-5-错误票据/f-PREV-5-错误票据/main.c type SqList (line 12) | typedef struct function swap (line 19) | void swap(SqList *L, int i, int j) function Partition (line 28) | int Partition(SqList *L, int low, int high) function QSort (line 49) | void QSort(SqList *L, int low, int high) function QuickSort (line 61) | void QuickSort(SqList *L) function main (line 66) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-10-集合运算/f-蓝桥-ALGO-10-集合运算/main.cpp function main (line 22) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-11-瓷砖铺放/f-蓝桥-ALGO-11-瓷砖铺放/main.cpp function solve (line 15) | int solve(int n) function main (line 24) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-12-幂方分解/f-蓝桥-ALGO-12-幂方分解/main.cpp function init (line 19) | void init() function solve (line 28) | void solve(int n, int k) function main (line 65) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-13-拦截导弹/f-蓝桥-ALGO-13-拦截导弹/main.cpp function bsearch (line 20) | int bsearch(int *f, int size, int a) function LIS (line 43) | int LIS(int *a, int n) function main (line 72) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-14-回文数/f-蓝桥-ALGO-14-回文数/main.cpp function add (line 23) | void add() function charge (line 42) | bool charge() function getNum2 (line 54) | void getNum2() function main (line 62) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-15-旅行家的预算/f-蓝桥-ALGO-15-旅行家的预算/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-16-进制转换/f-蓝桥-ALGO-16-进制转换/main.cpp function main (line 17) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-17-乘积最大/f-蓝桥-ALGO-17-乘积最大/main.cpp function getNum (line 20) | int getNum(int st, int ed) function main (line 31) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-18-单词接龙/f-蓝桥-ALGO-18-单词接龙/main.cpp function charge (line 20) | int charge(int left, int right) function dfs (line 49) | void dfs(int k, int l) function main (line 67) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-19-方格取数/f-蓝桥-ALGO-19-方格取数/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-20-求先序排列/f-蓝桥-ALGO-20-求先序排列/main.cpp type BTNode (line 14) | struct BTNode type BTNode (line 17) | struct BTNode function BuildBTree (line 23) | void BuildBTree(BTree &t, int ms, int me, int ls, int le) function PrintBTree (line 46) | void PrintBTree(BTree p) function main (line 56) | int main(int argc, char* argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-22-整数划分/f-蓝桥-ALGO-22-整数划分/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-23-一元三次方程求解/f-蓝桥-ALGO-23-一元三次方程求解/main.cpp function cal (line 59) | double cal(double x) function main (line 64) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-24-统计单词个数/f-蓝桥-ALGO-24-统计单词个数/main.cpp function main (line 25) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-25-Car的旅行路线/f-蓝桥-ALGO-25-Car的旅行路线/main.cpp type city (line 19) | struct city function getCost (line 29) | double getCost(int x1, int y1, int x2, int y2, int t) function Floyd (line 34) | void Floyd(int n) function get_fourth_node (line 52) | void get_fourth_node(int x1, int y1, int x2, int y2, int x3, int y3, int... function main (line 68) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-26-麦森数/f-蓝桥-ALGO-26-麦森数/main.cpp function multiply (line 19) | void multiply(int a[], int b[]) function msss (line 46) | void msss(int power) function main (line 64) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-27-FBI树/f-蓝桥-ALGO-27-FBI树/main.cpp type BTNode (line 14) | struct BTNode method BTNode (line 19) | BTNode(int l_, int r_) function BuildBTree (line 30) | void BuildBTree(BTree &t, int l, int r) function PrintfBTree (line 64) | void PrintfBTree(BTree p) function main (line 74) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-28-星际交流/f-蓝桥-ALGO-28-星际交流/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-29-校门外的树/f-蓝桥-ALGO-29-校门外的树/main.cpp type interval (line 18) | struct interval function cmp (line 25) | bool cmp(interval a, interval b) function main (line 34) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-32-JAM计数法/f-蓝桥-ALGO-32-JAM计数法/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-33-数列/f-蓝桥-ALGO-33-数列/main.cpp function main (line 19) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-34-纪念品分组/f-蓝桥-ALGO-34-纪念品分组/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-35-传球游戏/f-蓝桥-ALGO-35-传球游戏/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-36-传纸条/f-蓝桥-ALGO-36-传纸条/main.cpp function main (line 18) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-37-Hankson的趣味题/f-蓝桥-ALGO-37-Hankson的趣味题/main.cpp function init (line 20) | void init() function cal (line 35) | int cal(int &x, int p) function main (line 49) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-38-接水问题/f-蓝桥-ALGO-38-接水问题/main.cpp function main (line 25) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-40-会议中心/f-蓝桥-ALGO-40-会议中心/main.cpp type node (line 21) | struct node method node (line 25) | node() {} method node (line 26) | node(int l_, int r_) : l(l_), r(r_) {} function bs (line 43) | int bs(int x) function cmp (line 64) | bool cmp(const node &a,const node &b) function discrete (line 70) | void discrete() function next_set (line 92) | void next_set() function max_cnt (line 134) | int max_cnt(int l, int r) function query (line 155) | bool query(int x) function main (line 188) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-44-采油区域/f-蓝桥-ALGO-44-采油区域/main.cpp function get_sum (line 29) | void get_sum() function get_KK_sum (line 40) | void get_KK_sum() function get_dir_dir (line 51) | void get_dir_dir() function get_ans (line 94) | void get_ans() function main (line 157) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥-ALGO-9-摆动序列/f-蓝桥-ALGO-9-摆动序列/main.cpp function main (line 51) | int main() FILE: 按 OJ 分类/蓝桥杯/f-蓝桥杯-历届试题-PREV-13-网络寻路/f-蓝桥杯-历届试题-PREV-13-网络寻路/main.cpp function dfs (line 20) | void dfs(int last, int st, int step) function main (line 36) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥杯省A-剪邮票/f-蓝桥杯省A-剪邮票/main.c function test (line 14) | void test(int i, int j, int k, int q, int w) function vid (line 55) | void vid() function main (line 87) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥杯省A-四平方和/f-蓝桥杯省A-四平方和/main.c function solve (line 14) | void solve(int n) function main (line 41) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥杯省A-密码脱落/f-蓝桥杯省A-密码脱落/main.c function code (line 11) | void code(char *s) function main (line 56) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥杯省A-寒假作业/f-蓝桥杯省A-寒假作业/main.c function test (line 15) | int test(int n) function dfs (line 53) | void dfs(int n) function main (line 78) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥杯省A-方格填数/f-蓝桥杯省A-方格填数/main.c function init (line 19) | void init() function judge (line 41) | void judge() function dfs (line 90) | void dfs(int n) function main (line 121) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/蓝桥杯/f-蓝桥杯省A-最大比例/f-蓝桥杯省A-最大比例/main.c function sequenceM (line 18) | void sequenceM() function reduce (line 48) | void reduce(int i) function sequenceW (line 64) | void sequenceW() function NDbase (line 99) | long long NDbase(long long *Ator) function base (line 157) | void base() function pro (line 166) | void pro() function main (line 180) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-2016-计蒜之道-初赛-第二场-A-联想公司的logo设计/f-2016-计蒜之道-初赛-第二场-A-联想公司的logo设计/main.c function main (line 13) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-2016-计蒜之道-初赛-第二场-B-联想的显示屏校准/f-2016-计蒜之道-初赛-第二场-B-联想的显示屏校准/main.c function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-2016-计蒜之道-初赛-第五场-A-腾讯的一笔画游戏/f-2016-计蒜之道-初赛-第五场-A-腾讯的一笔画游戏/main.cpp function main (line 14) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-2016-计蒜之道-初赛-第四场-A-淘宝流量分配/f-2016-计蒜之道-初赛-第四场-A-淘宝流量分配/main.cpp function scan_d (line 15) | inline void scan_d(T &ret) function main (line 24) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-2016-计蒜之道-初赛-第四场-B、C、D-遗失的支付宝密码/f-2016-计蒜之道-初赛-第四场-B、C、D-遗失的支付宝密码/main.cpp function main (line 16) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-A-Banana/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-A-Banana/main.cpp function main (line 22) | int main() FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-B-Out-out-control cars/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-B-Out-out-control cars/main.cpp type Point (line 21) | struct Point method Point (line 24) | Point(double x = 0, double y = 0) : x(x), y(y) {} method Point (line 26) | Point operator + (Point a) { return Point(x + a.x, y + a.y); } method Point (line 27) | Point operator - (Point a) { return Point(x - a.x, y - a.y); } method Point (line 28) | Point operator * (double p) { return Point(x * p, y * p); } method Point (line 29) | Point operator / (double p) { return Point(x / p, y / p); } function dcmp (line 32) | int dcmp(double x) function Dot (line 54) | double Dot(Point A, Point B) function Cross (line 59) | double Cross(Point A, Point B) function isPointOnSegment (line 64) | int isPointOnSegment(Point p, Point a1, Point a2) function SegmentProperIntersection (line 69) | bool SegmentProperIntersection(Point a1, Point a2, Point b1, Point b2) function ConvexHull (line 76) | int ConvexHull(Point *p, int n, Point *ch) function isPointInPolygon (line 106) | int isPointInPolygon(Point p, Point *po, int n) function checkConvexHullIntersection (line 135) | int checkConvexHullIntersection(Point *p, Point *q, int np, int nq) function solve (line 165) | void solve(Point &p, Point q, double x1, double y1) function main (line 171) | int main() FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-C-Coconut/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-C-Coconut/main.cpp function main (line 20) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-E-Half-consecutive Numbers/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-E-Half-consecutive Numbers/main.cpp function init (line 22) | void init() function main (line 35) | int main() FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-F-Islands/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-F-Islands/main.cpp function dfs (line 28) | void dfs(int u) function main (line 64) | int main() FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-G-Query on a string/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-G-Query on a string/main.cpp function add (line 24) | void add(int x, int c, int n) function query (line 33) | int query(int x) function main (line 47) | int main() FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-H-Skiing/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-H-Skiing/main.cpp type Node (line 23) | struct Node function add_edge (line 28) | void add_edge(int u, int v, int w) function spfa (line 36) | void spfa(int s) function init (line 66) | void init() function main (line 72) | int main() FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-J-Our Journey of Dalian Ends/f-计蒜客-2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛-J-Our Journey of Dalian Ends/main.cpp type Edge (line 23) | struct Edge type MCMF (line 32) | struct MCMF method init (line 42) | void init(int n) method AddEdge (line 52) | void AddEdge(int from, int to, int cap, int cost) method BellmanFord (line 61) | bool BellmanFord(int s, int t, int &flow, ll &cost) method ll (line 114) | ll Mincost(int s, int t) function init (line 132) | void init() function main (line 143) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 计蒜之道 初赛 第六场-A-微软手机的信号显示/f-计蒜客-2017 计蒜之道 初赛 第六场-A-微软手机的信号显示/main.cpp function main (line 21) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 计蒜之道 初赛 第六场-B-微软大楼设计方案（简单）/f-计蒜客-2017 计蒜之道 初赛 第六场-B-微软大楼设计方案（简单）/main.cpp type node (line 27) | struct node type room (line 34) | struct room function query (line 40) | void query(int x) function build_tree (line 45) | void build_tree(int l, int r, int x) function sear (line 61) | void sear(int l, int r, int x) function get_dis (line 84) | int get_dis(int x, int y) function main (line 121) | int main() FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 计蒜之道 复赛-A-阿里云秘钥池/f-计蒜客-2017 计蒜之道 复赛-A-阿里云秘钥池/main.cpp function main (line 15) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 计蒜之道 复赛-B-Windows 画图/f-计蒜客-2017 计蒜之道 复赛-B-Windows 画图/main.cpp type node (line 19) | struct node function main (line 24) | int main(int argc, const char * argv[]) FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 计蒜之道 复赛-D-百度地图导航/f-计蒜客-2017 计蒜之道 复赛-D-百度地图导航/main.cpp type node (line 22) | struct node function init (line 34) | void init() function add (line 41) | inline void add(int u, int v, ll w) function SPFA (line 49) | void SPFA(int s, int t) function main (line 83) | int main() FILE: 按 OJ 分类/计蒜客/f-计蒜客-2017 计蒜之道 复赛-F-腾讯消消乐/f-计蒜客-2017 计蒜之道 复赛-F-腾讯消消乐/main.cpp function mod (line 24) | inline void mod(ll &x) function ll (line 29) | inline ll gcd(ll a, ll b) function main (line 36) | int main()