메뉴
当用户需要解决算法竞赛题目时使用此技能。适用于 LeetCode、Codeforces、AtCoder 等平台的题目求解、算法优化、复杂度分析。触发关键词：算法题、刷题、竞赛、时间复杂度、数据结构实现、TLE(超时)、MLE(内存超限)。
Codex 또는 Claude로 설치 이 Prompt를 복사해 Codex, Claude 또는 다른 어시스턴트에 붙여 넣으면 Skill 페이지를 검토하고 설치를 진행할 수 있습니다.
SOC 직업 분류 기준
Weekly Focus Engineering analysis using ActivityWatch data. Use when analyzing app usage patterns, detecting context switching problems, identifying "death loops" (repetitive app switching), calculating focus scores, or creating weekly productivity reviews.
WCAG 2.2 AA conformance auditor. Systematically verifies success criteria through automated, interactive, and manual testing methods.
Implement features from spec documents (context/doc required)
PR review for bugs, security & quality (requires PR URL)
Brutally honest roasts of your code with fixes
Accessibility improvement planning support. Generates organizational maturity assessment, phased roadmap, KPI design, and stakeholder persuasion materials.
| name | competitive-programming |
| description | 当用户需要解决算法竞赛题目时使用此技能。适用于 LeetCode、Codeforces、AtCoder 等平台的题目求解、算法优化、复杂度分析。触发关键词：算法题、刷题、竞赛、时间复杂度、数据结构实现、TLE(超时)、MLE(内存超限)。 |
解决算法竞赛题目，提供最优解法、复杂度分析和完整实现代码。
{
problem: string // 题目描述或链接
platform?: string // 平台名称(leetcode/codeforces/atcoder等)
language?: string // 首选编程语言(默认C++或Python)
userCode?: string // 用户已有代码(用于优化/调试)
constraints?: { // 题目约束
timeLimit?: string // 如 "1s", "2s"
memoryLimit?: string // 如 "256MB"
inputSize?: string // 如 "n ≤ 10^5"
}
}
{
analysis: {
type: string // 题目类型(DP/图论/贪心/数论等)
keyInsight: string // 核心思路
edgeCases: string[] // 需考虑的边界情况
}
solution: {
approach: string // 解法说明
complexity: {
time: string // 时间复杂度(如 O(n log n))
space: string // 空间复杂度
justification: string // 为何满足题目限制
}
code: string // 完整可执行代码
}
optimization?: string // 可选的优化建议
}
按平台规范输出代码:
代码要求: