fork(1) download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define MOD 10000007
  4. int main() {
  5. 	long long int t,n,i,j,c;
  6. 	scanf("%lld",&t);
  7. 	c=t;
  8. 	while(t--)
  9. 	{
  10. 		long long int sum=0;
  11. 		scanf("%lld",&n);
  12. 		long long int a[n];
  13. 		for(i=0;i<n;i++)
  14. 		{
  15. 			scanf("%lld",&a[i]);
  16. 		}
  17. 		for(i=0;i<32;i++)
  18. 		{
  19. 			long long int k=0;
  20. 			for(j=0;j<n;j++)
  21. 			{
  22. 				if(a[j]&(1<<i))
  23. 				{
  24. 				k++;
  25. 				}
  26. 			}
  27. 			sum+=(2*(k)*((n-k)));
  28. 		}
  29. 		sum%=MOD;
  30. 		printf("Case %d: %lld\n",c-t+1,sum);
  31. 	}
  32. 	return 0;
  33. }
Success #stdin #stdout 0s 16064KB
comments (?)
stdin
copy 
3
3
123 2352 422
5
1 234 298 123 6798
4
79 234 700 89823984
stdout
copy 
Case 2: 36
Case 3: 112
Case 4: 116
https://ideone.com/4YWAz5
language:
C++ (gcc 8.3)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!