Recent Changes - Search:

News

01.03.2021 - Registration to ACM-ICPC Timisoara Subcontest is now open

Editions

Training

Links

ACM International Collegiate Programming Contest, Subregion Timisoara, 2013

Results

  • The contest results are available here
  • A team which solved at least one problem is qualified for the 3rd phase, ACM-ICPC Romania Subcontest

Date
Friday, 17th of May, 2013, 15.00

Location
West University of Timisoara. UPT contestant meeting: 14:30 at the entry of the West University. In the case you miss this appointment, the contest labs are: 050A, 031, 032, 045C (maybe also F117)

Rules
For UPT teams, the participation condition is: the sum of the points obtained in phase one (i.e., Alexandru Rogojan Contest) by the members of a team must have the minimum value of 3. Students that did not participate in the first phase can also participate, but they must be part of a team obeying the previous rule. In exceptional situations, other teams may be accepted (each case will be analyzed by the organizers).

Registration deadline
Wednesday,15th of May, 2013, 14.00.

Registration for UPT teams
Fill the registration form available HERE. After around 10 minutes, you can check your registration HERE. Please provide correct data since it is used for your registration in the ICPC-ACM system (e.g., automatic emails will be sent in order to validate and to provide additional information for your registration!!!). You will be asked to complete your registration after your team is added to the contest.

Contest Description
The ACM-ICPC is an international programming contest in which the contestants are grouped in teams. A team has 3 members and the team has a single computer to solve all the problems. Usually, the contest duration is of 5 hours.

The subregional contest is the first selection phase. The top teams will participate at the ACM-ICPC Romanian Programing Contest (online contest). The top teams from the national phase will participate at the ACM South-Eastern European Regional Contest in Bucharest.