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

8
README.md
View File

@ -58,12 +58,12 @@ CFcSBwgCCBoHRhkKU1cGAA4AGU5YQR5THBwNFwoGGAxTQQMQVBUSBg4EAAwQRhUQVBUHFAQTGRpT QQM
* Completed in: 1 day, 23 hrs, 21 secs. * Completed in: 1 day, 23 hrs, 21 secs.
* Check Loop Proof * Check Loop Proof
1. (ac, bc) => (2ac, bc-ac) = (a, b) => (2a, b-a) 1. (ac, bc) => (2ac, bc-ac) = (a, b) => (2a, b-a)
* a < b * a < b
1. (ac, bc+d) => (2ac, bc+d-ac) = (2ac, (b-a)c+d) 1. (ac, bc+d) => (2ac, bc+d-ac) = (2ac, (b-a)c+d)
* a < b and 0 < d < c * a < b and 0 < d < c
1. (a, 2n-a) => (2a, 2n-2a) = (a, n-a) 1. (a, 2n-a) => (2a, 2n-2a) = (a, n-a)
* a < n * a < n
1. (x, y) will loop iff (x + y) % 2 == 1 1. (x, y) will loop iff (x + y) % 2 == 1
* x and y are relative prime number * x and y are relatively prime
* Reference * Reference
* [Maximum Matching in General Graph](https://www.secmem.org/blog/2020/04/18/Blossom/) * [Maximum Matching in General Graph](https://www.secmem.org/blog/2020/04/18/Blossom/)