All tasks

Euler Trajectory Stepper

C++HardClorvin Labs original task

The trajectory exporter needs explicit Euler updates for the supplied linear system. Implement the integration so every state in a step is computed from the preceding state.

Build the implementation in C++ under /app, with /app/run.sh as its entry point. Read one JSON request from standard input and write one JSON result to standard output. Input has finite numbers initial, a, b, positive dt and nonnegative integer steps. Starting at y=initial, update y += dt*(a*y+b) exactly steps times. Return the initial and every resulting y rounded to six decimals, without rounding internal updates. Reject invalid fields, boolean steps or nonpositive dt. Inputs are bounded so all iterates remain finite.

Reject inputs that violate an explicit validation rule with exit status 2, no standard output, and {"error":"invalid_input"} on standard error. For valid input, exit with status 0. Keep the implementation reusable for new inputs; it must work offline and must not depend on the example data being the only data it receives.

Repair or replace the unfinished /app/run.sh and add source files under /app. Malformed JSON must use the same invalid-input response. Do not read /tests or /oracle from the application.

Inspect the checks. Explore the results.

9 recorded reference checks

Review the checks and explore the evaluation view for euler trajectory stepper.

Example dataExplore the controls with illustrative values. These are not recorded GPT-5.5 or Opus 4.8 results.
Read the example values
Illustrative reward values, not model test results
AttemptGPT-5.5 (demo)Opus 4.8 (demo)
100.25
20.250.5
30.50.5
40.751
50.50.75
610.75
70.751
811

Tell us what needs doing.

Share the scope, the expected volume and your timeline.
We’ll work out where our team can help.