Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Sianko
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
Show HN: Makessg
(github.com)
3 points
by
Sianko
1mo ago
|
0 comments
2.
▲
Make Selfie in the Space
(space.crunchlabs.com)
1 points
by
Sianko
2y ago
|
0 comments
3.
▲
by
Sianko
2y ago
Another "fancy" obsidian, with providing "cool" themes by quite a lot of bucks... I do not see even the syncing method here.
4.
▲
by
Sianko
2y ago
I 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); ```
5.
▲
by
Sianko
2y ago
So 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=
6.
▲
Show HN: ThinkPad Keyboard Backlight Controller
(github.com)
2 points
by
Sianko
2y ago
|
0 comments