0o.9. """ n a positive integer N, find and return the longest distance between two consecutive 1' in the binary representation of N. If there are not two consecutive 1's, return 0 For example: Input: 22 Output: 2 Explanation: 22 in binary is 10110 In the binary representation of 22, there are three ones, and two consecutive pairs of 1's. The first consecutive pair of 1's have distance 2. The second consecutive pair of 1's have distance 1. The answer is the largest of these two distances, which is 2 """

0o.9. """ n a positive integer N, find and return the longest distance between two consecutive 1' in the binary representation of N. If there are not two consecutive 1's, return 0 For example: Input: 22 Output: 2 Explanation: 22 in binary is 10110 In the binary representation of 22, there are three ones, and two consecutive pairs of 1's. The first consecutive pair of 1's have distance 2. The second consecutive pair of 1's have distance 1. The answer is the largest of these two distances, which is 2 """

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

.CLO1.1:Simplify this function F(A,B,C,D)= E (0,2,4,6), given that d(A,B,C,D)= E (8,10,12,14) 'D A O 'B .B O C'D' + CD .C O 'C.D O
Q1: Write a program for 2x2 matrix in 2D using for loop where user input any four integers Q2: Write a program for pseudo- random where user input and obtain three different numbers
Q3: Interplanetary Spaceflight Milan Tusk is the richest person in the universe. After devoting decades of his life to further our space exploration technologies, he’s finally ready to retire. Being a space enthusiast, the first thing he wants to do is visit n planets p1, p2, …, pn, in this order. He’s currently on planet p0. Milan knows that the distance between planets pi and pi + 1 (for 0 ≤ i < n) is d[i]light years. His spaceship uses 1 tonne of fossil fuels per light year. He starts with a full tank and can fill up his tank at any of the n planets (but he must not run out in between two planets). There’s a huge cost to set up the spaceship for refuelling. Due to financial constraints (he’s not THAT rich), he can fill up his tank at most ktimes. In order to save money and make his spaceship lighter, Milan is looking for the smallest possible fuel tank that enables him to complete his space travel and reach planet pn. What is the smallest tank capacity that enables him to do so?…
CSE Python LAB: Question 2} You initially start with a binary string S0 which is of length N and has all 0s. You are then given U updates, which keep transforming the string. The i-th update transforms the string Si-1 into Si, and hence after all the U updates you will be left with SU. A single update is of the form (Li, Ri), which means that all the 1s in the range [Li, Ri] (both end points included) should be changed into 0s, and all the 0s in that range should be changed to 1s. You need to find out which among the U+1 binary strings: S0, S1, .., SU, is lexicographically the largest, and print that string. You have to develop a python program that output a single line containing one binary string Sample Input: 10 10 9 10 6 10 9 10 1 8 3 5 3 3 3 4 3 9 4 8 7 7 Sample Output: 1111100011
Lonely Ones Binary ones (1) can get lonely if only zeros (0) surround them. Formally, we call such 1's "sparse". A number is defined as sparse if its binary representation has no two consecutive bits set. You are given an integer N and your task is to find out if it is sparse or not. Input The input contains an integer N. Output Print '1' if the number is sparse and '0' if the number is not sparse. Constraints 1 <= N <= 1018 Example #1 Input 36 Output 1 Explanation: The binary representation of 36 is 100100. There are no consecutive ones present in this. So it is a sparse number. Example #2
1 # Given an encoded string, return it's decoded string. 234 5 6 18 7 8 9 10 # Furthermore, you may assume that the original data does not contain any 11 #digits and that digits are only for those repeat numbers, k. 12 # For example, there won't be input like 3a or 2[4]. 13 14 15 16 #s="3[a]2[bc]", return "aaabcbc". 17 # S = "3[a2[c]]", return "accaccacc". 19 20 21 22 23 24 25 26 27 28 18 #s="2[abc]3[cd]ef", return "abcabccdcdcdef". 29 30 31 32 # The encoding rule is: k[encoded_string], where the encoded_string # inside the square brackets is being repeated exactly k times. # Note that k is guaranteed to be a positive integer. 33 34 35 36 # You may assume that the input string is always valid; No extra white spaces, # square brackets are well-formed, etc.. 37 20 # Examples: def decode_string(s): www :type s: str :rtype: str stack = []; cur_num= 0; cur_string for c in s: if c == '[': stack.append((cur_string, cur_num)) cur_string cur_num = 0 elif c == '1': prev_string, num = stack.pop()…
code in java pls Summary: Given integer values for red, green, and blue, subtract the gray from each value. Computers represent color by combining the sub-colors red, green, and blue (rgb). Each sub-color's value can range from 0 to 255. Thus (255, 0, 0) is bright red, (130, 0, 130) is a medium purple, (0, 0, 0) is black, (255, 255, 255) is white, and (40, 40, 40) is a dark gray. (130, 50, 130) is a faded purple, due to the (50, 50, 50) gray part. (In other words, equal amounts of red, green, blue yield gray). Given values for red, green, and blue, remove the gray part. Ex: If the input is: 130 50 130 the output is: 80 0 80 Find the smallest value, and then subtract it from all three values, thus removing the gray.
le.com/forms/d/e/1FAlpQLSc6PlhZGOLJ4LOHo5cCGEf9HDChfQ-tT1bES-BKgkKu44eEnw/formResponse The following iterative sequence is defined for the set of positive integers: Sn/2 3n +1 ifn is odd if n is even Un = Using the rule above and starting with 13, we generate the following sequence: 13 u13 = 40 u40 =20 u20 = 10→ u10 =5 u5 = 16 u16 = 8 ug = 4 → Us =2 u2 =1. It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. The below function takes as input an integer n and returns the number of terms generated by the sequence starting at n. function i-Seq (n) u=n; i=%3; while u =1 if statement 1 u=u/2; else statement 2 end i=i+1; end statement 1 and statement 2 should be replaced by: None of the choices statement 1 is "mod(u,2)=D%3D0" and statement 2 is "u = 3*u+1;" statement 1 is "u%2" and statement 2 is "u = 3*u+1;" O statement 1 is "mod(n,2)=30" and statement 2 is "u = 3*n+1;"
def 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__…
del(int n){ j=(n/3)-1 while (n>0) for(i=n to i=j*3){ print "i"; 5. n--; }//end for 7 j=j/3; }//endwhile }//del() what is the asymptotic run time of del? anyalse each line and what is teh final run time is teh answer O(n^2/3)?
: The set of all strings from b(b+c)* are * {cb,bbc,bcc,} O {b,bb,bc,bbb,bcc,..} O {b,ab,bc,..} O None of the above O
اجب :ما هو إخراج البرنامج التالي عندما 3=m و 3=n؟ n=input ('enter n:); m=input('enter m:'); for i-1:n for j=1:m result(ij)=i^j; end end disp(result);