Sianko·2년 전·discussAnother "fancy" obsidian, with providing "cool" themes by quite a lot of bucks... I do not see even the syncing method here.
Sianko·2년 전·discussI think the value of a repeated number can be found much easier: ``` long sum = 0; for (int i = 0; i < n; i++) { if(i < n - 1) { sum -= i; } sum += array[i]; }printf("Element %d\r\n", sum); ```
Sianko·2년 전·discussSo there are many different flavors of crc32. Usually you can always change the initialization value. This algorithm is only one use case.Check this table out https://www.crccalc.com/?crc=123456789&method=&datatype=0&ou...