SirShokoladina's blog

Codeforces Round #497 by Skyglow
By SirShokoladina, history, 6 years ago, translation, In English

Hello, everyone!

We are a Death Metal band Skyglow. Recently we released our first album. And since we happen to be sport programmers, we decided to make a Codeforces round in honor of this!

The round will take place on Jul/13/2018 17:35 (Moscow time). There will be five problems for each division, three of them will coincide. The problems were made up by me and rembocoder, the contest was also prepared with the help of TeaPot, slavik, mingaleg and niyaznigmatul. Thanks to demon1999 and winger for testing, our coordinator arsijo and, of course, MikeMirzayanov for Codeforces and Polygon platforms.

You can listen to the album by following the link:

It would be a great help if you repost us, even if you don't listen to this kind of music.

We will present an album on a CD to every contestant who expresses a wish. (If there are many of such, we will choose several of them with the best result in the round). Write me a private message.

Good luck on the contest!

UPD1. We will present an album on a CD to the top 10 contestants who would like to get one. Just send me a private message before the contest with your address, postal code and full name.

UPD2. Scoring distribution is as follows:
Div2: 500-1000-1500-2000-2500
Div1: 500-1000-1500-2250-2500

UPD3. We are still deciding if we should make this round rated or not. You can share your opinion about the round in the Mike's blog.

UPD4. We decided to sort the participants by the rating change. So the following users will receive a CD:
riela, +332
DongwonShin, +278
Erdenebayar, +176
DOlaBMOon, +148
Muhimin_Osim, +121
ciphereck, +117
Dotiros, +104
luismo, +94
MaxZubec, +72
whybee, +70

UPD5. Congratulations to winners!

Div1:

  1. yosupo
  2. Egor
  3. fateice
  4. Um_nik
  5. ksun48
  6. wxh010910
  7. zemen
  8. shpsi
  9. mareksom
  10. mmaxio

Div2:

  1. riela
  2. Kato_Megumi
  3. luis.trivelatto
  4. yukuai26
  5. _D41_
  6. gls1196
  7. TaoSama
  8. chenyuqi0215
  9. DearMargaret
  10. Rena_Takeda

UPD6. The editorial was published!

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

Comments Comments (396)
| Write comment?
»
6 years ago, # |
← Rev. 3   Vote: I like it +17 Vote: I do not like it

cool name!!! SKYGLOW

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

I'm sorry, but I think our music is better.

BTW, we released a new album yesterday, here's an MV: https://www.youtube.com/watch?v=Fm5iP0S1z9w

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

    — My music is hit! — No, your is shit!

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

      I know, it's so shit that it hit 20M views in 1 day :D

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

        So you came to PR on our contest? Sorry, I don't rate the quality of a song by the number of views, or else I end up listening to Justin Bieber.

        UPD: OK, now I see it is not even you, I am slowpoke. It's becuase you did not give the link in the beginning, so I thought you are really from a band.

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

          You don't have to agree with me on how you rate songs or which song is better. I'm just saying that if there is a huge difference in the number of views, it suggests that one is more popular than the other :/ (aka more people think one is better)

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

            First, if many people think it is better it doesn't mean it is better. Second, how can you know what they think, did you ask them? They didn't even hear my songs, lol, how would they compare?

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

              You're right, our music might not be better than yours.

              I'll just leave my comment as my personal opinion.

              Good luck gaining popularity then, I'm sure you guys will get millions of album purchases, considering how "[your] music is hit"!!!

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

                In this thread: two musicians that are better than me at programming and at music arguing with each other... Coming from drastically different genres: death metal vs. K-pop. There is only one way to settle this...

                You guys should start a rap battle!

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

              SirRembocodina, if I were you, I would have simply ignored her comment :-) The more replies she gets, the more people will pay attention to her comment (and the more views she will get).

              It is your contest. You have worked hard to prepare it. You deserve more attention than anyone else.

              → Reply
          • »
            »
            »
            »
            »
            »
            6 years ago, # ^ |
              Vote: I like it -31 Vote: I do not like it
            1. different genres of music.
            2. the fact that you're comparing this 2 different songs means that you're *******.

            "I'm sorry, but I think our music is better."

            And by apologizing, you're not changing the fact that you just decided to boost your self-esteem by humiliating others. It's like saying sorry before you hit me. Sorry for my poor English.

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

              What's wrong with comparing apples and oranges?

              I'm just stating my personal opinion, is there something wrong with that?

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

                If you want to state your personal opinion you should say like that, i think:

                I like our music more than your's.

                But you doing this another way:

                I'm sorry, but I think our music is better.

                So it ended up with confrontation, because you say that somebody have bad tastes in music if he listens to Skyglow's album.

                And to be honest you've done this just to PR. Another way you could act is to say and not make any cconflict:

                we too released new album yesterday, listen to it [link]

                But you can't say anything without negativity or sarcasm.

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

                  Did I ever say that people have bad tastes in music if they listen to Skyglow?

                  Yes, it seems like my comments sound a bit too sarcastic. I will definitely learn from you.

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

        for a country with population estimated to be 50m, and 20m hits for a music video?

        The reason would be heat but (supposedly) not the beat (no offense).

        Edit: OP's profile mentioned Taiwan and was confusing. But still its hard to believe on an average every 2 out of 5 saw video out of musical interest.

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

          Our group is actually from South Korea. And the audience isn't limited to one country.

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

    You can get the best from both worlds by watching your video on mute while having SkyGlow playing in a separate tab!

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

    Author is red, so his music is better.

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

      Since correlation is that high, I'll try to convince Petr and tourist to start a new band:)

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

        If you are able to convince them then the above comment would read as :
                           "Author is LGM ,so his music is AC"

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

      Oh how the tables have turned.

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

      tzuyu_chou is LGM so her music is better

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

    You guys are all wrong, AMERICAN music is the BEST IN THE WORLD

    Let me give you a taste of what TRUE music is like in the land of the free and the home of the brave: youtube.com/watch?v=dQw4w9WgXcQ

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

      when u already memorized the last 3 characters of the rick roll

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

    Twice is best

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

    Sorry to disturb，are you Ziyu Zhou herself？

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

      Oh, you so naive darling, that is cf =)

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

      Sorry to disturb，are you rorshach himself？=) PS: that Rorshach in Watchmen right?

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

        I admit I'm just a naive pupil...Please go easy on me=）

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

          I am kidding. I am just glad to find a person who has read Watchmen. I don't mean anything else. By the way I like Rorshach too.

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

            Well, fine. I like Rorshach, and Watchmen is one of my favorite movie. Anyway, nice to meet you.（>_<）

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

    I'm so shocked to see that 4 of the girls from Twice have CF accounts!

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

      LMAO 0))0)), they're just fans of "TWICE"). Don't be shocked ))

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

    BTW https://www.youtube.com/watch?v=i0p1bmr0EmE is TOP! I and my sister are your huge fans now =)

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

      It's good to see that our advertising plan, to a small extent, somehow worked!!!

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

        If your purpose is to lower your contribution, Congratulations! Your plan worked out remarkably!

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

          Thanks! I only planned to help advertise but I also got the benefit of having a low contribution. Perhaps I can beat I_LOVE_METSUKA :P

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

            Lol it gets harder as your contribution gets lower.

            Also I just stopped trolling and actually trying to get better at CP instead.

            Hit me up when you have lower contribution than me tho. I will be CM at that moment.

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

            Hey where did the downvoters go? I never said your jobs were done.

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

            each your comment should have 1000 upvotes

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

      Your comment gets upvotes )). It makes me laugh xD. If you would be green, I'm sure that your comment would get -100 ))

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

