cerealguy's blog

By cerealguy, history, 5 days ago, translation, In English,

MemSQL Start[c]UP 3.0 Round 1 is over!

Congratulations to moejy0viiiiiv, Petr, drinkless and tourist on solving all the problems!

Here are our solutions:

Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...

Read more »

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

By cerealguy, 9 days ago, In English,

MemSQL is excited to announce Start[c]UP 3.0 – the third iteration of the programming competition hosted by Codeforces with an onsite at MemSQL HQ in San Francisco, California.

Start[c]UP 3.0 consists of two rounds. Round 1 is online and takes place on September 16th at 10:35 AM PST. Round 1 follows regular Codeforces rules and consists of at least 5 problems. For this round, the complexity of the problems will be comparable to a regular Codeforces round. There are no eligibility restrictions to participate in the round. The round will be 2.5 hours long, and will be rated.

Round 2 takes place on September 30th at 10:30 AM PST and uses regular Codeforces rules. The complexity of the problems is higher than a regular Codeforces round, the round will be 3 hours long, and will be rated. Only people who finished in the top 500 in Round 1 can participate. The top 100 in round 2 will receive a Start[c]UP 3.0 T-shirt.

For Silicon Valley residents, MemSQL will be hosting up to 25 people on-site during the second round. The winner of the on-site round will be awarded a special prize.

If you are interested in job opportunities/intern positions in MemSQL (San Francisco and Seattle) please fill in the form http://codeforces.com/memsql2017/apply or you can do it during the registration on the round.

Round 1 has started!

There are 7 problems scored as 500-750-1000-1500-2000-2750-3000. The problems were prepared by pieguy with help from cerealguy and nika. Big thanks to KAN for helping with the contest and cyand1317, gritukan, Arpa for testing.

Read more »

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

By cerealguy, 5 years ago, In Russian,

Очень много задач впихивал на Java, но на следующий спецэффект почему-то до сих пор не обращал внимания.

  1. Пишем код, использующий где-нибудь маленькую библиотечную функцию вроде Math.max
  2. Запускаем и получаем TL
  3. Копипастим эту функцию из библиотеки в свой файл и вызываем скопипасченную функцию
  4. Ускорение в несколько раз

Почему-то работает на 32-битных JVM, не проявляется на 64-битных.

Следующий код в запуске Codeforces выдал 876 125 под Java 6 и 687 125 под Java 7.

WTF?

Read more »

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

By cerealguy, 6 years ago, In Russian,

Простая задача для клуба знатоков codeforces.

Mr Bug искал на контесте число остовных деревьев и сделал забавный баг. Ко всеобщему удивлению, решение все же получило Accepted и даже прошло стресс-тестирование. Нам предоставляется код, вычисляющий определитель матрицы по простому модулю.

Внимание, три вопроса:

  • (250) Найти в коде баг.
  • (500) Функция вызывается от матрицы Кирхгофа графа, из которой удалены последняя строка и столбец. Доказать, что код работает почти правильно (за исключением бага вроде того, на котором падали в сегодняшнем SRM).
  • (1000) Сгенерировать граф, в котором не очень много ребер, и для которого получится неправильный ответ.

Read more »

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

By cerealguy, 7 years ago, translation, In English,
Hi everyone.

The today's contest is presented by us: cerealguy and yaro. We used to study in school together and Volodya studied there with us. So he will be the contest's hero: Volodya is going to cook in a kitchen, visit a museum, try to crack a safe, travel to an unusual city and even use his magical abilities.

We are grateful to the Codeforces team and especially to Artem Rakhov who helped us to prepare the contest and wrote alternative solutions.

We hope problems will suit your taste.

Good luck!

Update: Solutions

Read more »

Announcement of Codeforces Beta Round #41
 
 
 
 
  • Vote: I like it  
  • +40
  • Vote: I do not like it