跳到正文
cccskills

开发技能

编码规范、框架、重构、代码审查(1.8万 个)

按价格或排序方式筛选

Get implementations and guidance for number theory algorithms used in competitive programming. The skill can provide code and explanations for modular arithmetic, greatest common divisors, Chinese remainder theorem, FFT or NTT, and related operations, along with complexity details.

中文简介正在准备中。当前显示英语简介。

  • Implement modular exponentiation or an inverse
  • Solve congruences with the Chinese remainder theorem
  • Multiply polynomials using FFT or NTT
a5c-ai/babysitter18722026年9月17日 更新

Use this skill to optimize code for competitive programming in C++, Python, or Java. It suggests language-specific changes to input handling, memory use, loops, and data layout, with an option to preserve readability and a list of applied optimizations.

中文简介正在准备中。当前显示英语简介。

  • Speeding up a competitive programming solution
  • Reducing input and output overhead
  • Reviewing memory use and data layout
a5c-ai/babysitter18722026年9月17日 更新

Choose graph algorithms for problems such as shortest paths and minimum spanning trees. The skill considers graph size, density, and edge weights, then gives a recommendation, complexity estimate, alternatives, and reasoning.

中文简介正在准备中。当前显示英语简介。

  • Choosing a shortest-path algorithm from graph constraints
  • Comparing algorithms for sparse and dense graphs
  • Selecting an approach when edge weights may be negative
a5c-ai/babysitter18722026年9月17日 更新

Generate CLI argument validation code with type coercion, constraints, custom checks, aliases, and clear error messages. It can create schemas and normalize values for languages such as TypeScript, Python, Go, and Rust.

中文简介正在准备中。当前显示英语简介。

  • Validating CLI argument types and ranges
  • Adding custom checks for command inputs
  • Normalizing aliases and input values
a5c-ai/babysitter18722026年9月17日 更新

Build suffix arrays, LCP arrays, suffix trees, and suffix automata for string processing. Choose construction algorithms and add query implementations for tasks such as pattern matching and counting distinct substrings.

中文简介正在准备中。当前显示英语简介。

  • Build a suffix array for fast pattern searches
  • Add LCP queries to a string processing solution
  • Count distinct substrings in a text
a5c-ai/babysitter18722026年9月17日 更新

Generate computational geometry code for points, lines, segments, polygons, and circles. It supports operations such as intersections, distances, orientation, and area, with attention to edge cases and numerical precision; output can target C++, Python, or Java.

中文简介正在准备中。当前显示英语简介。

  • Implementing point and vector operations
  • Checking whether lines or segments intersect
  • Calculating polygon area or centroid
a5c-ai/babysitter18722026年9月17日 更新

Work with asynchronous Rust using runtimes such as Tokio and async-std. The skill description names executor internals, pinning, and wakers as topics, and points to building high-performance async services; implementation details are pending.

中文简介正在准备中。当前显示英语简介。

  • Choosing between Tokio and async-std
  • Learning how Rust async executors work
  • Working with pinning and wakers
a5c-ai/babysitter18722026年9月17日 更新

Find and check loop invariants to support algorithm correctness proofs. The analysis can extract preconditions and postconditions, identify missing invariants, and outline a proof using initialization, maintenance, and termination properties.

中文简介正在准备中。当前显示英语简介。

  • Outlining a correctness proof for a loop
  • Checking whether a proposed invariant holds in code
  • Finding missing preconditions or postconditions
a5c-ai/babysitter18722026年9月17日 更新

Generate code for prime number sieves, primality tests, and factorization. Choose methods such as segmented or linear sieves, Miller–Rabin, and Pollard’s rho, with output that can include complexity and memory usage details.

中文简介正在准备中。当前显示英语简介。

  • 大きな範囲の素数を列挙する
  • 素数判定のコードを用意する
  • 整数の素因数分解を実装する
a5c-ai/babysitter18722026年9月17日 更新

Create a Go terminal user interface with Bubble Tea using the Elm architecture, a pattern that updates a model in response to messages. The skill scaffolds models, commands, views, components, Lip Gloss styling, and testing patterns.

中文简介正在准备中。当前显示英语简介。

  • Starting a Go terminal UI project
  • Structuring an interactive command-line interface
  • Composing reusable TUI components
a5c-ai/babysitter18722026年9月17日 更新

Implement computational geometry algorithms for programming problems, including convex hulls, intersections, closest-point pairs, triangulation, and polygon tests. The skill can provide code in C++, Python, or Java, with complexity and usage details.

中文简介正在准备中。当前显示英语简介。

  • Implementing a convex hull algorithm
  • Solving point, line, or polygon geometry problems
  • Comparing algorithm variants and complexity
a5c-ai/babysitter18722026年9月17日 更新

Generate configuration validators with Zod or JSON Schema, including defaults and clear validation errors. The examples show typed TypeScript schemas for nested settings, with parsing helpers that validate input or fill in defaults for partial configuration.

中文简介正在准备中。当前显示英语简介。

  • Validating nested application settings
  • Adding defaults to partial configuration
  • Bootstrapping a CLI or MCP tool configuration
a5c-ai/babysitter18722026年9月17日 更新