I don't know why I get the feeling this contest will be nice! :)

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

why there is no verdict called Contest Overflow ?

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

That sounds so cool!

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

    Lol, sorry, I downvoted your comment accidentally, and now everyone is downvoting it. This is how CF community works.

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

      Nevermind,we are not the creature live on "up-vote" XD.

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

      it's because master votes are worth many multiple points (more than 5 at least), not because others have also downvoted

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

Wow! This is cool, a death metal band is organizing a contest. I think this round is going to be great.

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

I think it will be a musical contest....

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

Is it rated???

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

It happens that I'm a big Fan Of Death Metal !!!!! I'll listen your release, and I'll try not to miss the contest. I have to say that for the first time my two passions in life meet !!!

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

it feels good to downvote every comment :)

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

Oh so good contest about music :D

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

    The problems won't be about music, actually. It will be a regular contest without particular theme, just with good problems :)

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

Programmers, programmers everywhere...

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

I don't know if it's a joke or not, but you guys might be the coolest people here on cf.

A death metal band? Damn

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

I'm confused, is the music promoting the contest or the contest promoting the music? xD

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

okay , I am really hyped now <3 , a contest by death metal guys, and by the way , I liked Sacred Self-Deceit , especially the start , will listen to others soon :) ,

However , please dont put any music related legend / stories , once I had a really bad experience with a topcoder problem with music analogies , it does not makes sense to people who never made music , or dont know any instrument..

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

I don't usually listen to this kind, but I got to say I really LOVED the music you are using, wish you all the best :D

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

Really nice album art !!! Good taste in music too. Best of luck for your band :) Hope this round will be an interesting one .

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

Wow! How do you manage being a programming grandmaster and being in a band at the same time ?

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

Friday 13th looks like a perfect day for a contest from a metal band.

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

my love for the album is based on my rating in this contest :"D

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

I wish to not be sent a CD :)

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

The album is just in my favorite style. :) Hope it will be very famous soon! :D And I think I can have a fun time during this contest!

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

Authors music is as sharp as his coding skills.....

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

?detaR tI sI

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

I hope it is not a mathforces.

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

I hope we don't have to code lyrics

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

Congratulations on your first album, Skyglow!

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

a Chinese word "New Be" is able to describe this

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

MusicForces Round?

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

if I bought your album, could I be expert?

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

Wow, I personally prefer clean singing, but this songs are really good. The riffs in "Thousand Years of terror", "...And the circle closed" and "The limitless Fog" are just awesome. Hope the problems be as nice.

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

By the way, both 500th Codeforces round and 50th educational round will be held quite soon. Sounds like a big anniversary for Codeforces. I wonder, whether it will be something special. Personally, i hope that there will be 500 T-shirts for top 500 participants xdxd. Or at least 100)

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

    Codeforces did not give prizes for (Div. 2 only) contests. At least from the day I joined (1 year ago). But I hope they do.

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

Are there programming contest related songs in the album?

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

    Yes, of course, in fact every song from the album is a subtle metaphor about a programming contest

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

Are there any hints in your album?)

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

That's a preeeettty lucky day for a contest

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

