jdurie's blog

By jdurie, 3 weeks ago, In English

EPIC

Hi, Codeforces!

We welcome everyone to take part in Codeforces Round #801 (Div. 2) and EPIC Institute of Technology Round, which will start on Jun/18/2022 17:35 (Moscow time).

The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially in the round.

You will be given 5 problems and 2 hours to solve them. One problem will consist of multiple subtasks.

The score distribution will be 500 — 750 — 1250 — (1250+1000) — 3000.

The round was prepared by me, ki0apa, and akifpatel.

We would like to say a word of appreciation:

Good luck to all the participants!

Update: Editorial is out!

About EPIC Institute of Technology

Recently, in our blog, we have introduced the educational project of EPAM called EPIC Institute of Technology.

EPIC Institute of Technology, a part of EPIC — EPAM Product Innovation Center, is truly a unique educational project driven by the Deltix team under the EPAM Systems umbrella.

Why EPIC:

EPIC Institute of Technology is an accelerator for the best talents. Our students will acquire hands-on experience in one of the selected major programs, all of them are highly demanded right now on the top projects, together with the fundamental knowledge, so indispensable for real professionals. Successful graduates will have a unique chance to jump start their career on the most challenging and interesting EPAM projects worldwide. You will join the community of intelligent and driven individuals and have an honor to work with and learn from them.

Here are the answers to the most common questions:

How much does education cost?

EPIC Institute of Technology is completely free. There are no fees to register for exams or tuition fees.

How is the educational process organized?

Each program lasts exactly one year. The academic year consists of two semesters. Courses in the first semester are the same for all programs. Courses in the second semester depend on the selected major program.

Students will take an intermediate assessment in the middle of the semester. The final grade will be given for each course at the end of each semester. The grade a student gets for each training course, depends on the quality of the laboratory work and participation in lectures and practical classes.

Lectures, practical classes, seminars, conferences, and other interesting activities are provided for students on all training courses.

How will the classes be held?

All classes will be held online. Lectures and practical classes will be held at the specified time according to the provided schedule. Recordings of all classes will be available for those students who, for any reason, were not able to attend.

In what language will I study?

All programs are in English language.

What will happen after graduation?

EPIC Institute of Technology graduates will get a diploma and an offer to join, either as an intern or a full-time position, one of the hot EPAM projects where skills acquired at EPIC Institute of Technology will be demanded.

Please visit our website to learn more about EPIC Institute of Technology and the available programs. If you have any questions, you can quickly ask them in our chat.

Join us →
 
 
 
 
  • Vote: I like it
  • +91
  • Vote: I do not like it

»
3 weeks ago, # |
Rev. 2   Vote: I like it -6 Vote: I do not like it
»
3 weeks ago, # |
  Vote: I like it +148 Vote: I do not like it

As a tester

Spoiler
»
3 weeks ago, # |
  Vote: I like it +40 Vote: I do not like it

Testing this round was lucky to me.(Return to Candidate Master after 3 months). Hopefully all the participants also get lucky and get positive rating change in this contest.

»
3 weeks ago, # |
Rev. 2   Vote: I like it +21 Vote: I do not like it

As an amongus, suspicious

Orz jdurie ki0apa akifpatel, carrying public state school to ICPC WF

»
3 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

Luck matter much in contest as well as in life.

»
3 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

I hope this will be an EPIC round

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Rutgers-7!!!!!

»
3 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

I hope to get EPIC positive delta in this round.

»
3 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

Hope My rating is increasing

»
3 weeks ago, # |
  Vote: I like it +24 Vote: I do not like it

»
3 weeks ago, # |
  Vote: I like it +16 Vote: I do not like it

I guess having score of $$$\text{D2} < \text{D1}$$$ can result in something like this..

Spoiler

(taken from this round)

Because, some guys only aim for D1, while some guys aim for D2 first, then D1.

»
3 weeks ago, # |
  Vote: I like it +84 Vote: I do not like it

»
3 weeks ago, # |
  Vote: I like it -23 Vote: I do not like it

Would D2 be fft?

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Good luck for everyone!!!

»
3 weeks ago, # |
  Vote: I like it -35 Vote: I do not like it

This cringe "hand waving" gif had to come didn't it?

  • »
    »
    3 weeks ago, # ^ |
    Rev. 3   Vote: I like it +22 Vote: I do not like it

    it's not a "cringe hand waving gif", it's William! don't call the main character of Deltix rounds cringe:(

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Great Round

Good luck everyone :)

