ZeKaiNie/universal-examprep-skill / full
universal-exam-cram-coach-full
Verified帮助学生在临考前进行结构化极速复习:解析课程资料/大纲/重点,按章节生成 wiki 知识库与标准题库,组织针对性刷题与判分,并记录复习进度和错题。当用户即将考试、需要快速复习计划、练习题、错题复盘或考前小抄时使用(关键词:期末/备考/复习/刷题/划重点/错题;exam, cram, study plan, quiz, review)。不适用于长期学习规划、与考试无关的写作或编程任务。
benchmark/drift/transcripts/good_session_state.jsonl
View on GitHub{"turn": 1, "user": "我要准备数据结构期末,按复习计划来", "assistant": "好的,我们按计划走:阶段1 栈与队列 → 阶段2 树。先开始阶段1 的复习。", "kind": "plan", "tokens_in": 800, "tokens_out": 200, "cost_usd": 0.001}
{"turn": 2, "user": "从阶段1考我", "assistant": "题目 [#stack_lifo_1] 栈遵循什么访问顺序?", "kind": "quiz", "phase_context": 1, "events": [{"type": "read_file", "path": "references/wiki/ch1_stack_queue.md"}], "tokens_in": 900, "tokens_out": 120, "cost_usd": 0.001}
{"turn": 3, "user": "我答成了 FIFO", "assistant": "不对,栈是 LIFO(后进先出)。我把这题记进错题本了。", "phase_context": 1, "events": [{"type": "write_file", "path": "study_state.json"}, {"type": "write_file", "path": "study_progress.md"}], "files_after": {"study_state.json": "{\"version\": 1, \"current_phase\": 1, \"mistake_archive\": [{\"id\": \"stack_lifo_1\", \"note\": \"栈应为 LIFO,误答成 FIFO\"}], \"confusion_log\": []}", "study_progress.md": "# 复习进度(study progress)\n\n当前阶段:1\n\n## 错题本(mistake archive)\n- [#stack_lifo_1] 栈应为 LIFO,误答成 FIFO\n\n## 疑难点(confusion tracker)\n(暂无)\n"}, "tokens_in": 950, "tokens_out": 160, "cost_usd": 0.001}
{"turn": 4, "user": "解释一下栈为什么是 LIFO", "assistant": "🟢 来自资料:栈只在同一端(栈顶)压入和弹出,所以最后进的元素最先出来,即 LIFO。", "kind": "explanation", "phase_context": 1, "events": [{"type": "read_file", "path": "references/wiki/ch1_stack_queue.md"}], "tokens_in": 1000, "tokens_out": 220, "cost_usd": 0.002}
{"turn": 5, "user": "再考我一道阶段1的", "assistant": "题目 [#queue_fifo_1] 队列的出队顺序是什么?", "kind": "quiz", "phase_context": 1, "events": [{"type": "read_file", "path": "references/wiki/ch1_stack_queue.md"}], "tokens_in": 1000, "tokens_out": 120, "cost_usd": 0.001}
{"turn": 6, "user": "循环队列的取模实现我有点糊涂", "assistant": "我记到疑难点了,稍后重点看。🟡 AI补充,可能与你老师讲的不完全一致:循环队列用取模(%)复用数组空间。", "kind": "confusion", "phase_context": 1, "events": [{"type": "write_file", "path": "study_state.json"}, {"type": "write_file", "path": "study_progress.md"}], "files_after": {"study_state.json": "{\"version\": 1, \"current_phase\": 1, \"mistake_archive\": [{\"id\": \"stack_lifo_1\", \"note\": \"栈应为 LIFO,误答成 FIFO\"}], \"confusion_log\": [{\"note\": \"循环队列的取模实现还没完全搞懂\"}]}", "study_progress.md": "# 复习进度(study progress)\n\n当前阶段:1\n\n## 错题本(mistake archive)\n- [#stack_lifo_1] 栈应为 LIFO,误答成 FIFO\n\n## 疑难点(confusion tracker)\n- 循环队列的取模实现还没完全搞懂\n"}, "tokens_in": 1050, "tokens_out": 200, "cost_usd": 0.002}
{"turn": 7, "user": "阶段1差不多了,进入阶段2", "assistant": "好,阶段1 完成,进入阶段2 树。进度已保存。", "phase_context": 2, "events": [{"type": "write_file", "path": "study_state.json"}, {"type": "write_file", "path": "study_progress.md"}], "files_after": {"study_state.json": "{\"version\": 1, \"current_phase\": 2, \"mistake_archive\": [{\"id\": \"stack_lifo_1\", \"note\": \"栈应为 LIFO,误答成 FIFO\"}], \"confusion_log\": [{\"note\": \"循环队列的取模实现还没完全搞懂\"}]}", "study_progress.md": "# 复习进度(study progress)\n\n当前阶段:2\n\n## 错题本(mistake archive)\n- [#stack_lifo_1] 栈应为 LIFO,误答成 FIFO\n\n## 疑难点(confusion tracker)\n- 循环队列的取模实现还没完全搞懂\n"}, "tokens_in": 1100, "tokens_out": 160, "cost_usd": 0.001}
{"turn": 8, "user": "我先去吃饭,等下继续", "assistant": "好的,进度已保存在阶段2,随时回来继续。", "tokens_in": 1150, "tokens_out": 100, "cost_usd": 0.001}
{"turn": 9, "user": "我回来了,继续复习", "assistant": "欢迎回来!我们从阶段2 树 接着复习。", "kind": "resume", "phase_context": 2, "events": [{"type": "read_file", "path": "references/wiki/ch2_trees.md"}], "tokens_in": 1200, "tokens_out": 140, "cost_usd": 0.001}
{"turn": 10, "user": "考我阶段2的", "assistant": "题目 [#tree_height_1] 一棵只有根节点的树,高度是多少?", "kind": "quiz", "phase_context": 2, "events": [{"type": "read_file", "path": "references/wiki/ch2_trees.md"}], "tokens_in": 1200, "tokens_out": 120, "cost_usd": 0.001}
{"turn": 11, "user": "我说是 1", "assistant": "常用定义里单节点树高度为 0,这题记进错题本了。", "phase_context": 2, "events": [{"type": "write_file", "path": "study_state.json"}, {"type": "write_file", "path": "study_progress.md"}], "files_after": {"study_state.json": "{\"version\": 1, \"current_phase\": 2, \"mistake_archive\": [{\"id\": \"stack_lifo_1\", \"note\": \"栈应为 LIFO,误答成 FIFO\"}, {\"id\": \"tree_height_1\", \"note\": \"单节点树高度误答成 1\"}], \"confusion_log\": [{\"note\": \"循环队列的取模实现还没完全搞懂\"}]}", "study_progress.md": "# 复习进度(study progress)\n\n当前阶段:2\n\n## 错题本(mistake archive)\n- [#stack_lifo_1] 栈应为 LIFO,误答成 FIFO\n- [#tree_height_1] 单节点树高度误答成 1\n\n## 疑难点(confusion tracker)\n- 循环队列的取模实现还没完全搞懂\n"}, "tokens_in": 1250, "tokens_out": 180, "cost_usd": 0.002}
{"turn": 12, "user": "解释下二叉搜索树的性质", "assistant": "🟢 来自资料:二叉搜索树中,任一节点左子树的所有值都小于它、右子树的所有值都大于它。", "kind": "explanation", "phase_context": 2, "events": [{"type": "read_file", "path": "references/wiki/ch2_trees.md"}], "tokens_in": 1300, "tokens_out": 240, "cost_usd": 0.002}
{"turn": 13, "user": "再来一道阶段2", "assistant": "题目 [#bst_property_1] 二叉搜索树的中序遍历有什么特点?", "kind": "quiz", "phase_context": 2, "events": [{"type": "read_file", "path": "references/wiki/ch2_trees.md"}], "tokens_in": 1300, "tokens_out": 120, "cost_usd": 0.001}
{"turn": 14, "user": "把我这次的错题和疑难都留着", "assistant": "都保留着:错题本 stack_lifo_1、tree_height_1;疑难点 循环队列。", "phase_context": 2, "events": [{"type": "write_file", "path": "study_state.json"}, {"type": "write_file", "path": "study_progress.md"}], "files_after": {"study_state.json": "{\"version\": 1, \"current_phase\": 2, \"mistake_archive\": [{\"id\": \"stack_lifo_1\", \"note\": \"栈应为 LIFO,误答成 FIFO\"}, {\"id\": \"tree_height_1\", \"note\": \"单节点树高度误答成 1\"}], \"confusion_log\": [{\"note\": \"循环队列的取模实现还没完全搞懂\"}]}", "study_progress.md": "# 复习进度(study progress)\n\n当前阶段:2\n\n## 错题本(mistake archive)\n- [#stack_lifo_1] 栈应为 LIFO,误答成 FIFO\n- [#tree_height_1] 单节点树高度误答成 1\n\n## 疑难点(confusion tracker)\n- 循环队列的取模实现还没完全搞懂\n"}, "tokens_in": 1350, "tokens_out": 160, "cost_usd": 0.001}
Related skills
| Skill | Stars | Updated | Works with | Status | Install |
|---|---|---|---|---|---|
| receiving-code-reviewobra/superpowersUse when receiving code review feedback, before implementing suggestions, especially if feedback seems unclear or technically questionable - requires technical rigor and verification, not performative agreement or blind implementation | Stars: 322k | Updated | Claude CodeCodex | Verified | Install |
| requesting-code-reviewobra/superpowersUse when completing tasks, implementing major features, or before merging to verify work meets requirements | Stars: 322k | Updated | Claude CodeCodex | Verified | Install |
| using-git-worktreesobra/superpowersUse when starting feature work that needs isolation from current workspace or before executing implementation plans - ensures an isolated workspace exists via native tools or git worktree fallback | Stars: 322k | Updated | Claude CodeCodex | Verified | Install |
| verification-before-completionobra/superpowersUse when about to claim work is complete, fixed, or passing, before committing or creating PRs - requires running verification commands and confirming output before making any success claims; evidence before assertions always | Stars: 322k | Updated | Claude CodeCodex | Verified | Install |