
Write a generator function named count_seq that doesn't require any arguments and generates a sequence that starts like this: 2, 12, 1112, 3112, 132112, 1113122112, 311311222112, 13211321322112, ...
To get a term of the sequence, count how many there are of each digit (in a row) in the **previous** term. For example, the first term is "one 2", which gives us the second term "12". That term is "one 1" followed by "one 2", which gives us the third term "1112". That term is "three 1" followed by "one 2", or 3112. Etc.
Your generator function won't just go up to some limit - it will keep going indefinitely. It may need to treat the first one or two terms as special cases, which is fine. It should yield the terms of the sequence as **strings**, rather than numeric values, for example "1112" instead of 1112.

Trending nowThis is a popular solution!
Step by stepSolved in 3 steps with 1 images

- c++arrow_forwardWrite a function/ program that produces the following: int findDifference(const string a1[], int n1, const string a2[], int n2); Return the position of the first corresponding elements of a1 and a2 that are not equal. n1 is the number of interesting elements in a1, and n2 is the number of interesting elements in a2. If the arrays are equal up to the point where one or both runs out, return the smaller of n1 and n2. Notwithstanding each function's behavior described below, all functions that return an int must return −1 if they are passed any bad arguments (e.g. a negative array size, or a position that would require looking at the contents of an element past the last element we're interested in). Unless otherwise noted, passing 0 to the function as the array size is not itself an error; it merely indicates the function should examine no elements of the array. Here's an example: string cast[5] = { "samwell", "jon", "margaery", "daenerys", "tyrion" }; string roles[4] = { "samwell",…arrow_forwardwrite a recursive version. The function takes two string parameters, s1 and s2 and returns the starting index of s2 inside the first string s1, or -1 if s2 is not found in s1. You must not use any loops; you also cannot use the string member functions find or rfind. You may use the member functions size, at and substr. Your function must be recursive. CANNOT MODIFY GRAY AREAarrow_forward
- Write the convert_word code. convert_word is known as a function, which we will cover more in depth later. You are automatically given a parameter called word, which is a string that contains a single word. The return conv is how you will send data out of your function. The conv is a variable that hasn't been created yet, but it will be a string containing the converted hey. For example, if word="hey", then conv will be "heey". You are responsible for creating the variable conv, as the template has NOT done that for you. You need to use an if statement to see if the word starts with "he" and ends with "y". Since you don't know how many e's might be between the he and y, you have to do some math here. Recall that you can get the length of a string by using len(word) in the code above. You also know that h and y will be included. so, len(word) - 2 will be the number of e's in between the h and y. Create a string that contains the number of e's. This will be your conv variable. I would…arrow_forwardWrite a program which uses a function to record some names entered by the user, output them, then print the one that was the longest. The program should first ask the user to enter the number of names to be entered (up to 10), then prompt them for each name. These names should be stored in an array of strings. The final execution of the program should look something like this (user input in bold): How many names, up to 10? 3 Name of Person 1: Bob Name of Person 2: Gloria Name of Person 3: Anthony PEOPLE ENTERED: Bob Gloria Anthony LONGEST NAME: Anthony You must write a function called askName which prompts the user for only one name, then collects the name and returns it in a string. The rest of the program should run from within main. Please separate your code into .h and .cpp files so that the program will have one header file (askName.h) and two source files (main.cpp and askName.cpp).arrow_forwarddef g11_3(N) :'''Assume that N is a positive integer.Returns the sum from 1 to N inclusive, but omitting the numbers that are of type series1, meaning omit numbers that can be written as 1 + 2 + 3 + 4 + ... + k for some positive integer k. Hint: write a boolean function that checks if an integer is of typeseries1. For example, the first few series1 numbers are 1, 3, 6, 10, ...So, g11_3(10) returns 35since the numbers to add are: 2, 4, 5, 7, 8, 9, where weare not using 1, 3, 6 and 10 because they are of type series1.'''pass# --------------------------------------------------------------# The Testing# --------------------------------------------------------------class myTests(unittest.TestCase):def test1(self):ans = g11_3(1)self.assertEqual(ans, 0)def test2(self):ans = g11_3(2)self.assertEqual(ans, 2)def test3(self):ans = g11_3(10)self.assertEqual(ans, 35)def test4(self):ans = g11_3(100)self.assertEqual(ans, 4595)def test5(self):ans = g11_3(1000)self.assertEqual(ans, 485320)if __name__…arrow_forward
- Add a function to get the CPI values from the user and validate that they are greater than 0. 1. Declare and implement a void function called getCPIValues that takes two float reference parameters for the old_cpi and new_cpi. 2. Move the code that reads in the old_cpi and new_cpi into this function. 3. Add a do-while loop that validates the input, making sure that the old_cpi and new_cpi are valid values. + if there is an input error, print "Error: CPI values must be greater than 0." and try to get data again. 4. Replace the code that was moved with a call to this new function. - Add an array to accumulate the computed inflation rates 1. Declare a constant called MAX_RATES and set it to 20. 2. Declare an array of double values having size MAX_RATES that will be used to accumulate the computed inflation rates. 3. Add code to main that inserts the computed inflation rate into the next position in the array. 4. Be careful to make sure the program does not overflow the array. - Add a…arrow_forwardWrite a function that returns the greatest common divisor of 2 integers.arrow_forwardin the C++ version please suppose to have a score corresponding with probabilities at the end and do not use the count[] function. Please explain the detail when coding. DO NOT USE ARRAY. The game of Pig The game of Pig is a dice game with simple rules: Two players race to reach 100 points. Each turn, a player repeatedly rolls a die until either a 1 ("pig") is rolled or the player holds and scores the sum of the rolls (i.e. the turn total). At any time during a player's turn, the player is faced with two decisions: roll - if the player rolls 1: the player scores nothing and it becomes the opponents turn. 2 - 6: the number is added to the player's turn total and the player's turn continues. hold - The turn total is added to the player's score and it becomes the opponent's turn. This game is a game of probability. Players can use their knowledge of probabilities to make an educated game decision. Assignment specifications Hold-at-20 means that the player will choose to roll…arrow_forward
- The following requirments that weren't mentioned for solving the following Python Code below: The provided code for alphabet, test_dups, test_miss, and histogram. Your implementation of the has_duplicates function. A loop that outputs duplicate information for each string in test_dups. Your implementation of the missing_letters function. A loop that outputs missing letters for each string in test_miss. Write a function called missing_letters that takes a string parameter and returns a new string with all the letters of the alphabet that are not in the argument string. The letters in the returned string should be in alphabetical order. Your implementation should use a histogram from the histogram function. It should also use the global variable alphabet. It should use this global variable directly, not through an argument or a local copy. It should loop over the letters in alphabet to determine which are missing from the input parameter. The function missing_letters should…arrow_forwardComplete the rotate_text() function that takes 2 parameters, a string data and an integer n. If n is positive, then the function will shift all the characters in data forward by n positions, with characters at the end of the string being moved to the start of the string. If n is 0 then the text remains the same. For example: rotate_text('abcde', rotate_text('abcde', rotate_text('abcde', 1) would return the string 'eabcd' 3) would return the string 'cdeab' 5) would return the string 'abcde' rotate_text('abcde', 6) would return the string 'eabcd' ... and so on. If n is negative, then the function will shift the characters in data backward by n positions, with characters at the start of the string being moved to the end of the string. For example: rotate text('abcde', -1) would return the string 'bcdea'arrow_forwardpost in python please and a coding editor too You are asked to help write a program that will help users purchase cookies. A user will input types of cookies and the number of cookies that they want, and your program will suggest how many boxes that they should order. There are 30 cookies per box, so your goal is to make sure that the user will buy enough boxes so that they will get the cookies that they want. Write a function cookie_order that takes a dictionary as a parameter containing cookie names as keys and numbers of those cookies as values. Have this function return a new dictionary that has cookie names and the number of boxes that should be purchased of each type. Hint: This means if someone wants 31 cookies, they need to buy 2 boxes of cookies of that type. You may want to consider using math.ceil for this problem. Examples: >>> cookie_order({'thin mints': 97}) {'thin mints': 4} >>> cookie_order({'thin mints':34, 'shortbread': 60, 'caramel delites': 71,…arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