»
3 weeks ago, # |
  Vote: I like it +21 Vote: I do not like it

Wait isn't that the guy from the DELTIX rounds?

»
3 weeks ago, # |
  Vote: I like it +68 Vote: I do not like it

is it rated? don't downvote please, it's my birthday tomorrow

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it -48 Vote: I do not like it

    Those negative codeforces elements be like( you know who) :

    Meme
  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    Happy birthday! The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially in the round.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    One of the few troll accounts that has positive contribution. How to be so orz

»
3 weeks ago, # |
  Vote: I like it -37 Vote: I do not like it

WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!! WOOOOOOOO SOOOOOO EXCITED!!!

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    Codeforces should add a feature to automatically add too long comments in spoiler. These spams happen too often and is irritating

»
3 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

Chinese college students are sure to pass their final exams!!!

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Good luck for everyone!

»
3 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

Very Excited

»
3 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

rutgers round :o

»
3 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

Very excited! Hope to get expert!!!! orz

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Very Good Round!!!

»
3 weeks ago, # |
Rev. 2   Vote: I like it +4 Vote: I do not like it

Hope I can get back specialist. Edit: Didn't happen. Did even worse

»
3 weeks ago, # |
  Vote: I like it +22 Vote: I do not like it

You can do anything, just don't give up!

»
3 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

I hope I crush it. GL you beautiful bustards.

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

good luck

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Excited for this round.

»
3 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

Hope to Perform well and able to increase my rating

»
3 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

All the best everyone.

»
3 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

i don't know despite of registering in contest i am unable to submit solution

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I GOT TOP 200 AT ONE POINT OF THE CONTEST!!!!!!! MY DREAM CAME TRUEEEEEEEEEEEEEE

»
3 weeks ago, # |
  Vote: I like it +15 Vote: I do not like it

Problem C looks so easy yet so difficult at the same time

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    exactly

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    lol very true.. when I was reading the problem it seems easy.. but then I got very frustrated when I didn't get any optimized solution for about 1 hr xD.

»
3 weeks ago, # |
  Vote: I like it +4 Vote: I do not like it

