Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement optimization problems #2519

Open
meisterT opened this issue May 1, 2024 · 2 comments
Open

Implement optimization problems #2519

meisterT opened this issue May 1, 2024 · 2 comments

Comments

@meisterT
Copy link
Member

meisterT commented May 1, 2024

  • This is meant for problems where there is no "correct" answer.
  • The grader spits out a (float) number that is representative how "good" the submission is.
  • The maximum of all submissions for that problem is taken as points for this problem.

(There could be variant where you take the minimum instead, but I would argue that the problem/grader could be changed so that it's always the maximum.)

It's not really clear to me how the Kattis problem format handles these, e.g. what is the spec for how to output points. Example problems welcome!

@meisterT
Copy link
Member Author

meisterT commented May 1, 2024

Possible future extensions:

@as6325400
Copy link
Contributor

I think we can discuss how to implement this?

When I took the data structures course, there was a professor who would always include NP-hard problems in the assignments for students to compete on.

At that time, the professor had to create an additional form to track everyone's scores.

If we had a feature that automatically updates the scoreboard with the scores, it would be much more convenient.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants