v0.40: Create exercises. Challenge the community.

route_loop_length

Your mission

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

See it in action

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

Expected result

6.00$

Your checklist

For your own tracking. Tests grade your code.

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.

More examples

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

Expected result

10.00$

Constraints

Expected files

route_loop_length.c

Allowed functions

writesqrtfgetlinefscanfferrorfeoffabsffprintfmalloccallocreallocfreestdinstdoutstderr

route_loop_length

Arrays and matrices

Your mission

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

See it in action

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

Expected result

6.00$

Your checklist

For your own tracking. Tests grade your code.

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.

More examples

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

Expected result

10.00$

Constraints

Expected files

route_loop_length.c

Allowed functions

writesqrtfgetlinefscanfferrorfeoffabsffprintfmalloccallocreallocfreestdinstdoutstderr

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01Rectangle routeWaiting

02Two pointsWaiting

03Right triangleWaiting

04Collinear pointsWaiting

05Shortest route differs from input orderWaiting

06Decimal and negative coordinatesWaiting

07Empty inputWaiting

08Single pointWaiting

route_loop_length

Your mission

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

See it in action

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

Expected result

6.00$

Your checklist

For your own tracking. Tests grade your code.

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.

More examples

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

Expected result

10.00$

Constraints

Expected files

route_loop_length.c

Allowed functions

writesqrtfgetlinefscanfferrorfeoffabsffprintfmalloccallocreallocfreestdinstdoutstderr

route_loop_length

Arrays and matrices

Your mission

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

See it in action

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

Expected result

6.00$

Your checklist

For your own tracking. Tests grade your code.

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.

More examples

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

Expected result

10.00$

Constraints

Expected files

route_loop_length.c

Allowed functions

writesqrtfgetlinefscanfferrorfeoffabsffprintfmalloccallocreallocfreestdinstdoutstderr

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01Rectangle routeWaiting

02Two pointsWaiting

03Right triangleWaiting

04Collinear pointsWaiting

05Shortest route differs from input orderWaiting

06Decimal and negative coordinatesWaiting

07Empty inputWaiting

08Single pointWaiting

v0.40: Create exercises. Challenge the community.

Meet Studio →