The difference is enough as between LG Benq and LG tourist :)

LG tourist is 433+ points ahead of any other CODEFORCES programmer, that's so huge!

TOP 5 for today:
tourist -- 3946
Benq -- 3513.
maroonrk -- 3511
jiangly -- 3509
Rewinding -- 3475

Newbies have upto 1200 pts, while experts have at least 1600.

Lets discuss problems.

How to solve C. Jellyfish, F. A Very Different Word?

Hi.

I wanted to ask one question. Coming to your destination page on Codeforces platform you: 1. press sequence of hyperlinks, or 2. use direct URL?

E.g. Say we are on https://codeforces.net/, and wanna get to https://codeforces.net/problemset/customtest . Then there are two ways: 1. press 'problemset', wait when it loads, and then press 'customtest', 2. write into browser's adressbar some substring, e.g. 'cust', and choose direct URL from suggested by autocomplete.

Say your interest page is by distance N from current page. How your behaviour depends on N?

For myself I usually prefer autocomplete URL over sequence if N is $$$\ge 2$$$.

Lets discuss problems.

How to solve A Alice and path, F Fizz and Bazz, J Cubic path?

Good morning. Does anyone knows if the 2nd division of GP of Europe will be held today? It's 40 minutes after the contest should have started.
11.11.2018 12:00 Grand Prix of Europe

Upd. div. 2 system appeared and is planning to start at 13:00

I suggest an idea of table with shortened info about contest, where it is written:

[date][starting time][duration][divisions and if they are combined][is it rated][number of problems][scoring system]

Because otherwise some need to ctrl+f and read sentences to understand what does "Div.1 + Div.2" mean, and trying to find what duration of contest is.

Problem B was very interesting, but haven't overcome tc #7.

Hello,
I had a problem: make sequence of random permutations which elements do not occur in same positions. E.g. I have list ('a', 'b', 'c', 'd'). I randomly generate permutation, say 'a d b c', then next permutation, say 'd c a b, then next permutation can not start with 'a' and 'd', because these elements occurs in first or second sequence on same position.
My algorithm is slow: I repeat to generate random (with Fisher-Yates shuffle) permutation and check each element if it not occur in previous sequences (I used 2D array). How to determine what is the complexity of my algorithm?
How to solve problem faster?

Again, participating in contest and having "Service is not available". This time — an hour after contest started.

Hi, folks. Some days ago something happened: since then I can't see submissions, see anybody's rating graphs, can't write comments, vote, can't write private messages. Isn't that only for me? I can't write pm to admin :/ , and didn't find any other contact [upd: I wrote to email, have thought about it later]. Sorry, if there are more folks with that problem and simply you can't respond.

Hi, I'm interested in downloading all my submissions. Today I wanted to find: how often I used some functions or keywords in my all accepted submissions, what is the time when I used some first, and other information. It would be easier to do, if I have all submissions in my PC, because then I could easily 'grep' such info. And if someone downloads his submissions, he could store them in his own database, and add his own marks.

• When someone successfully hack another participant, his/her test join set of final tests.

Sometimes it can be useful and fair, because sometimes set of final tests is not covering some cases where at least one participant made a mistake.

For example: At #260 Div.2 A there were incorrect submission — 7385198, which passed all system tests, but it could not pass elementary test

3
1 2
2 3
3 1

so if someone successfully hacks using this test, this test should go to set of final tests.

Of course then the number of final tests can grow up to number of all participants, and this would slow down testing.