Yandex.Algorithm 2013: test round
By lperovskaya, 11 years ago, translation, In English

June 27 is an important date – that’s when the test round of Yandex.Algorithm kicks off. Don’t miss your chance to register, so you can be in the running for a place in the final round, which takes place on August 21-23, 2013 in St. Petersburg. The final round venue is truly unusual for such an IT event – the palace of Grand Duke Vladimir, built in 1870, will welcome finalists with all its historical charm.

In the final round, the best participants will be left one-on-one with the testing system – no internet connection or prewritten code, only properly set-up computers and IDEs. We will provide text coverage of the round.

If you want to be part of the action, don’t leave your registration to the last minute – remember, the test round starts tomorrow.

More good news: we decided to almost double the number of T-shirts. The best 75 non-finalists among participants of the elimination stage, another 75 random participants of the elimination stage who successfully submit a correct solution to at least one problem and, of course, all finalists will receive an exclusive Yandex.Algorithm T-shirt.

UPD: The test round is available for participants now: http://algorithm.contest.yandex.com/contest/306.

Current standings are open for everyone: http://algorithm.contest.yandex.com/contest/306/standings.

UPD2: Official results are avaliable on the official website

UPD3: Round archive is avaliable at the official website

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

Comments Comments (38)
| Write comment?
»
11 years ago, # |
  Vote: I like it +10 Vote: I do not like it

is this contest for Russian only ?

→ Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    Not at all, statements and the official web site are avaliable in English as well. You can switch the language using button on the bottom of any page of official website or during the registration process.

    → Reply
»
11 years ago, # |
  Vote: I like it +2 Vote: I do not like it

I think I'm encountering 404…

→ Reply
»
11 years ago, # |
  Vote: I like it +3 Vote: I do not like it

I am very glad to see that organizers decided to provide more T-shirts as prizes. I think it will greatly enhance the enthusiasm of contestants.

→ Reply
»
11 years ago, # |
← Rev. 2   Vote: I like it +5 Vote: I do not like it

registration page is in russian .......how .i can register and there is no link..4 english ver

→ Reply
»
11 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Where is the contest link?

→ Reply
»
11 years ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

2337 submission for problem A only 109 got Accepted !!!

most people had precision errors

even I used a user-defined function for comparing that didn't work

long double aabs(long double a){
	if(a>0){
		return a;
	}
	return -a;
}
long double EP=0.0000001;
bool is_equal(long double a,long double b){
	if(aabs(a-b)<EP){
		return true;
	}
	return false;
}
→ Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Maybe someone could comment how to solve A? Especially those, who got it right at the first attempt.

    → Reply
    • »
      »
      »
      11 years ago, # ^ |
      ← Rev. 3   Vote: I like it +5 Vote: I do not like it

      , so you can just compute fractions with integer numerators and denominators and find the fraction with the most occurrences in the multiset. (I've got it right at the second attempt, but only because I used stdin/stdout instead of files in my first submission).

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

        do you mean R=(abc)/(4*S) or R=(4*abc)/(S)

        → Reply
        • »
          »
          »
          »
          »
          11 years ago, # ^ |
            Vote: I like it +2 Vote: I do not like it

          Of course , it was a small typo.

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

            you didn't fix the other fraction in your comment :)

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

          It does not matter for solving :)

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

            actually yes it's like you multiplied all fractions with 16

            → Reply
      • »
        »
        »
        »
        11 years ago, # ^ |
        ← Rev. 3   Vote: I like it 0 Vote: I do not like it

        a and b and c themselves may not be integers how can we save the numerator in integer variable ?

        Edit: oops got it now , also S may not be integer but 16*S is always an integer

        → Reply
        • »
          »
          »
          »
          »
          11 years ago, # ^ |
          ← Rev. 2   Vote: I like it 0 Vote: I do not like it

          a2 = (x2 - x1)2 + (y2 - y1)2, and so on. (2S)2 = ((x1 - x0)·(y2 - y0) + (x2 - x0)·(y1 - y0))2.

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

        But numerator's maximum value can be  (1400)^6 which will cause overflow even for unsigned long long int. How to store the value?

        → Reply
»
11 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Can i have the test case 9 for problem A?

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

    Tests are usually not disclosed in this type of competitions. It decreases motivation to prove your theoretical solution and test/debug your code.

    → Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it +21 Vote: I do not like it

    We decided to publish the competition archive, you can find it at the competition site

    → Reply
»
11 years ago, # |
  Vote: I like it +7 Vote: I do not like it

how to solve D?

→ Reply
»
11 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Will there be an editorial for this contest?

→ Reply
»
11 years ago, # |
  Vote: I like it +16 Vote: I do not like it

Hi

I'm advanced, but can I participate in the Qualification round?

→ Reply
»
11 years ago, # |
  Vote: I like it +34 Vote: I do not like it

seems awesome but what is Yandex

→ Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    It's the 4th largest search engine in the world, surpassing Bing recently by the number of searches and succesfully competing with Google in Russia for many years. You can read more here and here and here

    → Reply
»
11 years ago, # |
  Vote: I like it +16 Vote: I do not like it

Problem E: submitted a program that outputs nothing.

Accepted.

→ Reply