ODT's blog

Codeforces Round #449
By ODT, history, 7 years ago, In English

Hello, Codeforces!

We are glad to invite you to participate in Codeforces Round #449 (both Div. 1 and Div. 2) which will be held on December 2, 17:05 MSK.

There are seven problems, created by webmaster, ODT, dogther.

This round is about the happiest girl in the world — Chtholly Nota Seniorious~!

You will help Chtholly, Nephren, Ithea and Willem (characters in the great novel and anime "What Do You Do at the End of the World? Are You Busy? Will You Save Us?") to solve some problems.

(Image by gin_sei56(・.8・) on pixiv)

This round is our first round on Codeforces.

Thanks to zcyskyaa for helping us, Arpa, cyand1317 and Tommyr7 for testing the round, vintage_Vlad_Makeev and KAN for round coordination and MikeMirzayanov for Codeforces and Polygon platforms.

This round has 5 problems in each division and you have 2 hours to solve them.

The scoring will be announced shortly before the start of the contest.

The contest is rated for both Div. 1 and Div. 2 contestants.

It's recommended for both divisions to read through the Interactive Problems Guide before the round.

Wish everyone high rating and accepted submissions!

Upd: Scoring is 500-1000-1500-2000-2500

Upd2: Congratulations to the winners:

Div 1:

  1. MrDindows

  2. bmerry

  3. krismaz

  4. Shik

  5. ainta

Div 2:

  1. blatuitorulmlc

  2. lumibons

  3. Starlit

  4. Grevozin

  5. lyoz

The editorial will be posted soon.

Upd3: Editorial

  • Vote: I like it
  • +172
  • Vote: I do not like it

Comments Comments (510)
| Write comment?
»
7 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Auto comment: topic has been updated by ODT (previous revision, new revision, compare).

→ Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 3   Vote: I like it -12 Vote: I do not like it

    I would solve 2E if there was a little more time

    The experience is so bad :(

    Problems are really good

    Hope there is no long queue next time

    → Reply
»
7 years ago, # |
  Vote: I like it +46 Vote: I do not like it

Looks like an interesting round!

→ Reply
»
7 years ago, # |
  Vote: I like it +60 Vote: I do not like it

Sounds like a poisonous round.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it -14 Vote: I do not like it

    I think Round#447 is more poisonous! QAQ

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it +6 Vote: I do not like it

      Really? Round #447 is interesting and fun,isn't it?

      → Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 4   Vote: I like it +88 Vote: I do not like it

    被删除的Tommyr7 20:45:30

    没有啊。。。div1E真的是字符串分治然后母函数然后FFT一下就做完了

    被删除的Tommyr7 20:45:39

    只是lxl表示你们知道也不会做，所以提前透露了

    Translate:

    Tommyr7

    Not at all...Solution for Div1E is just string divide and conquer then generating function and FFT

    Tommyr7

    lxl leaked it before the contest and said you can't solve it even if you know the problem

    UPD:This poisonous round must be unrated!

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it +63 Vote: I do not like it

      Maybe only students from NS can solve this problem!

      → Reply
    • »
      »
      »
      7 years ago, # ^ |
      ← Rev. 2   Vote: I like it +116 Vote: I do not like it

      As a tester, just joking.

      In fact, I think the problems are okay as a codeforces round.

      But in China, lxl (ODT 's Chinese name) is considered as a problem setter of the most difficult and troublesome problems.

      And many contestants are afraid of lxl, and always think that his problems are bad. I just want to say that, the contest is quite good, and lxl and the others authors work very hard to make a good contest!

      Wish you have fun in the contest!

      See you all!

      → Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +31 Vote: I do not like it

Why it isn't in the main page? UPD: It's now :D

→ Reply
»
7 years ago, # |
  Vote: I like it +24 Vote: I do not like it

Chtholly is good!

→ Reply
»
7 years ago, # |
  Vote: I like it +33 Vote: I do not like it

The happiest girl in the world!

→ Reply
»
7 years ago, # |
  Vote: I like it +55 Vote: I do not like it

Wish everyone enjoys the round and few bugs! And hope all the programs will be fast in practice :D

→ Reply
»
7 years ago, # |
  Vote: I like it +30 Vote: I do not like it

Chtholly is invading Codeforces... And, I really don't want a math contest! PLS!

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +41 Vote: I do not like it

    It surely won't be a math contest. It might be a Data Structure contest, I suppose.

    → Reply
»
7 years ago, # |
  Vote: I like it +47 Vote: I do not like it

No tricks please

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by ODT (previous revision, new revision, compare).

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by ODT (previous revision, new revision, compare).

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

ke jiao xing guo(

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +54 Vote: I do not like it

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    The girl on the picture is not Chtholly :(

    → Reply
»
7 years ago, # |
  Vote: I like it +54 Vote: I do not like it

Interactive Guide — Div 2 I am comming back :D

→ Reply
»
7 years ago, # |
  Vote: I like it +30 Vote: I do not like it

Hope not to meet five data structure problems...

→ Reply
»
7 years ago, # |
  Vote: I like it +76 Vote: I do not like it

Data Structures Round? Very interesting! But I hope there will be less data structures problem. :)

→ Reply
»
7 years ago, # |
  Vote: I like it -35 Vote: I do not like it

I can't read the annoucement again...

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Check your internet connection! XD

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I mean,I have no bravery to read it again:(

      → Reply
»
7 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Is Chtholly rated?

→ Reply
»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Dear ODT, why not to darw chtholly with me? It will be fun, my dear friend!

→ Reply
»
7 years ago, # |
← Rev. 5   Vote: I like it -107 Vote: I do not like it

Some interesting IDs belonging to ODT upvote this annoucement...

But I prefer to practice FalunDafa rather than take part in this round!

В конце концов, Чжэнь Шань Жэнь это единственный критерий для оценки хорошего или плохого человека.

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Chtholly is good! hope the contest will be the same as usual. also hope everyone high rating!

→ Reply
»
7 years ago, # |
  Vote: I like it -9 Vote: I do not like it

Could you resize the image to be a bit smaller? It looks really weird on the front page.

→ Reply
»
7 years ago, # |
← Rev. 4   Vote: I like it +62 Vote: I do not like it

DULIU mcfx HENTAI lxl

I will never participate in a DS round! (emmm... and I advise ODT to prepare for National Higher Education Entrance Examination in a hurry (wu
→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +32 Vote: I do not like it

    lxl :I can pass the exam easily and taking lessons does nothing to me!So I will make more DULIU problems to make money!(:

    → Reply
»
7 years ago, # |
← Rev. 8   Vote: I like it +3 Vote: I do not like it

Chtholly Nota Seniorious!

orz krydom ,upstairs ↑.

Chtholly Nota Seniorious

こんなにも、たくさんの幸せをあの人に分けてもらった
だから、きっと
今の、私は
谁が何と言おうと
世界一、幸せな女の子だ

I think this contest will be very interesting!

But "Is Chtholly rated?"

→ Reply
»
7 years ago, # |
  Vote: I like it -20 Vote: I do not like it

another weeaboo garbage jesus fuckign christ what happened to this website

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it -42 Vote: I do not like it

    No, we practice Falun Dafa, we are real and kind and forbearing.

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      The police is coming for you.

      → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it -21 Vote: I do not like it

        Let them come. A real Falun Dafa studier is not afraid of commies.

        → Reply
        • »
          »
          »
          »
          »
          7 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          I guess you'd better shut your f**k**g Falun mouth before you attract more police to our computer room.

          → Reply
          • »
            »
            »
            »
            »
            »
            7 years ago, # ^ |
              Vote: I like it -8 Vote: I do not like it

            You d***less person get away

            → Reply
            • »
              »
              »
              »
              »
              »
              »
              7 years ago, # ^ |
                Vote: I like it 0 Vote: I do not like it

              Don't be so rude, my friend :)

              → Reply
              • »
                »
                »
                »
                »
                »
                »
                »
                7 years ago, # ^ |
                  Vote: I like it -10 Vote: I do not like it

                Yes, at least we are all anti-commies.

                → Reply
»
7 years ago, # |
← Rev. 9   Vote: I like it +26 Vote: I do not like it

zcy!!! is he the man who has hung and beaten the trained team ? %%%%

I like this round of contest

→ Reply
»
7 years ago, # |
← Rev. 3   Vote: I like it +3 Vote: I do not like it

I think too many big images and words in animes appearing in the contest will make me feel #%#$@^(&#! when I solve problems.

I hate people who put big image of Chtholly everywhere!

死宅真恶心

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +18 Vote: I do not like it

    Not so big. KAN will sure that the image in a small size :(

    → Reply
»
7 years ago, # |
← Rev. 3   Vote: I like it +15 Vote: I do not like it

ODT YOU NOT YELLOW MATE

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    Does that mean he can't be a good problem setter?

    By the way, ODT is very excellent!

    → Reply
»
7 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Love this Anime and LN so much :> Hope everyone high rating and have fun coding :>

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it -6 Vote: I do not like it

Looking forward to such a 'colourful' contest!
Well, except troublesome Data Structures.

Uh, I'm wondering if there will be big pictures in desciptions of problems.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    This picture is really nice. I wonder where do you find it.

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      this picture is famous, dont't you know? Use baidu before asking! ( www.chtholly.ac.cn is also a nice choice!) :)

      → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it +5 Vote: I do not like it

        well, I didn't find the picture above on baidu indeed.

        → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    cyand1317 confirmed there won't. Thanks cyand.

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      So after consideration and discussion, we've reached this decision.

      There won't be large, distracting images. Some problems contain smaller images that may act as a delimiter, though — start reading the statements after the image if you'd like to.

      → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I agree it's the best decision about images in problems. I'd like some lovely images and decriptions or scripts about animes, though. Therefore, I can decide if I'm interested in that anime and whether to see it later. However, many feel sick about images of cartoons. I suppose this is the best balance, making ODT able to share and express, while not disgusting others. Anyway, lxl just can't help putting his beloved into problems.

        → Reply
        • »
          »
          »
          »
          »
          7 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Wanna know if you'd like that anime? Go to MAL, not cf.

          I like some anime, but I don't want it mixed into problems.

          It's like saying, "wow I like soda, gonna make some soda-flavored pasta :D"

          → Reply
»
7 years ago, # |
  Vote: I like it -41 Vote: I do not like it

Again these shitty anime pictures covering the whole screen...

→ Reply
»
7 years ago, # |
← Rev. 4   Vote: I like it +8 Vote: I do not like it

Yet another anime round,but with DULIU problem setters...

But cheerful with Chtholly :)

→ Reply
»
7 years ago, # |
  Vote: I like it -46 Vote: I do not like it

I think its not good to use Interactive Problem because many Div. 2 contestants. don`t know it for me i didn't see it before

→ Reply
»
7 years ago, # |
  Vote: I like it -15 Vote: I do not like it

I love these anime rounds :D

→ Reply
»
7 years ago, # |
  Vote: I like it -23 Vote: I do not like it

I also like animes

→ Reply
»
7 years ago, # |
  Vote: I like it -11 Vote: I do not like it

Wow anime round ! what could be better!

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Wish round will be without system errors! And of course, wish problems will interesting and enjoyable ...)

Wish everybody high rating and good mood for night after contest!
→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

lxl(aka. nzhtl1477, ODT) is really a toxic tumor!

→ Reply
»
7 years ago, # |
  Vote: I like it +71 Vote: I do not like it

Oh look, another anime that every weeb have watched it except me. Somehow people really like to recommend this anime but I am so triggered by it's title so I skipped it because of it's title is literally longer than my cumbersome comment.

PS: Weebs are taking over ICPC in EC in case if you don't know

(full login password: I love Megumi, Google Megumi Kato)

→ Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 3   Vote: I like it +6 Vote: I do not like it

    Pffft, Megumi from konosuba is wayyyy cuter. EDIT: Oops, this is Megumin not Megumi. Sorry.

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it +28 Vote: I do not like it

      Except this is Megumin.

      → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it +13 Vote: I do not like it

        'n' is often added to Japanese names to make them cuter.

        Which means megumin is cuter than megumi >:D

        → Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Hope everyone will have fun with Chtholly in this round~ P.S. I love Nephren forever!

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    When there will be a "Nephren Round"?

    → Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +33 Vote: I do not like it

I like this contest! Maybe I'll participate in it.

→ Reply
»
7 years ago, # |
  Vote: I like it +25 Vote: I do not like it

The amount of discussion on this thread is growing faster than exponential running time! :O

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Yeee, anime round, we all were missing it.

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

An anime round?

Or a lxl data structure round?

→ Reply
»
7 years ago, # |
  Vote: I like it -8 Vote: I do not like it

glhf

→ Reply
»
7 years ago, # |
  Vote: I like it -6 Vote: I do not like it

On one hand, data structure problems are nice, but on the other hand, we have interactive...

→ Reply
»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Hope the network is good tomorrow. The server was down for several times this week.

→ Reply
»
7 years ago, # |
  Vote: I like it +40 Vote: I do not like it

How to solve D? I used binary search + FFT but it was TLE.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +43 Vote: I do not like it

    You need to use online dynamic persistent red-black tree with square root decomposition + some dp optimizaton + FFT

    → Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 2   Vote: I like it +32 Vote: I do not like it

    Thanks a lot. I finally figured out the TLE test case of my solution: 

    5 1 -4
1 3
4 5
3 1
2 2
4 7
    → Reply
»
7 years ago, # |
  Vote: I like it +9 Vote: I do not like it

But seriously, why most of light novel need to have a ridiculously long title? This, Moshidora and Oreimo each seems like they have about 50++ characters in their title >_<

→ Reply
»
7 years ago, # |
  Vote: I like it -9 Vote: I do not like it

V I R A J

M A D D U R

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

It seems to be an unsolvable round?

Five difficult data structure problems!

→ Reply
»
7 years ago, # |
  Vote: I like it -13 Vote: I do not like it

这这这……what is this? 好像混进了什么东西。

→ Reply
»
7 years ago, # |
  Vote: I like it +34 Vote: I do not like it

How to solve Div1 A? I code for 10KB but got WA.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +23 Vote: I do not like it

    You only code for 10KB? How could you do that?

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +17 Vote: I do not like it

    What? How can you solve it within a 10Kb-code? I have code 30Kb but I haven't finished it yet! :(

    → Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 3   Vote: I like it +12 Vote: I do not like it

    What makes you sure that you can solve it within a 10kb code,bro?

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it +16 Vote: I do not like it

      Beacuse I think it's Div1 A, so I think the code won't be too long.

      → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it +8 Vote: I do not like it

        Have you forgotten who are the editors of this round? XD

        → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it +12 Vote: I do not like it

        Wake up mate, it's ODT's problem, the code can't be short.

        → Reply
        • »
          »
          »
          »
          »
          7 years ago, # ^ |
            Vote: I like it +9 Vote: I do not like it

          Oh.. I forgot the editors of this round! thx bro, I will recode soon! :)

          → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    But I wrote a 5KB code and got accepted :)

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      You are so strong :) I have just complete it in 35Kb. (QAQ)

      → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
        ← Rev. 2   Vote: I like it +8 Vote: I do not like it

        In fact, I missed a 0. So it is 50KB :)

        → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it +2 Vote: I do not like it

        I lose hope on recoding :( It's too long..

        → Reply
        • »
          »
          »
          »
          »
          7 years ago, # ^ |
            Vote: I like it +1 Vote: I do not like it

          Why not try to get the answers with a Brute force and just print the answers for each tasks? Certainly you need to beg others in your room not to hack you XD

          → Reply
          • »
            »
            »
            »
            »
            »
            7 years ago, # ^ |
              Vote: I like it +1 Vote: I do not like it

            An FST will be ready for you :) You know, those problem setters are hackers :)

            → Reply
            • »
              »
              »
              »
              »
              »
              »
              7 years ago, # ^ |
                Vote: I like it 0 Vote: I do not like it

              Oh no I hope that setters are lazy and just made weak data,though I'm sure that is impossible. :(

              → Reply
          • »
            »
            »
            »
            »
            »
            7 years ago, # ^ |
            ← Rev. 2   Vote: I like it 0 Vote: I do not like it

            You can submit it at the last second so that no one can hack you.

            → Reply
            • »
              »
              »
              »
              »
              »
              »
              7 years ago, # ^ |
                Vote: I like it 0 Vote: I do not like it

              Oops, Problem setters can :)

              → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    I got accepted and the time complexity is only O(logn) !

    → Reply
»
7 years ago, # |
  Vote: I like it +14 Vote: I do not like it

How to solve Div.1 F? It's a challenging problem with a 30s time limit. :(

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +20 Vote: I do not like it

    Wake up bro, the article has said : This round has 5 problems in each division and you have 2 hours to solve them. No problem F in Div1 :)

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it +16 Vote: I do not like it

      I know that :) So why is there an F? emmmmmmmmm maybe a DULIU problem setter?

      → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Maybe an extra problem. So you can imagine how difficult it is...

        → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it +10 Vote: I do not like it

        What means 'DULIU'?

        → Reply
        • »
          »
          »
          »
          »
          7 years ago, # ^ |
          ← Rev. 4   Vote: I like it +29 Vote: I do not like it

          There are many kinds of DULIU problems,such as:

          1. The author's solution runs 0.9s,and the time limit is 1s.

          2. The author uses 5 hours to write the solution and the length of the contest is 3 hours.

          3. The author uses some strange algorithms to solve the problem.

          → Reply
        • »
          »
          »
          »
          »
          7 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          DULIU (毒瘤) means tumor in Chinese

          → Reply
        • »
          »
          »
          »
          »
          7 years ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          It refers to those problem setters who set up exceedingly difficult and troublesome problems, thus making most problem solvers revolted so that they can't help complaining that the problems and their setter are really DULIU.

          → Reply
    • »
      »
      »
      7 years ago, # ^ |
      ← Rev. 2   Vote: I like it +11 Vote: I do not like it

      If you can solve all the problems and the total length of the codes is less than 50kb,you can see the Div.1 F.

      → Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to sovle Div1C with block dividing algorithm? I got TLE over and over again.

→ Reply
»
7 years ago, # |
  Vote: I like it +12 Vote: I do not like it

Observe in the dark

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

Deleted

→ Reply
»
7 years ago, # |
  Vote: I like it +39 Vote: I do not like it

Let's wish Good Luck codeforces servers)

→ Reply
»
7 years ago, # |
  Vote: I like it +27 Vote: I do not like it

CONTEST: Omae wa mou shindeiru!
ME: NANI?

→ Reply
»
7 years ago, # |
  Vote: I like it +1 Vote: I do not like it

What's up with this weird discussion going on? Is ODT bad problem setter? Can you guys link me to some of his contests? This is really interesting.

→ Reply
»
7 years ago, # |
  Vote: I like it -9 Vote: I do not like it

if u r a true anime fan u should watch boku no pico great anime with intresting plot

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    yoooooooooooooooooo I'd NEVER watch that! It's revolting. I'd like lovely Chtholly better.

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I can confirm this is true, I've watched that many time before. 10/10 would watch again though.

    P.s: Pico best girl.

    → Reply
»
7 years ago, # |
  Vote: I like it +34 Vote: I do not like it

Every 3rd round on codeforces since I have joined is unrated due to some tech issues. I am scared today :p

→ Reply
»
7 years ago, # |
  Vote: I like it +47 Vote: I do not like it

Long queue for anyone else?

→ Reply
»
7 years ago, # |
  Vote: I like it +2 Vote: I do not like it

welp, guess i'm doing something else of my afternoon than a codeforces round...

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Lol this will probably be unrated

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +2 Vote: I do not like it

6-minute-queuing (until the moment I write this comment). Last time I started to complain about queuing issue, it subsided a few minutes later. Hope it will work this time as well :<

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +7 Vote: I do not like it

    I've submitted a code with 22 minutes. No response yet. So, I it's a 16min+ queue time.

    → Reply
»
7 years ago, # |
  Vote: I like it +3 Vote: I do not like it

30+ pages of queue? How is anyone supposed to time manage like this :/

→ Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 2   Vote: I like it +27 Vote: I do not like it

    My submissions can't even pass "pretest 1", because they TLE on "in queue"

    → Reply
»
7 years ago, # |
  Vote: I like it +13 Vote: I do not like it

37 pages queue...

→ Reply
»
7 years ago, # |
  Vote: I like it +2 Vote: I do not like it

No server problems so far but the queue is just as bad!

→ Reply
»
7 years ago, # |
  Vote: I like it +2 Vote: I do not like it

In queue = unrated pls

→ Reply
»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Long queue. Submitted B 20 minutes ago and still no verdict

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Submitted B 20 minutes ago and only now I get a response that I missed it. This is pretty unfair and I request it becomes unrated.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    time to wait another 20 minutes to see if I got it

    → Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +18 Vote: I do not like it

→ Reply
»
7 years ago, # |
  Vote: I like it +56 Vote: I do not like it

→ Reply
»
7 years ago, # |
  Vote: I like it +14 Vote: I do not like it

The math says system testing will finish before pretest :-P

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +8 Vote: I do not like it

Seems fair that chtholly might win the contest

→ Reply
»
7 years ago, # |
  Vote: I like it +15 Vote: I do not like it

nearly 40 pages queue, should I continue the contest or not? :P

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I'll go watch WorldEnd while waiting for the queue .__.

→ Reply
»
7 years ago, # |
  Vote: I like it +11 Vote: I do not like it

The nice problemset was simply ruined because of the queue :/

→ Reply
»
7 years ago, # |
  Vote: I like it +14 Vote: I do not like it

Unrated

→ Reply
»
7 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Unrated again ?

→ Reply
»
7 years ago, # |
  Vote: I like it +11 Vote: I do not like it

Maybe unrated Sad :(

→ Reply
»
7 years ago, # |
  Vote: I like it +59 Vote: I do not like it

What are you doing at the beginning of codeforces round449？ Are the judger busy？Will it judge our submissions of this contest？

→ Reply
»
7 years ago, # |
  Vote: I like it +24 Vote: I do not like it

After 40 minutes I got my verdict Wrong Answer ! And after re-submitting when I will get my verdict ? After the contest ends?

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I submitted 1st question in 9 min and got a score of 488 and after 2 min it was reduced to 428. Can anyone explain why? All the pretests passed and the total score was still 470 and yet they gave me 428?

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Your solution got submitted twice. Even if pretests on the first submission pass, it is counted as 1 penalty.

    → Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

I won't save a poisonous problem setter even if I'm not busy at all ：（

→ Reply
»
7 years ago, # |
  Vote: I like it +53 Vote: I do not like it

Dear codeforces, please hire some good engineers . those who can manage your servers

→ Reply
»
7 years ago, # |
  Vote: I like it +141 Vote: I do not like it

Did you know that 55 is not only the fifth palindrome number with 2 digits, but it is also THE NUMBER OF PAGES IN THE QUEUE?

→ Reply
»
7 years ago, # |
  Vote: I like it +68 Vote: I do not like it

→ Reply
»
7 years ago, # |
  Vote: I like it +42 Vote: I do not like it

I just waited 30 minutes to find wrong answer verdict

→ Reply
»
7 years ago, # |
  Vote: I like it +109 Vote: I do not like it

→ Reply
»
7 years ago, # |
  Vote: I like it +43 Vote: I do not like it

→ Reply
»
7 years ago, # |
← Rev. 4   Vote: I like it +17 Vote: I do not like it

Oh this is just great. (35 minutes waiting for that verdict) And also this one. "Working on"? — I guess it should be an unrated announcement instead...

UPD: Seemed like many people's opinions are going to the void.

→ Reply
»
7 years ago, # |
  Vote: I like it +114 Vote: I do not like it

Waiting for round getting declared unrated and Mike's apology blog

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Was testing system replaced by a group of Chinese? :)

Btw, problems are very good.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    problems was good ? oh man are you kidding ? problem C / Div2 , A / Div 1 was good and beautiful ?

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Not beautiful, but good. B and C are better than A(div1).

      It's just my opinion.

      → Reply
»
7 years ago, # |
← Rev. 4   Vote: I like it +82 Vote: I do not like it

I got a friendly advice to make a standalone blog instead, but couldn't delete the original message, because it was too old.

→ Reply
»
7 years ago, # |
  Vote: I like it +35 Vote: I do not like it

I think we will need BigInteger queue, because long queue will overflow :'D

→ Reply
»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

It seems to be unrated :(...So sad to hear about it...

→ Reply
»
7 years ago, # |
  Vote: I like it +107 Vote: I do not like it

→ Reply
»
7 years ago, # |
  Vote: I like it +19 Vote: I do not like it

The announcement should be "This contest is unrated!"

→ Reply
»
7 years ago, # |
  Vote: I like it +6 Vote: I do not like it

I have lost hope to solve the problem. Because of [unsigned long long] queue and the HARD problem(Div.1) :(

But, it seems to be unrated?

→ Reply
»
7 years ago, # |
  Vote: I like it +16 Vote: I do not like it

And here's another unrated contest -_-

→ Reply
»
7 years ago, # |
  Vote: I like it +13 Vote: I do not like it

The girl in the post is shedding tears because of the loooooooong queue...

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Steelix used unrated attack It was super effective! Togekiss fainted!

    → Reply
»
7 years ago, # |
  Vote: I like it +12 Vote: I do not like it

i think that the end of the queue is at the end of the world...

→ Reply
»
7 years ago, # |
← Rev. 3   Vote: I like it +11 Vote: I do not like it

Unrated please; the server problems this contest are much, much worse than last contest, and the last contest was unrated, so this one should be too.

→ Reply
»
7 years ago, # |
  Vote: I like it +7 Vote: I do not like it

It's not the first time such long queues on Codeforces, it's time to buy normal servers. And yes, the round should have been unrated

→ Reply
»
7 years ago, # |
  Vote: I like it +70 Vote: I do not like it

Dear Mike Mirzayanov,

I think it's time to announce this round unrated because of failing to fix the issue with the judging machine. It's 11-12 pm in some time zone and it's time to sleep if the contest is declared unrated. Thank you for understanding us.

Best wishes.

→ Reply
»
7 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Please unrate it.Getting W/A after waiting for 35 mins straight is just so frustrating.

→ Reply
»
7 years ago, # |
  Vote: I like it +31 Vote: I do not like it

What are you doing at the end of the queue? Are you busy? Will you test us?

→ Reply
»
7 years ago, # |
  Vote: I like it +12 Vote: I do not like it

This is my second codeforces round! And I will be unrated until 2018 =)

→ Reply
»
7 years ago, # |
  Vote: I like it +24 Vote: I do not like it

→ Reply
»
7 years ago, # |
  Vote: I like it +1 Vote: I do not like it

And you knew that the length of the last line in task C, is equal to the NUMBER OF ASSIGMENTS IN THE QUEUE!!!!!

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

That wonderful feeling when you submitted your solution about 50 minutes ago and now it gets RE 7. Love Codeforces servers!)

→ Reply
»
7 years ago, # |
  Vote: I like it +30 Vote: I do not like it

Round extended by 15 minutes? Do you think this will make the round any better?

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    Maybe he just want to get 15 more minutes to consider whether making this round unrated due to technical problems. :D

    → Reply
»
7 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Increase the time by merely 15 min and decrease the score like a landslide? I don't think 15 min is enough though ! This has to be unrated !!!

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

And after all this they extend the contest by 15 minutes!!! Do they still expect to make it rated??? I don't know whether to laugh or cry!!! That's damn funny!

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

In Educational Codeforces Round 33 (Rated for Div. 2) , I waited for the long queue but that round was still rated.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    The queue in that contest was at most 10 minutes (I think), which I feel is STILL fine, compared to today (It's not ideal, but it's manageable). Today, people had to wait for 30-40 minutes to receive a verdict.

    → Reply
»
7 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Lagforces round #449

→ Reply
»
7 years ago, # |
  Vote: I like it +59 Vote: I do not like it

I will leave CF if this round is rated.

→ Reply
»
7 years ago, # |
  Vote: I like it +69 Vote: I do not like it

→ Reply
»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

What are we going to do in 15 minutes if verdict is given after 40 minutes? -_-

→ Reply
»
7 years ago, # |
  Vote: I like it +33 Vote: I do not like it

When you are Codeforces, and have a 40+ page queue

→ Reply
»
7 years ago, # |
  Vote: I like it +250 Vote: I do not like it

:')

→ Reply
»
7 years ago, # |
  Vote: I like it +10 Vote: I do not like it

It won't be a surprise if the comments on this thread are also queued LOL!

→ Reply
»
7 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Waited for 25 minutes & got WA

→ Reply
»
7 years ago, # |
  Vote: I like it +28 Vote: I do not like it

we could use this waiting time for Hacking. _/_ Codeforces.

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

too hard problems for me

→ Reply
»
7 years ago, # |
  Vote: I like it +18 Vote: I do not like it

What do you do at the end of the World? Are you busy? Will you save Codeforces?

→ Reply
»
7 years ago, # |
  Vote: I like it +10 Vote: I do not like it

damn that problem C, I know I did something wrong,but the problem feels really frustrating, like hardcoding,my eyes hurt after reading that statement "will you save us...." also was waiting long long time before verditc came "wrong answer on pretest 5" like , FUCK NO,not attempting that again after 30 minutes :(

→ Reply
»
7 years ago, # |
  Vote: I like it +95 Vote: I do not like it

→ Reply
»
7 years ago, # |
  Vote: I like it -10 Vote: I do not like it

The problems are very good . thanks to the writers . but long queue :(

→ Reply
»
7 years ago, # |
  Vote: I like it +114 Vote: I do not like it

Dear "whoever decided to extend contest by 15 minutes",

Do you really think that additional 15 minutes would make this competition fair? Or it is just some desperate attempt to make this contest rated?

If it's the first case: - no competition would be far from fair, I've been waiting about half an hour to see that my program does not work. Then I tried to fix something... guess what — I've been waiting another half an hour to see that a bug I found was not the only one. The point is — I should know what I know now max 10 minutes after my first submission (and it was 60, where are my 50 minutes?). My first concern is about amount of additional time. Why 15 minutes seems to be enough to make this contest fair? I don't feel like this is enough. The second thing is what ranking should be — is a person who get accept after X minutes at first try better or worse than person which would get accept after several trials in the first Y minutes (especially for X >> Y)? Because long testing queues affect the second one, but not the first one.

If it's the second case: please don't — just admit that it did not work out, that's what adult people do.

Sincerely, Kroma

→ Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 2   Vote: I like it +8 Vote: I do not like it

    I agree with you, but extending the round doesn't mean they are going to make it rated. I am saying this because, in a very recent contest, there was an extension of 30 minutes (!), but the contest was still declared unrated (for the same reason as today).

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it -8 Vote: I do not like it

      Yeah, and the server was faster that day than today ;)

      → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      If that's the case, then I'm sorry that I exposed you to my butthurt. To explain myself I can only say that I would bother with extending time iff there is a chance to make it rated. So I assumed that "whoever decided to extend contest by 15 minutes" may have similar approach.

      → Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

The queue has disappeared... I don't know whether it's a good news or a bad one. Does it mean that the round will be rated? What a sad story... But I do think that a lot of contestants have go to bed after seeing the extremely long queue one or half an hour after the contest began. So do you think it is fair to make it rated?

→ Reply
»
7 years ago, # |
← Rev. 3   Vote: I like it +7 Vote: I do not like it

Although the queues have been cleared but please declare the round as unrated, 1. Some of us waited for long just to get a wrong answer. 2. Many of us lost the hope to continue the contest and hence going by the past trends we already assumed that it's gonna get unrated.

→ Reply
»
7 years ago, # |
  Vote: I like it +23 Vote: I do not like it

After only 40 minutes waiting only 15 minutes ???

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I submitted 2 solutions to problem 1 , in 9 min and in 11 min. Both got accepted and I got a penalty as well. Is it normal in codeforces or there is some malfunctioning going on? Initially I got 488 score and after 2 min it was reduced to 428. Sad :( MikeMirzayanov

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +11 Vote: I do not like it

    there's a 50 point penalty for resubmission

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    It's normal. There's a 50 point penalty for resubmission regardless of the correctness of the previous submission.

    → Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

div.2 a,b aren't good for hackers......

→ Reply
»
7 years ago, # |
  Vote: I like it +29 Vote: I do not like it

This has to be unrated... many people have lost 30+ minutes because they got WA after a super long queue.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    What's worse is that resubmitting needs another 30 minutes to get another WA on the same test case. :(

    → Reply
»
7 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Queue lag + Server lag = Unrated pls?

I even lagged out while trying to post this lol.

→ Reply
»
7 years ago, # |
  Vote: I like it +19 Vote: I do not like it

I really wonder why CF is not being open sourced ??(it's not a profit making site, right ?) .The website suffers every other round, I'm sure are many people willing to help CF.

→ Reply
»
7 years ago, # |
  Vote: I like it -57 Vote: I do not like it

Your contest is very stupid please don't repeat this awful... Your problems are unprofessional.

→ Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 2   Vote: I like it +31 Vote: I do not like it

    :| why unprofessional ?

    if you cant solve them it's not their fault!

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    And what is a "professional" problem? I know these problems could be improved, but the big issue about this contest was the long queue

    → Reply
»
7 years ago, # |
  Vote: I like it -37 Vote: I do not like it

MikeMirzayanov Make it rated please ^^

→ Reply
»
7 years ago, # |
  Vote: I like it +36 Vote: I do not like it

I hope that this round won't be rated. I waited for the result for half an hour,then the Web told me that I was wrong, then I used 1 minute to fixed the bug .But it didn't work again,and I waited for another half an hour. So I used 3600 seconds to fix a bug .Time is money.We shouldn't waste our time. I'm Chinese student ,I have so much homework to do. I tried my best to save time to do the round .If the round will be rated ,not only me ,but also many other people will get very angry. (My English is not good ,I just tried my best to explain my opinion)

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +27 Vote: I do not like it

When almost everyone asking for an unrated round has performed poorly

→ Reply
»
7 years ago, # |
  Vote: I like it +50 Vote: I do not like it

I don't know what's worse: The long queues in every other round of CodeForces or the way CodeForces handles these rounds (Extending the round and keeping the participants in the dark about the contest being rated/unrated, and finally making it unrated after the contest ends — A desperate attempt to ensure that the participants take part in the contest and do not leave it midway).

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You nailed it! Instead of stopping confusion as soon as possible they prolong it even further.

    → Reply
»
7 years ago, # |
  Vote: I like it +11 Vote: I do not like it

What are you doing at the end of the queue? Are you busy? Will you test us?

→ Reply
»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Good problems but awful contest.

→ Reply
»
7 years ago, # |
  Vote: I like it +6 Vote: I do not like it

what is test 5 for C ?!

→ Reply
»
7 years ago, # |
  Vote: I like it +15 Vote: I do not like it

D is just https://en.wikipedia.org/wiki/Catalan%27s_triangle + compute binomial for arbitrary modulo.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +11 Vote: I do not like it

    "How do we make this question harder?"

    "Make it modulo anything instead of 1e9+7"

    Always work with a charm. (**Smacks my own face for not keeping another combinational template**)

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    But how do you handle sum from l to r(and C-type customers)?

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it +10 Vote: I do not like it

      Fix the number of paying. Sum from l to r is reduced into two binomial terms.

      → Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Div 1. A. I wrote a program that kept on failing pretest 1 even though it worked on my computer. What ended up fixing it was doing my preprocessing before reading the input, which should not have changed anything. This issue took me one hour to catch since it took a good 30 minutes for the test results to get back and another 30 minutes for me to figure it out.

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

How to solve C and E?

On E I had a solution which didn't pass. Did someone pass it with such complexity? Also is there a way to solve it without SQRT decomposition?

PS: I think the round should definitely be unrated, because with such a queue it's not worth looking at the easy problems (Div. 1 A and B) as you may do a stupid bug and then be punished really hard. And so a lot of people start solving the harder problems and the chance of them failing the competition increases (for example I did so — I didn't even read B). Also a lot of people probably gave up after seeing such a queue.

PS2: The people which passed E all have the solution. The constant of my solution should really be large xD

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    On C operations are random and the queries don't depend on the order of numbers so expect a lot of adjacent numbers to be equal...

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    msqrt(n)logn + nlog^2n algorithm using binary search tree?

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      yep (treap)

      → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        The constant of this algorithm is too big... You can optimize it into O( msqrt( nlogn ) + nlog^2n ), but I think it still wont pass.

        → Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

for n=1; this is the string "What are you doing while sending What are you doing at the end of the world? Are you busy? Will you save us?? Are you busy? Will you send What are you doing at the end of the world? Are you busy? Will you save us??" and in this string the 194th char is 'y' but in the given test case it is 'b'! please help me if i have build the string in the wrong way please guide me!

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You are missing the quotation marks when you reffer to "f(i-1)"

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You missed including the quote " right before and after the nested string.

    → Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    The 194th char is 'b'. There are 218 characters in string f1, so if you start counting backwards from the last character you'll end up at 'b' in 'busy' on char 194. Make sure to count spaces and punctuation as well.

    Edit: I think putting in quotations will fix the problem.

    → Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is D all about Catalan number + DP? I regret ignoring an algorithm which computes (nCi mod non-prime for all i) in O(n) time. :/

→ Reply
»
7 years ago, # |
  Vote: I like it +3 Vote: I do not like it

There is no argument defending that the round should be rated. Please make it unrated as it has affected many of the participants badly.

→ Reply
»
7 years ago, # |
  Vote: I like it +25 Vote: I do not like it

Unrated please dude

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

how to solve div2 B

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    i th number is of format ireverse(i) for example 10th number is 1001

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I tried to generate all this "zcy" numbers, but still got WA 3 )) http://mirror.codeforces.com/contest/897/submission/32875222

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    "zcy number" is actually just a positive number, followed by its mirror.

    (Like "153351" is just "153" and its mirror — "351")

    So you can iterate from 1 to k, generate the zcy number and add its value. Remember the modulo.

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Wow, I think this is such a clever idea!! I did not notice this during the contest...

      Instead, I used another method to generate the first 100000+10 zcy numbers, and calculate their sum.

      → Reply
»
7 years ago, # |
  Vote: I like it +4 Vote: I do not like it

when in queue ( but expecting correct answer ) : PLEASE MAKE IT RATED after getting WA : PLEASE MAKE IT UNRATED

after mains when everyone gets WA : PLEASE MAKE IT RATED

→ Reply
»
7 years ago, # |
← Rev. 4   Vote: I like it +19 Vote: I do not like it

It would really be unfair to rate this round because many of us solved the problems faster than our submission times show; many of us submit, wait for a very long time, and find out our submission was incorrect, resulting in us losing more time than we should have. Today, the time lost was significant; some people lost up to 1 hour waiting for submissions. Personally, I lost a total of about 1 hour of time just waiting for the result of my submission (you don't know whether to continue working on a problem or not until you see the verdict), and I'm sure that many other people are in the same situation as me.

In addition, Codeforces Round 445, which happened a few weeks ago, featured servers that were awfully slow, yet still faster than today's. Given that it was still unrated, today's contest should also be unrated.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +23 Vote: I do not like it

    I got compilation error after waiting for 30 minutes lol

    → Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +37 Vote: I do not like it

I learned that my solution for div1 A was wrong after waiting in queue for 45 minutes, which was in fact a minor error I made while copying and pasting a lame ass string from the problem set. It will be absolutely unfair if this round is not marked unrated. Adding 15 minutes doesn't reconcile the situation by any means.

→ Reply
»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

how to solve div1 B?

→ Reply
»
7 years ago, # |
  Vote: I like it +1 Vote: I do not like it

How to handle N > 55 for div1 A/ div2 C? Won't this overflow 64 bit int?

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    it doesn't matter just take min(size, INF) where inf = 2e18

    This is because k <= 1e18

    → Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it +17 Vote: I do not like it

This blog is starting to get downvotes.

I think the problems were good. The issue was in the long queue, so I don't think this blog should be downvoted

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +41 Vote: I do not like it

    Ya except div 1 A/div 2 C, making sure you copied the right string (especially since there are quotation marks) is a nightmare.

    → Reply
»
7 years ago, # |
  Vote: I like it +131 Vote: I do not like it

Hello, community!

Recent weeks I did a lot of work to improve performance and stability of the website. It seems my efforts were not in vain. Today and on the previous two rounds the website worked good.

But today we’ve encountered with long queue because of Codeforces default strategy to rerun each solution if verdict is TL in exclusive mode. On each judging machine there are ~3 invoker services which judge your solutions. Exclusive mode guarantees that at most one solution is currently running. Because of many TLs many judging machine worked de facto in single invoker mode (instead of 3 of them). Sorry for long queue. I effectively diagnosed the issue and temporarily disabled this feature (it will be “on” on the system testing).

Sorry for huge queue. During the round I did a lot of work to understand the reasons. It seems I succeeded in it. I personally promise that after website optimizations (and it seems now it is OK), my next step is to improve judging performance to eradicate such situations.

We decided to make this round rated with weight 0.5 (semi-rated). It means that all rating changes will be divided by two.

Thank you for taking part in the round. And many thanks to the writers and the coordinators!

Mike.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +26 Vote: I do not like it

    First time I seen the semi-rated round...:D

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    Thanks for your great efforts keep up

    → Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 2   Vote: I like it +2 Vote: I do not like it

    But there are people who thought according to tradition the round will be unrated so that we can concentrate on other important works(I have Exam ) and left the contest in middle.Please once think about this

    → Reply
  • »
    »
    7 years ago, # ^ |
    ← Rev. 2   Vote: I like it +38 Vote: I do not like it

    It's so called rotten compromise. Nobody is satisfied ;)

    If somebody was affected, he definitely wants the round to be unrated and if not, he would like it fully rated.

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Mike, this is just not fair. I took off the contest after waiting half hour for a Wrong Answer. Is just ridiculous to think about doing this round rated, please, think again about your decision.

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +181 Vote: I do not like it

    → Reply
    • »
      »
      »
      7 years ago, # ^ |
        Vote: I like it +71 Vote: I do not like it

      → Reply
      • »
        »
        »
        »
        7 years ago, # ^ |
          Vote: I like it -10 Vote: I do not like it

        do you know what 1488 is used for? gtfo

        → Reply
        • »
          »
          »
          »
          »
          7 years ago, # ^ |
            Vote: I like it +3 Vote: I do not like it

          Yes! It means 1st April 1988, the first day when black humor got widely used among many people all over the world!

          → Reply
          • »
            »
            »
            »
            »
            »
            7 years ago, # ^ |
            ← Rev. 3   Vote: I like it -38 Vote: I do not like it

            Umm no, it's a nazi code, idiot. I wonder why people upvoted your retarded picture.

            → Reply
            • »
              »
              »
              »
              »
              »
              »
              7 years ago, # ^ |
                Vote: I like it +12 Vote: I do not like it

              Because they don't see anything nazi in 7 / 44.

              → Reply