Now I am curious if there is a dataset for the location of every tree in every city in the world? https://overpass-turbo.eu?
120 karma · joined April 18, 2025
Now I am curious if there is a dataset for the location of every tree in every city in the world? https://overpass-turbo.eu?
This made me a little sad
>I received sponsorship from Amazon via GitHub Sponsors for 10 hours per week for a year
For whatever reason, I remember being shocked that you were only charging $300/hr [1] which was what a mere L6 google engineer would make salaried. I hope they are paying you more nowadays
For example filter can be expressed as:
is_even = lambda x: x % 2 == 0
mapped = map(lambda x: [x] if is_even(x) else [], data)
filtered = reduce(lambda x, y: x + y, mapped, [])
But then the world moved on from it because it was too rigidhttps://antirez.com/hnstyle?username=pg&threshold=20&action=...
Which lets you find the alts of a handle
AE said at one point: “My proposal is to replace the logically complex question with a form of prompt injection. Instead of playing within the rules of the logic puzzle, we attack the framework of the simulation itself. The guards are LLMs instructed to play a role. A well-crafted prompt can often override or confuse these instructions.”
I don't have time to do regular codeforces/atcoder/leetcode rounds (and the rampant AI cheating is pretty demotivating). So the big annual rituals for me to keep my "competitive programmer" label were: fb hacker cup, google code jam, topcoder TCO, and advent of code. Now besides hacker cup, the rest are dead.
Sad. :(
For context, in competitive programming a lot of combinatorial problems (find some formula to count something) require you to output the answer modulo some prime. This is because otherwise the answer would overflow an int and make the problem too tedious to be fun and too hard for problem setters to write good problems or checkers for.
So to prove that you still know how to count the thing, you can do it a finite field. If you use integers mod prime, you still have all the usual arithmetic operations like addition subtraction multiplication. And even division is still easy since you can calculate multiplicative inverse with Fermat's Little Theorem (a^(p-2) = a^(-1) mod p). The final answer you output is not the real thing you're counting, but just evidence that you had the right formula and did all the right operations.
Anyway, just wanted to give context for why competitive programmers care about factorial mod a prime (usually as part of a binomial or multinomial expression). And I'm kind of surprised anyone outside of competitive programming cares about it.
See also:
This quote did not age well
https://www.whitehouse.gov/fact-sheets/2025/04/fact-sheet-pr...
>Krebs ... falsely and baselessly denied that the 2020 election was rigged and stolen
This quote coming from "whitehouse.gov/fact-sheets" is pretty wild. This seems to be retribution, plain and simple.
Does it only use a few recent comments or entire history? I'm trying to figure out where it figured out my city when I thought I was careful not to reveal it. I'm scrolling back pages without finding where I said it in the past. Could it have inferred it based on other information or hallucinated it?
I wonder if there's a more opsec-focused version of this.