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<int> a;
  31.  
  32. int consistency(int n){
  33.  
  34. int res = pow(2, n);
  35. for(int i=1; i<=n/2-1; i++){
  36. res += pow(2, i);
  37. }
  38.  
  39. for(int i=n/2; i<=n-1; i++){
  40. res -= pow(2, i);
  41. }
  42.  
  43.  
  44. return res;
  45. }
  46.  
  47.  
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61. int practice(int n){
  62.  
  63.  
  64. return 0;
  65. }
  66.  
  67.  
  68.  
  69.  
  70.  
  71. void solve() {
  72.  
  73. int n;
  74. cin>> n;
  75.  
  76.  
  77. cout << consistency(n) << endl;
  78.  
  79.  
  80. }
  81.  
  82.  
  83.  
  84.  
  85.  
  86. int32_t main() {
  87. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  88.  
  89. int t = 1;
  90. cin >> t;
  91. while (t--) {
  92. solve();
  93. }
  94.  
  95. return 0;
  96. }
Success #stdin #stdout 0.01s 5328KB
stdin
4
2
6
4
8
stdout
2
14
6
30