Liste des Groupes | Revenir à cl c |
On Tue, 18 Mar 2025 21:38:55 -0400The early problems are easy. I plan on doing (or giving a good shot at) all 300.
DFS <nospam@dfs.com> wrote:
I'm doing these algorithm problems atIt is not an interesting programming exercise.
https://cses.fi/problemset/list/
>
For instance: Weird Algorithm
https://cses.fi/problemset/task/1068
>
But it looks to me as aIf you do find a proof, you'll get a blue ribbon and a free dinner (and your own Wikipedia entry).
challenging math exercise. I mean, how could we give a not too
pessimistic estimate for upper bound of length of the sequence that
starts at given n without running a full sequence? Or estimate for
maximal value in the sequence?
So far, I found no answers.
Les messages affichés proviennent d'usenet.