Add solution for Counting Towers #112

[Arham07]

🎯 Problem Information

Problem Name:
Category:
CSES Link:
Difficulty: [Easy/Medium/Hard]

📝 Description

Brief description of what this PR accomplishes:

🧩 Solution Approach

• Algorithm Used:
• Time Complexity: O(...)
• Space Complexity: O(...)
• Key Insights:

✅ Checklist

Please ensure your PR meets these requirements:

Code Quality

• Solution follows the required template format
• Code is clean and well-commented
• Variable names are descriptive
• Proper error handling for edge cases

Testing

• Solution passes all CSES test cases
• Tested with custom edge cases
• Handles large input constraints efficiently
• No runtime errors or timeouts

Documentation

• Added solution to appropriate category folder
• File name follows naming convention (snake_case)
• Added brief comment explaining the approach
• Updated any relevant documentation if needed

Style Guide

• Uses required headers (#include <bits/stdc++.h>)
• Includes fast I/O optimization
• Uses appropriate data types (long long for large numbers)
• Follows competitive programming best practices

🏷️ Type of Change

• 🐛 Bug fix (fixes an existing solution)
• ✨ New problem solution
• 📚 Documentation improvement
• 🔧 Code optimization/refactoring
• 🎃 Hacktoberfest contribution

🧪 Testing Details

Describe how you tested your solution:

Test Cases Used:

Input: 
Expected Output: 
Actual Output: 

📸 Screenshots (if applicable)

Add screenshots of successful submissions or any relevant visuals.

📎 Additional Notes

Any additional information, considerations, or context for reviewers:

---

For Maintainers:

• Code review completed
• Solution verified on CSES judge
• Documentation updated if needed
• Labels applied appropriately