solution
stringlengths 53
181k
| difficulty
int64 0
13
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int BUF = 100005;
class Edge {
public:
int src, dst;
Edge() {}
Edge(int s, int d) : src(s), dst(d) {}
};
int nNode, nex[BUF];
bool isMale[BUF];
bool read() {
if (!(cin >> nNode)) return false;
for (int i = 0; i < nNode; i++) {
int maleId;
scanf("%d%d", &nex[i], &maleId);
nex[i]--;
isMale[i] = maleId == 1;
}
return true;
}
pair<int, int> rec(int curAvail, int cur, pair<int, int> dp[2][BUF],
vector<int> adj[BUF]) {
pair<int, int> &ret = dp[curAvail][cur];
if (ret != make_pair(-1, -1)) return ret;
ret = make_pair(0, 0);
if (curAvail) {
pair<int, int> sum = make_pair(0, 0);
for (int i = 0; i < adj[cur].size(); i++) {
pair<int, int> t = rec(1, adj[cur][i], dp, adj);
sum.first += t.first;
sum.second += t.second;
}
ret = sum;
for (int i = 0; i < adj[cur].size(); i++) {
pair<int, int> t = rec(1, adj[cur][i], dp, adj),
s = rec(0, adj[cur][i], dp, adj);
int boygirl = isMale[cur] != isMale[adj[cur][i]];
int fst = sum.first - t.first + s.first + 1;
int scd = sum.second - t.second + s.second + boygirl;
ret = max(ret, make_pair(fst, scd));
}
} else {
for (int i = 0; i < adj[cur].size(); i++) {
pair<int, int> t = rec(1, adj[cur][i], dp, adj);
ret.first += t.first;
ret.second += t.second;
}
}
return ret;
}
void getAns(int curAvail, int cur, pair<int, int> dp[2][BUF], vector<Edge> &ans,
vector<int> adj[BUF]) {
if (curAvail) {
int connect = -1;
pair<int, int> maxV;
pair<int, int> sum = make_pair(0, 0);
for (int i = 0; i < adj[cur].size(); i++) {
pair<int, int> t = dp[1][adj[cur][i]];
sum.first += t.first;
sum.second += t.second;
}
maxV = sum;
for (int i = 0; i < adj[cur].size(); i++) {
pair<int, int> t = dp[1][adj[cur][i]], s = dp[0][adj[cur][i]];
int boygirl = isMale[cur] != isMale[adj[cur][i]];
int fst = sum.first - t.first + s.first + 1;
int scd = sum.second - t.second + s.second + boygirl;
if (maxV < make_pair(fst, scd)) {
maxV = make_pair(fst, scd);
connect = adj[cur][i];
}
}
if (connect != -1) ans.push_back(Edge(cur, connect));
for (int i = 0; i < adj[cur].size(); i++)
getAns(adj[cur][i] == connect ? 0 : 1, adj[cur][i], dp, ans, adj);
} else {
for (int i = 0; i < adj[cur].size(); i++)
getAns(1, adj[cur][i], dp, ans, adj);
}
}
void work() {
vector<vector<Edge> > cycleList;
int visited[BUF];
bool finished[BUF];
memset(finished, 0, sizeof(finished));
memset(visited, -1, sizeof(visited));
for (int i = 0; i < nNode; i++) {
if (finished[i]) continue;
int cur = i;
while (1) {
finished[cur] = true;
visited[cur] = i;
if (finished[nex[cur]]) {
if (visited[nex[cur]] == i) {
cycleList.push_back(vector<Edge>());
cycleList.back().push_back(Edge(cur, nex[cur]));
int t = nex[cur];
while (t != cur) {
cycleList.back().push_back(Edge(t, nex[t]));
t = nex[t];
}
}
break;
}
cur = nex[cur];
}
}
vector<int> adj[BUF];
for (int i = 0; i < nNode; i++) adj[nex[i]].push_back(i);
pair<int, int> num = make_pair(0, 0);
vector<Edge> ans;
static pair<int, int> dp[2][2][BUF];
memset(dp, -1, sizeof(dp));
for (int i = 0; i < cycleList.size(); i++) {
int src = cycleList[i][0].dst, dst = cycleList[i][0].src;
adj[src].erase(find(adj[src].begin(), adj[src].end(), dst));
pair<int, int> A = rec(1, dst, dp[0], adj);
adj[src].push_back(dst);
src = cycleList[i][1].dst, dst = cycleList[i][1].src;
adj[src].erase(find(adj[src].begin(), adj[src].end(), dst));
pair<int, int> B = rec(1, dst, dp[1], adj);
adj[src].push_back(dst);
if (A > B) {
num.first += A.first;
num.second += A.second;
src = cycleList[i][0].dst, dst = cycleList[i][0].src;
adj[src].erase(find(adj[src].begin(), adj[src].end(), dst));
getAns(1, dst, dp[0], ans, adj);
} else {
num.first += B.first;
num.second += B.second;
src = cycleList[i][1].dst, dst = cycleList[i][1].src;
adj[src].erase(find(adj[src].begin(), adj[src].end(), dst));
getAns(1, dst, dp[1], ans, adj);
}
}
cout << num.first << ' ' << num.second << endl;
for (int i = 0; i < ans.size(); i++)
printf("%d %d\n", ans[i].src + 1, ans[i].dst + 1);
}
int main() {
while (read()) work();
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int N;
long long A[100005], B[100005], dp[100005];
deque<int> q;
double f(int i, int j) { return (double)(dp[j] - dp[i]) / (B[i] - B[j]); }
int main() {
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
for (int i = 0; i < N; i++) cin >> B[i];
memset(dp, 0x3f, sizeof dp);
dp[0] = 0;
q.push_back(0);
int last = 0;
for (int i = 1; i < N; i++) {
while (q.size() >= 2) {
if (f(q[0], q[1]) <= A[i]) {
q.pop_front();
} else {
break;
}
}
dp[i] = dp[q[0]] + 1LL * A[i] * B[q[0]];
while (q.size() >= 2) {
if (f(q[q.size() - 2], q[q.size() - 1]) >= f(q[q.size() - 1], i)) {
q.pop_back();
} else {
break;
}
}
q.push_back(i);
}
cout << dp[N - 1] << "\n";
}
| 6 |
#include <bits/stdc++.h>
using std::bitset;
using std::pair;
using std::swap;
int read() {
int x;
scanf("%d", &x);
return x;
}
bitset<4007> a[2007];
pair<int, int> e[500007];
int main() {
int n = read(), m = read();
for (int i = 1, u, v; i <= m; ++i)
e[i] = {u = read(), v = read()}, a[u][v] = 1;
for (int i = 1; i <= n; ++i) a[i][i + n] = 1;
for (int i = 1; i <= n; ++i) {
if (!a[i][i])
for (int j = i + 1; j <= n; ++j)
if (a[j][i]) {
swap(a[j], a[i]);
break;
}
for (int j = 1; j <= n; ++j)
if (j ^ i && a[j][i]) a[j] ^= a[i];
}
for (int i = 1; i <= m; ++i)
puts(a[e[i].second][e[i].first + n] ? "NO" : "YES");
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
struct data {
struct hash_table {
static const int n = 5000010, mod = 15000007;
int h[n];
int val[n];
int f, p, c, link[n], last[mod];
hash_table() : f(0), p(0), c(0) { memset(last, -1, sizeof last); }
int *find(int hash) {
for (f = -1, p = last[hash % mod]; p != -1; f = p, p = link[p])
if (h[p] == hash) return &val[p];
return NULL;
}
void set(int hash, int num) {
if (find(hash) != NULL)
val[p] = num;
else {
h[c] = hash;
val[c] = num;
hash %= mod;
link[c] = last[hash];
last[hash] = c++;
}
}
void erase(int hash) {
if (find(hash) == NULL) return;
if (f == -1)
last[hash % mod] = link[p];
else
link[f] = link[p];
}
} mp;
int a, x;
data() : a(0), x(0) {}
} dp;
struct data2 {
int a, x;
vector<pair<int, int>> mp;
data2() : a(0), x(0) {}
};
const int oo = -1e9;
const int N = 5 * 1e5 + 5;
int ans[N], sz[N];
vector<pair<int, int>> adj[N];
pair<int, int> bigch[N];
void getsz(int u, int p) {
sz[u] = 1;
int mx = 0;
for (auto v : adj[u])
if (v.first != p) {
getsz(v.first, u);
sz[u] += sz[v.first];
if (sz[v.first] > mx) mx = sz[v.first], bigch[u] = v;
}
}
vector<pair<int, int>> *rec[N];
data2 *mp[N];
int *it;
void dfs(int u, int f, bool keep) {
for (auto v : adj[u])
if (v.first != f && v.first != bigch[u].first) {
dfs(v.first, u, false);
ans[u] = max(ans[u], ans[v.first]);
}
int id = bigch[u].first, m = bigch[u].second;
if (id != -1) {
dfs(id, u, true);
mp[u] = mp[id];
rec[u] = rec[id];
ans[u] = max(ans[u], max(1, ans[id]));
dp.x ^= m, ++dp.a;
mp[u]->x ^= m, ++mp[u]->a;
it = dp.mp.find(m ^ dp.x);
if (it == NULL || *it < 1 - dp.a) {
rec[u]->push_back({m ^ dp.x, (it == NULL ? oo : *it)});
dp.mp.set(m ^ dp.x, 1 - dp.a);
mp[u]->mp.push_back({m ^ mp[u]->x, 1 - mp[u]->a});
}
for (auto k : adj[u])
if (k.first != id && k.first != f) {
auto &ch = *mp[k.first];
for (auto i : ch.mp) {
it = dp.mp.find(i.first ^ ch.x ^ k.second ^ dp.x);
if (it != NULL)
ans[u] = max(ans[u], *it + dp.a + i.second + ch.a + 1);
for (int j = 0; j < 26; ++j) {
it = dp.mp.find(i.first ^ ch.x ^ k.second ^ 1 << j ^ dp.x);
if (it != NULL)
ans[u] = max(ans[u], *it + dp.a + i.second + ch.a + 1);
}
}
for (int j = 0; j < 26; ++j) {
it = dp.mp.find(k.second ^ 1 << j ^ dp.x);
if (it != NULL) ans[u] = max(ans[u], *it + dp.a + 1);
}
it = dp.mp.find(k.second ^ dp.x);
if (it != NULL) ans[u] = max(ans[u], *it + dp.a + 1);
if (it == NULL || *it < 1 - dp.a) {
rec[u]->push_back({k.second ^ dp.x, (it == NULL ? oo : *it)});
dp.mp.set(k.second ^ dp.x, 1 - dp.a);
mp[u]->mp.push_back({k.second ^ mp[u]->x, 1 - mp[u]->a});
}
for (auto i : ch.mp) {
it = dp.mp.find(i.first ^ ch.x ^ dp.x ^ k.second);
if (it == NULL || *it < i.second + ch.a + 1 - dp.a) {
rec[u]->push_back(
{i.first ^ ch.x ^ dp.x ^ k.second, (it == NULL ? oo : *it)});
dp.mp.set(i.first ^ ch.x ^ dp.x ^ k.second,
i.second + ch.a + 1 - dp.a);
mp[u]->mp.push_back({i.first ^ ch.x ^ mp[u]->x ^ k.second,
i.second + ch.a + 1 - mp[u]->a});
}
}
}
it = dp.mp.find(dp.x);
if (it != NULL) ans[u] = max(ans[u], *it + dp.a);
for (int i = 0; i < 26; ++i) {
it = dp.mp.find(1 << i ^ dp.x);
if (it != NULL) ans[u] = max(ans[u], *it + dp.a);
}
} else {
rec[u] = new vector<pair<int, int>>();
mp[u] = new data2();
}
if (!keep) {
if (id != -1) dp.x ^= m, --dp.a;
for (auto i = rec[u]->rbegin(); i != rec[u]->rend(); ++i) {
if (i->second == oo)
dp.mp.erase(i->first);
else
dp.mp.set(i->first, i->second);
}
}
};
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n;
cin >> n;
char c;
for (int i = 1, u; i < n; ++i) {
cin >> u >> c;
adj[--u].push_back({i, 1 << (c - 'a')});
adj[i].push_back({u, 1 << (c - 'a')});
bigch[i].first = -1;
}
bigch[0].first = -1;
getsz(0, -1);
dfs(0, -1, true);
for (int i = 0; i < n; ++i) cout << ans[i] << " \n"[i == n];
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const int MMAX = 1000005, inf = 1e9 + 7;
char s1[MMAX], s2[MMAX];
int ans[MMAX];
stack<char> q1, q2;
int main() {
int f = 0, tot = 0, tt = 0;
char last = '1';
scanf("%s%s", s1, s2);
int len = strlen(s1);
for (int i = len - 1; i >= 0; i--) q1.push(s1[i]);
for (int i = len - 2; i >= 0; i--) q2.push(s2[i]);
while (!q2.empty() && !q1.empty()) {
tt++;
char n1 = q1.top(), n2 = q2.top();
q1.pop();
q2.pop();
if (n1 == n2)
continue;
else {
tot++;
ans[tot] = tt;
q2.push(n2);
}
}
if (tot >= 2)
printf("0\n");
else {
if (tot == 0) ans[1] = len;
int l = ans[1] - 1, r = ans[1] + 1;
while (l >= 1 && s1[l - 1] == s1[ans[1] - 1]) l--;
while (r <= len && s1[r - 1] == s1[ans[1] - 1]) r++;
printf("%d\n", r - l - 1);
for (int i = l + 1; i <= r - 1; i++) printf("%d ", i);
printf("\n");
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long double eps = 1e-7;
const int inf = 1000000010;
const long long INF = 10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 3010, LOG = 20;
long long n, D, k, u, v, x, y, t, a, b, ans;
long long dp[MAXN][MAXN];
long long F[MAXN], I[MAXN];
long long f[MAXN];
vector<int> G[MAXN];
long long powmod(long long a, long long b) {
if (!b) return 1;
if (b & 1) return a * powmod(a * a % mod, b >> 1) % mod;
return powmod(a * a % mod, b >> 1);
}
long long C(long long n, long long r) {
if (r < 0 || r > n) return 0;
if (n < MAXN) return (F[n] * I[r] % mod) * I[n - r] % mod;
long long res = I[r];
for (int i = n; i > n - r; i--) res = res * i % mod;
return res;
}
void dfs(int node) {
for (int i = 1; i <= n; i++) dp[node][i] = 1;
for (int v : G[node]) {
dfs(v);
for (int i = 1; i <= n; i++) dp[node][i] = dp[node][i] * dp[v][i] % mod;
}
for (int i = 2; i <= n; i++)
dp[node][i] = (dp[node][i] + dp[node][i - 1]) % mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
F[0] = 1;
for (int i = 1; i < MAXN; i++) F[i] = F[i - 1] * i % mod;
I[MAXN - 1] = powmod(F[MAXN - 1], mod - 2);
for (int i = MAXN - 1; i; i--) I[i - 1] = I[i] * i % mod;
cin >> n >> D;
for (int i = 2; i <= n; i++) cin >> x, G[x].push_back(i);
dfs(1);
for (int i = 1; i <= n; i++) f[i] = dp[1][i];
for (int i = 1; i <= n; i++)
for (int j = 1; j < i; j++) f[i] = (f[i] - C(i, j) * f[j]) % mod;
for (int i = 1; i <= n; i++) ans += f[i] * C(D, i) % mod;
ans %= mod;
if (ans < 0) ans += mod;
cout << ans << '\n';
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int n, V, e, a[305], b[305], xi, yi, dist[305][305];
bool g[305][305];
stack<int> m, l;
bool vis[305];
int ans;
vector<int> ans1, ans2, ans3;
long long dfs2(int i) {
vis[i] = true;
long long ret = b[i] - a[i];
for (int j = 0; j < n; j++)
if (g[i][j] && !vis[j]) {
ret += dfs2(j);
}
return ret;
}
void dfs(int i) {
vis[i] = true;
if (a[i] < b[i]) l.push(i);
if (a[i] > b[i]) m.push(i);
for (int j = 0; j < n; j++)
if (g[i][j] && !vis[j]) {
dfs(j);
}
}
void flow(int u, int v, int d) {
ans++;
ans1.push_back(u + 1);
ans2.push_back(v + 1);
ans3.push_back(d);
a[u] -= d;
a[v] += d;
}
void solve(int u, int v, int d) {
if (u == v) return;
int i;
for (i = 0; i < n; i++)
if (g[v][i]) {
if (dist[v][u] == 1 + dist[i][u]) break;
}
if (a[i] >= d) {
flow(i, v, d);
solve(u, i, d);
} else {
int t = a[i];
flow(i, v, t);
solve(u, i, d);
flow(i, v, d - t);
}
}
int main() {
scanf("%d %d %d", &n, &V, &e);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < n; i++) scanf("%d", &b[i]);
memset(dist, 63, sizeof dist);
while (e--) {
scanf("%d %d", &xi, &yi);
xi--, yi--;
g[xi][yi] = g[yi][xi] = true;
dist[xi][yi] = dist[yi][xi] = 1;
}
for (int i = 0; i < n; i++) dist[i][i] = 0;
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
for (int i = 0; i < n; i++)
if (!vis[i]) {
if (dfs2(i) != 0) {
printf("NO\n");
return 0;
}
}
memset(vis, 0, sizeof vis);
for (int i = 0; i < n; i++)
if (!vis[i]) {
dfs(i);
while (!l.empty() || !m.empty()) {
int u = m.top();
int v = l.top();
int x = a[u] - b[u];
int y = b[v] - a[v];
solve(u, v, min(x, y));
if (a[u] == b[u]) m.pop();
if (a[v] == b[v]) l.pop();
}
}
printf("%d\n", ans);
for (int i = 0; i < ans; i++) printf("%d %d %d\n", ans1[i], ans2[i], ans3[i]);
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, f, g, e;
cin >> a >> b >> c >> d >> e;
int num = c * d - e;
f = (num / c) * a;
g = num % c;
int h = num * b;
g = a > (g * b) ? (g * b) : a;
g += f;
int t;
t = (g > h ? h : g);
if (t >= 0)
cout << t << endl;
else
cout << "0" << endl;
return 0;
}
| 3 |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
template <typename T>
istream& operator>>(istream& in, vector<T>& v) {
for (auto& x : v) cin >> x;
return in;
}
template <typename T>
ostream& operator<<(ostream& in, vector<T>& v) {
for (auto& x : v) in << x << " ";
return in;
}
long long fast(long long a, long long b) {
if (b == 0) return 1;
long long ans = 1;
while (b) {
if (b & 1) {
ans *= a;
ans %= static_cast<long long>(1e9 + 7);
}
b >>= 1;
a *= a;
a %= static_cast<long long>(1e9 + 7);
}
return ans;
}
class solve {
public:
solve() {
int n, m, k;
cin >> n >> m >> k;
vector<vector<int> > v(n, vector<int>(m));
cin >> v;
int Mov = 0, Sco = 0;
for (int i = 0; i < m; i++) {
int a[] = {0, 0};
for (int j = 0; j < k; j++) {
a[v[j][i]]++;
}
int mv = 0, sc = a[1], cm = 0;
for (int j = k; j < n; j++) {
a[v[j][i]]++;
a[v[j - k][i]]--;
if (v[j - k][i]) cm++;
if (a[1] > sc) {
sc = a[1];
mv = cm;
}
}
Mov += mv;
Sco += sc;
}
cout << Sco << " " << Mov;
}
};
int32_t main() {
int t = 1, i = 1;
if (0) scanf("%d", &t);
while (t--) {
if (0) printf("Case #%d: ", i++);
new solve;
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
int max(int num1, int num2) {
int result;
if (num1 > num2)
result = num1;
else
result = num2;
return result;
}
int main() {
int n, m, a, b, p, q, r, s;
scanf("%d %d %d %d", &n, &m, &a, &b);
p = (3 * n) / 10;
q = (3 * m) / 10;
r = (n - (n / 250) * a);
s = (m - (m / 250) * b);
p = max(p, r);
q = max(q, s);
if (p > q)
printf("Misha\n");
else if (q > p)
printf("Vasya\n");
else
printf("Tie\n");
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int aa, vv;
int ll, dd, ww;
scanf("%d%d%d%d%d", &aa, &vv, &ll, &dd, &ww);
double a = aa, v = vv, l = ll, d = dd, w = ww;
double t1 = v / a;
double x1 = 0.5 * a * t1 * t1;
double t2 = w / a;
double x2 = 0.5 * a * t2 * t2;
double t3 = (v - w) / a;
double x3 = w * t3 + 0.5 * a * t3 * t3;
if (v <= w) {
if (x1 >= l)
printf("%lf\n", sqrt(l * 2.0 / a));
else
printf("%lf\n", t1 + (l - x1) / v);
} else {
if (d <= x2) {
if (x1 >= l)
printf("%lf\n", sqrt(l * 2.0 / a));
else
printf("%lf\n", t1 + (l - x1) / v);
} else if (d <= x1 + x3) {
double vm1 = sqrt(a * (d - x2) + w * w);
if (l - d <= x3) {
double vm2 = sqrt(2 * a * (l - d) + w * w);
printf("%lf\n", t2 + (vm1 - w) * 2 / a + (vm2 - w) / a);
} else
printf("%lf\n", t2 + (vm1 - w) * 2 / a + t3 + (l - d - x3) / v);
} else {
if (l - d <= x3) {
double vm2 = sqrt(2 * a * (l - d) + w * w);
printf("%lf\n", t1 + t3 + (d - x1 - x3) / v + (vm2 - w) / a);
} else
printf("%lf\n", t1 + t3 + (d - x1 - x3) / v + t3 + (l - d - x3) / v);
}
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N];
vector<int> v;
int main() {
int n;
while (cin >> n) {
v.clear();
memset(a, 0, sizeof(a));
int x;
for (int i = 1; i <= n; i++) {
cin >> x;
int cnt = 0;
if (v.empty()) {
v.push_back(x);
} else {
while (v.back() < x) {
cnt = max(cnt, a[v.back()]);
v.pop_back();
if (v.empty()) break;
}
if (v.empty())
v.push_back(x);
else {
a[x] = cnt + 1;
v.push_back(x);
}
}
}
int res = 0;
for (int i = 0; i <= n; i++) res = max(res, a[i]);
cout << res << endl;
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int t;
unordered_map<long long, int> mm;
void add(string &s) {
long long x = 0;
for (int i = 0; i < s.size(); i++)
if ((s[i] - '0') & 1)
x = x * 10 + 1;
else
x *= 10;
mm[x]++;
}
void del(string &s) {
long long x = 0;
for (int i = 0; i < s.size(); i++)
if ((s[i] - '0') & 1)
x = x * 10 + 1;
else
x *= 10;
mm[x]--;
}
int kol(string &s) {
long long x = 0;
for (int i = 0; i < s.size(); i++)
if ((s[i] - '0') & 1)
x = x * 10 + 1;
else
x *= 10;
return mm[x];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> t;
while (t--) {
char c;
string s;
cin >> c >> s;
if (c == '+') add(s);
if (c == '-') del(s);
if (c == '?') cout << kol(s) << "\n";
}
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double n, m, r;
cin >> n >> m;
r = sqrt(n * n + m * m);
if (n * m > 0)
r += 0;
else
r += 1;
if (fmod(r, 2.0) <= 1)
cout << "black";
else
cout << "white";
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e6 + 10, inf = 1e18, mod = 1e9 + 7;
struct pair_hash {
template <class T1, class T2>
std::size_t operator()(const std::pair<T1, T2> &p) const {
auto h1 = std::hash<T1>{}(p.first);
auto h2 = std::hash<T2>{}(p.second);
return h1 ^ h2;
}
};
long long pw(long long te, long long tee) {
if (tee == 0) return 1;
long long res = pw(te, tee / 2);
return (tee % 2 ? te * res * res : res * res);
}
long long n, k, a[MAXN], b[2];
void Read_input() {
cin >> n >> k;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] < 0)
b[0]++;
else
b[1]++;
}
}
void Solve() {
long long ans = 0;
for (long long i = 1; i <= k; i++) {
long long t = 0, c[2] = {};
for (long long j = i; j <= n; j += k)
if (a[j] < 0)
c[0]++;
else
c[1]++;
t = abs(b[0] - c[0] - (b[1] - c[1]));
ans = max(ans, t);
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
Read_input(), Solve();
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long int S, X;
cin >> X >> S;
if (S + X == 0)
cout << 0 << endl;
else if (S == X)
cout << 1 << endl << S;
else if (S < X || S % 2 != X % 2)
cout << -1 << endl;
else if (X & ((S - X) / 2))
cout << 3 << endl << X << " " << (S - X) / 2 << " " << (S - X) / 2;
else
cout << 2 << endl << (X + (S - X) / 2) << " " << (S - X) / 2;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 9;
const int maxn = 1e5 + 5;
map<pair<int, int>, int> mp;
set<int> st;
bool ok[maxn] = {0};
int x[maxn], y[maxn];
int n, ans = 0;
int get_id(int x, int y) {
if (mp.find(pair<int, int>(x, y)) != mp.end())
return mp[pair<int, int>(x, y)];
return -1;
}
int cnt_bot(int id) {
int cnt = 0;
for (int i = -1; i <= 1; i++) {
int t = get_id(x[id] + i, y[id] - 1);
if (t != -1) cnt++;
}
return cnt;
}
bool jd(int id) {
for (int i = -1; i <= 1; i++) {
int t = get_id(x[id] + i, y[id] + 1);
if (t != -1 && cnt_bot(t) == 1) return 0;
}
return 1;
}
void del(int id) {
if (y[id] > 0)
for (int i = -1; i <= 1; i++) {
int t = get_id(x[id] + i, y[id] - 1);
if (t != -1 && !ok[t] && jd(t)) {
st.insert(t);
ok[t] = 1;
}
}
for (int i = -2; i <= 2; i++) {
int t = get_id(x[id] + i, y[id]);
if (t != -1 && ok[t] && !jd(t)) {
ok[t] = 0;
st.erase(t);
}
}
}
void cal(int p) {
ans = ((long long)ans * n + p) % mod;
st.erase(p);
mp.erase(pair<int, int>(x[p], y[p]));
del(p);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
mp[pair<int, int>(x[i], y[i])] = i;
}
for (int i = 0; i < n; i++) {
ok[i] = jd(i);
if (ok[i]) st.insert(i);
}
while (!st.empty()) {
cal(*st.rbegin());
if (st.empty()) break;
cal(*st.begin());
}
cout << ans << endl;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[100]{};
int ans = INT_MAX;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
ans = min(ans, arr[i]);
}
int cnt = 0;
bool flag = false;
while (cnt != 2) {
flag = false;
for (int i = 0; i < n; ++i) {
arr[i] = arr[i] & ans;
}
for (int i = 0; i < n; ++i) {
if (arr[i] < ans) {
ans = arr[i];
flag = true;
}
}
if (flag) {
cnt = 0;
} else {
++cnt;
}
}
cout << ans << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
struct cpp {
int sl, val;
} sum[100005 << 2];
int n, m, cnt;
int a[100005], dis[100005], lazy[100005 << 2];
int luck[32] = {4, 7, 44, 47, 74, 77, 444, 447,
474, 477, 744, 747, 774, 777, 4444, 4447,
4474, 4477, 4744, 4747, 4774, 4777, 7444, 7447,
7474, 7477, 7744, 7747, 7774, 7777, 44444, 44447};
void pushup(int rt) {
if (sum[rt << 1].val == sum[rt << 1 | 1].val) {
sum[rt].val = sum[rt << 1].val;
sum[rt].sl = sum[rt << 1].sl + sum[rt << 1 | 1].sl;
} else if (sum[rt << 1].val < sum[rt << 1 | 1].val) {
sum[rt].val = sum[rt << 1].val;
sum[rt].sl = sum[rt << 1].sl;
} else {
sum[rt].val = sum[rt << 1 | 1].val;
sum[rt].sl = sum[rt << 1 | 1].sl;
}
}
void build(int l, int r, int rt) {
if (l == r) {
sum[rt].val = dis[a[l]];
sum[rt].sl = 1;
return;
}
int mid = (l + r) >> 1;
build(l, mid, rt << 1);
build(mid + 1, r, rt << 1 | 1);
pushup(rt);
}
void pushdown(int rt) {
if (lazy[rt] == 0) return;
lazy[rt << 1] += lazy[rt];
lazy[rt << 1 | 1] += lazy[rt];
sum[rt << 1].val += lazy[rt];
sum[rt << 1 | 1].val += lazy[rt];
lazy[rt] = 0;
}
int query(int a, int b, int l, int r, int rt) {
int ret = 0;
if (sum[rt].val != 0) return 0;
if (a <= l && r <= b) return sum[rt].sl;
pushdown(rt);
int mid = (l + r) >> 1;
if (a <= mid) ret += query(a, b, l, mid, rt << 1);
if (b > mid) ret += query(a, b, mid + 1, r, rt << 1 | 1);
return ret;
}
void update(int a, int b, int x, int l, int r, int rt) {
if (a <= l && r <= b) {
sum[rt].val += x;
lazy[rt] += x;
return;
}
pushdown(rt);
int mid = (l + r) >> 1;
if (a <= mid) update(a, b, x, l, mid, rt << 1);
if (b > mid) update(a, b, x, mid + 1, r, rt << 1 | 1);
pushup(rt);
}
void rebuild(int l, int r, int rt) {
if (sum[rt].val >= 0) return;
if (l == r) {
a[l] -= lazy[rt];
sum[rt].val = dis[a[l]];
lazy[rt] = 0;
return;
}
pushdown(rt);
int mid = (l + r) >> 1;
rebuild(l, mid, rt << 1);
rebuild(mid + 1, r, rt << 1 | 1);
pushup(rt);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
cnt = 0;
for (int i = 1; i <= 10000; i++) {
if (luck[cnt] < i) cnt++;
dis[i] = luck[cnt] - i;
}
build(1, n, 1);
for (int i = 1; i <= m; i++) {
char op[10];
scanf("%s", op);
if (op[0] == 'c') {
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", query(a, b, 1, n, 1));
} else {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
update(a, b, -c, 1, n, 1);
rebuild(1, n, 1);
}
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
solve();
return 0;
}
void solve() {
int i, j, n, m, t, d = 0;
cin >> n >> m;
vector<int> a(n);
for (i = 0; i < n; i++) {
a[i] = 0;
}
for (i = 0; i < m; i++) {
cin >> t;
if (a[t - 1]++ == 0) {
d += 1;
}
if (d == n) {
for (j = 0; j < n; j++) {
if (--a[j] == 0) {
d -= 1;
}
}
cout << "1";
} else {
cout << "0";
}
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, lim = 1e7 + 10, key = 1010;
int v[lim], r[lim], d[lim];
int main() {
int n, m, q;
scanf("%d%d%d", &n, &m, &q);
for (long long i = 1, _b = (n); i <= _b; i++)
for (long long j = 1, _b = (m); j <= _b; j++) scanf("%d", v + key * i + j);
for (long long i = 0, _b = (n); i <= _b; i++)
for (long long j = 0, _b = (m); j <= _b; j++) {
r[key * i + j] = key * i + (j + 1);
d[key * i + j] = key * (i + 1) + j;
}
int _a, _b, _c, _d, h, w;
int x, y, x0, y0;
for (long long i = 0, _n = (q); i < _n; i++) {
scanf("%d%d%d%d%d%d", &_a, &_b, &_c, &_d, &h, &w);
x0 = 0;
while (--_a) x0 = d[x0];
while (--_b) x0 = r[x0];
y0 = 0;
while (--_c) y0 = d[y0];
while (--_d) y0 = r[y0];
x = x0, y = y0;
for (long long j = 0, _n = (h); j < _n; j++)
x = d[x], y = d[y], swap(r[x], r[y]);
for (long long j = 0, _n = (w); j < _n; j++)
x = r[x], y = r[y], swap(d[x], d[y]);
x = x0, y = y0;
for (long long j = 0, _n = (w); j < _n; j++)
x = r[x], y = r[y], swap(d[x], d[y]);
for (long long j = 0, _n = (h); j < _n; j++)
x = d[x], y = d[y], swap(r[x], r[y]);
}
x0 = 0;
for (long long i = 0, _n = (n); i < _n; i++) {
x0 = d[x0];
x = x0;
for (long long j = 0, _n = (m); j < _n; j++) x = r[x], printf("%d ", v[x]);
putchar('\n');
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, f = 0, t = 0, s = 0, i;
cin >> a >> b;
for (i = 1; i <= 6; i++) {
if (fabs(i - a) < fabs(i - b)) f++;
if (fabs(i - a) == fabs(i - b)) t++;
if (fabs(i - a) > fabs(i - b)) s++;
}
cout << f << " " << t << " " << s;
return (0);
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, ans;
int main() {
cin >> n >> m;
if (n > m) swap(n, m);
if (n == 1) {
if (m % 6 <= 3)
ans = m / 6 * 6;
else if (m % 6 == 4)
ans = m / 6 * 6 + 2;
else if (m % 6 == 5)
ans = m / 6 * 6 + 4;
} else if (n == 2) {
if (m == 7)
ans = 12;
else if (m == 1)
ans = 0;
else if (m == 2)
ans = 0;
else if (m == 3)
ans = 4;
else
ans = m * 2;
} else {
ans = n * m;
if (ans % 2 == 1) --ans;
}
cout << ans << endl;
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c;
void get_input() { cin >> a >> b >> c; }
void solve() {
for (int i = 0; i < c - 1; i++) {
b += a;
a = b - a;
}
}
void output() { cout << b; }
int main() {
ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int tc = 1;
while (tc--) {
get_input(), solve(), output();
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
long long a[1000001], b[1000001];
map<long long, long long> m1, m2;
int main() {
long long n, i, j, m;
cin >> n >> m;
for (i = 0; i < n; ++i) {
cin >> a[i];
m1[a[i]] = 1;
}
for (j = 0; j < m; ++j) {
cin >> b[j];
m2[b[j]] = 1;
}
sort(a, a + n);
sort(b, b + m);
for (i = 1; i <= 9; ++i) {
if (m1[i] == 1 && m2[i] == 1) {
cout << i;
exit(0);
}
}
cout << ((10 * min(a[0], b[0])) + max(a[0], b[0]));
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int row[223456];
int col[223456];
int main() {
int x, y;
int k = 0, l = 0;
cin >> x >> y;
long long res = 1ll * x * x;
;
while (y--) {
int a, b;
cin >> a >> b;
if (!row[a]) {
res -= x - l;
row[a] = 1;
k++;
}
if (!col[b]) {
res -= x - k;
col[b] = 1;
l++;
}
cout << res << " ";
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int l, r, res;
cin >> l >> r;
res = 0;
for (long long i(0); i < 60; i++) {
for (long long j(0); j < 40; j++) {
long long z = pow(2ll, i) * pow(3ll, j);
if (z <= 2 * 1e9 && z >= l && z <= r) res++;
}
}
cout << res;
}
| 2 |
#include <bits/stdc++.h>
void fileio_in_out() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
void fileio_txt() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int n, m;
int i, j, k, l;
int a[1111111], b[1111111];
double e[1111111], ans;
int cmp(int a, int b, int c, int d) {
return (a * b * (100 - d) > c * d * (100 - b));
}
void swapnum(int *a, int *b) {
int t;
t = *a;
*a = *b;
*b = t;
}
void sort(int a[], int b[], int l, int r) {
int i, j, mida, midb;
i = l;
j = r;
mida = a[(l + r) / 2];
midb = b[(l + r) / 2];
do {
while (cmp(a[i], b[i], mida, midb)) i++;
while (cmp(mida, midb, a[j], b[j])) j--;
if (i <= j) {
swapnum(&a[i], &a[j]);
swapnum(&b[i], &b[j]);
i++;
j--;
}
} while (i <= j);
if (i < r) sort(a, b, i, r);
if (j > l) sort(a, b, l, j);
}
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
sort(a, b, 1, n);
ans = e[0] = 0.0;
for (i = 1; i <= n; i++) {
e[i] = (double)a[i] * b[i] / 100 + e[i - 1];
ans += (double)a[i] + e[i - 1] * (100 - b[i]) / 100;
}
printf("%.10lf\n", ans);
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
int n, t;
double p;
double dp[2005][2005], ans;
int main() {
scanf("%d%lf%d", &n, &p, &t);
ans = 0;
dp[0][0] = 1;
for (int i = 0; i < t; ++i) {
for (int j = 0; j <= n; ++j) {
dp[i + 1][j] += dp[i][j] * (1.0 - p);
dp[i + 1][min(j + 1, n)] += dp[i][j] * p;
}
}
for (int i = 1; i <= n; ++i) ans += dp[t][i] * i;
printf("%lf\n", ans);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1.01e9;
const long long infll = (long long)1.01e18;
const long double eps = 1e-9;
const long double pi = acos((long double)-1);
mt19937 mrand(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x) { return mrand() % x; }
void precalc() {}
const int maxn = 2005;
int n;
int c[maxn];
vector<int> g[maxn];
int root;
bool read() {
if (scanf("%d", &n) < 1) {
return false;
}
for (int i = 0; i < n; i++) {
g[i].clear();
}
root = -1;
for (int i = 0; i < n; i++) {
int p;
scanf("%d%d", &p, &c[i]);
p--;
if (p == -1) {
root = i;
} else {
g[p].push_back(i);
}
}
return true;
}
int ts[maxn];
int a[maxn];
vector<int> vs[maxn];
bool dfs(int v) {
ts[v] = 1;
for (int i = 0; i < ((int)(g[v]).size()); i++) {
int u = g[v][i];
if (!dfs(u)) {
return false;
}
ts[v] += ts[u];
}
if (c[v] >= ts[v]) {
return false;
}
vs[v].clear();
int k = 0;
for (int i = 0; i < ((int)(g[v]).size()); i++) {
int u = g[v][i];
for (int j = 0; j < ((int)(vs[u]).size()); j++) {
int w = vs[u][j];
a[w] += k;
vs[v].push_back(w);
}
vs[u].clear();
k += ts[u];
}
for (int i = 0; i < ((int)(vs[v]).size()); i++) {
int u = vs[v][i];
if (a[u] >= c[v]) {
a[u]++;
}
}
a[v] = c[v];
vs[v].push_back(v);
return true;
}
void solve() {
if (!dfs(root)) {
printf("NO\n");
return;
}
printf("YES\n");
for (int i = 0; i < n; i++) {
printf("%d ", a[i] + 1);
}
printf("\n");
}
int main() {
precalc();
while (read()) {
solve();
}
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
if (a == b)
cout << a << endl;
else
cout << 1 << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast")
#pragma GCC target("avx")
using namespace std;
inline char gc() {
static char buf[1 << 16], *p1 = buf, *p2 = buf;
if (p1 == p2) {
p2 = (p1 = buf) + fread(buf, 1, 1 << 16, stdin);
if (p2 == p1) return EOF;
}
return *p1++;
}
template <class t>
inline t read(t &x) {
char c = gc();
bool f = 0;
x = 0;
while (!isdigit(c)) f |= c == '-', c = gc();
while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
if (f) x = -x;
return x;
}
template <class t>
inline void write(t x) {
if (x < 0)
putchar('-'), write(-x);
else {
if (x > 9) write(x / 10);
putchar('0' + x % 10);
}
}
const int N = 1e5 + 5;
int n, m, ans[N], ltr[N << 2], rtr[N << 2], tr[N << 2], len, rlen, ma;
struct abcd {
int l, r, k, i;
bool op;
} a[N << 1], p[N << 1], q[N << 1];
void pushup(int x, int l, int r) {
int mid = l + r >> 1;
if (tr[x << 1] == mid - l + 1)
ltr[x] = tr[x << 1] + ltr[x << 1 | 1];
else
ltr[x] = ltr[x << 1];
if (tr[x << 1 | 1] == r - mid)
rtr[x] = tr[x << 1 | 1] + rtr[x << 1];
else
rtr[x] = rtr[x << 1 | 1];
tr[x] = max({tr[x << 1], tr[x << 1 | 1], rtr[x << 1] + ltr[x << 1 | 1]});
}
void up(int x, int l, int r, int p, bool v) {
if (l == r) {
ltr[x] = rtr[x] = tr[x] = v;
return;
}
int mid = l + r >> 1;
if (p <= mid)
up(x << 1, l, mid, p, v);
else
up(x << 1 | 1, mid + 1, r, p, v);
pushup(x, l, r);
}
void que(int x, int l, int r, int p, int q) {
if (p <= l && r <= q) {
len = max({len, tr[x], rlen + ltr[x]});
if (tr[x] == r - l + 1)
rlen += tr[x];
else
rlen = rtr[x];
return;
}
int mid = l + r >> 1;
if (p <= mid) que(x << 1, l, mid, p, q);
if (q > mid) que(x << 1 | 1, mid + 1, r, p, q);
}
void solve(int l, int r, int ll, int rr) {
if (l > r || ll > rr) return;
bool flag = 0;
for (int i = l; i <= r; i++) flag |= a[i].op;
if (!flag) return;
int pn = 0, qn = 0;
int mid = ll + rr >> 1;
for (int i = l; i <= r; i++)
if (!a[i].op)
if (a[i].k >= mid) {
up(1, 1, n, a[i].i, 1);
q[++qn] = a[i];
} else
p[++pn] = a[i];
for (int i = l; i <= r; i++)
if (a[i].op) {
len = rlen = 0;
que(1, 1, n, a[i].l, a[i].r);
if (len >= a[i].k)
q[++qn] = a[i], ans[a[i].i] = mid;
else
p[++pn] = a[i];
}
int pq = l - 1;
for (int i = 1; i <= pn; i++) a[++pq] = p[i];
for (int i = 1; i <= qn; i++) a[++pq] = q[i];
solve(l, l + pn - 1, ll, mid - 1);
for (int i = l + pn; i <= r; i++)
if (!a[i].op) up(1, 1, n, a[i].i, 0);
solve(l + pn, r, mid + 1, rr);
}
signed main() {
read(n);
for (int i = 1; i <= n; i++) {
read(a[i].k);
a[i].i = i;
ma = max(ma, a[i].k);
}
read(m);
for (int i = 1; i <= m; i++) {
read(a[i + n].l);
read(a[i + n].r);
read(a[i + n].k);
a[i + n].i = i;
a[i + n].op = 1;
}
solve(1, n + m, 1, ma);
for (int i = 1; i <= m; i++) write(ans[i]), puts("");
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
ll parent[2002], size1[2002];
ll ans, m;
vector<ll> z1;
vector<pair<ll, ll>> z2;
void make_set(ll v) {
parent[v] = v;
size1[v] = 1;
}
ll find_set(ll v) {
if (v == parent[v]) return v;
return parent[v] = find_set(parent[v]);
}
void union_sets(ll a, ll b, ll c) {
int flag = 0;
ll q, w;
if (a == 0 || b == 0) flag = 1;
if (flag)
q = a ^ b;
else {
q = a, w = b;
}
a = find_set(a);
b = find_set(b);
if (a != b) {
if (size1[a] < size1[b]) swap(a, b);
parent[b] = a;
size1[a] += size1[b];
ans += c;
m++;
if (flag)
z1.push_back(q);
else
z2.push_back({q, w});
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, i, j, x, y, z;
cin >> n;
ll a[n][2];
for (i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1];
}
ll c[n], k[n];
for (i = 0; i < n; i++) cin >> c[i];
for (i = 0; i < n; i++) cin >> k[i];
vector<pair<ll, pair<ll, ll>>> v;
for (i = 1; i <= n; i++) {
v.push_back({c[i - 1], {0, i}});
}
y = 0;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (i == j) continue;
x = abs(a[i - 1][0] - a[j - 1][0]) + abs(a[i - 1][1] - a[j - 1][1]);
v.push_back({(k[i - 1] + k[j - 1]) * x, {i, j}});
y++;
}
}
sort(v.begin(), v.end());
for (i = 0; i <= n; i++) make_set(i);
j = y;
ans = 0;
m = 0;
for (i = 0; i <= j; i++) {
x = v[i].second.first;
y = v[i].second.second;
z = v[i].first;
union_sets(x, y, z);
if (m == n) break;
}
cout << ans << "\n";
;
cout << z1.size() << "\n";
for (i = 0; i < z1.size(); i++) cout << z1[i] << " ";
if (z1.size()) cout << "\n";
cout << z2.size() << "\n";
for (i = 0; i < z2.size(); i++)
cout << z2[i].first << " " << z2[i].second << "\n";
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q, c = 0, n, s = 0;
cin >> q;
for (int i = 0; i < q; i++) {
c = 0;
s = 0;
cin >> n;
if (n <= 6) {
cout << 1 << endl;
continue;
}
int a = n / 6;
for (int j = 0; j < a; j++) {
s += 6;
c++;
}
if (n - s != 0) {
c++;
}
cout << c << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int C = 150000;
const string A =
"00000000000000000000000000000000B8D65061BE93153966A571B90007F2A96904E0B5DF"
"A0CE4D8135C61D00102AAD64B065A6F47D0ED845BBBD2000187A01AB4E006DB7DBAED1ADBF"
"21C50020D811DFD54B775A7EA2C5B5B2DF13002940C3C49E08B3FF827A1D5D1E391D0031B1"
"D6E7B2C4422EEB4D669FCA1F60003A29C5CE3C9DBC365396807EAA72740042A780E308822C"
"A77CE334EFB625B2004B2A5FD9309475E31A5627FE3C62C10053B195A4BB9C26810D0D74A0"
"BEF364005C3CC7435C4800974F1472D91DCEFA0064CB8B9F3DECA57CA07825AB25CF2B006D"
"5D9096A60ABD1011A1B9092735FB0075F2A85E5E91B9CFEC8BFFFC688E13007E8A74E499BC"
"8E3D6EC8FE86A8A556008724BE9D3DE3E231BF9DB09A3D6C34008FC191A53B212CBFB10540"
"467AC8B20098609B680DB4EAD07B1E3686979E1A00A101B2910D24AF8ECE1C154A56799B00"
"A9A4E3B67838EC6AE974ECA318E61800B249E6FBECB11EE41AE95093806AAC00BAF0B3959A"
"2EED3FF80267123E16CD00C3992FD801A066FE2FEB1002D3552000CC436927AC0521AE3EBC"
"7DA5AFFF0500D4EF135DDF36D94A7DAEDDCADDE7FF00DD9C389680B823D1B525D57A650D95"
"00E64AE62544E1F4EAF3949CB30F448200EEFAEBBFC542F1491186AD71832D9500F7AC4F9A"
"8BE920CCB7F522D16CE2CA01005EE77A590683EF5CB6FDAE409B61010912B0660A0C1EE962"
"563E1413C6A60111C7BEABF1275F012C41AB16C17F2F011A7DE708DEE52B0AEF4551A16A2B"
"6D01233522F5F6DCE57F0DC2CBB46AFE9B012BED76FBB0A89D9348F4714B3550F30134A6EC"
"39FFC7BB143DDD116066EC43013D615550BA0F4EC9D2DB1E0FF6CCDE01461CAA6CE064B365"
"F690773BC25E09014ED9122B0821A25C8508C801A6805E01579656602874C25A77DAF647F5"
"07DE01605488C37924FB9F1B46E32933AD970169138DE02BF4B7623ED6D97395F7430171D3"
"772B9AEB3485809C7A63074222017A943D06F7E5F83D8F3430CDD76D44018355D25C6112FC"
"F025D87AE33A2EEC018C1812A92464113E2B659161EE4B650194DB473ED61F6E6EB9F41C57"
"015FF8019D9F3584752A90606DF274E200B21C01A663E286066337BD038E3BFB71B5FB01AF"
"29419044F97F3C59563D9F35B1CF01B7EF59CEB1195485DBBFE0BA717C3A01C0B61B191FA0"
"A6C7789282763A9E9E01C97DA6567718E71D39D071954075A901D245D2CF7425B7DC9BBFDD"
"5633BF3701DB0EA94750AA968A55DA429809DDF401E3D811074D3422E36E7BC862EDD58601"
"ECA22ED5712B4D5B2018D1B88F510101F56CE3D16390D2DDFD95FE956D2F1A01FE382E01A7"
"9435CF9C707300F8F74F02070418FB2C195AF9F14DB8BD131AB4020FD0A1CA4137A6E3CC99"
"703990DD5402189DB3FD5140DBC648C2F118E26B2F02216B637D7CE2B26138009697DCB14A"
"022A3996045410445F45150498B863C602330845E9834258ED4081C00289F728023BD7AC5A"
"CCCBF511FEDCB3FAE38B7F0244A77CDFAAB3C6631342706DDABDF8024D77E146787FF721F5"
"AC3784D87843025648B978AA397F6F57A55D33751835025F1A1862DF32535C139D874726DA"
"150267EC043C07FD9819388D6CE4534EFE0270BE67009D0546C3566D2821F7B8D002799121"
"22130C963CA7B0D4BF8161FE028264883A88DE558A4CD3CBE7E83D9F028B3854B442C2FEA8"
"AE49AE7B03224E02940C9AA5D0B4BC4CE2AFA2BE9355E8029CE160424040114E0B2E5D8049"
"B5B702A5B688AF52F41C9EDFD872B2F16B8202AE8C2D1B74DDCA9819BC38777C90D602B762"
"468D862BAE53A220C2C3D7513E02C038BE4F4E6BB7C2EE75E78055651302C90FA9828F0C22"
"A30A3720DDB6DBCE02D1E702E9097043F00F50479FBA5CBF02DABED16E28F00D062525D109"
"0DEA1B02E396F44B6A8B37E51121A1D1D0F4E302EC6F8F438B56A40BE753A208BAA23C02F5"
"4892051C459585D140F7C3CE95B302FE21FA5DEE16A98A3D523D1FDF25190306FBB917041F"
"2E717D8862F2B28B7A030FD5F4A4009DB32AE811AB4ED0A3A50318B07894532769EB60E8A7"
"68CBB8D903218B5FFE13CED439715460F09F015E032A66992254845D9404A655B50520C103"
"33425B03CB5F7B0FF6379911B22E21033C1E649BAFC8FA198F8E74372F2B440344FACD9300"
"F7391A4E7F6B8BC9C639034DD787BD14A902BB6E66C278E08E3E0356B4A09485DEE2E7AF2A"
"2213031E02035F920E3988982700D933C7DA0C5CDB03686FED0BDD20ECD41358A43BEA9FD2"
"03714E13865A1E890DCAECA353F14F79037A2C8F62BE440F135922258A8E601103830B6AB0"
"FD3E4B8C33AF8BBE936181038BEA86523A2FA32F72B0695DE6C3950394C9FA3AC059994B7F"
"11F973665231039DA9CDCBCC07F066365C60DD020CDE03A689F781F1F3147001BF32C1EDE0"
"9603AF6A738E1DAB549DF61A26411B8A8003B84B2841B21FA15EF6A7AF6ABE738103C12C4B"
"0F557C3C340A3806D75F55BC03CA0DA2807CA7F8EC2AD80011C35C2603D2EF4FD7AD07E868"
"F74C587579959E03DBD1631A8123BB472E0EB9F25B58BF03E4B38FFF1BF5994A1DD5DD3AE5"
"CB5303ED96362F0F543BEF42A56B66C785BF03F6791D3E8CCE650A64FDEB671E369F03FF5C"
"24412EA99D96086279481235D504083FB93DD4704B4DFC4F0BB8B3F5590411237E42FA827F"
"47802F912AF026E9041A07767A4E69C444E4F30C597EE26E0422EBE59C7BBAB78BE5E51D84"
"8FCDE1042BD0760AA40919226970DD1A8F736F0434B5687BD779A2193594D81C44E5E0043D"
"9A7B39B9086C839FCC4ACDE8BDE004467FF05D07CCE14EF122A7C9E93265044F65A9F54429"
"4D988D0ADB6A7C420B04584B9E752B2D6BC71886A7704D95F3046131E78AEE45489AF9289E"
"E44FF15A046A186F33F24F301311842C228F3B620472FF1D41FD0FA935368119897EE4A704"
"7BE62031DF5EB5B40A3A29C3E004450484CD75B3B8ACBF9FBE68A7675C242B048DB5051570"
"A3BD8C40886F8B2B061704969CC82CD9682870C213D40CBD964E049F84D35D10D4FC2584A1"
"EEFAF2D5FE04A86D1F39F6B3D153F4F3557FA45A3304B155A6E98AFBEC6A3571FCC6DF4BC8"
"04BA3E6E095927C10F07232F59F9717B04C327780DFFF3565FF5B8D872FBC29C04CC10B387"
"66C9FFE8420D192EEB697B04D4FA37B3D7EF7AA61D246A3D2FC6CC04DDE3F70CA462A93DCA"
"914FB84AF85504E6CDED46E2C71C5975A5B0D3BF388204EFB82BE60468EB43A2CB5194D4C5"
"0B04F8A28D851F6EFA96AA7A20ACA9E54405018D49B906F907A012F2D1978F2D7B050A7827"
"E4470198355E447E2D96347005136352F63A4A89A16CE21D8975B05F051C4EB8F4FBCBDB56"
"17F5C957D9ACC505253A6216A39328E69EDFCAFB56387A052E263B55C8D3AC488400B80F72"
"C73C053712240164D5F5668649B3D8788F67053FFE646EDE1D99A1297933019E30550548EA"
"E1CD85C4361738D59C6BF8D88C0551D79753D888C3365B321F84D56449055AC46A4D031319"
"1225C6711BF8E8530563B18A80D6B531FAAC110F33BC9827056C9EDAF10D73B50FA464814E"
"3D0E9505758C7DC0F788412E7AC3F77902FF5D057E7A4561AC3B4291ACC288E6B3C14C0587"
"683597B8ED1DA3A4BDE94C687B0D059056552E3FD5520D5113C0BA552232059944BC7D529A"
"F7440A9AD3C2ACE1D305A2333548B9C4C5FC1BB49983D477A105AB220BAE001817F9D72C09"
"6414E41305B410FBB4492128D6ADA6AE9F522EFC05BD0028B49267F3E09E8E177E996C4F05"
"C5EFA1B17164F1F527788B9610F4F105CEDF379714B1CCD29EA92C9E4321FA05D7CEFF1111"
"68CEB6F9D1E6318D4C3805E0BEEFE9E6ACEE757E95D41C8546EA05E9AF22C15E1B9062C398"
"4A8E996F6C05F29F7C6C6E806F45E9CB8989F30E9705FB900991E0A666DFA7D736759C40FE"
"060480D66DCE0BDC2B4B28B2A7B336FA060D71B52B151299E92695B172176207061662A874"
"9E0D936A93F4EF2E032233061F541B39172848D7ACD2EE55F5A7480628459AA409EEB1E030"
"2DC18979B04D0631373358F1485FBC8A0377EF6EA1C7063A291BD71FE0B5BA6F741565D943"
"8706431B32D75FF2FD4E4CC37908C14C7F064C0D5AE074E14BD77593812048B70B0654FFB9"
"159169138E2DA8839A2FF2B7065DF23D1F35F5A7D0AAB0A723CB3CE10666E5108738F3EF47"
"3B936797A232F7066FD807ABD24B1947B5BC59E854AC4D0678CB3FEFD7CC6801DFAF64AE50"
"C9440681BE72EC2722968AB607CC4DAA9CAC068AB1E7602811709D949DB09BB135B40693A5"
"A64000C62443BF0FFA8A2DF57E069C99536E8DDE68741B778A64FA3E3006A58D629EFA81CB"
"5D551B8DF7C35C4B06AE819942DBEB0B3DBA15979C7A2F8906B775FEEEB4EDB7517050E302"
"E32A0306C06A6112D26E6F8CA55E33133DFADF06C95F0FDFE7830FA4C28E1BE4B080AF06D2"
"53D70F2B96F5334B26F3916C2AD306DB48FAFAA1F9F5678450A9D1DD09E906E43E0F7EFDF5"
"A1A5534B0F80FBC8EB06ED3348D84BB8292A70E9B128FBBA6F06F628D04C075AA72A052CDD"
"E81446AD06FF1E88FEA6A6275CB0A2FDF453919707081449A0A8E614963C0DD04133011C07"
"110A44124968020E6AFB04DC8EA4A4071A00590D3FE0DE90EBFBAA84062F600722F6ABC1D0"
"44F638C182BEB578EF1C072BED39DDFD51B425CECBBA18312CE60734E3BFB8111D38D1CCCB"
"4251C39B5A073DDA83C52A385A09840C90428869620746D17478CD12BE2ABDF02ABC82BE26"
"074FC89E40827BE6A16DE050095A89260758BFCC2A312E6A8350D71A423928980761B741EB"
"68E20FF0B185E14DC33983076AAEC7CA689DA9AAE45E7FC49DA0EB0773A68059B1A9BB52CE"
"80B1F965F183077C9E45F19AB7BE3615F7FC716B501A0785962E090AEBBE5644F43E189C2B"
"22078E8E6480D6309A5C6B7D3CE2F33B9A079786B8ADC173B3FE8F892D3D6C071107A07F34"
"0D7E890DB298C3CF0D5E528D07A977BB4ABC81C48F1A7A1032E59EA407B2707CF5ECDCE633"
"D5AD8A9A9BFB8407BB6959D297AE238654DB534427035107C4625AD60A569EDAC8840EE99B"
"EEB407CD5B89E668579F3C22D47752BA3C1F07D654E3B6F9617751DD7701F090AD1B07DF4E"
"77B82A43503860FBD2FE8A4B1E07E84825DA6C0BA664024A2E39838AA007F141D73D8C1540"
"4D0DF6A03653F7BC07FA3BAEC6765851BC6DD9EDF5954455080335DF12A1229AE216A83202"
"89D654080C2FFBC453AE877E3021551D79865108152A3E297E20E8AC28FE3C1CAA02D6081E"
"24A36BEAE72E9BEA156E2754AE1608271F4E4E6283EC344D26CABA15162C08301A169D0ED1"
"AFDEFEF32BC786CE6D083914EE668E3FC10CB155BF6E0952B908420FEF77C89647FF45EB5D"
"AD89AEC1084B0B029CED3F97A757786323D2FFED085406522E2911994AA6AD15179018D308"
"5D01DE5E2F9149E481C9778778328B0865FD58B3AB53C9D4C8F8D3DD9FD443086EF90CCF43"
"5EC9C0D6BF9D97B355770877F4F0299542F064093538A45A9A160880F0D326663B0AD7CB73"
"A8DD55EDB40889ED012B0B0611926E8F73A378B60F0892E91626E40A30A0F33DA0C0F01DD6"
"089BE56F578DF128CFD838E2A7E87E7C08A4E1F86A1A9946CB10A6102231CDCA08ADDE9A29"
"1A8FF040DA4D32ECF2E85408B6DB548022BF42570EFBD6DBF7ED1208BFD83E7C9D5D37A329"
"17DD0124D96508C8D53000717A6B18795797B2D79B7F08D1D23D9C2D4FAE64FC566EFEA308"
"5608DACF6EC134FD5736F1F3011E55EADF08E3CCC5F42C71533A8CFFB9744F107508ECCA7A"
"4E50E19D6AE642978DADB9F708F5C800A26E932DF947DC2D3ACD1C8F08FEC5BE8218A335A9"
"6B4EF531E7E8770907C3B6AE03B779EA8F319155DE2C570910C1A843C5265C730E0DF6DD7E"
"66B20919BFB5A75EA37CA692B8B8B6B2347C0922BE048AD665896FFCC8173010A0F1092BBC"
"4B6795989679EA06CE9E8664920934BADC5282356DDFC0D45F06AA2EF7093DB998601C16EB"
"985A608102D21E650946B83A4276BE35C3F0B99D93D8F185094FB6F97F8AAFA4AA493230EF"
"5AD07A0958B5FFFD60B5B3E138103109B8A8B10961B54484F50A3A91CE37B05072ECBC096A"
"B461C40069A2EE7E50AC8446B14A0973B3D043038D3F7149BD2F64386B91097CB3307FC9E6"
"DC79BA64F056D439720985B2BF10176790EA6F3F608BC4F28C098EB272DABE22C9DA677237"
"9006E5A70997B24AA35982B44FC0AA2260912B2E09A0B23B321A511BCE511105DE1544B309"
"A9B229C0C20F95591E26ABE882AA3B09B2B28608B0B307DBE745E7E8426A6D09BBB2C2151B"
"BBA4DB411FBA193BC78009C4B3082A9092599AEC95BD49E77DA909CDB3996D2F727945DDD3"
"558F2B7F5B09D6B442D6DA174F08021A335E62CF3F09DFB4EB0D82CD740D18071E26756560"
"09E8B5CCB863D6DD400297DD2634649D09F1B6E5E6A99F9E8EE0E68A040053A409FAB7C586"
"55A6785D9173E27D2D89D20A03B8FF0D78FE2B2167379D054388FB0A0CBA494E9F35A08ACE"
"D9CA716D47DA0A15BBB3120BBBA87EEF236E2B53B9020A1EBD37354BC70513921DAD925BB8"
"1F0A27BEEA1AB9C99D0B5B43DF1E947D710A30C0850BDBC9061C7A2960F5BEE3F80A39C271"
"0DDDDFFF5730960DF613EAD70A42C4616DBC3775D2D91D4524EBB3B90A4BC68F59BE32C47D"
"9B7E3CDED6132A0A54C8872B53072105F3494BCF476DF10A5DCAF72ADCCC1E50E2D0A48A84"
"C5F80A66CD5DAAF84A1E4200FF5A6AA3EA240A6FCFC98E58B637314667F16F3FDCC90A78D2"
"72C52CDDA67ABAE000941430A20A81D50ED2B22FD9F980C1658F0BD0090A8AD7D103E04355"
"B045D077069E09FB0A93DAC6D65D0F7534CA2DDB21F95E170A9CDDBC3FF790E08B17EBCE72"
"5F535C0AA5E0D0340A99C52B73AF578E6F5F510AAEE425CAFC13A1BCE0132DA4F636D70AB7"
"E76C408135DC234F7AB2F3BC64920AC0EAFDCF3A3C25CEF6A2F3CC311FFD0AC9EE67FE62E9"
"4E92D80F7E64E401540AD2F209DF85F97C2A1DC96CB50AD8940ADBF5C041491EEBD400D067"
"768A04A50AE4F9B04BA91FBB2A122A01C5BE58AB0AEDFDADD2B7F30189838E3B8427F4A70A"
"F701A68909EEB4576FB0823B5A2C940B0005EEE6935CCFB7926ABBF31D8A5F0B090A4757A2"
"16789988AE7EFA71F89E0B120E99F00ACB72DFA576785F55F36E0B1B1306CFC4783EAC71DD"
"4803404F460B2417A0C3DC0098B204B94699FB2D920B2D1C63D24521B278B72E547FAAB072"
"0B362110813D3436D66149320CA417060B3F25FE5A2A0A794F4CF7216B01DB010B482AE9B5"
"9CDF5A4B39BCBCE15842CA0B5130080D4A3A47E19932974874FD8F0B5A352B95B83E78E681"
"5B7CC02FA7140B633A5E09A694E87720F084B53E7F420B6C3FBD840B322281E1C8B2FF15DB"
"AE0B7545142B7C50A2589C0132D37640800B7E4A9919E4BA471A5ECE69E58FBAE30B87503B"
"0A33EC8ACC653D387ACA63980B9055FF6553C0DBD1D53DE5E88171AF0B995BEFD63986A0FF"
"D0E9B6E1676A300BA261D23065F732765E0752AE8AEE4E0BAB67DC1A014B3DCD63FDB110EA"
"4F1F0BB46E02CA1EF4279CAE6AD907C724A70BBD7435E3E1AAF9C667E387EFBD8FF10BC67A"
"7BEC75795F240B7B078564EB0D0BCF80FA5DFA8AF8DD2D257A77AE1C400BD8877ED65AA9EA"
"052FB76E780819640BE18E074DD3CA97057BF0FF2D7F73790BEA94ACBC17B66A709F96B815"
"13A6B60BF39B867A7D602AF0A595740A63A0F40BFCA25DEE13AFB91461694B46A0D3A50C05"
"A96D9E3DAFE27A1AE69ECCA96AC60C0EB064EBCEC46CB867705E68B4A5E40C17B77E48ABB7"
"895676AFDF262EF8490C20BEBBAB222BA482CC70B88AF4EF9C0C29C628C698AEB2D862509C"
"4893924A0C32CD6C2BE6B5E6C28F7294984C4C640C3BD517344713516E13850DEC147DA90C"
"44DC955D58764BDFDDF3D3B7B0D6290C4DE43A1F389B50308A2DC47B5FAF300C56EC203A34"
"1528A78FCF60475A0E780C5FF3EC2995B0E2750615764C61AC020C68FBF27F342D6EFC455A"
"1C301D1A0E0C720418A1DB117FFFB6E465BB23737B0C7B0C47AB0E2CD8B0998E8476EB9324"
"0C841436DE3ABE463EFD686AE39D857E0C8D1CAEFE9A1593757C6C57979F41CB0C96252B1D"
"62385859AD88D29FA14B920C9F2DBF1684D319C40B6B5DBF619ABB0CA8365A7AB6390A4C27"
"E96864306E820CB13EFC33918944D5B09F580853AEB60CBA47C99BEFE7363951F5B277F697"
"080CC350975B9E94D6888D493C18327A860CCC597427D8D3971755D7F16896656F0CD56295"
"3A2C0F51954E6F69CC3DF4D50CDE6B934EEF117AFF8AA8CED9EE5FB40CE774D70094A5AE4D"
"DFF6526B9C4DD80CF07E1B32E4A0352F81172F08E237210CF98761E975EDFA1E0F29AE7D72"
"8E720D0290DED5208983592AA7FB03964D530D0B9A6721BA353442F7FAE88EE5F8180D14A4"
"0ECB7AF9F4A32EE044806DAE200D1DADD6A7DFFD5EC21D36FEBE01114A0D26B77CDA809C61"
"91F9225B481DC21F0D2FC15221230C319EB463C3E7D09AA70D38CB3E73051B124B18798681"
"3859F80D41D5515705B7922CFB0326B4A234560D4ADF6CAD7D7EA3D7197E3BAAC3CB6B0D53"
"E99F0F1FA6EF69561E85A1B33E690D5CF3DEF3D919307EFBBFEEEBAA708E0D65FE5552BD31"
"1EA208A5CCFE0601A60D6F08D4D3235932AD95631CD4A9A4260D781376989912D5EF7A9A1B"
"69B9D5450D811E072A86F1AE988420C8608387020D8A28B28A425126B192C06248D40F840D"
"933399893C955444C122D4733239FC0D9C3E5CC0F93FB14E8FC2753A79673D0DA5493397AA"
"160AB9D5F82E0B1766360DAE544C1427E2CE799A279656CE92FE0DB75F629641B68BBCE113"
"054F5906810DC06AA0646C302F6BD0B5131402D43F0DC975EF99C3C53B1CFC40F171EE3C8D"
"0DD2814203615C6CDB1C7E76FCB9075A0DDB8CCDBBC9E9E616A1D23E2583CFD00DE4981737"
"C933C48680FC9C1D305B680DEDA3C22DA0511DB6B18A657A32810B0DF6AF6C94DE3667FD45"
"CCF5375239610DFFBB1E4598531308ABCDF91C26C2F30E08C6E56B9E811C98DF23D4FAF068"
"920E11D2D30282F91E99F52EF06784D1600E1ADED55BE9C5C140010B9FC3C820970E23EADA"
"5686481ED3C5F45E8BBC2F300E2CF6DF5BFD066537E048775B87A9850E360343C80526E3AA"
"8B092945C2FC410E3F0F8CBA137187249A67339FE250BF0E481BD70C9135E4EBB4B284BE8D"
"FB1C0E51286891310A159923D2A7BE75D5670E5A34DC3DE28AE267C97F860FF106A60E6341"
"8CF390BEB2EE5BF212559887140E6C4E23C884D1F6F4332CD62B4F15540E755AEDB391B192"
"1353568EE2667F780E7E67C97FCC04E05B8CDB3ED2F14E960E8774A1D27D7B95BBC1F9E34F"
"BDB5970E908198988C387352433A13A45FB29F0E998EB5799288E2AF66EAF4E5A80E240EA2"
"9BD58DEB4AC8624B62AE9274CE740EABA910C043CFEBA852F9DD935365830EB4B65197EE1A"
"390EB4360505C8800B0EBDC3B6D950073E523425AA624C31560EC6D11EB43645D399E4589D"
"5E33D08B0ECFDEB595792F97C22096DD4EDF49070ED8EC09F484187D21026DE1BFDCA25D0E"
"E1F9BD2F454C6477A79B08354936F20EEB078F369C698FC67CAB5B7B2B4DA10EF41540A9B1"
"12735A1AE72DB01386F70EFD2323B6CE8ED2D507C7F2B9C03B1E0F063144B54E8B3CDA3B75"
"0A5AE73DBE0F0F3F4B6C0BC684399ECFF0FA7D93340F184D60E63C9BDE8DCF3474D7415D96"
"0F215B788C6DCEEF9E4A9D339682746D0F2A69CAB75A10468CE2D7CCFD8EBFE20F33781E2E"
"008C7FA4A26C5FD3CB401D0F3C8666D07D331B8D9BBE83256337AF0F4594F9F8585B251828"
"0683B3555CFB0F4EA3726C465BFC3AF9C542B62C668C0F57B1FE395D6A8CBA7C3712E33034"
"D60F60C0AF6444C6750CE8C17334F95BF30F69CF6AB49F35F5FFCE1815C7B602770F72DE1A"
"B366154962318A73EFB5C0090F7BECFF2E6CF5CD4A06018B5CDF9E7B0F84FBF2A2E6A8BF04"
"D593435690CE1F0F8E0AFF73C5D4B62D31D3E6B6EB03D20F971A281CBDB35BBFBBF1D3041A"
"E6C90FA02962A9EF7314930B8CA68CF787840FA938A22B70AC1AEC5EAA224A629AF80FB247"
"D9ACCF4FEE02CA073CBDC412600FBB572917FE6C5D7205D7CD49F243030FC466A870E4711C"
"ECEBBBB26FE1D4960FCD762BF2EC3C8F45820CC393B3E31F0FD685BFAF12C0E794515EC5C0"
"3631150FDF9568C5ACECD8C833F8FE19EDA96C0FE8A5340FAFB3D6A3F9957E8C6FAF7A0FF1"
"B508AFB65CB00EF69EB66D9F95CE0FFAC4F9EA939615BEFBF3015CEA65B31003D4F417D482"
"D5484D48492CFD88CF100CE4D2B9F441B6A0F3693EDE9135101015F4E7ACC4FEA2C29B4BBA"
"24D01B9E101F05187A4879991F18DD0518808C4D1028153BB58DF86A605BE48EA3579C5E10"
"31258061C8172375E61DD3BE530E37103A35C9BAA534AB7F87BBF3AA2B09851043462CB78E"
"AD2C64130D44A5AD44B0104C56CA480335B311AD6F3D7A86D30D10556746DBC123A2A1C8A8"
"4C1622C0FC105E77E54B3019761459417EA87B6B74106788755E3B822831F22AB4CD5A6440"
"10709944F469621FB7F6D207FE184FB71079AA2717C991BFCAE8393B253DE61F1082BB17C4"
"952A10B290133240B87A10108BCBEE91E050425F8D262409F854C41094DD0514281906CAA0"
"62CA50EFBED4109DEE2D96AF433AEAF943143340F33810A6FF27B40895FEBC2302D42580A5"
"B610B010541A77886929FD75BD269C1F5310B921B26603675559E8D4E3AF3099DF10C23308"
"456E89834F07CE37752FB18F10CB44699F5D4EB2C11FE1DAEAD771A810D455B9AEF25E6BB5"
"DB9E2F34AE318F10DD67595CA3038FA88D61977D62A00910E6790087A26EAC2A9BC18AE958"
"34C610EF8AA3D0AB705F4999F6213D5009C110F89C52CCB79DA647AC5B5AEA9EFD1E1101AE"
"0E61BEE030014ACEC63C11D57A110ABFFF43F1AFCFCA52B6FB2A2466711113D1E021DCB196"
"291A1D06A1BBF944111CE409D03A28DB2D5FA95B1CCC49011125F5EA8D7669F86E3F65D091"
"08DE6E112F080B3D435556D722E3321F13A4FA11381A4818D0A0B5403CF8EF00EF56EF1141"
"2C98CDFB02921A710B426762B140114A3EC9AB5E07D60AA16900BA609F541153512311A3EF"
"A5F12BD93107228E25115C63AD740B0330C28DF1ECBDAEF5761165762B7B2DD11CCDE0E6C0"
"0F0EB292116E88BF4B0323DA33D6D6EC58E193AE11779B62E3207462B02A9A327B5991E011"
"80AE098B7541C792E65E6D6F8B5FDB1189C0C786B5C698911FDA30990006961192D377C39F"
"87F2832CAF5842A42C86119BE67A0D6E53B91B3A8A297076150911A4F96542C06CC1750185"
"CDD4DF0CA111AE0C6567480556F8A0E6E0B7450DCA11B71F5661F9199F27423D0D29A8600D"
"11C0328031A9DF5BE63EBD7F03CE412311C945BFD19EBA1A7549E4B66BBFBB7E11D258ECAA"
"8863D1B4B56ACBBA8B32A711DB6C36DE47432992845895021AF75111E47F955ABCF8416070"
"C45743FF578111ED9313C9DEEFEFAF5DDD4D167889C711F6A681D4442AE18AC2F83DEE205C"
"A511FFBA17A42F2ECA5B5AA9D80D54E0FC1208CDB97CB3A87E4726DECC30B7B9641211E13B"
"53AFBE017C9A61E3CE0C8F2B121AF51CCE6C7D8FA35AA8CDCB17CCDF122408C9A775733D7F"
"CE2A192FDB7BEF122D1CAA800F544650402EAC748F7CFE123630803892D8564EB496264118"
"7FA8123F4497EFE93265D59872CBA5C4CC6F124858A4FEB49D70CF7FBBC0DAA620CE12516C"
"B7055BFF7C9DCDDAD26F3D9C78125A80E0DFDA28830254D63DE281B8F91263950C59076EA1"
"09E8AC8926437E8B126CA962F373A6279A03FC2778F863A71275BDB399A93C8B458F9F0954"
"A95341127ED208195FE26D27867543F430F3C51287E6672FF32E06DAF29CE48EF177E01290"
"FAD1836A6F7B1CFDE0CFD54468C7129A0F7D99BEE3A731669E255B193F6712A32421174D84"
"6B5CF71D79020A871512AC39025EEAE6298BBD89FB1617866912B54DA3A3BCF3824C7CCFFC"
"2792E3BC12BE6275409E912B9EAB1D3B297157D512C77754CDCA786657B520C64A55A43612"
"D08C127FC61954CC1A26BCA97DBC1E12D9A1253328C035C61F0465118AC95B12E2B61495B5"
"B36843A38F34BC97DB3612EBCB17A809CA8A0E27B598C8FE558812F4E03BF955066F1C9D57"
"AB22C88EF112FDF56CF7EA550F7D6B56B184E35A6113070AA2491AB96E06EC0C00DE6D082C"
"13101FFB34D0B13B0A0713D51E379DA313193569385E344D18597F0FB8B205DD13224ACFBB"
"B3E114B16030BC4619A546132B605D74EB60FDB2C4AFCD6A8297A3133475DCFD39EF18E49D"
"3B80399B9FBE133D8B9FA3A88785BE5145AB21187B1D1346A13FD983FF0CFEB722B87007E8"
"08134FB6CAAEFE09E47DA505ECA58A7A2E1358CC89A3345937D7BFA855E2D79CC51361E258"
"EF9D2C8FCB12522F3C2E9E55136AF85EAEB80B8B0A5FEA258EA854D513740E5ECB18BC3A5D"
"C188EE018AD002137D2446A1D75C14755292628498E67C13863A5672556FA404334F8A91DD"
"53D6138F507F66A944B1D026F8EFACE03BF71398668A82991412FE45CA048F8649E013A17C"
"C72A10127C03A4CC649D7AE16213AA932F3A22DF866BD2919A257CE20213B3A9780BAD735E"
"4E7B66E41BF489BA13BCBFD2CCDA3BB57F1D5E1DE16FC19D13C5D641CE24BBC48A809D1859"
"DA013413CEECC4235A077389DFB9DD7BB822F913D8035853F0A2E452CA65249FE61CC613E1"
"1A119BFCBDEB9D0FA75F1E1E18AB13EA309BE1C94FE790CA3FD3EC7024A713F3473B24E4D6"
"454B80B627C37266B513FC5DF3F165DB2224DC5620192E760E140574EEAB9D1E68D6F9D226"
"9205D7B2140E8BD3B7A72293DD4CC373957480C31417A2CB419E77D21FA19FD4B20EADEC14"
"20B9B92C244DF3D633C2F303A41E391429D0AE90D477D686906026C793ACD61432E7E2146A"
"AFFDF445861FBCFC49E7143BFEEC065342CD73E50D45CDC280F31445163407CC78143A9676"
"E22CC2BEB4144E2D6ECF7FF424B20DEC6AD18F39EA14574499CC2EDEB43BC4941E8E7F95BE"
"14605C1710AF3397413B24859DCECD411469738E5D2143E252933334D919B01C14728AFDE6"
"BFDA3A742C31B6133F98BC147BA29B0F42EAC3064F18A7932D2B2D1484BA148915F826E47D"
"6FF0AFB9EF9C148DD19F9791DA9392686C11B5BADFE71496E957488041D6991D23AC658C61"
"A214A0011A9727DF927E98ACEC14B9C8D414A918CD8BBC9DB4C3CF9F0C9E2D146A14B230A7"
"F891502FDAC49189FB74632714BB489DFDC3AF7A639409AA84E3B96214C4608E461D79DF59"
"13A1E3D1F0F54314CD789DBDB720E7AFF74FDBC19BD75F14D6907FB17CA173B4D3D2336453"
"875914DFA89ED862FCC26FB635F44675EE1814E8C0E3DEC98494509054E20B60286414F1D9"
"1ECC1B4EC2CA6A59408517E70014FAF173E79DA88918B1B98B71C0DFB3150409C44B18927A"
"E656DA9407953FD6150D21F69EA6ACB796FB717FF54AB4ED15163A5E605F189DC84F29AD3E"
"BF558B151F52E0F8E10F0060C7DC6E95ED1CB215286B4FB4E6B2FD334F629F131D59851531"
"83E3CD889AEECC3D358878B305BA153A9C6686F697B3373675CF6946A6AF1543B51D3D3741"
"F565A530D948C560F5154CCDC591A4770C4F0D1EAA00D7A0061555E6979F7186C084B6605E"
"C872BBD6155EFF5DAA8CB12E2FDCED6498E34FCE156818344BCD03B8DC13FBAA51051A8A15"
"71312BBCC53D9AC5DB9F78118483EE157A4A22299817B55046BC2BAB142331158362FD86C9"
"E48749277019BC9CD2D5158C7C1404D1188F56D8D361FD302CEB1595956FE09544D4D05D7C"
"9CCB6CD566159EAE9D052953AAE8AC51D6AB05573015A7C7C50702CDE81577E20E4F7C2202"
"15B0E107967A6320741010BE3377595615B9FA69E209E685745C69010339F50315C313D86D"
"A59889F5E7057F6BDEDCF115CC2D4371776094601FB90445065F2A15D546B3CB94D27E0A2A"
"8EBA306AF6D415DE6045162D1BD2331BFAF41F4BA2DA15E779D8BC48CB220933F4D2F892D2"
"3A15F0935616F79BDB9D812A67060628C915F9ACFE4993B4AF0430B4DB267486291602C6C4"
"DB3FCE3C661327F07B47415E160BE0852107B0715ABF882B02B423011614FA672C6C52F0BA"
"58431AD81BC058161E143E78D42B53306E7DF186E8524916272E1C201CF26D397ACE99D4C0"
"57DD163048054B405300831F35E27CE88560163961FEC296E9A978387FF3B15FFD0F16427C"
"12A605922B5C84882B55FDC00B164B9657E329385B801B419F066A00071654B061A80514A5"
"E6EC9F73C782977B165DCA9E54C007A0974CBC92AC05B3501666E4CE565197EC35A4BDB64F"
"365FD8166FFF049553510A13D9C4C2757F2C3616791994278DB2626AC61D0494B42F5A1682"
"340CA14C6604D8F3DAD289C5BC52168B4E5DD2C33FACA43CA712154F6A661694690F625BB5"
"A40263587ABA61D5C6169D838B8478A804092245368E54FB5416A69E0263AE2EEFDAFEBB6D"
"9C52DE0D16AFB874A40CE77D03500D250D105C7D16B8D371CD5983B52906CD738E98BF1116"
"C1EE25637E1D378AE5C76FB137E05F16CB08E76EC9D8C54C040B49FF3CDAD116D423978BB0"
"2C2DC97818676A7484AD16DD3E9391DB83910A445881952A8A8F16E65978ABAC1E8D42D565"
"6535501AE516EF7489FA700166681AF48E4024FDBC16F88F8DCB6AFE9CBF00A0B88F9D53B8"
"1701AA9A1452D678F705D50002D1015A170AC5A58FA162F89DCA7CE877CCCAA21713E0D1B8"
"2E8900AD835BD0EACE6498171CFC042379D4459F8645B9ED43C7311726173BC8A4AACC75AC"
"7F7644C6E32A172F327D17029733539E114B2DB514A117384E02B5D6F408EE5615C2138B2D"
"521741697F06435B6D7339DEF7661C6D69174A84C9E90DB155683733FB55A036A71753A05C"
"633AAB3E3C34A168FFAD6A1C175CBBDF6467248E59269922B0CA84541765D761A1BFF46E65"
"AFE68884BC1412176EF2F2CEC1078EE7C427A8685A86FA17780E9A5B10D81F4A9EAF31880B"
"3EAF17812A5DEF5ECAC90725D63DB339665B178A4632847D98D1D163FB058D2BE66D179362"
"0F0AD4CA2DF152BC31842C10E3179C7DD02D8FA411D7225505DBBCE84317A599C6E078608C"
"7466F40A9E9BA75C17AEB5B60277666C74BCA572493C56CC17B7D1AED1A68E81B34350BF0C"
"37A01917C0EDA37763406D1720750FB73E0D8517CA09D3E6074471037689AD97374DDD17D3"
"260BF58CD48372427437FD552B8117DC422ABACE227D89AA29BFB35DFDA117E55E59E3D0D5"
"CAEFCC04A0F59662F217EE7A94DB75FD9D491DD21B4A2532E717F796E42E51F22C7F811208"
"520C32561800B341843BA93EF6A575406B527C301809CFC56F339EF30574FE47F4D431E518"
"12EC04EC02F2F66F4CC7908F8B3F82181C08AEE22E2D72D3E1503069DD0C8E1825253EDD5F"
"867D1B50C11BA329DD17182E41C86D6DB3781F20B402ADF98BF218375E5B79032134461E09"
"1CBB5D974C18407B00D90DFE7E70FCEAC4103E9D0A184997C6F5503ABAFEB195E4281EEAB4"
"1852B47D93C30F6E0A4590065F967282185BD15CA7A084326196A2AE93FC03D81864EE0D01"
"021077F9B51389FABAA9AF186E0AE9D6DFA8CE93AFC426379E062A187727E8F726F54CF07F"
"0E5A13A5A16C188044E66A03038597797257C59E629918896201D2BECC01EE2D25FD01710E"
"6918927F0DC7BA898D6371BCD5AB464FE7189B9C0EEDDA479C4BA76EDA433A784418A4B93A"
"6258F023582F18915AA43B5B18ADD68185537D9F0141CA8975F6040D18B6F3CC7E8780D542"
"8E57F5FDD6D03718C010EA8C48A1CECEB89762FFBC086618C92E5A45D43C69E48CF59BC291"
"854B18D24BCC1EF804EAF0B77DDEF9110B3818DB6925F4CCF5336395E77B2FFE69B118E486"
"A22768B263BA6C3A07C973C68318EDA433D6265F7788D10197FB5C99AD18F6C1967B5061E5"
"9E376FAD950B2D1518FFDF392ED0D39EEAE6F4BE2569E3341908FCD19CB40AF30E9C643B11"
"1C8E3319121AA7EFFC6BF6892CA5EC8E7B45D4191B383FDF1865375EEDB65DAEAA36071924"
"55F946342D0B280A2A238220424D192D73D40BB8E6BB737BA985BF2D73B7193691B705C561"
"EB0EC45563AF5D6483193FAF8722A407E8A0BAF03089EB01441948CD622A726E67F06DB869"
"F3DD85A31951EB8B7680EB81902ED6CDFC90C6B9195B0981060416B8955C8062E45E14A619"
"642779B47FC4633F2B895FF34AB60B196D459313874536E52A7F68713E7342197663BAEC48"
"A6CE2681FEB491DE24B8197F81F1617E8F7D72D4D66D53830B8D1988A02D186696E5D79DCD"
"414643F8171991BE7EBB65F748E54ECA6CEE21C744199ADCCA86FCD9ADB15B6727A9DBBCD5"
"19A3FB2B01AD02EA63A9346CCB2849CA19AD1974F7CAA09EC02D6CD2CE3D006019B637E338"
"14AC0FF27E0FE93EF091D719BF565DADEE5D5B5CE5AB4B5D0BD6CD19C874C0767B97DE19C7"
"BA94CAD0EC7619D1938494ABFA89B0A1BBBBA5E1DF8919DAB2338D0F6A1FA199E74DE132D7"
"7719E3D0C5EF2E19CB11F2E0015344116319ECEF95AFEE22BBA5601F0D31D26A9319F60E45"
"C1B32AE4F99069F8742C862819FF2D027C2129B99A165BD7F24D37A71A084BEAF6F60CD1B0"
"0D783D2EF6D94B1A116AD697158B73EAF845E3BC6702631A1A899F022583B3DE145AD76768"
"AE1D1A23A8A016E679F806DED82664FDF9761A2CC77D103847F68720686C93C28FB21A35E6"
"8E779FA8ED9FEF3E19BCB55BA51A3F05A169BF2BFA53503882C703A5D21A482492A6B87A2A"
"813954DE049A79AA1A5143BA9375CD6D0E6DAE2193CB73AD1A5A631DBA846D3F3FA855896C"
"1724331A638233F65278C3C83238CFB0C099C71A6CA17568AF49F7EBFA66757D8F1C8D1A75"
"C0D8665DAB658BE59E81670D83B11A7EE04345787F34B17468E6D60CF9F01A87FF84EA552B"
"0B1FAB1E57E376E1471A911EF5CB7B4D062AC9D3BE1BAAEBC01A9A3E67447DFC8826303536"
"6DD289A61AA35DFDB351474372C979EF6C77EEC31AAC7D9BE35BFCCC05C1BD0644E857F21A"
"B59D410E088FEE8BD222AC4711293A1ABEBCFE2D0A5E46734EF5CE08BBD03C1AC7DC894984"
"EDE1A120A83527B83A471AD0FC24CD220500CF7D60CC6F6372941ADA1BF2D8B4B3B92AE681"
"8FD179A4CD1AE33BA92275D928A74E51E41EEDE1201AEC5B988D587FA208B28A42CC2B02DA"
"1AF57B66DFD7A7360669D5F4E41CD8A01AFE9B4D45BB99A68A33D262357734D61B07BB5E4A"
"06171C812FE2023A6EC9EA1B10DB59F94188F5EA3B95F18EF058711B19FB637F6D3606191D"
"6E1C809974AE1B231B846DF9B16C0B38D3722317D10C1B2C3B8E192C41EFBC629CA1D2522C"
"831B355BCB175734F9E5B1A119361576FB1B3E7BDE0F66B65B35F6FAD1BD25B9BB1B479BFD"
"13F0955FA1C1E52D1BD92F431B50BC37E9DCBD9C67F0905645D53BD01B59DCB04F987373CB"
"2D7A718000D3211B62FCECAE3FB280E4A39F5C3114103E1B6C1D732C1E07C763024923FC09"
"21EB1B753DDD29C1D8483E81EE300B3F06201B7E5E4885EF822EDDE568B0FD67A9201B877E"
"DD4CEC503027A07594A9998C6C1B909F52472B5D6702A809458F7FC4071B99C0010315B8D8"
"15C8808090D51E241BA2E08EFAA42FD5CE1D81CB724B82C71BAC012C0EB9F068DEA85F5C4D"
"B862981BB521C8BFC6B9915109CE8F81D3EC211BBE428BB9D295A89F0220BAC9A5BEDE1BC7"
"6365FDEBDA24118D44765D5C13861BD084572F084F0F73B8EB4BC63692DF1BD9A5271BAC76"
"8D66BDD7CBFA211C471BE2C61422E1EA22C6BA6C48FFD2A7C41BEBE709EBB69DB1CA49BF95"
"8D8BB2FF1BF5082C4EDBEA0B58F6C1016EA33DE91BFE29380C74712A5554BF5A972351721C"
"074A1A31887C1575AA5DBD6C75B26F1C106B2665D0ECAE14AC909A790865341C198C45F8B1"
"DE54B03E0988411F75481C22AD6E79320B31024F9AFB7F5D28931C2BCE908D3D6590A65BB9"
"FC2258517E1C34EFB31F8F2B38981C6446FFC976781C3E1116392CE36C5E53B9AEB6219996"
"1C4732771AB582E0F356E31E857487101C5053CE801388411820B7FF17AFD0C11C59753BCD"
"CF488FA3BD0C97966E71851C62969632DBA46FB0154FBF3F6F8D251C6BB7FE657433654B89"
"301541D847F51C74D995C239F995918D48BFFB9254871C7DFB143382E5075C614D3367A723"
"D11C871CACC8261DE37A09B44D63A3C4691C903E68A532D39762907DD3FF1CAA6D1C995FF2"
"A7A7B66DEAFB22318100D02F1CA28182E3C635ECE4D0CAFEFC26EE1E1CABA33F16069B1098"
"54E2EE50E7FA201CB4C53AB427FD7C8C5011A0B8394B3A1CBDE70B1C1F3EA82B81A2E2F5A4"
"3CB61CC708F5FC234AE253BC57203283DC721CD02ACC86AE20639D1D868FC66A5D8B1CD94C"
"930DA7869729005799D771E5F11CE26E9617204BED8068F081541E2B251CEB90B57287BF36"
"EE03614EDACC56C21CF4B280DC1B0962E276F7B46DC0DBF41CFDD4A9597E95B2AC29D900D5"
"B7E8041D06F6C150CEB17FCC8886AF1D238A331D1018E578A138101B1B97A88ED50F0E1D19"
"3AEF2EF233271D48FBDF25B18FB91D225D50781324C7BD5464616E04E0CB1D2B7F6BB38EB1"
"904B5BBDA09EC2852E1D34A1C72E286CBF01F918FDB151629B1D3DC41B999C427530AB46BD"
"65CBF5FB1D46E678B69B6B096257B23F71A487A31D5008ECBAE37C1B1ECCB9F901F3E1711D"
"592B4C80C4C8738F368309BA14A3551D624DCE8610E0F49642F2122206F3661D6B70274C39"
"B38C380F90002F6841B01D7492BE604615EE2FB8B0EECA5D0E2A1D7DB560A89200F026855E"
"B669045F361D86D811931413E6808075E0177C62481D8FFAC1622680C254ADB27E3EDCF4E8"
"1D991D6D4230C5E6D38E2A5C28B98A821DA2402E65DBDF0233EFACB41581ACC01DAB62EB5D"
"3BF2433B3A218D39DA8C1B1DB485A1666F15905A9F0376F5D337F81DBDA88A3ABFCEDECFDE"
"74522A1AD0201DC6CB5338DD79E61325E8F0BA4F12D21DCFEE3E945F35F043C2E3C424E1C7"
"181DD91138367F58C6982A0A7627FE9CF01DE23433EDA64E65BC5D846B7E33845D1DEB5733"
"DF362260681F96C4505C54341DF47A4E802DD1B7338804AD40ECBD271DFD9D3997A7950663"
"D557BAEFE2973E1E06C05E83DA0F5BD37AB00FF0F6651B1E0FE37B146E07FD496A6E813ABC"
"796D1E1906AD89052951F48464ED1BA65EEF1E2229F40EB87889581F8781D05F43E91E2B4D"
"4D6A041665D85D97E9126346C71E34707E580617744B1DA4744D9D44CC1E3D93B8537EEB81"
"028495772BEEFA951E46B70D28B14044AD3FB9AE74174FBA1E4FDAAD09C41D395F0225B50D"
"7A4C051E58FE17E5492668E6368B229A6D32921E62216B99D5E8E8A944DEC244000E1A1E6B"
"45030400EC57C8339D81A9F889331E74687752818B060A08A9D23919E4261E7D8C32DC1E4A"
"804FAE9E8CD880005E1E86AFD3BED8B3002DDEA29A335616C81E8FD37E4E70B7B8BBB36B6A"
"997190E01E98F742361769CF196FD39328A8B46D1EA21AFA1402465622DA12CC3AAFE07A1E"
"AB3EB6A544952B6C5C7609B21FE6D71EB4625B28D559A3EB7816C940125DA71EBD86439317"
"FBC94BC8BED58F0BF6B71EC6AA0C899B7FFD507E9EF1BA3FD54F1ECFCE1672A6BF8D4BC8D5"
"51ACCBB9311ED8F1E79F24560D0E712E6B7C68B00F1EE215E09C2427010CA38C6FB6DBAB97"
"1EEB39EEC8726F22BB430EE8321510F81EF45DEB3CD0DEFE6A549EB43F7780DE1EFD81F02B"
"6B36830B048BDB5C99EC171F06A5F576831B39F04E8F5FEDE83D931F0FCA2CC9ACE2954AEE"
"391D43974CC31F18EE746E5723D13520087711C0FE8F1F22128E89B5EE86B524C1B4F00D62"
"B81F2B36C94A0138740AD823FCA6F524E61F345B114D50D754A30DBD3CD15287EE1F3D7F69"
"56529EA7CFE972E1A35FBA771F46A3ADEA26F71BB21E23499B3BF0E71F4FC82B4D77432211"
"D7C164EA65A5F01F58EC7BAC4ACD46F2C26A5CA8E8240E1F6210F4E0825E830085DA5727D3"
"6A431F6B35734A643D87D98237056BA2CE951F745A008F8D4CE79A3A32AB142DA4131F7D7E"
"7D6AC7F86D1AA1255B82E671BD1F86A3130937ADD1E7BD19B1671DED4F1F8FC7C0BFDBD5F5"
"14609827C7CFFCF31F98EC6A47EFF9B7A20253FD988FEA271FA211297D670E52977E9C0893"
"73B5EE1FAB35C6665EFDE10B04225D5E0B15AF1FB45A7468F6A2F31D971271BE1D20151FBD"
"7F1242383C5F21694D41781156011FC6A3FE95DB3B9462222C1E72FC97601FCFC8CCC49F46"
"409AFF40ACFDE9A7061FD8EDC78B86E267AD4D4E2726C41F591FE212A8C48508608AB9B732"
"F882048A1FEB379BA4D595D7221A904507F93DF51FF45C9C647E5062A4CFDE7AA72C19E21F"
"FD819621C794C11B40ABCDFCDF40832006A6CAFEC68DB09BD57E7E22550EEE200FCBB1C2DD"
"D39C811327E2B573DF122018F0CDC5FDBC257399897F48929319202215F5D5273E6F9F63A9"
"EFC073B2A9202B3B380B62021C2F90ECC0DE5F20902034607A4077484F0D09F37D628982E3"
"203D85B39990391EDD6A41FC7736957C2046AB1F771719CDB3191B23465C7F2F204FD0643D"
"A8F8016B18ECB5B8231A2F2058F5B8D388390025418206F7B3241820621B2A246CD1194420"
"B905441F8343206B408E53E7DC2745BA4455B8202C3F207466056FA155622D05736AF3BB81"
"8C207D8B83ED49DEE88CCD22A2215B173A2086B11FF11FBF92F4E32FBA991A7D5E208FD6B8"
"883FC62D47B64CFF6A105BED2098FC471513D9034D0AAA3B83DA1B2720A221C18F235CB4E4"
"902494A9F2A99820AB476AFEE64C5650055AF67610731A20B46D28905A28246C7F673E182A"
"F77020BD92E016D33E11BF9717E15DBB141520C6B887B1A8A97253DAA5D8D3C448CA20CFDE"
"4C458F8324748F65481F35993E20D9042167D4D0C4FA17FE3E012AACBE20E229CBDC66D5AE"
"1F307BE6756DA12220EB4FBC9D0476EF6BE6294F079C580B20F4759DBC57BEA8DED5FD4AAF"
"E27E7220FD9B938961C2ECA62A835E2522DF3C2106C1BABC3A885A8296888C8DA21BC4210F"
"E795E75BD5C64CE8F1124572FBE821190DA32308E97FEE45D123CA77BFCD212233BAC7309D"
"68235072E8A438EB68212B59F40B388564D50A1474BDE80B3C2134801405F88B0F301AC285"
"4BA34A17213DA629169477CE97336456F6AC70762146CC760DB5081E177DB9A2B4BCE7C021"
"4FF2B7108D4290D817DD7C4858ABF0215919083D1BB3CDF2D23F35E2FE3FC521623F39B1C3"
"039288B24D9C4FF3B0A2216B6578B2D86D9F6DDF4577C7E2E5E721748BDBD997236C6D3D87"
"82D0B0960E217DB233FAE52406F43583B27308D6A62186D88AD586AEF8CF48C208D1717176"
"218FFF2B27D6FE624773D92A12C12A52219925767DB02EF57F9F4C4732615B6321A24C0A22"
"E9080A18C15A1A049A859E21AB7290C8AA21EDB1B68C43507EBE1521B49923B20D1F8BC111"
"397B2C5DC5FD21BDBFCC542898937A3E1DDBF3FF681D21C6E660113B6ECD7937C933AF01C7"
"2F21D00D042F60EA91D8CDBFA7B686CE9B21D933CCBC1A8321C1736A453C91BC6D21E25A77"
"80848394A312CC6C74041DE021EB814EFD9762632D20C1775A08117721F4A7DD4AD776441D"
"EAE170A785785A21FDCEAFCFE2A0441FC3E86C3B09E0562206F5BD59F793BDD7C8C23D3E95"
"FD5122101CB7E0316479FBE988BBC044FBFD221943A1922061C3F7ECC763408B694D22226A"
"8CCFA3A9E69C05511617E0869A222B91A0B369F70ED159702C5FC73C482234B8B54DF9E8E6"
"D7DDE66E1528A62E223DDF9282067A4012DCC6A6EF58DF82224706B725DBC8A50E02739FCF"
"05298122502DDD98D82F64C2E26980724F76DC225954C4A12CFC5297ACF9905335EE9A2262"
"7C24D9AD8672AF49697050E410DC226BA3693CA727C9F130A2DDA9F1131F2274CA9CCEBC0A"
"7B086067BB7268249D227DF1D02D0BBBBE599357E81C3178C62287193866224C254CCB41AD"
"7B59C1A32290409002E5136C832E0B8A5641184E229967CB42BCB76E8C1585BE6478554422"
"A28F1D053FA80D79AFDF23E10F3C8F22ABB6A4650004483B3FBB54A1FF104E22B4DE0FE362"
"176065C0BA9E9B9CC46C22BE05902DFBB2243279BA24BAFD6E9822C72D2A3956FE294DB587"
"B78B53E40722D0549A7CAD6ADEDE75C5BCA6F4BA0822D97C45FAEA9565DAFB9F2FB62B9555"
"22E2A3EB4AEC25D17F9C63DD20E2022F22EBCB74EBD4C5F8B8D75966ECE6AC1C22F4F30CD2"
"1E339CECEE536EB0751F6A22FE1AD1876E9DC8A4E8AE8AD63AB1DE23074279C87A08055388"
"B2B9171C969523106A6523C20442DE387E6C8D20DF342319922120FFCF629540864E945F8F"
"882322B9ED20328F9EDF743E3AB9EA9488232BE1D7CB52716B79D3EC131F7AB341233509A2"
"5FC36C0826D4048079D4A02E233E319F81D65E84645823663566FFB82347599CD42928E1C3"
"B7D2D1AF4A447D23508183D887E79B9D40A9FF28A231592359A986ECD5829A45EE95EC5FCE"
"82622362D174E734B3B648B68964D4560ACA236BF99E153D87FF8D39A22514694217237521"
"B9242A0E882C87C4645930CDD6237E49BB676AFFEF720E0D63600DB215238771DE2EF7548D"
"437FC8E7A26BF88123909A493A6200DAF0F222F66A860E0A2399C262B3DEB0DD56363FFD0F"
"6CFDFD23A2EAA983A6F2468E87BEEA53BB509A23AC12F4F37E4F171B50D1EF3135914723B5"
"3B273DCB0FCCDA189A2C120B4B7623BE6375C0341BB0CDB74A4E806C5E6423C78BD4AF99A0"
"F3C976A1E3475483E723D0B45994BFF5F3E072DAB9DD40FC2123D9DCEC12B110C64592BC60"
"E06B90F223E30562F30FD674819AB210925ED67C23EC2DC0624E9B9D9DFA55DFBE82036F23"
"F55600E067A5A4CCC21A30F55B3D6823FE7EC6941EABB7C152EDA70CFEF72D2407A7427828"
"0F86E5592B20DE070E7C2410CFDB811C666B8B00782FFD5A81852419F888BAC998620951B0"
"2AD83EE07A2423212AF68B0CEBAB41AA7D256E766D242C49DEBF093D90679F3D1AC84D4350"
"24357286F4E058C89F542A0C85768BC4243E9B4E74EC8CF513A746EBA664EBCD2447C3FF67"
"A0664700D2EB09F197A0072450ECD5BEDFF2703CD8BF7472B3D964245A159E24DDF4AC6CB2"
"F77E8805832A24633EA5679A9A84F5EE675A14921516246C677B656D82CD00518E9FD403EF"
"4B24759066498928BBB6CDB049CC6D1671247EB928A5E16FCB1D4C817B2870BF452487E244"
"B6B5F0AED913E35CEBED581824910B751006E33F2F3A0EB9FFFA1CFD249A344C7D71FAE4AD"
"34FBD2242B1E6424A35D5EA3C94D99EC19FD4F5813433724AC868276366FCCAE5001644989"
"6DDE24B5AFB53E16E81B8280585F59D0742924BED8B689D71628BEF80D1AB2E210A024C801"
"DEC08533835B912947D0CE70F124D12B1EE4441B703EA0505C5AD5728224DA546DEBB908AD"
"58DF34BDA9471B7324E37DAC2769BF6A0E62FD7415927D8424ECA71D353EFD3599F903D12E"
"80011724F5D062BB56462AC97D4B820D629B8824FEF9B901B34C982C3E559E7DD4B8E82508"
"232A2F85B19D0698BCEBAFBDF26925114C69E36DB4CF8833A69FB61A97B1251A75F0982093"
"E77E79D23D3EEE959D25239F6CD2C5B89A3849E4E05FA47F60252CC8CB5260348D86A8E825"
"98EC57E72535F24E5EDE5F43AAA48E3F29B6CB6B253F1BE3EC6229F08A934DB06941AB5025"
"48457C43C692CF1311B0D7FCEB02B125516EEC8677F4A55BB349436BD8257B255A98F25962"
"31281D8C3CBE9A0C8E7E2563C29196548EF1C33F05EF56CAA509256CEC335862DB9A0571CD"
"B28123CDB2257615CA79AA5DC7B13AAE591B2B93D1257F3F96F1DA921EE8EE8F40414C9426"
"258869708AFF53DE87D45EDA61D531CA25919348FBFC0A0AC474F5CC6AAAFD78259ABD2389"
"293E339CD2FA35E80C0A5325A3E6E16858049286D57F9C48D3B73425AD10CDE8886D399942"
"5E6FBC2D5EF325B63AD81C8EB8C6A414536E74E69B4025BF64CB48B9B5E0E31391A22EF1A5"
"2025C88EDAC7D8036179ACC86D91C3BC8B25D1B896F414A7C693882A8821906BC025DAE2C1"
"0B392910AD5E82B446DF61E025E40CB4B6636D0D0260C6DD4DEFE2E725ED36E65979A6F73F"
"4DA10D91E4CA1B25F661176DBD3E36AE3C8D0EDB1F88A625FF8B3A346A695CAEEEB93AB67D"
"24C62608B57320976FC70812AFCF644B57012611DF8829C7FA0A915B71E4698167A4261B09"
"CD8FE98C0C13D5029849CACEB226243407743D0F8A02093CF226AE5BD8262D5E495A3CD89C"
"EB1431D0E29851DA263688A3F5AFAE5C1CBC2B1ABFF71FE2263FB2E932797F389D4F259AC4"
"6E34D62648DD5D2C414A6BE69067C182751D27265207F318739DBE85FA56E6F59BEF50265B"
"32376D84DD931F2DEC2FC0F2B53F26645C91026B8AA0431C64A66FCA4C42266D87171F7FB1"
"B4A93128980465E7102676B19A172DE825F347B2F32EB3E4A3267FDC1E0204A9DFFA373287"
"2A706A61268906A8A20A0194088B706239BFCCDC2692315619B0DFAFCFF1A6EB20ECCE9326"
"9B5BD5379BF91D6460269B65AE2EBD26A4866B91964BAA9E87293CBE2E1A1626ADB15A4C68"
"26225884F0BE724DB0E426B6DBDF8E89CA6D85DB8C9D1E23752F26C006A25C62F2FB0C8755"
"AFB96A741126C9316E70F92DE262B4AD68019B45A826D25C376D423875EFC40859AEDEE23B"
"26DB8718ED215F6D6F7D419D48467C9326E4B1E09DD32FC3CF733AB5BF64124B26EDDCD917"
"69BA6BAAB611DD8AA9594D26F7079EB04FF62A180E94C2853DD536270032947498BDDC336A"
"83508F3F2D5427095D84A8C1D7F3D8AF1EBB91966E2D2712888855F6F895371EF01F2987D5"
"99271BB379CC93B4002E0E793A9D7A043E2724DE9D056881F1410812A189B0358F272E09A8"
"92362DFC2D07154C6CD642E2273734CBFC982C7AFFFAC02A071D587027405FE9B6BBA3EAE7"
"F795C87DFAB9F427498B01E63F3F4580553DCD5CD796CF2752B62A0D00D44FC8EFAD979277"
"2887275BE15F5EEEF037B39642319A87A7BB27650C87381821FD7C7FEC07E654E045276E37"
"9B7C073ACEE3275AA859AAEA82277762F2662FA3B61153B5C823A6972827808E4DB3A1C4EA"
"7E3D902C607520C62789B9A6BD4553EDC093ABEFEAF305832792E4CA30795AB5C2C912DFA5"
"FC66B5279C106B1A3B5530FE69FDD6271CE8EE27A53BC91AFFB49F3901FB5FE0F7452727AE"
"6733B755702A38A49BC2B57D84A027B792AD74F4CD7D92A17C6B5DEE229127C0BE25F09E1E"
"202869ECB88C0B354C27C9E9A69B7E3A8CB7CE2350C78E8ED027D3152A2BB4485F104065E5"
"DA7143DB27DC40D37485CB08DAE3BAA4B0E66D0C27E56C6A30C6B675EAD42239BC82568D27"
"EE97CD0B5455AE0DC665223B31E7A627F7C35622C3099589A827397BE72AD52800EF452462"
"6A167DE368787DF51B38280A1AF90C10E5BEDFAA8CE03B3ADD74281346AB7E04D3EF931437"
"45FCB1679F281C72611DE21129C7CB9949D74C1BDB28259E368DAF561D1D296C2D9E181E35"
"282ECA21169014C62397CEDE30964A362837F5CA2C54F4E02C36490C2A0E8FFA284121B9FC"
"14EC2E03C68DDADE6A2CDE284A4DA2B8071255BEBACFC5CA70E50528537961A8C31B52FAF5"
"83306FCF27D2285CA54CAEC6CE1536315EA97B3148C72865D12A1F7DA3BD6C909C5BB12196"
"99286EFD695362560E4D6AB3500EC9912C28782967ABE41473B58E19C91B54D87D28815566"
"D55576F45C4A12746348010A288A816FF54DEE33A02F8177EBB26C832893ADAFBACFB69EDD"
"8D833ACC30580E289CD9C6FDB11E9BC4FD33B17908A81528A605E6E1E7C7EB4BBE75A7455C"
"E64528AF31F071FC4967BF6D1423E7840D4D28B85E1E9049AB20AC13C3C2037E7D4828C18A"
"865B64FA100F3CCC50963EC29028CAB6BCE41C220952F2731B3C469B8728D3E31229F9C2D9"
"DFEA40CB81F4BCA328DD0F381A347930F520C290AB29E8BA28E63B895A2D8181BD12C67113"
"D9248728EF67F00C2A684806A14308FCCE833428F8946AC66843F47CC78086279A30F42901"
"C0D2A34A61352EAB45E5FBB97AD7290AED1672AD6513BD058A6989EBEE89291419882BD0E4"
"0AA6C0A2A45EFC60C8291D461B5B2FEB36233354D0ED89B2D0292672A9BA0B6270FB30659C"
"3E640D9E292F9F33A2EAB23ABC5570B821BA0B342938CBD110D1EEADE3F5269B2523E59D29"
"41F877D495FD0812A744065D790842294B250F30E369EDE35A540997CCA9732954519803B5"
"DE2F362941BB378D0CC1295D7E5090CA131787D47695E550CB072966AB110D44D707D4D07C"
"5B0B5DB781296FD7A82BF12403B09176CDE34983A129790454EF874362596AF4B0389F8BB8"
"2982312F2F98C60B31D450778EE6921F298B5DEDDAC28327C9DAED7D21CE4B4B29948AC310"
"58D5CDD8C299E9E70832AD299DB7753136D0282EC5521A6976517429A6E478CE93171316BB"
"1495E8D0F88929B0114060A7FFDDAB70AC9FC2C90FDF29B93E2045085275A4DDBA856CC37C"
"9F29C26B1E0EA8B4600C3845A8C684E5F629CB981307686A3476B94FF8639C860629D4C529"
"0E223AC9F2E82793A8E3870129DDF2270C14AC21730B74CF13EB85E329E71F342EF49963CF"
"57709F4561E31B29F04C33EBEC7B9D14C12D1118EA868929F97973748CBFCED8923D5ECA18"
"E8922A02A678BE5AA07AD6A17782DCC551382A0BD3990B8F7BD65113C0CE923267DE2A1500"
"C2E717111E9EAD1CCE04A8B0202A1E2E0383D05AC74BA46EDB304FE44D2A275B4667A81513"
"38FD316102C9B5672A30885B747BDDFEDEFAC1485A12F1042A39B5E73BC76ADBCDA4922D23"
"EF1D512A42E30C2C1605FFA0A54CED5808504F2A4C10497BFE2995E639CDFDFA0DB04F2A55"
"3DCA4B5300169CB0B02461F78FE42A5E6B27DD2F0A844BC5A7F0566515D62A679871830E72"
"76EF809CC8B403B4D02A70C5C1EC524ECEC5E6364C489B7D142A79F32F8D1DF7A70687F3C9"
"775EF8A32A83209B2AC01DE8B2EC90B04AF4DB902A8C4E5483E87AB164801189BA721C472A"
"957BC8348D165ADC6AA0281A00A8A42A9EA94159BC0DAB754507DB069420A92AA7D6DE42FB"
"41E772BE3A33089CBB2F2AB10467A9C65E2E405B7E88881347402ABA3229647DC791F91FA9"
"3B01B3011B2AC35FD8EABFD0F17E34C53376EE12A92ACC8D679D7C5FC08B89B5203C0F3E38"
"2AD5BB346E1DBA0EFC87BDE044482DCA2ADEE8DE8BDC2F450FC335E91578A5752AE816759F"
"0BD8BC85B5360C809BB7382AF1446A399B0A84A857901005DF5FE22AFA7247657992A1E1AE"
"8885584145F12B039FF12F3476B8AEE160EC8F083E802B0CCDC41E7B54BA903E74E02D6E5E"
"242B15FBBDC08FB34A15A72D6CE1E87ABA2B1F29C8E819A31319061E4148C1D1E92B2857A0"
"C3828125223459152933B7B12B318587B7958F7D290D7CAB3B5277ED2B3AB38B12A070F0EE"
"6FFD4A78F7141A2B43E1777511AD4F4BC45345619FA4B12B4D0F86F28DEA21F119E3CF87B3"
"87992B563D875691FC104038749EA489C1242B5F6BB8EDBA731C2884FA7E5C4A741C2B6899"
"BAAEA0545C898F3AD6CC8673782B71C7C8F0CE186AB941DFDC3A0E387A2B7AF5EC6C5B71F8"
"72E186F276DB61862B8423FDC73A7AD068BC5748ED54F9882B8D52485A57C74A011AF88870"
"20A1962B968056582EF58E7B2B7420C348FB062B9FAE946007EDED0056BD89798B8CAF2BA8"
"DCFAEF9BC18493D0F05431462CB62BB20B253630A0AF5ABE3F97080325952BBB396682583A"
"3CAD91DAF61B74C54C2BC467D2CD05AD948A6BDFFEC5E0556E2BCD96079A56C8A64CC2241C"
"2453920E2BD6C470B366BEC37A65A15D49FD20C92BDFF2C81EE6ED0FB24E733FFC73597F2B"
"E9217B6AB661D65E011A568579F1D42BF24FDDB3B015E5C16C81D914C82C632BFB7E3CCEA3"
"9FA8F3DE637651828B602C04ACDAFC44115565CD34CB2B720E612C0DDB095C9D3B67D194D1"
"0345DD159D2C1709C2FD3A0FFA8BB7B900A3FEFC382C20385331452F2F8C9C56337D2A9485"
"2C2966FE78AF5E9DCD8B3AE9BD4666252C329581CE2B00C6D59149A0FF568F6E2C3BC43479"
"F1461784AC02416F7C3F272C44F2F1385C006ED9B9CC222EE3F1E62C4E21863ABA88929FD8"
"D2263A59FE642C57505B014B5094B47A8714CAAB5C922C607EFB7E1EA3A52A6892D1BD7FC9"
"492C69ADCBEF567A76B68902664283DF602C72DC8FAC1FBA9536BCC507E2B3A7512C7C0B79"
"0A2ED705CBF92D85E9836F272C853A4A7ECA2B271EC056A5E3781C952C8E691C49CD1E8F98"
"910EA5B1F3D79F2C9798017F72B3523617D25899B022DA2CA0C6FC9B1CBB4C20344A9272D7"
"52042CA9F5C6BFE59E52832191EA7600BC722CB324C6D45E83E58797C42F896BE85B2CBC53"
"DA96BB05342758099431BAADA42CC582B451E55F51C2E19AE15D95DB112CCEB1BD57B0481D"
"DD2E71ADD58B81AD2CD7E09DC9294025DAAB207F982F08C52CE10FBB4DC2CF460BA1E38E41"
"0BF1D82CEA3ECF6E58284371110F89B99A03192CF36DF8D0E09CF3A99D3A21EA0762D12CFC"
"9D28D806C4B1D7550AB1721350D12D05CC5D93D22E99A9B4B31DBE03C2FF2D0EFB8CD35153"
"F7C8FB135B9E77EFC32D182ACDC00DB1935C7E85DD317A7B872D2159F75D644551FBE1988B"
"8D660A072D2A895659AF56C17F83570B8CC88A872D33B86A97A2907228ACDE4CA0BB0E122D"
"3CE7D87A711BA5A27F63AF08DDF6A92D461739FD54A18AA1313CA012FF55C62D4F466EB73E"
"D9C30AA8EE193609F6872D58761764A2A0C866F9D4A81505AEA42D61A56A9474F0FCD1ACB3"
"96545217D82D6AD4E86B0F805237F8FFD8D9AB336A2D740440E7247EFC57FB4D8E46479EC8"
"2D7D33C08219D28BADD90E31DD70A6192D86630C12F132A512A25843E0FCFEF52D8F929F5B"
"30BDA01882B8F21FD4513A2D98C22FD76DB04EF16F03F814D2F9362DA1F1BC9766B0C77BFD"
"5FE5A91F79792DAB216651928E101FC3429A101405EC2DB450CC23A91E3ED971C5A051F56B"
"4E2DBD808CBA527620C8F84B28709062042DC6B01207252B6862B07CD2476209D62DCFDFA9"
"D043D1C68F5D27106256E5742DD90F7398DEC3C4E55808AC158DB1F42DE23F38B7F466CE9D"
"DB997AE98F24D42DEB6F09E0361B32B9BDC4D0F0A4CF5E2DF49EB24BC5C411F808A469BB48"
"88D52DFDCE734D43EDCF59E666A36CCE19372E06FE3B3CAB46C27EBED92603020AF42E102D"
"F7DAE57FB9BBA8927973886F452E195DD7C1E23753CA1F1E15F04576932E228DD1B975F211"
"C7A7DD23F52E3C112E2BBDCF4F6DDB6F6B1FAA13975B9AAB2E34EDA5C9DA23023DC7CACE74"
"6406E02E3E1DB53266A9DA89727CF004DDD2F22E474D98B48E01731F593773C86C0F9B2E50"
"7DB76085E77891B080B4DFC9AD542E59ADC2CADA8C680408B464BC1CAB4E2E62DDB396F82F"
"DAF6DF4E5C955422EC2E6C0DDD1DE6E155E1C15055E1878D612E753DF74080AB84A6C5453C"
"33F567B02E7E6DF21065E4AB8FBC22CB599B514D2E879E2030AA4D10B1DD3D504F6506842E"
"90CE4A27E183535C7650B33D0DC49D2E99FE7CADFCB70098A7A7E4507238682EA32EAC616E"
"532B98FF1F2F724683A32EAC5EF34AEBCCF91A5578876151A2BB2EB58F3C9EA408AE297734"
"764B763FEA2EBEBF78FFBB1BB60AD63B94505A517E2EC7EFAC9FA33FD32D507D0929FB3E81"
"2ED120004DC48786D79FBE2222F318FC2EDA5061A2607F18C08E8CC8B84E1D162EE3809F8C"
"CB7CBF0556C965C966A5012EECB10A30183125A86F12575B3DF74F2EF5E1A4E8C1EFCBA404"
"C0C975DE0F292EFF11F093B1B81B704C7EA17FB339272F084273ED4F17514DA43D997D33BB"
"512F1172C92E6055DB9C4A11B17D9B25ED2F1AA34228310B20B7310358287E3D622F23D3BD"
"CFBECE800F0C021232EE0E9E2F2D046916A606F7C22AA9418D4E13F32F3634D74682641B39"
"C81267F82357512F3F65760CAD1F7995258313795839332F489600AEB8F3F83D444D8E6FC3"
"BF1C2F51C6B8C77367D90525948D82CEDBC52F5AF73FB23FF598318542E259ABC6242F6427"
"C4666F82763963E8840B79F2382F6D58A933BFEED3B65B82958FDA63A32F768961001078EC"
"2A8F0BB48E1E7CFC2F7FBA34D9449FEFFB9BE6AF86B023D12F88EAF432DF9B6FBF1EE3436A"
"73896F2F921BCB98AB44EDB8AA76E5F128E5E92F9B4CAFF0CECD409BB9066AC73528D62FA4"
"7D699A82C32F88CEB09BB6FEEE952FADAE2A8B1A22318759F951C6D5C5752FB6DF17864F44"
"6CBD671AC4C646FCEE2FC00FE5B23F0E5ADEAD92605AD0EDEE2FC940CA5DF7E557A363CAE9"
"9026B1572FD271A5A94E8EDF534C4F873182A9852FDBA2C29F0F643F98E1F109336E16AF2F"
"E4D3C58832DCC6692EB1AE0E64B7882FEE049F95499A75C2EF672BF2DD99DD2FF7357FAD0E"
"0BF249BD350206BBB44A300066C6C3578A7DBFC35CB363F60545300997D79EF5A1AEF45786"
"52C05A0EF63012C8F66DAB4144B53413509FE4EE10301BF9FEA0E3ACF8DC2C1C80029DFEE0"
"30252B20655B0224B69BAE743287E7B2302E5C275F298824A7399A72DFC7ADE430378D6E77"
"FA34D0D0607DD6E2AFC8D43040BEA0F711FFA499259B76661E83823049EFDD5F3DA96C1F8B"
"9E865C941AB43053211AA16D3A0BC77991F74A060973305C524BF521AA9CF5D477720A269D"
"763065838B256B0DB3EECC700F364138CF306EB4ED700C402296F25712D47617EC3077E64B"
"9E1032CC7B105980428E334A308117A743F89BD06E6C2D42F73BD9D2308A48F732DE8AD922"
"3FAFFB517D868B30937A6C3D27EB4962717D1534C76D2B309CABB25F3679565319EC1E7235"
"F75A30A5DD446088DBA69E18A84873C332B230AF0EB695ABDE02D9C9ECDEF40F445A30B840"
"2E259EFE0C73A46396AF48BB5830C171A410ACDB6CBB0712CA19EA8E1C30CAA34A30676DC6"
"5737E6702C5FFF3030D3D4CD1479CE58C39A508EA587812030DD0652FEA992941F1BCBDA30"
"0A900E30E637D323BB101F9226C319039203FB30EF697B2CD07459B236EF218DE303F130F8"
"9B156B1A6F1703A2C915E4980B193101CCAA2F838172A51D4850E49AAB7E310AFE522A3EA3"
"C1312E51C3F2AED84D31143021F457BE981690E58E5F436252311D61D7FA91E0DEE4EAF28A"
"B3F1ECFC312693A1C819750094287CAC107006B4312FC562E9C24F5DC033D621DC7EAC3331"
"38F730176DD869FFEF10351FA80B4F314228E4D1D709FE000730BC208FCE16314B5AB436A4"
"957E6C1260A8A63E4D1631548C88B4BFF31119E7CC378919E187315DBE56948F33A39CA208"
"6FFB3DB58F3166F061CB40BC4C0348AFB46D425DF8317022562027CC8C490660FE57386DBC"
"3179542A058CEE0ABF0CC284796CDA6A318285F43337393158AF59F7D9776C35318BB7F141"
"FFE387C15818DFA19700153194EA0222E5576FBA00ED7FD382F857319E1C0FCF0A6AAA2D46"
"0AE41F73EF5C31A74E35FEEE79B74183ECEF5A83FF7131B08018235091DDB77984052A9012"
"7D31B9B241E5B9B05D8364979F5DFD7E1531C2E45F614338FB7741C99763F9614931CC169E"
"F0A7F2653732F4EB6F544B1D31D548AB0AE6A879AAA52F5FE88B508331DE7AC88C721765CC"
"246393DE61D73331E7AD1610A07D3DD0FB0317EAD4EB9931F0DEF9FB69257E7AD40F6ECC8A"
"B02031FA1113A6C085685812C75E5A11D4D632034375930F200651D8E9A65BE8E99E320C75"
"BE6C95D6DC9FD1AF5E3C3A27463215A83775357EF253C9E178ED882044321EDA79B9B8F7B3"
"4F69F555FD07DBD132280CDC36CF92D1959A025DAD67A0EF32313F2483F58A6F1BE7179702"
"1DA477323A718B5CC8D1EFB074AE4B6777FB6D3243A3E2EFEAE910640E4462E06E9B7A324C"
"D67FB4CC1F6311EE154F00FE0E13325608DB43BA5ADAF6796D0E6DBE044A325F3B2A97469C"
"39BE8318912D798B2F32686DA0BD59780EAEEA04EA06AAF45A3271A02C08A9A61539F99909"
"A4796DE5327AD2D52882140556E2FC559DE47BB93284057F0B5570F9AA9FCB3530A3ECEF32"
"8D37F8C3F7630D8EE1699BD20F9B6132966A91BB72EB475EB7BA7F79D07A97329F9D4BB2C9"
"4D258E4043C7021CAF3B32A8CFD64DEA9BAD0150726FAD9B5D3B32B202520D9914F2305F4E"
"0E17D3104A32BB3502116E9D9DE0E9FA2FE6F313AD32C4678BB5AE3FCAA2BDCCAE0033DF8E"
"32CD9A287D23B8BEB464F21648EDD8A032D6CCF73E8C112283248096DE1CABA232DFFFC2DF"
"751CA0B1408E4E9D34BA1C32E932A021C09C80516CFCB485D44D8432F2654A102F912195CF"
"59E552051D7932FB981903F4B7D51095EDE1271C1BBB3304CB0011290B0E7B481DD221BB67"
"BA330DFDC412563E441666A9FE4ED5ABD6331730B32341F7778F359DB968B854433320638B"
"A066CC05222A82A1AB29DD7133299673FFE839839BDC8D0B63168A7B3332C95F709AA83325"
"3C769B41FA669B333BFC4397B0D16EEF64FE5C559D794C33452F43B3F4CECC6F4ED8BC5FCE"
"51CA334E6247792D3C2E16859A4E03DCC5F633579542D356052E675D3534E5C09D6C3360C8"
"1F1AC95C9B05AE73EDD7F197373369FB6FF5574B1BCA9859156FF645A933732E7C87C3BC35"
"48B06177B05AB57F337C619444A6FC226B5707A2DA50D80A338594CA50497AFB99EAF84B50"
"D2943B338EC7DB87355592CE19D1FAB77850163397FB0065C7AF0750C60E470791C50933A1"
"2E442D2C887142A99C71372EE02533AA616BFDB38A7B60ED849BC10E1D6733B394A9308648"
"DF05B4467732A140AF33BCC7C316FBF1801FD51E5EB5B84B1833C5FB02645DBDDF7675EDAB"
"D8B8D63F33CF2E3B04D63C644CB08C320F88023433D8618AB9DE1E3F2C9482E95FBA19AB33"
"E194F7B9FD7FBE2E6E883EE142782033EAC84FED49C6F012127BA40B1267F633F3FBB34326"
"08C8EF2AE7C6872A8E2033FD2F2A31D0790403B74274CA5720023406626B89A6A5FA361F5F"
"769820176C340F95CB17C52D4B6911A9BD3B878E1F3418C963FA3E88C5F74BD2F3FD5E7E5D"
"3421FCF3A99927D3EBB234D72646988B342B306B8246EB2F0BC98039F742F42F343463F190"
"42408A6BD968129572A992343D974A00A47E93D264341D341D61AB3446CB0525B348D6C0A5"
"FFF099687C1C344FFE8BECF4302812B17696E348ACF03459320ACC95E5C2E6C22E381732B3"
"E0346265CF33CDA33812A21A225C038350346B996A38515D2F5291C48F733B866F3474CCFB"
"BFAED8DB4440EFD393CB31EF347E009DFCE8BF0A86124B30A6A443083487343B48E8AC802B"
"21753EAD4ACD4E349068010A141F7884C1D47E22CD982C34999BD4812F56ABA2E53377620C"
"FDE534A2CFB09C8A2C8EFAD49676589D288C34AC032D5C65B64B3C0B72A73F2F3C0B34B537"
"339E648F216C6C44E51AB6E6B734BE6AC46778FA933818C20F7C077D5D34C79E98B2DF613B"
"40A868F77982601D34D0D268DACEF521A9DDFA178629133F34DA061EBB3AF4A7E6263D4585"
"83F24134E339EE8FECA7DF1B5078EDBC09EC9B34EC6DEFEF024CD3D9D29A097F8B71E134F5"
"A1F060B8A25965FACF818BBA19A134FED5D9D80DA75389E88DAFF7C74AA9350809BE02975B"
"BEADD1CFA67FA3777635113D76475FC8880F9C7DBEDE1E8756351A71D588EB3295EA70B12D"
"8787DC553523A5B91EEAABDE1D5FD34C20C5B284352CD9FBB2F836862E51A76A202CED1635"
"360E0622E426D9BCD393176D7965B9353F41F3FC2674EC5BC7BA8AEEFF59C0354876042E31"
"05510BE4476FC63CCC873551AA5AF5CEAF7197F4B989F2EB0E85355ADE6FA8D5CD4AE7227A"
"AACD5CC492356412A25865DD5C0C5EC4B203D200F2356D46C5050690D7F2B7D3F76B030D7D"
"35767ADA69EDE20CCF731534A817ABE8357FAF16926A325B99E1758D2ACEB3593588E318E6"
"24EFC2F37E8C90A7516AAE3592177E9A7CD3BF617972CB1C119BBF359B4BC7F700A419ABCB"
"B561CE7D4CA535A47FFF46A047D28E717656F548C06235ADB4561F4FA06777CFCD9701B704"
"8135B6E8B0BD52DEE5C92314CBA7E389A135C01CFDE2B160971631E4E9F8F3B62535C95150"
"B31163D30A10FFCFE533632735D285C5CFEE880EEFB9A98AB4C8970E35DBBA46BB15113B35"
"9B5CDBD4BBCB7935E4EEF27115CEBAA5ABA0246B9298B035EE235F104DD9089BF76A30D005"
"1CFC35F757BA1D2477E5B176BECB97DA0FC136008C4DCD986A1BB6472681B7D63F113609C0"
"94E3479AFCF7E0A28C292844E23612F52743F231AD1504F561F47B0B1B361C29A8F894EB6C"
"73E5604C42E2E87236255E4B3893BDCDE89B4A2FAFDF5455362E92F3770F182DF34A48996F"
"EEF5D13637C77FA853CE5EA0A856DEBE42C2C83640FC2B789959E192CB0733ECCDF1A5364A"
"30BDFE7773CC1A917F7A2465588C3653659644C179BB70BA059F560C0C63365C9A335EEFBB"
"E99C6453B70B534BB93665CEF3F3C2F1C1EF812491760CDF99366F03854B0C39BFEB8EF003"
"C709636536783842B94F0E425BD962DCCF5FCADC36816D35F2B84B304D8CDB6021C422B436"
"8AA1EEA1F28A56D04939BEA734F6B63693D6AAA7BACB174B840F6BF193C6A9369D0B70215F"
"E0F09FB13A46BCC25EFE36A6403D2C7E7879222A51ADD6E3CEFF36AF750C49170C41C3DA03"
"1D7ACD4B7D36B8A9DFEAE6FA3FC460FBABB6C7F8A336C1DEE5BEB93AE9B6C0F033A65FD1A1"
"36CB13DB66D55EE572B072E17A9CD04B36D448D08C573BADAE5D279F9FF31EFD36DD7DABD2"
"8A6DDA71B02C08F9213CB636E6B2CA00E0E53A3BC13A546CB5D24E36EFE79EE004F35094E2"
"4BBE99933E1636F91C9DBE6C385D3E7EF4219C7680AF370251B621F1A0D83B04743AED2784"
"E8370B86AA6CB93F6702409E394BA287173714BBA5B400D7F791E66EA348A60BBD371DF0D2"
"0D371101F11E51FB888531A5372725F536289D21EA0172694A4A73B337305B0EEE1B748459"
"272CEAB64FB66837399064E8C972AB0C93CE7D9177F86D3742C562B020B96DF238DE933562"
"041B374BFA9EEB822BF30EAACD9F6DCAE19D37552FF89823DC279904105BC273EE05375E65"
"320994B44ACC7F41F6F2897C2437679A539BEDFF755EF621812E698EB93770CFAB701EFB0B"
"E7F602A14DC7187D377A04C6DEAA750FA9026A775F2C617737833A2F0694575EAA846FFC4B"
"AE912E378C6F8842402E7F841B74995F77D7413795A4D60D4CF624F8594A40CD43692C379E"
"DA3045C7A1D6BB138692BB0ABD1237A80F90E3A5125E120DBBD64F882AEA37B144D81A4D5D"
"C439980942244CC57437BA7A6E61C1E21D109440159B8B2F8737C3AFA2088139BD57D0EA11"
"4E621BD937CCE53FEA7912CD5138D32FFCE1414D37D61AAB718BDA1B7E1A653D440172ED37"
"DF502EDB586467C6FBD0739077609F37E8857787E29E4C0188386C1879F93C37F1BAD85F08"
"6EBB1FA9C7D3C261AC6537FAF0B029CD9AEEC8DD07483852709E38042634E3C459FAB48FBA"
"DA2B610DF2380D5BDECC0AB2DC6D17CBFE2AB005B238169149777D0E15E7E67F49960C6A53"
"381FC6E0A9415AC2956943AC634A47643828FC9DA990ACD1D4C1BE29722C20693832321D12"
"C9AA05333ED77D5BF3F2F5383B67D983A1740EC891F2C24CE45D6038449D37EB940EE5C7BD"
"5BBF593A215F384DD338947320B4E3E41846D31905A4385708E25745EC2257C24CFC225263"
"A438603E9D02DD2BBF25F600556514A289386974625D906F84FE8C54ACEB02AE523872AA53"
"7FA0CBFF99CC284FA0647B51387BE02081C901E4114E91D6909C4E123885160D57ADB94C79"
"594A368507E450388E4BC0CDCCAE22A8C5FCBEE481728A389781AEA03F3E3DAD3B18BFD542"
"D1C738A0B76815AADADF5EB6C7E751AB653938A9ED70124786BADF3B66DCD53D664638B323"
"2E7C3980D4F45DF1D876AED35A38BC5913C6717C53E34A556D4B84D43338C58F290B6DC3E9"
"CCE4F2B904EB9D3D38CEC51F43485205D4CC5F6D6B6D083B38D7FB0C15CC864238DA89D06C"
"90487438E13115802080295FE47BFB0D4482DB38EA672072AEA86B8A2E8CB72AD6706938F3"
"9D0ED761B1B9E43C4E1B6908E14D38FCD325021B01583858042EC68C83783906090E0609B3"
"202C3A4C1CBD56E988390F3F606D7897CC9AE66D5A17077346391875637BADDC35A73AF349"
"C5DCE1A13921AB7BA9D0F0248909201AD0548C14392AE1BA21EF48FCACD95958CB16133A39"
"3417FF175F513E3CAEA9C0794975FE393D4E1CF42AC4C7651C4C91BB3C93E7394684513777"
"E462D4395FE2A897F2A8394FBA7160A4BF24DF0A88AEBCB653563958F09FD55F0AF0A79040"
"78E039B836396226F7678E19A5F0C4223D6BFFE03B396B5D2C14E7758293C006AE1EA839B2"
"3974939EAA9730E52B6D5779D4798A19397DC9E3D65E58D3997248210CC6A81539870056EB"
"FA8D87995525A3A7006EB139903680AA95590BDC05EBC30E06AFA539996CCCFA2A789420D2"
"31005F50ADAA39A2A33BFE820168D4153AB2AA80FB4E39ABD9CD2766A4766DF4E300BC10C7"
"8439B5103725E33CB7E1EB41CB920B355D39BE469A4C68036E7DDE16B45738D1B439C77D23"
"386AD24ACC9C5D66BE1AFEAC39D0B397E658622418B66FFEB6F1CBD439D9EA0ACDF7BD3AA5"
"CC065C2BC51D2C39E3206D32F8295AFEB52C2CFB4CCBB839EC572F19E91F9D01F65A47CB47"
"B46D39F58D9330A8200A6E748D821ADEA92439FEC3FFFD469B9929F0DC1574F14AC73A07FA"
"B0F288CB5569B8AF29E5AAAACD3A1131410454010DC68DFD8BF99F448B3A1A67FE939E5856"
"173FB6F202874A723A239E648D9B233FDA823C11080BBDAF3A2CD54D37F32E5E91D1448014"
"E6CE6E3A360BD07BE70BC3B314B3BF584B38EB3A3F42837E2F3BCAA1DE4A24491BDE603A48"
"79773EC536060F2926887EB901F03A51B03542F9A5635C0C2DE56A8C3F7B3A5AE6D9662C6C"
"BFB0AC16D7B57C62A73A641DAB0999E6636254668F060D94D73A6D54595CC4FD6984DDEC21"
"AFB992453A768B2355F49D2E22B008C0FBCE07A03A7FC1F55B01406DC9C7EBF73D6D0D6F3A"
"88F8ECF8100E534E7525FF341A043D3A922FBC24471A7DD361F0DB9D031AEF3A9B668CCA52"
"76E22F5037B2954709CE3AA49D746B02842B851C097FA6BA11AF3AADD45571C08CB37FA315"
"BB79B365353AB70B5039B8EA4A92DE1A467D7686583AC0421D668DA7A48046154C5E46C98A"
"3AC978FFAD8E61850326D145C14D07073AD2AFF6F061F49834D34C26A98064703ADBE6DA43"
"93C838213169E2D48EE02C3AE51DDCA8BF35C430094BF20A1A66FA3AEE55113A98D97834C0"
"A484F8154D363AF78C0B9F740DB7451CDB59D87857E93B00C31EFF05C409A9F69ABB631F9B"
"A53B09FA293A59EED583BBC7AD07FAEFF93B13313747CF15671B2D3EF79CB850AD3B1C6872"
"425900D170FF55C3E507DED33B259F88383F47B0A9914C1A2A2CE62A3B2ED6B7C36515E2B4"
"5350B08B689D203B380DFB6BDF7BD051F8CAF2C88C63C63B4145257E0520D41501BD909C06"
"CC423B4A7C77EA4B375AECCE80D4053D177C3B53B3A93F2603BFCF501927AF844E433B5CEA"
"D15C60784D45814D7769C58ABF3B66220CC82167F2CAEB5CAC85BEE0943B6F59817E50B0FE"
"90C9355E15558CF23B78908C63C6EE3B8EC3B7F50E805A453B81C802B5C93942DCF9589A80"
"C2070E3B8AFF2C1DE3874E74CB811292ADDA4E3B943692A94F4589474D3FF756E0F17F3B9D"
"6DE2E4CEB5C5D7A6D8254B3FF16D3BA6A549B0B6A18A13B63BA04FC5552C3BAFDCC1B7544B"
"2B12CF12114FA9F9B33BB9142547ADF0F92338A385EF56830F3BC24BA4EF1F4F312D2E8C35"
"CC27A2DB3BCB830EB957D23B19F55925BA1FC5673BD4BA975CE778F3632EF9A156EDE3F53B"
"DDF2223223914F34D268CD944EC4FD3BE729946CCD2B85853213F3FC5857EB3BF06132C843"
"AD33E1973E15017931EB3BF998A93F64510EC3DBC77C4ACD0C1C3C02D04303DBB8F4D62A10"
"CA8F52D93C3C0C07CE682D364556A5C7C592FBB4233C153F5C8CAA4B4ECBC0289656DA57B0"
"3C1E76F70E696693EB8D80D1556EF7993C27AEA074668BD1898CAD673885A31D3C30E64519"
"362EDB7A49B2C9A42E65733C3A1DBD0270E41431E71D343980C88C3C435568F47D20F05FC4"
"88A41BA021203C4C8D34B36DACD0A7FEE56C2B17472A3C55C4D9AC53D86A63DE806232C561"
"CE3C5EFCBC45245306DFAB11E0C77365CE3C6834481280E64A7C498590B2D908EC3C716C45"
"3224076FC3D10A0FBA0DFC033C7AA429FB8843A85448DF38444461B03C83DBD04A37518FE4"
"5D58B510BD2E6F3C8D1381F3E07CAE3EFA7470BDCD92FA3C964B5621C9E987B4306DF7BBC2"
"386F3C9F834BF58B09AEE5005A923FBF0D603CA8BB237DE71F76B91FE8262A100FC63CB1F2"
"F2A7030C94D3835214586D70CE3CBB2AE1FFE51B84C088F564BF9A39243CC462E0347C0FA5"
"0F57BE1315E7D1C53CCD9ADFE25E672D839C7159736872BB3CD6D2E0F0B3FFEFCD22514BD2"
"4E98073CE00AE3CD07E4C6F6D3015220F356D63CE942CECE453DAF5B4FF323567A78233CF2"
"7AADAF0D0C7922A33F0D44E36A6B3CFBB2C2A089FA870F6D5A0DDB08C3D73D04EAAD8BE5C2"
"A26FC5FCD6B4A5E1EA3D0E22AA9D0DCBE1F528078F2EC9F8113D175ADFF80640622C4373A4"
"7DF14A963D2092BAE890EB6907CBA9BF6C2CBA753D29CB0161C93A5A1FC8CE10EB34B2203D"
"33033FFA3DD7FAA023BCC8679FD8563D3C3B8AD54EC883AFE9E4273B993F9F3D4573A99A1F"
"330C2AC63010713CC7983D4EABC2C9161C2015E81C3A4743ECAA3D57E3D3A61B5A772E9363"
"0B4A3EA6473D611C273EAD7AD3896B3855C5EEE9853D6A54564E12154EF67DA344668B96B2"
"3D738C72B363D8D66A12C82CFFB005F23D7CC4D22D9D543589317E1BDFA117A33D85FCF691"
"984506CB91B73E641B5E063D8F357EED991E7B0C250CAB1A51894B3D986DBB2076A1F54B39"
"0E750A8507C33DA1A60C9991CDAEB83AF87C5BBFCBBE3DAADE683F8EC63D1297862F28EFAE"
"B53DB416D328940C82CBDAB6B243B145B23DBD4F52C4D8CFA4B9B9229AA843956C3DC687A2"
"47C0342DA9C311D13ADD9B7F3DCFC022E9C4F49FCCF7F313376EAEDD3DD8F85A8AEC38A78A"
"6EF4ADBF89492D3DE230BC995553CC73E3BBF6977A54803DEB6970C6755822A8183D262248"
"88903DF4A1BD1664895815B3F83E14EC90C43DFDDA50AEA74B29F81E8C1987BFA7D53E0712"
"DF8D75F41569F8F16F55E1F3193E104B5978594DAB209AB25FEC98DF973E1983F19EDAF3AF"
"B6E573F74BA9DD7D3E22BC4EE1ED0894E82E7922140F9FC23E2BF4F9C703D1D549DD39DDFA"
"4C31D73E352D92E9FC2E74775CFCD40BBE82F63E3E6629E7B799A86AF1AFB04E51F97C3E47"
"9EC6738D4AA3BAF9EDDF19D415473E50D769DBF42F4057E64BA2AD4605A23E5A1007FE99A1"
"D500E93217309EC21D3E6348DB4F3D0BAB156E61C565D716D13E6C81A48055D9C1BE3F279F"
"40DB785B3E75BA5C055BD47694B66C14DACC9D3C3E7EF3273A7D207E154F98F44AE3F1383E"
"882BDD3815EAD3AA6E63ED8CA07EF33E9164A946C1314BBE810EB958FEB5ED3E9A9D622D81"
"43ADCE482D79AA83C4C13EA3D6035B40C2F486D0519A1F594ED43EAD0EFAE144CF07C8CE88"
"6955681F313EB647D656DA62CB81F040773AB152A33EBF809FE08A3E7F92CCEA7B80334D6D"
"3EC8B9A2617D6CFCC7A65F649CA8040E3ED1F26969C23DE09E1D0C4675E33BDE3EDB2B5D27"
"DFC72B8C2A7C036783974B3EE464333941E0D86D23100A4F677FCA3EED9D0F3A19B0585310"
"2C8636AE132C3EF6D5F4D9A155951F3002C1EADD34673F000EF6E9B2DFD8933FD7D0EFBBC5"
"EC3F0947CA2594B57DF708B085DA9061873F12810264361FC036B7A404C0A77C803F1BBA04"
"FBE549D428B643022AE936243F24F30ECD26302148C34A9F9AE2337F3F2E2C1A66A2514A49"
"748E74E83099763F3765468C16881A4759AA7CA3F4A7FE3F409E3AD95BD7EA7558E83C8D65"
"72483F49D773AA4030F3DF5141C795EA96153F53105CC93E584AE8D50D14C8D5C6F23F5C49"
"7C01311EE8B3F8F18A66C3F0C83F6582DA1404754F9F966D83BA37B35F3F6EBBDF48625151"
"E0F6DABD1D4BA5413F77F51D9A444CB0BE55B6A60A6B81AE3F812E51B2DD6B658A28964FB1"
"35B97D3F8A67B7D427009CA262DBA472206B583F93A0D65E0BB3E292CD9410AE3C78983F9C"
"DA236CA220B1B8F9C017A0F30FE13FA6135F996B1E6436F9250EFE39312E3FAF4CB3F65172"
"4C97808F6861D55D3A3FB885F7168084042AE05A2037CC64823FC1BF1744B0EA5AA04201EC"
"006F68183FCAF89F86A85EAFCAF444A342E2D1893FD431CCEE07A34B12A6C8F5B3B6142B3F"
"DD6B4151A8AC2F0B20AAF913E3C5993FE6A48E25A95C5B352DDE41027139A73FEFDE0F70E5"
"859F57010AFB342A8D8B3FF91799651A3CCCFD506ECC5E3FE5EA400250E32889129F3A8BDA"
"75115E438B400B8A539CCC454CBC719ED64994A45E4014C3A7F6D643EF48F86189C669056D"
"401DFD3071D25C8629F64F844131DFC8402736A137D8183D7BE322B78D7C0F4B4030701ABB"
"3AB2C9DD1573DFC13B6A054039A99D70DF979013D969F0646D49F24042E321F86B997D7DBE"
"D42D1C5807A3404C1D0804621A614A48A017A5376A41405556B3E4281A5350145B33BDA99E"
"95405E902438B81BA94D4A42D59984222F4067C9C04E49D6691884ED6BD4ACC6C340710334"
"4B276101B65221377C737CED407A3CF5FDBA7A9E877DE810296FE73C408376B74B323D608E"
"2293DE0E11AC44408CB074095E94CCA778C4202B13224C4095E9FC1202BA1472FD26AA4EDB"
"D6B4409F23A60639482D3A359429E4553BBF40A85D566B1D9C43C2E18D157661662F40B197"
"23ABB3A6A122EBDFFFACE36C8F40BAD0D22B411127E36E6903CBA0DAE940C40A74770FD78B"
"20BD92E18D5F1DB140CD445C17766F7C10C8B580FD2926DE40D67E1DAD049C7590EC45F308"
"3DB7C940DFB7E99FE3CAD192EDCB09FC10097140E8F1C58F77FA8E3834F51ECCE65E7840F2"
"2B978861CD152195432F1E69C58340FB657618849C6944EE15BD0457F28D41049F570EA362"
"0E20847186FCEA0E02410DD940ACD7B1F649BD16A8BC3F0EFA4117132EB50BD74394AE3519"
"9F1B750941204D087E20B3A44A919CF6917C5CA241298719D77769BC8F05E290E7BE28A241"
"32C11F143C2DD1EF11E0130F74C5D3413BFB04A47FB02DF4B7C68941B8DBF7414534C6A88D"
"DA436AEFE4738E2D9A41414E6ED6DEF70BCAD26B33CAFC985ECA4157A8D602FB1F32CA848B"
"08AF80616A4160E2FC25D27E7753C233F74931A77D416A1D020C29DFCDA0ECE629ADBD6E17"
"417356F2F8AC297E86A597087C204140417C911D40E00A989E0D09FAA45F68104185CB5AAC"
"554963FD542D9FA840A3FB418F0583A194259E4AC5F7F67C4EE25841983FAF93BA1EE508F7"
"345DE9A7163541A179CDEB9DFBB9EE6245BF7653819B41AAB3CC409B4393011DAB5D5FA1F0"
"B741B3EE33BC6D1BB39CE13DA71804464F41BD2865371FC002D3A2F7287986D60A41C66288"
"6AE858AB1BB6C0F5A9C5DB9B41CF9CAD4421FA652561AA31374DBE2141D8D6FF0D572E7663"
"0E465272D4619A41E21138B13DA7BDFB5EFAA36442A2D941EB4B7129AC42794F0BAE19F1CA"
"4B4D41F485BF08692A89ADB8CF4FBD94A7CF41FDBFFA98CF344E152ABDAA4C24DF624206FA"
"5C90372EB25A5CD1DAB51B0950421034D17D00E977BAFD9C192222A99342196F2BD02E50FA"
"0F3D0DFC148FB6364222A97E45E6670EFB1E66E2A0E1B112422BE3E80472181295B8EB3871"
"6160BE42351E5A46DF8C5A34590FC82AB11772423E58CCE7539071D21A2A3393DB33614247"
"931B7D67A325C3C3A15165F4D5AF4250CDAA11326F5589B1BBCF041E106D425A07E35D1764"
"E1C1DD486F7F3F6AFB426342AC719661A3CB087FBF4674C10D426C7D088E13C9B353C44427"
"90FFBB474275B75DEAB419329E8A5116599BBEC0427EF1DD09F3A16ECE4BFE6E80515D5A42"
"882C8C7DFC526C51189F5ACAAA9240429167007596EA8EFE9CD1D42F453BD8429AA19DF84D"
"8ECA08B5F12616AC920A42A3DC36056C29C001F78142E1454C4042AD170E43EDE182536F8A"
"96DA9F820E42B651848B2BF534E7343C62AEAA9CDE42BF8C0BDB797E859BC7A75530C2BFA1"
"42C8C6A3FB364118CFA9C1B0CF03294A42D201516EAAA432A8EB67B4FC20D14642DB3C2A01"
"E49ED30E9C6CD303BE8C2142E476AA9C96EB52B2DFA38003EF4AC642EDB1A64278F7F1AB3D"
"98DDF11B303142F6EC5967460A35177F3C55CDE0621D4300270952E7CAF605FC1256C36CB3"
"6E430961D6F0E0FC8AD62803342897A1DA43129C90F483E59362EBE265DA8332EB431BD759"
"A4B60666DDA90FBA080CC6844325123D8B4794AF1DC7BA8BC751F297432E4D2B03562B639B"
"DD25ED3A607987433787D7F1EFF3049B7529803D7F89864340C2C5F9FFEB656CCA71E5771D"
"0A9D4349FD998DA28FA52445BCA5272EF1254353389144F8A7EA1622B8DC73BF6BD4435C73"
"499E66955DDF452F49BD6614D54365AE5D5D736D667233F146BEBF334C436EE935D4794645"
"2CD8066FC5A7ADA54378240BF81DD734423BC06CDC206AE643815F31B0DA93843EA3E86019"
"3A96EC438A9A34112CABD766A3063DE3B6C6E14393D50A575BD1FA2C742E706FEA771C439D"
"100142A332382DB1B6C277D9871443A64B24BD5B4C854450DD51E02E102543AF863916909D"
"39625D43977FB98E7343B8C150AC45388447131570F8EDECE243C1FC532D0B2B409C258F14"
"97C1B9D443CB376A378CD79123695C2996AFFFC143D47265D76F42A72BFF21BDEAEA120143"
"DDAD7690A85631CD3DC4076358264F43E6E8AA3DFE70DAA3D6AD0C82DCD3EC43F023DD2128"
"E251F4130FF57AE1D41543F95EFBF65CBFB5402287698FE0089344029A2011C5737589A29D"
"CB8A9663DD440BD56B1BF3FBCE8AFB2FEC0E7B0C124415108225AD2759C16E6A853ED39E5B"
"441E4BC675A19F6AFE48BCE484B0129A44278720447CC04F652CEA7B4BC86B494430C260CB"
"76FCEFA5B15FAFE385CAD94439FD68DF4061ED26B8162FEB72077F444338D0B7570E0D916B"
"877177F0B899444C740F0B16E2FFAAF6D1BD3FF8C9E94455AF621EABD11D2975AFF3B77EB2"
"EB445EEADA8CBBDD66071CC9D2E813A3524468263409E00A0AC26C0F5698D970624471618A"
"D4C4158817FA61E03369F4A4447A9CE2BB152D4F99CAAA6D89F8F2994483D83A91018D05AA"
"8B0545933BA359448D137B9284DB72C9482A365CBD5B5A44964EEAB73B5D17FF0C347FF9FF"
"4FBD449F8A7E2A846AC0C644FD3425BC43E644A8C5F3BC5EFDD7272C59FB0CA8C31944B201"
"7CE92DE7EC1105354ED16DA3BC44BB3CEA99740616B287DEC60E8CAD7A44C47860F18A3748"
"5596D148F2BFA39E44CDB3D35581725401D4E33E2904200844D6EF74B8B136CD9C71C63567"
"233CD544E02B090231542517DD34517342E65F44E9667A884694C53B630C9FAEC5096D44F2"
"A233E5EB96D001F345B85350FC8444FBDDF2D9823C97B27B6EC3E8D616534505197100390F"
"BB51D8B611235038A5450E54FA4271928D05116CC74AEA1BCD451790B3E3D8D74F80BC1CD7"
"A7EF20474520CC0B1481FE96FFD077E20E01D16C452A07F175BC6E566E91757C06E30F3845"
"3343CD73BCBD3D5E59B787A1A4AC07453C7F80EC1DF2619A64FA5BFAC9309D4545BB094C9E"
"17E761AF7B71D2B58F4B454EF6A739630ABA5BB01B5AD3392C824558323ED771FFFFAFD41C"
"C961CFD4A745616E1D00BC7DEFCC5872C5EC0F35E7456AA9E99851517E8FEC195A51CA2426"
"4573E59EF3F96FE03E04E8F2C4ED62FA457D216B02EE80E1B8CE8BCF8DE96FDB45865D2C1C"
"855678AE4AC7C44B080A4E458F98F35E5ED25B7C536F03AA2172C74598D4D5ACDF12CCAB08"
"4608BEAFDA6E45A210BDF1C302A4D5102B14693C714245AB4CAF617C9464EC3BAD7AD47A7C"
"2C45B4889A8EA3B611E670BB391CE812A945BDC47DD6950025FD7EC9F161CD342345C70054"
"CE38501C8B8BF394DCA2013245D03C335A2AD6E3E7A62F61FDC4580545D97812A54547B1A2"
"96889FE6ABD91745E2B3FEBE9520A50CA7DEA9727A675B45EBEFE84FF86F6E4877196E07DA"
"848045F52BFFB3E95C56EFC7A544A822316845FE6815E7C667D5B67E8EEF17A24CFF4607A4"
"2840D152C7B860E1EB5B391F9D4610E0266ABF785EC0AB0EF6C3650100461A1C3B1E5A8583"
"6D204B49E1C6C2BF4623586B6CF2EF080B9FEF82CF99433E462C94618A6F4C9024FCE074DD"
"13BC244635D09AEA16FA882920E0E0D23FF684463F0C924448D9A0842903B295EA2D0E4648"
"48A5C0DFB6CCD637A026B63D156E465184D7BCDB8C5568D4864718CEAECF465AC11035C533"
"D6B3AA236E78CFD0764663FD2E7B3D615DC7ED30A3C26D79ED466D394F0466A991E993BDE9"
"5D15AA1B467675B29E5AC363EA04B25FAC0C20A1467FB1D6441A55A287F461B8B9DBC7CA46"
"88EE0C1D80C2DC4A7E894EEC245CB046922A044BE9F6869D94FC9EFA155C84469B667533F9"
"9BD8B0D0C7AE49132EE646A4A2D10148BC87FA3FD7DBFBE8167546ADDEF69B9D045ECB727B"
"8425C4F72446B71B633D02751DA3B5C4B7660879E346C057A6B7B8342224E520526E5CA442"
"46C9941E798486D29483E950F0173B2046D2D0972E08643D9CBA57473BA9EAAF46DC0CCC2D"
"472840FD48210A628D8B5A46E54913F64F7F68A7AA1430244DEF4E46EE858F381C5E7EB9F2"
"C9DCB32924F246F7C2068502F6EFEB65DCCB1E161A694700FE584DD98E60E33B4280BF81BE"
"90470A3ABCE561CBAA81A62426F777A1A047137755C05247EE4823A76EAB95001C471CB3C5"
"8A1CC877410DE857E82B17BD4725F0468A72635FD5272EF9F8A3E86B472F2C7B9FDC2EC44E"
"E7E292809654E847386908";
inline uint32_t f(int x, int y) {
return stoul(A.substr(x * 32 + y * 8, 8), 0, 16);
}
int main() {
cin.tie(0), ios_base::sync_with_stdio(0);
uint32_t n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
auto w = f(n / C, 0), x = f(n / C, 1), y = f(n / C, 2), z = f(n / C, 3);
for (uint32_t i = n / C * C + 1; i <= n; i++) {
uint32_t xx = i;
for (int j = 2; j * j <= xx; j++) {
if (xx % j == 0) {
uint32_t cnt = 0;
while (xx % j == 0) xx /= j, cnt++;
w += cnt * j * j * j;
x += cnt * j * j;
y += cnt * j;
z += cnt * 1;
}
}
if (xx != 1) {
w += xx * xx * xx;
x += xx * xx;
y += xx;
z += 1;
}
}
cout << a * w + b * x + c * y + d * z;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
long long n, k;
bool ch(long long a) {
long long ans = 0, res = 1;
while (a >= res) {
ans += a / res;
res *= k;
}
return ans >= n;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
long long l = 1, r = n;
while (r - l > 1) {
long long mid = (l + r) / 2;
if (ch(mid))
r = mid;
else
l = mid;
}
if (ch(l))
cout << l;
else
cout << l + 1;
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const int inf = 0x3f3f3f3f;
const long long linf = 0x3f3f3f3f3f3f3f3f;
const long long mod = 998244353;
struct tri {
int first, second, z;
};
long long d, m;
long long solve() {
long long ret = 0;
scanf("%lld%lld", &d, &m);
for (int i = 0;; i++) {
if ((1 << i) > d) return ret;
int base = 1 << i;
if (base * 2 > d) base = d - base + 1;
ret = ret * base + base + ret;
ret %= m;
}
return ret;
}
int main() {
int _;
cin >> _;
while (_--) {
printf("%lld\n", solve());
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int rl[505], rw[505], rh[505];
int pl[505], pw[505], pp[505];
int main(int argc, char** argv) {
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d%d%d", &rl[i], &rw[i], &rh[i]);
scanf("%d", &m);
for (int i = 0; i < m; ++i) scanf("%d%d%d", &pl[i], &pw[i], &pp[i]);
int ans = 0, rm;
for (int i = 0; i < n; ++i) {
rm = 0x3fffffff;
int tl = rh[i], tw = (rl[i] + rw[i]) * 2;
for (int j = 0; j < m; ++j) {
if (pl[j] >= tl && pw[j] >= tw) {
rm = min(rm, pp[j]);
} else if (pl[j] >= tl && pw[j] < tw) {
int cnt = (((tw - 1) / pw[j] + 1) - 1) / (pl[j] / tl) + 1;
rm = min(rm, cnt * pp[j]);
} else if (pl[j] < tl) {
continue;
}
}
ans += rm;
}
printf("%d\n", ans);
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
v.resize(n);
for (int i = 0; i < n; ++i) cin >> v[i];
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 1; i < v.size(); ++i)
if (v[i] >= v[i - 1]) v[i] = v[i - 1] - 1;
long long res = 0;
for (int i = 0; i < n; ++i) res += (long long)max(v[i], 0);
cout << res;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
long long a[300000 + 10], dp[300000 + 10][3];
int main(void) {
long long n, x;
scanf("%lld%lld", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
dp[i][0] = max(dp[i - 1][0], 0ll) + a[i];
dp[i][1] = max(0ll, max(dp[i - 1][0], dp[i - 1][1])) + a[i] * x;
dp[i][2] =
max(max(dp[i - 1][0], max(dp[i - 1][1], dp[i - 1][2])), 0ll) + a[i];
ans = max(ans, max(max(dp[i][0], dp[i][1]), dp[i][2]));
}
printf("%lld\n", ans);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 123456;
int n, l, x, y, ai[maxn];
void init() {
for (int i = 1; i <= n; i++) scanf("%d", &ai[i]);
}
int brs(int l, int r, int now, int t) {
while (l <= r) {
int mid = (l + r) / 2;
if (now - ai[mid] == t) {
return 1;
}
if (now - ai[mid] > t) {
l = mid + 1;
} else {
r = mid - 1;
}
}
return 0;
}
void DYGANDQYM() {
int p1 = 0;
int p2 = 0;
for (int i = 2; i <= n; i++) {
int t1 = brs(1, i - 1, ai[i], x);
int t2 = brs(1, i - 1, ai[i], y);
if (t1 == 1) {
p1 = -1;
}
if (t2 == 1) {
p2 = -1;
}
}
if (p1 == -1 && p2 == -1)
printf("0\n");
else if (p1 == -1) {
printf("1\n");
printf("%d\n", l - y);
} else if (p2 == -1) {
printf("1\n");
printf("%d\n", l - x);
} else {
int idx = -1;
for (int i = 2; i <= n; i++) {
int t1 = brs(1, i - 1, ai[i], x + y);
int t2 = brs(1, i - 1, ai[i], y - x);
if (t1 == 1) {
idx = i;
break;
}
if (t2 == 1) {
long long aa = ai[i];
if (aa - y >= 0 || aa + x <= l) {
idx = i;
break;
}
}
}
if (idx == -1) {
printf("2\n");
printf("%d %d\n", l - x, l - y);
} else {
printf("1\n");
long long tt = ai[idx];
if (tt - y >= 0) {
printf("%d\n", ai[idx] - y);
} else {
printf("%d\n", ai[idx] + x);
}
}
}
}
int main() {
while (scanf("%d%d%d%d", &n, &l, &x, &y) != EOF) {
init();
DYGANDQYM();
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int r[201], g[201], b[201];
int dp[201][201][201];
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, l;
cin >> n >> m >> l;
for (int i = 0; i < n; i++) {
cin >> r[i];
}
for (int i = 0; i < m; i++) {
cin >> g[i];
}
for (int i = 0; i < l; i++) {
cin >> b[i];
}
sort(r, r + n);
sort(g, g + m);
sort(b, b + l);
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
for (int k = 0; k <= l; k++) {
if (i > 0 && j > 0)
dp[i][j][k] =
max(dp[i][j][k], dp[i - 1][j - 1][k] + r[i - 1] * g[j - 1]);
if (i > 0 && k > 0)
dp[i][j][k] =
max(dp[i][j][k], dp[i - 1][j][k - 1] + r[i - 1] * b[k - 1]);
if (j > 0 && k > 0)
dp[i][j][k] =
max(dp[i][j][k], dp[i][j - 1][k - 1] + g[j - 1] * b[k - 1]);
}
}
}
cout << dp[n][m][l] << '\n';
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
bool isprime(long long p) {
if (p < 2) return false;
if (p == 2) return true;
if (p % 2 == 0) return false;
double limit = sqrt(p);
for (long long i = 3; i <= limit; i += 2) {
if ((p % i) == 0) return false;
}
return true;
}
long long fac(long long n) {
long long an = 1;
while (n > 1) {
an *= n;
n--;
}
return an;
}
long long kor(long long n, long long st) {
long long nn = n;
if (st == 0) return 1;
while (st > 1) {
n *= nn;
st--;
}
return n;
}
long long a[500000];
queue<int> car;
vector<int> v;
map<int, char> mpp;
map<int, int>::iterator it;
set<string> st;
set<pair<int, int> >::iterator iter;
int main() {
ios::sync_with_stdio(false);
long long n, k, sum = 0;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum += a[i];
}
sort(a + 1, a + n + 1);
long long l = 1, r = 1e9, anl = 1, anr = 1e9;
while (l <= r) {
long long kk = k;
long long mid = (l + r) / 2;
bool flag = true;
for (int i = 1; i <= n; ++i) {
if (a[i] >= mid) break;
if (mid - a[i] > kk) {
flag = false;
break;
} else
kk -= (mid - a[i]);
}
if (flag) {
anl = mid;
l = mid + 1;
} else
r = mid - 1;
}
l = 1, r = 1e9;
while (l <= r) {
long long kk = k;
long long mid = (l + r) / 2;
bool flag = true;
for (int i = n; i > 0; --i) {
if (a[i] <= mid) break;
if (a[i] - mid > kk) {
flag = false;
break;
} else
kk -= (a[i] - mid);
}
if (flag) {
anr = mid;
r = mid - 1;
} else
l = mid + 1;
}
if (anl >= anr) {
if (sum % n == 0)
anl = 0;
else
anl = 1;
} else
anl = anr - anl;
cout << anl;
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
long long Mod = 998244353;
long long Comb[80][80];
long long N, K;
long long Ans[80];
vector<int> G[4100], Ch[4100];
long long Dp[4100][80];
void dfs(int x, int fa) {
for (auto &y : G[x]) {
if (y != fa) {
dfs(y, x);
Ch[x].push_back(y);
}
}
Dp[x][0] = 1;
for (int i = 2; i <= K; i += 2) {
for (auto &y : Ch[x]) {
for (int j = 0; j + 2 <= i; j += 2) {
Dp[x][i] = (Dp[x][i] + Dp[x][j] * Dp[y][i - 2 - j]) % Mod;
}
}
}
}
long long T[80];
void sfd(int x) {
for (int i = 0; i <= K; i += 2) {
Ans[i] = (Ans[i] + Dp[x][i]) % Mod;
}
for (auto &y : Ch[x]) {
for (int i = 0; i <= K; i += 2) T[i] = 0;
for (int i = 0; i <= K; i += 2) {
for (int j = 0; i + j <= K; j += 2) {
T[i + j] = (T[i + j] + Dp[y][i] * Dp[y][j]) % Mod;
}
}
for (int i = 0; i <= K; i += 2) {
for (int j = 0; j + 2 <= i; j += 2) {
Dp[y][i] = (Dp[y][i] + T[j] * Dp[x][i - 2 - j]) % Mod;
}
}
sfd(y);
}
}
void solve(int _N, long long *ans) {
N = _N;
for (int i = 1; i <= N; ++i) G[i].clear();
for (int i = 1; i < N; ++i) {
int x, y;
cin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
for (int i = 1; i <= N; ++i) Ch[i].clear();
memset(Dp, 0x00, sizeof Dp);
dfs(1, 0);
memset(Ans, 0x00, sizeof Ans);
sfd(1);
memcpy(ans, Ans, sizeof Ans);
}
int main() {
for (int i = 0; i < 80; ++i) {
Comb[i][0] = Comb[i][i] = 1;
for (int j = 1; j < i; ++j) {
Comb[i][j] = (Comb[i - 1][j] + Comb[i - 1][j - 1]) % Mod;
}
}
long long N1, N2;
cin >> N1 >> N2 >> K;
if (K & 1) {
cout << 0 << endl;
return 0;
}
long long ans1[80], ans2[80];
solve(N1, ans1);
solve(N2, ans2);
long long ans = 0;
for (int i = 0; i <= K; i += 2) {
ans = (ans + Comb[K][i] * ans1[i] % Mod * ans2[K - i] % Mod) % Mod;
}
cout << ans << endl;
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
pair<int, int> a[n];
for (i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i + 1;
}
sort(a, a + n);
for (i = 0; i < n / 2; i++)
cout << a[i].second << " " << a[n - i - 1].second << "\n";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
int n;
char s[100];
string ss, t;
string ans[70005];
int main() {
scanf("%d ", &n);
for (int i = 0; i < n; i++) {
gets(s);
ss = s;
for (int j = 0; j < 9; j++) {
for (int k = 1; j + k < 10; k++) {
t = ss.substr(j, k);
if (!mp.count(t))
mp[t] = i << 1;
else {
if ((mp[t] >> 1) != i) mp[t] |= 1;
}
}
}
ans[i] = "1234567890";
}
for (map<string, int>::iterator it = mp.begin(); it != mp.end(); it++) {
if ((it->second) & 1) continue;
int x = (it->second) >> 1;
if (ans[x].size() > (it->first).size()) ans[x] = (it->first);
}
for (int i = 0; i < n; i++) printf("%s\n", ans[i].c_str());
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int cnt, n, res;
int tin[maxn], tout[maxn], a[maxn + maxn], dp[maxn], f[maxn][17], st[maxn],
h[maxn], b[maxn];
bool need[maxn];
vector<int> adj[maxn];
void Input() {
int x, y;
cin >> n;
for (int i = (2); i <= (n); ++i) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
}
void DFS(int u) {
tin[u] = ++cnt;
for (int v : adj[u]) {
if (h[v] != 0) continue;
h[v] = h[u] + 1;
f[v][0] = u;
for (int i = (1); i <= (16); ++i) f[v][i] = f[f[v][i - 1]][i - 1];
DFS(v);
}
tout[u] = cnt;
}
int LCA(int u, int v) {
if (h[u] < h[v]) swap(u, v);
for (int i = (16); i >= (0); --i)
if (h[u] - (1 << i) >= h[v]) u = f[u][i];
if (u == v) return u;
for (int i = (16); i >= (0); --i)
if (f[u][i] != f[v][i]) u = f[u][i], v = f[v][i];
return f[u][0];
}
bool cmp(int u, int v) { return tin[u] < tin[v]; }
bool IsAnc(int u, int v) { return tin[u] < tin[v] && tout[v] <= tout[u]; }
bool canbuild(int k) {
sort(a + 1, a + 1 + k, cmp);
for (int i = (1); i <= (k - 1); ++i) a[k + i] = LCA(a[i], a[i + 1]);
k = k + k - 1;
sort(a + 1, a + 1 + k, cmp);
k = unique(a + 1, a + 1 + k) - a - 1;
for (int i = (1); i <= (k); ++i) adj[a[i]].clear();
int top = 1, u;
st[1] = a[1];
for (int i = (2); i <= (k); ++i) {
while (top >= 1 && !IsAnc(st[top], a[i])) --top;
if (top == 0) {
st[++top] = a[i];
continue;
}
u = st[top];
if (need[u] && need[a[i]] && f[a[i]][0] == u) return false;
adj[u].push_back(a[i]);
st[++top] = a[i];
}
return true;
}
void Calc(int u) {
int tmp = 0;
for (int v : adj[u]) {
Calc(v);
tmp += dp[v];
}
if (need[u]) {
res += tmp;
dp[u] = 1;
} else {
if (tmp >= 2)
dp[u] = 0, ++res;
else
dp[u] = tmp;
}
}
void Solve() {
h[1] = 1;
DFS(1);
int q, k;
cin >> q;
for (int i = (1); i <= (q); ++i) {
cin >> k;
for (int j = (1); j <= (k); ++j) {
cin >> a[j];
b[j] = a[j];
need[a[j]] = true;
}
if (!canbuild(k)) {
cout << -1 << '\n';
for (int j = (1); j <= (k); ++j) need[b[j]] = false;
continue;
}
res = 0;
Calc(st[1]);
cout << res << '\n';
for (int j = (1); j <= (k); ++j) need[b[j]] = false;
}
}
int main() {
iostream::sync_with_stdio(false);
cin.tie(0);
Input();
Solve();
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int a[55], num[2];
int main() {
int Q;
scanf("%d", &Q);
while (Q--) {
memset(num, 0, sizeof num);
int n, ans = 0, k = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
char s[55];
scanf("%s", s);
a[i] = strlen(s);
for (int j = 0; j < a[i]; j++) num[s[j] - '0']++;
if (a[i] % 2) k++;
}
if (k == 0 && num[0] % 2 && num[1] % 2)
printf("%d\n", n - 1);
else
printf("%d\n", n);
}
}
| 3 |
#include <bits/stdc++.h>
int main() {
int i, j, k, a, n, b, c, x = 0, ans;
char lock[1000];
char pos[1000];
scanf("%d", &n);
getchar();
for (i = 0; i < n; i++) {
scanf("%c", &pos[i]);
}
getchar();
for (i = 0; i < n; i++) {
scanf("%c", &lock[i]);
}
for (i = 0, ans = 0; i < n; i++) {
x = abs(pos[i] - lock[i]);
if (x <= 5) {
ans = ans + x;
} else {
ans = ans + (10 - x);
}
}
printf("%d", ans);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
struct treap {
treap *l, *r, *f;
pair<int, int> Max;
int val;
int id;
int pri;
treap(int first, int _id)
: l(NULL),
r(NULL),
f(NULL),
id(_id),
val(first),
pri((rand() * (1ll << 20) + rand()) % 1000000000) {
Max = make_pair(val, id);
}
} * node[200005];
pair<int, int> Max(treap *t) { return t ? t->Max : make_pair(0, 0); }
void pull(treap *t) {
t->Max = max(max(Max(t->l), Max(t->r)), make_pair(t->val, t->id));
}
treap *merge(treap *l, treap *r) {
if (!l || !r) return l ? l : r;
if (l->pri < r->pri) {
l->r = merge(l->r, r);
l->r->f = l;
pull(l);
return l;
} else {
r->l = merge(l, r->l);
r->l->f = r;
pull(r);
return r;
}
}
void split(treap *t, int k, treap *&l, treap *&r) {
if (!t)
l = r = NULL;
else if (t->id < k) {
l = t;
split(t->r, k, l->r, r);
if (r) r->f = NULL;
if (l->r) l->r->f = l;
pull(l);
} else {
r = t;
split(t->l, k, l, r->l);
if (l) l->f = NULL;
if (r->l) r->l->f = r;
pull(r);
}
}
treap *getf(treap *t) {
while (t->f) t = t->f;
return t;
}
pair<int, int> e[300005];
int ok[300005];
int f[200005];
vector<int> v[200005];
int Find(int first) {
if (f[first] == first) return first;
return f[first] = Find(f[first]);
}
int in[200005], out[200005];
int t;
int p[200005];
void dfs(int first, int f) {
in[first] = ++t;
node[t] = new treap(p[first], t);
for (auto it : v[first]) {
if (it != f) {
dfs(it, first);
}
}
out[first] = t;
}
void solve() {
srand(time(NULL));
int n, m, q;
scanf("%d %d %d", &n, &m, &q);
for (int i = 1; i <= n; i++) scanf("%d", &p[i]), f[i] = i;
for (int i = 1; i <= m; i++) {
int first, second;
scanf("%d %d", &first, &second);
e[i] = make_pair(first, second);
}
fill(ok, ok + m + 1, 1);
vector<pair<int, int> > qu;
for (int i = 1; i <= q; i++) {
int op, first;
scanf("%d %d", &op, &first);
qu.push_back(make_pair(op, first));
if (op == 2) ok[first] = 0;
}
for (int i = 1; i <= m; i++) {
if (ok[i]) {
int first, second;
tie(first, second) = e[i];
first = Find(first);
second = Find(second);
if (first != second) {
v[e[i].first].push_back(e[i].second);
v[e[i].second].push_back(e[i].first);
f[first] = second;
}
}
}
for (int i = q - 1; i >= 0; i--) {
if (qu[i].first == 2) {
int first, second;
tie(first, second) = e[qu[i].second];
int fx = Find(first), fy = Find(second);
if (fx != fy) {
ok[qu[i].second] = 1;
v[first].push_back(second);
v[second].push_back(first);
f[fx] = fy;
}
}
}
int lastnum = 0;
for (int i = 1; i <= n; i++) {
if (in[i] == 0) {
dfs(i, 0);
treap *last = node[lastnum + 1];
for (int j = lastnum + 2; j <= t; j++) {
last = merge(last, node[j]);
}
lastnum = t;
}
}
for (int i = 0; i < q; i++) {
if (qu[i].first == 2 && ok[qu[i].second]) {
int first, second;
tie(first, second) = e[qu[i].second];
if (in[first] < in[second]) swap(first, second);
treap *t = getf(node[in[second]]);
treap *l, *mid, *r;
split(t, in[first], l, mid);
split(mid, out[first] + 1, mid, r);
if (l) l->f = NULL;
mid->f = NULL;
if (r) r->f = NULL;
t = merge(l, r);
}
if (qu[i].first == 1) {
int v = qu[i].second;
treap *t = getf(node[in[v]]);
printf("%d\n", t->Max.first);
if (t->Max.first) {
int re = t->Max.second;
treap *l, *mid, *r;
split(t, re, l, mid);
split(mid, re + 1, mid, r);
mid->val = 0;
mid->Max = make_pair(0, mid->id);
if (l) l->f = NULL;
if (r) r->f = NULL;
mid->f = NULL;
t = merge(l, merge(mid, r));
}
}
}
}
int main() {
int t = 1;
while (t--) {
solve();
}
}
| 9 |
#include <bits/stdc++.h>
int n, m, x, y;
long long a, ans;
int num[100];
int main() {
int i, j, k;
scanf("%d%d", &n, &m);
a = 3;
num[1] = 3;
for (i = 2; i <= 30; i++) {
a *= a;
a %= m;
num[i] = a;
}
x = 1;
ans = 1;
for (i = 1; i <= 30; i++) {
if ((n & x) != 0) {
ans *= num[i];
ans %= m;
}
x *= 2;
}
ans -= 1;
if (ans < 0) {
ans += m;
}
printf("%d", ans);
getchar();
getchar();
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
int n, ans;
int a[101];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
if (!a[n]) return puts("0"), 0;
for (int i = 1; i <= n; ++i)
if (a[i] && a[i] != a[i + 1]) ++ans;
printf("%d\n", ans);
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int T, n;
long long x[maxn], y[maxn], z[maxn];
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld %lld %lld", &x[i], &y[i], &z[i]);
}
if (n == 1) {
printf("%lld %lld %lld\n", x[1], y[1], z[1]);
continue;
}
long long px = 0, py = 0, pz = 0;
auto solve = [&]() {
long long t = 0;
for (int i = 1; i <= n; i++)
t = max(t, abs(px - x[i]) + abs(py - y[i]) + abs(pz - z[i]));
return t;
};
long long ans = solve();
for (long long d = 1e18; d;) {
for (long long x : {-d, 0LL, d})
for (long long y : {-d, 0LL, d}) {
for (long long z : {-d, 0LL, d}) {
px += x, py += y, pz += z;
long long t = solve();
if (t < ans) {
ans = t;
goto nxt;
}
px -= x, py -= y, pz -= z;
}
}
d >>= 1;
nxt:;
}
printf("%lld %lld %lld\n", px, py, pz);
}
return 0;
}
| 10 |
#include <bits/stdc++.h>
using namespace std;
int n;
string i;
int main() {
int n;
vector<int> v;
stack<int> st;
int F = 0;
map<int, int> mp;
int pq;
cin >> n;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
v.push_back(tmp);
mp[tmp] = i + 1;
}
sort(v.begin(), v.end());
int I = 0;
for (int j = 0; j < 2 * n; ++j) {
char ch;
cin >> ch;
if (ch == '0') {
cout << mp[(int)v[I]] << " ";
st.push(v[I]);
++I;
} else {
cout << mp[st.top()] << " ";
st.pop();
}
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const vector<int> mods = {998244353, 1000000007, 1000000009};
const long long inf = 3e18;
const double pi = acos(-1.0);
const double eps = 0.0000001;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class... K>
using umap = unordered_map<K...>;
template <class... K>
using uset = unordered_set<K...>;
long long t, n, m, x, l, r;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout.precision(13);
cin >> t;
for (long long _t = (0); _t < (t); ++_t) {
cin >> n >> x >> m;
long long lo = x, hi = x;
for (long long i = (0); i < (m); ++i) {
cin >> l >> r;
if (l <= lo && r >= hi || l <= hi && r >= hi || l <= lo && r >= lo) {
lo = min(lo, l);
hi = max(hi, r);
}
}
cout << hi - lo + 1 << "\n";
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
struct Edge {
int id, w, u, v, b;
} E[maxn];
bool cmp1(Edge a, Edge b) {
if (a.b == b.b) return a.w < b.w;
return a.b > b.b;
}
bool cmp2(Edge a, Edge b) { return a.id < b.id; }
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ++i) {
scanf("%d%d", &E[i].w, &E[i].b);
E[i].id = i;
}
sort(E + 1, E + m + 1, cmp1);
for (int i = 1; i < n; ++i) {
E[i].u = i;
E[i].v = i + 1;
}
int f = 3, t = 0;
for (int i = n; i <= m; ++i) {
t++;
if (t + 2 > f) {
f++;
t = 1;
}
if (E[i].w < E[f - 1].w) {
printf("-1\n");
return 0;
}
E[i].u = f;
E[i].v = t;
}
sort(E + 1, E + m + 1, cmp2);
for (int i = 1; i <= m; ++i) {
printf("%d %d\n", E[i].u, E[i].v);
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] < 97) s[i] += 32;
if (s[i] == 'A' || s[i] == 'O' || s[i] == 'Y' || s[i] == 'E' ||
s[i] == 'U' || s[i] == 'I' || s[i] == 'a' || s[i] == 'o' ||
s[i] == 'y' || s[i] == 'e' || s[i] == 'u' || s[i] == 'i')
s[i] = '0';
}
for (int j = 0; j < s.length(); j++) {
if (s[j] != '0') cout << "." << s[j];
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
ostream& operator<<(ostream& stream, const vector<T> v) {
stream << "[";
for (int i = 0; i < (int)v.size(); i++) cout << v[i] << " ";
stream << "]";
return stream;
}
long long fpow(long long x, long long p, long long m) {
long long r = 1;
for (; p >>= 1;) {
if (p & 1) r = r * x % m;
x = x * x % m;
}
return r;
}
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
long long gcd(long long a, long long b) {
if (!b) return a;
return gcd(b, a % b);
}
const int maxn = 10000000;
int N, pi[maxn + 10], sp[maxn + 10], cnt[maxn + 10];
bool v[maxn + 10];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
long long res = 0, t = 0, bad = 0;
int i, j;
for (i = 2; i <= N; i++) {
if (!v[i]) {
if (2 * i > N) {
bad++;
continue;
}
pi[i] = i - 1;
sp[i] = i;
for (j = 2 * i; j <= N; j += i) {
v[j] = 1;
if (pi[j] == 0) pi[j] = j, sp[j] = i;
pi[j] = pi[j] / i * (i - 1);
}
}
t++;
res += pi[i] - 1 - bad;
cnt[sp[i]]++;
res += t - 1;
}
int l = N + 1;
long long ct = 0;
for (i = 2; i <= N; i++)
if (!v[i] && 2 * i <= N) {
while (1LL * i * (l - 1) > N && l > i) {
l--;
ct += cnt[l];
}
while (l < i) {
ct -= cnt[l];
l++;
}
long long val;
if (l == i)
val = 1LL * cnt[i] * (ct - cnt[i]) + 1LL * cnt[i] * (cnt[i] - 1) / 2;
else
val = 1LL * cnt[i] * ct;
res += val;
}
cout << res << "\n";
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
int n, aa[N], bb[N], a[N], v[N], bel[N], d;
void fix(int x, int y) {
int p = bb[x] ^ v[x], t = bel[p];
if (t == x) return;
if (t == y) {
swap(aa[x], aa[y]);
swap(bel[aa[x]], bel[aa[y]]);
return;
}
swap(bel[p], bel[aa[x]]);
swap(aa[t], aa[x]);
swap(bb[t], bb[y]);
fix(t, y);
}
int main() {
ios::sync_with_stdio(false);
cin >> n;
n = 1 << n;
for (int i = 0; i < n; i++)
cin >> a[i], d ^= a[i], aa[i] = bb[i] = bel[i] = i;
if (d) {
cout << "Fou" << endl;
return 0;
}
cout << "Shi" << endl;
for (int i = 0; i + 1 < n; i++)
if (v[i] != a[i]) {
int x = v[i] ^ a[i];
v[i] ^= x;
v[i + 1] ^= x;
fix(i, i + 1);
}
for (int i = 0; i < n; i++) cout << aa[i] << ' ';
cout << endl;
for (int i = 0; i < n; i++) cout << bb[i] << ' ';
return 0;
}
| 11 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long p, d;
cin >> p >> d;
long long ans = p;
long long k = p - d;
long long t = 1, h = p;
while (p) {
if (h % 10 == 9) {
t *= 10;
} else {
break;
}
h /= 10;
}
t *= 10;
for (int i = 0; i < 18; i++) {
long long tmp = p - (p % t) - 1;
if (tmp != -1 && tmp >= k) {
ans = tmp;
t *= 10;
} else {
cout << ans << endl;
return;
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
long long x, y;
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void gcd(long long x, long long y, char a, char b) {
long long ox, oy;
while (!(x == 1 && y == 1)) {
if (x < y) {
swap(x, y);
swap(a, b);
}
printf("%I64d%c", (x - 1) / y, a);
ox = x, oy = y;
x = ox - (ox - 1) / oy * oy;
y = oy;
}
}
int main() {
scanf("%I64d %I64d", &x, &y);
if (gcd(x, y) != 1)
return puts("Impossible"), 0;
else {
gcd(x, y, 'A', 'B');
}
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
long long r[100009], h[100009];
set<long long> S;
vector<long long> v;
long long dp[100009];
long long st[4 * 100009];
long double PIE = 3.1415926535897;
long long query(int s, int e, int idx, int l, int r) {
if ((l > e) || (s > r) || (l > r) || (s > e)) {
return 0LL;
}
if ((l <= s) && (r >= e)) {
return st[idx];
}
int m = (s + e) / 2;
return max(query(s, m, 2 * idx + 1, l, r),
query(m + 1, e, 2 * idx + 2, l, r));
}
void update(int s, int e, int idx, int pos, long long val) {
if (s > pos || (e < pos)) {
return;
}
if ((s == e) && (s == pos)) {
st[idx] = val;
return;
}
int m = (s + e) / 2;
update(s, m, 2 * idx + 1, pos, val);
update(m + 1, e, 2 * idx + 2, pos, val);
st[idx] = max(st[2 * idx + 1], st[2 * idx + 2]);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> r[i] >> h[i];
S.insert(r[i] * r[i] * h[i]);
}
for (set<long long>::iterator it = S.begin(); it != S.end(); it++) {
v.push_back(*it);
}
int c = (int)v.size();
long long ans = 0;
for (int i = 0; i < n; i++) {
int l = lower_bound(v.begin(), v.end(), r[i] * r[i] * h[i]) - v.begin();
l--;
long long x = query(0, c - 1, 0, 0, l);
dp[i] = x + (r[i] * r[i] * h[i]);
ans = max(ans, dp[i]);
update(0, c - 1, 0, l + 1, dp[i]);
}
long double res = (long double)ans * PIE;
cout << fixed << setprecision(13);
cout << res << endl;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
long long int res = 1;
x = x % 1000000007;
while (y > 0) {
if (y & 1) res = (res * x) % 1000000007;
y = y >> 1;
x = (x * x) % 1000000007;
}
return res;
}
long long int bst(long long int a[], long long int item, long long int index,
long long int n) {
long long int b = index, e = n, mid;
mid = (b + e) / 2;
while (a[mid] != item && b <= e) {
if (a[mid] < item)
b = mid + 1;
else
e = mid - 1;
mid = (b + e) / 2;
}
return mid;
}
long long int max3(long long int x, long long int y, long long int z) {
return max(max(x, y), z);
}
long long int min3(long long int x, long long int y, long long int z) {
return min(min(x, y), z);
}
string cir_shift(string s) {
string s1;
long long int len;
len = s.size();
s1 = s.substr(1, len - 1);
s1.push_back(s[0]);
return s1;
}
template <typename Type>
void swap1(Type &a, Type &b) {
Type temp;
temp = a;
a = b;
b = temp;
};
long long int dp[5002][5002];
int main() {
ios::sync_with_stdio(false);
cin.tie();
cout.tie();
long long int n, i, j, l, r, q;
cin >> n;
long long int a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
dp[1][i] = a[i];
}
for (i = 2; i <= n; i++) {
for (j = 1; j <= n - i + 1; j++) {
dp[i][j] = dp[i - 1][j] ^ dp[i - 1][j + 1];
}
}
for (i = 2; i <= n; i++) {
for (j = 1; j <= n - i + 1; j++) {
dp[i][j] = max(dp[i][j], max(dp[i - 1][j], dp[i - 1][j + 1]));
}
}
cin >> q;
while (q--) {
cin >> l >> r;
cout << dp[r - l + 1][l] << endl;
}
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
int n;
cin >> s;
cin >> n;
int arr[n];
vector<int> v(n, 0);
queue<int> q;
for (long long i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] == 0) {
q.push(i);
v[i] = 1;
}
}
char ans[n];
stack<char> letter;
unordered_map<char, int> um;
int size;
for (long long i = 0; i < s.length(); i++) {
um[s[i]]++;
}
for (long long i = 0; i < 26; i++) {
if (um['a' + i] > 0) {
letter.push('a' + i);
}
}
while (q.empty() != true) {
char toadd;
size = q.size();
while (um[letter.top()] < size) {
letter.pop();
}
toadd = letter.top();
while (size--) {
int top = q.front();
ans[top] = toadd;
q.pop();
for (long long i = 0; i < n; i++) {
if (arr[i] - abs(i - top) >= 0) {
arr[i] = arr[i] - abs(i - top);
if (arr[i] == 0 && v[i] == 0) {
q.push(i);
v[i] = 1;
}
}
}
um[toadd] = 0;
}
}
for (long long i = 0; i < n; i++) {
cout << ans[i];
}
cout << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
}
| 5 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define X first
#define Y second
#define pb push_back
#define pii pair<int,int>
#define endl '\n'
#define New_Time srand((unsigned)time(NULL))
inline ll gcd(ll a, ll b) { while (b != 0) { ll c = a % b; a = b; b = c; }return a; }
inline ll lowbit(ll x) { return x & (-x); }
inline void mem(int a[], int n, int k = 0) { for (int i = 0; i <= n + 100; i++)a[i] = k; }
inline void mem(ll a[], int n, int k = 0) { for (int i = 0; i <= n + 100; i++)a[i] = k; }
int dir[8][2] = { {-1,0},{0,-1},{-1,-1},{1,-1},{1,0},{0,1},{1,1},{-1,1} };
const long double PI = 3.14159265358979323846;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
inline void pt(int x) { printf("%d ", x); }
inline void ptn(int x) { printf("%d\n", x); }
inline void pt(ll x) { printf("%lld ", x); }
inline void ptn(ll x) { printf("%lld\n", x); }
inline ll rd() {
ll x = 0; bool f = 1; char ch = getchar();
while (ch < '0' || ch>'9') { if (ch == '-')f = 0; ch = getchar(); }
while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
return f ? x : -x;
}
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const int M = 1e6 + 10;
const int N = 2e7 + 10;
int prime[N];
int v[N], fac[N];
int primes(int n) {
memset(v, 0, sizeof(bool) * (n + 10));
int m = 0;//素数个数
for (int i = 2; i <= n; i++) {
if (v[i] == 0) {
v[i] = i;
prime[++m] = i;
}
for (int j = 1; j <= m; j++) {
if (prime[j] > v[i] || prime[j] > n / i)break;
v[i * prime[j]] = prime[j];
}
}
//fac[1] = 1;
for (int i = 2; i <= 2e7; i++) {
if (v[i] == i)fac[i] = 1;
else fac[i] = fac[i / v[i]] + ((i / v[i]) % v[i] > 0);
}
return m;
}
int c, d, x;
int get(int a) {
if ((x / a + d) % c)return 0;
int ak = (x / a + d) / c;
if (ak <= 0)return 0;
return 1 << fac[ak];
}
void solve() {
c = rd(), d = rd(), x = rd();
int ma = sqrt(x);
ll ans = 0;
for (int x1 = 1; x1 <= ma; x1++) {
if (x % x1)continue;
ans += get(x1);
if (x1 * x1 != x) {
ans += get(x / x1);
}
}
// get(c, -d, x);
ptn(ans);
}
int main() {
primes(2e7);
int _T = 1;
_T = rd();
while (_T--)solve();
} | 6 |
#include <bits/stdc++.h>
using namespace std;
long long n;
pair<pair<long long, long long>,
pair<pair<long long, long long>, pair<long long, long long> > >
a[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long q;
cin >> q;
while (q--) {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i].first.first >> a[i].first.second >> a[i].second.first.first >>
a[i].second.first.second >> a[i].second.second.first >>
a[i].second.second.second;
}
long long b = -1e5, c = -1e5, d = 1e5, e = 1e5;
int ok = 1;
for (int i = 0; i < n; ++i) {
if (!a[i].second.first.first) {
if (d < a[i].first.first)
ok = 0;
else
b = max(b, a[i].first.first);
}
if (!a[i].second.first.second) {
if (c > a[i].first.second)
ok = 0;
else
e = min(e, a[i].first.second);
}
if (!a[i].second.second.first) {
if (b > a[i].first.first)
ok = 0;
else
d = min(d, a[i].first.first);
}
if (!a[i].second.second.second) {
if (e < a[i].first.second)
ok = 0;
else
c = max(c, a[i].first.second);
}
}
if (!ok)
cout << 0 << endl;
else
cout << 1 << ' ' << b << ' ' << c << endl;
}
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int Inf = 0x3f3f3f3f;
int jt;
void inline add(int &a, int b) {
a += b - jt;
a += (a >> 31) & jt;
}
void inline sub(int &a, int b) {
a -= b;
a += (a >> 31) & jt;
}
void inline mul(int &a, int b) { a = 1ll * a * b % jt; }
int inline Add(int a, int b) { return a + b >= jt ? a + b - jt : a + b; }
int inline Sub(int a, int b) { return a - b < 0 ? a - b + jt : a - b; }
int inline Mul(int a, int b) { return 1ll * a * b % jt; }
int N, M, K;
int dp[105][105][105];
int C[105][105], jc[105];
int main() {
scanf("%d%d%d%d", &N, &M, &K, &jt);
for (int i = 0; i <= N; ++i) C[i][0] = 1;
for (int i = 1; i <= N; ++i)
for (int j = 1; j <= i; ++j) C[i][j] = Add(C[i - 1][j], C[i - 1][j - 1]);
jc[0] = 1;
for (int i = 1; i <= N; ++i) jc[i] = Mul(jc[i - 1], i);
for (int j = 0; j <= M; ++j) dp[0][j][0] = dp[1][j][0] = 1;
dp[1][0][1] = 1;
dp[1][0][0] = 0;
for (int i = 2; i <= N; ++i) {
dp[i][0][1] = jc[i];
for (int j = 1; j < min(M, i + 3); ++j) {
int mxk = min(K, j <= 7 ? (1 << j) : 114);
for (int ni = 0; ni < i; ++ni)
for (int nk = 0; nk <= mxk; ++nk)
if (dp[ni][j - 1][nk]) {
int mxnk = i - ni + 3 > j ? mxk : nk;
for (int k = nk; k <= mxnk; ++k)
if (k) {
add(dp[i][j][k],
Mul(Mul(dp[ni][j - 1][nk], dp[i - ni - 1][j - 1][k - nk]),
C[i - 1][ni]));
}
}
}
for (int j = 1; j < M; ++j) {
for (int ni = 0; ni < i; ++ni)
if (dp[ni][j - 1][0]) {
add(dp[i][j][0], Mul(Mul(dp[ni][j - 1][0], dp[i - ni - 1][j - 1][0]),
C[i - 1][ni]));
}
}
}
printf("%d\n", dp[N][M - 1][K]);
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k, temp, fedor, ans, count = 0;
cin >> n >> m >> k;
vector<int> arr;
for (int i = 0; i < m; i++) {
cin >> temp;
arr.push_back(temp);
}
cin >> fedor;
for (int i = 0; i < m; ++i) {
ans = fedor ^ arr[i];
int a1 = __builtin_popcount(ans);
if (a1 <= k) count++;
}
cout << count;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
if (n & 1) {
cout << 7;
n -= 3;
}
while (n) {
cout << 1;
n -= 2;
}
cerr << " Execution : " << (1.0 * clock()) / CLOCKS_PER_SEC << "s \n";
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int dp[2005][2005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
while (T--) {
int n, k;
cin >> n >> k;
vector<int> a(n + 1);
for (int i = 0; i < n; ++i) cin >> a[i + 1];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; ++i)
for (int j = 0; j <= i; ++j) {
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
dp[i + 1][j + 1] =
max(dp[i + 1][j + 1], dp[i][j] + (a[i + 1] == j + 1));
}
int ans = -1;
for (int i = n; i >= 0; --i)
if (dp[n][i] >= k) {
ans = n - i;
break;
}
cout << ans << '\n';
}
}
| 6 |
#include <bits/stdc++.h>
const long long mod = (long long)1e9 + 7;
const int maxn = (int)2e6 + 100;
long long inf = 1LL << 60;
using namespace std;
inline void read(int &n) {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = 10 * x + ch - '0';
ch = getchar();
}
n = x * f;
}
inline void read(long long &n) {
long long x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = 10ll * x + ch - '0';
ch = getchar();
}
n = x * f;
}
int binPow(int a, int x) {
if (x == 0) return 1;
int g = binPow(a, x / 2);
g = (long long)g * g % mod;
if (x & 1) g = (long long)g * a % mod;
return g;
}
int main() {
ios_base::sync_with_stdio(0);
int n;
read(n);
int fact1 = 1, fact2 = 1;
for (int i = 1; i < n + 2; i++) fact1 = (long long)fact1 * i % mod;
fact2 = fact1;
for (int i = n + 2; i < 2 * n + 3; i++) fact2 = (long long)fact2 * i % mod;
int invf = binPow(fact1, mod - 2);
long long ans = (long long)fact2 * invf % mod * invf % mod - 1;
printf("%I64d", (ans + mod) % mod);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
const int Max = 1e6 + 5;
int lst[Max];
int main() {
int t;
cin >> t;
while (t--) {
long long n, k;
cin >> n >> k;
long long sum = 0;
while (n > 0) {
if (n % k == 0) {
n /= k;
sum++;
} else {
sum += n % k;
n -= n % k;
}
}
cout << sum << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000010;
int lsum[maxn << 2], rsum[maxn << 2], msum[maxn << 2];
char str[maxn];
struct point {
int l, r, m;
point(int l = 0, int r = 0, int m = 0) : l(l), r(r), m(m) {}
};
void pushup(int o) {
lsum[o] = lsum[2 * o] + lsum[2 * o + 1];
rsum[o] = rsum[2 * o] + rsum[2 * o + 1];
msum[o] = msum[2 * o] + msum[2 * o + 1];
msum[o] += min(lsum[2 * o] - msum[2 * o], rsum[2 * o + 1] - msum[2 * o + 1]);
}
void build(int l, int r, int o) {
if (l == r) {
lsum[o] = rsum[o] = msum[o] = 0;
if (str[l] == '(') lsum[o] = 1;
if (str[l] == ')') rsum[o] = 1;
return;
}
int m = (l + r) >> 1;
build(l, m, 2 * o);
build(m + 1, r, 2 * o + 1);
pushup(o);
}
point query(int L, int R, int l, int r, int o) {
if (L <= l && R >= r) {
return point(lsum[o], rsum[o], msum[o]);
}
int m = (l + r) >> 1;
if (L > m) return query(L, R, m + 1, r, 2 * o + 1);
if (R <= m) return query(L, R, l, m, 2 * o);
point p1 = query(L, R, l, m, 2 * o), p2 = query(L, R, m + 1, r, 2 * o + 1);
point p;
p.l = p1.l + p2.l;
p.r = p1.r + p2.r;
p.m = p1.m + p2.m + min(p1.l - p1.m, p2.r - p2.m);
return p;
}
int main() {
scanf("%s", str);
int n = strlen(str);
build(0, n - 1, 1);
int m;
scanf("%d", &m);
while (m--) {
int l, r;
scanf("%d%d", &l, &r);
l--;
r--;
point p = query(l, r, 0, n - 1, 1);
printf("%d\n", 2 * p.m);
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int mod = int(1e9 + 7);
int t[int(1e5 + 1)], ul[int(1e5 + 1)], a[int(1e5 + 1)];
vector<int> v[int(1e5 + 1)];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) {
int p, q;
cin >> p >> q;
v[q + 1].push_back(p + 1);
ul[p + 1]++;
}
int dod = 0;
for (int i = 1; i <= n; i++)
if (v[i].empty() && !ul[i] && a[i]) {
dod = 1;
break;
}
queue<int> q;
for (int i = 1; i <= n; i++)
if (ul[i] == 0) {
q.push(i);
t[i] = a[i];
}
int rez = 0;
while (!q.empty()) {
for (auto i : v[q.front()]) {
if (a[q.front()] != a[i])
t[i] = max(t[i], t[q.front()] + a[i]);
else
t[i] = max(t[i], t[q.front()]);
if (t[i] > rez) rez = t[i];
ul[i]--;
if (!ul[i]) q.push(i);
}
q.pop();
}
cout << max(rez, dod);
return 0;
}
| 5 |
#include <bits/stdc++.h>
const double eps = 1e-9;
const double pi = acos(-1);
const int oo = 1000000000;
const int mod = 1000000007;
const double E = 2.7182818284590452353602874713527;
using namespace std;
char a[1000005], b[1000005], t[555];
int st[1000005], en[1000005], v[1000005][3][3];
int main() {
int n, la, lb;
long long ans = 0;
scanf("%d\n", &n);
gets(a + 1);
gets(b + 1);
la = strlen(a + 1);
lb = strlen(b + 1);
int j = 1;
for (int i = 1; i <= la; i++) {
while (j < lb && b[j] != a[i]) j++;
en[i] = j;
if (j < lb) j++;
}
st[j = 1] = 1;
for (int i = 1; i <= lb; i++) {
while (j < la && b[i] != a[j]) st[++j] = i;
if (j < la) st[++j] = i + 1;
}
while (j < la) st[++j] = lb + 1;
for (int i = 1; i <= la; i++) ans += en[i] - st[i] + 1;
t['G'] = 1;
t['B'] = 2;
for (int i = 2; i <= lb; i++) {
for (int j = 0; j < 3; j++)
for (int k = 0; k < 3; k++) v[i][j][k] = v[i - 1][j][k];
v[i][t[b[i]]][t[b[i - 1]]]++;
}
for (int i = 2; i <= la; i++)
if (a[i] != a[i - 1])
ans -=
v[en[i]][t[a[i - 1]]][t[a[i]]] - v[st[i] - 1][t[a[i - 1]]][t[a[i]]];
cout << ans << endl;
return 0;
}
| 8 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, k;
cin >> n >> k;
long long len = (1LL << n) - 1;
while (true) {
long long mid = len / 2 + 1;
if (k == mid) break;
if (k > mid) k -= mid;
n--;
len = (1LL << n) - 1;
}
cout << n << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int gi() {
char c = getchar();
while (c < '0' || c > '9') c = getchar();
int sum = 0;
while ('0' <= c && c <= '9') sum = sum * 10 + c - 48, c = getchar();
return sum;
}
int n, m, t, T, l[maxn], r[maxn], c[maxn], n1 = 1e9, n2;
vector<int> to[maxn];
int dfs(int u) {
for (int v : to[u])
if (!c[v]) {
c[v] = c[u] ^ 3;
if (!dfs(v)) return 0;
} else if (c[u] == c[v])
return 0;
return 1;
}
int main() {
t = gi();
T = gi();
n = gi();
m = gi();
for (int i = 1; i <= n; ++i)
l[i] = gi(), r[i] = gi(), n1 = min(n1, r[i]), n2 = max(n2, l[i]);
if (n1 + n2 < t) n2 = t - n1;
if (n1 + n2 > T) n1 = T - n2;
if (n1 < 0 || n2 < 0) return puts("IMPOSSIBLE"), 0;
for (int i = 1; i <= n; ++i) {
int t1 = l[i] <= n1 && n1 <= r[i], t2 = l[i] <= n2 && n2 <= r[i];
if (!t1 && !t2) return puts("IMPOSSIBLE"), 0;
if (!t1 && t2) c[i] = 2;
if (t1 && !t2) c[i] = 1;
}
for (int i = 1, x, y; i <= m; ++i)
x = gi(), y = gi(), to[x].push_back(y), to[y].push_back(x);
for (int i = 1; i <= n; ++i)
if (c[i] && !dfs(i)) return puts("IMPOSSIBLE"), 0;
for (int i = 1; i <= n; ++i)
if (!c[i]) {
c[i] = 1;
if (!dfs(i)) return puts("IMPOSSIBLE"), 0;
}
printf("POSSIBLE\n%d %d\n", n1, n2);
for (int i = 1; i <= n; ++i) printf("%d", c[i]);
return 0;
}
| 12 |
#include <bits/stdc++.h>
using namespace std;
long long INFF = 1000000000000000005LL;
template <typename T>
void scan(T &x) {
x = 0;
bool neg = 0;
register T c = getchar();
if (c == '-') neg = 1, c = getchar();
while ((c < 48) || (c > 57)) c = getchar();
for (; c < 48 || c > 57; c = getchar())
;
for (; c > 47 && c < 58; c = getchar()) x = (x << 3) + (x << 1) + (c & 15);
if (neg) x *= -1;
}
template <typename T>
void print(T n) {
bool neg = 0;
if (n < 0) n *= -1, neg = 1;
char snum[65];
int i = 0;
do {
snum[i++] = n % 10 + '0';
n /= 10;
} while (n);
--i;
if (neg) putchar('-');
while (i >= 0) putchar(snum[i--]);
putchar('\n');
}
template <typename T, typename U>
static inline void amin(T &x, U y) {
if (y < x) x = y;
}
template <typename T, typename U>
static inline void amax(T &x, U y) {
if (x < y) x = y;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second > b.second);
}
long long int gcd(long long int a, long long int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long int getSum(long long int n) {
long long int sum = 0;
while (n != 0) {
sum = sum + n % 10;
n = n / 10;
}
return sum;
}
long long int factorial(long long int n) {
if (n > 1)
return n * factorial(n - 1);
else
return 1;
}
int countDigit(long long n) {
int count = 0;
while (n != 0) {
n = n / 10;
++count;
}
return count;
}
const int NN = 1e9 + 7;
unsigned long long pow1(long long int base, long long int powerRaised) {
if (powerRaised != 0)
return ((base)*pow1(base, powerRaised - 1)) % NN;
else
return 1;
}
bool prime(int n) {
for (int i = 2; i < n; i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
bool isPowerOfTwo(int n) {
if (n == 0) return false;
return (ceil(log2(n)) == floor(log2(n)));
}
int getC(map<string, int> z, string a, string b) {
if (z.count(a) && z.count(b)) {
return z[a] + z[b];
}
return INT_MAX;
}
void solve() {
int n;
cin >> n;
pair<int, int> a[n];
pair<int, int> b[n];
for (int i = 0; i < n; i++) {
cin >> a[i].first;
cin >> a[i].second;
}
for (int i = 0; i < n; i++) {
cin >> b[i].first;
cin >> b[i].second;
}
vector<pair<int, int>> d[n];
vector<pair<int, int>> c;
for (int i = 0; i < n; i++) {
c.push_back({a[0].first + b[i].first, a[0].second + b[i].second});
}
d[0] = c;
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
int a1 = a[i].first + b[j].first;
int a2 = a[i].second + b[j].second;
bool check = false;
for (auto x : d[i - 1]) {
if (x.first == a1 && x.second == a2) {
d[i].push_back({a1, a2});
break;
}
}
}
}
map<pair<int, int>, int> p;
int max_ = 0;
pair<int, int> m;
for (auto i : d) {
for (auto j : i) {
if (p.count(j)) {
p[j]++;
if (max_ < p[j]) {
m = j;
}
} else {
p[j] = 1;
if (max_ < p[j]) {
m = j;
}
}
}
}
cout << m.first << " " << m.second << endl;
}
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n = 1, a = 0;
for (a = 0; a < n; ++a) solve();
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 * 1000 + 12;
const int maxlg = 31;
int chanlg[maxlg];
int oonlg[maxlg];
void login(int a) {
ios::sync_with_stdio(0);
for (int j = 0; j < maxlg; j++)
if ((1 << j) & a) chanlg[j]++;
}
void input(int n, bool q) {
ios::sync_with_stdio(0);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (!q)
login(a);
else
oonlg[a]++;
}
}
int main() {
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
input(n, 0);
input(m, 1);
int ans = m;
for (int i = 0; i < maxlg; i++) {
if (chanlg[i] >= oonlg[i])
oonlg[i] = 0;
else {
oonlg[i] -= chanlg[i];
chanlg[i] = 0;
int x = 1;
for (int j = i + 1; j < maxlg; j++) {
x *= 2;
if (oonlg[i] > x * chanlg[j])
oonlg[i] -= (x * chanlg[j]), chanlg[j] = 0;
else {
chanlg[j] -= ((oonlg[i] / x) + ((oonlg[i] % x == 0) ? 0 : 1));
if (oonlg[i] % x != 0) login((1 << j) / x * (x - oonlg[i] % x));
oonlg[i] = 0;
}
if (oonlg[i] == 0) break;
}
}
}
for (int i = 0; i < maxlg; i++) ans -= oonlg[i];
cout << ans;
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
scanf("%I64d", &n);
if (n < 3) {
printf("-1\n");
return 0;
}
if (n & 1) {
printf("%I64d %I64d\n", (n * n - 1) >> 1, (n * n + 1) >> 1);
return 0;
}
printf("%I64d %I64d\n", (n * n - 4) >> 2, (n * n + 4) >> 2);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
int getnum() {
int x = 0, f = 1;
char ch = gc();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = gc();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = gc();
}
return x * f;
}
const int N = 150010, mo = 998244353;
int n, Q, B, invn;
int cnt, tim, top;
int head[N];
vector<int> son[N];
int par[N][21];
int st[N];
int C[N];
int W[N];
int dfn[N];
int low[N];
int siz[N];
int depth[N];
void addedge(int u, int v) { son[u].push_back(v); }
void get_read() {
n = getnum();
Q = getnum();
for (int i = 1; i <= n - 1; ++i) {
int u = getnum(), v = getnum();
addedge(u, v);
addedge(v, u);
}
}
void dfs(int u, int fa) {
dfn[u] = ++tim;
depth[u] = depth[fa] + 1;
siz[u] = 1;
par[u][0] = fa;
for (int i = 1; i <= 20; ++i) par[u][i] = par[par[u][i - 1]][i - 1];
for (int i = 0, L = son[u].size(); i < L; ++i) {
int v = son[u][i];
if (v == fa) continue;
dfs(v, u);
siz[u] += siz[v];
}
low[u] = tim;
}
void add(int &a, int b) {
a += b;
if (a >= mo) a -= mo;
}
int ksm(int a, int b) {
int s = 1;
while (b) {
if (b & 1) s = 1LL * s * a % mo;
a = 1LL * a * a % mo;
b >>= 1;
}
return s;
}
int lowbit(int x) { return x & (-x); }
void modify(int L, int R, int x) {
for (int i = L; i <= n; i += lowbit(i)) add(C[i], x);
for (int i = R + 1; i <= n; i += lowbit(i)) add(C[i], mo - x);
}
int query(int p) {
int ret = 0;
for (int i = p; i; i -= lowbit(i)) add(ret, C[i]);
return ret;
}
void calc(int u, int D) {
for (int i = 0, L = son[u].size(); i < L; ++i) {
int v = son[u][i];
if (v == par[u][0]) continue;
modify(dfn[v], low[v], 1LL * D * (n - siz[v]) % mo * invn % mo);
}
modify(1, n, 1LL * D * siz[u] % mo * invn % mo);
modify(dfn[u], low[u], 1LL * (mo - D) * siz[u] % mo * invn % mo);
}
int get(int u, int D) {
if (D < 0) return -1;
for (int i = 20; i >= 0; --i)
if (D & (1 << i)) u = par[u][i];
return u;
}
int ask(int u) {
int ans = (W[u] + query(dfn[u])) % mo;
for (int i = 1; i <= top; ++i) {
if (st[i] == u) continue;
int v = st[i], p = get(u, depth[u] - depth[v] - 1);
if (p == -1 || par[p][0] != v)
add(ans, 1LL * W[v] * siz[v] % mo * invn % mo);
else
add(ans, 1LL * W[v] * (n - siz[p]) % mo * invn % mo);
}
return ans;
}
void get_work() {
dfs(1, 0);
B = sqrt(n) + 1;
invn = ksm(n, mo - 2);
for (int i = 1; i <= n; ++i)
if (son[i].size() > B) st[++top] = i;
while (Q--) {
int type = getnum();
if (type == 1) {
int u = getnum(), D = getnum();
add(W[u], D);
if (son[u].size() <= B) calc(u, D);
} else {
int u = getnum();
printf("%d\n", ask(u));
}
}
}
int main() {
get_read();
get_work();
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100010, K = 110;
const double PI = acos(-1);
map<int, int> frq;
int mn = 1000000000, mx = -1000000000, n;
int main() {
scanf("%d", &n);
long long sum = 0;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
frq[a]++;
mn = min(mn, a);
mx = max(mx, a);
sum += a;
}
if (mn + 1 >= mx) {
cout << n << endl;
for (int i = 0; i < frq[mn]; i++) {
printf("%d ", mn);
}
for (int j = 0; j < frq[mn + 1]; j++) {
printf("%d ", mn + 1);
}
puts("");
return 0;
}
int a1 = mn;
int b1 = mn + 1;
int c1 = mn + 2;
int ans = -1, ans1 = 0, ans2 = 0, ans3 = 0;
for (int a = 0; a <= n; a++) {
long long d = sum - (long long)a * a1;
d -= (long long)n * c1;
d += (long long)a * c1;
d = (long long)d / (b1 - c1);
int b = (int)d;
int c = n - a - b;
if (c < 0 || b < 0) continue;
if ((long long)a * a1 + (long long)b * b1 + (long long)c * c1 == sum) {
if (max(0, a - frq[a1]) + max(0, c - frq[c1]) + max(0, b - frq[b1]) >
ans) {
ans = max(0, a - frq[a1]) + max(0, c - frq[c1]) + max(0, b - frq[b1]);
ans1 = a, ans2 = b, ans3 = c;
}
}
}
cout << n - ans << endl;
bool first = true;
for (int i = 0; i < ans1; i++) {
if (!first) putchar(' ');
printf("%d", a1);
first = false;
}
for (int i = 0; i < ans2; i++) {
if (!first) putchar(' ');
printf("%d", b1);
first = false;
}
for (int i = 0; i < ans3; i++) {
if (!first) putchar(' ');
printf("%d", c1);
first = false;
}
puts("");
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
struct point {
int x;
int y;
};
bool operator<(const point &a, const point &b) { return (a.x < b.x); }
int compare(const void *a, const void *b) { return (*(int *)a - *(int *)b); }
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
int a[200][200];
int main() {
int n, t, i, j, x, y;
cin >> n >> t;
a[100][100] = n;
while (1) {
int flag = 0;
for (i = 0; i < 200; i++)
for (j = 0; j < 200; j++)
if (a[i][j] >= 4) {
if (i > 0) a[i - 1][j] += (a[i][j] / 4);
if (i < 199) a[i + 1][j] += (a[i][j] / 4);
if (j > 0) a[i][j - 1] += (a[i][j] / 4);
if (j < 199) a[i][j + 1] += (a[i][j] / 4);
flag = 1;
a[i][j] %= 4;
}
if (!flag) break;
}
for (i = 0; i < t; i++) {
cin >> x >> y;
if (x < 100 && x >= -100 && y < 100 && y >= -100)
cout << a[x + 100][y + 100] << endl;
else
cout << 0 << endl;
}
return 0;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
vector<int> e[100000 + 5];
int dep[100000 + 5], euler[100000 * 2 + 5], fi[100000 + 5], cnt;
void dfs(int now) {
euler[++cnt] = now;
fi[now] = cnt;
for (auto v : e[now]) {
dep[v] = dep[now] + 1;
dfs(v);
euler[++cnt] = now;
}
return;
}
int lg[100000 * 2 + 5], st[100000 * 2 + 5][18];
int ask(int l, int r) {
int k = lg[r - l + 1];
return dep[st[l][k]] < dep[st[r - (1 << k) + 1][k]] ? st[l][k]
: st[r - (1 << k) + 1][k];
}
struct node {
int M, m;
node() {}
node(int a, int b) : M(a), m(b) {}
} seg[100000 + 5][18];
int mymax(int x, int y) { return fi[x] > fi[y] ? x : y; }
int mymin(int x, int y) { return fi[x] < fi[y] ? x : y; }
node Merge(node a, node b) { return node(mymax(a.M, b.M), mymin(a.m, b.m)); }
int mm, MM;
node ASK(int l, int r) {
if (l > r) return node(mm, MM);
int k = lg[r - l + 1];
return Merge(seg[l][k], seg[r - (1 << k) + 1][k]);
}
int main() {
lg[1] = 0;
for (int i = 2; i <= 100000 * 2; i++) lg[i] = lg[i >> 1] + 1;
int n, q;
scanf("%d%d", &n, &q);
for (int i = 2; i <= n; i++) {
int x;
scanf("%d", &x);
e[x].push_back(i);
}
dfs(1);
int N = n * 2 - 1;
for (int i = 1; i <= N; i++) st[i][0] = euler[i];
for (int i = 1; i <= lg[N]; i++)
for (int j = 1; j <= N - (1 << i) + 1; j++)
st[j][i] = dep[st[j][i - 1]] < dep[st[j + (1 << i - 1)][i - 1]]
? st[j][i - 1]
: st[j + (1 << i - 1)][i - 1];
for (int i = 1; i <= n; i++) seg[i][0] = node(i, i);
for (int i = 1; i <= 16; i++)
for (int j = 1; j <= n; j++)
seg[j][i] = Merge(seg[j][i - 1], seg[j + (1 << i - 1)][i - 1]);
fi[mm = n + 1] = -0x3f3f3f3f;
fi[MM = n + 2] = 0x3f3f3f3f;
while (q--) {
int l, r;
scanf("%d%d", &l, &r);
node tmp = ASK(l, r);
node t1 = Merge(ASK(l, tmp.M - 1), ASK(tmp.M + 1, r));
node t2 = Merge(ASK(l, tmp.m - 1), ASK(tmp.m + 1, r));
int ansM = dep[ask(fi[t1.m], fi[t1.M])];
int ansm = dep[ask(fi[t2.m], fi[t2.M])];
if (ansM > ansm)
printf("%d %d\n", tmp.M, ansM);
else
printf("%d %d\n", tmp.m, ansm);
}
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int p[3005];
int lowbit(int x) { return x & (-x); }
void update(int n) {
int i;
for (i = n; i > 0; i -= lowbit(i)) p[i] += 1;
}
int query(int n) {
int i, ret = 0;
for (i = n; i < 3005; i += lowbit(i)) ret += p[i];
return ret;
}
int main() {
int i, j, a;
int n;
scanf("%d", &n);
int sum = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a);
sum += query(a);
update(a);
}
double ans = 0;
if (sum % 2 == 0)
ans = sum / 2 * 4;
else
ans = (sum - 1) / 2 * 4 + 1;
printf("%.6f\n", ans);
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long a[10000];
long long sum = 0;
void dfs(long long x) {
if (x > 5e9) return;
a[sum++] = x;
dfs(x * 10 + 4);
dfs(x * 10 + 7);
}
long long check(long long l1, long long r1, long long l2, long long r2) {
long long l = max(l1, l2);
long long r = min(r1, r2);
long long ans = (r - l + 1);
if (ans < 0) ans = 0;
return ans;
}
int main() {
long long x1, x2, y2, y1, k;
cin >> x1 >> y1 >> x2 >> y2 >> k;
dfs(0);
sort(a, a + sum);
long long l = 1, r = k;
double ans = 0;
long long sum1 = y1 - x1 + 1;
long long sum2 = y2 - x2 + 1;
while (r <= sum) {
long long cnt1_4 = check(a[l - 1] + 1, a[l], x1, y1);
long long cnt1_7 = check(a[r], a[r + 1] - 1, x1, y1);
long long cnt2_4 = check(a[l - 1] + 1, a[l], x2, y2);
long long cnt2_7 = check(a[r], a[r + 1] - 1, x2, y2);
ans += cnt1_4 * 1.0 / sum1 * cnt2_7 * 1.0 / sum2;
ans += cnt2_4 * 1.0 / sum2 * cnt1_7 * 1.0 / sum1;
l++, r++;
}
if (k == 1)
for (int i = 1; i <= sum; i++)
if (check(a[i], a[i], x1, y1) && check(a[i], a[i], x2, y2))
ans -= 1.0 / sum1 / sum2;
printf("%.10f\n", fabs(ans));
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> adj[100001];
long long vis[100001], n;
long long child[100001];
vector<long long> vect;
void dfs(long long x, long long p) {
vis[x] = 1;
child[x] = 1;
for (long long y : adj[x]) {
if (y == p) continue;
dfs(y, x);
child[x] += child[y];
vect.push_back(child[y] * (n - child[y]));
}
}
int main() {
long long t;
cin >> t;
while (t--) {
long long x, y;
cin >> n;
for (long long i = 1; i <= n; i++) {
adj[i].clear();
}
adj[n].clear();
memset(vis, 0, sizeof(vis));
memset(child, 0, sizeof(vis));
vect.clear();
for (long long i = 1; i < n; i++) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
dfs(1, 0);
sort(vect.begin(), vect.end(), greater<long long>());
long long m;
cin >> m;
long long p[m];
for (long long i = 0; i < m; i++) {
cin >> p[i];
}
sort(p, p + m, greater<long long>());
long long ans = 0;
if (m >= n - 1) {
int i, j;
for (i = m - 1, j = n - 2; j > 0; j--, i--) {
ans = (ans % 1000000007 +
(p[i] % 1000000007 * vect[j] % 1000000007) % 1000000007) %
1000000007;
}
long long temp = 1;
for (int k = i; k >= 0; k--) {
temp = (temp % 1000000007 * p[k] % 1000000007) % 1000000007;
}
ans = (ans % 1000000007 +
(temp % 1000000007 * vect[0] % 1000000007) % 1000000007) %
1000000007;
} else {
for (int i = 0; i < n - 1; i++) {
if (i < m)
ans = (ans % 1000000007 +
(p[i] % 1000000007 * vect[i] % 1000000007) % 1000000007) %
1000000007;
else
ans = (ans % 1000000007 + vect[i] % 1000000007) % 1000000007;
}
}
ans %= 1000000007;
cout << ans << endl;
}
return 0;
}
| 5 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int read(){
int a=0,fh=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')fh=-1;c=getchar();}
while('0'<=c&&c<='9'){
a=a*10+c-48;
c=getchar();
}
return a*fh;
}
#define MN 200005
#define pii pair<int,int>
#define mp make_pair
#define x first
#define y second
#define pb push_back
#define vc vector
int T,n;
pii val[MN];
int ans[MN];
//int p[MN];
int qry(int a,int b,int c){
// assert(a!=b&&b!=c&&a!=c);
// if(p[a]>p[b])swap(a,b);
// if(p[b]>p[c])swap(b,c);
// if(p[a]>p[b])swap(a,b);
// return max(p[b]-p[a],p[c]-p[b]);
cout<<"? "<<a<<" "<<b<<" "<<c<<endl;
int v;cin>>v;
return v;
}
#define y1 hhakioi
signed main(){
ios::sync_with_stdio(0);
T=read();
while(T--){
n=read();
// for(int i=1;i<=n;++i)
// p[i]=i;
// random_shuffle(p+1,p+1+n);
// if(p[1]>p[2])for(int i=1;i<=n;++i)p[i]=n-p[i]+1;
// for(int i=1;i<=n;++i){
// cerr<<p[i]<<" ";
// }
// cerr<<endl;
int A=0,B=0;
while(1){
int a=rand()%n+1,b=rand()%n+1,c=rand()%n+1;
while(a==b||a==c||b==c)a=rand()%n+1,b=rand()%n+1,c=rand()%n+1;
if(qry(a,b,c)<=(n-4)/6){A=a,B=b;break;}
}
int mx=0,pos=0;
for(int i=1;i<=n;++i){
if(i!=A&&i!=B)val[i]=mp(qry(A,B,i),i);
else val[i]=mp(0,0);
}
sort(val+1,val+1+n);
reverse(val+1,val+1+n);
int aa=val[1].y,bb;
pii y1,y2;
if(val[2].x==val[1].x)y1=val[3],y2=val[4];
else y1=val[2],y2=val[3];
if(y1.x==y2.x){
if(qry(aa,A,y1.y)<qry(aa,A,y2.y))bb=y1.y;
else bb=y2.y;
}
else bb=y1.y;
// cerr<<"find: "<<aa<<" "<<bb<<endl;
ans[aa]=1;ans[bb]=2;
for(int i=1;i<=n;++i){
if(i==aa||i==bb)continue;
ans[i]=2+qry(aa,bb,i);
}
if(ans[1]>ans[2])
for(int i=1;i<=n;++i)ans[i]=n-ans[i]+1;
cout<<"! ";
for(int i=1;i<=n;++i)cout<<ans[i]<<" ";
cout<<endl;
int sb;cin>>sb;
}
return 0;
} | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, s;
cin >> n >> s;
if (2 * n <= s) {
cout << "YES\n";
for (long long int i = 1; i < n; i++) {
cout << "2 ";
s -= 2;
}
cout << s << "\n"
<< "1"
<< "\n";
} else
cout << "NO\n";
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
long long h[1001000], dp[1001000][2];
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%I64d", &h[i]), h[i]--;
for (int i = 1; i <= n; i++) {
dp[i][0] =
(dp[i - 1][0] + dp[i - 1][1] * min(h[i], h[i - 1]) + h[i]) % 1000000007;
dp[i][1] = (min(h[i + 1], h[i]) +
min(min(h[i], h[i - 1]), h[i + 1]) * dp[i - 1][1]) %
1000000007;
}
printf("%I64d\n", dp[n][0]);
return 0;
}
| 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l;
cin >> n >> l;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
sort(arr, arr + n);
int mx = 0;
for (int i = 0; i < n - 1; i++) mx = max(mx, arr[i + 1] - arr[i]);
int m = 2 * max(arr[0], l - arr[n - 1]);
double d = max(mx, m) / 2.0;
cout << setprecision(10) << fixed << d << endl;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string num;
cin >> num;
int size = num.size();
int h = 0;
for (int i = 0; i < size; i++) {
if (num[i] == '0') {
num.erase(i, 1);
cout << num;
return 0;
}
}
cout << num.erase(0, 1);
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 10000 + 10;
int a[maxn];
int pre[maxn], post[maxn];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
if (a[i] >= a[i - 1])
pre[i] = pre[i - 1] + 1;
else
pre[i] = 1;
}
a[n + 1] = 0;
for (int i = n; i >= 1; i--) {
if (a[i] >= a[i + 1])
post[i] = post[i + 1] + 1;
else
post[i] = 1;
}
int res = 1;
for (int i = 1; i <= n; i++) {
res = max(res, post[i] + pre[i] - 1);
}
cout << res << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
long long n;
cin >> n;
for (long long i = 0; i < n; i++) {
long long c, sum;
cin >> c >> sum;
long long div = (sum / c);
long long rem = sum % c;
long long ans = 0;
cout << (sum / c) * (sum / c) * (c - rem) +
rem * (sum / c + 1) * (sum / c + 1)
<< endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1 || n == 2)
cout << -1 << endl;
else
while (n) {
cout << n << " ";
n--;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:336777216")
using namespace std;
const double pi = atan((double)1.0) * 4;
long long MOD = (long long)1e9 + 7;
long long power(long long n, long long k) {
if (k == 0)
return 1;
else if (k == 1)
return n;
else {
if (k % 2 == 0) {
return power((n * n) % MOD, k / 2);
} else {
return (power((n * n) % MOD, k / 2) * n) % MOD;
}
}
}
long long modInv(long long n) { return power(n, MOD - 2); }
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <class T>
bool reverse_sort(T a, T b) {
return a > b;
}
long long find_fast(vector<long long> &movement, long long movetype,
long long v, long long x1, long long y1, long long x2,
long long y2) {
long long ans = LLONG_MAX;
auto b = lower_bound(movement.begin(), movement.end(), y1);
auto a = b;
if (a != movement.begin()) {
a--;
}
long long p = abs(x2 - x1);
long long temp = p;
if (movetype == 1) {
p = p / v;
if (temp % v != 0) p++;
}
if (a != movement.end()) {
ans = min(ans, abs(*a - y2) + abs(*a - y1) + p);
}
if (b != movement.end()) {
ans = min(ans, abs(*b - y2) + abs(*b - y1) + p);
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m, cl, ce, v;
cin >> n >> m >> cl >> ce >> v;
vector<long long> stairs;
vector<long long> elevator;
for (int i = 0; i < cl; i++) {
long long k = 0;
cin >> k;
stairs.push_back(k);
}
for (int i = 0; i < ce; i++) {
long long k = 0;
cin >> k;
elevator.push_back(k);
}
long long q = 0;
cin >> q;
while (q--) {
long long x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
if (x2 == x1) {
cout << abs(y1 - y2) << "\n";
continue;
}
if (y1 > y2) {
swap(x1, x2);
swap(y1, y2);
}
long long answer = LLONG_MAX;
answer = min(answer, find_fast(stairs, 0, v, x1, y1, x2, y2));
answer = min(answer, find_fast(elevator, 1, v, x1, y1, x2, y2));
cout << answer << "\n";
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500 + 10;
int Map[maxn][maxn];
char s[100000 + 10];
int ans[100000 + 10];
int R, C, x, y;
bool P(int x, int y) {
if (x >= 1 && x <= R) {
if (y >= 1 && y <= C) {
return 1;
}
}
return 0;
}
int main() {
while (~scanf("%d%d", &R, &C)) {
memset(Map, 0, sizeof Map);
scanf("%d%d", &x, &y);
Map[x][y] = 1;
ans[0] = 1;
scanf("%s", s);
int len = strlen(s);
for (int i = 0; i < len; i++) {
if (i == len - 1) {
int num = 0;
for (int i = 1; i <= R; i++) {
for (int j = 1; j <= C; j++) {
if (Map[i][j] == 0) num++;
}
}
ans[i + 1] = num;
break;
} else {
int NewX, NewY;
if (s[i] == 'U') {
NewX = x - 1;
NewY = y;
} else if (s[i] == 'D') {
NewX = x + 1;
NewY = y;
} else if (s[i] == 'L') {
NewX = x;
NewY = y - 1;
} else if (s[i] == 'R') {
NewX = x;
NewY = y + 1;
}
if (P(NewX, NewY)) {
x = NewX;
y = NewY;
if (Map[NewX][NewY] == 0) {
Map[x][y] = 1;
ans[i + 1] = 1;
} else
ans[i + 1] = 0;
} else
ans[i + 1] = 0;
}
}
for (int i = 0; i <= len; i++) {
printf("%d", ans[i]);
if (i < len)
printf(" ");
else
printf("\n");
}
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, arr[101], max_p = 1, min_p = 1, max, min;
cin >> n;
cin >> arr[1];
max = arr[1];
min = arr[1];
for (i = 2; i <= n; i++) {
cin >> arr[i];
if (arr[i] > max) {
max = arr[i];
max_p = i;
}
if (arr[i] < min) {
min = arr[i];
min_p = i;
}
}
if (max_p - 1 >= n - max_p) {
max = max_p - 1;
} else {
max = n - max_p;
}
if (min_p - 1 >= n - min_p) {
min = min_p - 1;
} else {
min = n - min_p;
}
if (max >= min) {
cout << max << endl;
} else {
cout << min << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
if (z == 0 && x == y)
printf("0\n");
else if (x > y + z)
printf("+\n");
else if (y > x + z)
printf("-\n");
else
printf("?\n");
}
int main() {
solve();
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long lgput(long long a, long long exp) {
long long rz = 1;
while (exp)
if (exp & 1)
exp ^= 1, rz = rz * 1LL * a % mod;
else
exp >>= 1, a = a * 1LL * a % mod;
return rz;
}
long long fct[200005], invfct[200005], inv[200005];
long long put2[200005];
long long cmb(long long n, long long k) {
if (n < k || k < 0 || n < 0) return 0;
return fct[n] * 1LL * invfct[k] % mod * 1LL * invfct[n - k] % mod;
}
void init() {
inv[1] = fct[0] = fct[1] = invfct[0] = invfct[1] = put2[0] = 1, put2[1] = 2;
for (long long i = 2; i <= 200000; ++i)
put2[i] = put2[i - 1] * 2LL % mod,
inv[i] = (mod - mod / i) * 1LL * inv[mod % i] % mod,
fct[i] = i * 1LL * fct[i - 1] % mod,
invfct[i] = inv[i] * 1LL * invfct[i - 1] % mod;
}
long long row[1000006][2];
long long col[1000006][2];
long long checker[2];
long long nrchecker = 2;
long long nrcol2;
long long nrcol0;
long long nrrow2;
long long nrrow0;
map<int, int> mp[1000006];
void upd(int x, int y, int t) {
if (t == -1) {
long long vlc = mp[x][y] - 1;
if (vlc == -1) {
return;
}
long long pz = x;
long long parity = (y + vlc) % 2;
row[pz][1 - parity]--;
if (row[pz][1 - parity] == 0) {
if (row[pz][parity] != 0)
--nrrow0;
else
++nrrow2;
}
pz = y;
parity = (x + vlc) % 2;
col[pz][1 - parity]--;
if (col[pz][1 - parity] == 0) {
if (col[pz][parity] != 0)
--nrcol0;
else
++nrcol2;
}
parity = (x + y + vlc) % 2;
checker[1 - parity]--;
if (checker[1 - parity] == 0) ++nrchecker;
mp[x][y] = 0;
} else {
if (mp[x][y]) upd(x, y, -1);
long long vlc = t;
mp[x][y] = 1 + vlc;
long long pz = x;
long long parity = (y + vlc) % 2;
row[pz][1 - parity]++;
if (row[pz][1 - parity] == 1) {
if (row[pz][parity] != 0)
++nrrow0;
else
--nrrow2;
}
pz = y;
parity = (x + vlc) % 2;
col[pz][1 - parity]++;
if (col[pz][1 - parity] == 1) {
if (col[pz][parity] != 0)
++nrcol0;
else
--nrcol2;
}
parity = (x + y + vlc) % 2;
checker[1 - parity]++;
if (checker[1 - parity] == 1) --nrchecker;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t, i, r, m, s, j, q, n;
init();
cin >> n >> m >> q;
nrcol2 = m;
nrrow2 = n;
for (i = 1; i <= q; ++i) {
long long x, y, t;
cin >> x >> y >> t;
upd(x, y, t);
long long ans = 0;
if (nrcol0 == 0) ans = (ans + lgput(2, nrcol2)) % mod;
if (nrrow0 == 0) ans = (ans + lgput(2, nrrow2)) % mod;
ans = (ans - nrchecker + mod) % mod;
cout << ans << '\n';
}
return 0;
}
| 8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.