Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with decision-problem
Search options not deleted
user 63609
For challenges which involve deciding whether or not the input meets certain criteria, and outputting some data, representing that decision.
0
votes
Determine whether strings are anagrams
awk, 63 65 bytes
It only accepts chars a-z (0141-0172). gsub counts occurrances of each char in alphabet, appends them to a variable (variable looks something like 140213000000000000..., starts with 1 …
- 763
1
vote
Yahtzee Small Straight Detection
awk, 51 chars
{for(;++i<7;)a=a gsub(i,1);exit sub(/[12]{4}/,1,a)}
Solution searches for numbers [1-6] from given string in that order, packs their frequencies to var a (11235 -> 21101), searches for …
- 763
1
vote
Count of "a"s and "b"s must be equal. Did you get it computer?
awk, 53 bytes
Solution forms pairs from the assumed beginning of as (i) and bs ((NF+1)/2)and iterates towards a's ending. Truth value is kept in a anding it with result of comparing the current pair ( …
- 763