Split (1)

train · 1.84k rows

solutions listlengths 2 791	task_name stringlengths 2 86
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Digital_root/Multiplicative_digital_root\nnote: Mathematics\n", "language": "00-META" }, { "code": "The [[wp:Multiplicative digital root\|multiplicative digital root]] (MDR) and multiplicative persistence (MP) of a number, <math>n</math>, is calculate...	Digital-root-Multiplicative-digital-root
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Dinesman's_multiple-dwelling_problem\nnote: Dinesman's multiple-dwelling problem\n", "language": "00-META" }, { "code": ";Task\nSolve [https://web.archive.org/web/20170325033240/http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-28.html#%_sec_4.3.2...	Dinesmans-multiple-dwelling-problem
[ { "code": "---\ncategory:\n- Classic CS problems and programs\nfrom: http://rosettacode.org/wiki/Dining_philosophers\nnote: Concurrency\nrequires:\n- Concurrency\n", "language": "00-META" }, { "code": "The dining philosophers problem illustrates non-composability of low-level synchronization primiti...	Dining-philosophers
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Disarium_numbers\n", "language": "00-META" }, { "code": "A '''Disarium number''' is an integer where the sum of each digit raised to the power of its position in the number, is equal to the number.\n\n\n;E.G.\n\n'''135''' is a '''Disarium number''':\...	Disarium-numbers
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Display_a_linear_combination\n", "language": "00-META" }, { "code": ";Task:\nDisplay a finite [[wp:linear combination\|linear combination]] in an infinite vector basis <big><math>(e_1, e_2,\\ldots)</math></big>.\n\nWrite a function that, when given a ...	Display-a-linear-combination
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Display_an_outline_as_a_nested_table\n", "language": "00-META" }, { "code": "{\| class=\"wikitable\" style=\"text-align: center;\"\n\|-\n\| style=\"background: #ffffe6; \" colspan=7 \| Display an outline as a nested table.\n\|-\n\| style=\"background: #ffe...	Display-an-outline-as-a-nested-table
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Distance_and_Bearing\n", "language": "00-META" }, { "code": "It is very important in aviation to have knowledge of the nearby airports at any time in flight. \n;Task:\nDetermine the distance and bearing from an Airplane to the 20 nearest Airports whe...	Distance-and-Bearing
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Distribution_of_0_digits_in_factorial_series\nnote: Mathematics\n", "language": "00-META" }, { "code": "Large Factorials and the Distribution of '0' in base 10 digits.\n\n; About the task:\n\nWe can see that some features of factorial numbers (the se...	Distribution-of-0-digits-in-factorial-series
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Diversity_prediction_theorem\n", "language": "00-META" }, { "code": "The   ''wisdom of the crowd''   is the collective opinion of a group of individuals rather than that of a single expert.\n\nWisdom-of-the-crowds research routinely attribu...	Diversity-prediction-theorem
[ { "code": "---\nfrom: http://rosettacode.org/wiki/DNS_query\nnote: Networking and Web Interaction\n", "language": "00-META" }, { "code": "DNS is an internet service that maps domain names, like <code>rosettacode.org</code>, to IP addresses, like <code>66.220.0.231</code>.\n\nUse DNS to resolve <code...	DNS-query
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Dominoes\nnote: Games\n", "language": "00-META" }, { "code": "Warning: If you are looking for pizza delivery you have come to the wrong page. Bloody Google (other search engines are available).\n\nTake a box of dominoes give them a good shuffle and t...	Dominoes
[ { "code": "---\ncategory:\n- Date and time\nfrom: http://rosettacode.org/wiki/Doomsday_rule\n", "language": "00-META" }, { "code": "; About the task\nJohn Conway (1937-2020), was a mathematician who also invented several mathematically\noriented computer pastimes, such as the famous Game of Life cel...	Doomsday-rule
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Dot_product\n", "language": "00-META" }, { "code": ";Task:\nCreate a function/use an in-built function, to compute the   '''[[wp:Dot product\|dot product]]''',   also known as the   '''scalar product'''   of two vectors. \n\nIf pos...	Dot-product
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Doubly-linked_list/Element_definition\nnote: Data Structures\n", "language": "00-META" }, { "code": ";Task:\nDefine the data structure for a [[Linked_List#Doubly-Linked_List\|doubly-linked list]] element. \n\nThe element should include a data member t...	Doubly-linked-list-Element-definition
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Doubly-linked_list/Element_insertion\nnote: Data Structures\n", "language": "00-META" }, { "code": "Use the link structure defined in [[Doubly-Linked List (element)]] to define a procedure for inserting a link into a doubly-linked list. Call this pro...	Doubly-linked-list-Element-insertion
[ { "code": "---\ncategory:\n- Iteration\nfrom: http://rosettacode.org/wiki/Doubly-linked_list/Traversal\nnote: Data Structures\n", "language": "00-META" }, { "code": "Traverse from the beginning of a [[Doubly-linked list/Definition\|doubly-linked list]] to the end, and from the end to the beginning.\n...	Doubly-linked-list-Traversal
[ { "code": "---\ncategory:\n- Date and time\nfrom: http://rosettacode.org/wiki/Draw_a_clock\n", "language": "00-META" }, { "code": ";Task:\nDraw a clock. \n\n\nMore specific:\n# Draw a time keeping device. It can be a stopwatch, hourglass, sundial, a mouth counting \"one thousand and one\", anything...	Draw-a-clock
[ { "code": "---\ncategory:\n- 3D\nfrom: http://rosettacode.org/wiki/Draw_a_cuboid\nnote: Geometric Primitives\nrequires:\n- Graphics\n", "language": "00-META" }, { "code": ";Task:\nDraw a   [http://en.wikipedia.org/wiki/Cuboid cuboid]   with relative dimensions of   <big> 2 × 3 &...	Draw-a-cuboid
[ { "code": "---\ncategory:\n- Basic language learning\n- Simple\nfrom: http://rosettacode.org/wiki/Draw_a_pixel\nnote: GUI\nrequires:\n- Graphics\n", "language": "00-META" }, { "code": ";Task:\nCreate a window and draw a pixel in it, subject to the following:\n\n::#  the window is 320 x 240\n::#...	Draw-a-pixel
[ { "code": "---\ncategory:\n- 3D\nfrom: http://rosettacode.org/wiki/Draw_a_sphere\nrequires:\n- Graphics\n", "language": "00-META" }, { "code": ";Task:\nDraw a sphere. \n\nThe sphere can be represented graphically, or in ASCII art, depending on the language capabilities. \n\nEither static or rotation...	Draw-a-sphere
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Duffinian_numbers\n", "language": "00-META" }, { "code": "A '''Duffinian number''' is a composite number '''k''' that is relatively prime to its sigma sum '''σ'''.\n\n''The sigma sum of '''k''' is the sum of the divisors of '''k'''.''\n\n\n;E.G.\n\n'...	Duffinian-numbers
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Dutch_national_flag_problem\n", "language": "00-META" }, { "code": "The Dutch national flag is composed of three coloured bands in the order:\n::*   red     (top)\n::*   then white,   and\n::*   lastly blue   (at th...	Dutch-national-flag-problem
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Earliest_difference_between_prime_gaps\n", "language": "00-META" }, { "code": "When calculating prime numbers > 2, the difference between adjacent primes is always an even number. This difference, also referred to as the gap, varies in an random patt...	Earliest-difference-between-prime-gaps
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Eban_numbers\n", "language": "00-META" }, { "code": ";Definition:\nAn   '''eban'''   number is a number that has no letter   <big> '''e''' </big>   in it when the number is spelled in English.\n\nOr more literally,   spelled ...	Eban-numbers
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Echo_server\nnote: Networking and Web Interaction\n", "language": "00-META" }, { "code": "Create a network service that sits on TCP port <tt>12321</tt>, which accepts connections on that port, and which echoes complete lines (using a carriage-return/...	Echo-server
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Egyptian_division\n", "language": "00-META" }, { "code": "Egyptian division is a method of dividing integers using addition and \ndoubling that is similar to the algorithm of [[Ethiopian multiplication]]\n\n'''Algorithm:'''\n\nGiven two numbers where...	Egyptian-division
[ { "code": "---\nfrom: http://rosettacode.org/wiki/EKG_sequence_convergence\n", "language": "00-META" }, { "code": "The sequence is from the natural numbers and is defined by:\n* <code>a(1) = 1</code>; \n* <code>a(2) = Start = 2</code>;\n* for n > 2, <code>a(n)</code> shares at least one prime factor...	EKG-sequence-convergence
[ { "code": "---\ncategory:\n- Mathematics\nfrom: http://rosettacode.org/wiki/Element-wise_operations\nnote: Matrices\n", "language": "00-META" }, { "code": "This task is similar to:\n::*   [[Matrix multiplication]]\n::*   [[Matrix transposition]]\n\n\n;Task:\nImplement basic element-wise ma...	Element-wise-operations
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Elementary_cellular_automaton/Infinite_length\n", "language": "00-META" }, { "code": "The purpose of this task is to create a version of an [[Elementary cellular automaton]] whose number of cells is only limited by the memory size of the computer.\n\...	Elementary-cellular-automaton-Infinite-length
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Elementary_cellular_automaton/Random_number_generator\n", "language": "00-META" }, { "code": "[[wp:Rule 30\|Rule 30]] is considered to be chaotic enough to generate good pseudo-random numbers. As a matter of fact, for a long time rule 30 was used by ...	Elementary-cellular-automaton-Random-number-generator
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Elliptic_curve_arithmetic\n", "language": "00-META" }, { "code": "[[wp:Elliptic curve\|Elliptic curve]]s   are sometimes used in   [[wp:cryptography\|cryptography]]   as a way to perform   [[wp:digital signature\|digital signature]]s...	Elliptic-curve-arithmetic
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Emirp_primes\nnote: Prime Numbers\n", "language": "00-META" }, { "code": "An   ''emirp''   ('''prime''' spelled backwards)   are primes that when reversed   (in their decimal representation)   are a different prime.\n\n(This ...	Emirp-primes
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Empty_directory\n", "language": "00-META" }, { "code": "Starting with a path to some directory, determine whether the directory is empty.\n\nAn empty directory contains no files nor subdirectories. \nWith [[Unix]] or [[Windows]] systems, every direct...	Empty-directory
[ { "code": "---\ncategory:\n- Initialization\n- Simple\nfrom: http://rosettacode.org/wiki/Empty_program\nnote: Basic language learning\n", "language": "00-META" }, { "code": ";Task:\nCreate the simplest possible program that is still considered \"correct.\"\n<br><br>\n\n", "language": "00-TASK" ...	Empty-program
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Enforced_immutability\nnote: Initialization\n", "language": "00-META" }, { "code": ";Task:\nDemonstrate any means your language has to prevent the modification of values, or to create objects that cannot be modified after they have been created.\n<br...	Enforced-immutability
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Entropy\nnote: Mathematics\n", "language": "00-META" }, { "code": ";Task:\nCalculate the Shannon entropy   H   of a given input string.\n\nGiven the discrete random variable <math>X</math> that is a string of <math>N</math> \"symbols\" (tot...	Entropy
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Entropy/Narcissist\n", "language": "00-META" }, { "code": ";Task:\nWrite a computer program that computes and shows its own   [[entropy]].\n\n\n;Related Tasks: \n:*   [[Fibonacci_word]]\n:*   [[Entropy]]\n<br><br>\n\n", "language":...	Entropy-Narcissist
[ { "code": "---\ncategory:\n- Environment variables\n- Initialization\n- Simple\nfrom: http://rosettacode.org/wiki/Environment_variables\nnote: Programming environment operations\n", "language": "00-META" }, { "code": ";Task:\nShow how to get one of your process's [[wp:Environment variable\|environmen...	Environment-variables
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Equal_prime_and_composite_sums\n", "language": "00-META" }, { "code": "Suppose we have a sequence of prime sums, where each term '''P<sub>n</sub>''' is the sum of the first '''n''' primes. \n\n '''P = (2), (2 + 3), (2 + 3 + 5), (2 + 3 + 5 + 7), (2 + ...	Equal-prime-and-composite-sums
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Equilibrium_index\n", "language": "00-META" }, { "code": "An equilibrium index of a sequence is an index into the sequence such that the sum of elements at lower indices is equal to the sum of elements at higher indices. \n\n\nFor example, in a seque...	Equilibrium-index
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Erdös-Selfridge_categorization_of_primes\n", "language": "00-META" }, { "code": "A prime p is in category 1 if the prime factors of p+1 are 2 and or 3. p is in category 2 if all the prime factors of p+1 are in category 1. p is in category g if all th...	Erd-s-Selfridge-categorization-of-primes
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Esthetic_numbers\n", "language": "00-META" }, { "code": "An '''esthetic number''' is a positive integer where every adjacent digit differs from its neighbour by 1.\n\n\n;E.G.\n\n:* '''12''' is an esthetic number. One and two differ by 1.\n\n:* '''565...	Esthetic-numbers
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Ethiopian_multiplication\nnote: Arithmetic operations\n", "language": "00-META" }, { "code": "Ethiopian multiplication is a method of multiplying integers using only addition, doubling, and halving.\n\n\n'''Method:''' <br>\n# Take two numbers to be m...	Ethiopian-multiplication
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Euler_method\nnote: Mathematical operations\n", "language": "00-META" }, { "code": "Euler's method numerically approximates solutions of first-order ordinary differential equations (ODEs) with a given initial value.   It is an explicit method fo...	Euler-method
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Euler's_identity\n", "language": "00-META" }, { "code": "In mathematics, ''Euler's identity'' is the equality:\n\n <span style=\"font-size:150%;font-style:bold;\"><span style=\"font-style:italic\">e<sup>i<math>\\pi</math></sup></span> ...	Eulers-identity
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Euler's_sum_of_powers_conjecture\n", "language": "00-META" }, { "code": "There is a conjecture in mathematics that held for over two hundred years before it was disproved by the finding of a counterexample in 1966 by [http://www.ams.org/journals/mcom...	Eulers-sum-of-powers-conjecture
[ { "code": "---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Even_or_odd\n", "language": "00-META" }, { "code": ";Task:\nTest whether an integer is even or odd.\n\nThere is more than one way to solve this task:\n\n* Use the even and odd predicates, if the language provides them.\n* Check t...	Even-or-odd
[ { "code": "---\ncategory:\n- Encyclopedia\nfrom: http://rosettacode.org/wiki/Events\nnote: Concurrency\nrequires:\n- Concurrency\n", "language": "00-META" }, { "code": "'''Event''' is a synchronization object. An event has two states ''signaled'' and ''reset''. A [[task]] may await for the event to ...	Events
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Evolutionary_algorithm\n", "language": "00-META" }, { "code": "Starting with:\n* The <code>target</code> string: <code>\"METHINKS IT IS LIKE A WEASEL\"</code>.\n* An array of random characters chosen from the set of upper-case letters together with t...	Evolutionary-algorithm
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Exceptions/Catch_an_exception_thrown_in_a_nested_call\nnote: Control Structures\n", "language": "00-META" }, { "code": "Show how to create a user-defined exception   and   show how to catch an exception raised from several nested calls away...	Exceptions-Catch-an-exception-thrown-in-a-nested-call
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Executable_library\n", "language": "00-META" }, { "code": "The general idea behind an executable library is to create a library \nthat when used as a library does one thing; \nbut has the ability to be run directly via command line. \nThus the API co...	Executable-library
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Execute_a_Markov_algorithm\nnote: Compilers and Interpreters\n", "language": "00-META" }, { "code": ";Task:\nCreate an interpreter for a [[wp:Markov algorithm\|Markov Algorithm]]. \n\nRules have the syntax:\n <ruleset> ::= ((<comment> \| <rule>) <newli...	Execute-a-Markov-algorithm
[ { "code": "---\ncategory:\n- Compilers and Interpreters\nfrom: http://rosettacode.org/wiki/Execute_Brain**\n", "language": "00-META" }, { "code": "{{implementation\|Brainf}}\nRCBF is a set of [[Brainf**]] compilers and interpreters written for Rosetta Code in a variety of languages. \n\nBelow a...	Execute-Brain-
[ { "code": "---\ncategory:\n- Compilers and Interpreters\nfrom: http://rosettacode.org/wiki/Execute_Computer/Zero\n", "language": "00-META" }, { "code": "{{implementation\|Computer/zero Assembly}}\n{{omit from\|Computer/zero Assembly}}\n\n;Task:\nCreate a [[Computer/zero Assembly]] emulator. You may co...	Execute-Computer-Zero
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Execute_HQ9+\n", "language": "00-META" }, { "code": ";Task:\nImplement a   ''' [[HQ9+]] '''   interpreter or compiler.\n<br><br>\n\n", "language": "00-TASK" }, { "code": "F hello()\n print(‘Hello, world!’)\n\nString src\nF qui...	Execute-HQ9+
[ { "code": "---\ncategory:\n- Arithmetic\nfrom: http://rosettacode.org/wiki/Exponentiation_operator\nnote: Arithmetic operations\n", "language": "00-META" }, { "code": "Most programming languages have a built-in implementation of exponentiation. \n \n\n;Task:\nRe-implement integer exponentiation for ...	Exponentiation-operator
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Exponentiation_order\n", "language": "00-META" }, { "code": "This task will demonstrate the order of [[wp:Exponentiation\|exponentiation]]   <big>('''x<sup>y</sup>''') </big>   when there are multiple exponents.\n\n(Many programming language...	Exponentiation-order
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Exponentiation_with_infix_operators_in_(or_operating_on)_the_base\n", "language": "00-META" }, { "code": "(Many programming languages,   especially those with extended─precision integer arithmetic,   usually\nsupport one of <big> <code>**</...	Exponentiation-with-infix-operators-in-or-operating-on-the-base
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Extensible_prime_generator\nnote: Prime Numbers\n", "language": "00-META" }, { "code": ";Task:\nWrite a generator of prime numbers, in order, that will automatically adjust to accommodate the generation of any reasonably high prime.\n\nThe routine sh...	Extensible-prime-generator
[ { "code": "---\ncategory:\n- Irrational numbers\nfrom: http://rosettacode.org/wiki/Extreme_floating_point_values\n", "language": "00-META" }, { "code": "The IEEE floating point specification defines certain 'extreme' floating point values such as minus zero, -0.0, a value distinct from plus zero; no...	Extreme-floating-point-values
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Faces_from_a_mesh\n", "language": "00-META" }, { "code": "A [[wp:Polygon mesh\|mesh]] defining a surface has uniquely numbered vertices, and named, \nsimple-polygonal faces described usually by an ordered list of edge numbers \ngoing around the face, ...	Faces-from-a-mesh
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Factorial_base_numbers_indexing_permutations_of_a_collection\n", "language": "00-META" }, { "code": "You need a random arrangement of a deck of cards, you are sick of lame ways of doing this. This task is a super-cool way of doing this using factoria...	Factorial-base-numbers-indexing-permutations-of-a-collection
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Factorial_primes\n", "language": "00-META" }, { "code": ";Definition\nA [[wp:Factorial_prime\|'''factorial prime''']] is a prime number that is one less or one more than a [[wp:Factorial\|factorial]].\n\nIn other words a non-negative integer '''n''' co...	Factorial-primes
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Factorions\n", "language": "00-META" }, { "code": ";Definition:\nA factorion is a natural number that equals the sum of the factorials of its digits. \n\n\n;Example: \n'''145'''   is a factorion in base '''10''' because:\n<b>\n <big> 1!...	Factorions
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Factors_of_an_integer\nnote: Basic language learning\n", "language": "00-META" }, { "code": "{{basic data operation}}\n[[Category:Arithmetic operations]]\n[[Category:Mathematical_operations]]\n[[Category:Prime Numbers]]\n\n;Task:\nCompute the   ...	Factors-of-an-integer
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Fairshare_between_two_and_more\n", "language": "00-META" }, { "code": "The [[Thue-Morse]] sequence is a sequence of ones and zeros that if two people\ntake turns in the given order, the first persons turn for every '0' in the\nsequence, the second fo...	Fairshare-between-two-and-more
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Farey_sequence\n", "language": "00-META" }, { "code": "The   [[wp:Farey sequence\|Farey sequence]]   ''' ''F''<sub>n</sub>'''   of order   '''n'''   is the sequence of completely reduced fractions between   '''0'''  ...	Farey-sequence
[ { "code": "---\nfrom: http://rosettacode.org/wiki/FASTA_format\n", "language": "00-META" }, { "code": "In [[wp:bioinformatics\|bioinformatics]], long character strings are often encoded in a format called [[wp:FASTA format\|FASTA]]. \n\nA FASTA file can contain several strings, each identified by a n...	FASTA-format
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Faulhaber's_formula\nnote: Mathematics\n", "language": "00-META" }, { "code": "In mathematics,   Faulhaber's formula,   named after Johann Faulhaber,   expresses the sum of the ''p''-th powers of the first ''n'' positive integers as a ...	Faulhabers-formula
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Faulhaber's_triangle\nnote: Mathematics\n", "language": "00-META" }, { "code": "Named after [https://en.wikipedia.org/wiki/Johann_Faulhaber Johann Faulhaber], the rows of Faulhaber's triangle are the coefficients of polynomials that represent sums of...	Faulhabers-triangle
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Fermat_numbers\nnote: Prime Numbers\n", "language": "00-META" }, { "code": "In mathematics, a Fermat number, ''named after Pierre de Fermat who first studied them,'' is a positive integer of the form <big>'''F<sub>n</sub> = 2<sup>''2''<sup>''n''</su...	Fermat-numbers
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Fibonacci_n-step_number_sequences\n", "language": "00-META" }, { "code": "These number series are an expansion of the ordinary [[Fibonacci sequence]] where:\n# For <math>n = 2</math> we have the Fibonacci sequence; with initial values <math>[1, 1]</m...	Fibonacci-n-step-number-sequences
[ { "code": "---\ncategory:\n- Recursion\n- Memoization\n- Classic CS problems and programs\nfrom: http://rosettacode.org/wiki/Fibonacci_sequence\nnote: Arithmetic operations\n", "language": "00-META" }, { "code": "The '''Fibonacci sequence''' is a sequence   <big> F<sub>n</sub> </big>   of...	Fibonacci-sequence
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Fibonacci_word/fractal\nnote: Fractals\n", "language": "00-META" }, { "code": "The [[Fibonacci word]] may be represented as a fractal as described [http://hal.archives-ouvertes.fr/docs/00/36/79/72/PDF/The_Fibonacci_word_fractal.pdf here]:\n<br><br><s...	Fibonacci-word-fractal
[ { "code": "---\ncategory:\n- File_System_Operations\n- String_manipulation\nfrom: http://rosettacode.org/wiki/File_extension_is_in_extensions_list\n", "language": "00-META" }, { "code": "[[wp:Filename extension\|Filename extensions]] are a rudimentary but commonly used way of identifying files types....	File-extension-is-in-extensions-list
[ { "code": "---\nfrom: http://rosettacode.org/wiki/File_input/output\nnote: File handling\n", "language": "00-META" }, { "code": "{{selection\|Short Circuit\|Console Program Basics}} [[Category:Simple]]\n\n;Task:\nCreate a file called   \"output.txt\",   and place in it the contents of the fi...	File-input-output
[ { "code": "---\nfrom: http://rosettacode.org/wiki/File_size\nnote: File System Operations\n", "language": "00-META" }, { "code": "Verify the size of a file called     '''input.txt'''     for a file in the current working directory, and another one in the file system root.\n<br><b...	File-size
[ { "code": "---\nfrom: http://rosettacode.org/wiki/File_size_distribution\n", "language": "00-META" }, { "code": ";Task:\nBeginning from the current directory, or optionally from a directory specified as a command-line argument, determine how many files there are of various sizes in a directory hiera...	File-size-distribution
[ { "code": "---\ncategory:\n- Iteration\nfrom: http://rosettacode.org/wiki/Filter\nnote: Basic language learning\n", "language": "00-META" }, { "code": ";Task:\nSelect certain elements from an Array into a new Array in a generic way.\n\n\nTo demonstrate, select all even numbers from an Array.\n\nAs a...	Filter
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Find_common_directory_path\nnote: String manipulation\n", "language": "00-META" }, { "code": "Create a routine that, given a set of strings representing directory paths and a single character directory separator, will return a string representing tha...	Find-common-directory-path
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Find_duplicate_files\n", "language": "00-META" }, { "code": "In a large directory structure it is easy to inadvertently leave unnecessary copies of files around, which can use considerable disk space and create confusion. \n\n\n;Task:\nCreate a progr...	Find-duplicate-files
[ { "code": "---\ncategory:\n- Geometry\n- Collision detection\nfrom: http://rosettacode.org/wiki/Find_if_a_point_is_within_a_triangle\n", "language": "00-META" }, { "code": "Find if a point is within a triangle.\n\n\n;Task:\n \n::*   Assume points are on a plane defined by (x, y) real number ...	Find-if-a-point-is-within-a-triangle
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Find_limit_of_recursion\n", "language": "00-META" }, { "code": "{{selection\|Short Circuit\|Console Program Basics}}\n[[Category:Basic language learning]]\n[[Category:Programming environment operations]] \n[[Category:Simple]]\n\n;Task:\nFind the limit ...	Find-limit-of-recursion
[ { "code": "---\ncategory:\n- Palindromes\nfrom: http://rosettacode.org/wiki/Find_palindromic_numbers_in_both_binary_and_ternary_bases\n", "language": "00-META" }, { "code": ";Task:\n\n*   Find and show (in decimal) the first six numbers (non-negative integers) that are   [[Palindrome detec...	Find-palindromic-numbers-in-both-binary-and-ternary-bases
[ { "code": "---\ncategory:\n- Geometry\n- Collision detection\nfrom: http://rosettacode.org/wiki/Find_the_intersection_of_a_line_with_a_plane\n", "language": "00-META" }, { "code": "Finding the intersection of an infinite ray with a plane in 3D is an important topic in collision detection.\n\n\n;Task...	Find-the-intersection-of-a-line-with-a-plane
[ { "code": "---\ncategory:\n- Date and time\nfrom: http://rosettacode.org/wiki/Find_the_last_Sunday_of_each_month\n", "language": "00-META" }, { "code": "Write a program or a script that returns the last Sundays of each month of a given year. The year may be given through any simple input method in y...	Find-the-last-Sunday-of-each-month
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Find_the_missing_permutation\n", "language": "00-META" }, { "code": "<pre>\n ABCD\n CABD\n ACDB\n DACB\n BCDA\n ACBD\n ...	Find-the-missing-permutation
[ { "code": "---\nfrom: http://rosettacode.org/wiki/First_class_environments\nnote: Classic CS problems and programs\n", "language": "00-META" }, { "code": "According to [[wp:First-class_object\|Wikipedia]], \"In computing, a first-class object ... is an entity that can be constructed at run-time, pass...	First-class-environments
[ { "code": "---\nfrom: http://rosettacode.org/wiki/First-class_functions/Use_numbers_analogously\n", "language": "00-META" }, { "code": "In [[First-class functions]], a language is showing how its manipulation of functions is similar to its manipulation of other types.\n\nThis tasks aim is to compare...	First-class-functions-Use-numbers-analogously
[ { "code": "---\nfrom: http://rosettacode.org/wiki/First_perfect_square_in_base_n_with_n_unique_digits\n", "language": "00-META" }, { "code": "Find the first perfect square in a given base '''N''' that has at least '''N''' digits and\nexactly '''N''' ''significant unique'' digits when expressed in ba...	First-perfect-square-in-base-n-with-n-unique-digits
[ { "code": "---\nfrom: http://rosettacode.org/wiki/First_power_of_2_that_has_leading_decimal_digits_of_12\n", "language": "00-META" }, { "code": "(This task is taken from a   ''Project Euler''   problem.)\n\n(All numbers herein are expressed in base ten.)\n\n\n<big>'''2<sup>7</sup>   =...	First-power-of-2-that-has-leading-decimal-digits-of-12
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Fivenum\n", "language": "00-META" }, { "code": "Many big data or scientific programs use boxplots to show distributions of data.   In addition, sometimes saving large arrays for boxplots can be impractical and use extreme amounts of RAM.   ...	Fivenum
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Fixed_length_records\n", "language": "00-META" }, { "code": "Fixed length read/write\n\nBefore terminals, computers commonly used [https://en.wikipedia.org/wiki/Punched_card_reader punch card readers] or paper tape input.\n\nA common format before th...	Fixed-length-records
[ { "code": "---\ncategory:\n- Iteration\n- Recursion\n- Simple\nfrom: http://rosettacode.org/wiki/FizzBuzz\nnote: Classic CS problems and programs\n", "language": "00-META" }, { "code": ";Task:\nWrite a program that prints the integers from   '''1'''   to   '''100'''   (inclusive)...	FizzBuzz
[ { "code": "---\ncategory:\n- Games\nfrom: http://rosettacode.org/wiki/Flipping_bits_game\n", "language": "00-META" }, { "code": ";The game:\nGiven an   '''N×N'''   square array of zeroes or ones in an initial configuration,   and a target configuration of zeroes and ones.\n\n\nT...	Flipping-bits-game
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Flow-control_structures\nnote: Control Structures\n", "language": "00-META" }, { "code": "{{Control Structures}}\n[[Category:Flow control]]\n\n;Task:\nDocument common flow-control structures. \n\n\nOne common example of a flow-control structure is th...	Flow-control-structures
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Floyd-Warshall_algorithm\nnote: Routing algorithms\n", "language": "00-META" }, { "code": "The [[wp:Floyd–Warshall_algorithm\|Floyd–Warshall algorithm]] is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weig...	Floyd-Warshall-algorithm
[ { "code": "---\ncategory:\n- Cellular automata\nfrom: http://rosettacode.org/wiki/Forest_fire\nnote: Games\n", "language": "00-META" }, { "code": "<br>\n;Task:\nImplement the Drossel and Schwabl definition of the [[wp:Forest-fire model\|forest-fire model]].\n\n\nIt is basically a 2D   [[wp:Cellu...	Forest-fire
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Fork\nnote: Programming environment operations\n", "language": "00-META" }, { "code": ";Task:\n\nSpawn a new [[process]] which can run simultaneously with, and independently of, the original parent process.\n<br><br>\n\n", "language": "00-TASK" ...	Fork
[ { "code": "---\nfrom: http://rosettacode.org/wiki/Formal_power_series\nnote: Arithmetic operations\n", "language": "00-META" }, { "code": "A ''power series'' is an infinite sum of the form\n\n<math>a_0 + a_1 \\cdot x + a_2 \\cdot x^2 + a_3 \\cdot x^3 + \\cdots</math>\n\nThe ''a<sub>i</sub>'' are cal...	Formal-power-series

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.