seongbeom_park/google-foobar-challenge
1
1
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Seongbeom Park 2022-04-26 13:59:41 +00:00
parent 9412bdb173
commit 067a52c802
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -64,6 +64,6 @@ CFcSBwgCCBoHRhkKU1cGAA4AGU5YQR5THBwNFwoGGAxTQQMQVBUSBg4EAAwQRhUQVBUHFAQTGRpT QQM
1. (a, 2n-a) => (2a, 2n-2a) = (a, n-a)
* a < n
1. (x, y) will loop iff (x + y) % 2 == 1
* x and y are relative prime number
* x and y are relatively prime
* Reference
* [Maximum Matching in General Graph](https://www.secmem.org/blog/2020/04/18/Blossom/)