IIRC's always been "remember" not "recall" to me, but they're close enough synonyms it doesn't seem like it'd matter in any situations (unlike the "imho" one)
and honestly i've grown more sympathetic to that except i was just thinking about a split do {...} while (condition) {...} block and realized that would just clash with plain do {...} while (condition) until i realized that if braces aren't obligatory do {...} while (condition) ; actually looks better
(can't remember if existing languages actually do that or not but i sure know java doesn't)
Well, normally it is even harder than that, because you have to write lib (where you write functions that solve the task) and bin (where you read the input and run the functions) separately and store the input manually at the correct location and etc etc
Given a sorted array of unique positive integers \$A\$ \$(A_0<A_1<\cdots<A_{n-1})\$, and an integer \$t\$, where \$A_0\le t\le A_{n-1}\$. Output the value \$i\$ such that:
If \$t \in A\$, \$A_i=t\$.
If \$t \notin A\$, \$ \left(i-\left\lfloor i\right\rfloor\right)\cdot A_{\left\lceil i\right\rcei...
@cairdcoinheringaahing It got even better: the drill was supposed to happen 10 minutes ago (before it got rescheduled), and literally at 11:30, the rain stopped and its now sunny :P
@Anush I chose 25, 36, 49 as the squares (their sum must be even, and their values sufficiently close); then the sum of the numbers is half the sum of the squares; then obtain each number by subtracting one of the squares from that value.
Consider all arrays of \$\ell\$ non-negative integers in the range \$0,\dots,m\$. Consider all such arrays whose sum is exactly \$s\$. We can list those in lexicographic order and assign an integer to each one which is simply its rank in the list.
For example, take \$\ell=7, s=5, m=4\$, the l...
Oh no... I have my browser window snapped to the left half of my screen, so it's only half the width of the screen, and it only shows the first 4 characters of names in chat. That's rather unfortunate for @Anush
@RedwolfPrograms ok, the 80 char limit sounds cool because it'll end up with a bunch of different compression schemes for different subsets of the chars
We'll still be able to use "meta" for the same reasons we can still use "oracle". They're actual words, they have existing meaning outside of the name of a company, trademarks can't change that.
@Anush I'm actually pretty sure there's a town/city somewhere in Europe where Mc.Donalds (or possibly some other fast food chain) can't open a store because there was already an existing shop there with the same name.
Also local stores tend not to care about trademark and copyright laws
There was a local pizza place near where i used to live in england called "Costa Rica Pizza", but the word "Costa" was stylized in a certain way, and the word "Rica" was printed in very small font, blatantly intentionally misleading people into thinking that major coffee chain Costa had started selling pizza
Consider all arrays of \$\ell\$ non-negative integers in the range \$0,\dots,m\$. Consider all such arrays whose sum is exactly \$s\$. We can list those in lexicographic order and assign an integer to each one which is simply its rank in the list.
For example, take \$\ell=7, s=5, m=4\$, the l...
>:| Instead of doing his job my English teacher's watching a "scariest powerpuff villains" compilation, and I know because his volume is all the way up
And yet I'm still waiting on a grade for an assignment we did a month ago
ok I am totally stuck on how to do this efficiently - it's obviously pretty easy just using product but the complexity restriction makes this a really interesting challenge
although to be fair, once someone finds a method it's likely just going to be ported - still interesting though, and maybe I'll be proven wrong, maybe there are a lot of optimizations and approaches to be had (I haven't even found one, so I wouldn't know :P)
Consider all arrays of \$\ell\$ non-negative integers in the range \$0,\dots,m\$. Consider all such arrays whose sum is exactly \$s\$. We can list those in lexicographic order and assign an integer to each one which is simply its rank in the list.
For example, take \$\ell=7, s=5, m=4\$, the l...
