Dec 2004
9 / 9
Jan 2010
Jan 2010
Guest
Dec '04

Hi . I like very much the idea of this dasm league but I am a little bit disappointed of the problems. They are too hard for me frowning blush I suggest you insert in the next set one easier problem .. Thanks.

Excuse me if you dont like my suggestion,it is normal .. but I just cant measure with people like Tomek Czajka,Adrian Kuegel,Filip Wolski and many others - people a lot older than me ( this doesn`t matter much) but they have so much experience and I really know they are some of the best coders on this world , so I would appreciate an easier task which I would be able to solve.

  • created

    Dec '04

  • last reply

    Jan '10
  • 8

    replies

  • 1.7k

    views

  • 6

    users

  • 1

    link

Adrian_Kosowski
Dec '04

Hi,

I think that scoring > 0 points in BURNCITY should be fairly easy.

We will try to add at least one simple classical problem to all future problemsets smile. (As a matter of fact I believe problemset 3 is the only one so far without such a task).

Guest
Dec '04

Thank You ! smile I will try to solve them with pleasure smile ( the easy problems in next problemsets)

Uczmsiem
Dec '04

hmm can i still submit solutions for older problemsets? Will they be checked?
I`d like to do that in educational purposes... stuck_out_tongue

MaxSU_sof
Dec '04

Yes, most of those (LIGA contests) problems are in the main Sphere's archive.

9 days later
Guest
Dec '04

I wish I am not too insolent but which is the easy problem in this set ? blush

Adrian_Kosowski
Dec '04

Well, none of the problems are insanely difficult, either stuck_out_tongue. Remember you have over two weeks to solve them.

Speaking for myself, I would rate BTOUR as moderately easy, HOLIDAY1 as moderate, while BLOCKS and HOLIDAY2 as moderately difficult to code. But that is just my point of view. After all, in the league the number of correct submissions (and consequently the number of points awarded for solving a task) seems to be a fair measure of how tough a problem proved to be.

There are going to be 2 challenges in this problemset - SANTA and one more challenge to be added before December 20. In both cases it will be easy to get a high score with a seemingly short and simple algorithm.

Finally, I think I should stress one thing: I do not treat coding such things as Input/Output routines, data structures (e.g. stacks, trees, dynamic lists, etc.) and simple algorithms (sorting, merging) as part of the real problem. If you are not doing this already, I strongly recommend a) using a language with built in support for these things, b) using a ready library (e.g. C++ STL, Java and C# standard classes), or c) using your own library (write it once, and preserve it for all problems). Such an approach is adopted not only in this contest; it is a general rule when creating any program or IT solution nowadays.

Pascal_sof
Dec '04

Speaking about deadlines, I think you should keep in mind that many people might be away around Christmas, so it may be a good idea to release all the problems as soon as possible, or even push the deadline until the first days of January...

To put it another way: don't expect me to code after December 22th wink

5 years later
kokosek_sof1
Jan '10

A jak obliczyć n-tą permutację?
Bo po kolei obliczać te wszystkie permutacje, których może być 100!, jest "trochę" czasochłonne.
Tak więc mógłby ktoś napisać algorytm do obliczania n-tej permutacji?
Znalazłem już coś takiego:
tiny.pl/hmwcp1

Fajny algorytm, ale nie sprawdzi się dla liczby n>20 (czy coś koło tego), bo potem nie zmieści się w unsigned long long incie (100! na pewno się nie zmieści).
Z kolei fajnie byłoby się czegoś takiego nauczyć, bo może być to przydatne na studiach, więc podwójnie proszę. wink