Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. ×

Petr's blog

By Petr, 8 years ago, In English,
 
 
 
 
  • Vote: I like it
  • +15
  • Vote: I do not like it

By Petr, 8 years ago, In English,
 
 
 
 
  • Vote: I like it
  • +17
  • Vote: I do not like it

By Petr, 8 years ago, In English,
 
 
 
 
  • Vote: I like it
  • +9
  • Vote: I do not like it

By Petr, 8 years ago, In English,
 
 
 
 
  • Vote: I like it
  • +36
  • Vote: I do not like it

By Petr, 8 years ago, In English,

There's a live interview with me, tomek, Onufry Wojtaszczyk and Bartholomew Furrow in 25 minutes: https://plus.google.com/u/0/101571483150813305324/posts/DxaiBoikC8N

UPD. The interview is postponed, I'll write about new date and time :)

Read more »

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

By Petr, 8 years ago, In English,

Before systest:

  1. tomek, problems 1 and 2.
  2. Petr, problems 1 and 2.
  3. Jacob, problem 3.
  4. romanandreev, problem 2.
  5. ACRush, problem 2.
  6. tomekkulczynski, problem 2.
  7. jakubr, problem 2.
  8. RAVEman, problem 2.
  9. Somebody, problem 3.
  10. gawry, problem 1.
  11. hos.lyric, problem 1.
  12. ilyakor, problem 2.
  13. iwiwi, problem 3.
  14. Po-Ru Loh, problem 1.
  15. vepifanov, problem 2.
  16. cerealguy, problem 1.
  17. pparys, problem 1.
  18. sdya, problem 1.

After systest:

  1. romanandreev, problem 2.
  2. tomek, problem 1.
  3. ACRush, problem 2.
  4. gawry, problem 1.
  5. hos.lyric, problem 1.
  6. Petr, problem 2.
  7. cerealguy, problem 1.
  8. pparys, problem 1.

Congrats romanandreev!

Read more »

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

By Petr, 8 years ago, translation, In English,
Tags tco
 
 
 
 
  • Vote: I like it
  • +57
  • Vote: I do not like it

By Petr, 9 years ago, In English,
As usual, I'll be doing live commentary on the World Finals on http://petr-mitrichev.blogspot.com/. Here are some pictures to get started.

Read more »

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

By Petr, 9 years ago, In English,
 
 
 
 
  • Vote: I like it
  • +36
  • Vote: I do not like it

By Petr, 10 years ago, translation, In English,
Here's a problem that has appeared at a recent contest: We are given a 7 times 7 field where some of the cells have numbers between 0 and 8, inclusive, and all remaining cells have dots. We want to find such allocation of exactly 10 stars to the cells with dots, at most one star per cell, so that each cell with a number has exactly that number of stars in its 8 adjacent cells. Moreover, we will only consider such 7 times 7 fields where such allocation of 10 stars exists and is unique.

Can you create a testcase for this problem that will kill backtracking solutions? It seems pretty hard to do at such small field, but it is possible!

Here are the official rules of this challenge: http://killbacktrack.appspot.com/rules.jsp.
And here's the website where you can test your testcases, which also keeps a scoreboard: http://killbacktrack.appspot.com/.

I've got a pretty good testcase, but I don't want to reveal it yet :) Please tell if there's some problem or possible improvement to the website.

Read more »

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

By Petr, 10 years ago, In English,
You can find my impressions about beta round 2 in my blog: http://petr-mitrichev.blogspot.com/2010/02/codeforces.html

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it