Write a function snake that takes an integer n and returns a string containing an ASCII-art snake with a tail (-), n pieces of body (~), and a head (>). Here is the (printed) result of snake(5): -~~~~~>, snake(8): -~~~~~~~~>, and snake(0): -> This function does not output anything. You don't need to define a prototype. Test your function in your main function with the following values: Sample output1: Enter a number: 5 -~~~~~> Sample output2: Enter a number: 0 -> C++

Write a function snake that takes an integer n and returns a string containing an ASCII-art snake with a tail (-), n pieces of body (~), and a head (>). Here is the (printed) result of snake(5): -~>, snake(8): ->, and snake(0): -> This function does not output anything. You don't need to define a prototype. Test your function in your main function with the following values: Sample output1: Enter a number: 5 -~> Sample output2: Enter a number: 0 -> C++

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Implement the following function in C programming language that get a string, and compute an array of non-empty tokens of the string containing only lower-case letters. For example: ● For a string "abc EFaG hi", the list of tokens with only lower-case letters is ["abc", "hi"]. ● For a string "ab 12 ef hi ", the list of such tokens is ["ab","ef","hi"]. ● For a string "abc 12EFG hi ", the list of such tokens is ["ab","hi"]. ● For a string " abc ", the list of such tokens is ["abc"]. ● For a string "+*abc!! B" the list of such tokens is empty.That is, we break the string using the spaces as delimiters (ascii value 32), and look only at the tokens with lower-case letters only . The function get_tokens gets a string str, and returns the array with the tokens containing only lower-case letters in the correct order. The length of the array should be the number of tokens, computed in count_tokens. char** get_tokens(const char* str); For example:● get_tokens("abcEFaG…
Edsgar Dijkstra is known for his work on programming languages. Hecame up with a neat problem that he called the Dutch National Flagproblem: given a list of strings, each of which is either 'red', 'green', or 'blue'(each is repeated several times in the list), rearrange the list so that thestrings are in the order of the Dutch national flag—all the 'red' stringsfirst, then all the 'green' strings, then all the 'blue' strings.Write a function called dutch_flag that takes a list and solves this problem.
Implement regular expression matching with support for '.' and '*'. '.' Matches any single character.'*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should be:bool is_match(const char *s, const char *p) Some examples:is_match("aa","a") → falseis_match("aa","aa") → trueis_match("aaa","aa") → falseis_match("aa", "a*") → trueis_match("aa", ".*") → trueis_match("ab", ".*") → trueis_match("aab", "c*a*b") → true""" def is_match(str_a, str_b): """Finds if `str_a` matches `str_b` Keyword arguments: str_a -- string str_b -- string """ len_a, len_b = len(str_a) + 1, len(str_b) + 1 matches = [[False] * len_b for _ in range(len_a)] # Match empty string with empty pattern matches[0][0] = True # Match empty string with .* for i, element in enumerate(str_b[1:], 2): matches[0][i] = matches[0][i - 2] and element == '*' for i, char_a in enumerate(str_a, 1):…
Write a function that takes a string s, a start position p, and a length l and returns a subset of s with the characters starting at position p deleted, using just the at, length, and substr string methods and the + (concatenate) operator. Sequences start at 0. ("abcdefghijk", 2, 4) yields "abghijk".
Write a C-program to read marks in the Programming and DataStructure Laboratory (out of 100) for N (to be read before) students.Consider the interval of marks 0-5, 6-10, 11-15, and so on. Note thatthe first interval contains 6 numbers, and other intervals are of 5numbers. Find the interval of marks having maximum number ofstudents in the class and compute the difference between its centerpoint from the mean of the distribution of marks.Provide results for the following inputs:1. N=2045, 56, 60, 15, 80, 90, 12, 85, 35, 58,63, 73, 52, 78, 47, 23, 14, 58, 18, 962. N=3054, 65, 6, 51, 8, 9, 21, 58, 53, 85,36, 37, 25, 87, 19, 93, 44, 85, 17, 69,40, 0, 3, 33, 16, 63, 95, 69, 74, 38
Write a function below that will take a 2d array of booleans representing a map as a parameter which will construct a vgraph as a searchable graph. You many use go, python or java do to this.
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ "((()))", "(()())", "(())()", "()(())", "()()()" ] """ def generate_parenthesis_v1(n): defadd_pair(res, s, left, right): ifleft==0andright==0: res.append(s) return ifright>0: add_pair(res, s+")", left, right-1) ifleft>0: add_pair(res, s+"(", left-1, right+1) res= [] add_pair(res, "", n, 0) returnres def generate_parenthesis_v2(n): defadd_pair(res, s, left, right): ifleft==0andright==0: res.append(s) ifleft>0: add_pair(res, s+"(", left-1, right) ifright>0andleft<right: add_pair(res, s+")", left, right-1).
Implement a function (Java or pseudocode) that will accept a mathematical expression which containssquare brackets, curly brackets and normal brackets (i.e. “[ …]”, “{ …}” and “( … )”) as the input andwould return whether the expression has matching brackets or not. The input expression will be given asa String array where each element in the array is a bracket (one of “[”, “]”, “{”, “}”, “(”, “)”) number ora mathematical operator. It should return true if expression has matching brackets and false otherwise
a) Implement a function start( ) that takes as input a positive number a, rounds its logarithm base 4 to the nearest integer n, and returns the value of 1.0 x 2^n.
Write a function that takes three lists of integers, l1, l2, and l3, and returnsa list of all tuples, where each tuple (a,b,c) is such that a is from l1, b is from l2 and c is from l3 and a+b=c. For example, given [1,2,3], [4,5] and [7,8]you should return [(2,5,7), (3,4,7), (3,5,8)]. The returned list must be sortedaccording to a and b, in ascending order.
In C language, implement the following two functions that allow breaking a string into non-empty tokens using a given delimiter. For example, For a string "abc-EFG-hi", and a delimiter '-': the list of tokens is ["abc", "EFG", "hi"] For a string "abc-EFG---hi-", and a delimiter '-': the list of tokens is ["abc", "EFG", "hi"] For a string "abc", and a delimiter ' ': the list of tokens is ["abc"] For a string "++abc++", and a delimiter '+': the list of tokens is ["abc"] That is, we break the string using the given delimiter, and the tokens are only the non-empty substrings. 1. The function count_tokens gets a string str, and a char delim, and returns the number of tokens in the string separated by delim. int count_tokens(const char* str, char delim); For example count_tokens("abc-EFG--", '-') needs to return 2. count_tokens("++a+b+c", '+') needs to return 3. count_tokens("***", '*') needs to return 0. 2. The function get_tokens gets a string str, and a char delim, and returns the…
Implement the following two functions that allow breaking a string into non-empty tokens using a given delimiter in c language . For example, ● For a string “abc-EFG-hi”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”] ● For a string “abc-EFG---hi-”, and a delimiter ‘-’ : the list of tokens is [“abc”, “EFG”, “hi”] ● For a string “abc”, and a delimiter ‘ ’ : the list of tokens is [“abc”] ● For a string “++abc++”, and a delimiter ‘+’ : the list of tokens is [“abc”] That is, we break the string using the given delimiter, and the tokens are only the non-empty substrings. The function count_tokens gets a string str, and a char delim, and returns the number of tokens in the string separated by delim. int count_tokens(const char* str, char delim); For example● count_tokens("abc-EFG--",'-')needstoreturn2. ● count_tokens("++a+b+c",'+')needstoreturn3.● count_tokens("***",'*')needstoreturn0.The function get_tokens gets a string str, and a char delim, and returns the…