Tag sudah ada dengan nama cabang yang disediakan. Banyak perintah Git menerima nama tag dan cabang, jadi membuat cabang ini dapat menyebabkan perilaku yang tidak diharapkan. Anda yakin ingin membuat cabang ini?
Kita dapat dengan mudah melakukan ini dengan menelusuri semua bit hasil dan menyetel setiap bit hasil seperti yang diceritakan di atas. Implementasi dilakukan dengan mempertimbangkan angka sebagai bilangan bulat 32-bit
Implementasi C++
int getXOR(int x, int y) { int ans = 0; for (int i = 0; i <= 31; i++) { if (((1 LL << i) & x) != ((1 LL << i) & y)) { ans |= (1 LL << i); } } return ans; }Implementasi Jawa
public static int getXOR(int x, int y) { int res = 0; for (int i = 0; i <= 31; i++) { if (((1 << i) & x) != ((1 << i) & y)) { res |= (1 << i); } } return res; }_Implementasi Python
def getXOR(x, y): res = 0 for i in range(32): if ((1 << i) & x) != ((1 << i) & y): res |= 1 << i return resAnalisis Kompleksitas
- Kompleksitas Waktu. O(log2(n))
- Kompleksitas Ruang. O(1)
Pendekatan 2 (Menggunakan operator bitwise lainnya)
Kami dapat mengoptimalkan solusi di atas dengan mensimulasikan operasi XOR tanpa menggunakan for loop sebagai berikut
472472 4729473047314732473147344731________3______36 ________3______37
472472 4740
472
4724743
47444745
479// A Simple C++ program to compute2
// A Simple C++ program to compute_2
47_49
Python3
47_50
47_51
47_52
47_53
4754 4755
________3______947574758 std;0 4760
4794762
4794764
________3______9Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 47674768 4769Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9std;04772
472
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 47764768 476947794780 47094772
47_7
________3______747574758 47574780 4789
47_7
479// A Simple C++ program to compute0 4757
47_9
47_95
47964758 47984730473147324731473_______344731________3______36 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 06
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 074758 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 09Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 10
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 11Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 12
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 _13
C#
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 _14
// sum of bitwise OR of all pairs
using Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 17
#include <bits/stdc++.h>7 #include <bits/stdc++.h>8
47_9
47_7
479470
479471
________3______9using6 472 473472 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 31472 477
479________3______8
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 2
472472 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 1
47_9
472std;4
472std;6
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9472 471
477Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9472 476
4711478
47_9
472// A Simple C++ program to compute0 // A Simple C++ program to compute1
479// A Simple C++ program to compute2
479// A Simple C++ program to compute3
4794722 using6 4724 ________39______70
47_9
472472 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 74
472472 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 77
472
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 80
4744Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 82
479// A Simple C++ program to compute2
// A Simple C++ program to compute_2
47_49
PHP
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 _87
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 _88
// sum of bitwise OR of all pairs
470
471
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 92 473Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 944731Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 96Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 97
478
47_9
479Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 2
4794703 4704
4794706
4794708
479Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 6
________3______9Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 94714 47044714 4717Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 96std;1________3______14________3______21
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 94725 47584714 47284725 _______________17____39___47_____56111111117_________________________________________________________________________________________________________________________________________________________________________________________________________________________
________3______74703 4737Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 94________3______9847144741Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 944798________3______2547_45
479// A Simple C++ program to compute0 4703std;1
// A Simple C++ program to compute_2
4794752
________3______9Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 94 475847564757
________3______9Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 96 47584761Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 944764
________3______94766 473Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 944731Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 964771
47_72
JavaScript
47_73
4794775
479// sum of bitwise OR of all pairs
479470
479471
479________3______83
4724785Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 2
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 4
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 6
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 4793
477Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 4796
4711478
472// A Simple C++ program to compute0 // A Simple C++ program to compute1
479// A Simple C++ program to compute2
479// A Simple C++ program to compute3
479// A Simple C++ program to compute07
479// A Simple C++ program to compute09
479// A Simple C++ program to compute11
479// A Simple C++ program to compute13
// A Simple C++ program to compute_14
// A Simple C++ program to compute_15
Keluaran
47Solusi Efisien
Solusi Efisien dapat menyelesaikan masalah ini dalam O(n) waktu. Asumsinya di sini adalah bilangan bulat direpresentasikan menggunakan 32 bit
Solusi yang dioptimalkan adalah dengan mencoba manipulasi bit. Untuk mengimplementasikan solusi, kami mempertimbangkan semua bit yang 1 dan yang 0 dan menyimpan hitungannya dalam dua variabel berbeda. Selanjutnya gandakan hitungan tersebut bersama dengan pangkat 2 yang dinaikkan ke posisi bit tersebut. Lakukan ini untuk semua posisi bit angka. Jumlah mereka akan menjadi jawaban kami
Bagaimana ini benar-benar bekerja?
Misalnya, lihat bit paling kanan dari semua angka dalam larik. Misalkan angka memiliki 0-bit paling kanan, dan angka b memiliki 1-bit. Kemudian dari pasangan, a*b dari mereka akan memiliki 1 di bit paling kanan dari XOR. Ini karena ada cara a*b untuk memilih satu angka yang memiliki 0-bit dan yang memiliki 1-bit. Oleh karena itu, bit-bit ini akan berkontribusi a*b terhadap total semua XOR
Secara umum, ketika melihat bit ke-n (di mana bit paling kanan adalah ke-0), hitung berapa banyak angka yang memiliki 0 (sebut ini an) dan berapa banyak yang memiliki 1 (sebut bn ini). Kontribusi terhadap jumlah akhir akan menjadi an*bn*pow(2,n). Anda perlu melakukan ini untuk setiap bit dan menjumlahkan semua kontribusi ini bersama-sama
Ini dapat dilakukan dalam waktu O(kn), di mana k adalah jumlah bit dalam nilai yang diberikan
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12BPK
// A Simple C++ program to compute_16
// sum of bitwise OR of all pairs
#include <bits/stdc++.h>
using namespace std;
470
471
// A Simple C++ program to compute24 // A Simple C++ program to compute24 472 // A Simple C++ program to compute27472 475472 477
478
________3______9// A Simple C++ program to compute24 // A Simple C++ program to compute24 472 // A Simple C++ program to compute37
479Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9472 // A Simple C++ program to compute42
479________3______8
472// A Simple C++ program to compute46
472472 // A Simple C++ program to compute49
472
472// A Simple C++ program to compute52
472// A Simple C++ program to compute24 // A Simple C++ program to compute24 472 // A Simple C++ program to compute57
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9472 ________559______62
472478
477// A Simple C++ program to compute66 // A Simple C++ program to compute67
4711// A Simple C++ program to compute69
477// A Simple C++ program to compute71
4711// A Simple C++ program to compute73
477// A Simple C++ program to compute75
472// A Simple C++ program to compute2
472
472// A Simple C++ program to compute80
472// A Simple C++ program to compute82
472// A Simple C++ program to compute84
472// A Simple C++ program to compute86
479// A Simple C++ program to compute2
479// A Simple C++ program to compute0 // A Simple C++ program to compute91
// A Simple C++ program to compute_2
472 // A Simple C++ program to compute5
478
________3______9// A Simple C++ program to compute24 // A Simple C++ program to compute24 472 // A Simple C++ program to compute37
479472 // A Simple C++ program to compute9
________3______9472 // sum of bitwise OR of all pairs2// sum of bitwise OR of all pairs3// sum of bitwise OR of all pairs4// sum of bitwise OR of all pairs3// sum of bitwise OR of all pairs6
479// sum of bitwise OR of all pairs12
479// sum of bitwise OR of all pairs14
479// A Simple C++ program to compute0 #include <bits/stdc++.h>1
// A Simple C++ program to compute_2
Jawa
// sum of bitwise OR of all pairs_19
// sum of bitwise OR of all pairs
#include <bits/stdc++.h>5 #include <bits/stdc++.h>6
#include <bits/stdc++.h>7 #include <bits/stdc++.h>8
47_9
479470
479471
________3______9using6 // A Simple C++ program to compute24 // A Simple C++ program to compute27472 475472 477
479________3______8
472// A Simple C++ program to compute24 // sum of bitwise OR of all pairs42std;0std;1
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9472 4701std;0// sum of bitwise OR of all pairs51// sum of bitwise OR of all pairs52// sum of bitwise OR of all pairs53
472478
477// sum of bitwise OR of all pairs57
477472 // sum of bitwise OR of all pairs60std;0// sum of bitwise OR of all pairs62std;0std;1
47_7
477// A Simple C++ program to compute52
477// A Simple C++ program to compute24 // sum of bitwise OR of all pairs70std;0std;1
47_7
________3______7Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9472 // sum of bitwise OR of all pairs78std;04710
477478
4711// A Simple C++ program to compute66 // sum of bitwise OR of all pairs85// sum of bitwise OR of all pairs86 // sum of bitwise OR of all pairs87std;0Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 97
________56447_559_______69
// sum of bitwise OR of all pairs_90
4711// A Simple C++ program to compute71
________56447_559_______73
4711// sum of bitwise OR of all pairs98// sum of bitwise OR of all pairs86std;1
477// A Simple C++ program to compute2
47_7
477// A Simple C++ program to compute80
477#include <bits/stdc++.h>074709 #include <bits/stdc++.h>09
47_9
477#include <bits/stdc++.h>12
477// A Simple C++ program to compute86
472// A Simple C++ program to compute2
472// A Simple C++ program to compute0 // A Simple C++ program to compute91
479// A Simple C++ program to compute2
47_9
4794752
________3______94722 using6 4724 #include <bits/stdc++.h>29
479________3______8
472// A Simple C++ program to compute24 // sum of bitwise OR of all pairs42std;0std;1
472472 4729473047314732473147344731________3______36 ________3______37
472472 4740
472
472// sum of bitwise OR of all pairs12
472#include <bits/stdc++.h>55
479// A Simple C++ program to compute2
// A Simple C++ program to compute_2
#include <bits/stdc++.h>_59
Python3
#include <bits/stdc++.h>_60
#include <bits/stdc++.h>_61
47_52
47_53
4754 #include <bits/stdc++.h>65
47_9
479#include <bits/stdc++.h>68 4758 std;0
________3______9Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 47674768 ________3______69Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9std;0473_______31// sum of bitwise OR of all pairs52________566______80
472#include <bits/stdc++.h>82
472#include <bits/stdc++.h>844758 std;0
472#include <bits/stdc++.h>884758 std;0
#include <bits/stdc++.h>_91
472#include <bits/stdc++.h>93
472#include <bits/stdc++.h>954758 std;0
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 47764768 4769Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9std;0using05
________3______7// A Simple C++ program to compute66 using08using09 // sum of bitwise OR of all pairs86 47584758 std;0#include <bits/stdc++.h>80
4711#include <bits/stdc++.h>844758 #include <bits/stdc++.h>844780 4709
47_11
477// A Simple C++ program to compute71using24
4711#include <bits/stdc++.h>884758 #include <bits/stdc++.h>884780 4709
477using324758 472using08using36 // sum of bitwise OR of all pairs86Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 97
472
#include <bits/stdc++.h>_91
472using42
472#include <bits/stdc++.h>954758 #include <bits/stdc++.h>88using47 #include <bits/stdc++.h>84using47 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 94709 using52
using_53
472using55
472#include <bits/stdc++.h>68 4758 #include <bits/stdc++.h>68 4780 using61
47_9
479// A Simple C++ program to compute0 #include <bits/stdc++.h>68
using_66
#include <bits/stdc++.h>68 4758 std;0
47964758 using724730________3______314732473147344731________3______36 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 06
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 074758 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 09Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 10
#include <bits/stdc++.h>68 4758 using87
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 11 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9#include <bits/stdc++.h>68Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 97
using_92
C#
using_93
// sum of bitwise OR of all pairs
using Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 17
#include <bits/stdc++.h>7 #include <bits/stdc++.h>8
47_9
479470
479471
________3______9using6 // A Simple C++ program to compute24 // A Simple C++ program to compute27472 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 31472 477
479________3______8
472// A Simple C++ program to compute24 // A Simple C++ program to compute37
472Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9472 ________559______42
472478
477// sum of bitwise OR of all pairs57
477472 // A Simple C++ program to compute49
47_7
477// A Simple C++ program to compute52
477// A Simple C++ program to compute24 // A Simple C++ program to compute57
47_7
477Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 9472 // A Simple C++ program to compute62
477478
4711// A Simple C++ program to compute66 // A Simple C++ program to compute67
________56447_559_______69
// sum of bitwise OR of all pairs_90
4711// A Simple C++ program to compute71
________56447_559_______73
4711// A Simple C++ program to compute75
477// A Simple C++ program to compute2
47_7
477// A Simple C++ program to compute80
477// A Simple C++ program to compute82
47_9
477#include <bits/stdc++.h>12
477// A Simple C++ program to compute86
472// A Simple C++ program to compute2
472// A Simple C++ program to compute0 // A Simple C++ program to compute91
479// A Simple C++ program to compute2
47_9
4794752
________3______94722 using6 4724 namespace81
479________3______8
472// A Simple C++ program to compute24 // A Simple C++ program to compute37
472472 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 74
472472 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 77
472
472// sum of bitwise OR of all pairs12
472namespace97
479// A Simple C++ program to compute2
// A Simple C++ program to compute_2
std;_01
PHP
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 _87
std;_03
// sum of bitwise OR of all pairs
470
471
Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 92 // A Simple C++ program to compute27Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 944731Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 96Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 97
478
479std;15 4704
________3______9Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 8 Explanation : arr[] = { 7, 3, 5 } 7 = 1 1 1 3 = 0 1 1 5 = 1 0 1 For bit position 0 : Bits with zero = 0 Bits with one = 3 Answer = 0 * 3 * 2 ^ 0 = 0 Similarly, for bit position 1 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 1 = 4 Similarly, for bit position 2 : Bits with zero = 1 Bits with one = 2 Answer = 1 * 2 * 2 ^ 2 = 8 Final answer = 0 + 4 + 8 = 12 94714 47044714 std;2347144721
479________3______8
472// sum of bitwise OR of all pairs57
472std;31 4704std;33 4704
472
472std;37
472std;39
472std;41 4758std;33 using47std;31 std;8847144764