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

(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.

(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.

A(n) __________ contains 8 __________.