Token导航 LogoToken导航TokenDH.com
运维和基础设施只读github未标认证来源可访问clear审计通过

xcpc-jiangly-stylexcpc 江南风格

Agent Skill

xcpc-jiangly-style 用于处理 GitHub 仓库、Issue、Pull Request 和代码协作信息,适合在 Codex、Claude、Cursor、Gemini CLI 中需要围绕仓库状态、代码变更或协作事项进行整理时使用。可结合来源仓库、安装命令和原始 README 继续核验具体用法。安装前建议确认权限范围、维护状态,以及是否会触发联网、命令执行或文件读写。

总安装

329

周安装

14

GitHub Stars

2

下载量

115
CodexClaudeCursorGemini CLI

安装说明

本站只整理中文说明和来源信息,不托管安装包,也不代用户安装。

GitHub

来源数

3

许可证

MIT

最后核验

2026-05-01

来源状态

来源可访问

安装方式

通过对话安装

复制提示词发给支持本地命令或 Skills 的 AI 助手,先确认命令和权限,再让它执行。

请帮我安装这个 Agent Skill:xcpc-jiangly-style(xcpc 江南风格)
来源仓库:https://github.com/lihaoze123/my-skills
仓库路径:skills/xcpc-jiangly-style
安装命令:
npx skills add https://github.com/lihaoze123/my-skills --skill xcpc-jiangly-style
安装前请先检查当前环境是否支持对应 CLI,并向我确认将要执行的命令、安装目录、联网范围和文件读写权限;确认后再执行。

命令行安装

复制命令到本机终端执行。不同来源提供的安装方式可能略有差异;本站展示可直接复制的安装命令,安装前请核对来源页面。

skills.shnpx skills
npx skills add https://github.com/lihaoze123/my-skills --skill xcpc-jiangly-style

简介

xcpc-jiangly-style 用于处理 GitHub 仓库、Issue、Pull Request 和代码协作信息。

  • 适合在 Codex、Claude、Cursor、Gemini CLI 中围绕仓库状态、代码变更或协作事项进行整理。
  • 通过 npx skills add 命令从指定 GitHub 仓库安装,需结合原始 README 核验具体用法。
  • 安装前建议确认权限范围、维护状态,以及是否会触发联网、命令执行或文件读写。
  • 当前功能描述基于仓库公开信息,实际能力以源码和文档为准。

SKILL.md

XCPC: jiangly C++ Style

Overview

Proven C++ coding style from jiangly's Codeforces submissions. Focuses on safety, maintainability, and modern C++ features for competitive programming.

Core principle: Zero global pollution, zero global arrays, explicit types, modern C++.

When to Use

  • Writing C++ solutions for Codeforces, ICPC, AtCoder, etc.
  • Creating competitive programming templates
  • Reviewing contest solutions
  • Teaching competitive programming best practices

Don't use for:

  • Production C++ code (different requirements)
  • Non-competitive programming projects

MANDATORY WORKFLOW - READ BEFORE WRITING CODE

This skill enforces strict adherence to jiangly's coding style. You MUST follow this workflow:

Step 1: Consult Rules Before Writing

Before writing ANY code, you MUST:

  1. Read the relevant rule files in rules/ directory based on your task
  2. Check Red Flags table below to avoid common mistakes
  3. Reference examples from rule files - they are the source of truth

Step 2: Match Rule Requirements

For each code decision, verify against rules:

TaskRule FileKey Points
Variable namingrules/naming.mdsnake_case, uppercase for temp count arrays (S, T)
String operationsrules/in-place-operations.mdreserve(), swap() for reuse
Temporary arraysrules/scope-control.mdBlock scopes {}, timely release
Logical operatorsrules/formatting.mdUse and, or, not keywords
Loop comparisonsrules/minimal-code.mdSymmetric patterns: s[i] <= t[j]
Memory usagerules/in-place-operations.mdvis arrays, no duplicate containers
Function designrules/struct-patterns.mdConstructors, const correctness

Step 3: Verify Against Red Flags

Before finalizing code, check EVERY row in the Red Flags table below.

If any pattern matches, you MUST fix it before output.

Step 4: Self-Correction Checklist

After writing code, verify:

  • No using namespace std;
  • No global arrays (all in solve())
  • Used using i64 = long long;
  • Used and/or/not instead of &&/||/!
  • Used std:: prefix everywhere
  • 4-space indentation, K&R braces
  • No line compression (one statement per line)
  • Used "\n" not std::endl
  • Large temporary arrays in block scopes {}
  • Strings preallocated with reserve() when size known
  • Used swap() for O(1) variable reuse
  • Used push_back() for single characters, not +=
  • Symmetric comparison patterns (a[i] <= b[j])
  • Uppercase names for temporary count arrays (S, T)
  • Use iota + lambda for index-value sorting, not structs
  • Loop variables initialized in for header when possible
  • Output uses " \n"[i == n - 1] for space-separated values

