route_loop_length

Arrays and matrices32

Objective

Write a program that computes the shortest closed route through a set of two-dimensional points.

Steps

Read coordinates from standard input, one point per line.
Each point is formatted as x, y, where both values are floating-point numbers.
The route must visit every point exactly once and then return to the starting point.
Print the shortest route length with exactly two digits after the decimal point.
The input contains at most eleven points.
For an empty input, print 0.00 followed by a newline.
Link with the math library when using sqrtf.

examples

$ printf '0, 0\n2, 0\n2, 1\n0, 1\n' | ./route_loop_length | cat -e

6.00$

$ printf '0, 0\n3, 4\n' | ./route_loop_length | cat -e

10.00$

Constraints

Expected files

route_loop_length.c

Allowed functions

writesqrtfgetlinefscanfferrorfeoffabsffprintfmalloccallocreallocfreestdinstdoutstderr

Tests

Run the tests to grade your code

Build

01Rectangle route

02Two points

03Right triangle

04Collinear points

05Shortest route differs from input order

06Decimal and negative coordinates

07Empty input

08Single point

route_loop_length

Objective

Write a program that computes the shortest closed route through a set of two-dimensional points.

Steps

Read coordinates from standard input, one point per line.
Each point is formatted as x, y, where both values are floating-point numbers.
The route must visit every point exactly once and then return to the starting point.
Print the shortest route length with exactly two digits after the decimal point.
The input contains at most eleven points.
For an empty input, print 0.00 followed by a newline.
Link with the math library when using sqrtf.

examples

$ printf '0, 0\n2, 0\n2, 1\n0, 1\n' | ./route_loop_length | cat -e

6.00$

$ printf '0, 0\n3, 4\n' | ./route_loop_length | cat -e

10.00$

Constraints

Expected files

route_loop_length.c

Allowed functions

writesqrtfgetlinefscanfferrorfeoffabsffprintfmalloccallocreallocfreestdinstdoutstderr

route_loop_length

Arrays and matrices32

Objective

Write a program that computes the shortest closed route through a set of two-dimensional points.

Steps

Read coordinates from standard input, one point per line.
Each point is formatted as x, y, where both values are floating-point numbers.
The route must visit every point exactly once and then return to the starting point.
Print the shortest route length with exactly two digits after the decimal point.
The input contains at most eleven points.
For an empty input, print 0.00 followed by a newline.
Link with the math library when using sqrtf.

examples

$ printf '0, 0\n2, 0\n2, 1\n0, 1\n' | ./route_loop_length | cat -e

6.00$

$ printf '0, 0\n3, 4\n' | ./route_loop_length | cat -e

10.00$

Constraints

Expected files

route_loop_length.c

Allowed functions

writesqrtfgetlinefscanfferrorfeoffabsffprintfmalloccallocreallocfreestdinstdoutstderr

Tests

Run the tests to grade your code

Build

01Rectangle route

02Two points

03Right triangle

04Collinear points

05Shortest route differs from input order

06Decimal and negative coordinates

07Empty input

08Single point