Escalated quickly from B to C!

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    IMHO, B was way harder than C

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      dayum man, you took 9 minutes to solve C. Im sitting for 45 minutes blank

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        haha, I just came up with a very good observation, that's all. the problem is not as hard as you probably think.

        • »
          »
          »
          »
          »
          3 weeks ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          What's the solution of C?

          • »
            »
            »
            »
            »
            »
            3 weeks ago, # ^ |
            Rev. 2   Vote: I like it +2 Vote: I do not like it

            The answer is "yes" as long as there are at least (n + m — 1) / 2 '1's AND '-1's from (1, 1) to (n, m), which can be done with DP. Solution: 161065325

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

              Thank you

            • »
              »
              »
              »
              »
              »
              »
              3 weeks ago, # ^ |
                Vote: I like it +4 Vote: I do not like it

              Yeah, true. But proof didn't strike to my mind too quickly :(.

            • »
              »
              »
              »
              »
              »
              »
              3 weeks ago, # ^ |
                Vote: I like it 0 Vote: I do not like it

              Sorry for noob question but what does dp[i][j] and dp2[i][j] denotes for your DP?

              • »
                »
                »
                »
                »
                »
                »
                »
                3 weeks ago, # ^ |
                  Vote: I like it 0 Vote: I do not like it

                dp[i][j] denotes the maximum number of '1's on any path from (1, 1) to (i, j).

                dp2[i][j] denotes the maximum number of '-1's on any path from (1, 1) to (i, j).

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Not a stable contest !!! A, B, C are easy and then a big hike in the level of D !!!

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +16 Vote: I do not like it

    So you want A B C hard to your level to be a stable round?

    • »
      »
      »
      3 weeks ago, # ^ |
      Rev. 2   Vote: I like it +14 Vote: I do not like it

      I don't have a level !!!

      I just want to convey that if the problem difficulties are like (~800 + ~1000 + ~1300 + ~1600 + ~2000 + ~2500+) then it considered as stable one, because if you are pupil then you can try for 1300-1600 problems or expert then try for 2000.

      But if problem difficulties are like (~800 + ~1000 + ~1400 + ~2300 + ~2500+), then it is difficult for expert level contestant to go for 2300 directly, as it is very difficult for them.

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

        Excuse me, but since when 1300-rated C and 1600-rated D are considered a good contest?(Or a "normal", or "stable" or whatever you call it.)

        A normal round level was always 1600-1800 rated C, 1800-2200 rated D (sometimes even way harder and it's okay)

        Maybe it sounds rude, but if someone is too weak for average problem C level it means he has to become stronger, but not problem has to become easier. And I think I should disappoint you with fact that D was never expert level. Rather CM or even Master, but not expert (well, if we talk about normal contest, but not latest contests with 1600-rated D's).

        It's stupid and very sad seeing how rounds are becoming easier and easier (in most cases, not talking about each of them), and you, people get used to rounds being easier and ask for even easier problems?

        • »
          »
          »
          »
          »
          3 weeks ago, # ^ |
          Rev. 2   Vote: I like it +7 Vote: I do not like it

          I gave just an example ( JUST AN EXAMPLE, I DON'T WANT TO SAY THAT THE DIFFICULTIES SHOULD EXACT LIKE THAT ), the main issue for this contest is the difference of difficulty level between problem C and D.

        • »
          »
          »
          »
          »
          3 weeks ago, # ^ |
            Vote: I like it +11 Vote: I do not like it

          A good round in my opinion is the one in which the no. of accepted solutions of a problem is x/2 or x/3 of the accepted solutions of the previous problem. But here the accepted solutions of D1 are 10 times lesser than C. So definitely, it's not a stable contest.

          I agree with you on the part that D is CM level but it should be near around 2000-2100 at max. Also, are you seriously saying that C should be 1800? If that happens then div 2 will rather become boring (or say speedforces) till specialist level as all of them would be able to do B but hardly anyone could do C.

          Yeah, rounds are becoming easier nowadays (at least A, B and C) but it's not at all good that to make the round harder, give D, E, and F as 2300+. It's still a Div 2 round and it should be challenging for all div 2 participants rather than being challenging only for the participants who have almost reached div 1.

          • »
            »
            »
            »
            »
            »
            3 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            I'm seriously saying that, because it's not my desire to make C difficult for specialists, but because any old round has C with >= 1600 rating (with least exceptions). Yes, 1600 then isn't 1600 now, but still, average problem C then (1-2 and more years ago) is absolutely not what average C looks now. Come on, every last contest's C has 1500-3000 solves. I wouldn't call this "ballanced".

            Today's contest isn't exeption. Huge solve difference between C and D is not because D is undersolved but because C is oversolved.

            And I personally liked today's C (maybe because it brought me to top 270 today), but still number of C's solves tells a lot. Same as I liked today's D because it was indeed good difficult problem, which didn't make this div 2 a contest with 1000 D solves. (as it happened few previous contests, yes?)

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

              Well if you look at the official standings, C is solved by nearly 1850 participants, it is nice considering that it was a 6-problem contest and over 10.5k people have given the contest officially.

              I still consider D undersolved as D problem should be something which have around 500-600 AC solutions during contest. If you are comparing it with old contests, they are 5-problem contests where C comes with a rating >=1600.

              I also liked today's C as I have seen dp in C after a long time in codeforces which is a good thing. And since I was unable to get D till now so it's a good question for me. ( ̄▽ ̄)"

              • »
                »
                »
                »
                »
                »
                »
                »
                3 weeks ago, # ^ |
                  Vote: I like it 0 Vote: I do not like it

                Well, totally agree with your point

                Was glad too to solve C with dp when I'm weak at dp =)

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it +20 Vote: I do not like it

        A good round imo: 800-1000, 1100-1300, 1400-1700, 1800-2100, 2200-2500, 2600+

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Man i have no clue why i am unable to crack B, so annoying!!

Feels like im not improving at all

»
3 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

Can't solve C. Can't understand D Is it only me?

»
3 weeks ago, # |
  Vote: I like it -14 Vote: I do not like it

Nested-Loop-Forces :(

»
3 weeks ago, # |
  Vote: I like it +34 Vote: I do not like it

I solved C using bitset with O(n^3/32).

Is that the correct solution???

If yes, then C is a completely failure.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    I was thinking this too, but doesnt get idea how to implement that, surely going to look at your code

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Mine is $$$O(\frac{n^3}{64})$$$ with unsigned long long.

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it +4 Vote: I do not like it

      Is there any advantage in using unsigned long long instead of std::bitset?

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Let's look at board. There are integers $$$l$$$ and $$$r$$$, such that only for all $$$i \in [l, r]$$$, there is path with cost $$$i$$$. Calculate such $$$l$$$ and $$$r$$$ using simple dp.

    And also, bad corner case, if $$$n+m$$$ is even, the answer is No.

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      proof?

      • »
        »
        »
        »
        3 weeks ago, # ^ |
        Rev. 2   Vote: I like it 0 Vote: I do not like it

        Any path in such grid will take odd number of steps => # of 1 != # of -1

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      You will have all paths with cost $$$i$$$ for $$$i \in$$$ {$$$l,l+2,l+4 , ... , r-2, r$$$} not every path. $$$l$$$ and $$$r$$$ will be even if $$$n+m$$$ is odd so your code will still work.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I use unordered_sets with O(n^3) but it fails :C

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    Solved it by finding the maximum and minimum path, and then checking if 0 lies in between (max >= 0 and min <= 0). Not sure if it would FST, as it was a complete guess.

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      This was my guess. But it failed.

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      If you solve it this way then it implies that you could pick the sum to be any number between min and max? is that even true?

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it +4 Vote: I do not like it

        I'm guessing so. This is because if you pick any "corner" (i.e. down-to-right or right-to-down) and switch it (i.e. DTR->RTD or RTD->DTR), you'll have a delta of -2, 0, or +2 exactly in the path sum. Also, all paths would have even sum when (n+m) is odd.

        So my intuition was that you can "move" the path from minimum to maximum so that the path sum reaches to 0 at a particular point.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +12 Vote: I do not like it

    Don't know how to proof, but I think that if you can get minimum cost path as a and maximum cost path as b then you can get all the paths [a, a + 2, a + 4, ... b].

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      Hint: It's equivalent to show that any A->B path can be transformed into any other A->B path with a series of unitary operations (Only changing one square for another square).

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

      During the whole contest, I was thinking about how the fact that the numbers are just only +1 and -1 and not any arbitrary number can help solve the problem. Unfortunately for me, I could not reach this conclusion.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it -6 Vote: I do not like it

    I agree. I had to sit for a long time to get to this point, and I couldn't think of anything better. If this is the right solution — I can consider the problem to be the worst of those that I have seen.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Can you explain why C is n^3 /32? where's the 32 from?

  • »
    »
    3 weeks ago, # ^ |
    Rev. 3   Vote: I like it +6 Vote: I do not like it

    I made calculating $$$dpMIN[x][y]$$$ = minimum possible sum at $$${x, y}$$$ and $$$dpMAX[x][y]$$$ = maximum possible sum at $$${x, y}$$$. If $$$(n + m - 1)$$$ is even, then at finish position $$${n, m}$$$ we can get any value in range $$$[ dpMIN[n][m]; dpMAX[x][y] ]$$$, so we should check if $$$dpMIN[n][m] <= 0 && 0 <= dpMAX[n][m] <= 0$$$.

    It's obvious that MIN and MAX values may come from different "paths" but we can always "mix" them in some proportions to get any intermediate values.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    Intended was $$$O(n^2)$$$, but we allowed bitset $$$O(n^3/w)$$$ solution because we didn't want to raise bounds too much (and make input annoying without fastio).

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

An observation for C?

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    We just need to check if starting from (1,1) we can pick (n + m — 1)/2 number of ones. This can be done by D.P!

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      Would you mind to link your solution here? I had this idea, but no clue how to implement it in that way.

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      Wouldn't that give you complexity of 1000^2 * 500? would that TLE?

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Its an O(n*m) D.P,

        Basically you try to find maximum number of ones that you can pick on the path starting at (i, j) and ending at (n, m) for each (i,j).

        so base case is dp[n][m] which is 1 if arr[n][m] = 1 and 0 otherwise.

        and the recurrence relation is dp[i][j] = (arr[i][j] == 1) + max(dp[i+1][j], dp[i][j+1]).

        We need to take care of boundary cases properly.

  • »
    »
    3 weeks ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    I am sorry if my idea to the solution was discussed before, but I think my solution is a bit different from faraday_vij's solution.

    If the path length i.e N + M - 1 is odd, we can't make a path out of it.

    If the path length i.e N + M - 1 is even, then:

    We need (path length / 2) 1s and equal number of -1s to make the path-sum 0. I calculated the maximum number of 1s and -1s I can encounter for an arbitrary [i, j] till [N - 1, M - 1]. I kept 2 2D arrays, one which will keep count of 1s and another of -1s. Then for each [i, j], I calculated the number of 1s which I can encounter till the last cell and similarly calculated the same for -1s. Then we can either perform DFS or BFS and check for a cell, if it is possible to go till the last cell depending on the number of 1s and -1s required and taking a look from the pre-calculated array. If any cell doesnot satisfy the requirements, we can't make a path out of it, so we just cancel out this cell and try out another.

    My DFS solution: 161125001

    My BFS solution: 161118932

»
3 weeks ago, # |
  Vote: I like it +134 Vote: I do not like it

»
3 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

C (with additional restriction that all prefix sums had to be non-negative) was on leetcode: https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path/

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    This problem requires O(n^2), which makes the problem for C incorrect (the original problem was that LC problem with n=1000, but the proof that works for the current C does not work for the parentheses C so we had to make it easiser)

»
3 weeks ago, # |
Rev. 2   Vote: I like it +43 Vote: I do not like it

LMFAOOOOO. I literally guessed C after being in despair for like an hour and somehow passed pretests. Probably gonna FST, but my idea was to just keep track the min and max possible sum for each $$$(i,j)$$$ and do a normal $$$O(nm)$$$ grid DP.

EDIT: It passed systest, and the explanation below seems good.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    i did the same man. But it really felt like it's correct

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I thought about this, but I mean, min and max could be updated from two different cells, right? You can't do that

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      I still feel like the answer is continuous function, but i'm too lazy to try to prove it

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Did the same thing LOL. Hope this guess works. The only intuition I have is that maybe we can merge the paths ?

  • »
    »
    3 weeks ago, # ^ |
    Rev. 2   Vote: I like it +23 Vote: I do not like it

    Well, you can analyze the maximum path, then move the path by one block towards the minimum path and you can see that you can go through all path sums from max path to min path. This is because you can never jump by more than -2 or +2 by moving one block of the path

»
3 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

How can it be that no one thought it was a good idea to clarify in problem B statement that empty piles were not removed? This is the first time I've seen a math problem where empty piles are still piles

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone explain B and C please

  • »
    »
    3 weeks ago, # ^ |
    Rev. 2   Vote: I like it +5 Vote: I do not like it

    Problem C Define "value" of the path as the sum of its visited cells. Find the minimum value of path (call it $$$m$$$) and maximum value of path (call it $$$M$$$). If parity of length of path (i.e. $$$(n+m-1)$$$) is even and $$$m<=0$$$ and $$$M>=0$$$. Then I claim, it is possible to get every value path of even parity between $$$m$$$ and $$$M$$$. Why?

    Consider the optimal path in which minimum value is obtained. Now, I claim that any other path can be constructed by following a sequence of operations which involves deleting some block $$$(x,y)$$$ and replacing it with $$$(x+1,y)$$$ or $$$(x,y+1)$$$. Every time, the value of the path changes by $$$+2$$$ or $$$-2$$$ or $$$0$$$. This is really easy to verify by drawing on some piece of paper, I'm not going to describe a formal algorithm here.

    So to get from path value $$$m$$$ to path value $$$M$$$. You do a sequence of operations which changes the value of path by $$$0$$$, $$$+2$$$ or $$$-2$$$. So, you have to go through all paths of same parity ($$$m$$$) between $$$m$$$ and $$$M$$$.

»
3 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

Couldn't solve B. The past 3 contests have been quite bad for me.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Observe that for odd n, Mike is going to win by simply taking the entire pile in the beginning. For even n, note that Mike cannot interfere with Joe's pile and vice versa, so the one who runs out of stones after removing one at a time will lose. You can check this by finding the minimum value of the array that appears first and check whose pile it is.

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      i used this same logic yet failed the preset 161091574

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        For odd n, your solution does not always output Mike.

      • »
        »
        »
        »
        3 weeks ago, # ^ |
        Rev. 2   Vote: I like it 0 Vote: I do not like it

        oh my god, "**Note that empty piles are not removed from the circle, the number of piles always remains equal to n. If the pile from which the player has to take stones is empty, he just loses.**". Now I understand a little bit.

        I misunderstood the meaning.

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        mike wins for odd cases

        • »
          »
          »
          »
          »
          3 weeks ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          wait, why does he win for odd cases?

          • »
            »
            »
            »
            »
            »
            3 weeks ago, # ^ |
            Rev. 2   Vote: I like it 0 Vote: I do not like it

            Let Mike take all stones in the first pile. Then since $$$n$$$ is odd what ends up happening is that eventually Joe will have to pick from the first pile which is empty.

            Since the piles are nonempty at the start this strategy always works.

            Example: $$$(3, 4, 2)$$$. Mike takes $$$3$$$, Joe takes $$$x$$$, Mike takes $$$y$$$. Then Joe has to take from pile 1 which is $$$0$$$.

          • »
            »
            »
            »
            »
            »
            3 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            because Note that empty piles are not removed from the circle, the number of piles always remains equal to n. If the pile from which the player has to take stones is empty, he just loses. odd case, Mike always take all, so next time Joe will take this pile, but no stones here, so lose.

          • »
            »
            »
            »
            »
            »
            3 weeks ago, # ^ |
              Vote: I like it 0 Vote: I do not like it

            Mike can simply remove the first pile entirely, then after a full cycle, Joe is the one who ends up on the first pile and since it's empty, Joe loses.

»
3 weeks ago, # |
  Vote: I like it -15 Vote: I do not like it

And again speeeeeed forces. comment below "No Speed Forces!" "No Speed Forces!"

»
3 weeks ago, # |
  Vote: I like it +90 Vote: I do not like it
»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

In last sample case of D1, what are the 2 nodes to be able to identify any x?

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

problem C limits are not java-friendly or I did it wrong? I used recursion with memoization and some optimization conditions

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Your solution is not the intended one, it is (probably, I can't be sure because it is quite hard to read) $$$O(n^3)$$$.

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Someone please debug this https://codeforces.com/contest/1695/submission/161114594, I've absolutely no idea what is going wrong on test-5,

PS: the solution is in python3

»
3 weeks ago, # |
Rev. 2   Vote: I like it -15 Vote: I do not like it

i loved this contest ! can someone tell me if i can optimize my approach using dp in c? the idea that i got is there is exactly n + m — 1 block in any paht ( from manhatten distance) so, i do exhaustive search in the paths and find any path where number of ones = (n + m — 1) / 2 thats my submition : https://codeforces.com/contest/1695/submission/161109462 it got tle can anyone tell me if i can optimize it using dp?

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it -14 Vote: I do not like it

    i really don't give a sh_t about downvotes however i just wanna know whats wrong with you people?

»
3 weeks ago, # |
Rev. 2   Vote: I like it -6 Vote: I do not like it
void dfs(int n,int m,int i,int j,int sum){
    //cout<<i<<" "<<j<<endl;
    if(i<0 || j<0)return;
    if(i>n || j>m)return;
    if(i==n-1 && j==m-1 && sum+a[i][j]==0){
        //cout<<sum<<" "<<"hh"<<endl;
        fl = true;
    } 
    dfs(n,m,i+1,j,sum+a[i][j]);
    dfs(n,m,i,j+1,sum+a[i][j]);
}

can we optimize it by applying dp??

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    This runs in O(2^n), simply this is not intended way of doing.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Adding dp in the straightforward way is $$$O(n^3)$$$, that's not enough, you need one more observation.

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Sorry for noobosity, if we are okay with O(n^3) solution. Then what will the dp[i][j] denote in this approach? I am unable to figure out for past hour or so.

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        In the "naive" $$$O(n^3)$$$ DP solution, you need 3 parameters. $$$\mathrm{dp}[i][j][k]$$$ denotes whether it is possible to go from $$$(1, 1)$$$ to $$$(i, j)$$$ with a sum $$$k$$$.

»
3 weeks ago, # |
  Vote: I like it +149 Vote: I do not like it

Problem D is the same as APC001 E.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Do you know if they can make this contest unrated for this?

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it +8 Vote: I do not like it

      Nah, there were many cases of a problem being similar to or exactly the same as some problem on different OJs/Petrozavodsk camp/etc, and in all cases, the contest was rated.

      • »
        »
        »
        »
        3 weeks ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Thank you! If you see my rating change you would understand how important this is to me haha

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Someone showed me this to spite me, so I do the same

»
3 weeks ago, # |
  Vote: I like it +42 Vote: I do not like it

"Michael and Joe..."

What happend to Alice and Bob? Had to reread several times to get who is who. Why choose irritating naming?

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +11 Vote: I do not like it

    Joemongous

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    That doesn't matter for real. The important thing is first person win or second. You could just see the statement when you are typing the name.

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it +13 Vote: I do not like it

      They could have made the output "Output 1 if the starting player wins, else 0". But they did not.

»
3 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

I initially thought we have to ignore 0-length piles in problem B. It should have been mentioned in the problem statement itself.
Other than that problem were nice :)

»
3 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

how to solve d ?

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

    Choose any vertex with maximum degree – make this vertex a root. Than calc DP answer. DP transition is the sum of all dp values of children and if there's more than 1 son with answer equal to 0 than add (cnt — 1) to current dp value (cnt is the number of zero-sons).

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Hi, I am sorry, I still don't get it. Could you elaborate the reason behind your idea?

  • »
    »
    3 weeks ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    For any vertex with $$$k$$$ leaves($$$k > 1$$$), you must take $$$k-1$$$ of them in your query. Now for vertices with only one child which is a leaf, consider that vertex itself to be a leaf. This is because if you can identify that vertex then you can identify the leaf. Take sum over all to get answer. For the special case when the graph is a straight line, your answer is 1.

    Submission at the time of contest — https://codeforces.com/contest/1695/submission/161113603

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

In problem D1, anyone else who thought that only k was fixed, and we could use different queries for size k for different x?

»
3 weeks ago, # |
  Vote: I like it +66 Vote: I do not like it

  • »
    »
    3 weeks ago, # ^ |
    Rev. 3   Vote: I like it 0 Vote: I do not like it

    why would just mixing some algorithms together to a problem to solve it would be much more interesting that using your brain to solve something towards unique?

    And why is it a time waste in any case? After all, you voluntarily decided to spend time in the front of the computer to press some fancy buttons to gain (or lose) some virtual points that will most likely amount to nothing substantial. Your time was already ""wasted"" the second the contest began

  • »
    »
    11 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    xd

»
3 weeks ago, # |
  Vote: I like it +14 Vote: I do not like it

How to solve D1 with smaller tree size?

man C sucks.

  • »
    »
    3 weeks ago, # ^ |
    Rev. 2   Vote: I like it +5 Vote: I do not like it

    I think observation for D1 is the same as for D2 (just dp). But it's a little bit tricky to choose correct root vertex in D2. In D1 you can brute force all roots.

»
3 weeks ago, # |
  Vote: I like it +53 Vote: I do not like it

Statement of problem A sucks!!

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    In fact,even now i dont sure what problem A want to say.I just guess a way to solve it and get AC.

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    AGREE I didn't understand what this problem want XDXD

»
3 weeks ago, # |
  Vote: I like it -8 Vote: I do not like it
»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone explain C, along with the basic intuition behind it in a beginner-friendly manner? Last few contests have been pretty bad....

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

    Among all paths, compute the minimum and maximum possible sum of values. Every value between them with equal parity is possible. Why? Because any path can be transformed into any other path by repeatedly changing two consecutive moves, and each of these elementary moves changes the value by at most 2.

    But to be honest, I think this observation is quite difficult for a beginner to come up with.

»
3 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

gridforces goes brr

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Anyone can provide me any useful techniques or hints to solve problem C ? I would appreciate it

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    I mean DP is definitely a prerequisite, but this problem is more leaning towards Adhoc/observation-based, so you just have to solve a lot of problems to gain the observation skill imo.

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Problems were interesting (in the 'good difficulty level for me' sense), but something about their combination left me annoyed... like there'd definitely be people who bailed after seeing two games problems and that my brick delta wouldn't get any cushioning from their ghosts...

But, yes, it's on me to actually solve the problems... and to not be amazingly stupid for hours at a time :P

»
3 weeks ago, # |
  Vote: I like it +11 Vote: I do not like it

Can anyone explain what is the algorithm used to evaluate the source codes :)))? My solution for B was in queue for almost the entire contest and yet I have seen many other solutions being tested with submission times greater and lower than mine (not to mention that C, D1, D2 were evaluated before A)

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Problem A should be more clear.

»
3 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

just found a problem A solution passing with maximum starting from INT16_MIN, which practically means the pretests didnt even have a testcase with less than -32768 as a maximum (161068768)

wtf?

»
3 weeks ago, # |
  Vote: I like it +39 Vote: I do not like it

Ratings updated preliminarily. We will remove cheaters and update the ratings again soon!

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

how to approach D?

»
3 weeks ago, # |
  Vote: I like it -10 Vote: I do not like it

I submit the question by making a matrix of int and I got the wrong answer but later I submitted using a matrix of long i.e accepted.

According to the question aij >= -10^9 && aij <= 10^9 , but still i can store it in int. please please consider my first submitted code.

thanking you Abhinandan Kumar

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    You submitted something completely different as your solution for A.

    • »
      »
      »
      3 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      sorry, Actually by mistake I was submitting the solution from the wrong folder. thank you

»
3 weeks ago, # |
Rev. 3   Vote: I like it +1 Vote: I do not like it

can someone please explain how does bfs/memoized search work for C ? I don't seem to understand how is it not worse than O(n*m)

UPD: weak system tests again, almost all such submissions TLE on test 47 now.

»
3 weeks ago, # |
Rev. 2   Vote: I like it +3 Vote: I do not like it

Round could have been better

»
3 weeks ago, # |
Rev. 4   Vote: I like it +3 Vote: I do not like it

In this round, I have received unexpected warning from CodeForces plagiarism checker.

That says "Your solution 161070788 for the problem 1695C significantly coincides with solutions ArChErr/161069277, sadi_74/161070788, Basilhijaz/161080032."

My approach for problem C was quite straight forward.Just using dp to calculate maximum and minimum possible sum for every cell. Whoever solved the problem using this idea, it is quite possible to match their solutions. I have explored the submissions of other people from common standing, and I found other submissions that are quite similar. It does not mean that we all shared our code among us, it is just that our approaches were same.

I am requesting MikeMirzayanov and jdurie to look into this unexpected warning.

»
3 weeks ago, # |
  Vote: I like it +6 Vote: I do not like it

Today I received a message saying that my solution for problem C of Codeforces Round #801(Div-2) coincides with the solution jreddy4499/161075183 . The other user's code and my code has the same template which is openly available to anyone on Geeks for Geeks website. Link for the Template This is a clear mistake. Even the editorial's solution matches with my solution.

I request MikeMirzayanov to please look into this .

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

please someone explain me the solution for Problem-C with some other method except the editorial. I am seeing submitted solutions used bitset. How it works?? Also how to solve this problem by using idea of pathsum=0?? please help??

»
3 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

I too have received a plag message for problem C.

"Your solution 161082044 for the problem 1695C significantly coincides with solutions ZZZGen/161067422, excalibur1702/161082044, ivetrof5/161085438, Crime_and_Punishment/161088440, normie_coder/161092870, roshan2412/161110694"

The algo used is basic DP. The variable names are indeed similar but you can check my previous submissions. I've used similar variable names, as well as the same spacing / indentation / coding style in the past as this submission. Haven't used a public online IDE either.

Not to mention, ZZZGen/161067422 has the verdict "Passed" while the other submissions, including mine, are still "Skipped", which I don't understand at all.

I already contacted jdurie and he/she/they said they can't do anything about it. What should I do?

I request MikeMirzayanov to look into this matter. A few other people have also posted regarding false plag checks in this very question.

»
3 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

In this round, I received an unexpected warning from the CodeForces plagiarism checker.

That says "Your solution 161099153 161099153 for the 1695C - Zero Path significantly coincides with solutions  code_l_m/161082047(161082047).

The other user's code and my code has the same function template which is openly available to anyone on LeetCode Discuss. [https://leetcode.com/problems/minimum-path-sum/discuss/2165384/C%2B%2B-or-DP-or-O(m-*-n) ] before the contest.

I am requesting [user:MikeMirzayanov] and [user:jdurie] to look into this unexpected warning.

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

bool solve(ll i,ll j,ll s=0) { if(i==0) { ll sum=0; f(index,j+1) { sum+=arr[0][index]; } return (sum==s); } if(j==0) { ll sum=0; f(index,i+1) { sum+=arr[index][0]; } return (sum==s); } if(DP[i][j]!=-1) { return DP[i][j]; } bool ans=(solve(i-1,j,s-arr[i][j])||solve(i,j-1,s-arr[i][j])); return DP[i][j]=ans; }

int main() { FASTIO; // sieve(); // FillDivisors(); // FillFact(); // FillFactMod(); ll Test_Case=1; cin>>Test_Case; f(TestCase,Test_Case) { ll n,m; cin>>n>>m; f(i,n) { f(j,m) { cin>>arr[i][j]; DP[i][j]=-1; } } cout<<(solve(n-1,m-1)?"YES\n":"NO\n"); // cout<<"Case #"<<TestCase+1<<": "; } cout<<endl; return 0; }

Why is this giving WA ?

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Who else had a ton of WAs on B and only scored the minimum of 225 points for this problem ?

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Sample cases in question 2 was just epic

»
3 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

I've been falsely accused of plagiarism this round. Got nuked from contest. Messaged Mike about it but still haven't received a reply. Is there anything else I can do? Really sucks to be punished for no reason like this ;-;.

»
3 weeks ago, # |
Rev. 3   Vote: I like it 0 Vote: I do not like it

wonderful game!

»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Will the problem ratings be posted?

»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

The contest of eating penalties