From 8b747e2f7af32f2341c2a254c5eaeb54b77dfe09 Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Sun, 15 Nov 2020 20:09:34 +0000
Subject: [PATCH] clang-format and clang-tidy fixes for 5b69ba5c

---
 math/ncr_modulo_p.cpp | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/math/ncr_modulo_p.cpp b/math/ncr_modulo_p.cpp
index b84659b37..03aecf67e 100644
--- a/math/ncr_modulo_p.cpp
+++ b/math/ncr_modulo_p.cpp
@@ -1,6 +1,7 @@
 /**
  * @file
- * @brief This program aims at calculating [nCr modulo p](https://cp-algorithms.com/combinatorics/binomial-coefficients.html).
+ * @brief This program aims at calculating [nCr modulo
+ * p](https://cp-algorithms.com/combinatorics/binomial-coefficients.html).
  * @details nCr is defined as n! / (r! * (n-r)!) where n! represents factorial
  * of n. In many cases, the value of nCr is too large to fit in a 64 bit
  * integer. Hence, in competitive programming, there are many problems or
@@ -19,7 +20,9 @@
 namespace math {
 /**
  * @namespace ncr_modulo_p
- * @brief Functions for [nCr modulo p](https://cp-algorithms.com/combinatorics/binomial-coefficients.html) implementation.
+ * @brief Functions for [nCr modulo
+ * p](https://cp-algorithms.com/combinatorics/binomial-coefficients.html)
+ * implementation.
  */
 namespace ncr_modulo_p {
 /**