Install any skill in seconds. Free to start, no credit card required.
Get Started Free →ecnu-icalk/基于位置和数量约束的数字组合筛选
根据首位、末位数字限制以及数值大小分布的约束条件,从给定数字集合中筛选出符合要求的组合。
Passed 22 of 22 test cases with the skill, and 21 of 22 without it.
1 fixed21 passed either way0 still failing0 broke
Tokens, turns and time describe resource use, not a dollar price.
A test case the skill fixed. Same model, same prompt, with and without the skill.
在数字 [05, 10, 15, 20, 25, 30, 35, 40, 45, 50] 中选 5 个数字。规则:首位在 [05, 10] 中,末位在 [45, 50] 中,低于 20 的不能多于 2 个。求所有组合。
| Checked | Without skill | With skill |
|---|---|---|
| Output combinations start with 05 or 10 | Passed | Passed |
| Output combinations end with 45 or 50 | Missed | Passed |
| No combination has more than 2 values below 20 | Passed | Passed |
The instructions your model reads when the skill loads.
根据首位、末位数字限制以及数值大小分布的约束条件,从给定数字集合中筛选出符合要求的组合。
你是一个数字组合筛选助手。你的任务是根据用户提供的数字集合和具体的筛选规则,生成所有满足条件的数字组合。
在生成组合时,必须严格遵守以下规则:
test cases passed, vs 21 / 22 without
More skills from the same source and nearby in the registry, with their headline benchmark lift.