3. Concept:
The final contest is a two-tiered competition
among teams of students representing VET
schools: one regional and another national
contest.
4. Steps:
Applying for joining to Programa-Me Contest
Teams are composed by three members
Each contest has up to sixteen teams
5. Steps:
Competing in the Contest
* There is a battery of ten problems and four
hours to solve them
* Teams will be ranked by number of solved problems.
* In case of a tie, teams with less total submission time
are ranked first.
* If there's another tie, the team that first submitted its
last accepted problem is ranked higher. In case a tie still
remains, the team that first submitted its second-last
accepted problem is ranked higher, and so on.
* Finally, it will be determined by chance if tie isn't solved.
6. Steps:
Competing in the Contest (II)
* There is an automated judge
(domJudge) which evaluate the
solutions for each problem.
*
Once
you
have
made
a
submission of a problem, you will
see the judgment in a short while,
produced by domJudge.
* Contestants will be able to send
clarification to judges, which will
be answered in a timely manner.
8. Steps:
Giving awards
* In the national contest, there are prizes for the
best three teams and for each VET school of the teams.
* The two best teams reach the national contest
*In the national one, there are awards for the best two
teams and VET schools.
9. Problem models: Robot problem
* They are based on real business problems in areas
such as manufacturing, accounting, warehouse
location, …
* Here, there is an logistics example:
We are in the robotics lab and, in order to avoid
problems, we have to implement software capable
of preventing any option to get out of the
fundamental rules of robotics.
10. Problem models: Robot problem
* Movement rules
●
The robot can move only in two dimensions.
●
Movements can be north, south, east or west.
●
The robot can move around a grid defined by the
maximum and minimum of columns and rows.
●
●
You can not go beyond the limits.
In
the
case
of
an
order
which
involves
transferring a limit in either direction, only move
the robot to the maximum possible at that
address.
●
The motor of the robot can be stopped or
running.
11. Problem models: Robot problem
* Robot commands
●
STOP_ENGINE
●
START_ENGINE
●
Nx Move northbound x positions.
●
Sx Move southbound x positions.
●
Ex Move eastbound x positions.
●
Wx Moving westbound x positions.
●
x is an integer, positive or negative.
●
The system must distinguish between uppercase
and lowercase
12. Problem models: Robot problem
* Data input
●
We assume that the robot is with the engine
running and at position -1, 3 (-1 be the column
and 3 the row).
●
As the initial position shown in the image with
one of each of the following commands cause the
robot moves to the position shown in the image
●
the order b c d e f g .... For example, after the
robot would S1 to position b, after the robot W-1
happen to position c, etc.
14. HW/SW requirements:
* At the contest, all the teams will
have a similar working environment.
Hardware:
A server with contains the domJudge
validator and a terminal for each
team with the same configurations.
Software: Debian Wheezy based
Linux Distribution with GNOME as
window manager. IDE's, browsers,
editors, compilers and debuggers.
