given a string of integers, write a program to generate an output string as follow 1)from the input ints, filter the integers that are perfect squeares 2)for each perfect square obtained from step 1 find its factorial, if the factorial of the numb is trailing by zeros, three digits present before the trailing zeros shoud be appended to output string if not trailing by zeros append last three digits to output string if there is ad receding zero it is ignored a) if the num is 2 it does not have any trailing zeros and there is only on digit in it append 2 output b) if the num is 5 it has one trailing zero and before the trailing zero there are only two present so append 12 to output d) if the num is 9 it has one trailing zero before railing zero there are 5 digits so append e) if the num is 12 then ......

given a string of integers, write a program to generate an output string as follow 1)from the input ints, filter the integers that are perfect squeares 2)for each perfect square obtained from step 1 find its factorial, if the factorial of the numb is trailing by zeros, three digits present before the trailing zeros shoud be appended to output string if not trailing by zeros append last three digits to output string if there is ad receding zero it is ignored a) if the num is 2 it does not have any trailing zeros and there is only on digit in it append 2 output b) if the num is 5 it has one trailing zero and before the trailing zero there are only two present so append 12 to output d) if the num is 9 it has one trailing zero before railing zero there are 5 digits so append e) if the num is 12 then ......

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

Read string integer value pairs from input until "Done" is read. For each string read: • If the following integer read is less than 40, output the string followed by ": low on stock". • Otherwise, output the string followed by ": well stocked". End each output with a newline. Ex: If the input is Oven 43 Curtain 7 Pillow 1 Done, then the output is: Oven: well stocked Curtain: low on stock Pillow: low on stock 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 8 9 10 } * Your code goes here */ return 0;
Find given two strings are same or not. If same print 0 lese print 1. String must be case sensitive. Example: s1:data S2: data Output:0 S1:Data S2:data Output:1
C Programming That One Digit by CodeChum Admin Make me a program that accepts a random string (a series of characters). Then, look for a digit from that string and if there's at least one, print out "That one!" but if there's none, print out "No one..." I know this is too sudden to ask you, but thank you in advance! Tip: After your scan for the size, add a space after the placeholder like this so that the newline character directly after the number won't be scanned as one of the characters: scanf("%d ", &size); Input 1. Size of the string 2. Characters of the string Output The first line will contain a message prompt to input the size of the string. The second line will prompt for the characters of the string. The last line contains the appropriate string. Enter·the·size:·18 Enter·the·characters:·CodeChum1sAwesome! That·one!
Longest String You are given S consisting of only 0 and 1 An integer X Input: The first line contains an integer T denoting the number of the test cases. For each test case , first line contains a string S. The secind line contains an integer X Output. For each test case print an integer number in a new line representing the legth of the longest subsequences of string S. Sample input: 1 111011100 100 Sample output: 7
Create a program that takes in a sentence from user input, the program then removes the last word and first word in the sentence. The remaining string is converted to upper case then printed out. [Hint: In case there is only two words, an empty line is printed] Sample run 1: Sample run 2: Enter a sentence: Hello There Enter a sentence: Happy Thursday Everyone Output: Output: THURSDAY
Write a program that will take the string "Complication" and concatenate each successive letter, appending it to the existing string until the word is finished, The output should be as follows: C Co Com Comp Compl Compli Complic Complica Complicat Complicati Complicatio Complication Perform the program using a for and a while loop.
Given a string on one line and an integer number on a second line, add a copy of the last number of characters of the string to the string's end. Then, output the result. Ex: If the input is: Fuzzy bear 4 the output is: Fuzzy bearbear Note: Using a pre-defined string function, the solution can be just one line of code. #include <iostream>#include <string>using namespace std; int main() { string strVar; int substrLen; getline(cin, strVar); cin >> substrLen; /* Your code goes here */ cout << strVar << endl; return 0;}
Rearrange Numbers in String Given a string, write a program to re-arrange all the numbers appearing in the string in decreasing order. Note: There will not be any negative numbers or numbers with decimal part. Input The input will be a single line containing a string. Output The output should be a single line containing the modified string with all the numbers in string re-ordered in decreasing order. Explanation For example, if the given string is "I am 5 years and 11 months old", the numbers are 5, 11. Your code should print the sentence after re-ordering the numbers as "I am 11 years and 5 months old". sample input: I am 5 years and 11 months old sample output: I am 11 years and 5 months old Note: please solve this question along with hidden test case
Question R .IN JAVA Print string in reverse Write a program that takes in a line of text as input, and outputs that line of text in reverse. The program repeats, ending when the user enters "Done", "done", or "d" for the line of text. Ex: If the input is: Hello there Hey done the output is: ereht olleH yeH Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
1. From a given string, print the string in all uppercase if the number of uppercase letters is more than lowercase letters. Otherwise, if lowercase is greater or equal to uppercase letters, print all lowercase. The inputs will contain letters (A-Z, a-z) only. Sample Input Sample Output HOusE HOUSE ApplE apple BaNaNa banana
Input: a string in a line. ➢ Output: Print the pattern and the repeated count if there is a repeated pattern, Print "none" otherwise. ➢ Task: Design an algorithm in pseudocode/code to for the problem and write down the Algorithm analysis. The complexity of the algorithm must be in O(n). ➢ PS: You use the algorithm for string matching taught in class. The repeated pattern is valid only from the first character.
1. a Write a regular expression for the set of binary strings where each string has at least one pair of consecutive zeros. b. write the regular expression for the following, where sigma = (a,b): i. string of length at least 2 ii. string of length at most 2 iii. all string starting with a and ending with b iv. Even length Strings