Talk:Solving coin problems: Difference between revisions
no edit summary
(Explain the clarification mark) |
No edit summary |
||
Line 24:
:? --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 10:49, 18 May 2013 (UTC)
==Possible Candidate for Major Revision/Deletion==
This (draft) task does not appear to be attracting implementations, indicating that it is not serving this site's purpose of being a way to compare languages via their solutions to some task. Is the task too large? Should it be split up or deleted? We want drafts to be able to gain four (preferably independent) implementations so that the task can graduate, but dumping a tricky problem and a large slab of complex code that solves it (in Perl, no less!) in is not a great way to achieve this. –[[User:Dkf|Donal Fellows]] ([[User talk:Dkf|talk]]) 16:32, 27 April 2014 (UTC)
==Suggested Simplification==
The title of this task is solving <i>coin</i> problems, therefore eradicate stamps, sandwiches, paper, and cards, as per Phix. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 13:44, 3 January 2020 (UTC)
| |||