MCP OI-Wiki

search

Find relevant competitive programming algorithms and techniques by querying detailed needs like 'minimum spanning tree' or 'interval addition and sum' within the OI-Wiki knowledge base.

Instructions

OI Wiki 致力于成为一个免费开放且持续更新的编程竞赛知识整合站点，大家可以在这里获取与竞赛相关的、有趣又实用的知识。本工具能够在 OI-wiki 中搜索相关的知识点。

query 应该比较详细，与要实现的算法/目标相关。比如：“求一个图的最小生成树”，“维护区间加/区间求和”

@ param query 描述要实现的需求

Input Schema

Name	Required	Description	Default
`query`	Yes

Input Schema (JSON Schema)

{
  "properties": {
    "query": {
      "title": "Query",
      "type": "string"
    }
  },
  "required": [
    "query"
  ],
  "title": "searchArguments",
  "type": "object"
}

You must be authenticated.

Other Tools from MCP OI-Wiki

Related Tools

estimate_compute_units
@openSVM/zig-mcp-server
build_query
@wrale/mcp-server-tree-sitter
knowledge
@valyu-network/valyu-mcp-js
search_stackoverflow
@nahmanmate/code-research-mcp-server
mcp-reasoner
@Jacck/mcp-reasoner
search_all
@nahmanmate/code-research-mcp-server

ID: 0r57rwrzxv