What about a competitive programming group.

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

    Competitive programming interview questions? Are you applying for codeforces or something?

    Lol what did you just say? read up about algorithms, and data structure, then you can call stuff by their name, and have an actual chance of passing these interviews.

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

      What's wrong with competitive programming :( But yeah that first post is advertising, it doesn't belong on this blog...

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

i found my twin with down votes .. tzuyu_chou

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

I was always interested in how do you choose amont all authors of the contest the one who will post the announcement. The one with lower contribution? Or simply by tossing the coin? How it is done generally and how it was done in this round?)

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

    We chose the red one, of course, people love reds. But really, SirShokoladina worked on the contest the most.

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

Can you guys please do a Despacito cover?

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

I wish to have a CD. How can I get one ?

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

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

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

tzuyu_chou Honestly, it was really a smart way to advertise. I couldn't resist me from watching it. And it's good.

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

    Wow, I might get a salary boost because of this! Thanks for letting me know.

    P.S. I learned this advertising trick from JYP. Go on forums and make sure your comments get either a lot of upvotes or a lot downvotes, as that will attract a lot of attention!

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

Probably all Red coders will get the CD '_^

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

Here is a challenge:

Compete in this contest, while listening to some death metal music :P

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

    That actually improves your performance, Prog metal is much harder to listen to but it has the same effect (even better) if you get used to it (at least for me). So here's a harder challenge : try listening to some Dream Theater during the contest, see how much can you take. (start with Dance of Eternity)

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

      I am also a prog fan, but never thought about it....

      it looks like you are a real PROGrammer :P

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

      Does it work with Fates Warning as well?? You know I love Dream Theater too, but I prefer Fates Warning, Skyglow here has a lot of progressive too. For me Death-Metal works better, or in a more general sense Extreme-Metal. Is nice to find Metal Fanse here. By the way your nickname is a Masterpiece if you know what I mean.

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

        It works with whatever you like. and sure, Powerslave is one of the best metal albums ever. Iron Maidens is a God to me.

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

          Seventh Son Of The Seventh Son is my favorite Maiden album, I wish I could watch them play it alive someday

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

    Actually I did, but not just Skyglow, there was som Emperor, Annihilator, Amorphis and some more stuff on the playlist. Although I have to add, the I only listen Metal while I'm not focusing on hard problems, you might guess that my playlist stopped at minute 27 when I AC problem C :P

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

So cool, you guys!!!

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

That actually quite nice. Didn't expect to actually enjoy it because I usually hate the screaming. The musical accompaniment kinda reminded me of the whole Touhou metal variation culture that I'm very fond of :)

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

    Losing Humanity has some clean voices, for me is the best song of the album.

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

Wow, if it comes to music, there are many well talented people on CF. budro, fast, it's your time to shine!

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

What you'd say about sending CDs to people who solve only problems C and D, apart from the top10 criterion? SirShokoladina

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

    Not many people would want to receive a CD. I don't want to waste CDs on people who don't want them. Besides we can only send 10 CDs. Also I want every contestant to be able to win a CD, not only reds and yellows.

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

What's wrong with tourist's contribution ?

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

Probably the first blog after Tourist's "Hello 2018" with this much appreciation.Hope the participation would see similar levels.

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

This is the most use of odd time signatures I've seen since Meshuggah and perhaps Tool. Definitely feels like the songs are written by a red coder.

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

    Ha-ha, thank you! Yellow, actually. I am glad someone marked this feature.

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

Really liked the song "Losing Humanity".

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

OMG! 1000 upvotes! Congratulations!!

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

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

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

Your album is an amazing for people who love listening metal! You helped me to update my playlist)

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

I think this announcement has greatest Upvotes :)

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

That's great you're gathering success as music band! I'd like to appreciate your work but I kind of hate music, so maybe you can record few minutes of complete silence, so I can actually enjoy one of your tracks?

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

A CF on Friday the 13th, May the Gods be on our sides...

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

I will try to become expert in this contest. :)

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

Typing contest because of Div2-D

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

C is like 1250 while D is like at least 2750.

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

A,B,C,D all had some typing/explanation problems. what about D?

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

unbalanced problemset

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

problem A is simple but hard to read it Wrong Description (10 20 30 40 -> 20 30 40 10) ans = 3 not 2 Somebody submit solution late because of it and have low rank in problem A problem B is very difficult Why not call it CodeSpeed round ?

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

    Yeah you r right i was confused too at first sight

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

      I think it's very frustrating to get a lower rating because of unbalanced problems and wrong descriptions

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

        Wrong description is truly embarrassing but unbalanced problems, is not the case always, so for someone really trying to work hard on problem solving will surely have a good time.

        A side note, I also see my rating going down in today's contest, but hell, loved the fifth question. Really enjoyed the contest.

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

Problem statements are not clear and difficulty difference between C and D is huge.Lots of announcements.

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

