I've solved this amazing task after 2 days and 300+ submissions :P

all submissions

Some times you solve 10 problems per day, other times you solve one problem in 10 days, either ways it's important to have fun

Do you also have similar epic stories?

Is there anyone that has submitted more submissions at the same problem?

Hey!

I think it would be cool to have a place where we could compare our heuristics for different NP problems.

Evaluating one task can be done like this: Making something like 1000 tests (or more) and placing them in a zip archive. The people than download this archive and run their program at home (without any time limit). Just like Facebook HackerCup. The grading is done by the following criteria: let's say that we are dealing with the task of the maximum clique. You need to return the size of the clique and its nodes. First of all, if there is at least one test on which the returned nodes don't form a clique, your program gets 0 points. In the other case its scoring is equal to the sum of sizes of the cliques for all of the tests.

I am talking about classical NP tasks such as: maximum clique, complete coloring, minimal cover, traveling salesman aaaaaand many more!

PS: Do you know some place to "test" NP tasks heuristics that already exists? (And to be able to compare your program performance to the performance of other programs).

Hi!

I strongly consider that Competitive Programming should be promoted better. Soooo, I made an Ad:

https://www.youtube.com/watch?v=ezVXkIbYQ-s

Enjoy!

Hi!

Is there a data structure that can perform the following queries (in logaritmic time)?:

(a) for (i = 1; i <= n; i++) A[i] += B[i]

(b) given l and r perform for (i = l; i <= r; i++) B[i] = C

(c) given i, return the value of A[i]

Thanks!

Hi!

I was playing around with sorting algorithms and came up with this ideea

vector<int> solve(vector<int> a) {
  shuffle(a.begin(), a.end(), rng); 
  int n = (int) a.size();
  bool changes = 1;
  while (changes) {
    changes = 0;
    for (int x = 1; x <= n; x *= 2) {
      for (int i = 0; i + x < n; i++) {
        if (a[i + x] < a[i]) {
          swap(a[i], a[i + x]);
          changes = 1;
        }
      }
    }
  }
  return a;
}

I am wondering how many times this code goes through the while loop

Also if you think that variations of this code (like changing the order in which we go through the powers of 2) could work better please let me know.

Thanks!

Hi!

Firstly, thanks to antontrygubO_o for the epic script!

• More Inside-Jokes

• And a breathtaking story

Here comes "Codeforces — the REAL movie"

Enjoy!

I love Codeforces and the codeforces comunity

So...I made a short funny movie about it :)

Enjoy!

Link to the movie

Update: Thanks for the positive feedback, stay tuned for part 2 which will be a lot better :)

In ejoi 2019 there was a trend of stealing doors, is it normal? :))

What is the craziest thing you have done in an olympiad?