MCPcopy Create free account

hub / github.com/NASU41/AtCoderLibraryForJava / functions

Functions317 in github.com/NASU41/AtCoderLibraryForJava

⨍ Functions 317◇ Types & classes 64
↓ 60 callersMethodprint
(float f)
ContestIO/ContestPrinter.java:30
↓ 53 callersMethodnext
()
Permutation/Permutation.java:17
↓ 38 callersMethodapply
(int p, F f)
LazySegTree/LazySegTree.java:133
↓ 37 callersMethodaddEdge
(int from, int to, long cap)
MaxFlow/MaxFlow.java:42
↓ 31 callersMethodprintln
(float f)
ContestIO/ContestPrinter.java:34
↓ 26 callersMethodgetEdge
(int i)
MaxFlow/MaxFlow.java:64
↓ 25 callersMethodapply
(int p, F f)
LazySegTree/test/Solution.java:209
↓ 25 callersMethodget
(int p)
SegTree/SegTree.java:48
↓ 23 callersMethodadd
(T elm, long amount)
Multiset/Multiset.java:12
↓ 20 callersMethodsize
(int a)
DSU/DSU.java:47
↓ 19 callersMethodtest
(Scanner scAns, Scanner scSlv)
LazySegTree/test/Test.java:28
↓ 18 callersMethodrndIntClosedRange
(int l, int r)
LazySegTree/test/Gen.java:98
↓ 13 callersMethodaddEdge
(int from, int to, long cap, long cost)
MinCostFlow/MinCostFlow.java:62
↓ 11 callersMethodmaxFlow
(int s, int t)
MaxFlow/MaxFlow.java:93
↓ 9 callersMethodnextInt
()
ContestIO/ContestScanner.java:114
↓ 9 callersMethodremainder
(long value)
ModInt/ModInt.java:227
↓ 7 callersMethodaddAsg
(ModInt mi)
ModInt/ModInt.java:149
↓ 7 callersMethodmulAsg
(ModInt mi)
ModInt/ModInt.java:178
↓ 7 callersMethodpushTo
(int k)
LazySegTree/LazySegTree.java:62
↓ 7 callersMethodpushTo
(int k)
LazySegTree/test/Solution.java:138
↓ 7 callersMethodrangeCheck
(int i, int minInclusive, int maxExclusive)
MaxFlow/MaxFlow.java:173
↓ 7 callersMethodreadByte
()
ContestIO/ContestScanner.java:37
↓ 6 callersMethodgetEdge
(int i)
MinCostFlow/MinCostFlow.java:85
↓ 6 callersMethodinclusiveRangeCheck
(int p)
LazySegTree/LazySegTree.java:232
↓ 6 callersMethodinclusiveRangeCheck
(int p)
LazySegTree/test/Solution.java:308
↓ 6 callersMethodleader
(int a)
DSU/DSU.java:38
↓ 5 callersMethodadd
(ModInt mi)
ModInt/ModInt.java:91
↓ 5 callersMethodcreate
(long value)
ModInt/ModInt.java:34
↓ 5 callersMethodisPrintableChar
(int c)
ContestIO/ContestScanner.java:40
↓ 5 callersMethodminCostSlope
(int s, int t)
MinCostFlow/MinCostFlow.java:105
↓ 5 callersMethodmul
(ModInt mi)
ModInt/ModInt.java:117
↓ 5 callersMethodpow
Power. @param x Parameter x. @param n Parameter n. @param m Mod. @return n-th power of x mod m.
Convolution/Convolution.java:57
↓ 5 callersMethodpush
(int k)
LazySegTree/LazySegTree.java:52
↓ 5 callersMethodpush
(int k)
LazySegTree/test/Solution.java:128
↓ 5 callersMethodrangeCheck
(int i, int minInlusive, int maxExclusive)
MinCostFlow/MinCostFlow.java:193
↓ 4 callersMethodconvolution
Convolution. @param a Target array 1. @param b Target array 2. @param mod NTT Prime. @return Answer.
Convolution/Convolution.java:309
↓ 4 callersMethodcount
(Object elm)
Multiset/Multiset.java:9
↓ 4 callersMethoddiv
(ModInt mi)
ModInt/ModInt.java:137
↓ 4 callersMethoddtos
(double x, int n)
ContestIO/ContestPrinter.java:12
↓ 4 callersMethodgenerate
(long x)
ModInt/ModInt.java:355
↓ 4 callersMethodinclusiveRangeCheck
(int p)
SegTree/SegTree.java:136
↓ 4 callersMethodmod
()
ModInt/ModInt.java:82
↓ 4 callersMethodnextLong
()
ContestIO/ContestScanner.java:58
↓ 4 callersMethodtoString
()
Pair/Pair.java:25
↓ 4 callersMethodvalue
()
ModInt/ModInt.java:85
↓ 3 callersMethodaddClause
(int x, boolean f, int y, boolean g)
2SAT/TwoSAT.java:18
↓ 3 callersMethodceilPow2
Ceil of power 2. @param n Value. @return Ceil of power 2.
Convolution/Convolution.java:75
↓ 3 callersMethodequals
(Object o)
MaxFlow/MaxFlow.java:12
↓ 3 callersMethodexclusiveRangeCheck
(int p)
LazySegTree/LazySegTree.java:224
↓ 3 callersMethodexclusiveRangeCheck
(int p)
LazySegTree/test/Solution.java:300
↓ 3 callersMethodgetInternalEdgeReversed
(InternalCapEdge e)
MaxFlow/MaxFlow.java:60
↓ 3 callersMethodhasNextByte
()
ContestIO/ContestScanner.java:21
↓ 3 callersMethodminCostFlow
(int s, int t, long flowLimit)
MinCostFlow/MinCostFlow.java:102
↓ 3 callersMethodminCut
(int s)
MaxFlow/MaxFlow.java:153
↓ 3 callersMethodmul
(int a, int b)
ModInt/ModInt.java:230
↓ 3 callersMethodnextDouble
()
ContestIO/ContestScanner.java:119
↓ 3 callersMethodprepareFactorial
(int max)
ModInt/ModInt.java:43
↓ 3 callersMethodrangeCheck
(int i)
SCC/SCC.java:134
↓ 3 callersMethodreduce
(long x)
ModInt/ModInt.java:358
↓ 3 callersMethodsafe_mod
(long x, long m)
Math/MathLib.java:2
↓ 3 callersMethodsais
(int[] s, int upper)
StringAlgorithm/StringAlgorithm.java:94
↓ 3 callersMethodupdateFrom
(int k)
LazySegTree/LazySegTree.java:73
↓ 3 callersMethodupdateFrom
(int k)
LazySegTree/test/Solution.java:149
↓ 2 callersMethodaddEdge
(int from, int to)
2SAT/TwoSAT.java:90
↓ 2 callersMethodbutterfly
Inverse NTT. @param a Target array. @param g Primitive root of mod. @param mod NTT Prime.
Convolution/Convolution.java:245
↓ 2 callersMethodexclusiveRangeCheck
(int p)
SegTree/SegTree.java:128
↓ 2 callersMethodgetInternalEdge
(int i)
MaxFlow/MaxFlow.java:56
↓ 2 callersMethodhasNext
()
ContestIO/ContestScanner.java:43
↓ 2 callersMethodhasNext
()
Permutation/Permutation.java:12
↓ 2 callersMethodindent
(int n)
LazySegTree/LazySegTree.java:283
↓ 2 callersMethodindent
(int n)
LazySegTree/test/Solution.java:359
↓ 2 callersMethodindent
(int n)
SegTree/SegTree.java:172
↓ 2 callersMethodinv_gcd
(long a, long b)
Math/MathLib.java:8
↓ 2 callersMethodmakeGraph
(int NumberOfNodes, int NumberOfEdges, int[] from, int[] to, boolean undirected)
GraphBuilder/GraphBuilder.java:2
↓ 2 callersMethodmakeGraphWithEdgeInfo
(int NumberOfNodes, int NumberOfEdges, int[] from, int[] to, boolean undirected)
GraphBuilder/GraphBuilder.java:17
↓ 2 callersMethodnext
()
ContestIO/ContestScanner.java:47
↓ 2 callersMethodnonNegativeCheck
(long cap, java.lang.String attribute)
MinCostFlow/MinCostFlow.java:201
↓ 2 callersMethodnonNegativeCheck
(long cap, String attribute)
MaxFlow/MaxFlow.java:181
↓ 2 callersMethodrangeCheck
(int x)
2SAT/TwoSAT.java:57
↓ 2 callersMethodreduce
(long x)
ModInt/ModInt.java:397
↓ 2 callersMethodsimulatePushAll
()
LazySegTree/LazySegTree.java:253
↓ 2 callersMethodsimulatePushAll
()
LazySegTree/test/Solution.java:329
↓ 2 callersMethodsub
(ModInt mi)
ModInt/ModInt.java:111
↓ 2 callersMethodtoString
()
LazySegTree/LazySegTree.java:248
↓ 2 callersMethodtoString
()
LazySegTree/test/Solution.java:324
↓ 2 callersMethodtoString
()
SegTree/SegTree.java:152
↓ 1 callersMethodadd
(int p, long x)
FenwickTree/FenwickTree.java:23
↓ 1 callersMethodadd
(int upper, int lower)
2SAT/TwoSAT.java:69
↓ 1 callersMethodaddOne
(T elm)
Multiset/Multiset.java:17
↓ 1 callersMethodallProd
()
LazySegTree/test/Solution.java:205
↓ 1 callersMethodapUtil
(int[][] g, boolean[] isAP, int u, int p)
ArticulationPoint/ArticulationPoint.java:20
↓ 1 callersMethodarticulationPoints
(int[][] graph)
ArticulationPoint/ArticulationPoint.java:6
↓ 1 callersMethodarticulationPointsUsage
()
ArticulationPoint/ArticulationPointsUsage.java:3
↓ 1 callersMethodassertArrayEquals
(long[] expected, long[] actual)
Convolution/ConvolutionTest.java:48
↓ 1 callersMethodbfs
(int s, int t, int[] level, int[] que)
MaxFlow/MaxFlow.java:117
↓ 1 callersMethodbridgeUtil
(int[][][] g, boolean[] isBridge, int u, int parentEdge)
Bridge/Bridge.java:26
↓ 1 callersMethodbridges
(int[][][] graphWithEdgeInfo)
Bridge/Bridge.java:6
↓ 1 callersMethodbridgesUsage
()
Bridge/BridgeUsage.java:3
↓ 1 callersMethodbsfConstexpr
(int n)
Convolution/Convolution.java:82
↓ 1 callersMethodbuild
(S[] dat)
LazySegTree/LazySegTree.java:44
next →1–100 of 317, ranked by callers