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

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

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

1/ A Cuii number is the one whose digit sum is 17. Find out KthCuii number. K is an integer given as input and 1 <= K <= 1000. Sample Input Sample output 1 89 10 359 2 98 3 179 Here in the first case digit sum of 89 is 8 + 9 = 17. The first 5 cuii numbers are: 89, 98, 179, 188 and 197. 2/ You are given EEE and Programming marks of N students. Determine the highest total marks among them. Fist line contains an integer value N. Each of the next N lines contain two values X and Y (X is the EEE mark, Y is the Programming marks). Sample Input Sample output 5 70 80 100 90 95 95 100 80 60 50 190
Given a number n, identify and print which in the given set of numbers are factors of n. Should there be no factors listed in the set of numbers, print "I'm alone". For example, given the number 36 and the set of numbers 2, 3, 5, 7, 12. Only print the numbers which are factors of 36, which are 2, 3, 12. Input The first line contains the number n; The second line contains how many numbers there are in the set of numbers; The third line contains the set of numbers. INPUT: 36 5 2·3·5·7·12 Output The set of numbers that are factors of n separated by a new line in order of appearance. If there are none, print "I'm alone" OUTPUT: 2 3 12
Encryption is commonly used to disguise messageson the internet. A Caesar cipher performs a shift ofall of the characters in a string (based on their ASCIIvalues, see Table 2.1), e.g.h e l l o → m j q q tThe example shows a shift with a distance of 5characters, i.e. h(ASCII:104) → m(ASCII:109)Write a C/C++ program that asks the user to input aline of plaintext and the distance value and outputsan encrypted text using a Caesar cipher, with theASCII values range from 0 through 127. Useunderscores (ASCII: 95) to represent spacecharacters.Underscore characters should not be encrypted,and any character that is encrypted may notbecome an underscore. In this case, the charactershould be changed to the next character in theASCII table.The program should work for any printablecharacters.NB: No strings (datatype) or library functions maybe used.See Figure 2.1 for example output.
Q12,. A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers. Given a string s, return true if it is a palindrome, or false otherwise. Example 1: Input: s = "A man, a plan, a canal: Panama" Output: true Explanation: "amanaplanacanalpanama" is a palindrome. Example 2: Input: s = "race a car" Output: false Explanation: "raceacar" is not a palindrome..
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
Computer Science A code C runs T seconds to obtain results for an input of size S. How to find the order of runtime for the code Cfor given pairs. Hint the answer is a formula that uses logarithm.(a) (S1,T1), (S2,T2)?(b) (S1,T1), (S2,T2), (S3, T3)?
I'm running a 5-star restaurant and I can only have the best items on my menu. My menu offers 6 items, each represented by a number from 1-6. If an item on my menu does not sell or does not sell that much compared to others, I must act and replace it with something that sells! Identify which dishes do not sell. If every dish sells, print the set of dishes that were ordered least. Input: A single line containing the dish number that were ordered. Treat as one number. INPUT: 156356231 Output: The list of dishes not ordered in numerical order. If every dish sells, print the set of dishes that were ordered least. Separate each number with a new line. OUTPUT: 4
It's Gary's birthday today and he has ordered his favourite square cake consisting of '0's and '1's . But Gary wants the biggest piece of '1's and no '0's . A piece of cake is defined as a part which consist of only '1's, and all '1's share an edge with each other on the cake. Given the size of cake N and the cake, can you find the count of '1's in the biggest piece of '1's for Gary ?Input Format :The first line of input contains an integer, that denotes the value of N. Each of the following N lines contain N space separated integers.Output Format :Print the count of '1's in the biggest piece of '1's, according to the description in the task.Constraints :1 <= N <= 1000Time Limit: 1 secSample Input 1:21 10 1Sample Output 1:3 Solution: /////////////////public class Solution { static int[][] dir = { { 1, 0 }, { -1, 0 }, { 0, 1 }, { 0, -1 } }; public static int dfs(String[] edge, int n) { boolean[][] visited = new boolean[n][n]; int max = 0; for(int…
There are N students in a class. Each student got arr[i] (1 <= i <= N) marks in mathematics exam. Geek loves mathematics and he got X marks. Now geek is curious to know, how many students in his class got marks greater than that of Geek's. Input Format:The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases is as follows: The first line of each test case contains two space-separated integers N and X. The second line contains N space-separated positive integers representing array arr[ ]. Output Format:In a new line, for each test case, print the count of students who got marks greater than X.Constraints:1 <= T <= 101 <= N <= 1000001 <= arr[i], K <= 100000Example: Sample Input: 2 3 2 4 1 3 4 9 4 8 1 2 Sample Output: 2 0 Explanation: Testcase 1: Students with marks 4 and 3 got higher marks than Geek who got 2 marks.
Given string inputString on one line and integers idx1 and idx2 on a second line, output "Match found" if the character at index idx1 of inputString is equal to the character at index idx2. Otherwise, output "Match not found". End with a newline. Ex: If the input is: banana 1 3 then the output is: Match found Note: Assume the length of string inputString is greater than or equal to both idx1 and idx2. import java.util.Scanner; public class CharMatch { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); String inputString; int idx1; int idx2; inputString = scnr.nextLine(); idx1 = scnr.nextInt(); idx2 = scnr.nextInt(); /* Your code goes here */ }}
Encryption is commonly used to disguise messages on the internet. A Caesar cipher performs a shift of all of the characters in a string (based on their ASCII values, see Table 1.2), e.g. h e l l o  m j q q t The example shows a shift with a distance of 5 characters, i.e. h(ASCII:104)  m(ASCII:109) Write a Python program that ask the user to input a line of plaintext and the distance value and outputs an encrypted text using a Caesar cipher, with the ASCII values range from 0 through 127. The program should work for any printable characters.
Q1: A, B, C are three positive numbers (A<=B<=C). Given a list of seven numbers which are made of A, B, C, A+B, B+C, A+C, and A+B+C. Please find A, B and C use given seven numbers. Sample input: 2 2 11 4 9 7 9 Sample output: 2 2 7 You could use additional test case to test your program: Input: 41 19 22 38 22 19 3 Output: 3 19 19 Input: 148385247 819365820 793320372 26045448 122339799 670980573 697026021 Output: 26045448 122339799 670980573 Input: 326552445 762589144 699462434 63126710 436036699 372909989 389679155 Output: 63126710 326552445 372909989