---
title: PromptCoT-DS-Dataset
canonical_url: "https://www.modelscope.cn/datasets/zhaoxlpku/PromptCoT-DS-Dataset"
md_url: "https://www.modelscope.cn/datasets/zhaoxlpku/PromptCoT-DS-Dataset.md"
repository: zhaoxlpku/PromptCoT-DS-Dataset
last_updated: 2025-03-05
license: "MIT License"
storage_size: "4.7 GB"
downloads: 236
stars: 0
---

# PromptCoT-DS-Dataset

> PromptCoT-DS-Dataset - zhaoxlpku 在 ModelScope 开源的数据集。Dataset Format Each row in the dataset contains: prompt: The input to the reasoning model, including a problem statement with the special prompting template. completion: The expected output for supervised…

zhaoxlpku/PromptCoT-DS-Dataset 是 ModelScope 魔搭社区上的数据集，存储大小 4.7 GB，采用 MIT License 许可。

- **Repository**: zhaoxlpku/PromptCoT-DS-Dataset
- **License**: MIT License
- **Storage size**: 4.7 GB
- **Downloads**: 236
- **Stars**: 0
- **Last updated**: 2025-03-05

Source: https://www.modelscope.cn/datasets/zhaoxlpku/PromptCoT-DS-Dataset

---

## **Dataset Format**  
Each row in the dataset contains:  
- **`prompt`**: The input to the **reasoning model**, including a problem statement with the special prompting template.  
- **`completion`**: The **expected output** for supervised fine-tuning, containing a **thought process** wrapped in `<think>...</think>`, followed by the final solution.  

## **Example**  
```json
{
    "prompt": "<|begin▁of▁sentence|>Please reason step by step, and put your final answer within \\boxed{{}}.<|User|>\nLet $P$ be a point on a regular $n$-gon. A marker is placed on the vertex $P$ and a random process is used to select a vertex $Q$ uniformly from the remaining $n-1$ vertices. The marker is then moved from $P$ to $Q$ and from $Q$ to a vertex $R$ selected uniformly at random from the remaining $n-1$ vertices. This process is repeated $m$ times, and let $A_m$ be the angle determined by the marker at $P$ after $m$ steps. Let $k$ be a positive integer less than $n/2$ such that $A_k$ is in the angle region $\\Delta n$ determined by $PQ$ and $PR$ and let $\\lfloor x \\rfloor$ denote the greatest integer less than or equal to $x$. Find the smallest positive integer $m$ such that $m \\leq \\lfloor 2n \\lfloor \\theta \\rfloor \\rfloor$, where $\\theta = \\frac{k\\pi}{n}$.<|Assistant|>",
    "completion": "<think>...</think>\n\nGiven a regular \( n \)-gon with a marker starting at vertex \( P \), we perform a random process where the marker moves to a uniformly random vertex from the remaining \( n-1 \) vertices at each step. We need to find the smallest positive integer \( m \) such that \( m \leq \lfloor 2n \lfloor \theta \rfloor \rfloor \), where \( \theta = \frac{k\pi}{n} \) and \( k \) is a positive integer less than \( n/2 \) such that \( A_k \) is in the angle region \( \Delta_n \) determined by \( PQ \) and \( PR \).\n\n1. The angle \( \theta \) is defined as \( \theta = \frac{k\pi}{n} \).\n2. The value \( \lfloor \theta \rfloor \) is the greatest integer less than or equal to \( \theta \).\n3. We then compute \( \lfloor 2n \lfloor \theta \rfloor \rfloor \), which is the greatest integer less than or equal to \( 2n \lfloor \theta \rfloor \).\n\nThus, the smallest positive integer \( m \) such that \( m \leq \lfloor 2n \lfloor \theta \rfloor \rfloor \) is given by:\n\n\[\n\boxed{\left\lfloor 2n \left\lfloor \frac{k\pi}{n} \right\rfloor \right\rfloor}\n\]"
}
```

## **Citation**  
```
@article{zhao2025promptcot,
  author    = {Zhao, Xueliang and Wu, Wei and Guan, Jian and Kong, Lingpeng},
  title     = {PromptCoT: Synthesizing Olympiad-Level Problems for Mathematical Reasoning in Large Language Models},
  year      = {2025},
  journal   = {arXiv preprint arXiv:2503.02324},
  url       = {http://arxiv.org/abs/2503.02324}
}
```