Re: On D in competitive programming

2018-07-31 Thread Ivan Kazmenko via Digitalmars-d-announce
On Tuesday, 31 July 2018 at 00:52:22 UTC, 9il wrote: Are competitors allowed to use mir-algorithm and mir-random? The libraries can be used for graphs (Tarjan algorithm), matrices/tensors, nd-iteration, RNGs, interpolation, and distributions? Sadly, no: most of the time, language compilers

Re: On D in competitive programming

2018-07-30 Thread 9il via Digitalmars-d-announce
On Saturday, 28 July 2018 at 19:51:08 UTC, Ivan Kazmenko wrote: Hey, I wrote a post with my general reflections on using D in competitive programming. Mostly compared to C++, since that's what more than 90% of people use for it. The post is tailored to cover only the competitive programming

Re: On D in competitive programming

2018-07-30 Thread Ivan Kazmenko via Digitalmars-d-announce
On Monday, 30 July 2018 at 19:44:32 UTC, Steven Schveighoffer wrote: a lifetime ago, I competed using topcoder (and wrote a bunch of problem sets for them too). Topcoder had a "challenge" phase, where you could challenge the solutions of others. Nice! I just found your profile and problem

Re: On D in competitive programming

2018-07-30 Thread Timon Gehr via Digitalmars-d-announce
On 30.07.2018 21:44, Steven Schveighoffer wrote: On 7/28/18 3:51 PM, Ivan Kazmenko wrote: Hey, I wrote a post with my general reflections on using D in competitive programming. Mostly compared to C++, since that's what more than 90% of people use for it. The post is tailored to cover only

Re: On D in competitive programming

2018-07-30 Thread Steven Schveighoffer via Digitalmars-d-announce
On 7/28/18 3:51 PM, Ivan Kazmenko wrote: Hey, I wrote a post with my general reflections on using D in competitive programming. Mostly compared to C++, since that's what more than 90% of people use for it. The post is tailored to cover only the competitive programming specifics.

Re: On D in competitive programming

2018-07-29 Thread Ivan Kazmenko via Digitalmars-d-announce
On Sunday, 29 July 2018 at 07:51:00 UTC, Jim Balter wrote: Actually, map!something does not drop empty parentheses, so mentioning that does not help. Parentheses containing 0 or 1 arguments can be omitted ... and you omit them for 1 argument in 3 places, and no instances of omitted empty

Re: On D in competitive programming

2018-07-29 Thread Cym13 via Digitalmars-d-announce
On Sunday, 29 July 2018 at 07:51:00 UTC, Jim Balter wrote: On Saturday, 28 July 2018 at 21:33:04 UTC, Ivan Kazmenko wrote: [snip] 2. When you briefly explain templates I think it's important to mention that empty parentheses may be omitted to allow the reader to make the link between

Re: On D in competitive programming

2018-07-29 Thread Jim Balter via Digitalmars-d-announce
On Saturday, 28 July 2018 at 21:33:04 UTC, Ivan Kazmenko wrote: [snip] 2. When you briefly explain templates I think it's important to mention that empty parentheses may be omitted to allow the reader to make the link between function!(arg1)(arg2) and map!something. Explaining UFCS isn't

Re: On D in competitive programming

2018-07-28 Thread Ivan Kazmenko via Digitalmars-d-announce
Thanks for the feedback! On Saturday, 28 July 2018 at 20:33:14 UTC, Cym13 wrote: 1. Your real name isn't written in the article so the link "with some successes" won't tell much to someone that doesn't already know you Hmm, didn't think of it. I phrased it differently now. In my

Re: On D in competitive programming

2018-07-28 Thread Cym13 via Digitalmars-d-announce
On Saturday, 28 July 2018 at 19:51:08 UTC, Ivan Kazmenko wrote: Hey, I wrote a post with my general reflections on using D in competitive programming. Mostly compared to C++, since that's what more than 90% of people use for it. The post is tailored to cover only the competitive programming