Detail Form
We will send your result on your email id and phone no. please fill detail
You are given an array of \(n\) elements as follows:
You need to find the maximum possible xor sum of any good subsequence of array\(A \).
Note: A subsequence \(S\) is defined as good if the following condition is satisfied:
For every present in is also present in
Input format
Output format
Constraints
Write a C++ program that will prompt the user to input ten integer values. The program will display the smallest and greatest of those values.
A sample output is shown below:
Enter 10 integer values
value 1: 10
value 2: 10
value 3: 20
value 4: 5
value 5: 1
value 6: 30
value 7: 24
value 8: 41
value 9: 20
value 10: 10
Greatest Value = 41
Smallest Value = 1
Write a program that inputs a series of integers and passes them one at a time to function even, which determine whether an integer is even.
The function should take an integer argument and return true if the integer is even and false otherwise.
However, if 0 is entered the program should display the message
0 is neither even nor odd
Write a recursive function stringReverse that takes a character array containing a string as an argument, prints the string backwards and returns nothing. The function should stop processing and return when the terminating null character is encountered.
Example :
Input : Hello
Output : olleH