Generate utilities for moving configuration files between versions. Define upgrade and downgrade steps, reshape fields as formats change, and apply migrations up to a chosen target version, with a TypeScript pattern that checks version order.

中文简介正在准备中。当前显示英语简介。

  • Upgrading configuration files to a new format
  • Moving configuration fields into nested sections
  • Generating upgrade and downgrade steps
a5c-ai/babysitter18722026年9月17日 更新

Work on database driver and connector integration, including connection pooling, query builders, ORM setup, and abstraction layers for multiple databases. The supplied skill file is a stub, so it does not describe specific steps or supported technologies.

中文简介正在准备中。当前显示英语简介。

  • Plan a database connector integration
  • Review multi-database abstraction needs
  • Discuss ORM and connection-pooling setup
a5c-ai/babysitter18722026年9月17日 更新

Turn optimization problems into flow networks by defining nodes, edges, sources, and sinks. The skill selects suitable methods for maximum flow, minimum cuts, bipartite matching, minimum-cost flow, and circulation problems.

中文简介正在准备中。当前显示英语简介。

  • Model an assignment problem as bipartite matching
  • Represent scheduling constraints with a flow network
  • Find a maximum flow or minimum cut
a5c-ai/babysitter18722026年9月17日 更新

Design dynamic programming solutions by identifying subproblems, defining the state parameters, deriving transitions and base cases, and choosing a computation order. It can also estimate state space complexity and suggest memory optimizations such as rolling arrays or bitmask compression.

中文简介正在准备中。当前显示英语简介。

  • Define states for a dynamic programming problem
  • Derive transition formulas and base cases
  • Estimate complexity and explore memory optimizations
a5c-ai/babysitter18722026年9月17日 更新

Choose a data structure by comparing the operations a program needs, how often they occur, and time or memory limits. Get a recommendation with complexity estimates, alternatives, trade-offs, and possible extensions for custom requirements.

中文简介正在准备中。当前显示英语简介。

  • Choose a structure for insert, delete, and search
  • Compare options for range queries and updates
  • Balance runtime and memory constraints
a5c-ai/babysitter18722026年9月17日 更新

Analyze code to estimate how its running time and memory use grow as inputs get larger. The skill examines loops, recursion, calls, and data structures, then provides Big-O results with derivations and possible optimization ideas across several programming languages.

中文简介正在准备中。当前显示英语简介。

  • Checking an algorithm’s time and space costs
  • Comparing multiple implementations
  • Finding loop or recursion bottlenecks
a5c-ai/babysitter18722026年9月17日 更新

Calculate combinatorial values for programming problems, including permutations, combinations, factorials, and special number sequences. Apply modular arithmetic and techniques such as Lucas theorem and inclusion-exclusion to handle counting tasks.

中文简介正在准备中。当前显示英语简介。

  • Calculating nCr or nPr under a modulus
  • Computing Catalan, Stirling, or Bell numbers
  • Handling large combination counts with Lucas theorem
a5c-ai/babysitter18722026年9月17日 更新

Manage reusable competitive programming templates in C++, Python, and Java. Retrieve or organize algorithm and data structure snippets, customize a personal library, and generate problem specific starter code for contests.

中文简介正在准备中。当前显示英语简介。

  • Prepare fast input and output code for a contest
  • Retrieve a segment tree or graph algorithm template
  • Generate starter code for a specific problem
a5c-ai/babysitter18722026年9月17日 更新

Integrate an MCP App UI with its host’s theme, fonts, and layout context. Apply host CSS variables with fallbacks, respond to theme changes, account for embedded safe areas, and configure embedded or fullscreen display modes.

中文简介正在准备中。当前显示英语简介。

  • Matching an MCP App to its host’s colors and fonts
  • Updating the UI when the host theme changes
  • Adding safe area padding in embedded views
a5c-ai/babysitter18722026年9月17日 更新

Set up an MCP App project with its server and UI entry points, dependencies, build scripts, and directory layout. Choose templates for React, Vanilla JS, Vue, Svelte, Preact, or Solid, using the SDK’s reference code to guide the scaffold.

中文简介正在准备中。当前显示英语简介。

  • Starting a new MCP App project
  • Choosing a framework for an MCP App UI
  • Creating server and client entry points
a5c-ai/babysitter18722026年9月17日 更新

Get implementations and guidance for advanced data structures used in competitive programming and complex algorithm problems. The skill covers balanced trees, persistent structures, tree decompositions, and range-query tools, with usage notes and complexity information.

中文简介正在准备中。当前显示英语简介。

  • Implementing a treap or splay tree
  • Answering range queries with a wavelet tree
  • Handling dynamic tree operations
a5c-ai/babysitter18722026年9月17日 更新

Build the core Tool and Resource pattern for MCP Apps: connect tools to UI resources, pass structured data to the interface, and provide text responses for hosts without UI support. Includes app-only helper tools and shared resources.

中文简介正在准备中。当前显示英语简介。

  • Connecting an MCP tool to an interactive UI resource
  • Providing structured data and a text fallback
  • Adding UI-only tools for pagination or updates
a5c-ai/babysitter18722026年9月17日 更新