typedef char String[50]; String a = "rider kamen "; // note: there is a space after 'n' String b = "miso ramen " // note: there is a space after 'n' String c = {'T', 'A', 'M', 'A', '\0', 'G', '0', '\0'}; String List[100], Table[50][50]; char *Data[100]; char *ptr;

computer science | c++ code | it's not graded. Correct answer will upvoted else downvoted.   It is given a non-negative integer x, the decimal portrayal of which contains n digits. You need to shading every its digit in red or dark, so the number shaped by the red digits is separable by A, and the number framed by the dark digits is detachable by B.    No less than one digit should be shaded in every one of two tones. Consider, the include of digits hued in red is r and the include of digits hued in dark is b. Among all potential colorings of the given number x, you need to output any to such an extent that the worth of |r−b| is the base conceivable.    Note that the number x and the numbers shaped by digits of each tone, may contain driving zeros.  Input :The principal line contains one integer t (1≤t≤10) — the number of experiments. Then, at that point, t experiments follow.    Each experiment comprises of two lines. The main line contains three integers n, A, B (2≤n≤40, 1≤A,B≤40).…

java

In c++ langauge Household Expense - Create arrays (size 15) that will hold the following information: category and amount). Allow the user to enter the category (ex.Water bill) and the corresponding amount spent on it. After the data entry, display the household categories and its corresponding amount in desceding order (highest amount first) and the total amount spent in a month. This is a sample output below

ASSIGNMENT: Write a program to use the capability of Recursion to calculate factorials. For example, 5 factorial is normally written as 5! 5! = 5*4*3*2*1 5! = 120 Use recursive function calling to multiply. 5*4*3*2*1 And then print the result. 120 Your output should resemble the image below. >sh -c jav d. -type f > java -cla 5 4 2 5! = 120 } Note: 5! is use in this example but your program should calculate the factorial for any number entered.

C++ Programming Problem: Mike loves different strings but he has no interest in programming. So, his mentor thought to give him a problem of programming including problem including strings. The problem goes like this that a box has string S and it also contains another string Y. Now he has to string Y in S and the condition is that he can arrange the characters of S in such a way that Y is there in the string. Develop a C++ code to find out the smallest substring of S that contains Y, print the resultant string as the output. Sample Input: knarameanany kar Output: aaaekarmnnny

c++ coding language   I need help with part B and C please. If you are unable to do both, then PLEASE prioritize part C. I am really stuck and really can use the help.       This is the code for c that was provided in order to guide me: const int N =31;    // N parking spaces bool parking[N];   // the garage   void EmptyTheLot(bool parking[], int N) {    for(int i=0; i<N; i++) p[i]=false;       // empty space }   // returns -1 if no space found,  //otherwise it returns   0<=i<N for a valid space.  int FindSpace(int PlateNumber, bool parking[], int N) {       // ?????                                    }    main() {  EmptyTheLot(parking, N);    // start with an empty parking garage. // get plate numbers and fill lot.  }

Please help with this lisp function and provide photos so it's easier to read the code

Transcribed Image Text Develop a C++ code to computer the queries in X Y z format where you are given a list of size m. For computing queries, you have to perform the task to find the number which is occurring one after another in the sub-list [X Y] greater than or similar to z times. If there doesn't exist no number satisfying the given criteria then output “Not possible" other than that output the answer computed to the given queries. Test Case Result 4 1 2133 121

C++ Code:  Write a program that finds word differences between two sentences. The input begins with an integer indicating the number of words in each sentence. The next input line is the first sentence and the following input line is the second sentence. Assume that the two sentences have the same number of words and no more than 20 words each. The program displays word pairs that differ between the two sentences. One pair is displayed per line. Ex: If the input is: 6 Smaller cars get better gas mileage Tiny cars get great fuel economy then the output is: Smaller Tiny better great gas fuel mileage economy Add a function named ReadSentences to read the input sentences into two string vectors. void ReadSentences(vector<string>& sentence1Words, vector<string>& sentence2Words, int wordCount) main() already contains code to read the word count and call ReadSentences(). Complete main() to display differing word pairs.