Skip to content

Commit dc40f67

Browse files
author
Oleksandr Kulkov
authored
e-maxx-eng -> cp-algorithms
1 parent aae1599 commit dc40f67

File tree

1 file changed

+4
-4
lines changed

1 file changed

+4
-4
lines changed

CONTRIBUTING.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
## General information
44

5-
This website (articles, design, ...) is developed via [Github](https://github.com/e-maxx-eng/e-maxx-eng). And everybody is welcome to help out. All you need is a Github account.
5+
This website (articles, design, ...) is developed via [Github](https://github.com/cp-algorithms/cp-algorithms). And everybody is welcome to help out. All you need is a Github account.
66

77
Generated pages are compiled and published at [https://cp-algorithms.com](https://cp-algorithms.com).
88

@@ -97,7 +97,7 @@ e_maxx_link: euler_function
9797

9898
## Some conventions
9999

100-
* We have agreed as of issue [#83](https://github.com/e-maxx-eng/e-maxx-eng/issues/83) to express binomial coefficients with `\binom{n}{k}` instead of `C_n^k`. The first one renders as $\binom{n}{k}$ and is a more universal convention. The second would render as $C_n^k$.
100+
* We have agreed as of issue [#83](https://github.com/cp-algorithms/cp-algorithms/issues/83) to express binomial coefficients with `\binom{n}{k}` instead of `C_n^k`. The first one renders as $\binom{n}{k}$ and is a more universal convention. The second would render as $C_n^k$.
101101

102102
## Adding Problems
103103

@@ -108,7 +108,7 @@ Try to add problems in ascending order of their difficulty. If you don't have en
108108
You can render the pages locally. All you need is Python, with the installed `mkdocs-material` package.
109109

110110
```console
111-
$ git clone --recursive https://github.com/e-maxx-eng/e-maxx-eng.git && cd e-maxx-eng
111+
$ git clone --recursive https://github.com/cp-algorithms/cp-algorithms.git && cd cp-algorithms
112112
$ scripts/install-mkdocs.sh # requires pip installation
113113
$ mkdocs serve
114114
```
@@ -167,4 +167,4 @@ Running test_vertical_decomposition.cpp - Passed in 2397 ms
167167
51 PASSED in 49.00 seconds
168168
```
169169

170-
Also, every pull-request will automatically tested via [Github Actions](https://github.com/e-maxx-eng/e-maxx-eng/actions).
170+
Also, every pull-request will automatically tested via [Github Actions](https://github.com/cp-algorithms/cp-algorithms/actions).

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy