A very short solution (<20 lines) to ICPC WF Problem N, in Julia

Правка en1, от ekzhang, 2021-10-06 15:37:43

Hi everyone, my team participated in ICPC World Finals yesterday and had a lot of fun. However, we noticed that Problem N did not have many solves (only 1 in-contest and none on Kattis), even though our team thought the problem was very fun and doable. Probably, the reason was because numerical algorithms are harder to write in competitive programming languages like C++ and Java.

To help explain the solution better, I made a very concise, annotated Julia notebook that solves the problem in only 16 lines of code. Hopefully you find it conceptually interesting and helpful.

Here is the link to the notebook as a PDF. Alternatively, if you have Julia and Pluto.jl installed, you can run the notebook directly from the source .jl file at this GitHub Gist.

Теги linear algebra, julia

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский ekzhang 2021-10-07 21:44:07 45
en4 Английский ekzhang 2021-10-07 15:35:35 51 Make b calculation slightly more ergonomic
en3 Английский ekzhang 2021-10-07 15:31:09 6
en2 Английский ekzhang 2021-10-07 15:30:01 1103 Tiny change: 'ram">\n```\nusing Li' -> 'ram">\n```julia\nusing Li'
en1 Английский ekzhang 2021-10-06 15:37:43 1033 Initial revision (published)