8 #include <math/Factorize.hpp> 9 #include <utility/Combinatorial.hpp> 32 if(pos+1<partition.size())
33 loopOnAllSubmultiplesOf(n,[&partition,&n,&pos,&fun,&nPart](
const I& factor)
39 loopOnAllFactorizingPartitioning(partition,n/factor,fun,pos+1);
67 Vector<I> partition(nFacts);
70 Impl::loopOnAllFactorizingPartitioning(partition,n,fun);
80 loopOnAllFactorizingPartitioning(n,
81 [&list](
const Vector<I>& partition)
83 list.push_back(partition);
Vector< Vector< I > > listAllFactorizingPartitioning(const I &n, const int &nFacts)
Gets the list of all factorizing partition of n.
I loopOnAllFactorizingPartitioning(const I &n, const Fun &fun, const int &nFacts)
void divWithMod(Vector< TOut > "ient, Vector< TOut > &remainder, const Vector &divisor) const
Returns the result and remainder of the division.
I loopOnAllFactorizingPartitioning(Vector< I > &partition, const I &n, const Fun &fun, const int &pos=0)