Rosetta Code/Count examples: Difference between revisions

From Rosetta Code
Content added Content deleted
m (→‎{{header|Perl 6}}: Give draft tasks a different background color, add a better progress indicator, add some explanatory verbiage)
m (→‎{{header|Perl 6}}: secondary sort on task name for initial table order)
Line 1,639: Line 1,639:
=={{header|Perl 6}}==
=={{header|Perl 6}}==
{{works with|Rakudo|2018.03}}
{{works with|Rakudo|2018.03}}
Retrieves counts for both Tasks and Draft Tasks. Save / Display results as a sortable wikitable rather than a static list. Click on a column header to sort on that column. To do a secondary sort, hold down the shift key and click on a second column. Tasks have a gray (default) background, Draft Tasks have a yellow background.
Retrieves counts for both Tasks and Draft Tasks. Save / Display results as a sortable wikitable rather than a static list. Click on a column header to sort on that column. To do a secondary sort, hold down the shift key and click on a second column header. Tasks have a gray (default) background, Draft Tasks have a yellow background.
<lang perl6>use HTTP::UserAgent;
<lang perl6>use HTTP::UserAgent;
use URI::Escape;
use URI::Escape;
Line 1,732: Line 1,732:


# Sort tasks by count then add row
# Sort tasks by count then add row
for %tasks.sort: -*.value<count> -> $task {
for %tasks.sort: { [-.value<count>, .key] } -> $task {
$out.say:
$out.say:
( $task.value<cat> eq 'Draft'
( $task.value<cat> eq 'Draft'
Line 1,872: Line 1,872:
|-
|-
| 159
| 159
| [[Array%20concatenation|Array concatenation]]
| [[Loops%2FDownward%20for|Loops/Downward for]]
| Task
| Task
|-
|-
| 159
| 159
| [[Loops%2FDownward%20for|Loops/Downward for]]
| [[Array%20concatenation|Array concatenation]]
| Task
| Task
|-
|-
Line 1,888: Line 1,888:
|-
|-
| 155
| 155
| [[Copy%20a%20string|Copy a string]]
| [[Boolean%20values|Boolean values]]
| Task
| Task
|-
|-
| 155
| 155
| [[Boolean%20values|Boolean values]]
| [[Copy%20a%20string|Copy a string]]
| Task
| Task
|-
|-
Line 1,904: Line 1,904:
|-
|-
| 148
| 148
| [[String%20length|String length]]
| [[Even%20or%20odd|Even or odd]]
| Task
| Task
|-
|-
| 148
| 148
| [[Even%20or%20odd|Even or odd]]
| [[String%20case|String case]]
| Task
| Task
|-
|-
| 148
| 148
| [[String%20case|String case]]
| [[String%20length|String length]]
| Task
| Task
|-
|-
| 146
| 146
| [[Character%20codes|Character codes]]
| [[Hailstone%20sequence|Hailstone sequence]]
| Task
| Task
|-
|-
| 146
| 146
| [[Hailstone%20sequence|Hailstone sequence]]
| [[Character%20codes|Character codes]]
| Task
| Task
|-
|-
| 144
| 144
| [[Apply%20a%20callback%20to%20an%20array|Apply a callback to an array]]
| [[Loops%2FDo-while|Loops/Do-while]]
| Task
| Task
|-
|-
| 144
| 144
| [[Loops%2FDo-while|Loops/Do-while]]
| [[Apply%20a%20callback%20to%20an%20array|Apply a callback to an array]]
| Task
| Task
|-
|-
Line 1,956: Line 1,956:
|-
|-
| 137
| 137
| [[Loops%2FBreak|Loops/Break]]
| [[Filter|Filter]]
| Task
| Task
|-
|-
| 137
| 137
| [[Generic%20swap|Generic swap]]
| [[Palindrome%20detection|Palindrome detection]]
| Task
| Task
|-
|-
| 137
| 137
| [[Filter|Filter]]
| [[Loops%2FBreak|Loops/Break]]
| Task
| Task
|-
|-
| 137
| 137
| [[Palindrome%20detection|Palindrome detection]]
| [[Sum%20of%20squares|Sum of squares]]
| Task
| Task
|-
|-
| 137
| 137
| [[Generic%20swap|Generic swap]]
| [[Sum%20of%20squares|Sum of squares]]
| Task
| Task
|-
|-
Line 1,980: Line 1,980:
|-
|-
| 136
| 136
| [[Logical%20operations|Logical operations]]
|data-sort-value="rot-0C13"| [[Rot-13|Rot-13]]
| Task
| Task
|-
|-
| 136
| 136
|data-sort-value="rot-0C13"| [[Rot-13|Rot-13]]
| [[Logical%20operations|Logical operations]]
| Task
| Task
|-
|-
Line 2,020: Line 2,020:
|-
|-
| 126
| 126
| [[Higher-order%20functions|Higher-order functions]]
| [[Sorting%20algorithms%2FBubble%20sort|Sorting algorithms/Bubble sort]]
| Task
| Task
|-
|-
| 126
| 126
| [[Remove%20duplicate%20elements|Remove duplicate elements]]
| [[Higher-order%20functions|Higher-order functions]]
| Task
| Task
|-
|-
| 126
| 126
| [[Sorting%20algorithms%2FBubble%20sort|Sorting algorithms/Bubble sort]]
| [[Remove%20duplicate%20elements|Remove duplicate elements]]
| Task
| Task
|-
|-
Line 2,040: Line 2,040:
|-
|-
| 123
| 123
| [[User%20input%2FText|User input/Text]]
| [[Empty%20string|Empty string]]
| Task
| Task
|-
|-
| 123
| 123
| [[Hello%20world%2FStandard%20error|Hello world/Standard error]]
| [[Quine|Quine]]
| Task
| Task
|-
|-
| 123
| 123
| [[Quine|Quine]]
| [[Hello%20world%2FStandard%20error|Hello world/Standard error]]
| Task
| Task
|-
|-
| 123
| 123
| [[Empty%20string|Empty string]]
| [[User%20input%2FText|User input/Text]]
| Task
| Task
|-
|-
Line 2,084: Line 2,084:
|-
|-
| 118
| 118
| [[Bitwise%20operations|Bitwise operations]]
| [[Loop%20over%20multiple%20arrays%20simultaneously|Loop over multiple arrays simultaneously]]
| Task
| Task
|-
|-
Line 2,092: Line 2,092:
|-
|-
| 118
| 118
| [[Loop%20over%20multiple%20arrays%20simultaneously|Loop over multiple arrays simultaneously]]
| [[Bitwise%20operations|Bitwise operations]]
| Task
| Task
|-
|-
| 117
| 117
| [[Least%20common%20multiple|Least common multiple]]
| [[Sleep|Sleep]]
| Task
| Task
|-
|-
| 117
| 117
| [[Sleep|Sleep]]
| [[Least%20common%20multiple|Least common multiple]]
| Task
| Task
|-
|-
| 116
| 116
| [[Day%20of%20the%20week|Day of the week]]
| [[Sorting%20algorithms%2FQuicksort|Sorting algorithms/Quicksort]]
| Task
| Task
|-
|-
| 116
| 116
| [[Factors%20of%20an%20integer|Factors of an integer]]
| [[System%20time|System time]]
| Task
| Task
|-
|-
| 116
| 116
| [[Sorting%20algorithms%2FQuicksort|Sorting algorithms/Quicksort]]
| [[Day%20of%20the%20week|Day of the week]]
| Task
| Task
|-
|-
| 116
| 116
| [[System%20time|System time]]
| [[Factors%20of%20an%20integer|Factors of an integer]]
| Task
|-
| 115
| [[Substring|Substring]]
| Task
| Task
|-
|-
Line 2,133: Line 2,129:
| 115
| 115
| [[Include%20a%20file|Include a file]]
| [[Include%20a%20file|Include a file]]
| Task
|-
| 115
| [[Substring|Substring]]
| Task
| Task
|-
|-
Line 2,152: Line 2,152:
|-
|-
| 112
| 112
| [[Detect%20division%20by%20zero|Detect division by zero]]
| [[Pascal%27s%20triangle|Pascal's triangle]]
| Task
| Task
|-
|-
| 112
| 112
| [[Pascal%27s%20triangle|Pascal's triangle]]
| [[Detect%20division%20by%20zero|Detect division by zero]]
| Task
| Task
|-
|-
| 111
| 111
| [[Averages%2FRoot%20mean%20square|Averages/Root mean square]]
| [[Luhn%20test%20of%20credit%20card%20numbers|Luhn test of credit card numbers]]
| Task
| Task
|-
|-
| 111
| 111
| [[Flatten%20a%20list|Flatten a list]]
| [[Balanced%20brackets|Balanced brackets]]
| Task
| Task
|-
|-
| 111
| 111
| [[Flatten%20a%20list|Flatten a list]]
| [[Averages%2FRoot%20mean%20square|Averages/Root mean square]]
| Task
| Task
|-
|-
| 111
| 111
| [[Luhn%20test%20of%20credit%20card%20numbers|Luhn test of credit card numbers]]
| [[Balanced%20brackets|Balanced brackets]]
| Task
| Task
|-
|-
| 110
| 110
| [[Program%20termination|Program termination]]
| [[Stack|Stack]]
| Task
| Task
|-
|-
| 110
| 110
| [[Stack|Stack]]
| [[Program%20termination|Program termination]]
| Task
| Task
|-
|-
| 109
| 109
| [[Knuth%20shuffle|Knuth shuffle]]
| [[File%20size|File size]]
| Task
| Task
|-
|-
| 109
| 109
| [[File%20size|File size]]
| [[Knuth%20shuffle|Knuth shuffle]]
| Task
| Task
|-
|-
| 108
| 108
| [[Compound%20data%20type|Compound data type]]
| [[Variables|Variables]]
| Task
| Task
|-
|-
| 108
| 108
| [[Variables|Variables]]
| [[Compound%20data%20type|Compound data type]]
| Task
|-
| 107
| [[Read%20a%20file%20line%20by%20line|Read a file line by line]]
| Task
| Task
|-
|-
Line 2,211: Line 2,207:
| Task
| Task
|-
|-
| 106
| 107
| [[Rename%20a%20file|Rename a file]]
| [[Read%20a%20file%20line%20by%20line|Read a file line by line]]
| Task
| Task
|-
|-
| 106
| 106
| [[Search%20a%20list|Search a list]]
| [[Delete%20a%20file|Delete a file]]
| Task
| Task
|-
|-
Line 2,228: Line 2,224:
|-
|-
| 106
| 106
| [[Delete%20a%20file|Delete a file]]
| [[Rename%20a%20file|Rename a file]]
| Task
|-
| 106
| [[Search%20a%20list|Search a list]]
| Task
| Task
|-
|-
Line 2,236: Line 2,236:
|-
|-
| 104
| 104
| [[Count%20in%20octal|Count in octal]]
| [[ABC%20Problem|ABC Problem]]
| Task
| Task
|-
|-
| 104
| 104
| [[Count%20in%20octal|Count in octal]]
| [[Return%20multiple%20values|Return multiple values]]
| Task
| Task
|-
|-
| 104
| 104
| [[Function%20composition|Function composition]]
| [[ABC%20Problem|ABC Problem]]
| Task
| Task
|-
|-
Line 2,252: Line 2,252:
|-
|-
| 104
| 104
| [[Null%20object|Null object]]
| [[Function%20composition|Function composition]]
| Task
| Task
|-
|-
| 104
| 104
| [[Return%20multiple%20values|Return multiple values]]
| [[Null%20object|Null object]]
| Task
| Task
|-
|-
| 103
| 103
| [[Loops%2FNested|Loops/Nested]]
| [[Binary%20search|Binary search]]
| Task
| Task
|-
|-
| 103
| 103
| [[Case-sensitivity%20of%20identifiers|Case-sensitivity of identifiers]]
| [[Classes|Classes]]
| Task
| Task
|-
|-
| 103
| 103
| [[Classes|Classes]]
| [[Sorting%20algorithms%2FInsertion%20sort|Sorting algorithms/Insertion sort]]
| Task
| Task
|-
|-
| 103
| 103
| [[Formatted%20numeric%20output|Formatted numeric output]]
| [[Case-sensitivity%20of%20identifiers|Case-sensitivity of identifiers]]
| Task
| Task
|-
|-
| 103
| 103
| [[Binary%20search|Binary search]]
| [[Loops%2FNested|Loops/Nested]]
| Task
| Task
|-
|-
| 103
| 103
| [[Sorting%20algorithms%2FInsertion%20sort|Sorting algorithms/Insertion sort]]
| [[Formatted%20numeric%20output|Formatted numeric output]]
| Task
| Task
|-
|-
Line 2,288: Line 2,288:
|-
|-
| 102
| 102
| [[Count%20occurrences%20of%20a%20substring|Count occurrences of a substring]]
| [[Hostname|Hostname]]
| Task
| Task
|-
|-
| 102
| 102
| [[Hostname|Hostname]]
| [[Count%20occurrences%20of%20a%20substring|Count occurrences of a substring]]
| Task
| Task
|-
|-
| 101
| 101
| [[Arithmetic%2FComplex|Arithmetic/Complex]]
| [[Hash%20from%20two%20arrays|Hash from two arrays]]
| Task
| Task
|-
|-
| 101
| 101
| [[Hash%20from%20two%20arrays|Hash from two arrays]]
| [[Arithmetic%2FComplex|Arithmetic/Complex]]
| Task
| Task
|-
|-
Line 2,308: Line 2,308:
|-
|-
| 100
| 100
| [[HTTP|HTTP]]
| [[Pick%20random%20element|Pick random element]]
| Task
| Task
|-
|-
Line 2,316: Line 2,316:
|-
|-
| 100
| 100
| [[Pick%20random%20element|Pick random element]]
| [[HTTP|HTTP]]
| Task
| Task
|-
|-
| 99
| 99
| [[Anagrams|Anagrams]]
| [[Pangram%20checker|Pangram checker]]
| Task
| Task
|-
|-
| 99
| 99
| [[Environment%20variables|Environment variables]]
| [[Matrix%20multiplication|Matrix multiplication]]
| Task
| Task
|-
|-
| 99
| 99
| [[Find%20limit%20of%20recursion|Find limit of recursion]]
| [[Matrix%20transposition|Matrix transposition]]
| Task
| Task
|-
|-
| 99
| 99
| [[Matrix%20multiplication|Matrix multiplication]]
| [[N-queens%20problem|N-queens problem]]
| Task
| Task
|-
|-
| 99
| 99
| [[Matrix%20transposition|Matrix transposition]]
| [[Find%20limit%20of%20recursion|Find limit of recursion]]
| Task
| Task
|-
|-
| 99
| 99
| [[N-queens%20problem|N-queens problem]]
| [[Anagrams|Anagrams]]
| Task
| Task
|-
|-
| 99
| 99
| [[Pangram%20checker|Pangram checker]]
| [[Environment%20variables|Environment variables]]
| Task
| Task
|-
|-
Line 2,360: Line 2,360:
|-
|-
| 97
| 97
| [[Accumulator%20factory|Accumulator factory]]
| [[Create%20a%20two-dimensional%20array%20at%20runtime|Create a two-dimensional array at runtime]]
| Task
| Task
|-
|-
Line 2,368: Line 2,368:
|-
|-
| 97
| 97
| [[Create%20a%20two-dimensional%20array%20at%20runtime|Create a two-dimensional array at runtime]]
| [[Accumulator%20factory|Accumulator factory]]
| Task
| Task
|-
|-
Line 2,376: Line 2,376:
|-
|-
| 96
| 96
| [[Assertions|Assertions]]
| [[Haversine%20formula|Haversine formula]]
| Task
| Task
|-
|-
| 96
| 96
| [[Haversine%20formula|Haversine formula]]
| [[Roman%20numerals%2FDecode|Roman numerals/Decode]]
| Task
| Task
|-
|-
| 96
| 96
| [[Identity%20matrix|Identity matrix]]
| [[Temperature%20conversion|Temperature conversion]]
| Task
| Task
|-
|-
| 96
| 96
| [[Roman%20numerals%2FDecode|Roman numerals/Decode]]
| [[Assertions|Assertions]]
| Task
| Task
|-
|-
| 96
| 96
| [[Strip%20a%20set%20of%20characters%20from%20a%20string|Strip a set of characters from a string]]
| [[Identity%20matrix|Identity matrix]]
| Task
| Task
|-
|-
| 96
| 96
| [[Temperature%20conversion|Temperature conversion]]
| [[Strip%20a%20set%20of%20characters%20from%20a%20string|Strip a set of characters from a string]]
| Task
| Task
|-
|-
| 95
| 95
| [[Averages%2FPythagorean%20means|Averages/Pythagorean means]]
| [[String%20matching|String matching]]
| Task
| Task
|-
|-
| 95
| 95
| [[Evaluate%20binomial%20coefficients|Evaluate binomial coefficients]]
| [[Averages%2FPythagorean%20means|Averages/Pythagorean means]]
| Task
| Task
|-
|-
| 95
| 95
| [[String%20matching|String matching]]
| [[Evaluate%20binomial%20coefficients|Evaluate binomial coefficients]]
| Task
| Task
|-
|-
Line 2,424: Line 2,424:
|-
|-
| 93
| 93
| [[Catalan%20numbers|Catalan numbers]]
| [[Run-length%20encoding|Run-length encoding]]
| Task
| Task
|-
|-
| 93
| 93
| [[Run-length%20encoding|Run-length encoding]]
| [[Zero%20to%20the%20zero%20power|Zero to the zero power]]
| Task
| Task
|-
|-
| 93
| 93
| [[Zero%20to%20the%20zero%20power|Zero to the zero power]]
| [[Catalan%20numbers|Catalan numbers]]
| Task
| Task
|-
|-
| 92
| 92
| [[Arithmetic-geometric%20mean|Arithmetic-geometric mean]]
| [[Zig-zag%20matrix|Zig-zag matrix]]
| Task
| Task
|-
|-
| 92
| 92
| [[Program%20name|Program name]]
| [[Strip%20whitespace%20from%20a%20string%2FTop%20and%20tail|Strip whitespace from a string/Top and tail]]
| Task
| Task
|-
|-
| 92
| 92
| [[Shell%20one-liner|Shell one-liner]]
| [[Arithmetic-geometric%20mean|Arithmetic-geometric mean]]
| Task
| Task
|-
|-
| 92
| 92
| [[Strip%20whitespace%20from%20a%20string%2FTop%20and%20tail|Strip whitespace from a string/Top and tail]]
| [[Program%20name|Program name]]
| Task
| Task
|-
|-
| 92
| 92
| [[Zig-zag%20matrix|Zig-zag matrix]]
| [[Shell%20one-liner|Shell one-liner]]
| Task
| Task
|-
|-
| 91
| 91
| [[Exceptions|Exceptions]]
| [[Trigonometric%20functions|Trigonometric functions]]
| Task
| Task
|-
|-
| 91
| 91
| [[Trigonometric%20functions|Trigonometric functions]]
| [[Exceptions|Exceptions]]
| Task
| Task
|-
|-
Line 2,468: Line 2,468:
|-
|-
| 90
| 90
| [[Letter%20frequency|Letter frequency]]
| [[String%20interpolation%20%28included%29|String interpolation (included)]]
| Task
| Task
|-
|-
Line 2,476: Line 2,476:
|-
|-
| 90
| 90
| [[Regular%20expressions|Regular expressions]]
| [[Letter%20frequency|Letter frequency]]
| Task
| Task
|-
|-
| 90
| 90
| [[String%20interpolation%20%28included%29|String interpolation (included)]]
| [[Regular%20expressions|Regular expressions]]
| Task
| Task
|-
|-
Line 2,488: Line 2,488:
|-
|-
| 88
| 88
|data-sort-value="0C24 game"| [[24%20game|24 game]]
| [[Sorting%20algorithms%2FMerge%20sort|Sorting algorithms/Merge sort]]
| Task
| Task
|-
|-
| 88
| 88
| [[Enumerations|Enumerations]]
| [[Random%20number%20generator%20%28included%29|Random number generator (included)]]
| Task
| Task
|-
|-
| 88
| 88
| [[Power%20set|Power set]]
|data-sort-value="0C24 game"| [[24%20game|24 game]]
| Task
| Task
|-
|-
| 88
| 88
| [[Random%20number%20generator%20%28included%29|Random number generator (included)]]
| [[Sierpinski%20triangle|Sierpinski triangle]]
| Task
| Task
|-
|-
| 88
| 88
| [[Short-circuit%20evaluation|Short-circuit evaluation]]
| [[Sorting%20algorithms%2FSelection%20sort|Sorting algorithms/Selection sort]]
| Task
| Task
|-
|-
| 88
| 88
| [[Sierpinski%20triangle|Sierpinski triangle]]
| [[Short-circuit%20evaluation|Short-circuit evaluation]]
| Task
| Task
|-
|-
| 88
| 88
| [[Sorting%20algorithms%2FMerge%20sort|Sorting algorithms/Merge sort]]
| [[Power%20set|Power set]]
| Task
| Task
|-
|-
| 88
| 88
| [[Sorting%20algorithms%2FSelection%20sort|Sorting algorithms/Selection sort]]
| [[Enumerations|Enumerations]]
| Task
| Task
|-
|-
| 87
| 87
| [[Collections|Collections]]
| [[One-dimensional%20cellular%20automata|One-dimensional cellular automata]]
| Task
| Task
|-
|-
| 87
| 87
| [[One-dimensional%20cellular%20automata|One-dimensional cellular automata]]
| [[Collections|Collections]]
| Task
| Task
|-
|-
Line 2,540: Line 2,540:
|-
|-
| 85
| 85
| [[Comma%20quibbling|Comma quibbling]]
| [[Levenshtein%20distance|Levenshtein distance]]
| Task
| Task
|-
|-
| 85
| 85
| [[Exponentiation%20operator|Exponentiation operator]]
| [[Comma%20quibbling|Comma quibbling]]
| Task
| Task
|-
|-
| 85
| 85
| [[Levenshtein%20distance|Levenshtein distance]]
| [[Exponentiation%20operator|Exponentiation operator]]
| Task
| Task
|-
|-
Line 2,560: Line 2,560:
|-
|-
| 84
| 84
| [[Arbitrary-precision%20integers%20%28included%29|Arbitrary-precision integers (included)]]
| [[Reverse%20words%20in%20a%20string|Reverse words in a string]]
| Task
| Task
|-
|-
| 84
| 84
| [[First-class%20functions|First-class functions]]
| [[Walk%20a%20directory%2FNon-recursively|Walk a directory/Non-recursively]]
| Task
| Task
|-
|-
| 84
| 84
| [[Look-and-say%20sequence|Look-and-say sequence]]
| [[Range%20extraction|Range extraction]]
| Task
| Task
|-
|-
| 84
| 84
| [[Permutations|Permutations]]
| [[First-class%20functions|First-class functions]]
| Task
| Task
|-
|-
| 84
| 84
| [[Range%20extraction|Range extraction]]
| [[Arbitrary-precision%20integers%20%28included%29|Arbitrary-precision integers (included)]]
| Task
| Task
|-
|-
| 84
| 84
| [[Reverse%20words%20in%20a%20string|Reverse words in a string]]
| [[Look-and-say%20sequence|Look-and-say sequence]]
| Task
| Task
|-
|-
| 84
| 84
| [[Walk%20a%20directory%2FNon-recursively|Walk a directory/Non-recursively]]
| [[Permutations|Permutations]]
| Task
| Task
|-
|-
Line 2,596: Line 2,596:
|-
|-
| 82
| 82
| [[Bulls%20and%20cows|Bulls and cows]]
| [[Inheritance%2FSingle|Inheritance/Single]]
| Task
| Task
|-
|-
| 82
| 82
| [[Inheritance%2FSingle|Inheritance/Single]]
| [[Range%20expansion|Range expansion]]
| Task
| Task
|-
|-
Line 2,608: Line 2,608:
|-
|-
| 82
| 82
| [[Bulls%20and%20cows|Bulls and cows]]
| [[Range%20expansion|Range expansion]]
| Task
| Task
|-
|-
| 81
| 81
| [[Five%20weekends|Five weekends]]
| [[Symmetric%20difference|Symmetric difference]]
| Task
| Task
|-
|-
Line 2,624: Line 2,624:
|-
|-
| 81
| 81
| [[String%20prepend|String prepend]]
|data-sort-value="sum multiples of 0B3 and 0B5"| [[Sum%20multiples%20of%203%20and%205|Sum multiples of 3 and 5]]
| Task
| Task
|-
|-
| 81
| 81
|data-sort-value="sum multiples of 0B3 and 0B5"| [[Sum%20multiples%20of%203%20and%205|Sum multiples of 3 and 5]]
| [[Window%20creation|Window creation]]
| Task
| Task
|-
|-
| 81
| 81
| [[Symmetric%20difference|Symmetric difference]]
| [[String%20prepend|String prepend]]
| Task
| Task
|-
|-
| 81
| 81
| [[Five%20weekends|Five weekends]]
| [[Window%20creation|Window creation]]
| Task
| Task
|-
|-
| 80
| 80
| [[Create%20an%20HTML%20table|Create an HTML table]]
| [[Evolutionary%20algorithm|Evolutionary algorithm]]
| Task
| Task
|-
|-
| 80
| 80
| [[Evolutionary%20algorithm|Evolutionary algorithm]]
| [[Y%20combinator|Y combinator]]
| Task
| Task
|-
|-
Line 2,652: Line 2,652:
|-
|-
| 80
| 80
| [[Y%20combinator|Y combinator]]
| [[Create%20an%20HTML%20table|Create an HTML table]]
| Task
| Task
|-
|-
| 79
| 79
| [[Forward%20difference|Forward difference]]
| [[Sum%20digits%20of%20an%20integer|Sum digits of an integer]]
| Task
| Task
|-
|-
Line 2,664: Line 2,664:
|-
|-
| 79
| 79
| [[Sum%20digits%20of%20an%20integer|Sum digits of an integer]]
| [[Forward%20difference|Forward difference]]
| Task
| Task
|-
|-
Line 2,680: Line 2,680:
|-
|-
| 78
| 78
| [[Monty%20Hall%20problem|Monty Hall problem]]
| [[Price%20fraction|Price fraction]]
| Task
| Task
|-
|-
| 78
| 78
| [[Price%20fraction|Price fraction]]
| [[Monty%20Hall%20problem|Monty Hall problem]]
| Task
| Task
|-
|-
| 77
| 77
| [[Abstract%20type|Abstract type]]
| [[Greatest%20subsequential%20sum|Greatest subsequential sum]]
| Task
| Task
|-
|-
| 77
| 77
| [[Vector%20products|Vector products]]
| [[Dragon%20curve|Dragon curve]]
| Task
| Task
|-
|-
| 77
| 77
| [[Greatest%20subsequential%20sum|Greatest subsequential sum]]
| [[Sierpinski%20carpet|Sierpinski carpet]]
| Task
| Task
|-
|-
| 77
| 77
| [[Abstract%20type|Abstract type]]
| [[Sierpinski%20carpet|Sierpinski carpet]]
| Task
| Task
|-
|-
| 77
| 77
| [[Dragon%20curve|Dragon curve]]
| [[Vector%20products|Vector products]]
| Task
| Task
|-
|-
| 76
| 76
| [[Spiral%20matrix|Spiral matrix]]
| [[Babbage%20problem|Babbage problem]]
| Task
| Task
|-
|-
| 76
| 76
| [[Menu|Menu]]
| [[Entropy|Entropy]]
| Task
| Task
|-
|-
| 76
| 76
| [[Babbage%20problem|Babbage problem]]
| [[Hamming%20numbers|Hamming numbers]]
| Task
| Task
|-
|-
| 76
| 76
| [[Hamming%20numbers|Hamming numbers]]
| [[Langton%27s%20ant|Langton's ant]]
| Task
| Task
|-
|-
| 76
| 76
| [[Menu|Menu]]
| [[Langton%27s%20ant|Langton's ant]]
| Task
| Task
|-
|-
Line 2,732: Line 2,732:
|-
|-
| 76
| 76
| [[Spiral%20matrix|Spiral matrix]]
| [[Entropy|Entropy]]
| Task
| Task
|-
|-
| 75
| 75
| [[Map%20range|Map range]]
| [[Averages%2FMode|Averages/Mode]]
| Task
| Task
|-
|-
| 75
| 75
| [[Hello%20world%2FLine%20printer|Hello world/Line printer]]
| [[Averages%2FMode|Averages/Mode]]
| Task
| Task
|-
|-
| 75
| 75
| [[Map%20range|Map range]]
| [[Walk%20a%20directory%2FRecursively|Walk a directory/Recursively]]
| Task
| Task
|-
|-
Line 2,752: Line 2,752:
|-
|-
| 75
| 75
| [[Walk%20a%20directory%2FRecursively|Walk a directory/Recursively]]
| [[Hello%20world%2FLine%20printer|Hello world/Line printer]]
| Task
| Task
|-
|-
| 74
| 74
| [[Execute%20Brain%2A%2A%2A%2A|Execute Brain****]]
| [[Simple%20windowed%20application|Simple windowed application]]
| Task
| Task
|-
|-
| 74
| 74
| [[Harshad%20or%20Niven%20series|Harshad or Niven series]]
| [[Show%20the%20epoch|Show the epoch]]
| Task
| Task
|-
|-
| 74
| 74
| [[JSON|JSON]]
| [[Non-decimal%20radices%2FConvert|Non-decimal radices/Convert]]
| Task
| Task
|-
|-
| 74
| 74
| [[Non-decimal%20radices%2FConvert|Non-decimal radices/Convert]]
| [[The%20Twelve%20Days%20of%20Christmas|The Twelve Days of Christmas]]
| Task
| Task
|-
|-
| 74
| 74
| [[Show%20the%20epoch|Show the epoch]]
| [[Execute%20Brain%2A%2A%2A%2A|Execute Brain****]]
| Task
| Task
|-
|-
| 74
| 74
| [[Simple%20windowed%20application|Simple windowed application]]
| [[JSON|JSON]]
| Task
| Task
|-
|-
| 74
| 74
| [[The%20Twelve%20Days%20of%20Christmas|The Twelve Days of Christmas]]
| [[Web%20scraping|Web scraping]]
| Task
| Task
|-
|-
| 74
| 74
| [[Web%20scraping|Web scraping]]
| [[Harshad%20or%20Niven%20series|Harshad or Niven series]]
| Task
| Task
|-
|-
| 73
| 73
| [[Closures%2FValue%20capture|Closures/Value capture]]
| [[Monte%20Carlo%20methods|Monte Carlo methods]]
| Task
| Task
|-
|-
| 73
| 73
| [[Set|Set]]
| [[Digital%20root|Digital root]]
| Task
| Task
|-
|-
| 73
| 73
| [[Tree%20traversal|Tree traversal]]
| [[Gray%20code|Gray code]]
| Task
| Task
|-
|-
| 73
| 73
| [[Monte%20Carlo%20methods|Monte Carlo methods]]
| [[Digital%20root|Digital root]]
| Task
| Task
|-
|-
| 73
| 73
| [[Set|Set]]
| [[Closures%2FValue%20capture|Closures/Value capture]]
| Task
| Task
|-
|-
| 73
| 73
| [[Gray%20code|Gray code]]
| [[Tree%20traversal|Tree traversal]]
| Task
| Task
|-
|-
| 72
| 72
| [[Introspection|Introspection]]
| [[Read%20a%20specific%20line%20from%20a%20file|Read a specific line from a file]]
| Task
| Task
|-
|-
| 72
| 72
| [[Man%20or%20boy%20test|Man or boy test]]
| [[Queue%2FUsage|Queue/Usage]]
| Task
| Task
|-
|-
| 72
| 72
| [[SEDOLs|SEDOLs]]
| [[Queue%2FUsage|Queue/Usage]]
| Task
| Task
|-
|-
| 72
| 72
| [[Read%20a%20specific%20line%20from%20a%20file|Read a specific line from a file]]
| [[Introspection|Introspection]]
| Task
| Task
|-
|-
| 72
| 72
| [[SEDOLs|SEDOLs]]
| [[Man%20or%20boy%20test|Man or boy test]]
| Task
| Task
|-
|-
| 71
| 71
| [[CSV%20to%20HTML%20translation|CSV to HTML translation]]
| [[Last%20Friday%20of%20each%20month|Last Friday of each month]]
| Task
| Task
|-
|-
| 71
| 71
| [[Last%20Friday%20of%20each%20month|Last Friday of each month]]
| [[Terminal%20control%2FRinging%20the%20terminal%20bell|Terminal control/Ringing the terminal bell]]
| Task
| Task
|-
|-
| 71
| 71
| [[Literals%2FFloating%20point|Literals/Floating point]]
| [[Singly-linked%20list%2FTraversal|Singly-linked list/Traversal]]
| Task
| Task
|-
|-
| 71
| 71
| [[Number%20reversal%20game|Number reversal game]]
| [[CSV%20to%20HTML%20translation|CSV to HTML translation]]
| Task
| Task
|-
|-
| 71
| 71
| [[Singly-linked%20list%2FTraversal|Singly-linked list/Traversal]]
| [[Number%20reversal%20game|Number reversal game]]
| Task
| Task
|-
|-
Line 2,856: Line 2,856:
|-
|-
| 71
| 71
| [[Terminal%20control%2FRinging%20the%20terminal%20bell|Terminal control/Ringing the terminal bell]]
| [[Literals%2FFloating%20point|Literals/Floating point]]
| Task
| Task
|-
|-
| 70
| 70
| [[Bitmap|Bitmap]]
| [[Count%20in%20factors|Count in factors]]
| Task
| Task
|-
|-
Line 2,868: Line 2,868:
|-
|-
| 70
| 70
| [[Count%20in%20factors|Count in factors]]
| [[Keyboard%20input%2FObtain%20a%20Y%20or%20N%20response|Keyboard input/Obtain a Y or N response]]
| Task
| Task
|-
|-
| 70
| 70
| [[Keyboard%20input%2FObtain%20a%20Y%20or%20N%20response|Keyboard input/Obtain a Y or N response]]
| [[Bitmap|Bitmap]]
| Task
| Task
|-
|-
| 70
| 70
| [[Sorting%20algorithms%2FHeapsort|Sorting algorithms/Heapsort]]
| [[URL%20decoding|URL decoding]]
| Task
| Task
|-
|-
| 70
| 70
| [[URL%20decoding|URL decoding]]
| [[Sorting%20algorithms%2FHeapsort|Sorting algorithms/Heapsort]]
| Task
| Task
|-
|-
| 69
| 69
| [[Amicable%20pairs|Amicable pairs]]
| [[Linear%20congruential%20generator|Linear congruential generator]]
| Task
| Task
|-
|-
| 69
| 69
| [[Floyd%27s%20triangle|Floyd's triangle]]
| [[Sockets|Sockets]]
| Task
| Task
|-
|-
| 69
| 69
| [[Linear%20congruential%20generator|Linear congruential generator]]
| [[Amicable%20pairs|Amicable pairs]]
| Task
| Task
|-
|-
| 69
| 69
| [[Sockets|Sockets]]
| [[Floyd%27s%20triangle|Floyd's triangle]]
| Task
| Task
|-
|-
Line 2,904: Line 2,904:
|-
|-
| 68
| 68
| [[Find%20the%20missing%20permutation|Find the missing permutation]]
| [[String%20comparison|String comparison]]
| Task
| Task
|-
|-
| 68
| 68
| [[Josephus%20problem|Josephus problem]]
| [[Find%20the%20missing%20permutation|Find the missing permutation]]
| Task
|-
| 68
|data-sort-value="knapsack problem/0B0-0B1"| [[Knapsack%20problem%2F0-1|Knapsack problem/0-1]]
| Task
| Task
|-
|-
Line 2,916: Line 2,920:
|-
|-
| 68
| 68
| [[Special%20characters|Special characters]]
| [[Josephus%20problem|Josephus problem]]
| Task
| Task
|-
|-
| 68
| 68
| [[String%20comparison|String comparison]]
| [[XML%2FInput|XML/Input]]
| Task
| Task
|-
|-
Line 2,932: Line 2,936:
|-
|-
| 68
| 68
| [[XML%2FInput|XML/Input]]
|data-sort-value="knapsack problem/0B0-0B1"| [[Knapsack%20problem%2F0-1|Knapsack problem/0-1]]
| Task
| Task
|-
|-
| 68
| 67
| [[Address%20of%20a%20variable|Address of a variable]]
| [[Special%20characters|Special characters]]
| Task
| Task
|-
|-
| 67
| 67
| [[Catamorphism|Catamorphism]]
| [[Strip%20comments%20from%20a%20string|Strip comments from a string]]
| Task
| Task
|-
|-
Line 2,948: Line 2,952:
|-
|-
| 67
| 67
| [[Date%20manipulation|Date manipulation]]
| [[Kaprekar%20numbers|Kaprekar numbers]]
| Task
| Task
|-
|-
| 67
| 67
| [[Find%20common%20directory%20path|Find common directory path]]
| [[Number%20names|Number names]]
| Task
| Task
|-
|-
| 67
| 67
| [[Kaprekar%20numbers|Kaprekar numbers]]
| [[Address%20of%20a%20variable|Address of a variable]]
| Task
| Task
|-
|-
| 67
| 67
| [[Number%20names|Number names]]
| [[Date%20manipulation|Date manipulation]]
| Task
|-
| 67
| [[Catamorphism|Catamorphism]]
| Task
| Task
|-
|-
Line 2,976: Line 2,976:
|-
|-
| 67
| 67
| [[Strip%20comments%20from%20a%20string|Strip comments from a string]]
| [[Terminal%20control%2FClear%20the%20screen|Terminal control/Clear the screen]]
| Task
| Task
|-
|-
| 67
| 67
| [[Terminal%20control%2FClear%20the%20screen|Terminal control/Clear the screen]]
| [[Find%20common%20directory%20path|Find common directory path]]
| Task
| Task
|-
|-
| 66
| 66
| [[Box%20the%20compass|Box the compass]]
| [[Unicode%20variable%20names|Unicode variable names]]
| Task
| Task
|-
|-
| 66
| 66
| [[Dynamic%20variable%20names|Dynamic variable names]]
| [[URL%20encoding|URL encoding]]
| Task
| Task
|-
|-
| 66
| 66
| [[Non-decimal%20radices%2FOutput|Non-decimal radices/Output]]
| [[Singly-linked%20list%2FElement%20definition|Singly-linked list/Element definition]]
| Task
| Task
|-
|-
| 66
| 66
| [[Playing%20cards|Playing cards]]
| [[Stair-climbing%20puzzle|Stair-climbing puzzle]]
| Task
| Task
|-
|-
| 66
| 66
| [[Singly-linked%20list%2FElement%20definition|Singly-linked list/Element definition]]
| [[Non-decimal%20radices%2FOutput|Non-decimal radices/Output]]
| Task
| Task
|-
|-
| 66
| 66
| [[Soundex|Soundex]]
| [[Playing%20cards|Playing cards]]
| Task
| Task
|-
|-
| 66
| 66
| [[Stair-climbing%20puzzle|Stair-climbing puzzle]]
| [[Box%20the%20compass|Box the compass]]
| Task
| Task
|-
|-
| 66
| 66
| [[Soundex|Soundex]]
| [[URL%20encoding|URL encoding]]
| Task
| Task
|-
|-
| 66
| 66
| [[Dynamic%20variable%20names|Dynamic variable names]]
| [[Unicode%20variable%20names|Unicode variable names]]
| Task
| Task
|-
|-
| 65
| 65
| [[Bitmap%2FBresenham%27s%20line%20algorithm|Bitmap/Bresenham's line algorithm]]
| [[Polymorphism|Polymorphism]]
| Task
| Task
|-
|-
| 65
| 65
| [[Equilibrium%20index|Equilibrium index]]
| [[Equilibrium%20index|Equilibrium index]]
| Task
|-
| 65
| [[Order%20two%20numerical%20lists|Order two numerical lists]]
| Task
| Task
|-
|-
Line 3,040: Line 3,036:
|-
|-
| 65
| 65
| [[Order%20two%20numerical%20lists|Order two numerical lists]]
| [[Bitmap%2FBresenham%27s%20line%20algorithm|Bitmap/Bresenham's line algorithm]]
| Task
| Task
|-
|-
| 64
| 65
| [[Polymorphism|Polymorphism]]
| [[Sorting%20algorithms%2FCounting%20sort|Sorting algorithms/Counting sort]]
| Task
| Task
|-
|-
Line 3,056: Line 3,052:
|-
|-
| 64
| 64
| [[Flow-control%20structures|Flow-control structures]]
| [[Write%20float%20arrays%20to%20a%20text%20file|Write float arrays to a text file]]
| Task
| Task
|-
|-
| 64
| 64
| [[Sorting%20algorithms%2FCounting%20sort|Sorting algorithms/Counting sort]]
| [[Flow-control%20structures|Flow-control structures]]
| Task
| Task
|-
|-
| 63
| 64
| [[Write%20float%20arrays%20to%20a%20text%20file|Write float arrays to a text file]]
| [[Sorting%20algorithms%2FComb%20sort|Sorting algorithms/Comb sort]]
| Task
| Task
|-
|-
Line 3,072: Line 3,068:
|-
|-
| 63
| 63
| [[Averages%2FMean%20angle|Averages/Mean angle]]
| [[Parsing%2FRPN%20calculator%20algorithm|Parsing/RPN calculator algorithm]]
| Task
| Task
|-
|-
| 63
| 63
| [[Forest%20fire|Forest fire]]
| [[Multifactorial|Multifactorial]]
| Task
| Task
|-
|-
Line 3,084: Line 3,080:
|-
|-
| 63
| 63
| [[Here%20document|Here document]]
| [[Multiple%20distinct%20objects|Multiple distinct objects]]
| Task
| Task
|-
|-
| 63
| 63
| [[Multifactorial|Multifactorial]]
| [[Semordnilap|Semordnilap]]
| Task
| Task
|-
|-
| 63
| 63
| [[Multiple%20distinct%20objects|Multiple distinct objects]]
| [[Here%20document|Here document]]
| Task
| Task
|-
|-
| 63
| 63
| [[Word%20wrap|Word wrap]]
| [[N%27th|N'th]]
| Task
| Task
|-
|-
| 63
| 63
| [[Parsing%2FRPN%20calculator%20algorithm|Parsing/RPN calculator algorithm]]
| [[N%27th|N'th]]
| Task
| Task
|-
|-
| 63
| 63
| [[Read%20a%20configuration%20file|Read a configuration file]]
| [[Forest%20fire|Forest fire]]
| Task
| Task
|-
|-
| 63
| 63
| [[Semordnilap|Semordnilap]]
| [[Read%20a%20configuration%20file|Read a configuration file]]
| Task
| Task
|-
|-
| 63
| 63
| [[Sorting%20algorithms%2FComb%20sort|Sorting algorithms/Comb sort]]
| [[Averages%2FMean%20angle|Averages/Mean angle]]
| Task
| Task
|-
|-
| 62
| 63
| [[Word%20wrap|Word wrap]]
| [[Largest%20int%20from%20concatenated%20ints|Largest int from concatenated ints]]
| Task
| Task
|-
|-
| 62
| 62
| [[Compare%20a%20list%20of%20strings|Compare a list of strings]]
| [[Sorting%20algorithms%2FStooge%20sort|Sorting algorithms/Stooge sort]]
| Task
| Task
|-
|-
| 62
| 62
| [[Constrained%20random%20points%20on%20a%20circle|Constrained random points on a circle]]
| [[Guess%20the%20number%2FWith%20feedback%20%28player%29|Guess the number/With feedback (player)]]
| Task
| Task
|-
|-
| 62
| 62
| [[Convert%20seconds%20to%20compound%20duration|Convert seconds to compound duration]]
| [[Compare%20a%20list%20of%20strings|Compare a list of strings]]
| Task
| Task
|-
|-
| 62
| 62
| [[Euler%20method|Euler method]]
| [[Count%20the%20coins|Count the coins]]
| Task
| Task
|-
|-
Line 3,140: Line 3,136:
|-
|-
| 62
| 62
| [[Euler%20method|Euler method]]
| [[Fibonacci%20n-step%20number%20sequences|Fibonacci n-step number sequences]]
| Task
| Task
|-
|-
| 62
| 62
| [[Exceptions%2FCatch%20an%20exception%20thrown%20in%20a%20nested%20call|Exceptions/Catch an exception thrown in a nested call]]
| [[Jensen%27s%20Device|Jensen's Device]]
| Task
| Task
|-
|-
| 62
| 62
| [[Fibonacci%20n-step%20number%20sequences|Fibonacci n-step number sequences]]
| [[Hofstadter%20Q%20sequence|Hofstadter Q sequence]]
| Task
| Task
|-
|-
| 62
| 62
| [[Guess%20the%20number%2FWith%20feedback%20%28player%29|Guess the number/With feedback (player)]]
| [[Pythagorean%20triples|Pythagorean triples]]
| Task
| Task
|-
|-
| 62
| 62
| [[Hofstadter%20Q%20sequence|Hofstadter Q sequence]]
| [[Exceptions%2FCatch%20an%20exception%20thrown%20in%20a%20nested%20call|Exceptions/Catch an exception thrown in a nested call]]
| Task
| Task
|-
|-
| 62
| 62
| [[Vigen%C3%A8re%20cipher|Vigenère cipher]]
| [[Jensen%27s%20Device|Jensen's Device]]
| Task
| Task
|-
|-
| 62
| 62
| [[Largest%20int%20from%20concatenated%20ints|Largest int from concatenated ints]]
| [[Count%20the%20coins|Count the coins]]
| Task
| Task
|-
|-
| 62
| 62
| [[Pythagorean%20triples|Pythagorean triples]]
| [[Convert%20seconds%20to%20compound%20duration|Convert seconds to compound duration]]
| Task
| Task
|-
|-
| 62
| 62
| [[Sorting%20algorithms%2FStooge%20sort|Sorting algorithms/Stooge sort]]
| [[Constrained%20random%20points%20on%20a%20circle|Constrained random points on a circle]]
| Task
| Task
|-
|-
| 61
| 62
| [[Vigen%C3%A8re%20cipher|Vigenère cipher]]
| [[Sudoku|Sudoku]]
| Task
| Task
|-
|-
| 61
| 61
| [[Animation|Animation]]
| [[Trabb%20Pardo%E2%80%93Knuth%20algorithm|Trabb Pardo–Knuth algorithm]]
| Task
| Task
|-
|-
Line 3,188: Line 3,184:
|-
|-
| 61
| 61
| [[Sort%20disjoint%20sublist|Sort disjoint sublist]]
| [[Draw%20a%20sphere|Draw a sphere]]
| Task
| Task
|-
|-
| 61
| 61
| [[Hello%20world%2FNewbie|Hello world/Newbie]]
| [[Long%20multiplication|Long multiplication]]
| Task
| Task
|-
|-
| 61
| 61
| [[Long%20multiplication|Long multiplication]]
| [[Hello%20world%2FNewbie|Hello world/Newbie]]
| Task
| Task
|-
|-
| 61
| 61
| [[Draw%20a%20sphere|Draw a sphere]]
| [[Sort%20disjoint%20sublist|Sort disjoint sublist]]
| Task
| Task
|-
|-
| 61
| 61
| [[Animation|Animation]]
| [[Sudoku|Sudoku]]
| Task
| Task
|-
|-
| 60
| 61
| [[Trabb%20Pardo%E2%80%93Knuth%20algorithm|Trabb Pardo–Knuth algorithm]]
| [[Sort%20stability|Sort stability]]
| Task
| Task
|-
|-
Line 3,216: Line 3,212:
|-
|-
| 60
| 60
| [[Numerical%20integration|Numerical integration]]
| [[Operator%20precedence|Operator precedence]]
| Task
| Task
|-
|-
| 60
| 60
| [[Operator%20precedence|Operator precedence]]
| [[Numerical%20integration|Numerical integration]]
| Task
| Task
|-
|-
Line 3,228: Line 3,224:
|-
|-
| 60
| 60
| [[Singly-linked%20list%2FElement%20insertion|Singly-linked list/Element insertion]]
| [[Strip%20control%20codes%20and%20extended%20characters%20from%20a%20string|Strip control codes and extended characters from a string]]
| Task
| Task
|-
|-
| 60
| 60
| [[Sort%20stability|Sort stability]]
| [[Singly-linked%20list%2FElement%20insertion|Singly-linked list/Element insertion]]
| Task
| Task
|-
|-
| 59
| 60
| [[Strip%20control%20codes%20and%20extended%20characters%20from%20a%20string|Strip control codes and extended characters from a string]]
| [[Four%20bit%20adder|Four bit adder]]
| Task
| Task
|-
|-
| 59
| 59
| [[Fork|Fork]]
| [[Named%20parameters|Named parameters]]
| Task
| Task
|-
|-
| 59
| 59
| [[Four%20bit%20adder|Four bit adder]]
| [[Runtime%20evaluation|Runtime evaluation]]
| Task
| Task
|-
|-
Line 3,252: Line 3,248:
|-
|-
| 59
| 59
| [[Named%20parameters|Named parameters]]
|data-sort-value="write language name in 0B3d ascii"| [[Write%20language%20name%20in%203D%20ASCII|Write language name in 3D ASCII]]
| Task
| Task
|-
|-
| 59
| 59
| [[Runtime%20evaluation|Runtime evaluation]]
| [[Fork|Fork]]
| Task
| Task
|-
|-
| 59
| 59
| [[Undefined%20values|Undefined values]]
| [[Undefined%20values|Undefined values]]
| Task
|-
| 59
|data-sort-value="write language name in 0B3d ascii"| [[Write%20language%20name%20in%203D%20ASCII|Write language name in 3D ASCII]]
| Task
| Task
|-
|-
Line 3,268: Line 3,268:
|-
|-
| 58
| 58
| [[Roots%20of%20a%20quadratic%20function|Roots of a quadratic function]]
| [[Call%20a%20foreign-language%20function|Call a foreign-language function]]
| Task
| Task
|-
|-
| 58
| 58
| [[Text%20processing%2FMax%20licenses%20in%20use|Text processing/Max licenses in use]]
| [[One%20of%20n%20lines%20in%20a%20file|One of n lines in a file]]
| Task
| Task
|-
|-
| 58
| 58
| [[One%20of%20n%20lines%20in%20a%20file|One of n lines in a file]]
| [[Remove%20lines%20from%20a%20file|Remove lines from a file]]
| Task
| Task
|-
|-
| 58
| 58
| [[Roots%20of%20a%20quadratic%20function|Roots of a quadratic function]]
| [[Variable%20size%2FGet|Variable size/Get]]
| Task
| Task
|-
|-
| 58
| 58
| [[Text%20processing%2FMax%20licenses%20in%20use|Text processing/Max licenses in use]]
| [[Remove%20lines%20from%20a%20file|Remove lines from a file]]
| Task
| Task
|-
|-
| 58
| 58
| [[Variable%20size%2FGet|Variable size/Get]]
| [[Call%20a%20foreign-language%20function|Call a foreign-language function]]
| Task
| Task
|-
|-
| 57
| 57
| [[Arithmetic%2FRational|Arithmetic/Rational]]
| [[Fractal%20tree|Fractal tree]]
| Task
| Task
|-
|-
| 57
| 57
| [[Closest-pair%20problem|Closest-pair problem]]
| [[Optional%20parameters|Optional parameters]]
| Task
| Task
|-
|-
| 57
| 57
| [[Combinations%20with%20repetitions|Combinations with repetitions]]
| [[Priority%20queue|Priority queue]]
| Task
| Task
|-
|-
| 57
| 57
| [[Phrase%20reversals|Phrase reversals]]
| [[Fractal%20tree|Fractal tree]]
| Task
| Task
|-
|-
| 57
| 57
| [[IBAN|IBAN]]
| [[Roots%20of%20a%20function|Roots of a function]]
| Task
| Task
|-
|-
| 57
| 57
| [[Optional%20parameters|Optional parameters]]
| [[IBAN|IBAN]]
| Task
| Task
|-
|-
| 57
| 57
| [[Phrase%20reversals|Phrase reversals]]
| [[Quaternion%20type|Quaternion type]]
| Task
| Task
|-
|-
Line 3,324: Line 3,324:
|-
|-
| 57
| 57
| [[Priority%20queue|Priority queue]]
| [[Runge-Kutta%20method|Runge-Kutta method]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 3,332: Line 3,332:
|-
|-
| 57
| 57
| [[Quaternion%20type|Quaternion type]]
| [[Arithmetic%2FRational|Arithmetic/Rational]]
| Task
| Task
|-
|-
| 57
| 57
| [[Rock-paper-scissors|Rock-paper-scissors]]
| [[Closest-pair%20problem|Closest-pair problem]]
| Task
| Task
|-
|-
| 57
| 57
| [[Roots%20of%20a%20function|Roots of a function]]
| [[Rock-paper-scissors|Rock-paper-scissors]]
| Task
| Task
|-
|-
| 57
| 57
| [[Runge-Kutta%20method|Runge-Kutta method]]
| [[Combinations%20with%20repetitions|Combinations with repetitions]]
| Task
| Task
|-
|-
| 56
| 56
| [[Memory%20allocation|Memory allocation]]
| [[Almost%20prime|Almost prime]]
| Task
| Task
|-
|-
Line 3,356: Line 3,356:
|-
|-
| 56
| 56
| [[HTTPS|HTTPS]]
| [[Magic%20squares%20of%20odd%20order|Magic squares of odd order]]
| Task
| Task
|-
|-
| 56
| 56
|data-sort-value="hofstadter-conway $0C10,0D000 sequence"| [[Hofstadter-Conway%20%2410%2C000%20sequence|Hofstadter-Conway $10,000 sequence]]
| [[Almost%20prime|Almost prime]]
| Task
| Task
|-
|-
Line 3,372: Line 3,372:
|-
|-
| 56
| 56
| [[Magic%20squares%20of%20odd%20order|Magic squares of odd order]]
| [[HTTPS|HTTPS]]
| Task
| Task
|-
|-
| 56
| 56
| [[Memory%20allocation|Memory allocation]]
|data-sort-value="hofstadter-conway $0C10,0D000 sequence"| [[Hofstadter-Conway%20%2410%2C000%20sequence|Hofstadter-Conway $10,000 sequence]]
| Task
| Task
|-
|-
| 56
| 56
|data-sort-value="sha-0B1"| [[SHA-1|SHA-1]]
|data-sort-value="sha-0B1"| [[SHA-1|SHA-1]]
| Task
|-
| 56
| [[Zeckendorf%20number%20representation|Zeckendorf number representation]]
| Task
| Task
|-
|-
Line 3,395: Line 3,391:
| Task
| Task
|-
|-
| 55
| 56
| [[Zeckendorf%20number%20representation|Zeckendorf number representation]]
| [[Special%20variables|Special variables]]
| Task
| Task
|-
|-
| 55
| 55
| [[AKS%20test%20for%20primes|AKS test for primes]]
| [[Knapsack%20problem%2FUnbounded|Knapsack problem/Unbounded]]
| Task
| Task
|-
|-
| 55
| 55
|data-sort-value="crc-0C32"| [[CRC-32|CRC-32]]
| [[AKS%20test%20for%20primes|AKS test for primes]]
| Task
| Task
|-
|-
| 55
| 55
| [[Cholesky%20decomposition|Cholesky decomposition]]
| [[Narcissistic%20decimal%20number|Narcissistic decimal number]]
| Task
| Task
|-
|-
| 55
| 55
| [[Currying|Currying]]
| [[Modular%20inverse|Modular inverse]]
| Task
| Task
|-
|-
| 55
| 55
| [[Extend%20your%20language|Extend your language]]
| [[Sorting%20algorithms%2FSleep%20sort|Sorting algorithms/Sleep sort]]
| Task
| Task
|-
|-
| 55
| 55
| [[Fast%20Fourier%20transform|Fast Fourier transform]]
| [[Cholesky%20decomposition|Cholesky decomposition]]
| Task
| Task
|-
|-
| 55
| 55
| [[Knapsack%20problem%2FUnbounded|Knapsack problem/Unbounded]]
| [[Extend%20your%20language|Extend your language]]
| Task
| Task
|-
|-
| 55
| 55
| [[XML%2FOutput|XML/Output]]
| [[Modular%20inverse|Modular inverse]]
| Task
| Task
|-
|-
| 55
| 55
| [[Narcissistic%20decimal%20number|Narcissistic decimal number]]
|data-sort-value="crc-0C32"| [[CRC-32|CRC-32]]
| Task
| Task
|-
|-
Line 3,440: Line 3,436:
|-
|-
| 55
| 55
| [[Sorting%20algorithms%2FSleep%20sort|Sorting algorithms/Sleep sort]]
| [[Currying|Currying]]
| Task
| Task
|-
|-
| 55
| 55
| [[Special%20variables|Special variables]]
| [[Fast%20Fourier%20transform|Fast Fourier transform]]
| Task
| Task
|-
|-
| 54
| 55
| [[Documentation|Documentation]]
| [[XML%2FOutput|XML/Output]]
| Task
| Task
|-
|-
Line 3,456: Line 3,452:
|-
|-
| 54
| 54
| [[Documentation|Documentation]]
| [[Partial%20function%20application|Partial function application]]
| Task
| Task
|-
|-
Line 3,468: Line 3,464:
|-
|-
| 54
| 54
| [[Non-decimal%20radices%2FInput|Non-decimal radices/Input]]
|data-sort-value="sha-0D256"| [[SHA-256|SHA-256]]
| Task
| Task
|-
|-
| 54
| 54
| [[Partial%20function%20application|Partial function application]]
| [[Non-decimal%20radices%2FInput|Non-decimal radices/Input]]
| Task
| Task
|-
|-
| 53
| 54
|data-sort-value="sha-0D256"| [[SHA-256|SHA-256]]
| [[Stem-and-leaf%20plot|Stem-and-leaf plot]]
| Task
| Task
|-
|-
| 53
| 53
| [[Animate%20a%20pendulum|Animate a pendulum]]
| [[Binary%20strings|Binary strings]]
| Task
| Task
|-
|-
| 53
| 53
| [[Binary%20strings|Binary strings]]
| [[Globally%20replace%20text%20in%20several%20files|Globally replace text in several files]]
| Task
| Task
|-
|-
| 53
| 53
| [[Calendar|Calendar]]
| [[Test%20a%20function|Test a function]]
| Task
| Task
|-
|-
| 53
| 53
| [[Factors%20of%20a%20Mersenne%20number|Factors of a Mersenne number]]
| [[Calendar|Calendar]]
| Task
| Task
|-
|-
| 53
| 53
| [[Globally%20replace%20text%20in%20several%20files|Globally replace text in several files]]
| [[Reduced%20row%20echelon%20form|Reduced row echelon form]]
| Task
| Task
|-
|-
Line 3,504: Line 3,500:
|-
|-
| 53
| 53
| [[Inheritance%2FMultiple|Inheritance/Multiple]]
| [[Animate%20a%20pendulum|Animate a pendulum]]
| Task
| Task
|-
|-
| 53
| 53
| [[Old%20lady%20swallowed%20a%20fly|Old lady swallowed a fly]]
| [[Yin%20and%20yang|Yin and yang]]
| Task
| Task
|-
|-
| 53
| 53
| [[Pernicious%20numbers|Pernicious numbers]]
| [[Factors%20of%20a%20Mersenne%20number|Factors of a Mersenne number]]
| Task
| Task
|-
|-
| 53
| 53
| [[Reduced%20row%20echelon%20form|Reduced row echelon form]]
| [[Old%20lady%20swallowed%20a%20fly|Old lady swallowed a fly]]
| Task
| Task
|-
|-
| 53
| 53
| [[Stem-and-leaf%20plot|Stem-and-leaf plot]]
| [[Pernicious%20numbers|Pernicious numbers]]
| Task
| Task
|-
|-
| 53
| 53
| [[Test%20a%20function|Test a function]]
| [[Inheritance%2FMultiple|Inheritance/Multiple]]
| Task
| Task
|-
|-
| 52
| 53
| [[Fibonacci%20word|Fibonacci word]]
| [[Yin%20and%20yang|Yin and yang]]
| Task
| Task
|-
|-
Line 3,540: Line 3,536:
|-
|-
| 52
| 52
| [[Fibonacci%20word|Fibonacci word]]
| [[Sorting%20algorithms%2FBead%20sort|Sorting algorithms/Bead sort]]
| Task
| Task
|-
|-
Line 3,548: Line 3,544:
|-
|-
| 52
| 52
| [[Scope%20modifiers|Scope modifiers]]
| [[Synchronous%20concurrency|Synchronous concurrency]]
| Task
| Task
|-
|-
| 52
| 52
| [[Sorting%20algorithms%2FBead%20sort|Sorting algorithms/Bead sort]]
| [[XML%2FXPath|XML/XPath]]
| Task
| Task
|-
|-
| 52
| 52
| [[Synchronous%20concurrency|Synchronous concurrency]]
| [[Scope%20modifiers|Scope modifiers]]
| Task
| Task
|-
|-
Line 3,563: Line 3,559:
| Task
| Task
|-
|-
| 51
| 52
| [[XML%2FXPath|XML/XPath]]
| [[Knapsack%20problem%2FContinuous|Knapsack problem/Continuous]]
| Task
| Task
|-
|-
| 51
| 51
| [[Arithmetic%20evaluation|Arithmetic evaluation]]
| [[Rep-string|Rep-string]]
| Task
| Task
|-
|-
| 51
| 51
| [[Dinesman%27s%20multiple-dwelling%20problem|Dinesman's multiple-dwelling problem]]
| [[Sequence%20of%20primes%20by%20trial%20division|Sequence of primes by trial division]]
| Task
| Task
|- style="background-color: #ffc"
| 51
| [[Repeat|Repeat]]
| Draft
|-
|-
| 51
| 51
| [[Hash%20join|Hash join]]
| [[Dinesman%27s%20multiple-dwelling%20problem|Dinesman's multiple-dwelling problem]]
| Task
| Task
|-
|-
| 51
| 51
| [[Knapsack%20problem%2FContinuous|Knapsack problem/Continuous]]
| [[Hash%20join|Hash join]]
| Task
| Task
|-
|-
| 51
| 51
| [[Rep-string|Rep-string]]
| [[Arithmetic%20evaluation|Arithmetic evaluation]]
| Task
| Task
|- style="background-color: #ffc"
| 51
| [[Repeat|Repeat]]
| Draft
|-
|-
| 51
| 51
| [[Rosetta%20Code%2FCount%20examples|Rosetta Code/Count examples]]
| [[Rosetta%20Code%2FCount%20examples|Rosetta Code/Count examples]]
| Task
|-
| 51
| [[Sequence%20of%20primes%20by%20trial%20division|Sequence of primes by trial division]]
| Task
| Task
|-
|-
Line 3,600: Line 3,600:
|-
|-
| 50
| 50
| [[Add%20a%20variable%20to%20a%20class%20instance%20at%20runtime|Add a variable to a class instance at runtime]]
| [[Miller%E2%80%93Rabin%20primality%20test|Miller–Rabin primality test]]
| Task
| Task
|-
|-
| 50
| 50
| [[Brownian%20tree|Brownian tree]]
| [[Unbias%20a%20random%20generator|Unbias a random generator]]
| Task
| Task
|-
|-
Line 3,612: Line 3,612:
|-
|-
| 50
| 50
| [[Continued%20fraction|Continued fraction]]
| [[Brownian%20tree|Brownian tree]]
| Task
| Task
|-
|-
| 50
| 50
| [[Unix%2Fls|Unix/ls]]
| [[Draw%20a%20clock|Draw a clock]]
| Task
| Task
|-
|-
| 50
| 50
| [[Miller%E2%80%93Rabin%20primality%20test|Miller–Rabin primality test]]
| [[Truncate%20a%20file|Truncate a file]]
| Task
| Task
|-
|-
| 50
| 50
| [[Runtime%20evaluation%2FIn%20an%20environment|Runtime evaluation/In an environment]]
| [[Stack%20traces|Stack traces]]
| Task
| Task
|-
|-
| 50
| 50
| [[Semiprime|Semiprime]]
| [[Continued%20fraction|Continued fraction]]
| Task
| Task
|-
|-
| 50
| 50
| [[Sorting%20algorithms%2FPermutation%20sort|Sorting algorithms/Permutation sort]]
| [[Draw%20a%20clock|Draw a clock]]
| Task
| Task
|-
|-
| 50
| 50
| [[Stack%20traces|Stack traces]]
| [[Runtime%20evaluation%2FIn%20an%20environment|Runtime evaluation/In an environment]]
| Task
| Task
|-
|-
| 50
| 50
| [[Truncate%20a%20file|Truncate a file]]
| [[Add%20a%20variable%20to%20a%20class%20instance%20at%20runtime|Add a variable to a class instance at runtime]]
| Task
| Task
|-
|-
| 50
| 50
| [[Unbias%20a%20random%20generator|Unbias a random generator]]
| [[Sorting%20algorithms%2FPermutation%20sort|Sorting algorithms/Permutation sort]]
| Task
| Task
|-
|-
| 50
| 50
| [[Semiprime|Semiprime]]
| [[Unix%2Fls|Unix/ls]]
| Task
| Task
|-
|-
| 49
| 49
| [[Averages%2FMean%20time%20of%20day|Averages/Mean time of day]]
| [[Knight%27s%20tour|Knight's tour]]
| Task
| Task
|-
|-
| 49
| 49
| [[Deal%20cards%20for%20FreeCell|Deal cards for FreeCell]]
| [[Averages%2FMean%20time%20of%20day|Averages/Mean time of day]]
| Task
| Task
|-
|-
| 49
| 49
| [[Euler%27s%20sum%20of%20powers%20conjecture|Euler's sum of powers conjecture]]
| [[Plot%20coordinate%20pairs|Plot coordinate pairs]]
| Task
| Task
|-
|-
| 49
| 49
| [[Knight%27s%20tour|Knight's tour]]
| [[Deal%20cards%20for%20FreeCell|Deal cards for FreeCell]]
| Task
| Task
|-
|-
| 49
| 49
| [[LZW%20compression|LZW compression]]
| [[Tic-tac-toe|Tic-tac-toe]]
| Task
| Task
|-
|-
| 49
| 49
| [[Morse%20code|Morse code]]
| [[Euler%27s%20sum%20of%20powers%20conjecture|Euler's sum of powers conjecture]]
| Task
| Task
|-
|-
| 49
| 49
| [[Plot%20coordinate%20pairs|Plot coordinate pairs]]
| [[LZW%20compression|LZW compression]]
| Task
| Task
|-
|-
| 49
| 49
| [[Morse%20code|Morse code]]
| [[Tic-tac-toe|Tic-tac-toe]]
| Task
| Task
|-
|-
Line 3,688: Line 3,688:
|-
|-
| 48
| 48
| [[Circles%20of%20given%20radius%20through%20two%20points|Circles of given radius through two points]]
| [[Pointers%20and%20references|Pointers and references]]
| Task
| Task
|-
|-
| 48
| 48
| [[Generator%2FExponential|Generator/Exponential]]
| [[Generator%2FExponential|Generator/Exponential]]
| Task
|-
| 48
| [[Circles%20of%20given%20radius%20through%20two%20points|Circles of given radius through two points]]
| Task
| Task
|-
|-
Line 3,712: Line 3,708:
|-
|-
| 48
| 48
| [[Pointers%20and%20references|Pointers and references]]
| [[Unicode%20strings|Unicode strings]]
| Task
| Task
|-
|-
| 48
| 48
| [[Terminal%20control%2FDisplay%20an%20extended%20character|Terminal control/Display an extended character]]
| [[Terminal%20control%2FDisplay%20an%20extended%20character|Terminal control/Display an extended character]]
| Task
|-
| 48
| [[Unicode%20strings|Unicode strings]]
| Task
| Task
|-
|-
Line 3,724: Line 3,724:
|-
|-
| 47
| 47
| [[Doubly-linked%20list%2FElement%20definition|Doubly-linked list/Element definition]]
| [[Send%20email|Send email]]
| Task
| Task
|-
|-
| 47
| 47
| [[Dutch%20national%20flag%20problem|Dutch national flag problem]]
| [[Left%20factorials|Left factorials]]
| Task
| Task
|-
|-
| 47
| 47
| [[Integer%20overflow|Integer overflow]]
| [[Split%20a%20character%20string%20based%20on%20change%20of%20character|Split a character string based on change of character]]
| Task
| Task
|-
|-
| 47
| 47
| [[Left%20factorials|Left factorials]]
| [[Non-continuous%20subsequences|Non-continuous subsequences]]
| Task
| Task
|-
|-
| 47
| 47
| [[Mouse%20position|Mouse position]]
| [[Wireworld|Wireworld]]
| Task
| Task
|-
|-
| 47
| 47
| [[Multisplit|Multisplit]]
| [[Dutch%20national%20flag%20problem|Dutch national flag problem]]
| Task
| Task
|-
|-
| 47
| 47
| [[Non-continuous%20subsequences|Non-continuous subsequences]]
| [[Integer%20overflow|Integer overflow]]
| Task
| Task
|-
|-
| 47
| 47
| [[Rosetta%20Code%2FRank%20languages%20by%20popularity|Rosetta Code/Rank languages by popularity]]
| [[Multisplit|Multisplit]]
| Task
| Task
|-
|-
| 47
| 47
| [[Send%20email|Send email]]
| [[Statistics%2FBasic|Statistics/Basic]]
| Task
| Task
|-
|-
| 47
| 47
| [[Split%20a%20character%20string%20based%20on%20change%20of%20character|Split a character string based on change of character]]
| [[Doubly-linked%20list%2FElement%20definition|Doubly-linked list/Element definition]]
| Task
| Task
|-
|-
| 47
| 47
| [[Statistics%2FBasic|Statistics/Basic]]
| [[Mouse%20position|Mouse position]]
| Task
| Task
|-
|-
| 47
| 47
| [[Wireworld|Wireworld]]
| [[Rosetta%20Code%2FRank%20languages%20by%20popularity|Rosetta Code/Rank languages by popularity]]
| Task
| Task
|-
|-
Line 3,776: Line 3,776:
|-
|-
| 46
| 46
| [[Nested%20function|Nested function]]
| [[Truncatable%20primes|Truncatable primes]]
| Task
| Task
|-
|-
| 46
| 46
|data-sort-value="text processing/0B2"| [[Text%20processing%2F2|Text processing/2]]
|data-sort-value="text processing/0B1"| [[Text%20processing%2F1|Text processing/1]]
| Task
| Task
|-
|-
| 46
| 46
|data-sort-value="text processing/0B2"| [[Text%20processing%2F2|Text processing/2]]
| [[Nested%20function|Nested function]]
| Task
| Task
|-
|-
| 46
| 46
| [[Truncatable%20primes|Truncatable primes]]
| [[User%20input%2FGraphical|User input/Graphical]]
| Task
| Task
|-
|-
| 46
| 46
| [[User%20input%2FGraphical|User input/Graphical]]
|data-sort-value="text processing/0B1"| [[Text%20processing%2F1|Text processing/1]]
| Task
| Task
|-
|-
| 45
| 45
| [[Define%20a%20primitive%20data%20type|Define a primitive data type]]
| [[XML%2FDOM%20serialization|XML/DOM serialization]]
| Task
| Task
|-
|-
| 45
| 45
| [[Draw%20a%20cuboid|Draw a cuboid]]
| [[JortSort|JortSort]]
| Task
| Task
|-
|-
| 45
| 45
| [[First-class%20functions%2FUse%20numbers%20analogously|First-class functions/Use numbers analogously]]
| [[Define%20a%20primitive%20data%20type|Define a primitive data type]]
| Task
| Task
|-
|-
| 45
| 45
| [[Draw%20a%20cuboid|Draw a cuboid]]
| [[Handle%20a%20signal|Handle a signal]]
| Task
| Task
|-
|-
| 45
| 45
| [[JortSort|JortSort]]
| [[Random%20number%20generator%20%28device%29|Random number generator (device)]]
| Task
| Task
|-
|-
| 45
| 45
| [[Ludic%20numbers|Ludic numbers]]
| [[Thue-Morse|Thue-Morse]]
| Task
| Task
|-
|-
Line 3,824: Line 3,824:
|-
|-
| 45
| 45
| [[Munchausen%20numbers|Munchausen numbers]]
| [[Respond%20to%20an%20unknown%20method%20call|Respond to an unknown method call]]
| Task
| Task
|-
|-
| 45
| 45
| [[Random%20number%20generator%20%28device%29|Random number generator (device)]]
| [[Ludic%20numbers|Ludic numbers]]
| Task
| Task
|-
|-
| 45
| 45
| [[Respond%20to%20an%20unknown%20method%20call|Respond to an unknown method call]]
| [[First-class%20functions%2FUse%20numbers%20analogously|First-class functions/Use numbers analogously]]
| Task
| Task
|-
|-
| 45
| 45
| [[Seven-sided%20dice%20from%20five-sided%20dice|Seven-sided dice from five-sided dice]]
| [[Stable%20marriage%20problem|Stable marriage problem]]
| Task
| Task
|-
|-
| 45
| 45
| [[Stable%20marriage%20problem|Stable marriage problem]]
| [[Seven-sided%20dice%20from%20five-sided%20dice|Seven-sided dice from five-sided dice]]
| Task
| Task
|-
|-
| 45
| 45
| [[Thue-Morse|Thue-Morse]]
| [[Handle%20a%20signal|Handle a signal]]
| Task
| Task
|-
|-
| 45
| 45
| [[XML%2FDOM%20serialization|XML/DOM serialization]]
| [[Munchausen%20numbers|Munchausen numbers]]
| Task
| Task
|-
|-
Line 3,856: Line 3,856:
|-
|-
| 44
| 44
| [[Delegates|Delegates]]
| [[Table%20creation%2FPostal%20addresses|Table creation/Postal addresses]]
| Task
| Task
|-
|-
| 44
| 44
| [[General%20FizzBuzz|General FizzBuzz]]
| [[Delegates|Delegates]]
| Task
| Task
|-
|-
| 44
| 44
| [[Heronian%20triangles|Heronian triangles]]
| [[Sierpinski%20triangle%2FGraphical|Sierpinski triangle/Graphical]]
| Task
| Task
|-
|-
| 44
| 44
| [[Matrix-exponentiation%20operator|Matrix-exponentiation operator]]
| [[Heronian%20triangles|Heronian triangles]]
| Task
| Task
|-
|-
Line 3,876: Line 3,876:
|-
|-
| 44
| 44
| [[Sierpinski%20triangle%2FGraphical|Sierpinski triangle/Graphical]]
| [[Matrix-exponentiation%20operator|Matrix-exponentiation operator]]
| Task
| Task
|-
|-
| 44
| 44
| [[Table%20creation%2FPostal%20addresses|Table creation/Postal addresses]]
| [[Ternary%20logic|Ternary logic]]
| Task
| Task
|-
|-
| 44
| 44
| [[General%20FizzBuzz|General FizzBuzz]]
| [[Ternary%20logic|Ternary logic]]
| Task
| Task
|-
|-
| 43
| 43
| [[Bernoulli%20numbers|Bernoulli numbers]]
| [[Discordian%20date|Discordian date]]
| Task
| Task
|-
|-
| 43
| 43
| [[Call%20a%20function%20in%20a%20shared%20library|Call a function in a shared library]]
| [[Longest%20increasing%20subsequence|Longest increasing subsequence]]
| Task
| Task
|-
|-
| 43
| 43
| [[Discordian%20date|Discordian date]]
| [[Call%20a%20function%20in%20a%20shared%20library|Call a function in a shared library]]
| Task
| Task
|-
|-
| 43
| 43
| [[Keyboard%20input%2FKeypress%20check|Keyboard input/Keypress check]]
| [[Bernoulli%20numbers|Bernoulli numbers]]
| Task
| Task
|-
|-
| 43
| 43
| [[Longest%20increasing%20subsequence|Longest increasing subsequence]]
| [[Keyboard%20input%2FKeypress%20check|Keyboard input/Keypress check]]
| Task
| Task
|-
|-
Line 3,920: Line 3,920:
|-
|-
| 42
| 42
|data-sort-value="0C15 puzzle game"| [[15%20Puzzle%20Game|15 Puzzle Game]]
| [[Mad%20Libs|Mad Libs]]
| Task
| Task
|-
|-
| 42
| 42
|data-sort-value="0B9 billion names of god the integer"| [[9%20billion%20names%20of%20God%20the%20integer|9 billion names of God the integer]]
| [[Emirp%20primes|Emirp primes]]
| Task
| Task
|-
|-
| 42
| 42
| [[Emirp%20primes|Emirp primes]]
| [[Send%20an%20unknown%20method%20call|Send an unknown method call]]
| Task
| Task
|-
|-
| 42
| 42
| [[Mad%20Libs|Mad Libs]]
|data-sort-value="0B9 billion names of god the integer"| [[9%20billion%20names%20of%20God%20the%20integer|9 billion names of God the integer]]
| Task
| Task
|-
|-
Line 3,940: Line 3,940:
|-
|-
| 42
| 42
| [[Send%20an%20unknown%20method%20call|Send an unknown method call]]
|data-sort-value="0C15 puzzle game"| [[15%20Puzzle%20Game|15 Puzzle Game]]
| Task
| Task
|-
|-
| 41
| 41
| [[Color%20of%20a%20screen%20pixel|Color of a screen pixel]]
| [[Doubly-linked%20list%2FElement%20insertion|Doubly-linked list/Element insertion]]
| Task
| Task
|-
|-
Line 3,952: Line 3,952:
|-
|-
| 41
| 41
| [[Convert%20decimal%20number%20to%20rational|Convert decimal number to rational]]
| [[Strip%20block%20comments|Strip block comments]]
| Task
| Task
|-
|-
| 41
| 41
| [[Dining%20philosophers|Dining philosophers]]
| [[Inverted%20syntax|Inverted syntax]]
| Task
| Task
|-
|-
| 41
| 41
| [[Doubly-linked%20list%2FElement%20insertion|Doubly-linked list/Element insertion]]
| [[Longest%20string%20challenge|Longest string challenge]]
| Task
| Task
|-
|- style="background-color: #ffc"
| 41
| 41
| [[Execute%20a%20Markov%20algorithm|Execute a Markov algorithm]]
| [[Two%20Sum|Two Sum]]
| Draft
| Task
|-
|-
| 41
| 41
| [[Exponentiation%20order|Exponentiation order]]
| [[Convert%20decimal%20number%20to%20rational|Convert decimal number to rational]]
| Task
| Task
|-
|-
| 41
| 41
| [[Hofstadter%20Figure-Figure%20sequences|Hofstadter Figure-Figure sequences]]
| [[Holidays%20related%20to%20Easter|Holidays related to Easter]]
| Task
| Task
|-
|-
| 41
| 41
| [[Holidays%20related%20to%20Easter|Holidays related to Easter]]
| [[Color%20of%20a%20screen%20pixel|Color of a screen pixel]]
| Task
| Task
|-
|-
| 41
| 41
| [[Rate%20counter|Rate counter]]
| [[Inverted%20syntax|Inverted syntax]]
| Task
| Task
|-
|-
| 41
| 41
| [[Iterated%20digits%20squaring|Iterated digits squaring]]
| [[Universal%20Turing%20machine|Universal Turing machine]]
| Task
| Task
|-
|-
| 41
| 41
| [[Longest%20string%20challenge|Longest string challenge]]
| [[Dining%20philosophers|Dining philosophers]]
| Task
| Task
|-
|-
Line 3,996: Line 3,996:
|-
|-
| 41
| 41
| [[Rate%20counter|Rate counter]]
| [[Exponentiation%20order|Exponentiation order]]
| Task
| Task
|-
|-
| 41
| 41
| [[Strip%20block%20comments|Strip block comments]]
| [[Iterated%20digits%20squaring|Iterated digits squaring]]
| Task
| Task
|- style="background-color: #ffc"
| 41
| [[Two%20Sum|Two Sum]]
| Draft
|-
|-
| 41
| 41
| [[Universal%20Turing%20machine|Universal Turing machine]]
| [[Execute%20a%20Markov%20algorithm|Execute a Markov algorithm]]
| Task
| Task
|-
|-
| 41
| 40
| [[Doubly-linked%20list%2FTraversal|Doubly-linked list/Traversal]]
| [[Hofstadter%20Figure-Figure%20sequences|Hofstadter Figure-Figure sequences]]
| Task
| Task
|-
|-
Line 4,020: Line 4,024:
|-
|-
| 40
| 40
| [[Move-to-front%20algorithm|Move-to-front algorithm]]
| [[Doubly-linked%20list%2FTraversal|Doubly-linked list/Traversal]]
| Task
| Task
|-
|-
Line 4,031: Line 4,035:
| Task
| Task
|-
|-
| 40
| 39
| [[Archimedean%20spiral|Archimedean spiral]]
| [[Move-to-front%20algorithm|Move-to-front algorithm]]
| Task
| Task
|-
|-
| 39
| 39
| [[Barnsley%20fern|Barnsley fern]]
| [[GUI%20component%20interaction|GUI component interaction]]
| Task
| Task
|-
|-
| 39
| 39
| [[Bitmap%2FFlood%20fill|Bitmap/Flood fill]]
| [[Get%20system%20command%20output|Get system command output]]
| Task
| Task
|-
|-
| 39
| 39
| [[Bitmap%2FRead%20a%20PPM%20file|Bitmap/Read a PPM file]]
| [[Zebra%20puzzle|Zebra puzzle]]
| Task
| Task
|- style="background-color: #ffc"
| 39
| [[Extract%20file%20extension|Extract file extension]]
| Draft
|-
|-
| 39
| 39
| [[GUI%20component%20interaction|GUI component interaction]]
| [[Search%20a%20list%20of%20records|Search a list of records]]
| Task
| Task
|-
|-
| 39
| 39
| [[Get%20system%20command%20output|Get system command output]]
| [[Archimedean%20spiral|Archimedean spiral]]
| Task
| Task
|-
|-
| 39
| 39
| [[Greyscale%20bars%2FDisplay|Greyscale bars/Display]]
| [[Polynomial%20regression|Polynomial regression]]
| Task
| Task
|-
|-
| 39
| 39
| [[Polynomial%20regression|Polynomial regression]]
| [[Bitmap%2FRead%20a%20PPM%20file|Bitmap/Read a PPM file]]
| Task
| Task
|- style="background-color: #ffc"
| 39
| [[Extract%20file%20extension|Extract file extension]]
| Draft
|-
|-
| 39
| 39
| [[Search%20a%20list%20of%20records|Search a list of records]]
| [[Barnsley%20fern|Barnsley fern]]
| Task
| Task
|-
|-
| 39
| 39
| [[Zebra%20puzzle|Zebra puzzle]]
| [[Greyscale%20bars%2FDisplay|Greyscale bars/Display]]
| Task
| Task
|-
|-
| 39
| 38
| [[Atomic%20updates|Atomic updates]]
| [[Bitmap%2FFlood%20fill|Bitmap/Flood fill]]
| Task
| Task
|-
|-
| 38
| 38
| [[DNS%20query|DNS query]]
| [[Polynomial%20long%20division|Polynomial long division]]
| Task
| Task
|-
|-
| 38
| 38
| [[Determine%20if%20only%20one%20instance%20is%20running|Determine if only one instance is running]]
| [[History%20variables|History variables]]
| Task
| Task
|-
|-
Line 4,096: Line 4,100:
|-
|-
| 38
| 38
| [[History%20variables|History variables]]
| [[Set%20consolidation|Set consolidation]]
| Task
| Task
|-
|-
| 38
| 38
| [[OpenGL|OpenGL]]
| [[Determine%20if%20only%20one%20instance%20is%20running|Determine if only one instance is running]]
| Task
| Task
|-
|-
| 38
| 38
| [[Polynomial%20long%20division|Polynomial long division]]
| [[Sorting%20algorithms%2FStrand%20sort|Sorting algorithms/Strand sort]]
| Task
| Task
|-
|-
Line 4,116: Line 4,120:
|-
|-
| 38
| 38
| [[Set%20consolidation|Set consolidation]]
| [[Sparkline%20in%20unicode|Sparkline in unicode]]
| Task
| Task
|-
|-
| 38
| 38
| [[Sorting%20algorithms%2FStrand%20sort|Sorting algorithms/Strand sort]]
| [[DNS%20query|DNS query]]
| Task
| Task
|-
|-
| 38
| 38
| [[Sparkline%20in%20unicode|Sparkline in unicode]]
| [[Atomic%20updates|Atomic updates]]
| Task
|-
| 38
| [[OpenGL|OpenGL]]
| Task
| Task
|-
|-
Line 4,136: Line 4,136:
|-
|-
| 37
| 37
| [[Image%20noise|Image noise]]
| [[Variable%20size%2FSet|Variable size/Set]]
| Task
| Task
|-
|-
| 37
| 37
| [[Parametric%20polymorphism|Parametric polymorphism]]
| [[Pig%20the%20dice%20game|Pig the dice game]]
| Task
| Task
|-
|-
| 37
| 37
| [[Perfect%20shuffle|Perfect shuffle]]
| [[Parametric%20polymorphism|Parametric polymorphism]]
| Task
| Task
|-
|-
| 37
| 37
| [[Pig%20the%20dice%20game|Pig the dice game]]
| [[Terminal%20control%2FInverse%20video|Terminal control/Inverse video]]
| Task
| Task
|-
|-
| 37
| 37
| [[Subtractive%20generator|Subtractive generator]]
| [[Image%20noise|Image noise]]
| Task
| Task
|-
|-
| 37
| 37
| [[Terminal%20control%2FInverse%20video|Terminal control/Inverse video]]
| [[Perfect%20shuffle|Perfect shuffle]]
| Task
| Task
|-
|-
| 37
| 37
| [[Variable%20size%2FSet|Variable size/Set]]
| [[Subtractive%20generator|Subtractive generator]]
| Task
| Task
|- style="background-color: #ffc"
| 36
| [[Dijkstra%27s%20algorithm|Dijkstra's algorithm]]
| Draft
|-
|-
| 36
| 36
| [[Active%20object|Active object]]
| [[Metaprogramming|Metaprogramming]]
| Task
| Task
|-
|-
| 36
| 36
| [[Department%20Numbers|Department Numbers]]
|data-sort-value="generate chess0D960 starting position"| [[Generate%20Chess960%20starting%20position|Generate Chess960 starting position]]
| Task
| Task
|- style="background-color: #ffc"
|-
| 36
| 36
| [[Dijkstra%27s%20algorithm|Dijkstra's algorithm]]
| [[Pascal%20matrix%20generation|Pascal matrix generation]]
| Task
| Draft
|-
|-
| 36
| 36
| [[Doubly-linked%20list%2FDefinition|Doubly-linked list/Definition]]
| [[Narcissist|Narcissist]]
| Task
| Task
|-
|-
| 36
| 36
|data-sort-value="generate chess0D960 starting position"| [[Generate%20Chess960%20starting%20position|Generate Chess960 starting position]]
| [[Doubly-linked%20list%2FDefinition|Doubly-linked list/Definition]]
| Task
| Task
|-
|-
| 36
| 36
| [[Inverted%20index|Inverted index]]
| [[Terminal%20control%2FColoured%20text|Terminal control/Coloured text]]
| Task
| Task
|-
|-
| 36
| 36
|data-sort-value="md0B5/implementation"| [[MD5%2FImplementation|MD5/Implementation]]
| [[Active%20object|Active object]]
| Task
| Task
|-
|-
| 36
| 36
| [[Metaprogramming|Metaprogramming]]
| [[Inverted%20index|Inverted index]]
| Task
| Task
|-
|-
| 36
| 36
| [[Narcissist|Narcissist]]
| [[Department%20Numbers|Department Numbers]]
| Task
| Task
|-
|-
| 36
| 36
| [[Pascal%20matrix%20generation|Pascal matrix generation]]
|data-sort-value="md0B5/implementation"| [[MD5%2FImplementation|MD5/Implementation]]
| Task
| Task
|-
|-
Line 4,213: Line 4,209:
| 36
| 36
| [[Stern-Brocot%20sequence|Stern-Brocot sequence]]
| [[Stern-Brocot%20sequence|Stern-Brocot sequence]]
| Task
|-
| 36
| [[Terminal%20control%2FColoured%20text|Terminal control/Coloured text]]
| Task
| Task
|-
|-
Line 4,224: Line 4,224:
|-
|-
| 35
| 35
| [[Append%20a%20record%20to%20the%20end%20of%20a%20text%20file|Append a record to the end of a text file]]
| [[Validate%20International%20Securities%20Identification%20Number|Validate International Securities Identification Number]]
| Task
| Task
|- style="background-color: #ffc"
| 35
|data-sort-value="base0C64 encode data"| [[Base64%20encode%20data|Base64 encode data]]
| Draft
|-
|-
| 35
| 35
| [[Bitmap%2FMidpoint%20circle%20algorithm|Bitmap/Midpoint circle algorithm]]
| [[Percentage%20difference%20between%20images|Percentage difference between images]]
| Task
| Task
|-
|-
| 35
| 35
| [[Bulls%20and%20cows%2FPlayer|Bulls and cows/Player]]
| [[Append%20a%20record%20to%20the%20end%20of%20a%20text%20file|Append a record to the end of a text file]]
| Task
| Task
|-
|-
| 35
| 35
| [[Farey%20sequence|Farey sequence]]
| [[Ray-casting%20algorithm|Ray-casting algorithm]]
| Task
| Task
|-
|-
Line 4,244: Line 4,248:
|-
|-
| 35
| 35
| [[Kronecker%20product|Kronecker product]]
| [[Subleq|Subleq]]
| Task
| Task
|-
|-
| 35
| 35
| [[Farey%20sequence|Farey sequence]]
| [[Leonardo%20numbers|Leonardo numbers]]
| Task
| Task
|-
|-
| 35
| 35
| [[Matrix%20arithmetic|Matrix arithmetic]]
| [[Kronecker%20product|Kronecker product]]
| Task
| Task
|-
|-
| 35
| 35
| [[Percentage%20difference%20between%20images|Percentage difference between images]]
|data-sort-value="sum to 0D100"| [[Sum%20to%20100|Sum to 100]]
| Task
| Task
|- style="background-color: #ffc"
| 35
|data-sort-value="base0C64 encode data"| [[Base64%20encode%20data|Base64 encode data]]
| Draft
|-
|-
| 35
| 35
| [[Permutations%2FDerangements|Permutations/Derangements]]
| [[Bulls%20and%20cows%2FPlayer|Bulls and cows/Player]]
| Task
| Task
|-
|-
| 35
| 35
| [[Ray-casting%20algorithm|Ray-casting algorithm]]
| [[Matrix%20arithmetic|Matrix arithmetic]]
| Task
| Task
|-
|-
| 35
| 35
| [[Smith%20numbers|Smith numbers]]
| [[Visualize%20a%20tree|Visualize a tree]]
| Task
| Task
|-
|-
| 35
| 35
| [[Subleq|Subleq]]
| [[Permutations%2FDerangements|Permutations/Derangements]]
| Task
| Task
|-
|-
| 35
| 35
|data-sort-value="sum to 0D100"| [[Sum%20to%20100|Sum to 100]]
| [[Leonardo%20numbers|Leonardo numbers]]
| Task
| Task
|-
|-
| 35
| 35
| [[Validate%20International%20Securities%20Identification%20Number|Validate International Securities Identification Number]]
| [[Bitmap%2FMidpoint%20circle%20algorithm|Bitmap/Midpoint circle algorithm]]
| Task
| Task
|-
|-
Line 4,292: Line 4,292:
|-
|-
| 35
| 35
| [[Visualize%20a%20tree|Visualize a tree]]
| [[Smith%20numbers|Smith numbers]]
| Task
| Task
|-
|-
Line 4,298: Line 4,298:
| [[Average%20loop%20length|Average loop length]]
| [[Average%20loop%20length|Average loop length]]
| Task
| Task
|- style="background-color: #ffc"
| 34
| [[Longest%20common%20prefix|Longest common prefix]]
| Draft
|-
|-
| 34
| 34
| [[Balanced%20ternary|Balanced ternary]]
| [[Element-wise%20operations|Element-wise operations]]
| Task
| Task
|-
|-
| 34
| 34
| [[Calendar%20-%20for%20%22REAL%22%20programmers|Calendar - for "REAL" programmers]]
| [[Self-referential%20sequence|Self-referential sequence]]
| Task
| Task
|-
|-
| 34
| 34
| [[Chaos%20game|Chaos game]]
| [[Calendar%20-%20for%20%22REAL%22%20programmers|Calendar - for "REAL" programmers]]
| Task
| Task
|-
|-
| 34
| 34
| [[Element-wise%20operations|Element-wise operations]]
| [[Tokenize%20a%20string%20with%20escaping|Tokenize a string with escaping]]
| Task
| Task
|-
|-
| 34
| 34
| [[GUI%20enabling%2Fdisabling%20of%20controls|GUI enabling/disabling of controls]]
| [[Jaro%20distance|Jaro distance]]
| Task
| Task
|-
|-
| 34
| 34
| [[Hickerson%20series%20of%20almost%20integers|Hickerson series of almost integers]]
| [[Keyboard%20input%2FFlush%20the%20keyboard%20buffer|Keyboard input/Flush the keyboard buffer]]
| Task
| Task
|-
|-
| 34
| 34
| [[Jaro%20distance|Jaro distance]]
| [[Statistics%2FNormal%20distribution|Statistics/Normal distribution]]
| Task
| Task
|-
|-
| 34
| 34
| [[Keyboard%20input%2FFlush%20the%20keyboard%20buffer|Keyboard input/Flush the keyboard buffer]]
| [[Parallel%20calculations|Parallel calculations]]
| Task
| Task
|- style="background-color: #ffc"
| 34
| [[Longest%20common%20prefix|Longest common prefix]]
| Draft
|-
|-
| 34
| 34
| [[Parallel%20calculations|Parallel calculations]]
| [[Balanced%20ternary|Balanced ternary]]
| Task
| Task
|-
|-
| 34
| 34
| [[Self-referential%20sequence|Self-referential sequence]]
| [[GUI%20enabling%2Fdisabling%20of%20controls|GUI enabling/disabling of controls]]
| Task
| Task
|-
|-
| 34
| 34
| [[Statistics%2FNormal%20distribution|Statistics/Normal distribution]]
| [[Hickerson%20series%20of%20almost%20integers|Hickerson series of almost integers]]
| Task
| Task
|-
|-
| 34
| 34
| [[Tokenize%20a%20string%20with%20escaping|Tokenize a string with escaping]]
| [[Chaos%20game|Chaos game]]
| Task
| Task
|-
|-
| 33
| 33
| [[Amb|Amb]]
| [[Parsing%2FRPN%20to%20infix%20conversion|Parsing/RPN to infix conversion]]
| Task
| Task
|-
|-
| 33
| 33
|data-sort-value="carmichael 0B3 strong pseudoprimes"| [[Carmichael%203%20strong%20pseudoprimes|Carmichael 3 strong pseudoprimes]]
| [[Start%20from%20a%20main%20routine|Start from a main routine]]
| Task
| Task
|-
|-
| 33
| 33
| [[Combinations%20and%20permutations|Combinations and permutations]]
| [[Gaussian%20elimination|Gaussian elimination]]
| Task
| Task
|-
|-
| 33
| 33
| [[Constrained%20genericity|Constrained genericity]]
| [[Password%20generator|Password generator]]
| Task
| Task
|-
|-
| 33
| 33
| [[Gaussian%20elimination|Gaussian elimination]]
| [[Amb|Amb]]
| Task
| Task
|-
|-
| 33
| 33
| [[Naming%20conventions|Naming conventions]]
| [[Sorting%20algorithms%2FRadix%20sort|Sorting algorithms/Radix sort]]
| Task
| Task
|-
|-
| 33
| 33
| [[Parsing%2FRPN%20to%20infix%20conversion|Parsing/RPN to infix conversion]]
| [[Naming%20conventions|Naming conventions]]
| Task
| Task
|-
|-
| 33
| 33
| [[Password%20generator|Password generator]]
| [[Ulam%20spiral%20%28for%20primes%29|Ulam spiral (for primes)]]
| Task
| Task
|-
|-
| 33
| 33
| [[Sorting%20algorithms%2FRadix%20sort|Sorting algorithms/Radix sort]]
| [[Topswops|Topswops]]
| Task
| Task
|-
|-
| 33
| 33
| [[Start%20from%20a%20main%20routine|Start from a main routine]]
|data-sort-value="carmichael 0B3 strong pseudoprimes"| [[Carmichael%203%20strong%20pseudoprimes|Carmichael 3 strong pseudoprimes]]
| Task
| Task
|-
|-
| 33
| 33
| [[Topswops|Topswops]]
| [[Combinations%20and%20permutations|Combinations and permutations]]
| Task
| Task
|-
|-
| 33
| 33
| [[Ulam%20spiral%20%28for%20primes%29|Ulam spiral (for primes)]]
| [[Constrained%20genericity|Constrained genericity]]
| Task
| Task
|-
|-
| 32
| 32
|data-sort-value="0E2048"| [[2048|2048]]
| [[Pascal%27s%20triangle%2FPuzzle|Pascal's triangle/Puzzle]]
| Task
| Task
|- style="background-color: #ffc"
| 32
| [[Multiline%20shebang|Multiline shebang]]
| Draft
|-
|-
| 32
| 32
|data-sort-value="0B4-rings or 0B4-squares puzzle"| [[4-rings%20or%204-squares%20puzzle|4-rings or 4-squares puzzle]]
| [[S-Expressions|S-Expressions]]
| Task
| Task
|-
|-
| 32
| 32
| [[Aliquot%20sequence%20classifications|Aliquot sequence classifications]]
| [[Sort%20three%20variables|Sort three variables]]
| Task
| Task
|-
|-
| 32
| 32
| [[Knuth%27s%20algorithm%20S|Knuth's algorithm S]]
|data-sort-value="0E2048"| [[2048|2048]]
| Task
| Task
|- style="background-color: #ffc"
| 32
| [[Multiline%20shebang|Multiline shebang]]
| Draft
|-
|-
| 32
| 32
| [[Order%20disjoint%20list%20items|Order disjoint list items]]
| [[Vampire%20number|Vampire number]]
| Task
| Task
|-
|-
| 32
| 32
| [[Knuth%27s%20algorithm%20S|Knuth's algorithm S]]
| [[Pascal%27s%20triangle%2FPuzzle|Pascal's triangle/Puzzle]]
| Task
| Task
|-
|-
| 32
| 32
| [[S-Expressions|S-Expressions]]
| [[Aliquot%20sequence%20classifications|Aliquot sequence classifications]]
| Task
| Task
|-
|-
| 32
| 32
| [[Sort%20three%20variables|Sort three variables]]
| [[Order%20disjoint%20list%20items|Order disjoint list items]]
| Task
| Task
|-
|-
Line 4,440: Line 4,440:
|-
|-
| 32
| 32
| [[Vampire%20number|Vampire number]]
|data-sort-value="0B4-rings or 0B4-squares puzzle"| [[4-rings%20or%204-squares%20puzzle|4-rings or 4-squares puzzle]]
| Task
| Task
|-
|-
| 31
| 31
| [[Break%20OO%20privacy|Break OO privacy]]
| [[Events|Events]]
| Task
| Task
|-
|-
| 31
| 31
| [[CUSIP|CUSIP]]
| [[Extensible%20prime%20generator|Extensible prime generator]]
| Task
| Task
|-
|-
| 31
| 31
| [[Deepcopy|Deepcopy]]
| [[Metered%20concurrency|Metered concurrency]]
| Task
| Task
|-
|-
| 31
| 31
| [[Deepcopy|Deepcopy]]
| [[Events|Events]]
| Task
| Task
|-
|-
| 31
| 31
| [[Extensible%20prime%20generator|Extensible prime generator]]
| [[CUSIP|CUSIP]]
| Task
| Task
|-
|-
| 31
| 31
|data-sort-value="md0B4"| [[MD4|MD4]]
| [[Break%20OO%20privacy|Break OO privacy]]
| Task
| Task
|- style="background-color: #ffc"
| 31
| [[Vector|Vector]]
| Draft
|-
|-
| 31
| 31
| [[Metered%20concurrency|Metered concurrency]]
| [[Taxicab%20numbers|Taxicab numbers]]
| Task
| Task
|-
|-
| 31
| 31
| [[Permutation%20test|Permutation test]]
|data-sort-value="md0B4"| [[MD4|MD4]]
| Task
| Task
|-
|-
| 31
| 31
| [[Taxicab%20numbers|Taxicab numbers]]
| [[Permutation%20test|Permutation test]]
| Task
| Task
|- style="background-color: #ffc"
| 31
| [[Vector|Vector]]
| Draft
|-
|-
| 31
| 31
Line 4,488: Line 4,488:
|-
|-
| 30
| 30
| [[Bitmap%2FB%C3%A9zier%20curves%2FCubic|Bitmap/Bézier curves/Cubic]]
| [[Function%20prototype|Function prototype]]
| Task
| Task
|-
|-
| 30
| 30
| [[Cartesian%20product%20of%20two%20or%20more%20lists|Cartesian product of two or more lists]]
| [[LU%20decomposition|LU decomposition]]
| Task
| Task
|-
|-
| 30
| 30
| [[Casting%20out%20nines|Casting out nines]]
| [[GUI%2FMaximum%20window%20dimensions|GUI/Maximum window dimensions]]
| Task
| Task
|-
|-
| 30
| 30
| [[Fibonacci%20word%2Ffractal|Fibonacci word/fractal]]
| [[Numerical%20integration%2FGauss-Legendre%20Quadrature|Numerical integration/Gauss-Legendre Quadrature]]
| Task
| Task
|-
|-
| 30
| 30
| [[Scope%2FFunction%20names%20and%20labels|Scope/Function names and labels]]
| [[Function%20prototype|Function prototype]]
| Task
| Task
|-
|-
| 30
| 30
| [[GUI%2FMaximum%20window%20dimensions|GUI/Maximum window dimensions]]
| [[Fibonacci%20word%2Ffractal|Fibonacci word/fractal]]
| Task
| Task
|-
|-
| 30
| 30
| [[LU%20decomposition|LU decomposition]]
| [[Ordered%20Partitions|Ordered Partitions]]
| Task
| Task
|-
|-
| 30
| 30
| [[Numerical%20integration%2FGauss-Legendre%20Quadrature|Numerical integration/Gauss-Legendre Quadrature]]
| [[Casting%20out%20nines|Casting out nines]]
| Task
| Task
|-
|-
| 30
| 30
| [[Ordered%20Partitions|Ordered Partitions]]
| [[Cartesian%20product%20of%20two%20or%20more%20lists|Cartesian product of two or more lists]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 4,528: Line 4,528:
|-
|-
| 30
| 30
| [[Scope%2FFunction%20names%20and%20labels|Scope/Function names and labels]]
| [[Speech%20synthesis|Speech synthesis]]
| Task
| Task
|-
|-
| 30
| 30
| [[Speech%20synthesis|Speech synthesis]]
| [[Bitmap%2FB%C3%A9zier%20curves%2FCubic|Bitmap/Bézier curves/Cubic]]
| Task
| Task
|- style="background-color: #ffc"
| 29
| [[Input%2FOutput%20for%20Pairs%20of%20Numbers|Input/Output for Pairs of Numbers]]
| Draft
|-
|-
| 29
| 29
| [[Bitmap%2FHistogram|Bitmap/Histogram]]
| [[Julia%20set|Julia set]]
| Task
| Task
|-
|-
Line 4,546: Line 4,542:
| [[Conjugate%20transpose|Conjugate transpose]]
| [[Conjugate%20transpose|Conjugate transpose]]
| Task
| Task
|- style="background-color: #ffc"
| 29
| [[Input%2FOutput%20for%20Pairs%20of%20Numbers|Input/Output for Pairs of Numbers]]
| Draft
|-
|-
| 29
| 29
| [[Julia%20set|Julia set]]
| [[Bitmap%2FHistogram|Bitmap/Histogram]]
| Task
| Task
|-
|-
Line 4,560: Line 4,560:
|-
|-
| 28
| 28
| [[Bitmap%2FB%C3%A9zier%20curves%2FQuadratic|Bitmap/Bézier curves/Quadratic]]
| [[Terminal%20control%2FUnicode%20output|Terminal control/Unicode output]]
| Task
| Task
|-
|-
| 28
| 28
| [[Bitwise%20IO|Bitwise IO]]
| [[Executable%20library|Executable library]]
| Task
| Task
|-
|-
| 28
| 28
| [[Elementary%20cellular%20automaton|Elementary cellular automaton]]
| [[Topic%20variable|Topic variable]]
| Task
| Task
|-
|-
| 28
| 28
| [[Executable%20library|Executable library]]
| [[Minesweeper%20game|Minesweeper game]]
| Task
| Task
|-
|-
| 28
| 28
| [[Find%20the%20intersection%20of%20two%20lines|Find the intersection of two lines]]
| [[Simple%20database|Simple database]]
| Task
| Task
|-
|-
| 28
| 28
| [[Flipping%20bits%20game|Flipping bits game]]
| [[Bitwise%20IO|Bitwise IO]]
| Task
| Task
|-
|-
| 28
| 28
| [[Minesweeper%20game|Minesweeper game]]
| [[Elementary%20cellular%20automaton|Elementary cellular automaton]]
| Task
| Task
|-
|-
| 28
| 28
| [[Object%20serialization|Object serialization]]
| [[Sutherland-Hodgman%20polygon%20clipping|Sutherland-Hodgman polygon clipping]]
| Task
| Task
|- style="background-color: #ffc"
| 28
| [[Parse%20command-line%20arguments|Parse command-line arguments]]
| Draft
|-
|-
| 28
| 28
| [[Primorial%20numbers|Primorial numbers]]
| [[Find%20the%20intersection%20of%20two%20lines|Find the intersection of two lines]]
| Task
| Task
|-
|-
| 28
| 28
| [[Simple%20database|Simple database]]
| [[Object%20serialization|Object serialization]]
| Task
| Task
|-
|-
| 28
| 28
| [[Sutherland-Hodgman%20polygon%20clipping|Sutherland-Hodgman polygon clipping]]
| [[Primorial%20numbers|Primorial numbers]]
| Task
| Task
|-
|-
| 28
| 28
| [[Terminal%20control%2FUnicode%20output|Terminal control/Unicode output]]
| [[Water%20collected%20between%20towers|Water collected between towers]]
| Task
| Task
|-
|-
| 28
| 28
| [[Topic%20variable|Topic variable]]
| [[Flipping%20bits%20game|Flipping bits game]]
| Task
| Task
|- style="background-color: #ffc"
| 28
| [[Parse%20command-line%20arguments|Parse command-line arguments]]
| Draft
|-
|-
| 28
| 28
| [[Water%20collected%20between%20towers|Water collected between towers]]
| [[Bitmap%2FB%C3%A9zier%20curves%2FQuadratic|Bitmap/Bézier curves/Quadratic]]
| Task
| Task
|- style="background-color: #ffc"
| 27
| [[File%20extension%20is%20in%20extensions%20list|File extension is in extensions list]]
| Draft
|-
|-
| 27
| 27
| [[Bitcoin%2Faddress%20validation|Bitcoin/address validation]]
| [[Penney%27s%20game|Penney's game]]
| Task
| Task
|-
|-
| 27
| 27
| [[Colour%20pinstripe%2FDisplay|Colour pinstripe/Display]]
| [[Multiple%20regression|Multiple regression]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 27
| 27
| [[File%20extension%20is%20in%20extensions%20list|File extension is in extensions list]]
| [[Sattolo%20cycle|Sattolo cycle]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 4,640: Line 4,636:
|-
|-
| 27
| 27
| [[Multiple%20regression|Multiple regression]]
| [[Colour%20pinstripe%2FDisplay|Colour pinstripe/Display]]
| Task
| Task
|-
|-
| 27
| 27
| [[Penney%27s%20game|Penney's game]]
| [[Bitcoin%2Faddress%20validation|Bitcoin/address validation]]
| Task
| Task
|-
|-
Line 4,650: Line 4,646:
| [[Pinstripe%2FDisplay|Pinstripe/Display]]
| [[Pinstripe%2FDisplay|Pinstripe/Display]]
| Task
| Task
|- style="background-color: #ffc"
| 27
| [[Sattolo%20cycle|Sattolo cycle]]
| Draft
|-
|-
| 26
| 26
| [[Memory%20layout%20of%20a%20data%20structure|Memory layout of a data structure]]
| [[Sailors%2C%20coconuts%20and%20a%20monkey%20problem|Sailors, coconuts and a monkey problem]]
| Task
| Task
|-
|-
| 26
| 26
| [[Numeric%20error%20propagation|Numeric error propagation]]
| [[RSA%20code|RSA code]]
| Task
| Task
|- style="background-color: #ffc"
| 26
| [[Sorting%20Algorithms%2FCircle%20Sort|Sorting Algorithms/Circle Sort]]
| Draft
|-
|-
| 26
| 26
| [[Pathological%20floating%20point%20problems|Pathological floating point problems]]
| [[Memory%20layout%20of%20a%20data%20structure|Memory layout of a data structure]]
| Task
| Task
|-
|-
| 26
| 26
| [[RSA%20code|RSA code]]
| [[Zhang-Suen%20thinning%20algorithm|Zhang-Suen thinning algorithm]]
| Task
| Task
|-
|-
| 26
| 26
| [[Ranking%20methods|Ranking methods]]
| [[Numeric%20error%20propagation|Numeric error propagation]]
| Task
| Task
|-
|-
| 26
| 26
| [[Sailors%2C%20coconuts%20and%20a%20monkey%20problem|Sailors, coconuts and a monkey problem]]
| [[Set%20puzzle|Set puzzle]]
| Task
| Task
|-
|-
| 26
| 26
| [[Set%20puzzle|Set puzzle]]
| [[Pathological%20floating%20point%20problems|Pathological floating point problems]]
| Task
| Task
|- style="background-color: #ffc"
| 26
| [[Sorting%20Algorithms%2FCircle%20Sort|Sorting Algorithms/Circle Sort]]
| Draft
|-
|-
| 26
| 26
| [[Zhang-Suen%20thinning%20algorithm|Zhang-Suen thinning algorithm]]
| [[Ranking%20methods|Ranking methods]]
| Task
| Task
|-
|-
| 25
| 25
| [[Arena%20storage%20pool|Arena storage pool]]
| [[Update%20a%20configuration%20file|Update a configuration file]]
| Task
| Task
|- style="background-color: #ffc"
| 25
| [[Check%20output%20device%20is%20a%20terminal|Check output device is a terminal]]
| Draft
|-
|-
| 25
| 25
| [[Continued%20fraction%2FArithmetic%2FConstruct%20from%20rational%20number|Continued fraction/Arithmetic/Construct from rational number]]
| [[Textonyms|Textonyms]]
| Task
| Task
|-
|-
| 25
| 25
| [[Entropy%2FNarcissist|Entropy/Narcissist]]
| [[Straddling%20checkerboard|Straddling checkerboard]]
| Task
| Task
|-
|-
| 25
| 25
| [[Execute%20SNUSP|Execute SNUSP]]
| [[Magic%20squares%20of%20doubly%20even%20order|Magic squares of doubly even order]]
| Task
| Task
|-
|-
| 25
| 25
| [[First%20class%20environments|First class environments]]
| [[Formal%20power%20series|Formal power series]]
| Task
| Task
|-
|- style="background-color: #ffc"
| 25
| 25
| [[Floyd-Warshall%20algorithm|Floyd-Warshall algorithm]]
| [[Subset%20sum%20problem|Subset sum problem]]
| Draft
| Task
|-
|-
| 25
| 25
| [[Formal%20power%20series|Formal power series]]
| [[Execute%20SNUSP|Execute SNUSP]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 25
| 25
| [[Longest%20Common%20Substring|Longest Common Substring]]
| [[Check%20output%20device%20is%20a%20terminal|Check output device is a terminal]]
| Draft
| Draft
|-
|-
| 25
| 25
| [[Magic%20squares%20of%20doubly%20even%20order|Magic squares of doubly even order]]
| [[Entropy%2FNarcissist|Entropy/Narcissist]]
| Task
| Task
|-
|-
| 25
| 25
| [[Multiplicative%20order|Multiplicative order]]
| [[State%20name%20puzzle|State name puzzle]]
| Task
| Task
|-
|-
Line 4,732: Line 4,736:
|-
|-
| 25
| 25
| [[QR%20decomposition|QR decomposition]]
| [[Multiplicative%20order|Multiplicative order]]
| Task
| Task
|-
|-
| 25
| 25
|data-sort-value="ripemd-0D160"| [[RIPEMD-160|RIPEMD-160]]
| [[Arena%20storage%20pool|Arena storage pool]]
| Task
| Task
|- style="background-color: #ffc"
|-
| 25
| 25
|data-sort-value="read a file character by character/utf0B8"| [[Read%20a%20file%20character%20by%20character%2FUTF8|Read a file character by character/UTF8]]
| [[Floyd-Warshall%20algorithm|Floyd-Warshall algorithm]]
| Task
| Draft
|-
|-
| 25
| 25
| [[Same%20Fringe|Same Fringe]]
|data-sort-value="ripemd-0D160"| [[RIPEMD-160|RIPEMD-160]]
| Task
|-
| 25
| [[Continued%20fraction%2FArithmetic%2FConstruct%20from%20rational%20number|Continued fraction/Arithmetic/Construct from rational number]]
| Task
| Task
|-
|-
Line 4,756: Line 4,756:
|-
|-
| 25
| 25
| [[State%20name%20puzzle|State name puzzle]]
| [[QR%20decomposition|QR decomposition]]
| Task
| Task
|-
|-
| 25
| 25
| [[Straddling%20checkerboard|Straddling checkerboard]]
| [[Xiaolin%20Wu%27s%20line%20algorithm|Xiaolin Wu's line algorithm]]
| Task
|-
| 25
| [[Same%20Fringe|Same Fringe]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 25
| 25
| [[Subset%20sum%20problem|Subset sum problem]]
|data-sort-value="read a file character by character/utf0B8"| [[Read%20a%20file%20character%20by%20character%2FUTF8|Read a file character by character/UTF8]]
| Draft
| Draft
|-
|-
| 25
| 25
| [[Textonyms|Textonyms]]
| [[First%20class%20environments|First class environments]]
| Task
|-
| 25
| [[Update%20a%20configuration%20file|Update a configuration file]]
| Task
| Task
|-
|-
Line 4,778: Line 4,778:
| [[Use%20another%20language%20to%20call%20a%20function|Use another language to call a function]]
| [[Use%20another%20language%20to%20call%20a%20function|Use another language to call a function]]
| Task
| Task
|-
|- style="background-color: #ffc"
| 25
| 25
| [[Xiaolin%20Wu%27s%20line%20algorithm|Xiaolin Wu's line algorithm]]
| [[Longest%20Common%20Substring|Longest Common Substring]]
| Draft
| Task
|-
|-
| 24
| 24
Line 4,788: Line 4,788:
|-
|-
| 24
| 24
| [[Egyptian%20division|Egyptian division]]
| [[Chinese%20zodiac|Chinese zodiac]]
| Task
| Task
|- style="background-color: #ffc"
| 24
| [[Musical%20scale|Musical scale]]
| Draft
|-
|-
| 24
| 24
Line 4,804: Line 4,800:
|-
|-
| 24
| 24
| [[Egyptian%20division|Egyptian division]]
| [[Rosetta%20Code%2FFix%20code%20tags|Rosetta Code/Fix code tags]]
| Task
| Task
|- style="background-color: #ffc"
| 24
| [[Sorting%20algorithms%2FCycle%20sort|Sorting algorithms/Cycle sort]]
| Draft
|-
|-
| 24
| 24
| [[Find%20palindromic%20numbers%20in%20both%20binary%20and%20ternary%20bases|Find palindromic numbers in both binary and ternary bases]]
| [[Metronome|Metronome]]
| Task
| Task
|-
|-
| 24
| 24
| [[Resistor%20mesh|Resistor mesh]]
| [[Keyboard%20macros|Keyboard macros]]
| Task
| Task
|-
|-
| 24
| 24
| [[Metronome|Metronome]]
| [[Pragmatic%20directives|Pragmatic directives]]
| Task
| Task
|- style="background-color: #ffc"
| 24
| [[Musical%20scale|Musical scale]]
| Draft
|-
|-
| 24
| 24
| [[Pragmatic%20directives|Pragmatic directives]]
| [[Find%20palindromic%20numbers%20in%20both%20binary%20and%20ternary%20bases|Find palindromic numbers in both binary and ternary bases]]
| Task
| Task
|-
|-
| 24
| 24
| [[Chinese%20zodiac|Chinese zodiac]]
| [[Resistor%20mesh|Resistor mesh]]
| Task
| Task
|-
|-
Line 4,836: Line 4,832:
|-
|-
| 24
| 24
| [[Rosetta%20Code%2FFix%20code%20tags|Rosetta Code/Fix code tags]]
| [[Keyboard%20macros|Keyboard macros]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 23
| 24
| [[Sorting%20algorithms%2FCycle%20sort|Sorting algorithms/Cycle sort]]
| [[Find%20first%20and%20last%20set%20bit%20of%20a%20long%20integer|Find first and last set bit of a long integer]]
| Draft
| Draft
|-
|-
| 23
| 23
| [[Arithmetic-geometric%20mean%2FCalculate%20Pi|Arithmetic-geometric mean/Calculate Pi]]
| [[Natural%20sorting|Natural sorting]]
| Task
| Task
|-
|-
Line 4,852: Line 4,848:
|-
|-
| 23
| 23
| [[Death%20Star|Death Star]]
| [[Solve%20the%20no%20connection%20puzzle|Solve the no connection puzzle]]
| Task
| Task
|- style="background-color: #ffc"
| 23
| [[Find%20first%20and%20last%20set%20bit%20of%20a%20long%20integer|Find first and last set bit of a long integer]]
| Draft
|-
|-
| 23
| 23
| [[Lychrel%20numbers|Lychrel numbers]]
| [[Sort%20a%20list%20of%20object%20identifiers|Sort a list of object identifiers]]
| Task
| Task
|-
|-
| 23
| 23
| [[Natural%20sorting|Natural sorting]]
| [[Paraffins|Paraffins]]
| Task
| Task
|-
|-
| 23
| 23
| [[Death%20Star|Death Star]]
| [[Paraffins|Paraffins]]
| Task
| Task
|-
|-
| 23
| 23
| [[Pattern%20matching|Pattern matching]]
|data-sort-value="window creation/x0C11"| [[Window%20creation%2FX11|Window creation/X11]]
| Task
| Task
|-
|-
Line 4,876: Line 4,876:
|-
|-
| 23
| 23
| [[Solve%20the%20no%20connection%20puzzle|Solve the no connection puzzle]]
| [[Lychrel%20numbers|Lychrel numbers]]
| Task
| Task
|-
|-
| 23
| 23
| [[Sort%20a%20list%20of%20object%20identifiers|Sort a list of object identifiers]]
| [[Arithmetic-geometric%20mean%2FCalculate%20Pi|Arithmetic-geometric mean/Calculate Pi]]
| Task
| Task
|- style="background-color: #ffc"
| 23
| [[Sorting%20algorithms%2FPatience%20sort|Sorting algorithms/Patience sort]]
| Draft
|-
|-
| 23
| 23
Line 4,888: Line 4,892:
|-
|-
| 23
| 23
|data-sort-value="window creation/x0C11"| [[Window%20creation%2FX11|Window creation/X11]]
| [[Pattern%20matching|Pattern matching]]
| Task
| Task
|- style="background-color: #ffc"
| 23
| [[Sorting%20algorithms%2FPatience%20sort|Sorting algorithms/Patience sort]]
| Draft
|-
|-
| 22
| 22
| [[Active%20Directory%2FConnect|Active Directory/Connect]]
| [[Active%20Directory%2FConnect|Active Directory/Connect]]
| Task
|-
| 22
| [[Angle%20difference%20between%20two%20bearings|Angle difference between two bearings]]
| Task
|-
| 22
| [[Check%20Machin-like%20formulas|Check Machin-like formulas]]
| Task
| Task
|-
|-
Line 4,904: Line 4,912:
|-
|-
| 22
| 22
| [[Go%20Fish|Go Fish]]
| [[FTP|FTP]]
| Task
| Task
|-
|-
| 22
| 22
| [[Galton%20box%20animation|Galton box animation]]
| [[Terminal%20control%2FCursor%20movement|Terminal control/Cursor movement]]
| Task
|-
| 22
| [[Go%20Fish|Go Fish]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 22
| 22
| [[Word%20count|Word count]]
| [[Prime%20conspiracy|Prime conspiracy]]
| Draft
| Draft
|-
|-
Line 4,920: Line 4,932:
|-
|-
| 22
| 22
| [[Terminal%20control%2FCursor%20movement|Terminal control/Cursor movement]]
| [[Galton%20box%20animation|Galton box animation]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 4,928: Line 4,940:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 22
| 22
| [[Prime%20conspiracy|Prime conspiracy]]
| [[Word%20count|Word count]]
| Draft
| Draft
|-
| 22
| [[FTP|FTP]]
| Task
|-
|-
| 22
| 22
| [[Write%20to%20Windows%20event%20log|Write to Windows event log]]
| [[Write%20to%20Windows%20event%20log|Write to Windows event log]]
| Task
| Task
|- style="background-color: #ffc"
|-
| 22
| [[Check%20Machin-like%20formulas|Check Machin-like formulas]]
| Task
|-
| 22
| [[Angle%20difference%20between%20two%20bearings|Angle difference between two bearings]]
| Task
|-
| 21
| 21
| [[Check%20input%20device%20is%20a%20terminal|Check input device is a terminal]]
|data-sort-value="utf-0B8 encode and decode"| [[UTF-8%20encode%20and%20decode|UTF-8 encode and decode]]
| Task
| Draft
|-
|-
| 21
| 21
| [[Checkpoint%20synchronization|Checkpoint synchronization]]
| [[The%20ISAAC%20Cipher|The ISAAC Cipher]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 21
| 21
| [[Currency|Currency]]
| [[Welch%27s%20t-test|Welch's t-test]]
| Draft
| Draft
|-
|-
Line 4,964: Line 4,964:
|-
|-
| 21
| 21
| [[Honeycombs|Honeycombs]]
| [[Terminal%20control%2FPreserve%20screen|Terminal control/Preserve screen]]
| Task
| Task
|- style="background-color: #ffc"
| 21
| [[Implicit%20type%20conversion|Implicit type conversion]]
| Draft
|-
|-
| 21
| 21
Line 4,973: Line 4,977:
| 21
| 21
| [[Sum%20and%20Product%20Puzzle|Sum and Product Puzzle]]
| [[Sum%20and%20Product%20Puzzle|Sum and Product Puzzle]]
| Task
|-
| 21
| [[Verify%20distribution%20uniformity%2FChi-squared%20test|Verify distribution uniformity/Chi-squared test]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 21
| 21
| [[Table%20creation|Table creation]]
| [[Currency|Currency]]
| Draft
| Draft
|-
|- style="background-color: #ffc"
| 21
| 21
| [[Terminal%20control%2FPreserve%20screen|Terminal control/Preserve screen]]
| [[Check%20input%20device%20is%20a%20terminal|Check input device is a terminal]]
| Draft
| Task
|-
|-
| 21
| 21
| [[The%20ISAAC%20Cipher|The ISAAC Cipher]]
| [[Checkpoint%20synchronization|Checkpoint synchronization]]
| Task
| Task
|-
|-
Line 4,994: Line 4,994:
| [[URL%20parser|URL parser]]
| [[URL%20parser|URL parser]]
| Task
| Task
|-
|- style="background-color: #ffc"
| 21
| 21
|data-sort-value="utf-0B8 encode and decode"| [[UTF-8%20encode%20and%20decode|UTF-8 encode and decode]]
| [[Implicit%20type%20conversion|Implicit type conversion]]
| Draft
| Task
|-
|-
| 21
| 21
| [[Verify%20distribution%20uniformity%2FChi-squared%20test|Verify distribution uniformity/Chi-squared test]]
| [[Honeycombs|Honeycombs]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 21
| 21
| [[Table%20creation|Table creation]]
| [[Welch%27s%20t-test|Welch's t-test]]
| Draft
| Draft
|- style="background-color: #ffc"
|-
| 20
| 20
| [[Birthday%20problem|Birthday problem]]
| [[Pentagram|Pentagram]]
| Task
| Draft
|-
|-
| 20
| 20
| [[Chat%20server|Chat server]]
| [[Set%20of%20real%20numbers|Set of real numbers]]
| Task
|-
| 20
| [[Permutations%2FRank%20of%20a%20permutation|Permutations/Rank of a permutation]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 20
| 20
| [[Cycle%20detection|Cycle detection]]
| [[Birthday%20problem|Birthday problem]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 20
| 20
| [[Decimal%20floating%20point%20number%20to%20binary|Decimal floating point number to binary]]
| [[Multi-dimensional%20array|Multi-dimensional array]]
| Draft
| Draft
|-
|-
| 20
| 20
| [[Function%20frequency|Function frequency]]
| [[RCRPG|RCRPG]]
| Task
| Task
|-
|-
| 20
| 20
| [[Image%20convolution|Image convolution]]
| [[Shoelace%20formula%20for%20polygonal%20area|Shoelace formula for polygonal area]]
| Task
|-
| 20
| [[MAC%20Vendor%20Lookup|MAC Vendor Lookup]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 20
| 20
| [[Multi-dimensional%20array|Multi-dimensional array]]
| [[Substitution%20Cipher|Substitution Cipher]]
| Draft
| Draft
|-
|-
| 20
| 20
| [[Partition%20an%20integer%20X%20into%20N%20primes|Partition an integer X into N primes]]
| [[Safe%20addition|Safe addition]]
| Task
| Task
|-
|-
| 20
| 20
| [[Pentagram|Pentagram]]
| [[Partition%20an%20integer%20X%20into%20N%20primes|Partition an integer X into N primes]]
| Task
| Task
|-
|- style="background-color: #ffc"
| 20
| 20
| [[Percolation%2FMean%20run%20density|Percolation/Mean run density]]
| [[Decimal%20floating%20point%20number%20to%20binary|Decimal floating point number to binary]]
| Draft
| Task
|-
|-
| 20
| 20
| [[Permutations%2FRank%20of%20a%20permutation|Permutations/Rank of a permutation]]
| [[Simulate%20input%2FKeyboard|Simulate input/Keyboard]]
| Task
| Task
|- style="background-color: #ffc"
| 20
| [[Ramsey%27s%20theorem|Ramsey's theorem]]
| Draft
|-
|-
| 20
| 20
| [[Play%20recorded%20sounds|Play recorded sounds]]
| [[Image%20convolution|Image convolution]]
| Task
| Task
|-
|-
| 20
| 20
| [[Chat%20server|Chat server]]
| [[RCRPG|RCRPG]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 20
| 20
| [[Ramsey%27s%20theorem|Ramsey's theorem]]
| [[Cycle%20detection|Cycle detection]]
| Draft
| Draft
|-
|-
| 20
| 20
| [[Safe%20addition|Safe addition]]
| [[Function%20frequency|Function frequency]]
| Task
| Task
|-
|-
| 20
| 20
| [[Set%20of%20real%20numbers|Set of real numbers]]
| [[Percolation%2FMean%20run%20density|Percolation/Mean run density]]
| Task
| Task
|-
|-
| 20
| 20
| [[Shoelace%20formula%20for%20polygonal%20area|Shoelace formula for polygonal area]]
| [[Solve%20a%20Holy%20Knight%27s%20tour|Solve a Holy Knight's tour]]
| Task
| Task
|-
|-
| 20
| 20
| [[Simulate%20input%2FKeyboard|Simulate input/Keyboard]]
| [[Play%20recorded%20sounds|Play recorded sounds]]
| Task
| Task
|-
|-
| 20
| 20
| [[Solve%20a%20Holy%20Knight%27s%20tour|Solve a Holy Knight's tour]]
| [[MAC%20Vendor%20Lookup|MAC Vendor Lookup]]
| Task
| Task
|- style="background-color: #ffc"
| 20
| [[Substitution%20Cipher|Substitution Cipher]]
| Draft
|-
|-
| 19
| 19
| [[Cut%20a%20rectangle|Cut a rectangle]]
| [[Thiele%27s%20interpolation%20formula|Thiele's interpolation formula]]
| Task
|-
| 19
| [[Total%20circles%20area|Total circles area]]
| Task
|-
| 19
| [[Record%20sound|Record sound]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 19
| 19
| [[Damm%20algorithm|Damm algorithm]]
| [[Old%20Russian%20measure%20of%20length|Old Russian measure of length]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 19
| 19
| [[Decision%20tables|Decision tables]]
| [[Idiomatically%20determine%20all%20the%20lowercase%20and%20uppercase%20letters|Idiomatically determine all the lowercase and uppercase letters]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,114: Line 5,106:
| [[Elliptic%20curve%20arithmetic|Elliptic curve arithmetic]]
| [[Elliptic%20curve%20arithmetic|Elliptic curve arithmetic]]
| Draft
| Draft
|-
| 19
| [[HTTPS%2FAuthenticated|HTTPS/Authenticated]]
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 19
| 19
| [[Idiomatically%20determine%20all%20the%20lowercase%20and%20uppercase%20letters|Idiomatically determine all the lowercase and uppercase letters]]
| [[Damm%20algorithm|Damm algorithm]]
| Draft
| Draft
|-
|-
| 19
| 19
|data-sort-value="main step of gost 0F28147-0C89"| [[Main%20step%20of%20GOST%2028147-89|Main step of GOST 28147-89]]
| [[Yahoo%21%20search%20interface|Yahoo! search interface]]
| Task
|- style="background-color: #ffc"
| 19
| [[Old%20Russian%20measure%20of%20length|Old Russian measure of length]]
| Draft
|-
| 19
| [[Record%20sound|Record sound]]
| Task
| Task
|-
|-
Line 5,128: Line 5,132:
|-
|-
| 19
| 19
| [[Thiele%27s%20interpolation%20formula|Thiele's interpolation formula]]
| [[HTTPS%2FAuthenticated|HTTPS/Authenticated]]
| Task
| Task
|-
|-
| 19
| 19
| [[Total%20circles%20area|Total circles area]]
|data-sort-value="main step of gost 0F28147-0C89"| [[Main%20step%20of%20GOST%2028147-89|Main step of GOST 28147-89]]
| Task
| Task
|-
|-
Line 5,140: Line 5,144:
|-
|-
| 19
| 19
| [[Yahoo%21%20search%20interface|Yahoo! search interface]]
| [[Cut%20a%20rectangle|Cut a rectangle]]
| Task
| Task
|- style="background-color: #ffc"
| 19
| [[Decision%20tables|Decision tables]]
| Draft
|-
|-
| 18
| 18
Line 5,152: Line 5,152:
|-
|-
| 18
| 18
| [[Create%20an%20object%20at%20a%20given%20address|Create an object at a given address]]
| [[K-means%2B%2B%20clustering|K-means++ clustering]]
| Task
| Task
|- style="background-color: #ffc"
|-
| 18
| 18
| [[Dice%20game%20probabilities|Dice game probabilities]]
| [[Hough%20transform|Hough transform]]
| Task
| Draft
|-
|-
| 18
| 18
Line 5,164: Line 5,164:
|-
|-
| 18
| 18
| [[Hough%20transform|Hough transform]]
| [[Create%20an%20object%20at%20a%20given%20address|Create an object at a given address]]
| Task
| Task
|-
|-
| 18
| 18
| [[K-means%2B%2B%20clustering|K-means++ clustering]]
| [[Stream%20Merge|Stream Merge]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 18
| 18
| [[Make%20a%20backup%20file|Make a backup file]]
| [[Reflection%2FList%20methods|Reflection/List methods]]
| Draft
| Draft
|-
|-
Line 5,178: Line 5,178:
| [[Parse%20an%20IP%20Address|Parse an IP Address]]
| [[Parse%20an%20IP%20Address|Parse an IP Address]]
| Task
| Task
|-
|- style="background-color: #ffc"
| 18
| 18
| [[Poker%20hand%20analyser|Poker hand analyser]]
| [[Dice%20game%20probabilities|Dice game probabilities]]
| Draft
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 18
| 18
| [[Reflection%2FList%20methods|Reflection/List methods]]
| [[Make%20a%20backup%20file|Make a backup file]]
| Draft
| Draft
|-
|-
| 18
| 18
| [[Stream%20Merge|Stream Merge]]
| [[Poker%20hand%20analyser|Poker hand analyser]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,196: Line 5,196:
|-
|-
| 17
| 17
| [[Draw%20a%20rotating%20cube|Draw a rotating cube]]
| [[Pig%20the%20dice%20game%2FPlayer|Pig the dice game/Player]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 17
| 17
| [[Playfair%20cipher|Playfair cipher]]
| [[Integer%20roots|Integer roots]]
| Draft
|- style="background-color: #ffc"
| 17
| [[Modular%20arithmetic|Modular arithmetic]]
| Draft
| Draft
|-
|-
| 17
| 17
| [[Parallel%20Brute%20Force|Parallel Brute Force]]
| [[SOAP|SOAP]]
| Task
| Task
|-
|-
| 17
| 17
| [[Pig%20the%20dice%20game%2FPlayer|Pig the dice game/Player]]
| [[Reflection%2FList%20properties|Reflection/List properties]]
| Task
| Task
|-
|-
| 17
| 17
| [[Plasma%20effect|Plasma effect]]
| [[Parallel%20Brute%20Force|Parallel Brute Force]]
| Task
| Task
|- style="background-color: #ffc"
| 17
| [[Playfair%20cipher|Playfair cipher]]
| Draft
|-
|-
| 17
| 17
| [[Polyspiral|Polyspiral]]
| [[Polyspiral|Polyspiral]]
| Task
| Task
|-
|- style="background-color: #ffc"
| 17
| 17
| [[Reflection%2FList%20properties|Reflection/List properties]]
| [[Modular%20arithmetic|Modular arithmetic]]
| Draft
| Task
|-
|- style="background-color: #ffc"
| 17
| 17
| [[SOAP|SOAP]]
| [[Integer%20roots|Integer roots]]
| Draft
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 17
| 17
| [[Sequence%20of%20primorial%20primes|Sequence of primorial primes]]
| [[Sequence%20of%20primorial%20primes|Sequence of primorial primes]]
| Draft
| Draft
|-
| 17
| [[Draw%20a%20rotating%20cube|Draw a rotating cube]]
| Task
|-
|-
| 17
| 17
| [[Sokoban|Sokoban]]
| [[Sokoban|Sokoban]]
| Task
|-
| 17
| [[Plasma%20effect|Plasma effect]]
| Task
| Task
|- style="background-color: #ffc"
| 16
| [[Elementary%20cellular%20automaton%2FRandom%20Number%20Generator|Elementary cellular automaton/Random Number Generator]]
| Draft
|- style="background-color: #ffc"
| 16
| [[Idiomatically%20determine%20all%20the%20characters%20that%20can%20be%20used%20for%20symbols|Idiomatically determine all the characters that can be used for symbols]]
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 16
| 16
Line 5,250: Line 5,258:
| [[Kronecker%20product%20based%20fractals|Kronecker product based fractals]]
| [[Kronecker%20product%20based%20fractals|Kronecker product based fractals]]
| Task
| Task
|- style="background-color: #ffc"
| 16
| [[Linux%20CPU%20utilization|Linux CPU utilization]]
| Draft
|-
|-
| 16
| 16
| [[Median%20filter|Median filter]]
| [[Median%20filter|Median filter]]
| Task
| Task
|- style="background-color: #ffc"
|-
| 16
| 16
| [[Perlin%20noise|Perlin noise]]
| [[Simulate%20input%2FMouse|Simulate input/Mouse]]
| Task
| Draft
|-
|-
| 16
| 16
| [[Pythagorean%20quadruples|Pythagorean quadruples]]
| [[Pythagorean%20quadruples|Pythagorean quadruples]]
| Task
| Task
|-
|- style="background-color: #ffc"
| 16
| 16
| [[Simulate%20input%2FMouse|Simulate input/Mouse]]
| [[Linux%20CPU%20utilization|Linux CPU utilization]]
| Draft
|- style="background-color: #ffc"
| 16
| [[Perlin%20noise|Perlin noise]]
| Draft
|- style="background-color: #ffc"
| 16
| [[Elementary%20cellular%20automaton%2FRandom%20Number%20Generator|Elementary cellular automaton/Random Number Generator]]
| Draft
|- style="background-color: #ffc"
| 16
| [[Idiomatically%20determine%20all%20the%20characters%20that%20can%20be%20used%20for%20symbols|Idiomatically determine all the characters that can be used for symbols]]
| Draft
|-
| 15
| [[Machine%20code|Machine code]]
| Task
| Task
|-
|-
Line 5,288: Line 5,284:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 15
| 15
| [[Bacon%20cipher|Bacon cipher]]
| [[Levenshtein%20distance%2FAlignment|Levenshtein distance/Alignment]]
| Draft
| Draft
|- style="background-color: #ffc"
|-
| 15
| 15
| [[Card%20shuffles|Card shuffles]]
| [[Solve%20a%20Numbrix%20puzzle|Solve a Numbrix puzzle]]
| Task
| Draft
|-
|-
| 15
| 15
Line 5,300: Line 5,296:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 15
| 15
| [[Levenshtein%20distance%2FAlignment|Levenshtein distance/Alignment]]
| [[Bacon%20cipher|Bacon cipher]]
| Draft
| Draft
|-
|- style="background-color: #ffc"
| 15
| 15
| [[Card%20shuffles|Card shuffles]]
| [[Machine%20code|Machine code]]
| Draft
| Task
|-
|-
| 14
| 15
| [[Solve%20a%20Numbrix%20puzzle|Solve a Numbrix puzzle]]
| [[Negative%20base%20numbers|Negative base numbers]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 14
| 14
| [[Assertions%20in%20design%20by%20contract|Assertions in design by contract]]
| [[Faulhaber%27s%20formula|Faulhaber's formula]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 14
| 14
| [[AudioAlarm|AudioAlarm]]
| [[Elementary%20cellular%20automaton%2FInfinite%20length|Elementary cellular automaton/Infinite length]]
| Draft
|- style="background-color: #ffc"
| 14
| [[Chebyshev%20coefficients|Chebyshev coefficients]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,322: Line 5,322:
| [[Deming%27s%20Funnel|Deming's Funnel]]
| [[Deming%27s%20Funnel|Deming's Funnel]]
| Draft
| Draft
|- style="background-color: #ffc"
|-
| 14
| 14
| [[Elementary%20cellular%20automaton%2FInfinite%20length|Elementary cellular automaton/Infinite length]]
| [[Magic%20squares%20of%20singly%20even%20order|Magic squares of singly even order]]
| Task
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 14
| 14
| [[Faulhaber%27s%20formula|Faulhaber's formula]]
| [[Names%20to%20numbers|Names to numbers]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 14
| 14
| [[Reverse%20the%20gender%20of%20a%20string|Reverse the gender of a string]]
| [[Index%20finite%20lists%20of%20positive%20integers|Index finite lists of positive integers]]
| Draft
| Draft
|-
|-
| 14
| 14
| [[K-d%20tree|K-d tree]]
| [[World%20Cup%20group%20stage|World Cup group stage]]
| Task
| Task
|-
|-
| 14
| 14
| [[Magic%20squares%20of%20singly%20even%20order|Magic squares of singly even order]]
| [[Solve%20a%20Hopido%20puzzle|Solve a Hopido puzzle]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 14
| 14
| [[Names%20to%20numbers|Names to numbers]]
| [[Chebyshev%20coefficients|Chebyshev coefficients]]
| Draft
|- style="background-color: #ffc"
| 14
| [[Native%20shebang|Native shebang]]
| Draft
| Draft
|-
|-
| 14
| 14
| [[Negative%20base%20numbers|Negative base numbers]]
| [[K-d%20tree|K-d tree]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 14
| 14
| [[Reverse%20the%20gender%20of%20a%20string|Reverse the gender of a string]]
| [[Native%20shebang|Native shebang]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,358: Line 5,362:
| [[Selective%20File%20Copy|Selective File Copy]]
| [[Selective%20File%20Copy|Selective File Copy]]
| Draft
| Draft
|-
|- style="background-color: #ffc"
| 14
| 14
| [[Solve%20a%20Hopido%20puzzle|Solve a Hopido puzzle]]
| [[Assertions%20in%20design%20by%20contract|Assertions in design by contract]]
| Draft
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 14
| 14
| [[Tonelli-Shanks%20algorithm|Tonelli-Shanks algorithm]]
| [[Tonelli-Shanks%20algorithm|Tonelli-Shanks algorithm]]
| Draft
|- style="background-color: #ffc"
| 14
| [[AudioAlarm|AudioAlarm]]
| Draft
| Draft
|-
|-
| 14
| 14
| [[Vigen%C3%A8re%20cipher%2FCryptanalysis|Vigenère cipher/Cryptanalysis]]
| [[Vigen%C3%A8re%20cipher%2FCryptanalysis|Vigenère cipher/Cryptanalysis]]
| Task
|-
| 14
| [[World%20Cup%20group%20stage|World Cup group stage]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 14
| 13
| [[A%2A%20search%20algorithm|A* search algorithm]]
| [[Index%20finite%20lists%20of%20positive%20integers|Index finite lists of positive integers]]
| Draft
| Draft
|-
|-
| 13
| 13
| [[Apply%20a%20digital%20filter%20%28direct%20form%20II%20transposed%29|Apply a digital filter (direct form II transposed)]]
| [[SQL-based%20authentication|SQL-based authentication]]
| Task
| Task
|-
|-
Line 5,388: Line 5,392:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 13
| 13
| [[Cipolla%27s%20algorithm|Cipolla's algorithm]]
| [[Type%20detection|Type detection]]
| Draft
| Draft
|-
| 13
| [[Terminal%20control%2FPositional%20read|Terminal control/Positional read]]
| Task
|-
|-
| 13
| 13
| [[Color%20quantization|Color quantization]]
| [[Color%20quantization|Color quantization]]
| Task
|-
| 13
| [[Sierpinski%20pentagon|Sierpinski pentagon]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 13
| 13
| [[Create%20an%20object%2FNative%20demonstration|Create an object/Native demonstration]]
| [[A%2A%20search%20algorithm|A* search algorithm]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 13
| 13
| [[Fivenum|Fivenum]]
| [[Create%20an%20object%2FNative%20demonstration|Create an object/Native demonstration]]
| Draft
| Draft
|-
|-
Line 5,416: Line 5,412:
|-
|-
| 13
| 13
| [[Percolation%2FSite%20percolation|Percolation/Site percolation]]
| [[Video%20display%20modes|Video display modes]]
| Task
| Task
|-
|-
| 13
| 13
| [[Rendezvous|Rendezvous]]
| [[Apply%20a%20digital%20filter%20%28direct%20form%20II%20transposed%29|Apply a digital filter (direct form II transposed)]]
| Task
| Task
|-
|-
| 13
| 13
| [[SQL-based%20authentication|SQL-based authentication]]
| [[Rendezvous|Rendezvous]]
| Task
|-
| 13
| [[Sierpinski%20pentagon|Sierpinski pentagon]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,430: Line 5,430:
| [[Superpermutation%20minimisation|Superpermutation minimisation]]
| [[Superpermutation%20minimisation|Superpermutation minimisation]]
| Draft
| Draft
|-
|- style="background-color: #ffc"
| 13
| 13
| [[Terminal%20control%2FPositional%20read|Terminal control/Positional read]]
| [[Cipolla%27s%20algorithm|Cipolla's algorithm]]
| Draft
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 13
| 13
| [[Type%20detection|Type detection]]
| [[Fivenum|Fivenum]]
| Draft
| Draft
|-
|-
| 13
| 13
| [[Video%20display%20modes|Video display modes]]
| [[Percolation%2FSite%20percolation|Percolation/Site percolation]]
| Task
| Task
|-
|-
| 12
| 12
| [[Bitmap%2FRead%20an%20image%20through%20a%20pipe|Bitmap/Read an image through a pipe]]
| [[Retrieve%20and%20search%20chat%20history|Retrieve and search chat history]]
| Task
| Task
|- style="background-color: #ffc"
| 12
| [[Convex%20hull|Convex hull]]
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 12
| 12
| [[Diversity%20prediction%20theorem|Diversity prediction theorem]]
| [[Diversity%20prediction%20theorem|Diversity prediction theorem]]
| Draft
|- style="background-color: #ffc"
| 12
| [[I.Q.%20Puzzle|I.Q. Puzzle]]
| Draft
| Draft
|-
|-
| 12
| 12
| [[Joystick%20position|Joystick position]]
| [[Percolation%2FBond%20percolation|Percolation/Bond percolation]]
| Task
| Task
|-
|-
Line 5,462: Line 5,470:
| [[Most%20frequent%20k%20chars%20distance|Most frequent k chars distance]]
| [[Most%20frequent%20k%20chars%20distance|Most frequent k chars distance]]
| Draft
| Draft
|-
|- style="background-color: #ffc"
| 12
| 12
| [[Percolation%2FBond%20percolation|Percolation/Bond percolation]]
| [[Untrusted%20environment|Untrusted environment]]
| Draft
| Task
|-
|-
| 12
| 12
Line 5,474: Line 5,482:
| [[Reflection%2FGet%20source|Reflection/Get source]]
| [[Reflection%2FGet%20source|Reflection/Get source]]
| Task
| Task
|- style="background-color: #ffc"
| 12
| [[Word%20break%20problem|Word break problem]]
| Draft
|-
|-
| 12
| 12
| [[Retrieve%20and%20search%20chat%20history|Retrieve and search chat history]]
| [[Joystick%20position|Joystick position]]
| Task
|-
| 12
| [[Bitmap%2FRead%20an%20image%20through%20a%20pipe|Bitmap/Read an image through a pipe]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 12
| 12
| [[Untrusted%20environment|Untrusted environment]]
| [[I.Q.%20Puzzle|I.Q. Puzzle]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 12
| 12
| [[Word%20break%20problem|Word break problem]]
| [[Convex%20hull|Convex hull]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[Arithmetic%20coding%2FAs%20a%20generalized%20change%20of%20radix|Arithmetic coding/As a generalized change of radix]]
| [[Find%20URI%20in%20text|Find URI in text]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[Bilinear%20interpolation|Bilinear interpolation]]
| [[NYSIIS|NYSIIS]]
| Draft
| Draft
|-
| 11
| [[Compare%20sorting%20algorithms%27%20performance|Compare sorting algorithms' performance]]
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[Knuth%27s%20power%20tree|Knuth's power tree]]
| [[Faulhaber%27s%20triangle|Faulhaber's triangle]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[Find%20URI%20in%20text|Find URI in text]]
| [[Faulhaber%27s%20triangle|Faulhaber's triangle]]
| Draft
| Draft
|-
| 11
| [[Find%20the%20intersection%20of%20a%20line%20with%20a%20plane|Find the intersection of a line with a plane]]
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[Knuth%27s%20power%20tree|Knuth's power tree]]
| [[Polynomial%20synthetic%20division|Polynomial synthetic division]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[List%20rooted%20trees|List rooted trees]]
| [[Arithmetic%20coding%2FAs%20a%20generalized%20change%20of%20radix|Arithmetic coding/As a generalized change of radix]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,524: Line 5,532:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[N-body%20problem|N-body problem]]
| [[Shortest%20common%20supersequence|Shortest common supersequence]]
| Draft
| Draft
|- style="background-color: #ffc"
|-
| 11
| 11
| [[NYSIIS|NYSIIS]]
| [[Ramer-Douglas-Peucker%20line%20simplification|Ramer-Douglas-Peucker line simplification]]
| Task
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[Polynomial%20synthetic%20division|Polynomial synthetic division]]
| [[Bilinear%20interpolation|Bilinear interpolation]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[Proof|Proof]]
| [[List%20rooted%20trees|List rooted trees]]
| Draft
| Draft
|-
|-
| 11
| 11
| [[Ramer-Douglas-Peucker%20line%20simplification|Ramer-Douglas-Peucker line simplification]]
| [[Vogel%27s%20approximation%20method|Vogel's approximation method]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[Separate%20the%20house%20number%20from%20the%20street%20name|Separate the house number from the street name]]
| [[N-body%20problem|N-body problem]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 11
| [[Shortest%20common%20supersequence|Shortest common supersequence]]
| [[Proof|Proof]]
| Draft
| Draft
|-
|-
| 11
| 11
| [[Vogel%27s%20approximation%20method|Vogel's approximation method]]
| [[Compare%20sorting%20algorithms%27%20performance|Compare sorting algorithms' performance]]
| Task
| Task
|- style="background-color: #ffc"
| 10
| [[Aspect%20Oriented%20Programming|Aspect Oriented Programming]]
| Draft
|-
|-
| 11
| 10
| [[Commatizing%20numbers|Commatizing numbers]]
| [[Find%20the%20intersection%20of%20a%20line%20with%20a%20plane|Find the intersection of a line with a plane]]
| Task
|-
| 10
| [[Compiler%2Fcode%20generator|Compiler/code generator]]
| Task
|-
| 10
| [[Compiler%2Fvirtual%20machine%20interpreter|Compiler/virtual machine interpreter]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 11
| 10
| [[Determine%20if%20two%20triangles%20overlap|Determine if two triangles overlap]]
| [[Separate%20the%20house%20number%20from%20the%20street%20name|Separate the house number from the street name]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 10
| 10
| [[Find%20duplicate%20files|Find duplicate files]]
| [[Find%20duplicate%20files|Find duplicate files]]
| Draft
|- style="background-color: #ffc"
| 10
| [[P-value%20correction|P-value correction]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,576: Line 5,592:
|-
|-
| 10
| 10
| [[HTTPS%2FClient-authenticated|HTTPS/Client-authenticated]]
| [[Commatizing%20numbers|Commatizing numbers]]
| Task
| Task
|- style="background-color: #ffc"
| 10
| [[Markov%20chain%20text%20generator|Markov chain text generator]]
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 10
| 10
Line 5,588: Line 5,608:
|-
|-
| 10
| 10
| [[Nonogram%20solver|Nonogram solver]]
| [[Zeckendorf%20arithmetic|Zeckendorf arithmetic]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 10
| 10
| [[P-value%20correction|P-value correction]]
| [[Aspect%20Oriented%20Programming|Aspect Oriented Programming]]
| Draft
| Draft
|-
|-
| 10
| 10
| [[Primes%20-%20allocate%20descendants%20to%20their%20ancestors|Primes - allocate descendants to their ancestors]]
| [[Nonogram%20solver|Nonogram solver]]
| Task
| Task
|- style="background-color: #ffc"
| 10
| [[Markov%20chain%20text%20generator|Markov chain text generator]]
| Draft
|- style="background-color: #ffc"
| 10
| [[Determine%20if%20two%20triangles%20overlap|Determine if two triangles overlap]]
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 10
| 10
Line 5,614: Line 5,626:
| [[Snake|Snake]]
| [[Snake|Snake]]
| Draft
| Draft
|-
| 10
| [[Primes%20-%20allocate%20descendants%20to%20their%20ancestors|Primes - allocate descendants to their ancestors]]
| Task
|-
| 10
| [[Compiler%2Fvirtual%20machine%20interpreter|Compiler/virtual machine interpreter]]
| Task
|-
| 10
| [[HTTPS%2FClient-authenticated|HTTPS/Client-authenticated]]
| Task
|-
| 10
| [[Compiler%2Fcode%20generator|Compiler/code generator]]
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 10
| 10
Line 5,635: Line 5,631:
| Draft
| Draft
|-
|-
| 9
| 10
| [[Zeckendorf%20arithmetic|Zeckendorf arithmetic]]
| [[Bitmap%2FPPM%20conversion%20through%20a%20pipe|Bitmap/PPM conversion through a pipe]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[Abbreviations%2C%20automatic|Abbreviations, automatic]]
| [[XML%20Validation|XML Validation]]
| Draft
|- style="background-color: #ffc"
| 9
| [[Suffix%20tree|Suffix tree]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,652: Line 5,644:
|-
|-
| 9
| 9
| [[Bitmap%2FPPM%20conversion%20through%20a%20pipe|Bitmap/PPM conversion through a pipe]]
| [[Eertree|Eertree]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[Code%20segment%20unload|Code segment unload]]
| [[VList|VList]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[Color%20wheel|Color wheel]]
| [[Code%20segment%20unload|Code segment unload]]
| Draft
|- style="background-color: #ffc"
| 9
| [[Continued%20fraction%2FArithmetic%2FG%28matrix%20NG%2C%20Contined%20Fraction%20N%29|Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)]]
| Draft
| Draft
|-
|-
| 9
| 9
| [[Word%20search|Word search]]
| [[Eertree|Eertree]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[File%20size%20distribution|File size distribution]]
| [[Transportation%20problem|Transportation problem]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[Four%20is%20magic|Four is magic]]
| [[Abbreviations%2C%20automatic|Abbreviations, automatic]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[Free%20polyominoes%20enumeration|Free polyominoes enumeration]]
| [[File%20size%20distribution|File size distribution]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[Four%20is%20magic|Four is magic]]
| [[Suffix%20tree|Suffix tree]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[Transportation%20problem|Transportation problem]]
| [[Color%20wheel|Color wheel]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[VList|VList]]
| [[Free%20polyominoes%20enumeration|Free polyominoes enumeration]]
| Draft
| Draft
|-
| 9
| [[Word%20search|Word search]]
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 9
| 9
| [[XML%20Validation|XML Validation]]
| [[Continued%20fraction%2FArithmetic%2FG%28matrix%20NG%2C%20Contined%20Fraction%20N%29|Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)]]
| Draft
| Draft
|-
|-
Line 5,698: Line 5,698:
| [[Compiler%2FAST%20interpreter|Compiler/AST interpreter]]
| [[Compiler%2FAST%20interpreter|Compiler/AST interpreter]]
| Task
| Task
|-
|- style="background-color: #ffc"
| 8
| 8
| [[Compiler%2Fsyntax%20analyzer|Compiler/syntax analyzer]]
| [[Self-hosting%20compiler|Self-hosting compiler]]
| Draft
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 8
| 8
| [[Finite%20state%20machine|Finite state machine]]
| [[Loops%2FIncrement%20loop%20index%20within%20loop%20body|Loops/Increment loop index within loop body]]
| Draft
| Draft
|-
|-
Line 5,712: Line 5,712:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 8
| 8
| [[Kosaraju|Kosaraju]]
| [[Montgomery%20reduction|Montgomery reduction]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 8
| 8
| [[Largest%20number%20divisible%20by%20its%20digits|Largest number divisible by its digits]]
| [[Kosaraju|Kosaraju]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 8
| 8
| [[Loops%2FIncrement%20loop%20index%20within%20loop%20body|Loops/Increment loop index within loop body]]
| [[Largest%20number%20divisible%20by%20its%20digits|Largest number divisible by its digits]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 8
| 8
| [[Montgomery%20reduction|Montgomery reduction]]
| [[Perceptron|Perceptron]]
| Draft
| Draft
|- style="background-color: #ffc"
|-
| 8
| 8
| [[Perceptron|Perceptron]]
| [[Compiler%2Fsyntax%20analyzer|Compiler/syntax analyzer]]
| Task
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 8
| 8
| [[Self-hosting%20compiler|Self-hosting compiler]]
| [[Finite%20state%20machine|Finite state machine]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 7
| 7
| [[Abbreviations%2C%20easy|Abbreviations, easy]]
| [[Run%20as%20a%20daemon%20or%20service|Run as a daemon or service]]
| Draft
| Draft
|-
| 7
| [[Canny%20edge%20detector|Canny edge detector]]
| Task
|-
| 7
|data-sort-value="deconvolution/0B2d+"| [[Deconvolution%2F2D%2B|Deconvolution/2D+]]
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 7
| 7
| [[Generalised%20floating%20point%20addition|Generalised floating point addition]]
| [[Mastermind|Mastermind]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 7
| 7
| [[IPC%20via%20named%20pipe|IPC via named pipe]]
| [[Time-based%20One-time%20Password%20Algorithm|Time-based One-time Password Algorithm]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 7
| 7
| [[Mastermind|Mastermind]]
| [[Particle%20Swarm%20Optimization|Particle Swarm Optimization]]
| Draft
| Draft
|- style="background-color: #ffc"
|-
| 7
| 7
| [[Monads%2FWriter%20monad|Monads/Writer monad]]
| [[The%20Name%20Game|The Name Game]]
| Task
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 7
| 7
| [[Orbital%20elements|Orbital elements]]
| [[Generalised%20floating%20point%20addition|Generalised floating point addition]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 7
| 7
| [[Particle%20Swarm%20Optimization|Particle Swarm Optimization]]
| [[Singly-linked%20list%2FElement%20removal|Singly-linked list/Element removal]]
| Draft
| Draft
|- style="background-color: #ffc"
|-
| 7
| 7
| [[Run%20as%20a%20daemon%20or%20service|Run as a daemon or service]]
|data-sort-value="deconvolution/0B2d+"| [[Deconvolution%2F2D%2B|Deconvolution/2D+]]
| Task
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 7
| 7
| [[Singly-linked%20list%2FElement%20removal|Singly-linked list/Element removal]]
| [[Orbital%20elements|Orbital elements]]
| Draft
| Draft
|-
|-
| 7
| 7
| [[Canny%20edge%20detector|Canny edge detector]]
| [[The%20Name%20Game|The Name Game]]
| Task
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 7
| 7
| [[Time-based%20One-time%20Password%20Algorithm|Time-based One-time Password Algorithm]]
| [[Abbreviations%2C%20easy|Abbreviations, easy]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,783: Line 5,791:
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 7
| 6
| [[Addition%20chains|Addition chains]]
| [[IPC%20via%20named%20pipe|IPC via named pipe]]
| Draft
|- style="background-color: #ffc"
| 7
| [[Monads%2FWriter%20monad|Monads/Writer monad]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 6
| 6
| [[Banker%27s%20algorithm|Banker's algorithm]]
| [[Just%20in%20time%20processing%20on%20a%20character%20stream|Just in time processing on a character stream]]
| Draft
| Draft
|-
|-
Line 5,804: Line 5,808:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 6
| 6
| [[Just%20in%20time%20processing%20on%20a%20character%20stream|Just in time processing on a character stream]]
| [[Parse%20EBNF|Parse EBNF]]
| Draft
|- style="background-color: #ffc"
| 6
| [[Addition%20chains|Addition chains]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,816: Line 5,816:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 6
| 6
| [[Parse%20EBNF|Parse EBNF]]
| [[Banker%27s%20algorithm|Banker's algorithm]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 5
| 5
| [[ASCII%20art%20diagram%20converter|ASCII art diagram converter]]
| [[Spelling%20of%20ordinal%20numbers|Spelling of ordinal numbers]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 5
| 5
| [[Abbreviations%2C%20simple|Abbreviations, simple]]
| [[Sorting%20algorithms%2FTree%20sort%20on%20a%20linked%20list|Sorting algorithms/Tree sort on a linked list]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 5
| 5
| [[Audio%20frequency%20generator|Audio frequency generator]]
| [[Combinations%20with%20repetitions%2FSquare%20Digit%20Chain|Combinations with repetitions/Square Digit Chain]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 5
| 5
| [[Combinations%20with%20repetitions%2FSquare%20Digit%20Chain|Combinations with repetitions/Square Digit Chain]]
| [[Abbreviations%2C%20simple|Abbreviations, simple]]
| Draft
|- style="background-color: #ffc"
| 5
| [[Audio%20frequency%20generator|Audio frequency generator]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,844: Line 5,840:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 5
| 5
| [[OpenGL%20Pixel%20Shader|OpenGL Pixel Shader]]
| [[ASCII%20art%20diagram%20converter|ASCII art diagram converter]]
| Draft
| Draft
|-
|-
Line 5,852: Line 5,848:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 5
| 5
| [[Sorting%20algorithms%2FTree%20sort%20on%20a%20linked%20list|Sorting algorithms/Tree sort on a linked list]]
| [[Starting%20a%20web%20browser|Starting a web browser]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 5
| 5
| [[Spelling%20of%20ordinal%20numbers|Spelling of ordinal numbers]]
| [[OpenGL%20Pixel%20Shader|OpenGL Pixel Shader]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 5
| [[Starting%20a%20web%20browser|Starting a web browser]]
| [[Using%20the%20Meetup.com%20API|Using the Meetup.com API]]
| Draft
| Draft
|-
|-
Line 5,868: Line 5,864:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Addition-chain%20exponentiation|Addition-chain exponentiation]]
| [[Snake%20And%20Ladder|Snake And Ladder]]
| Draft
| Draft
|-
| 4
| [[Colour%20pinstripe%2FPrinter|Colour pinstripe/Printer]]
| Task
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
|data-sort-value="continued fraction/arithmetic/g(matrix ng, contined fraction n0B1, contined fraction n0B2)"| [[Continued%20fraction%2FArithmetic%2FG%28matrix%20NG%2C%20Contined%20Fraction%20N1%2C%20Contined%20Fraction%20N2%29|Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)]]
| [[Gauss-Jordan%20matrix%20inversion|Gauss-Jordan matrix inversion]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Data%20Encryption%20Standard|Data Encryption Standard]]
|data-sort-value="continued fraction/arithmetic/g(matrix ng, contined fraction n0B1, contined fraction n0B2)"| [[Continued%20fraction%2FArithmetic%2FG%28matrix%20NG%2C%20Contined%20Fraction%20N1%2C%20Contined%20Fraction%20N2%29|Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Fibonacci%20heap|Fibonacci heap]]
| [[Four%20is%20the%20number%20of%20letters%20in%20the%20...|Four is the number of letters in the ...]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Four%20is%20the%20number%20of%20letters%20in%20the%20...|Four is the number of letters in the ...]]
| [[Geometric%20algebra|Geometric algebra]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Functional%20coverage%20tree|Functional coverage tree]]
| [[Data%20Encryption%20Standard|Data Encryption Standard]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Gauss-Jordan%20matrix%20inversion|Gauss-Jordan matrix inversion]]
| [[Tetris|Tetris]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Pentomino%20tiling|Pentomino tiling]]
| [[Geometric%20algebra|Geometric algebra]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Greed|Greed]]
| [[Fibonacci%20heap|Fibonacci heap]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[One-time%20pad|One-time pad]]
| [[Remote%20agent%2FAgent%20interface|Remote agent/Agent interface]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Pentomino%20tiling|Pentomino tiling]]
| [[Functional%20coverage%20tree|Functional coverage tree]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Railway%20circuit|Railway circuit]]
| [[Greed|Greed]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Remote%20agent%2FAgent%20interface|Remote agent/Agent interface]]
| [[Addition-chain%20exponentiation|Addition-chain exponentiation]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Remote%20agent%2FAgent%20logic|Remote agent/Agent logic]]
| [[Rosetta%20Code%2FRun%20examples|Rosetta Code/Run examples]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,926: Line 5,926:
| [[Remote%20agent%2FSimulation|Remote agent/Simulation]]
| [[Remote%20agent%2FSimulation|Remote agent/Simulation]]
| Draft
| Draft
|- style="background-color: #ffc"
|-
| 4
| 4
| [[Rosetta%20Code%2FRun%20examples|Rosetta Code/Run examples]]
| [[Colour%20pinstripe%2FPrinter|Colour pinstripe/Printer]]
| Task
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Snake%20And%20Ladder|Snake And Ladder]]
| [[Remote%20agent%2FAgent%20logic|Remote agent/Agent logic]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Tarjan|Tarjan]]
| [[Railway%20circuit|Railway circuit]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Tetris|Tetris]]
| [[Using%20a%20Speech%20engine%20to%20highlight%20words|Using a Speech engine to highlight words]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Using%20a%20Speech%20engine%20to%20highlight%20words|Using a Speech engine to highlight words]]
| [[One-time%20pad|One-time pad]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 4
| 4
| [[Using%20the%20Meetup.com%20API|Using the Meetup.com API]]
| [[Tarjan|Tarjan]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 3
| 3
| [[Hexapawn|Hexapawn]]
| [[Boids|Boids]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 3
| 3
| [[Hexapawn|Hexapawn]]
| [[OpenGL%2FUtah%20Teapot|OpenGL/Utah Teapot]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 3
| 3
| [[OpenGL%2FUtah%20Teapot|OpenGL/Utah Teapot]]
| [[Rosetta%20Code%2FRank%20languages%20by%20number%20of%20users|Rosetta Code/Rank languages by number of users]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,968: Line 5,968:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 3
| 3
| [[Rosetta%20Code%2FRank%20languages%20by%20number%20of%20users|Rosetta Code/Rank languages by number of users]]
| [[Boids|Boids]]
| Draft
|- style="background-color: #ffc"
| 3
| [[Text%20to%20HTML|Text to HTML]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 5,983: Line 5,979:
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 2
| 3
| [[Text%20to%20HTML|Text to HTML]]
| [[Recursive%20descent%20parser%20generator|Recursive descent parser generator]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 2
| 2
| [[Audio%20Overlap%20Loop|Audio Overlap Loop]]
| [[Tamagotchi%20emulator|Tamagotchi emulator]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 2
| 2
| [[Chess%20player|Chess player]]
| [[OpenWebNet%20Password|OpenWebNet Password]]
| Draft
|- style="background-color: #ffc"
| 2
| [[Solve%20a%20Rubik%27s%20Cube|Solve a Rubik's Cube]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 6,008: Line 6,000:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 2
| 2
| [[OpenWebNet%20Password|OpenWebNet Password]]
| [[Audio%20Overlap%20Loop|Audio Overlap Loop]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 2
| 2
| [[Chess%20player|Chess player]]
| [[Penrose%20tiling|Penrose tiling]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 2
| 2
| [[Recursive%20descent%20parser%20generator|Recursive descent parser generator]]
| [[Penrose%20tiling|Penrose tiling]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 1
| 2
| [[Solve%20a%20Rubik%27s%20Cube|Solve a Rubik's Cube]]
| [[Terminal%20control%2FRestricted%20width%20positional%20input%2FWith%20wrapping|Terminal control/Restricted width positional input/With wrapping]]
| Draft
|- style="background-color: #ffc"
| 2
| [[Tamagotchi%20emulator|Tamagotchi emulator]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 1
| 1
| [[Black%20Box|Black Box]]
| [[Solving%20coin%20problems|Solving coin problems]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 6,032: Line 6,028:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 1
| 1
| [[IRC%20gateway|IRC gateway]]
| [[Multidimensional%20Newton-Raphson%20metod|Multidimensional Newton-Raphson metod]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 1
| 1
| [[Multidimensional%20Newton-Raphson%20metod|Multidimensional Newton-Raphson metod]]
| [[Terminal%20control%2FRestricted%20width%20positional%20input%2FNo%20wrapping|Terminal control/Restricted width positional input/No wrapping]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 1
| 1
| [[Process%20SMIL%20directives%20in%20XML%20data|Process SMIL directives in XML data]]
| [[IRC%20gateway|IRC gateway]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
Line 6,048: Line 6,044:
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 1
| 1
| [[Solving%20coin%20problems|Solving coin problems]]
| [[Process%20SMIL%20directives%20in%20XML%20data|Process SMIL directives in XML data]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 1
| 1
| [[Terminal%20control%2FRestricted%20width%20positional%20input%2FNo%20wrapping|Terminal control/Restricted width positional input/No wrapping]]
| [[Black%20Box|Black Box]]
| Draft
|- style="background-color: #ffc"
| 1
| [[Terminal%20control%2FRestricted%20width%20positional%20input%2FWith%20wrapping|Terminal control/Restricted width positional input/With wrapping]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Blackjack%20strategy|Blackjack strategy]]
| [[Waveform%20analysis%2FDoh%20ray%20me|Waveform analysis/Doh ray me]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Chess%20player%2FMove%20generation|Chess player/Move generation]]
| [[Rosetta%20Code%2FTasks%20sorted%20by%20average%20lines%20of%20code|Rosetta Code/Tasks sorted by average lines of code]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Chess%20player%2FProgram%20options%20and%20user%20interface|Chess player/Program options and user interface]]
| [[Waveform%20analysis%2FTop%20and%20tail|Waveform analysis/Top and tail]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Chess%20player%2FSearch%20and%20evaluation|Chess player/Search and evaluation]]
| [[Ukkonen%E2%80%99s%20Suffix%20Tree%20Construction|Ukkonen’s Suffix Tree Construction]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Rosetta%20Code%2FTasks%20sorted%20by%20average%20lines%20of%20code|Rosetta Code/Tasks sorted by average lines of code]]
| [[Weather%20Routing|Weather Routing]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Ukkonen%E2%80%99s%20Suffix%20Tree%20Construction|Ukkonen’s Suffix Tree Construction]]
| [[Chess%20player%2FSearch%20and%20evaluation|Chess player/Search and evaluation]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Unicode%20polynomial%20equation|Unicode polynomial equation]]
| [[Blackjack%20strategy|Blackjack strategy]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Waveform%20analysis%2FDoh%20ray%20me|Waveform analysis/Doh ray me]]
| [[Chess%20player%2FProgram%20options%20and%20user%20interface|Chess player/Program options and user interface]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Waveform%20analysis%2FTop%20and%20tail|Waveform analysis/Top and tail]]
| [[Chess%20player%2FMove%20generation|Chess player/Move generation]]
| Draft
| Draft
|- style="background-color: #ffc"
|- style="background-color: #ffc"
| 0
| 0
| [[Weather%20Routing|Weather Routing]]
| [[Unicode%20polynomial%20equation|Unicode polynomial equation]]
| Draft
| Draft
|}
|}

Revision as of 14:29, 30 March 2018

Task
Rosetta Code/Count examples
You are encouraged to solve this task according to the task description, using any language you may know.

Find the total number of programming examples for each task and the total for all tasks.

Essentially, count the number of occurrences of =={{header| on each task page.

Output:

100 doors: 20 examples.
99 Bottles of Beer: 29 examples.
Abstract type: 10 examples.

Total: X examples.

You'll need to use the Media Wiki API, which you can find out about locally, here, or in Media Wiki's API documentation at, API:Query

Ada

Library: AWS

Parsing XML file with XMLAda from AdaCore <lang Ada>with Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url; with Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs; with Input_Sources.Strings, Unicode, Unicode.Ces.Utf8; with Ada.Strings.Unbounded, Ada.Strings.Fixed, Ada.Text_IO, Ada.Command_Line; with Ada.Containers.Vectors;

use Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url; use Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs; use Aws, Ada.Strings.Unbounded, Ada.Strings.Fixed, Input_Sources.Strings; use Ada.Text_IO, Ada.Command_Line;

procedure Count_Examples is

  package Members_Vectors is new Ada.Containers.Vectors (
     Index_Type => Positive,
     Element_Type => Unbounded_String);
  use Members_Vectors;
  Exemples      : Vector;
  Nbr_Lg, Total : Natural := 0;
  procedure Get_Vector (Category : in String; Mbr_Vector : in out Vector) is
     Reader  : Tree_Reader;
     Doc     : Document;
     List    : Node_List;
     N       : Node;
     A       : Attr;
     Page    : Aws.Response.Data;
     Uri_Xml : constant String :=
        "http://rosettacode.org/mw/api.php?action=query&list=categorymembers"
        &
        "&format=xml&cmlimit=500&cmtitle=Category:";
  begin
     Page := Client.Get (Uri_Xml & Category);
     if Response.Status_Code (Page) not  in Messages.Success then
        raise Client.Connection_Error;
     end if;
     declare
        Xml    : constant String := Message_Body (Page);
        Source : String_Input;
     begin
        Open
          (Xml'Unrestricted_Access,
           Unicode.Ces.Utf8.Utf8_Encoding,
           Source);
        Parse (Reader, Source);
        Close (Source);
     end;
     Doc  := Get_Tree (Reader);
     List := Get_Elements_By_Tag_Name (Doc, "cm");
     for Index in 1 .. Length (List) loop
        N := Item (List, Index - 1);
        A := Get_Named_Item (Attributes (N), "title");
        Append (Mbr_Vector, To_Unbounded_String (Value (A)));
     end loop;
     Free (List);
     Free (Reader);
  end Get_Vector;
  function Scan_Page (Title : String) return Natural is
     Page                      : Aws.Response.Data;
     File                      : Aws.Resources.File_Type;
     Buffer                    : String (1 .. 1024);
     Languages, Position, Last : Natural := 0;
  begin
     Page :=
        Client.Get
          ("http://rosettacode.org/mw/index.php?title=" &
           Aws.Url.Encode (Title) &
           "&action=raw");
     Response.Message_Body (Page, File);
     while not End_Of_File (File) loop
        Resources.Get_Line (File, Buffer, Last);
        Position :=
           Index
             (Source  => Buffer (Buffer'First .. Last),
              Pattern => "=={{header|");
        if Position > 0 then
           Languages := Languages + 1;
        end if;
     end loop;
     Close (File);
     return Languages;
  end Scan_Page;

begin

  Get_Vector ("Programming_Tasks", Exemples);
  for I in First_Index (Exemples) .. Last_Index (Exemples) loop
     declare
        Title : constant String :=
           To_String (Members_Vectors.Element (Exemples, I));
     begin
        Nbr_Lg := Scan_Page (Title);
        Total  := Total + Nbr_Lg;
        Put_Line (Title & " :" & Integer'Image (Nbr_Lg) & " exemples.");
     end;
  end loop;
  Put_Line ("Total :" & Integer'Image (Total) & " exemples.");

end Count_Examples; </lang> Output :

100 doors : 107 exemples.
24 game : 30 exemples.
....
Yahoo! search interface : 10 exemples.
Zig-zag matrix : 49 exemples.
Total : 17238 exemples.

AutoHotkey

<lang AutoHotkey>UrlDownloadToFile

 , http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml
 , tasks.xml

FileRead, tasks, tasks.xml pos = 0 quote = "  ; " regtitle := "<cm.*?title=" . quote . "(.*?)" . quote While, pos := RegExMatch(tasks, regtitle, title, pos + 1) {

 UrlDownloadToFile
   , % "http://www.rosettacode.org/w/index.php?title=" . title1 . "&action=raw"
   , task.xml
 FileRead, task, task.xml
 RegExReplace(task, "\{\{header\|", "", count)
 current :=  title1 . ": " . count . " examples.`n"
 output .= current
 TrayTip, current, % current

} MsgBox % output Return</lang>

BBC BASIC

<lang bbcbasic> VDU 23,22,640;512;8,16,16,128+8 : REM Enable UTF-8 support

     SYS "LoadLibrary", "URLMON.DLL" TO urlmon%
     SYS "GetProcAddress", urlmon%, "URLDownloadToFileA" TO UDTF
     special$ = "+()'"
     
     url$ = "http://www.rosettacode.org/w/api.php?action=query" + \
     \      "&list=categorymembers&cmtitle=Category:Programming_Tasks" + \
     \      "&cmlimit=500&format=xml"
     file$ = @tmp$ + "tasks.xml"
     SYS UDTF, 0, url$, file$, 0, 0 TO fail%
     IF fail% ERROR 100, "File download failed (tasks)"
     
     Total% = 0
     file% = OPENIN(file$)
     WHILE NOT EOF#file%
       a$ = GET$#file%
       i% = 0
       REPEAT
         i% = INSTR(a$, "title=", i%+1)
         IF i% THEN
           j% = INSTR(a$, ">", i%)
           title$ = MID$(a$, i%+7, j%-i%-10)
           REM Replace HTML codes:
           REPEAT
             k% = INSTR(title$, "&")
             IF k% THEN
               l% = INSTR(title$, ";", k%)
               title$ = LEFT$(title$,k%-1) + \
               \        FNhtml(MID$(title$,k%,l%-k%+1)) + MID$(title$,l%+1)
             ENDIF
           UNTIL k% = 0
           t$ = title$
           REM Substitute characters not allowed in a URL:
           FOR s% = 1 TO LEN(special$)
             REPEAT
               s$ = MID$(special$, s%, 1)
               k% = INSTR(t$, s$)
               IF k% t$ = LEFT$(t$,k%-1) + "%" + STR$~ASCs$ + MID$(t$,k%+1)
             UNTIL k% = 0
           NEXT
           url$ = "http://www.rosettacode.org/w/index.php?title=" + t$ + \
           \      "&action=raw"
           file$ = @tmp$ + "title.htm"
           SYS UDTF, 0, url$, file$, 0, 0 TO fail%
           IF fail% ERROR 100, "File download failed " + t$
           examples% = 0
           task% = OPENIN(file$)
           WHILE NOT EOF#task%
             IF INSTR(GET$#task%, "=={{header|") examples% += 1
           ENDWHILE
           CLOSE #task%
           Total% += examples%
           PRINT title$ ": " ; examples% " examples."
         ENDIF
       UNTIL i% = 0
       i% = INSTR(a$, "cmcontinue=")
       IF i% THEN
         CLOSE #file%
         j% = INSTR(a$, """", i%+1)
         k% = INSTR(a$, """", j%+1)
         url$ = "http://www.rosettacode.org/w/api.php?action=query" + \
         \      "&list=categorymembers&cmtitle=Category:Programming_Tasks" + \
         \      "&cmlimit=500&format=xml&cmcontinue=" + MID$(a$,j%+1,k%-j%)
         REPEAT
           i% = INSTR(url$, "|")
           IF i% url$ = LEFT$(url$,i%-1) + "%7C" + MID$(url$,i%+1)
         UNTIL i% = 0
         file$ = @tmp$ + "tasks.xml"
         SYS UDTF, 0, url$, file$, 0, 0 TO fail%
         IF fail% ERROR 100, "File download failed (continue)"
         file% = OPENIN(file$)
       ENDIF
     ENDWHILE
     CLOSE #file%
     PRINT ' "Total: " ; Total% " examples."
     END
     
     DEF FNhtml(h$)
     IF LEFT$(h$,2) = "&#" THEN = CHR$(VALMID$(h$,3))
     CASE h$ OF
       WHEN """: = """"
     ENDCASE
     = h$</lang>

Sample output:

100 doors: 154 examples.
24 game: 53 examples.
24 game/Solve: 30 examples.
99 Bottles of Beer: 181 examples.
A+B: 124 examples.
Abstract type: 49 examples.
Accumulator factory: 65 examples.
Ackermann function: 126 examples.
Active Directory/Connect: 12 examples.
Active Directory/Search for a user: 13 examples.
......
XML/DOM serialization: 33 examples.
XML/Input: 50 examples.
XML/Output: 41 examples.
XML/XPath: 33 examples.
Y combinator: 51 examples.
Yahoo! search interface: 13 examples.
Yin and yang: 36 examples.
Zebra puzzle: 11 examples.
Zeckendorf number representation: 14 examples.
Zig-zag matrix: 64 examples.

Total: 27004 examples.

Bracmat

<lang bracmat>( ( get-page

 =   
   .   sys$(str$("wget -q -O wget.out \"" !arg \"))
     & get$("wget.out",HT ML)
 )

& get-page$"http://rosettacode.org/wiki/Category:Programming_Tasks"

 : ? (table.?) ?tasklist (.table.) ?

& 0:?list & whl

 ' ( !tasklist
   :   ?
       ( a
       .   (href.@(?:"/wiki/" ?href)) (title.?title)
         &   get-page$(str$("http://rosettacode.org/wiki/" !href))
           : ?task
         & 0:?cnt
         &   whl
           ' (   !task
               :   ?
                   (   (span.(class.mw-headline) (id.?))
                       ?span
                       (.span.)
                       ?task
                   &   !span
                     :   ?
                         ( a
                         .   (href.@(?:"/wiki/Category:" ?))
                             (title.@(?:"Category:" ?))
                         )
                         @
                         (.a.)
                         ?
                   )
             & 1+!cnt:?cnt
             )
         & (!cnt.!title)+!list:?list
       )
       ?tasklist
   )

& lst$(list,taskfreq,NEW) )</lang> Output (in file tasqfreq):

list=
  (2."OLE Automation")
+ (3."Canny edge detector")
+ ( 3
  . "Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)"
  )
+ (4."Colour pinstripe/Printer")
+ (4."Vogel's approximation method")
+ (5."Catmull–Clark subdivision surface")
+ (5."Percolation/Bond percolation")
+ (5.Pinstripe/Printer)
+ (5."Zeckendorf arithmetic")
+ (6."Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)")
+ (6."Percolation/Mean cluster density")
+ (7."Bitmap/PPM conversion through a pipe")
+ (7."Deconvolution/2D+")
+ (7."K-d tree")
  ....
+ (125."Greatest element of a list")
+ (127."Averages/Arithmetic mean")
+ (131.Arrays)
+ (131."Increment a numerical string")
+ (132."Greatest common divisor")
+ (133.Loops/While)
+ (134."Conditional structures")
+ (136.Arithmetic/Integer)
+ (137.Loops/For)
+ (145.Loops/Infinite)
+ (147."Ackermann function")
+ (148."Reverse a string")
+ (152."A+B")
+ (152."Function definition")
+ (160."Empty program")
+ (163."Fibonacci sequence")
+ (164.Factorial)
+ (182.FizzBuzz)
+ (187."100 doors")
+ (188.Comments)
+ (216."99 Bottles of Beer")
+ (269."Hello world/Text");

C#

Object-oriented solution.

<lang csharp>using System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; using System.Net;

class Task {

   private string _task;
   private int _examples;
   public Task(string task, int examples) {
       _task = task;
       _examples = examples;
   }
   public string Name {
       get { return _task; }
   }
   public int Examples {
       get { return _examples; }
   }
   public override string ToString() {
       return String.Format("{0}: {1} examples.", this._task, this._examples);
   }

}

class Program {

   static List<string> GetTitlesFromCategory(string category, WebClient wc) {
       string content = wc.DownloadString(
           String.Format("http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:{0}&cmlimit=500&format=json", category)
       );
       return new Regex("\"title\":\"(.+?)\"").Matches(content).Cast<Match>().Select(x => x.Groups[1].Value.Replace("\\/", "/")).ToList();
   }
   static string GetSourceCodeFromPage(string page, WebClient wc) {
       return wc.DownloadString(
           String.Format("http://www.rosettacode.org/w/index.php?title={0}&action=raw", page)
       );
   }
   static void Main(string[] args) {
       WebClient wc = new WebClient();
       List<Task> tasks = new List<Task>();
       List<string> tasknames = GetTitlesFromCategory("Programming_Tasks", wc);
       foreach (string task in tasknames) {
           string content = GetSourceCodeFromPage(task, wc);
           int count = new Regex("=={{header", RegexOptions.IgnoreCase).Matches(content).Count;
           Task t = new Task(task, count);
           Console.WriteLine(t);
           tasks.Add(t);
       }
       Console.WriteLine("\nTotal: {0} examples.", tasks.Select(x => x.Examples).Sum());
   }

}</lang>

Clojure

<lang clojure>(ns count-examples

 (:import [java.net URLEncoder])
 (:use [clojure.contrib.http.agent :only (http-agent string)]
       [clojure.contrib.json :only (read-json)]
       [clojure.contrib.string :only (join)]))

(defn url-encode [v] (URLEncoder/encode (str v) "utf-8"))

(defn rosettacode-get [path params]

 (let [param-string (join "&" (for [[n v] params] (str (name n) "=" (url-encode v))))]
   (string (http-agent (format "http://www.rosettacode.org/w/%s?%s" path param-string)))))

(defn rosettacode-query [params]

 (read-json (rosettacode-get "api.php" (merge {:action "query" :format "json"} params))))

(defn list-cm

 ([params] (list-cm params nil))
 ([params continue]
    (let [cm-params (merge {:list "categorymembers"} params (or continue {}))
          result (rosettacode-query cm-params)]
      (concat (-> result (:query) (:categorymembers))
              (if-let [cmcontinue (-> result (:query-continue) (:categorymembers))]
                (list-cm params cmcontinue))))))

(defn programming-tasks []

 (let [result (list-cm {:cmtitle "Category:Programming_Tasks" :cmlimit 50})]
   (map #(:title %) result)))

(defn task-count [task]

 [task (count
        (re-seq #"==\{\{header"
                (rosettacode-get "index.php" {:action "raw" :title task})))])

(defn print-result []

 (let [task-counts (map task-count (programming-tasks))]
   (doseq [[task count] task-counts]
     (println (str task ":") count)
     (flush))
   (println "Total: " (reduce #(+ %1 (second %2)) 0 task-counts))))

</lang> <lang clojure>count-examples> (print-result) 100 doors: 73 24 game: 18 24 game/Solve: 14 99 Bottles of Beer: 89 Abstract type: 27 Accumulator factory: 23 Ackermann function: 73 Active Directory/Connect: 4 Active Directory/Search for a user: 3 Active object: 14 Add a variable to a class instance at runtime: 21 Address of a variable: 20 ... Total: 11216 nil </lang>

D

Works with: Tango

<lang D> import tango.io.Stdout; import tango.net.http.HttpClient; import tango.net.http.HttpHeaders; import tango.text.xml.Document; import tango.text.Util;

alias HttpHeader.ContentLength CL;

auto url = "http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml"; void main() {

   auto client = new HttpClient (HttpClient.Get, url);
   client.open();
   char[] mainData, tmp;
   int total, i;
   void cat(void[] content) { tmp ~= cast(char[]) content; }
   if (client.isResponseOK) {
       client.read(&cat, client.getResponseHeaders.getInt(CL));
       mainData = tmp;
       tmp = null;
       auto doc = new Document!(char);
       doc.parse(mainData);
       foreach (n; doc.query.descendant("cm").attribute("title")) {
           auto subClient = new HttpClient(HttpClient.Get, 
                   "http://www.rosettacode.org/w/index.php?title=" ~
                   replace(n.value.dup, ' ', '_') ~ "&action=raw");
           subClient.open();
           if (! subClient.isResponseOK) {
               Stderr (client.getResponse);
                break;
           }
           subClient.read(&cat, subClient.getResponseHeaders.getInt(CL));
           foreach (segment; patterns(cast(char[])tmp, "=={{header|")) i++;
           --i;
           if (i) --i;
           Stdout.formatln ("{0,-40} - {}", n.value, i);
           total += i;
           tmp = null;
           i = 0;
       }
       Stdout("total examples: ", total).newline;
   } else {
       Stderr (client.getResponse);
   }

} </lang>

EGL

Works with: EDT
EGL: Graphical client implementation

A graphical implementation with a grid showing the number of implementations for each Rosetta Code task as well as total task and implementation counts. Uses MediaWiki API service call to fetch tasks/categories in a JSON format and meets API data limit and continuation requirements to consume 100% of the items.

User Interface: RosettaCodeHandler.egl <lang EGL>package com.eglexamples.client;

import org.eclipse.edt.rui.widgets.*;

handler RosettaCodeHandler type RUIhandler{initialUI =[ui], title = "Rosetta Code Tasks and Counts"}

   ui GridLayout{columns = 3, rows = 4, cellPadding = 4, children = [ b1, dg1, l1, l2, l3, l4 ]};
   
   b1 Button{ layoutData = new GridLayoutData{ row = 1, column = 1 }, text = "Go!", onClick ::= b1_onClick };
   l1 TextLabel{ layoutData = new GridLayoutData{ row = 1, column = 2 }, text = "Total Tasks:" };
   l2 TextLabel{ layoutData = new GridLayoutData{ row = 1, column = 3 }, text = "0" };
   l3 TextLabel{ layoutData = new GridLayoutData{ row = 2, column = 2 }, text = "Total Implementations:" };
   l4 TextLabel{ layoutData = new GridLayoutData{ row = 2, column = 3 }, text = "0" };
   
   dg1 DataGrid{ layoutData = new GridLayoutData{ row = 3, column = 1, horizontalSpan = 3 },
   	pageSize = 10, showScrollbar = true,

columns = [ new DataGridColumn{name = "title", displayName = "Task", width=220}, new DataGridColumn{name = "count", displayName = "Count", width=100} ] };

   cmcontinue string?;
   title string?;
   allTasks Task[];
   restBindingTasks IHttp? = new HttpRest{
       restType = eglx.rest.ServiceType.TrueRest, 
  	request.uri = "http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=1&format=json"};
   restBindingPageDetail IHttp? = new HttpRest{
       restType = eglx.rest.ServiceType.TrueRest, 
  	request.uri = "http://rosettacode.org/mw/index.php"};
   function b1_onClick(event Event in)

call ProxyFunctions.listTasks("") using restBindingTasks

   	    returning to listTasksCallBack onException exceptionHandler;
   end
  
   function listTasksCallBack(retResult RosettaCodeJSON in)

title = retResult.query.categorymembers[1].title; cmcontinue = retResult.queryContinue.categorymembers.cmcontinue;

call ProxyFunctions.fetchPageDetail(title) using restBindingPageDetail

	    returning to pageDetailCallBack onException exceptionHandler;
   end
   function pageDetailCallBack(pageResults string in)
  	count int = countSubstring("=={{header", pageResults);
  	allTasks.appendElement(new Task { title = title, count = count });

l2.text = l2.text as int + 1; l4.text = l4.text as int + count;

  	if(cmcontinue != null)

call ProxyFunctions.listTasks(cmcontinue) using restBindingTasks returning to listTasksCallBack onException exceptionHandler; else dg1.data = allTasks as any[]; end

   end
  
   function countSubstring(substr string in, str string in) returns(int)

if(str.length() > 0 and substr.length() > 0) return (str.length() - str.replaceStr(subStr, "").length()) / subStr.length(); else return 0; end

   end 
  function exceptionHandler(exp AnyException in)
  end

end

record Task title string; count int; end</lang>

Service Interface: ProxyFunctions.egl <lang EGL>package com.eglexamples.client;

library ProxyFunctions

   function listTasks(continueLocation String in) returns (RosettaCodeJSON) {

@Rest{method = _GET, uriTemplate = "&cmcontinue={continueLocation}", requestFormat = None, responseFormat = JSON}

   }
   end	
   function fetchPageDetail(title String in) returns (String) {

@Rest{method = _GET, uriTemplate = "?title={title}&action=raw", requestFormat = None, responseFormat = None}

   }
   end	

end

record RosettaCodeJSON

   query Query;
   queryContinue QueryContinue{JSONName = "query-continue"};

end

record Query

   categorymembers Categorymembers[];

end

record Categorymembers

   cmcontinue string?;
   pageid int?;
   ns int?;
   title string?;

end

record QueryContinue

   categorymembers Categorymembers;

end</lang>


Erlang

Library: xmerl

<lang erlang> -module(rosseta_examples). -include_lib("xmerl/include/xmerl.hrl").

-export([main/0]).

main() ->

  application:start(inets), 
  Titles = read_titles(empty),
  Result = lists:foldl(fun(Title,Acc) -> Acc + calculate_one(Title) end, 0, Titles),
  io:format("Total: ~p examples.\n",[Result]),
  application:stop(inets).

read_titles(CurrentContinue) ->

  URL0 = "http://rosettacode.org/mw/api.php?" ++
        "action=query&list=categorymembers&cmtitle=Category:Programming_Tasks" ++
        "&cmlimit=500&format=xml",
  URL = 
     case CurrentContinue of 
        empty -> URL0;
        _ -> URL0 ++ "&cmcontinue=" ++ CurrentContinue
     end,
  {ok,Answer} = httpc:request(URL),
  {Document,_} = xmerl_scan:string(lists:last(tuple_to_list(Answer))),
  Continue = 
     [Value || #xmlAttribute{value = Value} <- xmerl_xpath:string("//@cmcontinue", Document)],
  Titles = 
    [Value || #xmlAttribute{value = Value} <- xmerl_xpath:string("//@title", Document)],
  case Continue of
     []->
        Titles;
     [ContValue | _] -> 
        Titles ++ read_titles(ContValue)
  end.

calculate_one(Title0) ->

  Title = replace_chars(Title0),
  URL = "http://www.rosettacode.org/w/index.php?title=" ++
        Title ++ "&action=raw",
  case httpc:request(URL) of
     {ok,Result} ->
           {match,Found} = 
              re:run(lists:last(tuple_to_list(Result)), "\n=={{header(|)", [global]),
           io:format("~ts: ~p examples.\n",[Title0,length(Found)]),
           length(Found);
     {error,socket_closed_remotely} -> 
        io:format("Socket closed remotely. Retry.\n"),
        calculate_one(Title0)
  end.

replace_chars(String) ->

  replace_chars(String,[]).
 

replace_chars([$ | T],Acc) ->

  replace_chars(T, [$_| Acc]);

replace_chars([$+| T],Acc) ->

  replace_chars(T, lists:reverse("%2B") ++ Acc);

replace_chars([8211| T],Acc) ->

  replace_chars(T, lists:reverse("%E2%80%93") ++ Acc);

replace_chars([Other| T],Acc) ->

  replace_chars(T, [Other| Acc]);

replace_chars([],Acc) ->

  lists:reverse(Acc).

</lang>


Outputs:

> rosseta_examples:main().
100 doors: 165 examples.
24 game: 56 examples.
24 game/Solve: 33 examples.
...
Zebra puzzle: 12 examples.
Zeckendorf number representation: 18 examples.
Zig-zag matrix: 65 examples.
Total: 28629 examples.

F#

Using asynchronous workflows to perform downloads concurrently:

<lang fsharp>#r "System.Xml.Linq.dll"

let uri1 = "http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml" let uri2 task = sprintf "http://www.rosettacode.org/w/index.php?title=%s&action=raw" task

[|for xml in (System.Xml.Linq.XDocument.Load uri1).Root.Descendants() do

   for attrib in xml.Attributes() do
     if attrib.Name.LocalName = "title" then
       yield async {
         let uri = uri2 (attrib.Value.Replace(" ", "_") |> System.Web.HttpUtility.UrlEncode)
         use client = new System.Net.WebClient()
         let! html = client.AsyncDownloadString(System.Uri uri)
         let sols' = html.Split([|"{{header|"|], System.StringSplitOptions.None).Length - 1
         lock stdout (fun () -> printfn "%s: %d examples" attrib.Value sols')
         return sols' }|]

|> Async.Parallel |> Async.RunSynchronously |> fun xs -> printfn "Total: %d examples" (Seq.sum xs)</lang>

This is 21× faster than the python thanks to the concurrency.

Factor

Runs in about a minute. The number of threads is limited to 10 avoid cloudfare's protection mechanism.

<lang factor>USING: arrays assocs concurrency.combinators concurrency.semaphores formatting hashtables http.client io json.reader kernel math math.parser sequences splitting urls.encoding ; IN: rosetta-code.count-examples

CONSTANT: list-url "http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&cmprop=title&format=json"

titles ( query -- titles )
 "query" of "categorymembers" of [ "title" of ] map ;
continued-url ( query -- url/f )
 "query-continue" of "categorymembers" of
 [ assoc>query list-url swap "&" glue ] [ f ] if* ;
(all-programming-titles) ( titles url -- titles' url' )
 http-get nip json> [ titles append ] [ continued-url ] bi
 [ (all-programming-titles) ] [ f ] if* ;
all-programming-titles ( -- titles ) { } list-url (all-programming-titles) drop ;

CONSTANT: content-base-url "http://rosettacode.org/mw/index.php?title=&action=raw"

content-url ( title -- url )
 " " "_" replace
 "title" associate assoc>query
 content-base-url swap "&" glue ;
occurences ( seq subseq -- n ) split-subseq length 1 - ;
count-examples ( title -- n )
 content-url http-get nip "=={{header|" occurences ;
print-task ( title n -- ) "%s: %d examples.\n" printf ;
print-total ( assoc -- ) values sum "Total: %d examples.\n" printf ;
fetch-counts ( titles -- assoc )
 10 <semaphore> [
   [ dup count-examples 2array ] with-semaphore
 ] curry parallel-map ;
print-counts ( titles -- )
 [ [ print-task ] assoc-each nl ] [ print-total ] bi ;
rosetta-examples ( -- )
 all-programming-titles fetch-counts print-counts ;

MAIN: rosetta-examples</lang> Outputs:

100 doors: 169 examples.
24 game: 58 examples.
...
Zeckendorf number representation: 22 examples.
Zig-zag matrix: 66 examples.

Total: 30745 examples.

Go

<lang go>package main

import (

   "bytes"
   "encoding/xml"
   "fmt"
   "io"
   "io/ioutil"
   "net/http"
   "net/url"
   "strings"

)

func req(u string, foundCm func(string)) string {

   resp, err := http.Get(u)
   if err != nil {
       fmt.Println(err) // connection or request fail
       return ""
   }
   defer resp.Body.Close()
   for p := xml.NewDecoder(resp.Body); ; {
       t, err := p.RawToken()
       switch s, ok := t.(xml.StartElement); {
       case err == io.EOF:
           return ""
       case err != nil:
           fmt.Println(err)
           return ""
       case !ok:
           continue
       case s.Name.Local == "cm":
           for _, a := range s.Attr {
               if a.Name.Local == "title" {
                   foundCm(a.Value)
               }
           }
       case s.Name.Local == "categorymembers" && len(s.Attr) > 0 &&
           s.Attr[0].Name.Local == "cmcontinue":
           return url.QueryEscape(s.Attr[0].Value)
       }
   }
   return ""

}

func main() {

   taskQuery := "http://rosettacode.org/mw/api.php?action=query" +
       "&format=xml&list=categorymembers&cmlimit=500" +
       "&cmtitle=Category:Programming_Tasks"
   continueAt := req(taskQuery, count)
   for continueAt > "" {
       continueAt = req(taskQuery+"&cmcontinue="+continueAt, count)
   }
   fmt.Printf("Total: %d examples.\n", total)

}

var marker = []byte("=={{header|") var total int

func count(cm string) {

   taskFmt := "http://rosettacode.org/mw/index.php?title=%s&action=raw"
   taskEsc := url.QueryEscape(strings.Replace(cm, " ", "_", -1))
   resp, err := http.Get(fmt.Sprintf(taskFmt, taskEsc))
   var page []byte
   if err == nil {
       page, err = ioutil.ReadAll(resp.Body)
       resp.Body.Close()
   }
   if err != nil {
       fmt.Println(err)
       return
   }
   examples := bytes.Count(page, marker)
   fmt.Printf("%s: %d\n", cm, examples)
   total += examples

}</lang>

Output
(May 25, 2011):
...
Y combinator: 40
Yahoo! search interface: 10
Yin and yang: 18
Zig-zag matrix: 50
Total: 18290 examples.

Haskell

Library: HTTP XML

from HackageDB

<lang haskell>import Network.Browser import Network.HTTP import Network.URI import Data.List import Data.Maybe import Text.XML.Light import Control.Arrow

justifyR w = foldl ((.return).(++).tail) (replicate w ' ') showFormatted t n = t ++ ": " ++ justifyR 4 (show n)

getRespons url = do

   rsp <- Network.Browser.browse $ do
     setAllowRedirects True
     setOutHandler $ const (return ())     -- quiet
     request $ getRequest url
   return $ rspBody $ snd rsp

getNumbOfExampels p = do

 let pg = intercalate "_" $ words p
 rsp <- getRespons $ "http://www.rosettacode.org/w/index.php?title=" ++ pg ++ "&action=raw"
 let taskPage = rsp
     countEx = length $ filter (=="=={{header|") $ takeWhile(not.null) $ unfoldr (Just. (take 11 &&& drop 1)) taskPage
 return countEx
 

progTaskExamples = do

 rsp <- getRespons "http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml"
 let xmls = onlyElems $ parseXML $ rsp
     tasks = concatMap (map (fromJust.findAttr (unqual "title")). filterElementsName (== unqual "cm")) xmls
 taskxx <- mapM getNumbOfExampels tasks
 let ns = taskxx
     tot = sum ns
 mapM_ putStrLn $ zipWith showFormatted tasks ns
 putStrLn $ ("Total: " ++) $ show tot</lang>

some output: <lang haskell>*Main> progTaskExamples 100 doors: 56 24 game: 11 24 game Player: 9 99 Bottles of Beer: 73 Abstract type: 23 Ackermann Function: 61 Active object: 9 ... Total: 9156</lang>

Icon and Unicon

The following code uses features exclusive to Unicon. This version handles all tasks, not just the first 500.

<lang Unicon>$define RCINDEX "http://rosettacode.org/mw/api.php?format=xml&action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500" $define RCTASK "http://rosettacode.org/mw/index.php?action=raw&title=" $define RCUA "User-Agent: Unicon Rosetta 0.1" $define RCXUA "X-Unicon: http://unicon.org/" $define TASKTOT "* Total Tasks *" $define TOTTOT "* Total Headers*"

link strings link hexcvt

procedure main(A) # simple single threaded read all at once implementation

   Tasks := table(0)
   every task := taskNames() do {
      Tasks[TASKTOT] +:= 1                            # count tasks
      every lang := languages(task) do {              # count languages
         Tasks[task] +:= 1                     
         Tasks[TOTTOT] +:= 1
         }
      }
   every insert(O := set(),key(Tasks))                # extract & sort keys 
   O := put(sort(O--set(TOTTOT,TASKTOT)),TASKTOT,TOTTOT)  # move totals to end
   every write(k := !O, " : ", Tasks[k]," examples.") # report

end

  1. Generate task names

procedure taskNames()

   continue := ""
   while \(txt := ReadURL(RCINDEX||continue)) do {
       txt ? {
           while tab(find("<cm ") & find(s :="title=\"")+*s) do
               suspend tab(find("\""))\1
           if tab(find("cmcontinue=")) then {
               continue := "&"||tab(upto(' \t'))
               }
           else break
           }
       }

end

  1. Generate language headers in a task

procedure languages(task)

   static WS
   initial WS := ' \t'
   page := ReadURL(RCTASK||CleanURI(task))
   page ? while (tab(find("\n==")),tab(many(WS))|"",tab(find("{{"))) do {
              header := tab(find("=="))
              header ? {
                  while tab(find("{{header|")) do {
                      suspend 2(="",tab(find("")))\1
                      }
                  }
              }

end

procedure CleanURI(u) #: clean up a URI

   static tr,dxml                     # xml & http translation
   initial {
      tr := table()
      every c := !string(~(&digits++&letters++'-_.!~*()/\'`')) do 
         tr[c] := "%"||hexstring(ord(c),2)
      every /tr[c := !string(&cset)] := c
      tr[" "] := "_"                                      # wiki convention
      every push(dxml := [],"&#"||right(ord(c := !"&<>'\""),3,"0")||";",c)
      }

   dxml[1] := u                       # insert URI as 1st arg
   u := replacem!dxml                 # de-xml it
   every (c := "") ||:= tr[!u]        # reencode everything
   c := replace(c,"%3E","'")          # Hack to put single quotes back in
   c := replace(c,"%26quot%3B","\"")  # Hack to put double quotes back in
   return c   

end

procedure ReadURL(url) #: read URL into string

   page := open(url,"m",RCUA,RCXUA) | stop("Unable to open ",url)
   text := ""
   if page["Status-Code"] < 300 then while text ||:= reads(page,-1)
   else write(&errout,image(url),": ",
                      page["Status-Code"]," ",page["Reason-Phrase"])
   close(page)
   return text

end</lang>

strings provides replacem hexcvt provides hexstring

Sample Output for July 6, 2013 (abridged):

100 doors : 171 examples.
24 game : 60 examples.
24 game/Solve : 37 examples.
9 billion names of God the integer : 12 examples.
99 Bottles of Beer : 199 examples.
A+B : 137 examples.
Abstract type : 54 examples.
Accumulator factory : 67 examples.
Ackermann function : 137 examples.
...
Y combinator : 56 examples.
Yahoo! search interface : 18 examples.
Yin and yang : 39 examples.
Zebra puzzle : 12 examples.
Zeckendorf arithmetic : 3 examples.
Zeckendorf number representation : 21 examples.
Zig-zag matrix : 67 examples.
* Total Tasks * : 676 examples.
* Total Headers* : 31146 examples.

J

Solution:
Using getCategoryMembers from Find unimplemented tasks. <lang j>require 'web/gethttp'

getAllTaskSolnCounts=: monad define

 tasks=.  getCategoryMembers 'Programming_Tasks'
 counts=. getTaskSolnCounts &> tasks
 tasks;counts

)

getTaskSolnCounts=: monad define

 makeuri=. 'http://www.rosettacode.org/w/index.php?title=' , ,&'&action=raw'
 wikidata=. gethttp makeuri urlencode y
 ([: +/ '{{header|'&E.) wikidata

)

formatSolnCounts=: monad define

 'tasks counts'=. y
 tasks=. tasks , &.>':'
 res=. ;:^:_1 tasks ,. (8!:0 counts) ,. <'examples.'
 res , 'Total examples: ' , ": +/counts

)</lang>

Example Usage: <lang j> formatSolnCounts getAllTaskSolnCounts 100 doors: 61 examples. 24 game: 15 examples. 24 game Player: 11 examples. 99 Bottles of Beer: 76 examples. ...</lang>

Java

Works with: Java version 1.5+

<lang java5> import java.util.ArrayList; import ScreenScrape;

public class CountProgramExamples {

   private static final String baseURL = "http://rosettacode.org/wiki/";
   private static final String rootURL = "http://www.rosettacode.org/w/"
       + "api.php?action=query&list=categorymembers"
       + "&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml";
   private static final String taskBegin = "title=\"";
   private static final String taskEnd = "\"";
   private static final String exmplBegin = "";
   private static final String exmplEnd = "";
   private static final String editBegin = "";
   /**
    * @param args
    */
   public static void main(String[] args) {
       int exTotal = 0;
       try {
           // Get root query results
           ArrayList<String> tasks = new ArrayList<String>();
           ScreenScrape ss = new ScreenScrape();
           String rootPage = ss.read(rootURL);
           while (rootPage.contains(taskBegin)) {
               rootPage = rootPage.substring(rootPage.indexOf(taskBegin)
                   + taskBegin.length());
               String title = rootPage.substring(0, rootPage.indexOf(taskEnd));
               if (!title.contains("Category:")) {
                   tasks.add(title);
               }
               rootPage = rootPage.substring(rootPage.indexOf(taskEnd));
           }
           // Loop through each task and print count
           for (String task : tasks) {
               String title = task.replaceAll("'", "'");
               String taskPage = ss.read(baseURL + title.replaceAll(" ", "_"));
               int exSubTot;
               if (taskPage.contains(exmplBegin)) {
                   int startPos = taskPage.lastIndexOf(exmplBegin)
                       + exmplBegin.length();
                   String countStr = taskPage.substring(startPos,
                       taskPage.indexOf(exmplEnd, startPos));
                   exSubTot = Integer
                       .parseInt(countStr.contains(".") ? countStr
                           .substring(0, countStr.indexOf("."))
                           : countStr);
               } else {
                   exSubTot = 0;
                   while (taskPage.contains(editBegin)) {
                       taskPage = taskPage.substring(taskPage
                           .indexOf(editBegin) + editBegin.length());
                       exSubTot++;
                   }
               }
               exTotal += exSubTot;
               System.out.println(title + ": " + exSubTot + " examples.");
           }
           // Print total
           System.out.println("\nTotal: " + exTotal + " examples.");
       } catch (Exception e) {
           System.out.println(title);
           System.out.println(startPos + ":"
               + taskPage.indexOf(exmplEnd, startPos));
           System.out.println(taskPage);
           e.printStackTrace(System.out);
       }
   }

} </lang> ScreenScrape class


jq

jq does not duplicate the functionality of `curl` but works seamlessly with it, as illustrated by the following bash script. Note in particular the use of jq's `@uri` filter in the bash function `titles`.

<lang bash>#!/bin/bash

  1. Produce lines of the form: URI TITLE

function titles {

   local uri="http://www.rosettacode.org/mw/api.php?action=query&list=categorymembers"
   uri+="&cmtitle=Category:Programming_Tasks&cmlimit=5000&format=json"
   curl -Ss "$uri" |
     jq -r '.query.categorymembers[] | .title | "\(@uri) \(.)"'

}

  1. Syntax: count URI

function count {

   local uri="$1"
   curl -Ss "http://rosettacode.org/mw/index.php?title=${uri}&action=raw" |
     jq -R -n 'reduce (inputs|select(test("=={{header\\|"))) as $x(0; .+1)'

}

local n=0 i while read uri title do

   i=$(count "$uri")
   echo "$title: $i examples."
   n=$((n + i))

done < <(titles) echo Total: $n examples.</lang>

Output:
100 doors: 252 examples.
15 Puzzle Game: 36 examples.
2048: 24 examples.
...
Order two numerical lists: 65 examples.
Ordered Partitions: 28 examples.
Ordered words: 85 examples.
Palindrome detection: 136 examples.
Total: 32416 examples.

Lasso

<lang Lasso>local(root = json_deserialize(curl('http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=10&format=json')->result)) local(tasks = array, title = string, urltitle = string, thiscount = 0, totalex = 0) with i in #root->find('query')->find('categorymembers') do => {^ #thiscount = 0 #title = #i->find('title') #urltitle = #i->find('title') #urltitle->replace(' ','_')

#title+': ' local(src = curl('http://rosettacode.org/mw/index.php?title='+#urltitle->asBytes->encodeurl+'&action=raw')->result->asString) #thiscount = (#src->split('==[[:Category:{PercentEncode Xr}

       else
          {Append &%|{PercentEncode Xr}
       else
          {Append &%]] [[Category:{PercentEncode Xr}
       else
          {Append &%]] Property "Implemented in language" (as page type) with input value "{PercentEncode Xr}</br>        else</br>           {Append &%" contains invalid characters or is incomplete and therefore can cause unexpected results during a query or annotation process.
       end
    end
 end
 
 fun {ToHex2 X}
    [{ToHex1 X div 16} {ToHex1 X mod 16}]
 end
 
 fun {ToHex1 X}
    if X >= 0 andthen X =< 9 then &0 + X
    elseif X >= 10 andthen X =< 15 then &A + X - 10
    end
 end

in

 {Main}</lang>

Example output:

100 doors: 86 examples.
24 game: 22 examples.
24 game/Solve: 15 examples.
99 Bottles of Beer: 108 examples.
A+B: 59 examples.
...
Xiaolin Wu's line algorithm: 5 examples.
Y combinator: 29 examples.
Yahoo! Search: 10 examples.
Zig-zag matrix: 43 examples.
Total: 14099 examples.

Perl

<lang Perl>use LWP::Simple;

my $site = "http://rosettacode.org"; my $list_url = "/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml";

for (get("$site$list_url") =~ /cm.*?title="(.*?)"/g) {

   (my $slug = $_) =~ tr/ /_/;
   my $count = () = get("$site/wiki/$slug") =~ /toclevel-1/g;
   print "$_: $count examples\n";

}</lang>

Library: Mojolicious

<lang Perl>use v5.10; use Mojo::UserAgent;

my $site = "http://rosettacode.org"; my $list_url = "/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml";

my $ua = Mojo::UserAgent->new; $ua->get("$site$list_url")->res->dom->find('cm')->each(sub {

   (my $slug = $_->{title}) =~ tr/ /_/;
   my $count = $ua->get("$site/wiki/$slug")->res->dom->find("#toc .toclevel-1")->size;
   say "$_->{title}: $count examples";

});</lang>

Perl 6

Works with: Rakudo version 2018.03

Retrieves counts for both Tasks and Draft Tasks. Save / Display results as a sortable wikitable rather than a static list. Click on a column header to sort on that column. To do a secondary sort, hold down the shift key and click on a second column header. Tasks have a gray (default) background, Draft Tasks have a yellow background. <lang perl6>use HTTP::UserAgent; use URI::Escape; use JSON::Fast;

class Progress-Bar {

   has $.width = 40;
   has $.count is rw = 0;
   has @!bar = < ▏ ▎ ▍ ▌ ▋ ▊ ▉ █ >;
   method inc {
       ($.count += 1) mod= $.width * 8;
       self.clear ~ @!bar.tail x $.count div 8 ~ @!bar[ $.count % 8 ]
           ~ ' ' x $.width - 1 - ($.count / 8).floor
   }
   method clear {
       "\r" ~ ' ' x $.width ~ "\r"
   }

}

  1. Friendlier descriptions for task categories

my %cat = (

   'Programming_Tasks' => 'Task',
   'Draft_Programming_Tasks' => 'Draft'

);

my $client = HTTP::UserAgent.new;

my $url = 'http://rosettacode.org/mw';

my $hashfile = './RC_Task_count.json'; my $tablefile = './RC_Task_count.txt';

my %tasks;

  1. =begin update

note 'Retrieving task information...';

my $progress = Progress-Bar.new(width => 79);

for %cat.keys -> $cat {

   mediawiki-query(
       $url, 'pages',
       :generator<categorymembers>,
       :gcmtitle("Category:$cat"),
       :gcmlimit<350>,
       :rawcontinue(),
       :prop<title>
   ).map({
       my $page = mediawiki-query(
          $url, 'pages',
          :titles(.<title>),
          :prop<revisions>,
          :rvprop<content>,
       );
       my $count = +$page.comb(/'=={{header|'/);
       %tasks{.<title>} = {'cat' => %cat{$cat}, :$count};
       print $progress.inc;
   })

}

print $progress.clear;

note "\nTask information saved to local file: {$hashfile.IO.absolute}"; $hashfile.IO.spurt(%tasks.&to-json);

  1. =end update
  1. Load information from local file

%tasks = $hashfile.IO.e ?? $hashfile.IO.slurp.&from-json !! ( );

  1. Convert saved task / author info to a table

note "\nBuilding table..."; my $count = +%tasks; my $taskcnt = +%tasks.grep: *.value.<cat> eq %cat<Programming_Tasks>; my $draftcnt = $count - $taskcnt; my $total = sum %tasks{*}»<count>;

  1. Dump table to a file

my $out = open($tablefile, :w) or die "$!\n";

  1. Add table boilerplate and caption

$out.say:

'

', "\n",
   '{|class="wikitable sortable"', "\n",
   "|+ As of { Date.today } :: Tasks: { $taskcnt } :: Draft Tasks: ",
   "{ $draftcnt } :: Total Tasks: { $count } :: Total Examples: { $total }\n",
   "! Count !! Task !! Category"
  1. Sort tasks by count then add row

for %tasks.sort: { [-.value<count>, .key] } -> $task {

   $out.say:
     ( $task.value<cat> eq 'Draft'
       ?? "|- style=\"background-color: #ffc\"\n"
       !! "|-\n"
     ),
     "| { $task.value<count> }\n",
     ( $task.key ~~ /\d/
       ?? "|data-sort-value=\"{ $task.key.&naturally }\"| [[{uri-escape $task.key}|{$task.key}]]\n"
       !! "| [[{uri-escape $task.key}|{$task.key}]]\n"
     ),
     "| { $task.value<cat> }"

}

$out.say( "|}\n", '

' );

$out.close;

note "Table file saved as: {$tablefile.IO.absolute}";

sub mediawiki-query ($site, $type, *%query) {

   my $url = "$site/api.php?" ~ uri-query-string(
       :action<query>, :format<json>, :formatversion<2>, |%query);
   my $continue = ;
   gather loop {
       my $response = $client.get("$url&$continue");
       my $data = from-json($response.content);
       take $_ for $data.<query>.{$type}.values;
       $continue = uri-query-string |($data.<query-continue>{*}».hash.hash or last);
   }

}

sub uri-query-string (*%fields) { %fields.map({ "{.key}={uri-escape .value}" }).join("&") }

sub naturally ($a) { $a.lc.subst(/(\d+)/, ->$/ {0~(65+$0.chars).chr~$0},:g) } </lang>

Output:
As of 2018-03-30 :: Tasks: 871 :: Draft Tasks: 209 :: Total Tasks: 1080 :: Total Examples: 56069
Count Task Category
383 Hello world/Text Task
288 99 Bottles of Beer Task
266 FizzBuzz Task
265 100 doors Task
244 Fibonacci sequence Task
242 Comments Task
236 Factorial Task
224 A+B Task
215 Empty program Task
208 Function definition Task
196 Loops/For Task
195 Loops/Infinite Task
194 Ackermann function Task
190 Loops/While Task
187 Arrays Task
185 Reverse a string Task
174 Arithmetic/Integer Task
173 Greatest common divisor Task
172 Conditional structures Task
171 Greatest element of a list Task
167 Averages/Arithmetic mean Task
164 Integer comparison Task
161 Increment a numerical string Task
160 Loops/For with a specified step Task
159 Array concatenation Task
159 Loops/Downward for Task
158 Repeat a string Task
156 Loops/Foreach Task
155 Boolean values Task
155 Copy a string Task
150 Hello world/Graphical Task
149 Sum and product of an array Task
148 Even or odd Task
148 String case Task
148 String length Task
146 Character codes Task
146 Hailstone sequence Task
144 Apply a callback to an array Task
144 Loops/Do-while Task
141 Hello world/Newline omission Task
140 String concatenation Task
139 Loops/N plus one half Task
138 Binary digits Task
138 Sum of a series Task
138 Tokenize a string Task
137 Filter Task
137 Generic swap Task
137 Loops/Break Task
137 Palindrome detection Task
137 Sum of squares Task
136 Integer sequence Task
136 Logical operations Task
136 Rot-13 Task
135 Execute a system command Task
134 Sieve of Eratosthenes Task
133 Towers of Hanoi Task
131 Sort an integer array Task
130 Dot product Task
129 File input/output Task
129 Leap year Task
127 Associative array/Creation Task
126 Higher-order functions Task
126 Remove duplicate elements Task
126 Sorting algorithms/Bubble sort Task
125 Determine if a string is numeric Task
124 Array length Task
123 Empty string Task
123 Hello world/Standard error Task
123 Quine Task
123 User input/Text Task
122 Guess the number Task
122 Read entire file Task
121 Command-line arguments Task
121 Roman numerals/Encode Task
120 Create a file Task
120 Loops/Continue Task
119 Primality by trial division Task
118 Bitwise operations Task
118 Ethiopian multiplication Task
118 Loop over multiple arrays simultaneously Task
117 Least common multiple Task
117 Sleep Task
116 Day of the week Task
116 Factors of an integer Task
116 Sorting algorithms/Quicksort Task
116 System time Task
115 Check that file exists Task
115 Happy numbers Task
115 Include a file Task
115 Substring Task
114 Caesar cipher Task
114 Literals/String Task
113 Literals/Integer Task
113 Mutual recursion Task
112 Detect division by zero Task
112 Pascal's triangle Task
111 Averages/Root mean square Task
111 Balanced brackets Task
111 Flatten a list Task
111 Luhn test of credit card numbers Task
110 Program termination Task
110 Stack Task
109 File size Task
109 Knuth shuffle Task
108 Compound data type Task
108 Variables Task
107 Associative array/Iteration Task
107 Date format Task
107 Read a file line by line Task
106 Delete a file Task
106 Generate lower case ASCII alphabet Task
106 Real constants and functions Task
106 Rename a file Task
106 Search a list Task
105 Mandelbrot set Task
104 ABC Problem Task
104 Count in octal Task
104 Function composition Task
104 Input loop Task
104 Null object Task
104 Return multiple values Task
103 Binary search Task
103 Case-sensitivity of identifiers Task
103 Classes Task
103 Formatted numeric output Task
103 Loops/Nested Task
103 Sorting algorithms/Insertion sort Task
102 Averages/Median Task
102 Count occurrences of a substring Task
102 Hostname Task
101 Arithmetic/Complex Task
101 Hash from two arrays Task
101 Random numbers Task
100 HTTP Task
100 Multiplication tables Task
100 Pick random element Task
99 Anagrams Task
99 Environment variables Task
99 Find limit of recursion Task
99 Matrix multiplication Task
99 Matrix transposition Task
99 N-queens problem Task
99 Pangram checker Task
98 Conway's Game of Life Task
98 Guess the number/With feedback Task
98 Horner's rule for polynomial evaluation Task
97 Accumulator factory Task
97 Align columns Task
97 Create a two-dimensional array at runtime Task
97 Perfect numbers Task
96 Assertions Task
96 Haversine formula Task
96 Identity matrix Task
96 Roman numerals/Decode Task
96 Strip a set of characters from a string Task
96 Temperature conversion Task
95 Averages/Pythagorean means Task
95 Evaluate binomial coefficients Task
95 String matching Task
94 Middle three digits Task
94 Substring/Top and tail Task
94 Variadic function Task
93 Catalan numbers Task
93 Run-length encoding Task
93 Zero to the zero power Task
92 Arithmetic-geometric mean Task
92 Program name Task
92 Shell one-liner Task
92 Strip whitespace from a string/Top and tail Task
92 Zig-zag matrix Task
91 Exceptions Task
91 Trigonometric functions Task
90 Infinity Task
90 Letter frequency Task
90 Prime decomposition Task
90 Regular expressions Task
90 String interpolation (included) Task
89 Combinations Task
88 24 game Task
88 Enumerations Task
88 Power set Task
88 Random number generator (included) Task
88 Short-circuit evaluation Task
88 Sierpinski triangle Task
88 Sorting algorithms/Merge sort Task
88 Sorting algorithms/Selection sort Task
87 Collections Task
87 One-dimensional cellular automata Task
87 Ordered words Task
86 Anonymous recursion Task
86 Interactive programming Task
85 Comma quibbling Task
85 Exponentiation operator Task
85 Levenshtein distance Task
85 Queue/Definition Task
85 Sequence of non-squares Task
84 Arbitrary-precision integers (included) Task
84 First-class functions Task
84 Look-and-say sequence Task
84 Permutations Task
84 Range extraction Task
84 Reverse words in a string Task
84 Walk a directory/Non-recursively Task
83 Cumulative standard deviation Task
83 Sort using a custom comparator Task
82 Bulls and cows Task
82 Inheritance/Single Task
82 Nth root Task
82 Range expansion Task
81 Five weekends Task
81 MD5 Task
81 Sorting algorithms/Gnome sort Task
81 String prepend Task
81 Sum multiples of 3 and 5 Task
81 Symmetric difference Task
81 Window creation Task
80 Create an HTML table Task
80 Evolutionary algorithm Task
80 Time a function Task
80 Y combinator Task
79 Forward difference Task
79 String append Task
79 Sum digits of an integer Task
78 Averages/Simple moving average Task
78 Call a function Task
78 File modification time Task
78 Monty Hall problem Task
78 Price fraction Task
77 Abstract type Task
77 Dragon curve Task
77 Greatest subsequential sum Task
77 Sierpinski carpet Task
77 Vector products Task
76 Babbage problem Task
76 Entropy Task
76 Hamming numbers Task
76 Langton's ant Task
76 Menu Task
76 Sorting algorithms/Cocktail sort Task
76 Spiral matrix Task
75 Averages/Mode Task
75 Hello world/Line printer Task
75 Map range Task
75 Sorting algorithms/Bogosort Task
75 Walk a directory/Recursively Task
74 Execute Brain**** Task
74 Harshad or Niven series Task
74 JSON Task
74 Non-decimal radices/Convert Task
74 Show the epoch Task
74 Simple windowed application Task
74 The Twelve Days of Christmas Task
74 Web scraping Task
73 Closures/Value capture Task
73 Digital root Task
73 Gray code Task
73 Monte Carlo methods Task
73 Set Task
73 Tree traversal Task
72 Introspection Task
72 Man or boy test Task
72 Queue/Usage Task
72 Read a specific line from a file Task
72 SEDOLs Task
71 CSV to HTML translation Task
71 Last Friday of each month Task
71 Literals/Floating point Task
71 Number reversal game Task
71 Singly-linked list/Traversal Task
71 Sort an array of composite structures Task
71 Terminal control/Ringing the terminal bell Task
70 Bitmap Task
70 CSV data manipulation Task
70 Count in factors Task
70 Keyboard input/Obtain a Y or N response Task
70 Sorting algorithms/Heapsort Task
70 URL decoding Task
69 Amicable pairs Task
69 Floyd's triangle Task
69 Linear congruential generator Task
69 Sockets Task
68 Abundant, deficient and perfect number classifications Task
68 Find the missing permutation Task
68 Josephus problem Task
68 Knapsack problem/0-1 Task
68 List comprehensions Task
68 Special characters Task
68 String comparison Task
68 Take notes on the command line Task
68 Top rank per group Task
68 XML/Input Task
67 Address of a variable Task
67 Catamorphism Task
67 Concurrent computing Task
67 Date manipulation Task
67 Find common directory path Task
67 Kaprekar numbers Task
67 Number names Task
67 Roots of unity Task
67 Sorting algorithms/Shell sort Task
67 Strip comments from a string Task
67 Terminal control/Clear the screen Task
66 Box the compass Task
66 Dynamic variable names Task
66 Non-decimal radices/Output Task
66 Playing cards Task
66 Singly-linked list/Element definition Task
66 Soundex Task
66 Stair-climbing puzzle Task
66 URL encoding Task
66 Unicode variable names Task
65 Bitmap/Bresenham's line algorithm Task
65 Equilibrium index Task
65 Longest common subsequence Task
65 Lucas-Lehmer test Task
65 Order two numerical lists Task
65 Polymorphism Task
64 Empty directory Task
64 Find the last Sunday of each month Task
64 Flow-control structures Task
64 Sorting algorithms/Counting sort Task
64 Write float arrays to a text file Task
63 Anagrams/Deranged anagrams Task
63 Averages/Mean angle Task
63 Forest fire Task
63 Hello world/Web server Task
63 Here document Task
63 Multifactorial Task
63 Multiple distinct objects Task
63 N'th Task
63 Parsing/RPN calculator algorithm Task
63 Read a configuration file Task
63 Semordnilap Task
63 Sorting algorithms/Comb sort Task
63 Word wrap Task
62 Compare a list of strings Task
62 Constrained random points on a circle Task
62 Convert seconds to compound duration Task
62 Count the coins Task
62 Enforced immutability Task
62 Euler method Task
62 Exceptions/Catch an exception thrown in a nested call Task
62 Fibonacci n-step number sequences Task
62 Guess the number/With feedback (player) Task
62 Hofstadter Q sequence Task
62 Jensen's Device Task
62 Largest int from concatenated ints Task
62 Pythagorean triples Task
62 Sorting algorithms/Stooge sort Task
62 Vigenère cipher Task
61 Animation Task
61 Call an object method Task
61 Draw a sphere Task
61 Hello world/Newbie Task
61 Long multiplication Task
61 Sort disjoint sublist Task
61 Sudoku Task
61 Trabb Pardo–Knuth algorithm Task
60 Execute HQ9+ Task
60 Numerical integration Task
60 Operator precedence Task
60 Probabilistic choice Task
60 Singly-linked list/Element insertion Task
60 Sort stability Task
60 Strip control codes and extended characters from a string Task
59 Fork Task
59 Four bit adder Task
59 Gamma function Task
59 Named parameters Task
59 Runtime evaluation Task
59 Undefined values Task
59 Write language name in 3D ASCII Task
58 Benford's law Task
58 Call a foreign-language function Task
58 One of n lines in a file Task
58 Remove lines from a file Task
58 Roots of a quadratic function Task
58 Text processing/Max licenses in use Task
58 Variable size/Get Task
57 Arithmetic/Rational Task
57 Closest-pair problem Task
57 Combinations with repetitions Task
57 Fractal tree Task
57 IBAN Task
57 Optional parameters Task
57 Phrase reversals Task
57 Pi Task
57 Priority queue Task
57 Proper divisors Draft
57 Quaternion type Task
57 Rock-paper-scissors Task
57 Roots of a function Task
57 Runge-Kutta method Task
56 Almost prime Task
56 Catalan numbers/Pascal's triangle Task
56 HTTPS Task
56 Hofstadter-Conway $10,000 sequence Task
56 Horizontal sundial calculations Task
56 Host introspection Task
56 Magic squares of odd order Task
56 Memory allocation Task
56 SHA-1 Task
56 Self-describing numbers Task
56 Van der Corput sequence Task
56 Zeckendorf number representation Task
55 AKS test for primes Task
55 CRC-32 Task
55 Cholesky decomposition Task
55 Currying Task
55 Extend your language Task
55 Fast Fourier transform Task
55 Knapsack problem/Unbounded Task
55 Modular inverse Task
55 Narcissistic decimal number Task
55 Sorting algorithms/Pancake sort Task
55 Sorting algorithms/Sleep sort Task
55 Special variables Task
55 XML/Output Task
54 24 game/Solve Task
54 Documentation Task
54 Jump anywhere Task
54 Maze generation Task
54 Non-decimal radices/Input Task
54 Partial function application Task
54 SHA-256 Task
53 Animate a pendulum Task
53 Binary strings Task
53 Calendar Task
53 Factors of a Mersenne number Task
53 Globally replace text in several files Task
53 Huffman coding Task
53 Inheritance/Multiple Task
53 Old lady swallowed a fly Task
53 Pernicious numbers Task
53 Reduced row echelon form Task
53 Stem-and-leaf plot Task
53 Test a function Task
53 Yin and yang Task
52 Best shuffle Task
52 Extreme floating point values Task
52 Fibonacci word Task
52 Odd word problem Task
52 Scope modifiers Task
52 Sorting algorithms/Bead sort Task
52 Synchronous concurrency Task
52 Write entire file Task
52 XML/XPath Task
51 Arithmetic evaluation Task
51 Dinesman's multiple-dwelling problem Task
51 Hash join Task
51 Knapsack problem/Continuous Task
51 Rep-string Task
51 Repeat Draft
51 Rosetta Code/Count examples Task
51 Sequence of primes by trial division Task
51 Singleton Task
50 Add a variable to a class instance at runtime Task
50 Brownian tree Task
50 Compile-time calculation Task
50 Continued fraction Task
50 Draw a clock Task
50 Miller–Rabin primality test Task
50 Runtime evaluation/In an environment Task
50 Semiprime Task
50 Sorting algorithms/Permutation sort Task
50 Stack traces Task
50 Truncate a file Task
50 Unbias a random generator Task
50 Unix/ls Task
49 Averages/Mean time of day Task
49 Deal cards for FreeCell Task
49 Euler's sum of powers conjecture Task
49 Knight's tour Task
49 LZW compression Task
49 Morse code Task
49 Plot coordinate pairs Task
49 Tic-tac-toe Task
49 Topological sort Task
48 Circles of given radius through two points Task
48 Generator/Exponential Task
48 I before E except after C Task
48 Modular exponentiation Task
48 Modulinos Draft
48 Pointers and references Task
48 Terminal control/Display an extended character Task
48 Unicode strings Task
47 Bitmap/Write a PPM file Task
47 Doubly-linked list/Element definition Task
47 Dutch national flag problem Task
47 Integer overflow Task
47 Left factorials Task
47 Mouse position Task
47 Multisplit Task
47 Non-continuous subsequences Task
47 Rosetta Code/Rank languages by popularity Task
47 Send email Task
47 Split a character string based on change of character Task
47 Statistics/Basic Task
47 Wireworld Task
46 Grayscale image Task
46 Nested function Task
46 Text processing/1 Task
46 Text processing/2 Task
46 Truncatable primes Task
46 User input/Graphical Task
45 Define a primitive data type Task
45 Draw a cuboid Task
45 First-class functions/Use numbers analogously Task
45 Handle a signal Task
45 JortSort Task
45 Ludic numbers Task
45 Maximum triangle path sum Task
45 Munchausen numbers Task
45 Random number generator (device) Task
45 Respond to an unknown method call Task
45 Seven-sided dice from five-sided dice Task
45 Stable marriage problem Task
45 Thue-Morse Task
45 XML/DOM serialization Task
44 Chinese remainder theorem Task
44 Delegates Task
44 General FizzBuzz Task
44 Heronian triangles Task
44 Matrix-exponentiation operator Task
44 Population count Task
44 Sierpinski triangle/Graphical Task
44 Table creation/Postal addresses Task
44 Ternary logic Task
43 Bernoulli numbers Task
43 Call a function in a shared library Task
43 Discordian date Task
43 Keyboard input/Keypress check Task
43 Longest increasing subsequence Task
43 Munching squares Task
43 Quickselect algorithm Task
43 Terminal control/Cursor positioning Task
42 15 Puzzle Game Task
42 9 billion names of God the integer Task
42 Emirp primes Task
42 Mad Libs Task
42 Polymorphic copy Task
42 Send an unknown method call Task
41 Color of a screen pixel Task
41 Colour bars/Display Task
41 Convert decimal number to rational Task
41 Dining philosophers Task
41 Doubly-linked list/Element insertion Task
41 Execute a Markov algorithm Task
41 Exponentiation order Task
41 Hofstadter Figure-Figure sequences Task
41 Holidays related to Easter Task
41 Inverted syntax Task
41 Iterated digits squaring Task
41 Longest string challenge Task
41 Make directory path Task
41 Rate counter Task
41 Strip block comments Task
41 Two Sum Draft
41 Universal Turing machine Task
40 Doubly-linked list/Traversal Task
40 Echo server Task
40 Last letter-first letter Task
40 Move-to-front algorithm Task
40 Parsing/Shunting-yard algorithm Task
40 Verify distribution uniformity/Naive Task
39 Archimedean spiral Task
39 Barnsley fern Task
39 Bitmap/Flood fill Task
39 Bitmap/Read a PPM file Task
39 Extract file extension Draft
39 GUI component interaction Task
39 Get system command output Task
39 Greyscale bars/Display Task
39 Polynomial regression Task
39 Search a list of records Task
39 Zebra puzzle Task
38 Atomic updates Task
38 DNS query Task
38 Determine if only one instance is running Task
38 Digital root/Multiplicative digital root Task
38 FASTA format Task
38 History variables Task
38 OpenGL Task
38 Polynomial long division Task
38 Problem of Apollonius Task
38 Secure temporary file Task
38 Set consolidation Task
38 Sorting algorithms/Strand sort Task
38 Sparkline in unicode Task
37 Fractran Task
37 Image noise Task
37 Parametric polymorphism Task
37 Perfect shuffle Task
37 Pig the dice game Task
37 Subtractive generator Task
37 Terminal control/Inverse video Task
37 Variable size/Set Task
36 Active object Task
36 Department Numbers Task
36 Dijkstra's algorithm Draft
36 Doubly-linked list/Definition Task
36 Generate Chess960 starting position Task
36 Inverted index Task
36 MD5/Implementation Task
36 Metaprogramming Task
36 Narcissist Task
36 Pascal matrix generation Task
36 Permutations by swapping Task
36 Stern-Brocot sequence Task
36 Terminal control/Coloured text Task
36 Terminal control/Dimensions Task
36 Twelve statements Task
35 Append a record to the end of a text file Task
35 Base64 encode data Draft
35 Bitmap/Midpoint circle algorithm Task
35 Bulls and cows/Player Task
35 Farey sequence Task
35 Knapsack problem/Bounded Task
35 Kronecker product Task
35 Leonardo numbers Task
35 Matrix arithmetic Task
35 Percentage difference between images Task
35 Permutations/Derangements Task
35 Ray-casting algorithm Task
35 Smith numbers Task
35 Subleq Task
35 Sum to 100 Task
35 Validate International Securities Identification Number Task
35 Variable-length quantity Task
35 Visualize a tree Task
34 Average loop length Task
34 Balanced ternary Task
34 Calendar - for "REAL" programmers Task
34 Chaos game Task
34 Element-wise operations Task
34 GUI enabling/disabling of controls Task
34 Hickerson series of almost integers Task
34 Jaro distance Task
34 Keyboard input/Flush the keyboard buffer Task
34 Longest common prefix Draft
34 Parallel calculations Task
34 Self-referential sequence Task
34 Statistics/Normal distribution Task
34 Tokenize a string with escaping Task
33 Amb Task
33 Carmichael 3 strong pseudoprimes Task
33 Combinations and permutations Task
33 Constrained genericity Task
33 Gaussian elimination Task
33 Naming conventions Task
33 Parsing/RPN to infix conversion Task
33 Password generator Task
33 Sorting algorithms/Radix sort Task
33 Start from a main routine Task
33 Topswops Task
33 Ulam spiral (for primes) Task
32 2048 Task
32 4-rings or 4-squares puzzle Task
32 Aliquot sequence classifications Task
32 Knuth's algorithm S Task
32 Multiline shebang Draft
32 Order disjoint list items Task
32 Pascal's triangle/Puzzle Task
32 S-Expressions Task
32 Sort three variables Task
32 Test integerness Task
32 Vampire number Task
31 Break OO privacy Task
31 CUSIP Task
31 Deepcopy Task
31 Events Task
31 Extensible prime generator Task
31 MD4 Task
31 Metered concurrency Task
31 Permutation test Task
31 Taxicab numbers Task
31 Vector Draft
31 Voronoi diagram Task
30 Bitmap/Bézier curves/Cubic Task
30 Cartesian product of two or more lists Task
30 Casting out nines Task
30 Fibonacci word/fractal Task
30 Function prototype Task
30 GUI/Maximum window dimensions Task
30 LU decomposition Task
30 Numerical integration/Gauss-Legendre Quadrature Task
30 Ordered Partitions Task
30 Permutations with repetitions Draft
30 Scope/Function names and labels Task
30 Speech synthesis Task
29 Bitmap/Histogram Task
29 Conjugate transpose Task
29 Input/Output for Pairs of Numbers Draft
29 Julia set Task
29 Maze solving Task
29 Terminal control/Hiding the cursor Task
28 Bitmap/Bézier curves/Quadratic Task
28 Bitwise IO Task
28 Elementary cellular automaton Task
28 Executable library Task
28 Find the intersection of two lines Task
28 Flipping bits game Task
28 Minesweeper game Task
28 Object serialization Task
28 Parse command-line arguments Draft
28 Primorial numbers Task
28 Simple database Task
28 Sutherland-Hodgman polygon clipping Task
28 Terminal control/Unicode output Task
28 Topic variable Task
28 Water collected between towers Task
27 Bitcoin/address validation Task
27 Colour pinstripe/Display Task
27 File extension is in extensions list Draft
27 Input/Output for Lines of Text Draft
27 Multiple regression Task
27 Penney's game Task
27 Pinstripe/Display Task
27 Sattolo cycle Draft
26 Memory layout of a data structure Task
26 Numeric error propagation Task
26 Pathological floating point problems Task
26 RSA code Task
26 Ranking methods Task
26 Sailors, coconuts and a monkey problem Task
26 Set puzzle Task
26 Sorting Algorithms/Circle Sort Draft
26 Zhang-Suen thinning algorithm Task
25 Arena storage pool Task
25 Check output device is a terminal Draft
25 Continued fraction/Arithmetic/Construct from rational number Task
25 Entropy/Narcissist Task
25 Execute SNUSP Task
25 First class environments Task
25 Floyd-Warshall algorithm Task
25 Formal power series Task
25 Longest Common Substring Draft
25 Magic squares of doubly even order Task
25 Multiplicative order Task
25 Parametrized SQL statement Task
25 QR decomposition Task
25 RIPEMD-160 Task
25 Read a file character by character/UTF8 Draft
25 Same Fringe Task
25 Solve a Hidato puzzle Task
25 State name puzzle Task
25 Straddling checkerboard Task
25 Subset sum problem Draft
25 Textonyms Task
25 Update a configuration file Task
25 Use another language to call a function Task
25 Xiaolin Wu's line algorithm Task
24 Brace expansion Task
24 Chinese zodiac Task
24 Deconvolution/1D Task
24 Distributed programming Task
24 Egyptian division Task
24 Find palindromic numbers in both binary and ternary bases Task
24 Keyboard macros Task
24 Metronome Task
24 Musical scale Draft
24 Pragmatic directives Task
24 Resistor mesh Task
24 Rosetta Code/Find bare lang tags Task
24 Rosetta Code/Fix code tags Task
24 Sorting algorithms/Cycle sort Draft
23 Arithmetic-geometric mean/Calculate Pi Task
23 Cramer's rule Task
23 Death Star Task
23 Find first and last set bit of a long integer Draft
23 Lychrel numbers Task
23 Natural sorting Task
23 Paraffins Task
23 Pattern matching Task
23 Pythagoras tree Task
23 Solve the no connection puzzle Task
23 Sort a list of object identifiers Task
23 Sorting algorithms/Patience sort Draft
23 Truth table Task
23 Window creation/X11 Task
22 Active Directory/Connect Task
22 Angle difference between two bearings Task
22 Check Machin-like formulas Task
22 Create a file on magnetic tape Task
22 FTP Task
22 Galton box animation Task
22 Go Fish Task
22 Prime conspiracy Draft
22 Rosetta Code/Find unimplemented tasks Task
22 Terminal control/Cursor movement Task
22 Text between Draft
22 Word count Draft
22 Write to Windows event log Task
21 Check input device is a terminal Draft
21 Checkpoint synchronization Task
21 Currency Draft
21 Find largest left truncatable prime in a given base Task
21 Honeycombs Task
21 Implicit type conversion Draft
21 Nautical bell Task
21 Sum and Product Puzzle Task
21 Table creation Draft
21 Terminal control/Preserve screen Task
21 The ISAAC Cipher Task
21 URL parser Task
21 UTF-8 encode and decode Task
21 Verify distribution uniformity/Chi-squared test Task
21 Welch's t-test Draft
20 Birthday problem Draft
20 Chat server Task
20 Cycle detection Draft
20 Decimal floating point number to binary Draft
20 Function frequency Task
20 Image convolution Task
20 MAC Vendor Lookup Task
20 Multi-dimensional array Draft
20 Partition an integer X into N primes Task
20 Pentagram Task
20 Percolation/Mean run density Task
20 Permutations/Rank of a permutation Task
20 Play recorded sounds Task
20 RCRPG Task
20 Ramsey's theorem Draft
20 Safe addition Task
20 Set of real numbers Task
20 Shoelace formula for polygonal area Task
20 Simulate input/Keyboard Task
20 Solve a Holy Knight's tour Task
20 Substitution Cipher Draft
19 Cut a rectangle Task
19 Damm algorithm Draft
19 Decision tables Draft
19 Elliptic curve arithmetic Draft
19 HTTPS/Authenticated Task
19 Idiomatically determine all the lowercase and uppercase letters Draft
19 Main step of GOST 28147-89 Task
19 Old Russian measure of length Draft
19 Record sound Task
19 Superellipse Task
19 Thiele's interpolation formula Task
19 Total circles area Task
19 Window management Task
19 Yahoo! search interface Task
18 AVL tree Task
18 Create an object at a given address Task
18 Dice game probabilities Draft
18 Egyptian fractions Task
18 Hough transform Task
18 K-means++ clustering Task
18 Make a backup file Draft
18 Parse an IP Address Task
18 Poker hand analyser Task
18 Reflection/List methods Draft
18 Stream Merge Task
17 Display a linear combination Draft
17 Draw a rotating cube Task
17 Integer roots Draft
17 Modular arithmetic Draft
17 Parallel Brute Force Task
17 Pig the dice game/Player Task
17 Plasma effect Task
17 Playfair cipher Draft
17 Polyspiral Task
17 Reflection/List properties Task
17 SOAP Task
17 Sequence of primorial primes Draft
17 Sokoban Task
16 Elementary cellular automaton/Random Number Generator Draft
16 Idiomatically determine all the characters that can be used for symbols Draft
16 Kahan summation Draft
16 Kronecker product based fractals Task
16 Linux CPU utilization Draft
16 Median filter Task
16 Perlin noise Draft
16 Pythagorean quadruples Task
16 Simulate input/Mouse Task
15 Active Directory/Search for a user Task
15 Bacon cipher Draft
15 Card shuffles Draft
15 Compiler/lexical analyzer Task
15 Levenshtein distance/Alignment Draft
15 Machine code Task
15 Solve a Numbrix puzzle Task
14 Assertions in design by contract Draft
14 AudioAlarm Draft
14 Chebyshev coefficients Draft
14 Deming's Funnel Draft
14 Elementary cellular automaton/Infinite length Draft
14 Faulhaber's formula Draft
14 Index finite lists of positive integers Draft
14 K-d tree Task
14 Magic squares of singly even order Task
14 Names to numbers Draft
14 Native shebang Draft
14 Negative base numbers Task
14 Reverse the gender of a string Draft
14 Selective File Copy Draft
14 Solve a Hopido puzzle Task
14 Tonelli-Shanks algorithm Draft
14 Vigenère cipher/Cryptanalysis Task
14 World Cup group stage Task
13 A* search algorithm Draft
13 Apply a digital filter (direct form II transposed) Task
13 Bitcoin/public point to address Task
13 Cipolla's algorithm Draft
13 Color quantization Task
13 Create an object/Native demonstration Draft
13 Fivenum Draft
13 Nonoblock Task
13 Percolation/Site percolation Task
13 Rendezvous Task
13 SQL-based authentication Task
13 Sierpinski pentagon Task
13 Superpermutation minimisation Draft
13 Terminal control/Positional read Task
13 Type detection Draft
13 Video display modes Task
12 Bitmap/Read an image through a pipe Task
12 Convex hull Draft
12 Diversity prediction theorem Draft
12 I.Q. Puzzle Draft
12 Joystick position Task
12 Lucky and even lucky numbers Task
12 Most frequent k chars distance Draft
12 Percolation/Bond percolation Task
12 Percolation/Mean cluster density Task
12 Reflection/Get source Task
12 Retrieve and search chat history Task
12 Untrusted environment Draft
12 Word break problem Draft
11 Arithmetic coding/As a generalized change of radix Draft
11 Bilinear interpolation Draft
11 Compare sorting algorithms' performance Task
11 Faulhaber's triangle Draft
11 Find URI in text Draft
11 Find the intersection of a line with a plane Task
11 Knuth's power tree Draft
11 List rooted trees Draft
11 Monads/Maybe monad Draft
11 N-body problem Draft
11 NYSIIS Draft
11 Polynomial synthetic division Draft
11 Proof Draft
11 Ramer-Douglas-Peucker line simplification Task
11 Separate the house number from the street name Draft
11 Shortest common supersequence Draft
11 Vogel's approximation method Task
10 Aspect Oriented Programming Draft
10 Commatizing numbers Task
10 Compiler/code generator Task
10 Compiler/virtual machine interpreter Task
10 Determine if two triangles overlap Draft
10 Find duplicate files Draft
10 Generate random chess position Draft
10 HTTPS/Client-authenticated Task
10 Markov chain text generator Draft
10 Mersenne primes Draft
10 Monads/List monad Draft
10 Nonogram solver Task
10 P-value correction Draft
10 Primes - allocate descendants to their ancestors Task
10 Readline interface Draft
10 Snake Draft
10 Topological sort/Extracted top item Draft
10 Zeckendorf arithmetic Task
9 Abbreviations, automatic Draft
9 Base58Check encoding Draft
9 Bitmap/PPM conversion through a pipe Task
9 Code segment unload Draft
9 Color wheel Draft
9 Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N) Draft
9 Eertree Task
9 File size distribution Draft
9 Four is magic Draft
9 Free polyominoes enumeration Draft
9 Suffix tree Draft
9 Transportation problem Draft
9 VList Draft
9 Word search Task
9 XML Validation Draft
8 Compiler/AST interpreter Task
8 Compiler/syntax analyzer Task
8 Finite state machine Draft
8 Hunt The Wumpus Task
8 Kosaraju Draft
8 Largest number divisible by its digits Draft
8 Loops/Increment loop index within loop body Draft
8 Montgomery reduction Draft
8 Perceptron Draft
8 Self-hosting compiler Draft
7 Abbreviations, easy Draft
7 Canny edge detector Task
7 Deconvolution/2D+ Task
7 Generalised floating point addition Draft
7 IPC via named pipe Draft
7 Mastermind Draft
7 Monads/Writer monad Draft
7 Orbital elements Draft
7 Particle Swarm Optimization Draft
7 Run as a daemon or service Draft
7 Singly-linked list/Element removal Draft
7 The Name Game Task
7 Time-based One-time Password Algorithm Draft
7 User defined pipe and redirection operators Draft
6 Addition chains Draft
6 Banker's algorithm Draft
6 Catmull–Clark subdivision surface Task
6 French Republican calendar Draft
6 Just in time processing on a character stream Draft
6 Morpion solitaire Draft
6 Parse EBNF Draft
5 ASCII art diagram converter Draft
5 Abbreviations, simple Draft
5 Audio frequency generator Draft
5 Combinations with repetitions/Square Digit Chain Draft
5 Imaginary base numbers Draft
5 OpenGL Pixel Shader Draft
5 Pinstripe/Printer Task
5 Sorting algorithms/Tree sort on a linked list Draft
5 Spelling of ordinal numbers Draft
5 Starting a web browser Draft
4 15 puzzle solver Task
4 Addition-chain exponentiation Draft
4 Colour pinstripe/Printer Task
4 Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2) Draft
4 Data Encryption Standard Draft
4 Fibonacci heap Draft
4 Four is the number of letters in the ... Draft
4 Functional coverage tree Draft
4 Gauss-Jordan matrix inversion Draft
4 Geometric algebra Draft
4 Greed Draft
4 One-time pad Draft
4 Pentomino tiling Draft
4 Railway circuit Draft
4 Remote agent/Agent interface Draft
4 Remote agent/Agent logic Draft
4 Remote agent/Simulation Draft
4 Rosetta Code/Run examples Draft
4 Snake And Ladder Draft
4 Tarjan Draft
4 Tetris Draft
4 Using a Speech engine to highlight words Draft
4 Using the Meetup.com API Draft
3 Boids Draft
3 Hexapawn Draft
3 OpenGL/Utah Teapot Draft
3 Robots Draft
3 Rosetta Code/Rank languages by number of users Draft
3 Rosetta Code/Tasks without examples Draft
3 Simulated annealing Draft
3 Text to HTML Draft
2 Audio Overlap Loop Draft
2 Chess player Draft
2 External sort Draft
2 OLE Automation Task
2 OpenWebNet Password Draft
2 Penrose tiling Draft
2 Recursive descent parser generator Draft
2 Solve a Rubik's Cube Draft
2 Tamagotchi emulator Draft
1 Black Box Draft
1 Generalised floating point multiplication Draft
1 IRC gateway Draft
1 Multidimensional Newton-Raphson metod Draft
1 Process SMIL directives in XML data Draft
1 Rosetta Code/List authors of task descriptions Draft
1 Solving coin problems Draft
1 Terminal control/Restricted width positional input/No wrapping Draft
1 Terminal control/Restricted width positional input/With wrapping Draft
0 Blackjack strategy Draft
0 Chess player/Move generation Draft
0 Chess player/Program options and user interface Draft
0 Chess player/Search and evaluation Draft
0 Rosetta Code/Tasks sorted by average lines of code Draft
0 Ukkonen’s Suffix Tree Construction Draft
0 Unicode polynomial equation Draft
0 Waveform analysis/Doh ray me Draft
0 Waveform analysis/Top and tail Draft
0 Weather Routing Draft

PicoLisp

<lang PicoLisp>(load "@lib/http.l")

(client "rosettacode.org" 80

  "mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml"
  (while (from " title=\"")
     (let Task (till "\"")
        (client "rosettacode.org" 80 (pack "wiki/" (replace Task " " "_"))
           (let Cnt 0
              (while (from "")
                 (unless (sub? "." (till "<" T))
                    (inc 'Cnt) ) )
              (out NIL (prinl (ht:Pack Task) ": " Cnt)) ) ) ) ) )</lang>

Output (05may10):

100 doors: 79
24 game: 21
24 game/Solve: 15
99 Bottles of Beer: 95
A+B: 37
Abstract type: 29
...


PureBasic

<lang PureBasic>Procedure handleError(value, msg.s)

 If value = 0
   MessageRequester("Error", msg)
   End
 EndIf

EndProcedure

handleError(InitNetwork(), "Unable to initialize network functions.") If OpenConsole()

 Define url$, x1$, y1$, title$, unescapedTitle$, encodedURL$
 Define x2, i, j, totalExamples, totalTasks
 url$ = "http://www.rosettacode.org/mw/api.php?action=query" + 
        "&list=categorymembers&cmtitle=Category:Programming_Tasks" + 
        "&cmlimit=500&format=xml"
 
 Repeat
   handleError(ReceiveHTTPFile(url$, "tasks.xml"), "Unable to access tasks URL.")
   
   handleError(ReadFile(0, "tasks.xml"), "Unable to read 'task.xml' file.")
   x1$ =  ReadString(0)
   CloseFile(0)
   
   Repeat
     x2 = FindString(x1$, "title=", x2 + 1)
     If x2 
       title$ = Mid(x1$, x2 + 7, 99) 
       title$ = Left(title$, FindString(title$, ">", 1) - 4)
       unescapedTitle$ = UnescapeString(ReplaceString(title$, "'", "'"), #PB_String_EscapeXML)
       encodedURL$ = URLEncoder("http://www.rosettacode.org/mw/index.php?title=" + unescapedTitle$ + "&action=raw")
       If ReceiveHTTPFile(encodedURL$, "task.xml")
         ReadFile(0, "task.xml") 
         While Not Eof(0)
           y1$ =  ReadString(0)
           If FindString(y1$, "=={{header|", 1, #PB_String_NoCase)
             totalExamples + 1
           EndIf
         Wend
         CloseFile(0) 
         
         PrintN(unescapedTitle$ +": " + Str(totalExamples) + " examples")
         
         totalTasks + totalExamples
         totalExamples = 0
       EndIf
     EndIf  
   Until x2 = 0
   
   ;check for additional pages of tasks
   x2 = FindString(x1$, "cmcontinue=")
   If x2
     i = FindString(x1$, #DQUOTE$, x2 + 1)
     j = FindString(x1$, #DQUOTE$, i + 1)
     url$ = URLEncoder("http://www.rosettacode.org/mw/api.php?action=query" + 
                       "&list=categorymembers&cmtitle=Category:Programming_Tasks" + 
                       "&cmlimit=500&format=xml&cmcontinue=" + Mid(x1$, i + 1, j - i))
   Else
     Break ;all done
   EndIf
 ForEver
 
 PrintN("Total: " + Str(totalTasks) + " examples")
 Input()
 CloseConsole()

EndIf</lang> Sample output:

100 doors: 224 examples
24 game: 78 examples
24 game/Solve: 46 examples
9 billion names of God the integer: 33 examples
99 Bottles of Beer: 253 examples
A+B: 187 examples
......
Zeckendorf arithmetic: 6 examples
Zeckendorf number representation: 37 examples
Zero to the zero power: 71 examples
Zhang-Suen thinning algorithm: 18 examples
Zig-zag matrix: 83 examples
Total: 44140 examples

Python

<lang python>import urllib, xml.dom.minidom

x = urllib.urlopen("http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml")

tasks = [] for i in xml.dom.minidom.parseString(x.read()).getElementsByTagName("cm"):

   t = i.getAttribute('title').replace(" ", "_")
   y = urllib.urlopen("http://www.rosettacode.org/w/index.php?title=%s&action=raw" % t.encode('utf-8'))
   tasks.append( y.read().lower().count("{{header|") )
   print t.replace("_", " ") + ": %d examples." % tasks[-1]

print "\nTotal: %d examples." % sum(tasks)</lang>

R

Library: XML (R)
Library: RCurl

<lang R> library(XML) library(RCurl) doc <- xmlInternalTreeParse("http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml") nodes <- getNodeSet(doc,"//cm") titles = as.character( sapply(nodes, xmlGetAttr, "title") ) headers <- list() counts <- list() for (i in 1:length(titles)){ headersi <- getURL( paste("http://rosettacode.org/mw/index.php?title=", gsub(" ", "_", titles[i]), "&action=raw", sep="") ) countsi <- strsplit(headersi,split=" ")1 countsi <- grep("\\{\\{header", countsi) cat(titles[i], ":", length(countsi), "examples\n") } cat("Total: ", length(unlist(counts)), "examples\n") </lang>

Racket

<lang racket>

  1. lang racket

(require net/url net/uri-codec json (only-in racket/dict [dict-ref ref]))

(define (RC-get verb params)

 ((compose1 get-pure-port string->url format)
  "http://rosettacode.org/mw/~a.php?~a" verb (alist->form-urlencoded params)))

(define (get-category catname)

 (let loop ([c #f])
   (define t
     ((compose1 read-json RC-get) 'api
      `([action . "query"] [format . "json"]
        [list . "categorymembers"] [cmtitle . ,(format "Category:~a" catname)]
        [cmcontinue . ,(and c (ref c 'cmcontinue))] [cmlimit . "500"])))
   (define (c-m key) (ref (ref t key '()) 'categorymembers #f))
   (append (for/list ([page (c-m 'query)]) (ref page 'title))
           (cond [(c-m 'query-continue) => loop] [else '()]))))

(printf "Total: ~a\n"

 (for/sum ([task (get-category 'Programming_Tasks)])
   (define s ((compose1 length regexp-match-positions*)
              #rx"=={{" (RC-get 'index `([action . "raw"] [title . ,task]))))
   (printf "~a: ~a\n" task s)
   s))

</lang>

Ruby

Library: REXML

First, a RosettaCode module, saved as rosettacode.rb: <lang ruby>require 'open-uri' require 'rexml/document'

module RosettaCode

 URL_ROOT = "http://rosettacode.org/mw"
 def self.get_url(page, query)
   begin
     # Ruby 1.9.2
     pstr = URI.encode_www_form_component(page)
     qstr = URI.encode_www_form(query)
   rescue NoMethodError
     require 'cgi'
     pstr = CGI.escape(page)
     qstr = query.map {|k,v|
       "%s=%s" % [CGI.escape(k.to_s), CGI.escape(v.to_s)]}.join("&")
   end
   url = "#{URL_ROOT}/#{pstr}?#{qstr}"
   p url if $DEBUG
   url
 end
 def self.get_api_url(query)
   get_url "api.php", query
 end
 def self.category_members(category)
   query = {
     "action" => "query",
     "list" => "categorymembers",
     "cmtitle" => "Category:#{category}",
     "format" => "xml",
     "cmlimit" => 500,
   }
   while true
     url = get_api_url query
     doc = REXML::Document.new open(url)
     REXML::XPath.each(doc, "//cm") do |task|
       yield task.attribute("title").value
     end
     continue = REXML::XPath.first(doc, "//query-continue")
     break if continue.nil?
     cm = REXML::XPath.first(continue, "categorymembers")
     query["cmcontinue"] = cm.attribute("cmcontinue").value
   end
 end

end</lang>

Then, we implement the task with: <lang ruby>require 'rosettacode'

total_examples = 0

RosettaCode.category_members("Programming_Tasks") do |task|

 url = RosettaCode.get_url("index.php", {"action" => "raw", "title" => task})
 examples = open(url).read.scan("=={{header").length
 puts "#{task}: #{examples}"
 total_examples += examples

end

puts puts "Total: #{total_examples}"</lang>

Rust

<lang rust>extern crate reqwest; extern crate url; extern crate rustc_serialize;

use std::io::Read; use self::url::Url; use rustc_serialize::json::{self, Json};

pub struct Task {

   page_id: u64,
   pub title: String,

}

  1. [derive(Debug)]

enum ParseError {

   /// Something went wrong with the HTTP request to the API.
   Http(reqwest::Error),
   /// There was a problem parsing the API response into JSON.
   Json(json::ParserError),
   /// Unexpected JSON format from response
   UnexpectedFormat,

} impl From<json::ParserError> for ParseError {

   fn from(error: json::ParserError) -> Self {
       ParseError::Json(error)
   }

}

impl From<reqwest::Error> for ParseError {

   fn from(error: reqwest::Error) -> Self {
       ParseError::Http(error)
   }

}


fn construct_query_category(category: &str) -> Url {

   let mut base_url = Url::parse("http://rosettacode.org/mw/api.php").unwrap();
   let cat = format!("Category:{}", category);
   let query_pairs = vec![("action", "query"),
                          ("format", "json"),
                          ("list", "categorymembers"),
                          ("cmlimit", "500"),
                          ("cmtitle", &cat),
                          ("continue", "")];
   base_url.query_pairs_mut().extend_pairs(query_pairs.into_iter());
   base_url

}

fn construct_query_task_content(task_id: &str) -> Url {

   let mut base_url = Url::parse("http://rosettacode.org/mw/api.php").unwrap();
   let mut query_pairs =
       vec![("action", "query"), ("format", "json"), ("prop", "revisions"), ("rvprop", "content")];
   query_pairs.push(("pageids", task_id));
   base_url.query_pairs_mut().extend_pairs(query_pairs.into_iter());
   base_url

}

fn query_api(url: Url) -> Result<Json, ParseError> {

   let mut response = try!(reqwest::get(url.as_str()));
   // Build JSON
   let mut body = String::new();
   response.read_to_string(&mut body).unwrap();
   Ok(try!(Json::from_str(&body)))

}

fn parse_all_tasks(reply: &Json) -> Result<Vec<Task>, ParseError> {

   let json_to_task = |json: &Json| -> Result<Task, ParseError> {
       let page_id: u64 = try!(json.find("pageid")
           .and_then(|id| id.as_u64())
           .ok_or(ParseError::UnexpectedFormat));
       let title: &str = try!(json.find("title")
           .and_then(|title| title.as_string())
           .ok_or(ParseError::UnexpectedFormat));
       Ok(Task {
           page_id: page_id,
           title: title.to_owned(),
       })
   };
   let tasks_json = try!(reply.find_path(&["query", "categorymembers"])
       .and_then(|tasks| tasks.as_array())
       .ok_or(ParseError::UnexpectedFormat));
   // Convert into own type
   tasks_json.iter().map(json_to_task).collect()

} fn count_number_examples(task: &Json, task_id: u64) -> Result<u32, ParseError> {

   let revisions =
       try!(task.find_path(&["query", "pages", task_id.to_string().as_str(), "revisions"])
           .and_then(|content| content.as_array())
           .ok_or(ParseError::UnexpectedFormat));
   let content = try!(revisions[0]
       .find("*")
       .and_then(|content| content.as_string())
       .ok_or(ParseError::UnexpectedFormat));
   Ok(content.split("=={{header").count() as u32)

}

pub fn query_all_tasks() -> Vec<Task> {

   let query = construct_query_category("Programming_Tasks");
   let json: Json = query_api(query).unwrap();
   parse_all_tasks(&json).unwrap()

}

pub fn query_a_task(task: &Task) -> u32 {

   let query = construct_query_task_content(&task.page_id.to_string());
   let json: Json = query_api(query).unwrap();
   count_number_examples(&json, task.page_id).unwrap()

}</lang>

The function is then run using the following: <lang rust> extern crate count_examples; fn main() {

   let all_tasks = count_examples::query_all_tasks();
   for task in &all_tasks {
       let count = count_examples::query_a_task(task);
       println!("Task: {} has {} examples", task.title, count);
   }

}</lang>

Run BASIC

<lang runbasic>html "

"

a$ = httpGet$("http://rosettacode.org/wiki/Category:Programming_Tasks")

a$ = word$(a$,1,"
NumTaskExamples

")

i = instr(a$,"<a href=""/wiki/") i = instr(a$,"<a href=""/wiki/",i+1) while i > 0

 count	= count + 1
 i	= instr(a$,"<a href=""/wiki/",i+1)
 j	= instr(a$,">",i+5)
 a1$	= mid$(a$,i+15,j-i)
 taskId$ = word$(a1$,1,"""")
 task$   = word$(a1$,3,"""")
 url$	= "http://rosettacode.org/wiki/";taskId$
 a2$	= httpGet$(url$)
 ii	= instr(a2$,"")
 jj	= 0
 while ii > 0
   jj	= ii
   ii	= instr(a2$,"",ii+10)
 wend
 if jj = 0 then 
   examp = 0
  else
   kk	= instr(a2$,"<",jj+24)
   examp = int(val(mid$(a2$,jj+24,kk-jj-24)))
 end if

html "";count;"";task$;"";examp;""

 totExamp = totExamp + examp

wend

html "**** Total **";totExamp;""

end</lang>

NumTaskExamples
1100 doors165
224 game56
324 game/Solve34
499 Bottles of Beer192
5A+B129
6Abstract type51
7Accumulator factory65
8Ackermann function132
9Active Directory/Connect13
10Active Directory/Search for a user13
11Active object22
12Add a variable to a class instance at runtime37
.........
655Y combinator53
656Yahoo! search interface16
657Yin and yang38
658Zebra puzzle12
659Zeckendorf number representation18
660Zig-zag matrix65
**** Total **28611

Scala

Library: Scala

<lang Scala>import scala.language.postfixOps

object TaskCount extends App {

 import java.net.{ URL, URLEncoder }
 import scala.io.Source.fromURL
 System.setProperty("http.agent", "*")
 val allTasksURL =
   "http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml"
 val allTasks = xml.parsing.XhtmlParser(fromURL(new URL(allTasksURL)))
 val regexExpr = "(?i)==\\{\\{header\\|".r
 def oneTaskURL(title: String) = {
   println(s"Check $title")
   "http://www.rosettacode.org/w/index.php?title=%s&action=raw" format URLEncoder.encode(title.replace(' ', '_'), "UTF-8")
 }
 def count(title: String) = regexExpr findAllIn fromURL(new URL(oneTaskURL(title)))(io.Codec.UTF8).mkString length
 val counts = for (task <- allTasks \\ "cm" \\ "@title" map (_.text)) yield scala.actors.Futures.future((task, count(task)))
 counts map (_.apply) map Function.tupled("%s: %d examples." format (_, _)) foreach println
 println("\nTotal: %d examples." format (counts map (_.apply._2) sum))

}</lang>

Sidef

Translation of: Perl

<lang ruby>var lwp = require('LWP::UserAgent').new(agent => 'Mozilla/5.0');

var site = 'http://rosettacode.org'; var list_url = '/mw/api.php?action=query&list=categorymembers&'+

              'cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml';

var content = lwp.get(site + list_url).decoded_content;

while (var m = content.match(/cm.*?title="(.*?)"/g)) {

   (var slug = m[0]).gsub!(' ', '_');
   var count = lwp.get("#{site}/wiki/#{slug}").decoded_content.count(/toclevel-1/g);
   say "#{m[0]}: #{count} examples";

}</lang>

Output:
100 doors: 2180 examples
24 game: 760 examples
24 game/Solve: 450 examples
9 billion names of God the integer: 320 examples
99 Bottles of Beer: 2330 examples
A+B: 1800 examples
ABC Problem: 720 examples
Abstract type: 680 examples
...

Tcl

Library: Tcllib (Package: json)

<lang tcl>package require Tcl 8.5 package require http package require json

fconfigure stdout -buffering none

proc get_tasks {category} {

   set start [clock milliseconds]
   puts -nonewline "getting $category members..."
   set base_url http://www.rosettacode.org/w/api.php
   set query {action query list categorymembers cmtitle Category:%s format json cmlimit 500}
   set this_query [dict create {*}[split [format $query $category]]]
   set tasks [list]
   while {1} {
       set url [join [list $base_url [http::formatQuery {*}$this_query]] ?]
       set response [http::geturl $url]
       if {[set s [http::status $response]] ne "ok" || [http::ncode $response] != 200} {
           error "Oops: url=$url\nstatus=$s\nhttp code=[http::code $response]"
       }
       set data [json::json2dict [http::data $response]]
       http::cleanup $response
       
       # add tasks to list
       foreach task [dict get $data query categorymembers] {
           lappend tasks [dict get [dict create {*}$task] title]
       }
       
       if {[catch {dict get $data query-continue categorymembers cmcontinue} continue_task] != 0} {
           # no more continuations, we're done
           break
       }
       dict set this_query cmcontinue $continue_task
   }
   puts " found [llength $tasks] tasks in [expr {[clock milliseconds] - $start}] milliseconds"
   return $tasks

}

  1. This proc can be replaced by a single regexp command:
  2. set count [regexp -all "***=$needle" $haystack]
  3. However this proc is more efficient -- we're dealing with plain strings only.

proc count_substrings {needle haystack} {

   set count 0
   set idx 0
   while {[set idx [string first $needle $haystack $idx]] != -1} {
       incr count
       incr idx
   }
   return $count

}

set total 0 foreach task [get_tasks Programming_Tasks] {

   set url [format "http://www.rosettacode.org/w/index.php?title=%s&action=raw" [string map {{ } _} $task]]
   set response [http::geturl $url]
   if {[set s [http::status $response]] ne "ok" || [http::ncode $response] != 200} {
       error "Oops: url=$url\nstatus=$s\nhttp code=[http::code $response]"
   }
   set count [count_substrings "\{\{header|" [http::data $response]]
   puts [format "%3d examples in %s" $count $task]
   http::cleanup $response
   incr total $count

}

puts "\nTotal: $total examples"</lang>

TUSCRIPT

<lang tuscript>$$ MODE TUSCRIPT url="http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml" data=REQUEST (url)

BUILD S_TABLE beg=* DATA :title=": BUILD S_TABLE end=* DATA :":

titles=EXTRACT (data,beg|,end,1,0,"~~") titles=SPLIT (titles,":~~:") sz_titles=SIZE (titles)

BUILD R_TABLE header=":==\{\{header|:" all=*

ERROR/STOP CREATE ("tasks",seq-e,-std-)

COMPILE LOOP title=titles ask=* ask =SET_VALUE(ask,"title",title) ask =SET_VALUE(ask,"action","raw") ask =ENCODE (ask,cgi) http ="http://www.rosettacode.org/mw/index.php" url =CONCAT (http,"?",ask) data =REQUEST (url) header =FILTER_INDEX (data,header,-) sz_header=SIZE(header) line =CONCAT (title,"=",sz_header," members") FILE "tasks" = line all =APPEND(all,sz_header) ENDLOOP

ENDCOMPILE all =JOIN(all),sum=SUM(all),time=time() line=CONCAT (time,": ", sz_titles, " Programing Tasks: ", sum, " solutions")

FILE "tasks" = line </lang> Output in file "tasks":

100 doors=104 members
24 game=27 members
24 game/Solve=21 members
99 Bottles of Beer=124 members
A+B=76 members
Abstract type=35 members
Accumulator factory=44 members
...
XML/Input=39 members
XML/Output=32 members
XML/XPath=24 members
Xiaolin Wu's line algorithm=0 members
Y combinator=33 members
Yahoo! search interface=10 members
Zig-zag matrix=46 members
2011-01-15 03:41:30: 455 Programing Tasks: 16009 solutions 

zkl

Uses shared libraries YAJL and cURL and handles "continue" responses. <lang zkl>var [const] YAJL=Import("zklYAJL")[0], CURL=Import("zklCurl");

fcn getTasks(language){

  continueValue,tasks:="",Data(0,String);  // "nm\0nm\0...."
  do{
     page:=CURL().get(("http://rosettacode.org/mw/api.php?"
        "action=query&cmlimit=500"

"&format=json" "&list=categorymembers" "&cmtitle=Category:%s" "&cmcontinue=%s").fmt(language,continueValue));

     page=page[0].del(0,page[1]);  // get rid of HTML header
     json:=YAJL().write(page).close();
     json["query"]["categorymembers"].pump(tasks,T("get","title"));
     continueValue=json.find("continue") //continue:-||,cmcontinue:page|954|19)
         .toList().apply("concat","=").concat("&");
  }while(continueValue);
  tasks

} re:=RegExp(0'!\s+==\s*{{\s*header\s*|!); // == {{ header | zkl foreach task in (getTasks("Programming_Tasks")){

  page:=CURL().get(
     "http://www.rosettacode.org/mw/index.php?title=%s&action=raw"
     .fmt(CURL.urlEncode(task)));
  page=page[0].del(0,page[1]);  // get rid of HTML header
  cnt,n:=0,0;  while(re.search(page,True,n)){ cnt+=1; n=re.matched[0].sum(0); }
  "%4d: %s".fmt(cnt,task).println();

}</lang>

Output:
 229: 100 doors
  15: 15 Puzzle Game
...
 257: 99 Bottles of Beer
 199: A+B
...
  28: Calendar - for "REAL" programmers
...
   9: Stream Merge
...
  78: Zero to the zero power
  19: Zhang-Suen thinning algorithm
  83: Zig-zag matrix