You can see the ratings of problems on Atcoder on https://kenkoooo.com/atcoder/#/table/

But what exactly is the connection between rating of problems on Atcoder and on CF.

I'm recently solving problems with dif between 2400 and 2600 on CF. What does it match on Atcoder?

Round #618 is going to be held soon. I suggest making the round's name interesting, i.e. Codeforces Round Phi. Number 618, is the first three digits after the decimal point of number phi=(sqrt(5)-1)/2, which is also known as the 'golden section'. And it will be very memorable. See Codeforces Round #Pi (Div. 2) and Codeforces Round #FF (Div. 1) and Codeforces Round #FF (Div. 2) as an example.

Author, could you please change the beginning time of Codeforces Round #584 into $$$17:05$$$ MSK instead of $$$16:05$$$ MSK? Otherwise there will be no Atcoder contests next week (there will be conflict with Codeforces contests if the Atcoder contests falls on either Saturday or Sunday).

I am learning segment tree recently. But when I search the "data structures" tag I found some problems which obviously can't be solved by a segment tree. So can anyone please suggest some segment tree problems that are suitable for me (with difficulty 1600-1800)?

By the way, I suggest using tags of "segment tree" "deque" "BIT" "stack" instead of "data structures". It makes searching problems easier.(Sorry for my poor English :D)