fork download
  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.  
  28.  
  29.  
  30. vector<string> a;
  31.  
  32. string consistency(int n){
  33.  
  34. int odds = 0;
  35. for(int i=0; i<n; i++){
  36. int even = 0;
  37. for(int j=0; j<a[i].size(); j++){
  38. int val = a[i][j];
  39. if( !(val & 1) ) even++;
  40. }
  41. if(even == 0) odds++;
  42.  
  43. }
  44. if( (odds & 1)) return "odd";
  45. return "even";
  46.  
  47. }
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63. string practice(int n){
  64.  
  65.  
  66. return 0;
  67. }
  68.  
  69.  
  70.  
  71.  
  72.  
  73. void solve() {
  74.  
  75. int n;
  76. cin>> n;
  77.  
  78. a.resize(n);
  79. for(int i=0; i<n; i++) cin >> a[i];
  80.  
  81. cout << consistency(n) << endl;
  82.  
  83.  
  84. }
  85.  
  86.  
  87.  
  88.  
  89.  
  90. int32_t main() {
  91. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  92.  
  93. int t = 1;
  94. cin >> t;
  95. while (t--) {
  96. solve();
  97. }
  98.  
  99. return 0;
  100. }
Success #stdin #stdout 0s 5320KB
stdin
3
2
abc abcd
2
ac abcd
2
ac ac
stdout
even
odd
even