fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // 3
  28. // 4
  29. // 51 71 17 42
  30. // 3
  31. // 42 33 60
  32. // 3
  33. // 51 32 43 
  34.  
  35.  
  36.  
  37.  
  38. vector<int> a;
  39.  
  40. int digitSum(int x){
  41. 	int sum = 0;
  42. 	while(x){
  43. 		sum += x%10;
  44. 		x /= 10;
  45. 	}
  46. 	return sum;
  47. }
  48.  
  49. int consistency(int n) {
  50.  
  51. 	unordered_map<int,int>mp;
  52.  
  53. 	int ans = -1;
  54. 	for(int i=0; i<n; i++){
  55. 		int sum = digitSum(a[i]);
  56.  
  57. 		if(mp.count(sum)){
  58. 			ans = max(ans, a[i] + mp[sum]);
  59. 		}
  60. 		mp[sum] = max(mp[sum], a[i]);
  61. 	}
  62.  
  63.  
  64. 	return ans;
  65.  
  66. }
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77. int practice(int n){
  78.  
  79.  
  80. 	return 0;
  81. }
  82.  
  83.  
  84.  
  85. void solve() {
  86.  
  87.     int n;
  88.     cin >> n;
  89.  
  90.     a.resize(n);
  91.     for(int i=0; i<n; i++) cin >> a[i];
  92.  
  93.     cout << consistency(n) << endl ;
  94.  
  95. }
  96.  
  97.  
  98.  
  99.  
  100.  
  101. int32_t main() {
  102.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  103.  
  104.     int t = 1;
  105.     cin >> t;
  106.     while (t--) {
  107.         solve();
  108.     }
  109.  
  110.     return 0;
  111. }
Success #stdin #stdout 0.01s 5268KB
comments (?)
stdin
copy 
3
4
51 71 17 42
3
42 33 60
3
51 32 43
stdout
copy 
93
102
-1
https://ideone.com/q1otsg
language:
C++14 (gcc 8.3)
created:
2 hours 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!