With 1 hour into the contest and no AC solution to D and E (Div.2), one thing can be said for sure that this round was just about fast solving A, B and C. Surely, this contest was way below my expectation, specially after the cool music theme and 1000+ upvotes on announcement :(

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

    "All that glitters is not gold."

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

    This is why I never vote on a contest announcement until I've seen the problems.

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

Wake me up when someone solves D in div2 :P

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

Sorry this contest put me on team K-Pop

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

    Looking at how people are reacting to this contest, it is obvious that their main purpose of preparing this contest was to promote their music. Not that I could actually write any problems (much less prepare a contest), but they should've just not wasted 2 hours for many people.

    My advertising, on the other hand, only wastes a few seconds, as it just requires people to look at my comments and downvote them.

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

Really bad problem set...

  1. Problem statements very unclear.

  2. A, B, C — very easy, thus typing speed checking contest.

  3. D, E are way out of league for Div2 users.

Solve problem D in Div2 and you'll be a CM.

Also I usually save my vote for the announcement and give my vote only after seeing the problem set. I give you a downvote SirShokoladina.

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

    Or, Solve problem B in div1 and become Master.

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

At least i tried

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

    I solved A B C in 17 minutes and read statements of problem D. Now I can't still understand what D is saying.

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

      Lucky you, I'm still at the first sentence in D

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

You may be good at singing but you're definitely not good at preparing a contest.

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

Too bad I already have up-voted your blog and I can't down-vote it now!

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

Is it the first contest in history of CF which has had an announcement for an (wrong) announcement?

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

    Yes, my bad this time. Sorry about it.

    See, arsijo only learns to be a coordinator. Sorry for unclearness in some statements and disbalance in difficulties, we will work on it!

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

      oh I'm sorry. Didn't wanna bother you. As long as so many rounds are coming one after the other, I'm grateful to you and CF. Mistakes are totally okay.(I guess).

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

      I think the contest should be rated because mistakes happens in any contest and it was just a problem has mistake but all other problems were fine

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

It is not normal when nearly 3000 people solve ABC so fast and so few people solve D or E. I believe that next time problemsetters will be more careful with tasks.

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

Why would the round be extended for 10 minutes?

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

    So we can finish with reading last two problems

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

      maybe we have more time to hack!

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

        maybe to decrease the difference between the number of submissions of C and D!

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

        Maybe we have more time to get Unsuccessful hacking attempt back :(

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

)

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

They focussed more on promoting their music instead of preparing problems for this round.

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

Kind of the worst Codeforces Round, but, hey, at least you tried!

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

The extension will only extend my suffering

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

For Div. 2:

hack

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

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

Much difference between expectation and reality..

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

Solve [D]

Runtime error

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

What's intended complexity for Div1B?

I had log(#divisors)*(#divisors) per query but with huge constant so didn't pass

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

    still 5 mins remaining for the contest to end!

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

    I have O(1) per query (more honest — O((2k)k * 2k) where k is number of dimensions, k = 3 for this problem).

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

      Can you please explain your approach for the problem!

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

        I would like if someone explain my approach to me, actually...

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

    My solution is O(1) per query.

    Calculate A[i] = number of divisors in mask i for the venn diagram (https://en.wikipedia.org/wiki/Venn_diagram) of the divisors and do a bruteforce on the possible combinations of areas from it. Turns out there are 51 possible combinations of areas for it so you can just precalculate them and pass through them doing simple combinatory.

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

A contest with announcement on every problem. Announcementforces round

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

The div2 round is completely a garbage. The problem DE in nearly unsolvable, while ABC are div4 problems. The pretest contains only examples. I cannot complain more.

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

This is the longest Announcement list I've seen so far!

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

I think K-9 is cheating

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

Disappointed.

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

Almost O(N^2) solution passes for problem C! 40274533 Tried to hack it with this test and it still passed in 1.5s

    int N = 100000;
    cout<<N<<endl;
    for(int i = 0;i<N/2;i++)
        cout<<1<<" ";
    for(int j = N/2;j<N;j++) {
        cout<<2;
        if( j != N-1)
            cout<<" ";
    }

That really doesn't make sense to give 2s for such a problem!

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

    Passed the pretests doesnt mean it passes the system tests

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

      I meant for this hack test it still passed in 1.5s that's why I'm saying 2s is too much for this problem cuz such solutions will pass

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

        generally, pretests include small test cases and for these tests maybe 1.5s is expected for that hack.

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

    Maybe pretest doesn't include this test case.

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

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

Semi-rated?

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

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

How to solve Div.1 C?

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

That was pure shit!

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

Very Hard C, D, E!

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

The most difficult problemset of div1 I've ever seen!

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

My logic in Div2 D.

Sort the 3 numbers A,B,C. Get all factors of A, B and C in a sorted order. For each factor of B[i] find number of factors of A less than or equal to B[i] and number of factors of C greater than or equal to B[i] using binary search.

Then multiply these two numbers and add to ans.

But got WA in test case 3. How can I modify this to get AC or this is a wrong logic (I am probably not counting all triplets) ?

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

    this is rather wrong logic

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

      For paving we have to make sure the corresponding dimension of the smaller parallelepiped divides the corresponding dimension of the bigger parallelepiped right? This is why I used factors and then to make sure a<=b<=c I used the binary search.

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

        "the corresponding dimension of the smaller parallelepiped divides the corresponding dimension of the bigger parallelepiped"

        I think the problem is in this assumption. Since you can rotate the smaller parallelepiped, the numbers a <= b <= c don't necessarily divide A, B and C in that order, for example you could have: 'a' divides C, 'b' divides A and 'c' divides B. The statement in fact contains one example of this, saying that a 1x5x6 block can be divided into 1x3x5 parallelepipeds (1 divides 1, 3 divides 6, 5 divides 5).

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

    Two clearest things to point out: your answer might consists of duplicate pairs, also not only divisors of B can be at the middle regarding numbers' absolute values.

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

Not "the first" in everything turns out good, actually.

I appreciate your work (both music and CP, though I'm not a huge fan of Death Metal anyway xD); however this contest has some issues. Most known are D1B/D2D incomprehensibility and its spike over easier tasks (haven't read D1C and above, so I can't comment further xD).

Also, having a lot of additional announcements is something not so nice. You might consider simulating yourself in more varied perspectives so that you can have a wider overview of what being clear and what being vague ;)

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

for div1B, what is the correct output for 6 10 15

it is 50, right? edit nvm I'm wrong its 51

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

    My AC code gives 51. Now I'm scared.

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

    it's 51, my bruteforce says

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

    This gives 51:


    int brute(int a, int b, int c) {
	set<vector<int>> s;
	for (int i=1; i<=a; i++)
		for (int j=1; j<=b; j++)
			for (int k=1; k<=c; k++) {
				if (a%i == 0 && b%j == 0 && c%k == 0) {
					vector<int> v = {i, j, k};
					sort(v.begin(), v.end());
					s.insert(v);
				}
			}
	return s.size();
}
    → Reply
  • »
    »
    6 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    51 obviously

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

Ok, something weird happened to me on C.

I had Idleness Limit Exceeded with one program. Then I added an assert to two places and got RTE, so the assert is obviously the reason for RTE. That's all well possible, but then I took the code with asserts, hardwired "choose random a and b initially" and a checker oracle "choose a random true answer" instead of I/O. And stresstested with tens of thousands of tests, various random and non-random N. The assert is never triggered.

Is there a bug in the checker? In my hardwired checker? Does my code fail on a strange corner case (specifically: on pretest 1)? Something else?

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

    i saw your solution. it runs into an infinite loop on the sample

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

      I know where I made a mistake after going though the sequence of expected answers now... It has nothing to do with any of my thoughts during the contest, I mentally reversed the inequalities in answers (answer 1: the correct number is smaller than the queried number).

      What a shitty mistake. The worst thing is that there was no way for me not to make that mistake — when I read x < a, my mind automatically goes to "meaning of random letters: the true number is on the left and the queried number is on the right" because it's the natural notation for me and that's precisely why I can't realise that's wrong too... if it wasn't a, b and x, y but something like qa, qb, I'd probably notice.

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

        Yeah, I agree, I also made this mistake but luckily caught it when trying to run the samples by hand.

        I think it would have been better if x and a were replaced by words, for example "the x-value Vitya guessed", "the x-value Vasya is thinking of".

        (okay that doesn't sound that good, but I'm sure there is a better alternative.)

        EDIT: better alternative in comment by Xellos

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

          +1

          I had to stop ~15 times for a second and think again what the condition means (which side/way it is).

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

          v1, v2 and q1, q2 would be fine. Variable names being self-explanatory also means there's no need for a tl;dr explanation.

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

        I agree. The notation was confusing :(

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

    the interactor is determinate, so it gave you the same answer each time.

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

How to solve div-2 D or E?

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

ecnerwala are you guys streaming today?

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

    No, we're busy after the contests on weekdays. We'll try to stream most of the weekend contests though!

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

Let's start a really long discussion now. I was able to solve div 2 B using simple O(n) implementation here but looking at the round I am still not sure if it'll pass the system tests or not. I solved div 2 A after somehow understanding the problem but my solution got hacked. I still don't know why test case of "nz" should print "NO". My submission is here

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

    Because there is no vowel after z

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

    Good news for D2B — your greedy O(n) solution is correct! :D

    P/s: I solved B that way as well ;)

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

      yay! finally something good happened in last 2 hours for me!

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

Hello K-9 can you explain this?

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

    We can wait for K-9 's response

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

    I think that K-9 has two (or more) codeforces accounts, and he just register with all of them in the contest, and by chance he's in the same room with one of this accounts, so he hack himself 9 times :) you can observe that the solution of K-9 and the the solution of Eagle-EYe have the same header ;)

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

    Funny，he's in the same room as mine. And I see how he hacked Eagle-EYe's. At first, I sympathize with Eagle-EYe's very much, until I view his code..= =

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

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

I don't care if I get downvoted. This was one of the worst Div-2 contests I have participated in.

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

Contest is hard and very bad.

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

Is the title and the description of div2 D incorrect? I still didn't understand the problem.

Pave: cover (a piece of ground) with concrete, asphalt, stones, or bricks; lay paving over.

What does it mean to pave a parallelepiped?

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

    The problem asked you to count the numbers of (a, b, c) (a <= b <= c), such that (a, b, c) are divisors of (A, B, C) or (A, C, B) or (B, A, C) or (B, C, A) or (C, A, B) or (C, B, A), respectively.

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

      So parallelepipeds (A, B, C) is the same as (A, C, B) but rotated? [I think rotating (A, B, C), where (A != B; B != C; A != C) won't produce (A, C, B)] (1×5×6 can be divided into parallelepipeds 1×3×5) but this tells me I'm wrong.

      Or maybe its even more complicated than that?

      I was thinking about it a bit, but probably am just wrong or misunderstood sth.

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

    just think of it as a 3d rectangle, a box. Then "to pave" means "to fill it" so it's full. You can fill a 3x3x3 box with 27 1x1x1 boxes, or with 3 1x3x3 boxes, or 3 3x1x3 boxes, etc. Note that, in the task, you can only use boxes AxBxC that are A <= B <= C, but rotation is allowed, so a 9x1x1 box can be filled with boxes of 1x1x3.

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

Please make the round unrated for those who got "Idleness limit exceeded" in Problem C because of sending too many requests.

It was explicitly stated in the statement that sending too many requests leads to "Wrong Answer" and printing nothing or forgetting to flush the output leads to "Idleness limit exceeded".

It wasn't until almost the end of the contest that the correction was made.

Some contestants may have spent huge amount of time looking for errors in their code that matched the verdict("Idleness limit exceeded")and couldn't find any mistake related to I/O and therefore couldn't compete in the contest normally.

Please look into the issue.

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

    Im afraid that you div1 public commenting by fake account. afraid of downvote :p ?

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

      I don't see how downvotes matter? (other than it makes the comment hidden — which will also happen from the the fake account)

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

      I think many share the same trouble during the contest so I don't want to make this only about myself.

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

    It happened to me, but then again I could not have solved D anyway and A,B and C were done. So I can't complain. But I do consider that it would have been the case with Div 1 users.

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

Hoping for a contest with less math soon

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

    Agreed. But CF is famous for its math tasks, and many people like that?

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

    one should enjoy maths problems .

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

      If only your target is to learn math deeply. I enjoy programming and involvement of mathematic observation but pure hard math annoy me because I dont know much.

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

        then when will you learn new and hard things ?

        hope you know many red coders are either imo medalists or won some medals in prestigious maths competition !

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

          But point is we newbie public are not medalist :p we want to learn data structure, graph, string and various algorithm. Many of us not willing to compete in IMO.

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

Although div1B was way harder than ussual, I really liked it, actually, thanks.

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

Why does this solution doesn't work for E? I first guessed the value for x, once I get that, I guess for value of y. I don't think this will exceed 600 requests. What am I missing here? anyone?

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

    You should probably put your code in a spoiler tag before the downvotes come (also it's neater)

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

      I tried to do that, the dropdown just doesn't appear. It's like the drop-down to select spoiler is hidden behind the text box.

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

    "this suggest we got x right" — but it doesn't mean that.

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

      I mean, if the response is random for the case when more than one condition satisfies, then it fails with probability — 1/1024. What if I increase the threshold for cnt2?

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

    The interactor can just keep printing out '2', indicating that your y value is less than the target, and you'll never find the correct x value. When you input '2' while searching for x value, you don't change your outputted query at all, and the interactor is free to keep outputting '2' regardless of the correctness of your x value.

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

      Thanks, my mistake. I assumed that in case of multiple conditions is true, the interactor's output is random.

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

Very unbalanced contest. C solved by 3000, D by 21? Was it difficult to predict when making problem set...

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

    Wait for the system test and you will find out that the number of solutions for C is far smaller

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

      How do you predict this "far"? Not much hacks on it, I predict only less than 10% to fail systests.

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

I don't get people that just write "stupid contest" without any extra explanation ("I did poorly" isn't a good explanation). Maybe you think problems were way too hard, or e.g. 3 of 5 problems were on a similar topic, or the statement was bad — but then write it and maybe the next contest will be better.

My complain: remember guys that "either ... or ..." means "xor", not "or".

How to solve E? It seems to be extremely hard.

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

    where is "either ... or ..."

    EDIT: ok, makes sense

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

      It was in the initial statement of C in the description of the response 3. I was confused about it, asked a question and they removed the word "either".

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

      It was in the statement in the beginning. We are deeply sorry... Someone changed it that way and we did not check.

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

        Keep "deeply sorry" for bigger issues :D that one was a detail. Cheers.

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

          Yes, this is just a quote from South Park :)

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

        Also, I recommend reading emails from Polygon about every commit in your problems. I always do that and then I can't miss a bad change in the statement.

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

          Well, I saw it, but I did not pay much attention. Someone just clarified a statement a bit, but made this mistake.

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

    Also, I enjoyed the first 35 seconds of the first song in your album. Then the actual song begins :D

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

      35 seconds < : A,B,C

      35 seconds > : D,E

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

    My complaint would be that a, b and x, y are very random names for "correct numbers" and "queried numbers", which led to me misreading the problem statement of C (on every re-reading too). There's nothing I can do to avoid making that mistake again, either.

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

    What is not good in this round:

    • Unbalanced difficulty (B is much harder than it should)

    • Issue with problem statement in A (the phrase "the number that Vasya wants to maximize equals 2" confused some contestants, and the fact that ranks of contestants depend mostly on speed of solving A worsen the issue)

    • Issue with problem statement and annoucement on B.

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

i don't understand , why some complain of hard contest , rather than thinking whether it is hard / easy one should think on problem and how to solve it . if not solved wait for the editorials and learn the things where you are missing .

hard and unique problems will only teach you something.

MikeMirzayanov

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

    It won't be an issue if the points were not based on time. The real problem is that a difference of few points causes a huge difference in ranks.

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

    In that case, what's the point of having problems Div2.A~C? Why don't we host a contest full of Div1.E problems and make the contestants learn much more and much faster?

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

How do we solve Div 2 C in O(n)?

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

    You need to sort it which is O(n log n0. Then there is a greedy solution, you can take the largest number from its place and put on the largest possible smaller number's place and then consider the next number.

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

      Let's get all sizes of groups of equal numbers (using unordered_map). All sizes <= 1e5, so we can sort (O(n)). Answer is the cyclic shift (in sorted array of number). For all values of cyclic shifts we can calculate answer using sorted array of sizes.

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

    You can't , sort is needed .

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

    hashmap :)

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

    EDIT: Ignore it, it's the solution for div2 B, the thread is meant for div2 C.
    < ignore >Yeah you can, check out my solution here</ ignore > :)

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

    40264790 like this

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

      That's a n log(n) solution btw . the access to an element in a map is done in log(number of elements int this map) , now consider all the elements are distinct.

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

        he could used unordered_map instead .

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

      can someone provide an explanation for this solution?

      EDIT: thanks, understood

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

    I thought it was n — (the largest amount of numbers that are all the same). So 1 2 2 2 5 is 5 — 3 = 2 because there are 3 2's. However, I kept getting WA on test 3. Can anyone tell me what a counterexample to this approach is? I spent so long, I even wrote down a detailed proof on why it was true, and the code was very clean, so I have no idea what my mistake was

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

      That is indeed correct solution, so you have some bugs in implementation

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

        Yep, after seeing the test case, I found out why...

        Apparently in java Integers can't be compared with ==. (auto unboxing apparently doesn't work as great as it sounds)

        This is good to know, I don't feel so bad about being stuck on it any more, what a subtle bug! (Especially since, they are apparently stored slightly differently for small integers, so when I tried like 3 1 3 it works but if you add some zeros it breaks) (And I was only using Integers so I wouldn't get TLE because of java using the slower sort algorithm... turns out it backfired D:)

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

          Well, unboxing works exactly as advertised, there is just no reason to unbox 2 Integer instances compared with ==

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

      That's absolutely correct. I didn't think of this, but as I read this now, I realize how the logic i used will be reduced to this. Nice!

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

