MikeMirzayanov's blog

2016-2017 CT S03E08: Codeforces Trainings Season 3 Episode 8
By MikeMirzayanov, history, 8 years ago, translation, In English

Welcome to 2016-2017 CT S03E08: Codeforces Trainings Season 3 Episode 8 - 2005-2006 ACM-ICPC, Tokyo Regional Contest + 2010 Google Code Jam Qualification Round (CGJ 10, Q). The training duration is 5 hours. It is opened for teams as well as for individual participants. After the end you may use the practice mode to complete problem solving. Also it will be available as a virtual contest for whose of you who can't take part today. Please, do not cheat. Only fair play!

Visit Codeforces::Gym to find the contest and register.

We are planning to start on November 2, 2016 13:10 (UTC).

It is possible that the problems will be too easy for some participants, it is possible that we will add some problems.

Good luck!


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

Comments Comments (10)
| Write comment?
»
8 years ago, # |
  Vote: I like it -28 Vote: I do not like it

I doubt that it would be easy for me :3

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

Any hints for C?

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

    Fix 1 cube and try to rotate the other cubes in every possible ways. For one cube there will be 24 possible rotations, so there will be 24n - 1 possible combinations.

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

      Out of topic but do you know someone named Manh Hung Nguyen Phan and Phuoc Dat Nguyen? Are they still alive? I mean are they still coding?

      Back to C, well, I really did not expect brute force o.O (because I could not prove that the final setting will be that of one of the original cubes), but I see you make it AC, so thank you a lot :))

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

        Hung and Dat are my classmates. They both quit competitive programming over a year ago to focus on their study and research :D

        About C, the final setting may not be one of the original cubes. In each combination of rotations, you will paint the cubes with the colors that appear the most in each face.

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

It's ridiculous to remove me from the ranking list. My programs were all done by me and my teammate in 5 hour contest time.

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

Any hints for problem G?

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

Why our team has been removed.All solutions were our.

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

How to solve E and G?

→ Reply