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 test-battery
Search options not deleted
user 74571
A problem whose scoring criterion involves running the output of a program through a large number of test cases.
9
votes
Golfing Expressions
Python 3.10
import copy, collections
import math, itertools
REDUCE_COUNT = itertools.count(1)
def parse_expr(s, paren=False):
expr_vars, expr_val, expr_demoninator, expr_groups = [], None, 1, [] …
- 7,711
1
vote
Generate Matching Regexes
Python3, Score: 762/50 = 15.24 in ~30.51 seconds
import collections, re, random
def test_data():
with open('inp_d.txt') as f:
while True:
l1 = [j.strip('\n') for _ in range(10 …
- 7,711