tencent/AutoCodeBenchmark · Datasets at Hugging Face
huggingface.co · 2,554 words · saved by 1 readers
We’re on a journey to advance and democratize artificial intelligence through open source and open science.
# 3D Shape Analyzer Problem ## Problem Description You are tasked with implementing a `ShapeAnalyzer` class that can analyze 3D shapes represented as 2D grids of cube heights. Each cell in the grid represents a stack of cubes, where the integer value indicates how many cubes are stacked at that position. The class sho... #include <vector> #include <algorithm> #include <cmath> #include <map> using namespace std; class ShapeAnalyzer { public: // Calculate total surface area considering all cubes in the grid int calculateSurfaceArea(const vector<vector<int>>& grid) { if (grid.empty() ||…
saved by
related reading
- [2501.01257] CodeElo: Benchmarking Competition-level Code Generation of LLMs with Human-comparable Elo Ratingsarxiv.org
- BigO(Bench) -- Can LLMs Generate Code with Controlled Time and Space Complexity?alphaxiv.org
- [2605.02421] AOCI: Symbolic-Semantic Indexing for Practical Repository-Scale Code Understanding with LLMsarxiv.org
- Trending Papers - Hugging Facepaperswithcode.com
- [2203.07814] Competition-Level Code Generation with AlphaCodearxiv.org
- GitHub - srush/Tensor-Puzzles: Solve puzzles. Improve your pytorch.github.com
- Auto-research with codex: How I achieved a 232x Faster Kernel over baseline with Codex in GPU Mode's qr_v2 problemsankalp.bearblog.dev
- LeetCode-Solutions/0001-1000.md at master · Holychung/LeetCode-Solutionsgithub.com
- ⭐️ Fast LLM Inference From Scratchandrewkchan.dev
- Competitive Programmer's Handbookcses.fi
- openai/gsm8k · Datasets at Hugging Facehuggingface.co
- Kaggle Solutionsfarid.one