Reports:Tasks not implemented in C++
If C++ is a language you like, or are interested in, please inform your fellow members of the C++ community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in C++. Please implement some if you can. If any tasks are not possible or too complex in C++, they should not be on this list. To mark a task as such, add {{omit from|C++}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
B
- Binary strings
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Histogram
- Bitmap/Midpoint circle algorithm
- Bitmap/PPM conversion through a pipe
- Bitmap/Read a PPM file
- Bitmap/Read an image through a pipe
- Bitmap/Write a PPM file
- Bitwise IO
C
- Calendar - for "REAL" programmers
- Call a function in a shared library
- Canny edge detector
- Carmichael 3 strong pseudoprimes
- Catmull–Clark subdivision surface
- Chaocipher
- Chat server
- Check Machin-like formulas
- Cholesky decomposition
- Church Numerals
- Color of a screen pixel
- Color quantization
- Colour pinstripe/Printer
- Combinations and permutations
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Conjugate transpose
- Convert decimal number to rational
- Currency
- Cut a rectangle
D
E
F
- FTP
- Factorial base numbers indexing permutations of a collection
- Factors of a Mersenne number
- Farey sequence
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- First-class functions/Use numbers analogously
- First class environments
- Fixed length records
- Formal power series
- Four is magic
- Four is the number of letters in the ...
- Function frequency
- Functional coverage tree
- Fusc sequence
H
I
K
L
M
N
P
- Paraffins
- Parallel Brute Force
- Parametrized SQL statement
- Parse an IP Address
- Pascal's triangle/Puzzle
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Pentagram
- Percolation/Mean cluster density
- Percolation/Site percolation
- Perfect totient numbers
- Permutations/Derangements
- Permutations/Rank of a permutation
- Pi
- Pinstripe/Printer
- Play recorded sounds
- Pragmatic directives
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Problem of Apollonius
- Pythagorean triples
R
S
- S-Expressions
- SOAP
- SQL-based authentication
- Safe primes and unsafe primes
- Same Fringe
- Scope/Function names and labels
- Scope modifiers
- Secure temporary file
- Send an unknown method call
- Sequence: nth number with exactly n divisors
- Sequence of primorial primes
- Set consolidation
- Sexy primes
- Shell one-liner
- Shortest common supersequence
- Show Ascii table
- Simple database
- Simulate input/Keyboard
- Simulate input/Mouse
- Smarandache prime-digital sequence
- Solve the no connection puzzle
- Sort numbers lexicographically
- Special variables
- Speech synthesis
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Square-free integers
- Stack traces
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Sum and Product Puzzle
- Sunflower fractal
- Superellipse
- Superpermutation minimisation
T
- Table creation/Postal addresses
- Tarjan
- Taxicab numbers
- Terminal control/Clear the screen
- Terminal control/Coloured text
- Terminal control/Cursor movement
- Terminal control/Dimensions
- Terminal control/Inverse video
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Unicode output
- Test a function
- Thiele's interpolation formula
- Tonelli-Shanks algorithm
- Topic variable
- Total circles area
- Totient function
- Truncatable primes
- Truth table
U
V
Draft tasks without implementation[edit]
These tasks are drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in C++ (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.
2
A
B
C
- Check input device is a terminal
- Checksumcolor
- Chemical Calculator
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- Cipolla's algorithm
- Code segment unload
- Color wheel
- Combinations with repetitions/Square Digit Chain
- Create an object/Native demonstration
- Curve that touches three points
D
E
F
G
H
I
L
M
N
P
R
- Railway circuit
- Ramanujan's constant
- Ramsey's theorem
- Random Latin Squares
- Rare numbers
- Raster bars
- Read a file character by character/UTF8
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance Calculator
- Resistance Network Calculator
- Reverse the gender of a string
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Rosetta Code/Tasks without examples
- Run as a daemon or service
S
- Safe mode
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Solve a Rubik's Cube
- Solving coin problems
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Starting a web browser
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Sum data type
- Super-d numbers
T
- Table creation
- Tamagotchi emulator
- Teacup rim text
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text to HTML
- Time-based One-time Password Algorithm
- Topological sort/Extracted top item
- Transportation problem
- Tree datastructures
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in C++, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.
Other pages[edit]
These are other pages related to C++ which require attention; with your knowledge and assistance, we can improve the quality of the site's content.
Not Considered[edit]
These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that C++ was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.
