Google as a supporter of the event organized a Google Hangout, so students could talk to Google engineer Mihai Stroe.

Source: http://www.youtube.com/watch?v=kS8sx6-24MU

Share and Enjoy

We have published the final results of On-site Contest.  We would like to congratulation all the contestants and all the winners!

Share and Enjoy

“The perfect computer has been developed. You just feed in your problems and they never come out again.” Al Goodman.

“If the automobile had followed the same development cycle as the computer, a Rolls-Royce would today cost $100, get a million miles per gallon, and explode once a year, killing everyone inside.” Robert X. Cringely.

“If debugging is the process of removing bugs, then programming must be the process of putting them in.”

“There are 10 types of people in the world: those who understand binary, and those who don’t.”

“My software never has bugs. It just develops random features.”

“Programmers are tools for converting caffeine into code.”

“If at first you don’t succeed; call it version 1.0″

Sources:

• http://www.wattpad.com/23832-funny-science-and-technology-quotes
• http://www.junauza.com/2010/02/top-50-funny-computer-quotes.html

Share and Enjoy

Left: Point intervals; contestants (On-site contest); Right: Point intervals and Tasks

The task selection for the contest

Work in progress...

Describe a problem story in natural language that is similar to an “everyday” life situation. This means that the story specifies a possibly infinite number of instances. Next, there are given some problems, questions that have to be solved or answered for the situation. Finally, the input data structure is specified, that typically restrict the problem to a more specific problem.

To be successful in solving the task, the contestant has to find a good algorithmic approach for the story, the input and the questions. After that, she or he must find an efficient algorithm, or a good data structure, or both that solves the task for each possible input instance. That’s not enough, they have to implement the algorithm and the data structure in general programming language, type it fast, test it and send it to the evaluation server. The server than runs the code for the set of input instances and it measures the processing times. Achieving the highest score is possible if an only if when the selected algorithm is as fast as the theoretically fastest algorithm.

Share and Enjoy

Share and Enjoy

Fort of Tata (Source: http://tata.blog.hu/)

The castle was built by the Lackfi family and had its prime under Matthias I, who had it rebuilt in Renaissance style.

In 1526 when the disastrous battle with the Turks happened and Louis II died in the battlefield, Count György Cseszneky was the chatelain of the Castle Tata. In the struggle for the throne of Hungary between Voivode John Zapolya and Archduke Ferdinand of Habs­burg, he supported Fer­dinand’s claim. However, when Zápolya’s commander Gáspár Ráskai laid siege to the Castle of Tata, Cseszneky unwillingly yielded to the su­perior force and handed the castle over.

During the Ottoman occupa­tion, the castle of Tata was an important fortress. It was cap­tured in 1529 and had many different owners in the next decades until it was burned down by the Habs­burgs in retaliation for the Rákóczi’s War for Independence. (from Wikipedia)

The Castle today it is one of the jewels of Tata. The walls of the castle reflect the marks of romantic style which is due to the Esterházy family used to live here. The building at the shore of Old Lake is a beautiful sight still today. (from the home page of the Local Government of Tata)

Share and Enjoy

Source: http://www.cartoonstock.com
/directory/s/swimming_races.asp

Share and Enjoy

Point intervals; contestants (On-site contest, 1st session)

Point intervals; contestants (Internet contest, 1st session)

Share and Enjoy

Symbol of CEOI 2012

Are you curious as to why we choose this symbol for CEOI 2012? Here you can find the answer.

Share and Enjoy

• On-site Contest
• Internet Contest.

Share and Enjoy