-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathquestion32.c
97 lines (75 loc) · 1.22 KB
/
question32.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/*
http://practice.geeksforgeeks.org/problems/sum-of-bit-differences/0
Bit difference
*/
#include <stdio.h>
#include <stdlib.h>
int findDifferenceinBits(int a, int b){
// printf("finding bits for %d and %d\n", a,b);
int arr1[4], arr2[4];
int k;
for(k=0;k<4;k++){
arr1[k] = 0;
arr2[k] = 0;
}
int rem, i = 0;
// printf("for %d it is....\n",a);
while(a > 1){
rem = a%2;
arr1[i] = rem;
a = a/2;
i++;
}
arr1[i] = a;
// int l;
// for(l=0;l<4;l++){
// printf("%d ", arr1[l]);
// }
// printf("\n");
i = 0;
// printf("for %d it is....\n",b);
while(b > 1){
rem = b%2;
arr2[i] = rem;
b = b/2;
i++;
}
arr2[i] = b;
// for(l=0;l<4;l++){
// printf("%d ", arr2[l]);
// }
// printf("\n");
int sum = 0;
int j = 3;
for(i=3;i>=0;i--){
sum += abs(arr1[j] - arr2[i]);
j--;
}
return sum;
}
int sumIs(int *arr, int size){
int sum = 0;
int i,j;
for(i=0;i<size-1;i++){
for(j=i+1;j<size;j++){
sum += findDifferenceinBits(arr[i],arr[j]);
}
}
return sum*2;
}
int main(){
int cases;
int i;
scanf("%d",&cases);
for(i=0;i<cases;i++){
int n;
scanf("%d",&n);
int j;
int arr[n];
for(j=0;j<n;j++){
scanf("%d",&arr[j]);
}
printf("%d\n", sumIs(arr,n));
}
return 0;
}