Rule Files are PRIMARY Reference

The Quick Reference table below is a summary. Rule files contain the complete, authoritative examples. When in doubt, read the rule file.


CategoryRuleFile
NamespaceNever using namespace std;no-global-namespace
ArraysZero global arrayszero-global-arrays
TypesUse using i64 = long long;explicit-types
IndexingFollow problem's natural indexingkeep-indexing-consistent
I/ODisable sync, use \nfast-io
Namingsnake_case for vars, PascalCase for structsnaming
MinimalAvoid unnecessary variables, merge conditionsminimal-code
Formatting4-space indent, K&R braces, no line compressionformatting
SimplicityPrefer simple data structuressimplicity-first
MemoryUse in-place operationsin-place-operations
ScopeUse block scopes for temporariesscope-control
DFSUse depth array, avoid parent parameterdfs-techniques
RecursionLambda + self patternrecursion
StructsConstructor patterns, const correctnessstruct-patterns
OperatorsOverload patterns for custom typesoperator-overloading
Helperschmax, ceilDiv, gcd, power, etc.helper-functions
DPUse vector, never memsetdp-patterns
Modern C++CTAD, structured binding, C++20 featuresmodern-cpp-features

Code Template

#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }

    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}

Red Flags - STOP

Anti-patternCorrect approach
using namespace std;Use std:: prefix
int a[100005]; globalstd::vector<int> a(n); in solve()
#define int long longusing i64 = long long;
for (int i = 1; i <= n; i++)for (int i = 0; i < n; i++) OR keep problem's indexing
void dfs(int u, int p) globalLambda with self capture
std::endlUse "\n"
if (x) do_something();Always use braces
a && b logical operatorsUse and, or, not keywords
Over-engineered HLD + segment treeUse binary lifting for simple path queries
Creating e1, e2 containersUse vis boolean array
Converting 1-indexed to 0-indexedKeep original indexing
Expanding boolean logic into verbose if-elseMerge conditions
Introducing unnecessary intermediate variablesUse direct formulas
Over-semantic local variable namesUse x, y, l, r for short-lived vars
Passing parent in DFSUse depth array to check visited
Explicit template parametersUse CTAD where possible
Large arrays at function scopeUse block scopes {} for temporaries
String without reserve()Preallocate for known size
Variable assignment instead of swap()Use O(1) swap
Creating struct for simple index-value sortUse std::iota + lambda
Loop variable initialized outside forInitialize in for header: for (int i = 0, j = 0;...)
Output with trailing space handlingUse " \n"[i == n - 1] trick

Full Documentation

For complete details on all rules: AGENTS.md


FINAL CHECKPOINT - BEFORE OUTPUTTING CODE

You MUST verify ALL items below before showing code to user:

□ Read relevant rule files (naming.md, formatting.md, etc.)
□ Checked against Red Flags table
□ No `using namespace std;`
□ No global arrays
□ Used `i64` for long long
□ Used `and`/`or`/`not` keywords
□ Used `std::` prefix throughout
□ 4-space indent, K&R braces
□ No compressed lines
□ Used `"\n"` not `std::endl`
□ Temporary arrays in block scopes
□ String operations use `reserve()` and `swap()`
□ Symmetric comparison patterns
□ Uppercase temp array names (S, T)
□ Use iota + lambda for sorting with indices
□ Loop vars in for header when scope permits
□ Output uses " \n"[i == n - 1] trick

If ANY item fails, fix before output. This is non-negotiable.

适合场景

01

用户想查找某类 Agent Skill 时

02

需要根据任务场景推荐可安装能力包时

03

需要对比不同来源的安装命令和来源信息时

04

需要参考平台分布和安装热度时

能力概览

能力 1

按任务关键词查找相关 Skills

能力 2

展示可复制的安装命令

能力 3

保留来源站点、仓库和原始说明,方便继续核验

能力 4

补充不同宿主或平台的使用分布数据

能力 5

展示第三方安全扫描或审计结果

安装后应在对应宿主中按原始 README 的触发条件使用;具体调用方式请以来源页面和 README 为准。

平台分布

Claude Code

28.99%
按下载量换算33

windsurf

23.79%
按下载量换算27

OpenCode

15.29%
按下载量换算18

Codex

11.28%
按下载量换算13

Antigravity

7.08%
按下载量换算8

Gemini CLI

2.99%
按下载量换算3

安全审计

Gen Agent Trust Hub

通过

Socket

通过

Snyk

通过

权限和风险

只读

该 Skill 主要提供规则、说明或参考内容,本身偏只读;真正读写文件、联网或执行命令仍取决于宿主 Agent 的任务。

安装前确认

本站仅展示第三方公开信息,不托管安装包,不提供自动安装或运行环境。安装前应自行审查源码、依赖和命令行为。

来源信息

继续浏览同类 Skills