This is probably the coolest round in Codeforces. :D :D

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

    Ha-ha, thank you! I'm glad at least someone liked it.

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

      Actually, He is being sarcastic.

      Anyway, the contest was not that bad as many people think. The first 3 problems were kinda easy, the fourth one was not of my taste and a bit boring but is acceptable. The binary search tweak in the last problem was very nice.

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

no one solved 5/5 of problems in both divisions !! rare to happen :|

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

    becoz those who have the capability of doing this were not competing today ..

    hope you know , whom i am talking about !

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

Am I in hackforces round? -_-

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

    i did 2 unsuccessfull hacks .. moved from 600 -> 1200 :(

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

      It is unbelievable to see that there are 3 problems more the 3000 one had solved it and another 2 ,one of them 20 but the other is 8 (just passed the pretest)

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

        all of we agree that was unbalanced problemset

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

          also I think rounds like this is very very unfair for the participates and don't show their skills

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

Why system testing not start ? ://

rembocoder

SirShokoladina

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

You can't run systest if you don't have any systests. Just saw the pretests

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

there is some participants solved problem D and E. so it's ok for the contest to be rated just my opinion

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

Solved A B C in less than 15 minutes after thinking a lot about D try to hack locked my A problem and it got hacked :( .Atleast D must be of somewhat less difficulty so that we can save our rating.

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

    Its not all about ratings bro. If you deserve them your points will come to you. So just enjoy learning new things.

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

      I am not complaining about the contest but atleast test cases must be strong if they want to check the speed.

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

i think this contest deserves to be evaluated as "a bad contest" not only because of the difficulty, but also because of too many corrections made during the contest. idk if the writers know (because they are kinda red or yellow or purple coders), but people like me, who are not as good as the purple or above guys, need to read the problem and given examples 'very' carefully because we are not able to come up with the solution as soon as we read it. then what would happen if there is a clear fault in the example or hint? this really matters.. at least for me. i always want to thank for guys who write problems for people, but i hope in the future they try their best not to make these kinds of typo made today.

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

Apart from mistakes in the statement it was not that bad.It was a good contest i think.We should agree that we could not solve D and that's all.

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

when does system test starts? I want to sleep...

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

SirShokoladina && rembocoder why you have same prefix -Sir- !!

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

When will system testing begin?

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

only 18 solved D and 0 solved E?

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

When will system testing begin?

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

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

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

*Waits for System Tests to start

*Dies.

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

    They are still thinking about making this round unrated or not.

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

I am confused about one thing. If a contest is tough, how would your ranking differ? Because if someone is solving it faster than you, then he/she would have solved easier question faster than you as well. I think the question as good. Though couldn't solve D and E, but it was a fun hour crying, thinking and again crying about the questions. Well, really looking forward to learning something really cool from the editorial this time, again. Sorry if offended anyone.

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

    Well, since most people can't do problems D&E, there are only 3 questions and it comes down to speed. So there is a lot more deviation in the score and people who are usually 100th place plus or minus 50 and now 100th place plus or minus 300 (though obviously they can't get minus, so it's just worse for them). I think in general your expected position may not change too much, but it's much more luck-based.

    Also it puts emphasis on solving fast rather than being smart, and if you get hacked on 1 problem you go down like 2000 places.

    Imagine if you are taking a test in school with 3 easy questions and your grade is based on how fast you answer them

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

tzuyu_chou == TWICE_OVER_SKYGLOW ?

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

Does anyone know what is the worst-case behaviour for the following two solutions for Div1 C?

At all times, the set of the possible answer pairs is an L-like shape. (Or a rectangle, which can be seen as a degenerate L-like shape.)

First solution: ask for the midpoint of the segment connecting the big right angle and the concave angle of the L-like figure. Update the figure according to the answer.

Second solution: if the figure is a rectangle, ask for the center of the rectangle. If not, divide the L-like figure into three obvious rectangles, and ask for the midpoint of the larger side of the middle rectangle.

I feel that the second solution should be much better, but I keep miscalculating and cannot obtain the maximal number of steps for any solution.

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

In my opinion problem D1B was horrible. The coding part (finding number of divisors for A, B, C, gcd(A,B), gcd(A,C), gcd(B,C), gcd(A,B,C)) is trivial and after that you have hard extremely annoying inclusion-exclusion case-handling. For comparison, look at this recent combinatorics problem that involves no case handling, and has a very elegant solution.

Even though I did very badly I wasn't affected by the issues in the round, so I don't think it should be unrated.

C looks like a cool problem, too bad I didn't have much time to spend on it.

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

    I really liked that recent problem.

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

    For B, I have a solution using Burnside Lemma and inclusion-exclusion principle, no case handling at all (hope that it will pass systest).

    My submission

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

      If it's not too much trouble, would you mind explaining your solution a bit more?

      I'm really not seeing what sort of action is bringing Burnside into play here.

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

        In this problem, the Burnside lemma turn the problem of counting the number of triple (x, y, z) that x ≤ y ≤ z (unordered triple) satisfy some condition P to the following three problem:

        • Count the number of triple (x, y, z) that satisfy the condition P.

        • Count the number of triple (x, y, z) that x = y and satisfy the condition P.

        • Count the number of triple (x, y, z) that x = y = z and satisfy the condition P.

        Condition P in this problem is "it is possible to pave the given parallelepiped with the parallelepipeds x * y * z

        Then I use the inclusion-exclusion principle to solve the first two problems (the third one is trivial).

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

          Hi, would you like to tell me why you multiply the thrid count with two?

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

            Because for a configuration (x, y, z), there is two permutations where x remain equal to y: (x, y, z) and (y, x, z)

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

              I don't understand why the third count is related to x = y. Would you like to hear my understanding of your idea?

              In Burnside lemma, we want to find the fixed point of the 6 permutations 123, 132, 213, 231, 312, 321. For 123, it is exactly what your type 1 mean. Your type 2 is 213 which has the same value as 132 and 321, and that's why you multiply it by three.

              For your type 3, there are two remaining permutations 231 and 312, and that's why you multiply the gcd of all three numbers by two.

              Then the answer is the sum of them divided by 6.

              Would you like to see whether I have a correct understanding of your code? Thank you very much.

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

          Could you explain the masks you have used please?

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

editorial?

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

Is it rated? No jokes btw/

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

For Div1 problem D (1007D - Ants), why was M so large at 10^4? What is the intended complexity vs. the intended-to-TLE complexity?

From what I can tell, an M^2 log N solution will definitely TLE, whereas an M^2 solution will pass or TLE depending on constant factor. However I really don't think constant factor should be an important part of these contests.

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

It's so disappointing in problem C to get "Time limit exceeded" on test 31...

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

Make Rated ! Codeforces again turned to Hackforces !

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

Hey, I haven't slept yet and it's 4:00 AM in my country now.

The only reason being that I am waiting for seeing if the round will be rated or not. I think you have had enough opinions from the community to be able to come to a decision.

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

    ohhh you did not participate why you still wating>?

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

      Was waiting for you to reply to my comment. And since now I have that, I have achieved everything I had dreamt of achieving in my whole life. Now I can rest in peace. :P

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

@SirShokoladina rembocoder arsijo

During the contest, I tried to hack this solution for div2 A with input as "ae".

http://codeforces.net/contest/1008/submission/40270051

I got the verdict as YES but actually, the output should be NO which can be verified from main tests as the same solution fails for the main test 23.

Am I correct or not? If yes, should I get the hacking points for the same? [submission:40270051][contest:1008][problem:1008A]

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

    "ae" gets "Yes", it is correct.

    What's the problem? Test 23 is also "Yes'.

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

      But according to code, it should output NO like Test 23.

      Please see this line in the code:

      if (!flag['a' - *(s.end()-1)] && ... ) Here program is accessing flag['a' — 'e'] which should return false and hence making if condition true. So, it should output NO.

      Same thing has been mentioned by me in "Ask the question", but as the round has ended, I am unable to reply.

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

        I think u'r right.The code u mentioned should beif(!flag[*(s.end()-1)-'a'] && ...).The hack should be successful.

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

My mistake today:

a. I started 3-4 minutes late.

b. While coding the second problem, one of my laptop keys fell off. Coded it after getting external keyboard and wasn't comfortable typing in it. :(

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

Will, you post the names of the Winners of the CD. I would like to be on the list. :P

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

how to solve div2a?

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

When will the editorial be published?

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

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

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

?detaR tI sI

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

Why did my code of div1C which used "exit(0);" get "Idleness Limit Exceeded" in pretest 12?

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

ooh, I also wanted your CDs I liked it very much, but I thought that you would send your CDs participants with high scores. I have +116 at this contest and I won't get any CD :( . Anyway thanks for the good contest :) .

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

    Well, we may send it to you if we have one left. Tell me your address in private messages.

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

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

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

Hackforces

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

This looks like cheating!

Upd. Missed that in comments above. Sorry

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

?detaR tI sI

→ Reply