MCPcopy Create free account

hub / github.com/NASU41/AtCoderLibraryForJava / functions

Functions317 in github.com/NASU41/AtCoderLibraryForJava

⨍ Functions 317◇ Types & classes 64
↓ 1 callersMethodbuild
(S[] dat)
LazySegTree/test/Solution.java:120
↓ 1 callersMethodbuild
(long[] dat)
FenwickTree/FenwickTree.java:49
↓ 1 callersMethodbuild
(S[] dat)
SegTree/SegTree.java:30
↓ 1 callersMethodbutterflyInv
Inverse NTT. @param a Target array. @param g Primitive root of mod. @param mod NTT Prime.
Convolution/Convolution.java:182
↓ 1 callersMethodchangeEdge
(int i, long newCap, long newFlow)
MaxFlow/MaxFlow.java:78
↓ 1 callersMethodconvolutionLL
Convolution. @param a Target array 1. @param b Target array 2. @param mod Any mod. @return Answer.
Convolution/Convolution.java:347
↓ 1 callersMethodconvolutionNaive
Naive convolution. (Complexity is O(N^2)!!) @param a Target array 1. @param b Target array 2. @param mod Mod. @return Answer.
Convolution/Convolution.java:397
↓ 1 callersMethoddfs
(int cur, int s, long flowLimit, int[] iter, int[] level)
MaxFlow/MaxFlow.java:134
↓ 1 callersMethoddualRef
(int s, int t, long[] dual, long[] dist, int[] pv, int[] pe, boolean[] vis)
MinCostFlow/MinCostFlow.java:149
↓ 1 callersMethodequals
(Object another)
Pair/Pair.java:11
↓ 1 callersMethodflow
(int s, int t, long flowLimit)
MaxFlow/MaxFlow.java:97
↓ 1 callersMethodgarner
Garner's algorithm. @param c Mod convolution results. @param mods Mods. @return Result.
Convolution/Convolution.java:156
↓ 1 callersMethodgcd
(long... a)
Math/MathLib.java:25
↓ 1 callersMethodgen
(PrintWriter out)
LazySegTree/test/Gen.java:36
↓ 1 callersMethodget
(int p)
LazySegTree/test/Solution.java:178
↓ 1 callersMethodget
(int p)
FenwickTree/FenwickTree.java:36
↓ 1 callersMethodgetEdges
()
MinCostFlow/MinCostFlow.java:93
↓ 1 callersMethodgetEdges
()
MaxFlow/MaxFlow.java:72
↓ 1 callersMethodgetInternalEdge
(int i)
MinCostFlow/MinCostFlow.java:77
↓ 1 callersMethodgetInternalEdgeReversed
(InternalWeightedCapEdge e)
MinCostFlow/MinCostFlow.java:81
↓ 1 callersMethodgrow
()
2SAT/TwoSAT.java:73
↓ 1 callersMethodids
()
2SAT/TwoSAT.java:96
↓ 1 callersMethodinsertionsortUsingComparator
(int[] a, java.util.function.IntBinaryOperator comparator)
StringAlgorithm/StringAlgorithm.java:51
↓ 1 callersMethodinv
(long a, long mod)
Convolution/Convolution.java:88
↓ 1 callersMethodinv
()
ModInt/ModInt.java:143
↓ 1 callersMethodinv
(int a)
ModInt/ModInt.java:234
↓ 1 callersMethodmain
(String[] args)
LazySegTree/test/Gen.java:24
↓ 1 callersMethodmain
(String[] args)
LazySegTree/test/Test.java:10
↓ 1 callersMethodmain
(String[] args)
LazySegTree/test/Solution.java:11
↓ 1 callersMethodmain
(String[] args)
LazySegTree/test/NaiveSolution.java:11
↓ 1 callersMethodmakeGraphUsage
()
GraphBuilder/GraphBuilderUsage.java:3
↓ 1 callersMethodmakeGraphWithEdgeInfoUsage
()
GraphBuilder/GraphBuilderUsage.java:17
↓ 1 callersMethodmaxRight
(int l, java.util.function.Predicate<S> g)
LazySegTree/test/Solution.java:244
↓ 1 callersMethodmergesortUsingComparator
(int[] a, java.util.function.IntBinaryOperator comparator)
StringAlgorithm/StringAlgorithm.java:66
↓ 1 callersMethodminCostMaxFlow
(int s, int t)
MinCostFlow/MinCostFlow.java:99
↓ 1 callersMethodminLeft
(int r, java.util.function.Predicate<S> g)
LazySegTree/test/Solution.java:272
↓ 1 callersMethodmod
()
ModInt/ModInt.java:226
↓ 1 callersMethodnextPermutation
(int[] a)
Permutation/Permutation.java:29
↓ 1 callersMethodof
(int mod)
ModInt/ModInt.java:262
↓ 1 callersMethodpow
(long b)
ModInt/ModInt.java:146
↓ 1 callersMethodprimitiveRoot
Find a primitive root. @param m A prime number. @return Primitive root.
Convolution/Convolution.java:14
↓ 1 callersMethodprod
(int l, int r)
LazySegTree/test/Solution.java:185
↓ 1 callersMethodrun
()
MinCostFlow/Main.java:104
↓ 1 callersMethodrun
()
MaxFlow/Main.java:16
↓ 1 callersMethodsaNaive
(int[] s)
StringAlgorithm/StringAlgorithm.java:4
↓ 1 callersMethodset
(int p, S x)
LazySegTree/test/Solution.java:170
↓ 1 callersMethodsolve
(Scanner sc, PrintWriter pw)
LazySegTree/test/Solution.java:31
↓ 1 callersMethodsolve
(Scanner sc, PrintWriter pw)
LazySegTree/test/NaiveSolution.java:31
↓ 1 callersMethodsolve
(int n, int k, long[][] a)
MinCostFlow/Main.java:53
↓ 1 callersMethodsolve
(int n, int m, int f, int[][] edges)
MinCostFlow/Main.java:91
↓ 1 callersMethodsolve
(int n, int m, char[][] g)
MaxFlow/Main.java:26
↓ 1 callersMethodsolve
(int h, int w, char[][] g)
MaxFlow/Main.java:133
↓ 1 callersMethodsolve
(int n, char[][] c)
MaxFlow/Main.java:190
↓ 1 callersMethodsum
(int l, int r)
FenwickTree/FenwickTree.java:31
↓ 1 callersMethodtest
()
LazySegTree/test/Main.java:8
↓ 1 callersMethodtoSimpleString
()
LazySegTree/LazySegTree.java:289
↓ 1 callersMethodtoSimpleString
()
LazySegTree/test/Solution.java:365
↓ 1 callersMethodtoSimpleString
()
SegTree/SegTree.java:178
MethodAnswer
(long ans, char[][] g)
MinCostFlow/Main.java:27
MethodAnswer
(int c, char[][] g)
MaxFlow/Main.java:101
MethodCapEdge
(int from, int to, long cap, long flow)
MaxFlow/MaxFlow.java:11
MethodContestPrinter
(java.io.PrintStream stream)
ContestIO/ContestPrinter.java:2
MethodContestScanner
(java.io.InputStream in)
ContestIO/ContestScanner.java:11
MethodDSU
(int n)
DSU/DSU.java:5
MethodEdge
(int from, int to)
SCC/SCC.java:8
MethodEdgeList
(int cap)
2SAT/TwoSAT.java:68
MethodFenwickTree
(int n)
FenwickTree/FenwickTree.java:5
MethodFftInfo
(int g, int mod)
Convolution/Convolution.java:112
MethodFlowAndCost
(long flow, long cost)
MinCostFlow/MinCostFlow.java:35
MethodIntPair
(int first, int second)
MinCostFlow/MinCostFlow.java:30
MethodIntPair
(int first, int second)
MaxFlow/MaxFlow.java:23
MethodInternalCapEdge
(int to, int rev, long cap)
MaxFlow/MaxFlow.java:6
MethodInternalSCC
(int n)
2SAT/TwoSAT.java:85
MethodInternalWeightedCapEdge
(int to, int rev, long cap, long cost)
MinCostFlow/MinCostFlow.java:11
MethodLazySegTree
(int n, java.util.function.BinaryOperator<S> op, S e, java.util.function.BiFunction<F, S, S> mapping, java.uti
LazySegTree/LazySegTree.java:21
MethodLazySegTree
(int n, java.util.function.BinaryOperator<S> op, S e, java.util.function.BiFunction<F, S, S> mapping, java.uti
LazySegTree/test/Solution.java:97
MethodMaxFlow
(int n)
MaxFlow/MaxFlow.java:32
MethodMinCostFlow
(int n)
MinCostFlow/MinCostFlow.java:52
MethodModArithmeticBarrett
(int mod)
ModInt/ModInt.java:383
MethodModArithmeticDynamic
(int mod)
ModInt/ModInt.java:415
MethodModArithmeticMontgomery
(int mod)
ModInt/ModInt.java:339
MethodModInt
(int value)
ModInt/ModInt.java:79
MethodModIntFactory
(int mod)
ModInt/ModInt.java:25
MethodMultiset
()
Multiset/Multiset.java:2
MethodPair
(S s, T t)
Pair/Pair.java:5
MethodPermutation
(int n)
Permutation/Permutation.java:8
MethodSCC
(int n)
SCC/SCC.java:20
MethodSegTree
(int n, java.util.function.BinaryOperator<S> op, S e)
SegTree/SegTree.java:13
MethodState
(long key, int to)
MinCostFlow/MinCostFlow.java:157
MethodTwoSAT
(int n)
2SAT/TwoSAT.java:12
MethodWeightedCapEdge
(int from, int to, long cap, long flow, long cost)
MinCostFlow/MinCostFlow.java:17
Methodadd
(int a, int b)
ModInt/ModInt.java:228
Methodadd
(int a, int b)
ModInt/ModInt.java:283
Methodadd
(int a, int b)
ModInt/ModInt.java:291
Methodadd
(int a, int b)
ModInt/ModInt.java:303
Methodadd
(int a, int b)
ModInt/ModInt.java:323
Methodadd
(int a, int b)
ModInt/ModInt.java:424
MethodaddEdge
(int from, int to)
SCC/SCC.java:27
MethodaddImplication
(int x, boolean f, int y, boolean g)
2SAT/TwoSAT.java:25
MethodaddNand
(int x, boolean f, int y, boolean g)
2SAT/TwoSAT.java:29
← previousnext →101–200 of 317, ranked by callers