×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
Write a program To find sum of two integers without using ‘+’ operator.Take the numbers as p and q.
INPUT 1: -2,-3
OUTPUT 1:-5
INPUT 2: 30,20
OUTPUT 2: 50
INPUT 3: 1000 ,200
OUTPUT 3: 1200
INPUT 4 : 5 , 2.6
OUTPUT 4: 7
INPUT 5: 1000,5
OUTPUT 5: 1005
INPUT 1: -2,-3
OUTPUT 1:-5
INPUT 2: 30,20
OUTPUT 2: 50
INPUT 3: 1000 ,200
OUTPUT 3: 1200
INPUT 4 : 5 , 2.6
OUTPUT 4: 7
INPUT 5: 1000,5
OUTPUT 5: 1005
2.
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
- First line: Integer
denoting the size of the array
- Second line:
space-separated integers denoting elements of the array
Output format
- Print a single integer denoting the maximum xor-sum of any good subsequence.
Constraints
3.
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