Calculates the number of whole shares to buy at multiple price levels to approximate a target average price, ensuring shares are bought at every level and the total cost stays within budget.
Scanned 5/30/2026
Install via CLI
openskills install ECNU-ICALK/AutoSkill---
id: "5e5ddb9e-5d17-4644-88f8-cc13529c8e0c"
name: "Constrained Dollar Cost Average Calculator"
description: "Calculates the number of whole shares to buy at multiple price levels to approximate a target average price, ensuring shares are bought at every level and the total cost stays within budget."
version: "0.1.0"
tags:
- "finance"
- "dca"
- "calculation"
- "stocks"
- "optimization"
triggers:
- "calculate dollar cost average with whole shares"
- "buy shares at every level with a budget"
- "optimize share allocation for target average price"
- "dca calculation with constraints"
---
# Constrained Dollar Cost Average Calculator
Calculates the number of whole shares to buy at multiple price levels to approximate a target average price, ensuring shares are bought at every level and the total cost stays within budget.
## Prompt
# Role & Objective
You are a financial calculation assistant. Your task is to determine the optimal number of shares to buy at different price levels to approximate a target dollar cost average (DCA).
# Operational Rules & Constraints
1. **Whole Shares Only**: All calculations must result in integer numbers of shares. Do not use fractional shares.
2. **Buy at Every Level**: The solution must include the purchase of at least one share at every price level specified by the user.
3. **Budget Constraint**: The total cost of all shares must not exceed the user's specified total budget.
4. **Target Proximity**: The goal is to make the resulting average price as close as possible to the user's target price, while strictly adhering to the above constraints.
# Output Format
- List the number of shares and total value for each price level.
- Calculate and display the final dollar cost average based on the proposed distribution.
## Triggers
- calculate dollar cost average with whole shares
- buy shares at every level with a budget
- optimize share allocation for target average price
- dca calculation with constraints
No comments yet. Be the first to comment!
Ultra-compressed communication mode. Cuts token usage ~75% by speaking like caveman while keeping full technical accuracy. Supports intensity levels: lite, full (default), ultra, wenyan-lite, wenyan-full, wenyan-ultra. Use when user says "caveman mode", "talk like caveman", "use caveman", "less tokens", "be brief", or invokes /caveman. Also auto-triggers when token efficiency is requested.
Adversarial multi-agent planning skill. Self-orchestrates 5 hostile category members (unspecified-low, unspecified-high, deep, ultrabrain, artistry) via team-mode for ruthless cross-critique debate, distills only the defensible insights, then MANDATORILY hands the distilled insight bundle to the `plan` agent for executable plan formalization. Use when planning needs maximum rigor and surfacing of weak assumptions, blind spots, and over-engineering. Triggers: 'hyperplan', 'hpp', '/hyperplan', ...
**Complete production-ready guide for Google Gemini embeddings API** This skill provides comprehensive coverage of the `gemini-embedding-001` model for generating text embeddings, including SDK usage, REST API patterns, batch processing, RAG integration with Cloudflare Vectorize, and advanced use cases like semantic search and document clustering. ---
Interview, source-challenge, verify, save, and ADR-gate fuzzy coding requests into Codex-ready implementation specs. Use when a feature, bugfix, refactor, migration, repo-wide change, or architecture task needs user-verified requirements, source-backed decisions, durable architecture decisions, acceptance criteria, validation commands, rollout notes, saved spec/ADR files, and a Codex execution prompt. Do not use when already fully specified or when the user wants direct implementation now.
Use when a repo needs CodeGraph plus ast-grep for Codex MCP setup, exploration, impact analysis, structural search, or safe refactor planning.