Note that July 26th is also the date of TCO round 3A — it'd be good to avoid collisions as early as possible.

Round 1 follows regular Codeforces rules and consists of 5 problems. For this round, the complexity of the problems will be comparable to a regular Codeforces round.

Division 1 or 2?

Deleted.

sorry if this seems like a stupid question, but what does the [c] in Start[c]UP signify?

"**The top 100 in round 2 will receive a Start[c]UP 2.0 T-shirt.**" I like it :)

No unofficial participation in round 2 for those who didn't finish in top 500 in round 1?

where can i get the competition

July 27th??!! That's the first day of NOI~~!!

Is it rated??

It is said that both round will follow regular Codeforces rules, while first will last 2,5h and second 3h, I think you should mention this in an announcement.

When is the final round? I wish if you can announce this as early as possible. I live near to San Francisco, and I was invited to the final last year but I couldn't make it because I was outside the US at the contest's time.

So late in such countries as China or Japan... The previous rounds are interesting. What a pity!:(

OMG! It is 1 a.m. Monday in China...:D end at 3:30... rating updated at about 4... then go to bed... And at 7 a.m I should go to the railway station and go to school. The train will cost me 8 hours... Monday is too busy for me to have a rest! Amazing Monday!

Oh No~ 10:00AM PST， 1:00AM BEIJING

Всем привет, я начинающий спортивный программист. подскажите пожалуйста в чем ошибка. уже два чиса мучаюсь.

#include<iostream>
using namespace std;

int main()
{
  int a, b, c; cout<<"Vedite a b c";
  cin >>a; cin >>b; cin >>c;
	if(a>0)
	{
		if(b>0)
		{
			if(c > 0)
			{cout<<"a b c > 0";
			else
			{
			cout<<"c < 0";
		}
		}
		else 
		{
		cout <<"b < 0";
	}
}    else
		{cout<<"a < 0";
	}
	return 0;
	system("pause");
}

What is the programming language I can use in this competion?

Wow I have always wanted a Start[c]UP 2.0 t-shirt! Very intriguing prize! Good luck to all participants as I am at camp and will not be able to participate.

the complexity of the problems will be comparable to a regular Codeforces round

Regular Div1 or regular Div2?

I tried to register for the MemSQL constest but I got an exception "The contest does not allow self registration". Can anyone register me?

Registration is running, but it's "Private Registration" !!! What's going on!?!??! :D

When I try to register it says — "The contest does not allow self registrations".
Edit: Thanks, it is fixed.

Пацаны, а как же ДК Ворскла?

Неужели тут нет поклонников украинского футбола?

Can people in div 2 participate in this contest and be qualified for round 2 if they come in top 500 ??

Раунд будет рейтинговым для обоих дивизионов?

Just noticed that logo of memsql is very similar to that of Mumbai Indians, one of the Indian Premier League teams.

Is this for DiV 1 or DiV 2 ?

we are muslims we will be having breakfast as it is the last day in holy Ramadan :) 27th

The contest will be rated for both div1 and div2 participants?

ВКонтакте недоступен, видимо, его разработчики тоже хотят футболки :)

Anyone can tell score of problems?

This contest start at the same time of (Iftar)
It will add another 2.5 hour to 16 hour without eating :D :D

I don't think will have ocasion to continue with round 2

contest is not simple !

На чем ломали B? И как решать С?

How was problem C to be solved?

How to solve problems B, C, D, E, F ?

На чем ломали А, неужели кто-то читал эти странные длинные переборы?

Pretests were very weak again!
Lots of solutions on B, C, D will fail.........:SS

Can somebody please explain D

Contest finished! But personally, I didn't like the idea of putting the arrays of names in problem A in sample test explanation place; because I think many people (including myself) do not check the explanation when they understand the statement. Maybe it was better if they were higher.

Cmon, place your bets! Who thinks this solution will pass the final tests? Hurry up!

7269849

I got a kind of stupid solution at B and got hacked. I passed the hack 3 seconds before end of constest. :)) I hope it passed.

Edit: It passed. :)) Thanks to the hacker.

I scared I will get down rating !

Как решать E без суффиксного дерева?

Is there any particularly tricky corner case for problem B?

I see many successful hacks, but I can't come up with any special case.

Running java programs with -Xmx512m and ML 256m is evil. I've spent most of the contest trying to make sure that my E fits in ML regardless of GC behavior :(

contest really hard, hard and very hard (with me)

Как D нужно было решать? Написал решение "в лоб", упадёт на тестировании скорее всего.

UPD: Упало на тестировании.

Difficulty of problems, my impression:

A,B — div2 A

C,D — div1 B (I find D easier than C)

E,F — div1 D-E

Yet another situation (after Zepto Code Rush) where the problems are split into easy and hard ones, and time is the main tiebreaker on the easy ones. Although I don't know how many pretests there are, so I can fail on any of B,C,D during the systest.

I can write it in bold caps: MY IMPRESSION. Also, before systest.