-
Notifications
You must be signed in to change notification settings - Fork 0
/
A_Playoff.cpp
137 lines (129 loc) · 2.82 KB
/
A_Playoff.cpp
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
#include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace chrono;
// using namespace __gnu_pbds;
#define me Ramesh chandra pola // My full name
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define mod 1000000007
#define mod1 998244353
#define INF 1e18
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.141592653589793238462
// #define sz(x) ((ll)(x).size())
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
#define all(a) a.begin(), a.end()
// #define each(x, a) for (auto &x: a)
// #define forn(i, n) for (int i = 0; i < n; ++i)
// #define forr(i, n) for (int i = n; i >=0; --i)
#define setbits(X) __builtin_popcountll(X)
#define zerobits(X) __builtin_ctzll(X)
#define debug(x) cout << #x << "--> " << x << endl
/*---------------------------------------------------------------------------------------------------------------------------*/
ll expo(ll a, ll b, ll m)
{
ll res = 1;
while (b > 0)
{
if (b & 1)
res = (res * a) % m;
a = (a * a) % m;
b = b >> 1;
}
return res;
}
ll mminvprime(ll a, ll b) { return expo(a, b - 2, b); }
ll mod_add(ll a, ll b, ll m)
{
a = a % m;
b = b % m;
return (((a + b) % m) + m) % m;
}
ll mod_mul(ll a, ll b, ll m)
{
a = a % m;
b = b % m;
return (((a * b) % m) + m) % m;
}
ll mod_sub(ll a, ll b, ll m)
{
a = a % m;
b = b % m;
return (((a - b) % m) + m) % m;
}
ll mod_div(ll a, ll b, ll m)
{
a = a % m;
b = b % m;
return (mod_mul(a, mminvprime(b, m), m) + m) % m;
} // only for prime m (m id diff for diff problems, 10^9+7...)
// GCD
int gcd(int a, int b)
{
if (b == 0)
{
return a;
}
return gcd(b, a % b);
}
// LCM
int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
// Power under mod (a ^ b) % mod
int modpow(int a, int b, int m = mod)
{
a = a & m;
int ans = 1;
while (b)
{
if (b & 1)
{
ans = (ans * a) % m;
}
b = b >> 1;
a = (a * a) % m;
}
return ans;
}
/*--------------------------------------------------------------------------------------------------------------------------*/
void solve()
{
int n;
cin >> n;
int ans=1;
for (int i = 0; i < n; i++)
{
ans*=2;
}
ans--;
cout << ans << endl;
return ;
}
int main()
{
fastio();
int t = 1;
cin >> t;
while (t--)
{
solve();
}
return 0;
}