Update chapter.tex

content/various/chapter.tex

@@ -34,6 +34,7 @@ \section{Optimization tricks}
 			\item \verb@for (int x = m; x; ) { --x &= m; ... }@ loops over all subset masks of \texttt{m} (except \texttt{m} itself).
 			\item \verb@c = x&-x, r = x+c; (((r^x) >> 2)/c) | r@ is the next number after \texttt{x} with the same number of bits set.
 			\item \verb@rep(b,0,K) rep(i,0,(1 << K))@ \\ \verb@  if (i & 1 << b) D[i] += D[i^(1 << b)];@ computes all sums of subsets.
+   			\item \verb@for (LL x = (1LL << n) - 1, ori = (1LL << m); x < ori;) { /*Use x here*/ LL c = x & -x, r = x + c; x = (((r ^ x) >> 2) / c) | r;}
 		\end{itemize}
 	\subsection{Pragmas}
 		\begin{itemize}
@@ -135,4 +136,4 @@ \section{Minimum-Cut Problems}
 % UpdateBIT2(BITree2, r+1, -val*r) \\
 
 % Range Sum \\
-% getSum(BITTree1, k) *k) - getSum(BITTree2, k) \\ 
+% getSum(BITTree1, k) *k) - getSum(BITTree2, k) \\