malteklaes/cpp-code-code_search_net-style · Datasets at Hugging Face

func_code_string stringlengths 59 71.4k
#include <bits/stdc++.h> using namespace std; int n, a[16], b[16]; int main() { double cnt = 0; ios::sync_with_stdio(false); cin >> n; for (register int i = 0; i < n; i++) cin >> a[i]; for (register int i = 0; i < n; i++) cin >> b[i]; for (register int i = 0; i < 1e6; ++i) { register bool f = false; for (register int j = 0; !f && j < n; ++j) f \|= i % a[j] == b[j]; cnt += f; } cout.setf(ios::fixed, ios::floatfield); return (cout << setprecision(7) << cnt / 1e6 << endl) && 0; }
#include <bits/stdc++.h> using namespace std; long long n, k1, k2; long long a[1005]; long long b[1005]; void ReadData() { cin >> n >> k1 >> k2; for (long long i = 1; i <= n; i++) cin >> a[i]; for (long long i = 1; i <= n; i++) cin >> b[i]; } long long c[1005]; void process() { long long k = k1 + k2; priority_queue<long long> heap; for (long long i = 1; i <= n; i++) { c[i] = abs(a[i] - b[i]); heap.push(c[i]); } while (k--) { long long tmp = heap.top(); heap.pop(); tmp--; heap.push(abs(tmp)); } long long res = 0; while (!heap.empty()) { long long tmp = heap.top(); heap.pop(); res += tmp * tmp; } cout << res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ReadData(); process(); }
#include <bits/stdc++.h> using namespace std; const int N = 1002, M = 10002; pair<int, long long> dp[N][M]; map<long long, int> di; bool vis[N][M]; int nxt[N][M]; long long a[N], b[N], k; int T[M][N]; int n; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } int main() { scanf( %d %lld , &n, &k); for (int i = 0; i < n; ++i) { scanf( %lld , b + i); a[i] = gcd(b[i], k); } if (k == 1) return printf( %d n%ld n , 1, min_element(b, b + n) - b + 1), 0; vector<long long> divisor; for (long long i = 1; i * i <= k; ++i) if (k % i == 0) { divisor.push_back(i); divisor.push_back(k / i); } sort(divisor.begin(), divisor.end()); divisor.resize(unique(divisor.begin(), divisor.end()) - divisor.begin()); int m = divisor.size(); for (int i = 0; i < m; ++i) di[divisor[i]] = i; for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) T[i][j] = di[divisor[i] / gcd(divisor[i], a[j])]; nxt[n][0] = -1; dp[n][0] = {0, 0}; for (int i = 1; i < m; ++i) dp[n][i] = {n + 1, 0}; for (int i = 0; i < m; ++i) for (int j = n - 1; j >= 0; --j) { pair<int, long long> ans1 = dp[j + 1][i]; pair<int, long long> ans2 = dp[j + 1][T[i][j]]; ans2.first += 1; ans2.second += b[j]; if (ans1 <= ans2) { nxt[j][i] = nxt[j + 1][i]; dp[j][i] = ans1; } else { nxt[j][i] = j; dp[j][i] = ans2; } } pair<int, long long> ans = dp[0][m - 1]; if (ans.first > n) return puts( -1 ), 0; printf( %d n , ans.first); int pos = 0; int nx = m - 1; while (pos != -1) { if (nxt[pos][nx] != pos) pos = nxt[pos][nx]; else { nx = T[nx][pos]; printf( %d , pos + 1); pos += 1; } } puts( ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; int a[100005]; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); if (n == 1) { cout << -1 << endl; return 0; } bool flag = true; for (int i = 1; i < n; i++) flag = flag && (a[0] == a[i]); if (flag) { cout << 1 << endl; cout << a[0] << endl; return 0; } if (n == 2) { if ((a[0] + a[1]) % 2 == 0) cout << 3 << endl; else cout << 2 << endl; cout << 2 * a[0] - a[1] << ; if ((a[0] + a[1]) % 2 == 0) cout << (a[1] + a[0]) / 2 << ; cout << 2 * a[1] - a[0] << ; return 0; } flag = true; for (int i = 2; i < n; i++) flag = flag && (a[1] - a[0] == a[i] - a[i - 1]); if (flag) { cout << 2 << endl; cout << 2 * a[0] - a[1] << ; cout << 2 * a[n - 1] - a[n - 2] << endl; return 0; } vector<int> diff; set<int> di; for (int i = 1; i < n; i++) { diff.push_back(a[i] - a[i - 1]); di.insert(a[i] - a[i - 1]); } if (di.size() != 2) { cout << 0 << endl; return 0; } sort(diff.begin(), diff.end()); int chan = diff[n - 2]; if (chan != 2 * diff[0]) { cout << 0 << endl; return 0; } for (int i = n - 3; i >= 0; i--) { if (diff[i] == chan \|\| diff[i] != diff[0]) { cout << 0 << endl; return 0; } } for (int i = 1; i < n; i++) { if (a[i] - a[i - 1] == chan) { if ((a[i] + a[i - 1]) % 2 == 0) { cout << 1 << endl; cout << (a[i] + a[i - 1]) / 2 << endl; return 0; } else { cout << 0 << endl; return 0; } } } return 0; }
#include <bits/stdc++.h> using namespace std; vector<long int> fib(46, -1); int adv_fib(int n) { if (n == 0 \|\| n == 1) { return 1; } else if (fib[n] == -1) { return fib[n] = adv_fib(n - 1) + adv_fib(n - 2); } else { return fib[n]; } } int main() { int n, curr = 1; cin >> n; for (int i = 1; i <= n; i++) { if (adv_fib(curr) == i) { cout << O ; curr++; } else { cout << o ; } } }
#include <bits/stdc++.h> using namespace std; long long i, j, k, l, m, n, t, a[211111], b[211111], c[111111], d, s; string p[111111], q[111111]; int main() { cin >> n; for (i = 1; i <= n; i++) scanf( %I64d , &a[i]); for (i = 1; i <= n; i++) scanf( %I64d , &b[i]); i = 1; j = 1; while (i <= n) { while (a[i] != b[j] && j <= n) j++; if (j <= n) i++; else break; } if (i > n) { cout << 0; return 0; } cout << n - i + 1; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (auto &x : v) cin >> x; int mine = min_element(v.begin(), v.end()); vector<int> temp; for (int i = 0; i < n; i++) { if (v[i] == mine) temp.push_back(i); } for (int i = 0; i < temp.size() - 1; i++) temp[i] = temp[i + 1] - temp[i]; cout << min_element(temp.begin(), temp.end() - 1) << endl; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 50; int n, a[maxn], ans, maxx = 0; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; maxx = max(maxx, a[i]); } cout << maxx; return 0; }
#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const long long INFL = 1e18 + 123; const double PI = atan2(0, -1); mt19937 tw(960172); long long rnd(long long x, long long y) { static uniform_int_distribution<long long> d; return d(tw) % (y - x + 1) + x; } const int MAXV = 1e6 + 5; int real_dist[289][289]; string encoded = B:5GiO9T[SJLjS9XhW9T;XhSJLKLYO:PJD8TKLJP9PJX:KjS9XKSJTKS[GiOiSYOEOKP:XJ] hSJTHX]OiSkS;@hSZKYO:P:O9PJX:OkSKWJDWKWOHKi;VSJX]SlOkSKT;KjS9XKSJTKS; LWOYOkKYBiOkS7TKSHKjK9PiJ[OiSkSlJYO:P:S9XlJ9G7GHCGKH2S>FKXO9HjSWKYO:KZO9P: KjS7TWGiOiSEO9ThSXOiSk?WKYO:DjS9D9HFKHKYGXB8TiOkS;KjSISJHHKjK9P4KjGWGiOi? XOiSk?iK9DkS5G7GHCGKdFjSJH9LiK9T9@WKYO:DjS9D9P7GXGiKW7EKiK9O9DICWKWOH; 7HHKjK9<WGiOi?YO:<W?6?FC5CG;36eBGGXOVK9GWGi?hGXOi? WK9O9GFKHKYBXO9KIGHKjK4GWGiOUKYOUOgBGCWGF7EOIKiK9@WKYCjSFCWKWOH> WK6GFKHKDGHKjKDKWOfKY>6?FC5CG:VKjSVOGKWOYO4GWGiOUKYOUO8?FGFK7GRBGKW? XOUC5G7GHC3OFCWKWO3GFKHKTGiO3Ge>eBU>5CU6B:5CFGiFW?6GFK4KFGHK4GW?X? gBGCW7EGX?WCFCWKG>6GFKXFWGXFi:5C5GgBSBXCGKWO4GWGUKjB5G7GH34Gh> gBGCGBFCWKGB7GXJW7e>eBU>5;eFWKjF8C7GXGH>6GFKXFWGXFH?eBgB7?F65C7GDGXFU>6? FCU>iB5G7GX>gBGCGFFK8>F:D:U6T>5?D2S>fBF;6Ge>gBG>hBFCG>6GDGe: 5C5GSBFG4GfB5G73e>gBG76GF7F;S>U>g:U:EG5C7GH>6GVFW;U>6?FCC>6;e:5C5;fB5G7;5? F77GB:D:U6T>U>6GW;F?5?FGF7e>gBG;6GF;FCD:f:5?e:R>5?FBF7V6e>eBU>D;U>6?F?e: 5C5;gBG7e:f:U6B:5Gg:36T:fBd>F:e:574;fB53e>FBF:S>U>V:fBF>V:U>6?C:e:5Ce> gBeB36T6e:S>eBV>5?F7e>g:6GT6e>eBU2e>C:S>U>U:U>6?U>eB4?F:f:U6B:5?5?6GeBf> eBgBD:e:5Cf>gBfBU6e>e>D:E6T>e:fBe6B:D:U6gBU6e>eBg:S>U>f:5CD:5C5?D: 5GHCU6B6S:E:e2C:S>T>S:U>C:e:f:36T6e>e:f6e:T6e>T2C:S>f:e:f:U6e>e:36g>g:f> eBD:e:f>g:S>U>U>C:T:36T64?U6e>4?D:f>e:5C5?D:5GgB5CV:f>U>6?g6T:S>5?f:5?U> eBgBU64;B6D:U:f:D:f:U6BC5?eBgBECU>6?6;S>f23G7Gg:5GiK7?D236S:D:S:36e:E: T6T2C:U:U6e>e:g>e>D:f:S>U>S:36TBf:SBU>eBgBU6DC5?e>U>g6T:3?fBU>6?g:V2C>U6e> eF6?eBgFg:5CD:5G7Gg:5GHCgB6?eBg:5C5Ce>D:fF6?eFg:gBGC7?eFE:D23?UBf:5C5? DJ7GgBGC7K7?FGFGU>6CSFXGHC5GiOHCU636D:C6D6B6S:S2C:S:S6T>D:S:36e:D: D6T636T6E6B6S:U6T:D:U>U6e:SBU>D:T6e:B6D>T>T6e:S:3;S6D:S:36g:D:U6U6B:V6eBg: 5?e>FCf:f>D:U:S>U>E:C2S:g:D:U:d:5?e>D:h636C>D:D>e>D:U67?f:5?e>g:S>U>h:f:F: GC5GgBFGYGg:36B6T:S6D6B6U>S:D:46S>T:D:T6TBf:f:S>T6T>e6D6B64?T6e:e:f>e>D:7? g:f>e>E:T6g>f>e>U>UB46d:D:T6DCf:f>4?D:5;S>6C5CU>6K7C5Cg:5?U>5?6;U:S:ECf:5? UB5CgBg:E?S636g:e:U>f:f:SG6C5CgBFCU>6?F?e>57DG7G7?FG6PHCU6D2S>D6D:D62? U6T6e6B:D6f:D:e>7?T>E6e>T6TBD:D6B>T6BBUBf:fBg:UG6?U>U>4;S:d:TBg>e>6?h6B:f: D:eBf:S:UFg:UFU:6?6G7?6?YGg>6CT>6?U>5GU>U:SBf:SFg:7C5CGC5KV6T6d:DB5?U> 5CUFgBU>5?gJ7?gBFKg>eFTFFGXGFGgRYGg:C636D2S:S6D>T6D6B>C2d:S>e:D:4?D:T2d:D: T6V:S6D6g:D:U6gBf:f>eFg>T>T6e>S63BU:f:f>e>D?C2U>e:D:7?U>f:g:S>h:5G6? 6C5CVGg:f>E:g>e>U>V>T6T:7?U>g:3?6C5CU>8;D:TBU:UB5?U>f:HC6?6C5C7?eBgB8?g>W> HGFG7GGC;PHCU:T6c:S>U6e:g>e:C:V:3BU>eBf:DFg:f>SBU:f>D?U6e:DCU:5?eB7Cf: fBHCg>g:eBV>D67?4?5Cg>eJV:3?eBf:TGg>6CECU>6;SFHG6?6GGOHC5C5;ECfB6?E?g:e> UGg>FCUBFG7C5?gGf:S>7?4?5G6?U>fKGCFG7CUGgBGCF?eBV?gKHGFGXKWGg:C:S>e2T>S6T: E6E:e:E:U>3?B6S:S>D:e>R>C:S>U:S6T:f:U>f6e:S:36T6e:e>S:U>F6T>T>5736T6e:E: U6B6S:S>D:T>U:S6e>U>e>D:U6T>g:U>57e:T6e>e:B6D:f>T>e:e:D:U6T6BBD:S:T> e6T6T6B:DB5;D:U6e>D2S:SBD:f>CBg:5?e>6SYGg:D:D:46T:S6B>C636C>T6e>T>D:D:5; 36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2S>C2C>D:e:e:S>D?T6U>D:D:h:U:U6F:S:h:3? 6?FCf:UCU6T:46U:S>D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5?eBW>e>D:8?e> W6FGFK7C5GkK7?D6C2S6B:D:C:U:S636E6B>D:U:U6eBU6T:B>T6T:3;D:C:3?T6e63?5?eBU> 7?U:U:S:E:C2g:e>e>U>UFE6c:U:U6DCf:f>4;D:D?TBFC5GgB5K7?e>f64?U>f:5;U:S:DCf: 5;DB5CgBg:UCT6D6g:e6g>g:5?TG6C5CgBF?U>f:UCfBE;DK7GHC7GGTYGg:T6S>D2U:U:3? T6T63;C:E25?U>e:7?D:E2e>T6TFU:U:SBD:SBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5? U>eFU>e:DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e:4;SBDCgB5? eJg>gBf:5K6?U>5O7C5KfJWGHCWG7K7?D2C6T>S:56S6T:e6T>e6S:U>E6B6D:f:U>E:U:D:e: 46S6T>U:U>T>D:T6T6BBfBU>f:f:S:U>fBT6T>e>e6S:D6B6D:g:D:e:U:S:f:U>f:f:S>EC5? 6CT>f>e>gBE:T6T>g>U>f>e:f>e>D:V2C:S>T>T:S:D:D27?f:f>e>g:S>U>V6T>566C5CU>6? YGg:S6D:U:T6B:T6U>C:U>T6e6T:D6B6TBf:e:T6T6D:e6B:T6T6S6e:f:D:e>D:7?g:e>e: E6e:T:f>T6T>UBT6D:D6B6e:D2C:3?D:3?e>U>5CU>UJ7CfBg:T>U>e>6;S:S6e:T64?UBf: fBg:E?36T:D6e:U:S:f:3?e:S:U>DCU>e>F?T6473?6G7?6?eK7?D:B:S6C:C2S6T646S6T6D: e:S6D6B6U:S:C:D6B:D>C2C6T>D:T:S>e:D:T64?e:S:D:U2C:d:e:D:T6T6V6D:S6D6BBU:S: D>D2SBD:5?U>f:f>7?U>f:S>T6e>e>S636TBU:S>T6U>f:f:SFU6B6d:S:d:U:S:UFg>U>f: fBU6e>eFU>TBTF6?6C5CgRYGg:C6T6T:U:36e>e6T6e>S:d>U6e:D62?U>U:f:C:f:V:36e>g: S>U6eBf:D:eFgBU>U:5?S:SBf:U:f>T6D?S:U6e:D67?T>f:g:S>E23G6?U>5CVG6?6?U>g: eBg>V>D6e>7?T>g:e>6Cf:U>8;D2SBU6U:5?U:S:HCg>6Cf:7?eBg>V6e>W>HG6?6GGCYGg: 36B6T6S6T6B:U:S6D:46S>T>D:f:DBU6T:S>T6e:d6T6B:4?T647e:5Cf:D:7?U:U:S>E:S6g: f>eBU>TB46d>D:f:DCf:5?D;U>5;S>FG6?U>5K7?e>f64?U>g:5;U:S>DCf:5;DB5GgBf:E?S: 36g:47U>6?U:SG6C5GgBU?gBg:E?eB67DKHG6?6G7PHCU6C6e:B:T6D2d6C6B:d6C:U:e:S:S: V6B6D:D:C:3BT6D2SBD:C>BBU>U>f:D?T6S636e636d:S:U:U6e:h6C>e:S:SFU>T> DBS6TFU6gBgB6?U>8?D:T:B>T6e:SBT6T6DBU:S>C2g>g:5?eJV:T62;S>2?e>e>UJg>g>g: 5Ge:f:SJg:fFDBGCGG6?6WkK7?T6B:E:S6e:3BT:C:T>36T6dBU6T>E?D:e:S:U:S6V6T636U: 36F:7?e>6?fJg>T:T6TBD6T>T:5?U>eBE?36e>T6T>g>D:e:W>e:8?DC5CGC6?fGg:f>E:f>e: U>h:e:D:g>D:V:CCgB5GgB8;S:C>T6FBf:fBg:7?g:fB5?iB5?U>ICU>i:7GWKGG6?7?D6e:5? F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:5CE:U>fBFB5C6>F6S:S>U>D:6;fB5GR>5?3CG:S> U>g:dBU6T:f:U>e>5CE:U>VB57T6B:D:S>T>5CG>V:U>6?F6T>eBV>5?F>g6B:D:U6e6e:f>3? 6>C6T6e>e:G:T>U>V6D:f:f>eBV:e>D:U6T>fK7?T:S>e6S>T6T6T2D:S:T:U>4?S6B:S>E6S: S>36C:D>T6T6e>U>U:S>D:D:f:3;S:B6D:U6D:T>e6D6D2S:V:U:S6B:SBD:D:U>B6SBT:U>U> g:D:h:D:e6S:C2S:S>C2C6T>D:T:S6U:U6e:SFU:S:d>e:d:S:S>UF5;U:U6eBS6T6BFU6TB3> 6?FCf:5WkK7?U>U>E:e>e:SB4:D:3Bf:5?eBU>U>F?C6c:e:U6T6h>e:S>h:U6F:7?6? FCfJV6R:S6SBT6DBD:5?e>eBUCf:gBU>U>8?g:f:W>D:8?DCGCWG6?gGU6D6E6U>T>D:h>e:S: h:U:F:CC5C5Gg>I?U>DFU>FFgBgB7?I?FC5C5GiBU>U>IC5Ci:WKWOHGFKYGg:C2S6D6S636C: D:B6D:D:S:U6D6D2S>T6T6S:C2C:d636C:e:S:T6e:e:S>D:g:U6T:S:46S6U:U:S:D:DBD: S6D6D23?T6T:d6363;S>5?eBU>eFg>e>U6e:D:e:f6D6B64?T6e:D>e>U>U6D?C2C6U6T6U: U6e:CCf>e>U>5;D:T6D?T>473GgB7?gB6PHCU:S6e:S6D6T6d:D2S:e:S>T6e:D:S6g:C:T6S: C2CBD6T6S>36C>SBf:U>D:ECf:D:D:d6B:T6S>U:S:U6h:S:e:D:SBD:S63BT63FU:6?gBU>g> HCU:f>C:f:D:eBD:D6B>D6BBT6g>e>g:eJV6S:d6B>3?U>e:SFU:U>T6eFf:D:eJg>eFTFFC7? FCgRYGg:D:D:46T:S6B>C636C>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C: C2S>C2C>D:e:T:S:D?T6U>D:D:h:U:T6F:S6h:3?6?6?f:UCU6T:46U:S:D:V:S6C6g:D:E62? f>e>U>8?D:3BD:5BU>U>U>8?5?f>e>W>e:D:8?e>W6FGFG6C5C;PHCU:T6d6S>U6D:V:T6B:V: CBU>e:f:DFU6T>S>D:T:C?U6D:D?D:47cB5Cf:f>8?U:U6S>V:36g:d:f>U:SJV:3?e:f:TCU> f>D;S>4;SFFG6?6C5O7?e>e64?T>f:D?U6T:DCU:5;C>6Cg>e>gGf:S6h:375?6?U>fG6?6Cg> T?eBf:D?e>T?DKHGFG7G6PHCU6C6B:36T6D:e:C:C2d636U6e:f:S:g:S646U:S>DBT6D:DBU: S>DB5CU>f:ECU6e:D:f6D62?T>U>g:U:h63>e:f:SFg>eBUBU6eFU>FGgB6?6GHCU>T>SBf:5? eBe:D:UFg>eBT6gB7?g>eJV:S64?T>4?6?e>UJ7CgB7?gFg:5CfJgBgFeJHCGGFGHWkK7?T:D: E6d>e:SB4:D:3BT64;dBU>U>E?C6c6d:U6T6h>e:S:h:U6F:7?6?6?fJV6R:S6SBT6DBD:5?e> e>UCT6gBU>U>8?g:f:W>D:8?DCGCGC6?gGU6D6E6U>T>D:h>e:S:h:U:F:CC5C5Cg>I?U>DFU> FFgBgBg>I?FC5C5CiBU>U>IC5Ci:WKWKGGFG7?D2S:e>F>57T>e>SBe>gBR>5767D:e:5;e> 675;e:fBE6T>e>V>5?F>F2C:S>D:U>6;fB5CS>5?4CW:S:U>g:R>E6D:e:f:e:fBU:U>UB57T: S:36TBfB5CW>g>U>5?V6T>e>g>5?V>g:S:U>U6e6S:U>e>F>36S6e:3?V:S:U>g:D:e:f>e> V6e>U>U6e>eK7?D236S:D:S636d:E:T6T2C:U:T6T:S:g>e>D:U:S:U>S636SBU:S>T>e>U> U6DC5?e>U>f6T:3?f>U>f:f:V2C>T6T:SFg>e>UBT6TBD:5CgBg:fBHCgB6?eBf:fB5Ce:D: eFg>eBf:gB6?6?eFE:C23?T>e:f>e>DJ7CgB6?6Gf:f>eFU>fBSFGCGC5C7SYGg:S6B: U6S6T63Bf:S:S>36T6d>T6T>DCU:f6S>U:S:V6T636U636V:g>e>g:eJ7Cf:f:UBD:D>T:6?U> 5?D?36e>T6T>g:D:T6h>T6h:4C5C7?5CfK7?5CV:5Cf:fBh:f:D:g:D:h>DCgBFCfB8;S:C> D6VBf:fBU:7?f:f>e>8Cf:fB8?U>W:7GWG6G7?kK7?D6C2S6B:D:C6U:S636E6B>D:U: T6TBU6T:B>T6T:3;D:C63?T6e63?f>e>U>7?U:U:S:E:C2g:e>e>U>UFE6c:U:T6DCf:f>4;D: D?TB6C5CgB5K7?e>f64?U>f:5;U:S:DCf:5;DB5CgBg:UCT6T6g:e6g>f:f>TG6C5CgBF?U>f: UCf>E;DG7GGC7GFTYGg:T:3>D:f:S:4?U>D64;D2g:U>f>T67?e>E:g:e>UFf:S:TFg:eBD> 6Cg>e>VG6?5?T>5;U6CCUBfB6?U>8;DBU>f>TJ7?5CgFU:fBD:GG7C5C7GYGgBgBeFg>6CfF5? T>fJ7?5GU:6GGCgB5Oh>D:DCUBeB6Cf:fNHG6GGCgJg>6CfFU>fJfJXG7GWGHK7?D:U>eBd> U6e>U:4;eB57U>6>E:T6T>f:f>F>E:U>e>T6e>U>S:U>eBD6B6T6eBfBV:5?g:T>g6fBT6D:e> e6U>B:T6T>D6D:e:U>e:5?V:S:f:S:CC5?5Ge>e>e:fBE6e:U>T:U>fBf:D:e>D:V:S>f6T>e: C2C:D:U>D2C:S>g:S6T>g:U>U:U>5CU>U6;PHCU>D:5?D>e>T67?U>U:V6e>BBg>e>gJ7?eBD> 6?U>E?e>T647T6C?ECgBFCfBYGgB5Cf:h:f:F:DG6?6GgJV6eBg>e>F;f:D:TCg> TCfF7GWG6G7SYGgBF?4G7C5CWC5Cf:E;f:TCgJGCGK7ChGU>U:F:D?7C5C7?U?4Cf: fBgG7C5ChG6?V?UGXOHGXGFTYGg:T6S>D2U:U:3?T6T63;C:E25?U>e:7?D:E2e>T6TFU:U: SBD:SBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5?U>eFU>e:DFf:DJg>GC7GgB7CYGg:fBD> 6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e>4;SBDCgB5?eJg>gBf:fJ6?U>5O7C5KfJWGHCWG7K7?D: E:U>R:E:S>e6d6T>e6e:EB56D:D:T6T>5:E6D:f:D:S:e>e:f>S>D:C2C:T>T>E:e:57S:U: fBC2S:S:e6e:36C:D:U6T:f:D:S>f:U>T6T:S:4?e:fBS>T:S>U>46S6e>U:U>T>T6T:S: 36V6D:T:U>S:T636S6gBT6T:S:U6B:D:V6e>U6g>e>U>f:YGg:S:e>D>57T6eBTBe>eBT>U: 67B:f:D>e>675;D:5Cf6T6eBg>U>V>D:U:C2C:g>6;f:5GT>U>5CU6S>U:SBT>U6B:f:4?D: 5Cf:S>V:S>g>T6T>fFgB5CU>g>T>6?f6T6eB6?U>g>e:e>U:S6D?S:S>f>T>S>T636CCg:e>U: 3?D:f:e6B:47DCg>e>6CUGg:36C:e6T>B6D:U6E:e:E6T>e>D2S:S:U:e>S>D:S>U:B6D:f>T> e>e:S>U:C23?e>S:U>V6T>e>5;D:U6T:E6T:D2S:SBU:S>UBS6e>U>eBg>T6T>7?U>5;e>T6e> e>S6D:fBU>e>e:U>g:U:SB46S6e:e>T6e>T63Fg>U>g:UFe:f:SBD:f>BBGCg>e>6OHCU6T: eBC:E6e:S:R6D:U:T:U>E:36T>f6C:D:E2S6T6E6S:S>U:U:D:U6T6T:CBD:46S6e:S6T:U> S6S6B:5;T:D:36D:V6D6e:56D:V>e:f:f>T6D?T6T>C:D6B:D:U6B6S:U6T:D:d:e:S>U:h6C: D>T>D>D:U>T6h>e:e:S>F:U:36h:S:F25C5Cg>e>kK7?e:D:U:U6B:U6E>D:f>T6e6T:U6B: UBT:e:U6S:D:e6B:T6T6S6e:5?D:e>T:h:f6T>e:U6e>T:U>T6D:UBT6D:D6B:f:D2C:37D:C? eBU>5Cf>TJg>e>V:T:D:e:5;C:T6e:T6e:UBf:U>g:E?36T:D6e:U:S>g:3?e:S:U>D;U> T6TCU6D;3?6G7Cg>4PHCU>S:e:T>D6e:e:E:e:f:T>e>e:D2S>g>e>T>T:S:SBD6T:D>T>e> eBf:S>g:EC5?e>U>f6T>e>5?U>D:f:h:T:e:D2SBf:S:SBT6TFU>6?eB7?g>HCgB6?e>f:f: 5CT:D:DBf>eBf:gBU>6?eJV6S:e:e>4?U6eBUFgBU>U>gFf:f:eJg>DFUFgBWGFCgNHCU646D: C6D6B:S:S2C:S:S6T>D:S:36e:D:D6T636T6E6B6S:U6T:D:U>U6e:SBU>D:T6e:B6D>T>T6e: S:3;S6D:S:36g:D:U6U6B:V6eBg:5?e>FCf:f>D:U:S>U>E:C2S:g:D:U:d:5?e>D:h:36C>D: D>e>D:f:7?f:5?e>g:S>U>h:f:g:GC5GgBFCkK7?e6e:T:e:D6T>U>S:T>U>T>g:T>U6BBf:f: e>T6T>4;D6T>5?T>f:e>6?D:U>7?g:f>e>E:T:g>f>e>U6TFU>e:T>U6BCf:f>4?D:4;SBGCU> gBFK7C5Cg:5?U>5?4;U:S:ECf:5?UB5Cg:f:UCU6S:g:e:fBg:S>UG6C5Cg:ECU>5?D?eBE? UK7?FCGKGTYGg:T>D>f:U6B:5?V6D:5;T6f:D:U>D27CU>f:T6T6eFU6B:eBD6T>D:5?g:S> VGFCU>e>4;S6e:T>e>e>D:8;T>D:U>DFU:e:DBU6D>36FC7?eBGCYG7?gBU>U>U>gFU:S:SBU: SBU:5C5CU>5Oh:364;C>T>gBU6eJg>fBf:UFg:U>fBD:fFeJWGgBWK7CU6S>gB7G4ChB5CF7E? 6GF;FChJW>fBgB7:6GWBh>gBGCdB5CFGDCGG3GT:f:5C57dFhBFCW75C7;GKe:5C5GF:FCU> fBgB3?6CGCcB5GCCG6T6e>e:U64CGK4GfB5G7GR>5?FG3C7G3GV6e>eBU>D>gB6;7G3;T>U>6? eJe>5C5GS>eBgB4?FGd>T6B:D:S:HCU:e:5?F:5;U>U>C>e:f>eB5;77T6e:5;R:f65;S:e>T: U>U>VB5CE:U6B:S>T:E6f6T>eBS>e>3?66C:D:f>eBU6T6e:f>e>eBU6T:f>f:S:S>U6BBD:e> 6:E6D:f:U6D:T>U>e>E:U:C:36T64;e:f:4?F:D2S6e:4;G:D:U>g2C6T64;T>f:S>U>g:D: 5PHCf>e>e:S>f:U6e6S:S:d>U>5?e:S>eBV2S6T>D:36DBf:U6eBU>U>SBU>U>6?D?C6C2C6e: D:e>e:U6T6e>h>U>e:S>eFU>D:UBS6BFU6gBgB7?U>8;36S:S:S6S6BBT6D2SBD:D>B6g:f:5? TJg>e:3?e>3?e>eBgJ6?g:f:5Ge:S:SJg:fFDBGCWG6?FSYGg:D:D:46T:S6B>C636C>T6e>T> D:D:5;36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2C>C2C>D:e:e:S>D?T6U>D:D:h:U:U6F: C:h:3?6?FCf:UCU6T:46U:S:D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5?eBW>T> D:8?e>W6FGFK7C5G;PHCf:U:f6D>T>D:V6D6T6g:e>D>g:e:UFU6B>D:e:D:C?T>D:5; S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJg:e>g:e:E?e:S:C;U:SCUF6GFC5C5O7?D:e6R>U: S:E?T>T64;S63;DF6?gBU>gGU:U6V6477?5?g:UCeBU>U>U?g>e:fGg>V?DGHK7G7GFTYGg>e> e>S:f:U64;R:S62?U>g:5?e>e>h6C2U:U>D:DFf:U6eFU>DBSFgBgBg>UCD2T6D63;D:3;S>g: f:f:8?UB5?e>eJgBU>UFe:SJg:7G7G7CgBI?D:C>C>e:T:SFf:U6TFU>TBS67?6?6?fN7?e:C? eBCC5C5C5OhB7?6?6K5?e>eN7?6KUFXGXGGCGK7?D6D:U>R:E:S:e6d6T>e6e:EB56C:D:U6T> 5:E6D:e:D:S:e>e:f>S>D6D2S6S>T>E:e:f6S:U:fBC2C:S>e6e:36C:D:U6T:f:D:S:f:U: U6e:S64?e:fBS>T:S:U>46S6T>U:U>T>T6T:S:36V6D:T:U>S:C:36D6gBT6T:S>E6B6D:V6T> E65?eBU>e>kK7?D6C2S6B:D:C:U:S636E6B>D:U:U6eBU6T:B>T6T:3;D:C:3?T6e63?5?eBU> 7?U:U:S:E:C2g:e>e>U>UFE6c:U:U6DCf:f>4;D:D?TBFC5GgB5K7?e>f64?U>f:5;U:S:DCf: 5;DB5CgBg:UCT6D6g:e6g>g:5?TG6C5CgBF?U>f:UCfBE;DK7GHC7GGTYGg:T6S>D2U:U:3? T6T63;C:E25?U>e:7?D:E2e>T6TFU:U:SBD:CBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5? U>eFU>T:DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e:4;SBDCgB5? eJg>g>f:5K6?U>5O7C5KfJWGHCWG7OHCU:U>eBS>T6e>T:d:S>f:U>F>D:D6T>e:T:E>46T:S: U6e>T>T6T:T>U:S6D2SBU>E6e:U:D:f6T>T636S:3;U>C:D6T>E2C6T6E:T6g>f>e:U6e:DCf: eBT:S:S6T>E2S:D:D6D:U>e:D:e:C:h:S>U:D:T>T6D:36V>S6D6B:V:C2C:h:D:V6gB5?eBf: YGg:e6e:E6e:D:D:4:S6T:T>e:g6D2S6T>C6T6e6B6S:d:D:D:f>e>T6e:S:S:S6V6T2C:S>D: S:e:E:C636SBT>T6D2S64;S:S>e2C64;T>e>e>T:SFU:S:E6T636T6e636C:e:S:T6D>T:D: T6D?T6T6f:U6U6T6T6D?V>T:D:47D:C2C?D:47cBgBg>U>5PHCU:S>T:T>T6S:f6E:D:f:U:5? D:S:S6V:e>T>D2S>UBT6S:fBU:f>D:U>U:S:D?e>S:S>g6T6e>U:S:T636h:U>D:S:SFU6T> UB36e>C6gBg>e>U>8?U>U:e>D6e>TBT6B:fBU6e>D:e>f:D:eJV:C:4?T>T>e>T6TJ6?e>f: DFD:U:CBD:DFDBGCgB6?gNHCU636D:C6D6B6S:S2C:S:S6T>D:S:36e:C:D6T636T6E6B6S: U6T:D:U>U6T:SBU:D:S6e:B6D>T>T6e:S63;S6D:S:36g:D:U6U6B:V6eBg:f>e>FCU6T>D:U: S>D:E:C2S:g:D:E:d:5?e:D:h636C>D:D>e>D:T67?f:5?e:g:S>U:h:f:F:GC5CgBFCkK7? T6T:U6T:D:D:E6C6T6U:e>U:U6T6TB46D:T:S6B:3;D:D:5;S:e64?e>e>T:h6C636C:E6S:U: U>D:D:TFU:e:U6T6D?e:S:37D2C?DB5C5Cf>eJV6B6T6T6D6D23;D:364;S6d2CBU>U>f: TCT6T6V6e6g:f:f:TCfBU>U>E;U6T6TCU>E;3G7G7CgBFTYGg>T6e>T6D:f:3;D2S>e:S>T65? D:T6h6D:T6S>D2SBD6T:S>36CBSFg:f>D:UCT:D6T:d6B:T6S>g:S:U6h:S:e:D:SBD:S63Fe: 3Jg:7?6CU>g>I?D:e>D:e:D:SBD:D6B>D6BBS67?e>g:fJV6S:e6B>3?U>e:SFU:U>T6eJ5?D: eN7?eJUFFG7?FCgVkK7?U>T>E:e:e:SBT:C:TBU:f>eBU:S>D?D:e:T:U:36h:e:S6V6T:F:7? U>g:fJg>T:T6TBD6T>T>5?U6e>TCU:fBU:S>h:U>D6W>T68?DCgB7?6?gGg:f>E:f>e:S>h:e: D2g:D:V:CCg:5CfBI?T>DBD:FFg>eBU>8?5?g:eBiBf:S>ICf:i:GCWGFGFCkK7?T6T6T2S:D: 36E6C2C6U:S>U:U6T6eBD2C:S:S6S62;D:364;S:d23?e>eBU:h:D6D6B:E6B6U6T>T>D:UFU: d:U6T6D?e:e:37D:D?DB5C5Gg>eJg:S:T2d:D:U64;D:C:3?T6e63BfBU>g:UCU6D2V6e2g:f: 5?UCfBfBU>F;U>U6TCU>E;3G7GHCgB7?D2S>fBF;6Ge>gBF>hBFCG>6GDGe: fB5GSBFG4GfB5C73e>gBF76GF7F;S:U>g:U:EG5C7GG>6GVFW;U>5?FCC>6;e:fB5;fB5C775? 677GB6D:U6T>U>6GW;F?5?6GF7e>gBF;6GF;FCD:e:5?e:R>5?FBF7V6T>eBU>D;U>5?F;e: fB5;gBF7e:T6T6B:DJ7?D2C6T>S:56S6T:e6T>e6S:U>E6B6D:f:U>E:U:D:e:46S6T>U:U>T> D:T6T6BBfBU>f:f:S:U>fBT6T>e>e6S:D6B6D:g:D:e:U:S:f:U>f:f:S:EC5?6CT>f>e>gBE: T6T>g>U>f>e:f>e>D:V2C:S>T>T:S:D:D27?f:f>e>V:S:U>V6T>566C5CU>5?YGg:S6D:U: T6B:T6U>C:U>T6e6T:D6B6TBf:e:T6T6D:e6B:T6T6S6e:f:D:e:C:7?g:e>e:E6e:T:f>T6T> UBT6D:D6B6e:C2C:3;D:3?e>U>5?T>UJ7CfBg:T>U>e>6;S:S6e:T64?UBf:fBU:E?36T:D6e: U:S:U63?T:S:D:D?U:S:E?T6473?6Gg>6?eK7?D:B:S6C:C2S6T646S6T6D:e:S6C6B6U:S:C: D6B6D>C2C6T>D:T:S>T:D:T64?e:S:D:T2C:d:e:D:T6T6V6D:S6C6BBU:S:D>C2CBD:f>U>f: U>7?U>f:S>T6T>e>S636SBU:S>T6U>f:f:SFU6B6d:S:d:T:S:TFg>U>f:fBT6T:SFU:TBDB6? 6C5?gRYGg:C6T6T:U:36T>e6T6e>S:d>U6T:D62?U>U:f:C:e:V:36T>g:S>U6e>f:D:eFgBU> U:f>S:SBf:U:f>T6D?S:U6T:D67?T>f:V6S:E23C6?U>5?VG6?6?U>g:e>g>V>D6T>7?T>g:e> 6Cf:U>8;D2SBU6U:f>U:S:HCg>6Cf:h:e>U:V6T:W:GG6?6GFCYGg:36B6T6S6D6B6U:S6D: 46S>T:D:T6DBU6T:S>T6T:d6D6B64?T6e6e:f>e:D:7?U:U:S:E:S6g:f>e>U>TB46d:D: T6DCf:f>4;D:5;S>6C5?U>5K7?e>f64?U>f:5;U:S:DCf:5;DB5CgBf:E?S636g:e6U>f:U: SG6C5CgBE?U>g:E?e>57DG7G6?6G6PHCU6C6e:B:T6D2d6C6B:d6C:U:e:S:S:V6B6D:D:C: 3BT6D2SBD:C>BBU>U>f:D?T6S636d636d:S:U:U6e:h6C>e:S:SFU>T>DBS6SFU6gBgB6?U>8? D:T:B>T6T:SBT6T6DBU:S>C2g>g:5?eJV:T62;S>2?e>e>UJg>g>g:5Ge:e:SJg:fFDBGCGG6? 6WkK7?T6B:E:S6e:3BT:C:T>36T6dBU6T>D?D:e:S:U:S6V6T636U636F:7?e>g:fJg>T: T6TBD6T>T:5?U>e>D?36e>T6T>g:D:T6W>T68?DC5C7?6?fGg:f>E:f>e:U>h:e:D:g:D:V: CCgB5CfB8;S:C>D6FBf:fBU:7?f:f>e>iBf:U>ICU>i:7GWGFG6?;PHCU:D6e:S>T>T6g>T:D: V6S>T>g>D:fFg:f>S>f:U6D?T>T62?T64;DCg:5CfBHCg>f>e>V:T6g>5C5?eBgJV6d>g>D: ECf:f:D?U>TCfF7?FG6G6OHC5C6;5CgBU>F?f>e:CCf:E?UFFC5G7?gGU:U:g:4;7CU>6? UG6C5CfBVCgBU>gG6?T?UGFKHGHGFCU6eB5?F;6CU>6CE>h>FCWB5G3Ce>U>5CTB6G4CeB5? 67U>6C53fB57F;T6T>U>g:EGfB7GF>5GFBF;U>e>6?TB57e>U>57T>e>g:5?g:7GC2C:D:U:g> 6CW;6;5?gBF;T>gB57fB5;FCD:S:f:e>d:5C6>57V:D:e>e:37D:e:5?e:U>5?gB5;f:S:f:S: 3RYGg:U>eBU>T6e>TBf:S>f>U>V6e>T6T>DCU:f>T>U:S:V6e>T>56T:V>g>e>g:eJ7Cf:f: UBD:f>S>6?U>5?D?U>e>T6T>F:D6B6h>T67?5C5C7?5CfK7?5CV:5Cf:fBh:f:D:F:D:h> DCgBFCfB8;S>U>B:VBf:fBU:W6f:D:e>8Cf:fB8?U>W:7GWG6G7?kK7?e6T:U6D:C:D:U:36T: U6e:D:U:S6DBU6S:D6T6363;C:D6e6B:d64?U>e:S>7?U:S:S6E2S:D6e>T6T>DFU6T:U:S64; S6D62;D6B?TBgB5?eBfJ7?T>f6S>U:S:5;S:C2d:C23;DBf:fBU:UCU6T6E2d6g>e:U6D?T>e: D:D?U:S:UCf:E?DC7GgB7CETYGg:T6T>T:U:S:3?U6D:5;S:U:U>U>T67?T>U:e:T6TFU:S: SBD2SBD>6?g>T>VG6?U>T>4;S6e:DBf>e>U:8;S>U>U>TFU6e:DFU:DBD6GC7CfB7CYGg>gBT> g>U>fFU>T:SBU6SFU:6C5Cg>5Oh:D:4;3BeBgBf:eJg>eBf:DJg>U>fFU:SJfJWG7CWG7SYGg: S6B:U6S6T63BU:S:S>36T6d>T6T>DCU6e6S>U:S:V6T636U:36V:g>e>g>eJ7?e:f:DBD:D>D: 6?U>5?D?36e>T6T>g>D:e:h>e:h:4C5C7C5CfK7?e>V65Cf:fBh:f:D:g:D:h>DCgBFCfB8;S: C>T6VBf:fBf:7?g:fBf:8C5?gB8?U>W:7GWG7G7?;PHCU:D:f6T>T>D6V6D6T6V6e>S>g:e: UFU6B>D:e:D:C?T>D64;S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJV6e>g:e:E?e:S:C;U: SCUF6GFC5C5O7?D:e6R>U:S:E?T>U:4;S:3;DF6?gBU>gGU>U6V:477?5?g:UCeBU>U>U?g>e: fGg>V?DGHK7G7GFCU6eBeB57fBe:5?6:V>5?F>gBDCS>e>e>C>5CdBT>eBg6e:f>67gB6357D: D:e>U64Ce>gB7:fBEBF7D:f:f>D>g:S:e>e:U>fBg6e:5;gBS636S:D:U:fBF75;e:5C57S:U> 6;fB575?36T6T:S>T>e>EB53E6S:S:U>D7T:f:f:S6e>e>U>6;U>T6T>e:DRYGg:E:U>46T: S6B>C636D>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C:C2S>C2C>D:e:T:S:D? T6U>D:D:h:U:T6F:S6h:3?6?6?f:UCU6T:46U:S:D:V:S:C6g:D:E62?f>e>U>8?U:3BD:5BU> U>U>8?5?f>e>W>e:D:8?e>W6FGFG6C5C;PHCU:T6e6S>U6D:V:T6B:V:CBU>e:f:DFU6T>S>D: T:C?U6D:D?D:47cB5Cf:f>8?U:U6S>V:36g:d:f>U:SJV:3?e:f:TCU>f>D;S>4;SFFG6? 6C5O7?e>e64?T>f:D?U6T:DCU:5;C>6Cg>e>gGf:T6h:375?6?U>fG6?6Cg>T?eBf:D?e:T? DKHGFG7GVGg:S>fBg:6Ge>eBG>hBgBG>6?DGD:5Cf:TBFG4Gf:5G7;e>eBG;6?F7g2S>U:S:f: EG5C5GH>6?VF7;S>6?U>E>6;D:5Cf>f:5G7;U>F7U>e:D6B6T>g>6G7;F?U>FG6;e>eBG?6?F; gBC:f:D:eBT>U>VBg666e>T6TBE;S>6?U>D:5Cf:D:f>eBf:D:e>UFg:36T:fBd>F:e:574; fB53e>FBF:S>U>U6fBF>V:U>6?C:e:5Ce>gBeB36T6T:S>TBV>5?F7e>g:6GS6e>e>U2e>C:S> U>U:U>6?U>eB4?F:f:D6B64?e>6GdBT>eBgBD:e:5Cf>gBeBU6e:S:D:E6T>e:fBe6B:D: T6gBT6e>e>F:S>U>f:5CD:5Cf:D:e>HCU6e>fBW:5;eBU>C>e:5?d>576;U6e>6;R:f65;S>e> T:T>U>V>5?E:U6B:e>T:E6f6T>eBS>e>3?66D:D:f>d>E6T6e:f:e:eBU6e:f>g:S:S:D6BBD: e>6:E6D:f:U6D:T>U>e>E:U:D:36e:4;T:f:e>V:D2S6e:4;F:C:U>g2S6T64;U>f:S>U>f:D: eK7?eBf:5;5?D:5?T:g:5CF>eBc>S>D:5?E>fB4?S>f:f:D:f>e6T>e:5?D2S>D:5;4CT>gBU> eBF>57T:S:f:E>e2S:D:5;C:S:U>e:UBgBU6T>U:D6h:f>F7f:e:U>5?D:f>e:T>e:5?U:S6e: eBT6e>E:e:U636e:S>e:36S6eBS6D:eFU>eBU>e>6?f:DNHCU>V>fBd>V:eBf:4;fB5;f>FBF: U:S>g:fBF>V:U>U>U:e>f:e>gBeBU:36e:fBfBV>5?6;e>g:6GT6T6eB5;f>C:T:S>U:U>U>U> e>6?g>D:5?e:DC5?6GeBf>e>eBE:e:f:f>gBfBf:U6e>D:h:T>f:fBe>T6B:U:gBU6T6eBV:S: S>h:f:g:g:5GgBf:HCU6e6e:5:e6D:U>C>S:U>S>e6g2S6T6e:S:f2e6S6e>T6D:T>U>e>E: U6T6B:U:U:f6T>eBC:e:e>F6B:D:U>S>D2C6T6e:S:e>T6D:f>e:f:S>D:eBU>e>F:U:D:f: U2C:S>f:e:U:U:S>D:D23;S6T:e:E:T:D2S:3?V:S>D:f:36T64;S>f:3CU>g:fBfK7? eBeBf6fBe:e>V:V>f>V>g>DCC:e>D:U>5CdBT:e>g>e:e>6?g>6;f:e>D2S>5?5Ce>fBV:f> fB6;D:e:S>V>g:C:e>DBU:fBg>T:f>U>5CU6e:fB7?gB6;5?f:fBU>S:T>5Cf>5?f>U>f:S: SFU>T>fBf:U>f:36TFF?U>f:SBU6T>DBD:fBTF7?eB5C7SYGg:f>g:4CU>D:5?E?e:5?f> TBE2S>g:3?6?VBE:S>eBV:D:fBf:e>e:S>e:36eF6Gh:U>g>U>e:f>D:D:U6D?f>D2S:f:V6S: f:U6e:T6eB5?D:5CUGFC5?5?e:f:5?V6D:U>U:T>f:U>U>U6T>8;T6e>U:e6e>U6B:hBT:U: S6g:S6T:E2S:F:7Gg:5G7?YGg:S:e>U>U6T:e>fBD:f>T:f6U:C:e:UB4?e6U2S:D:f6S:e:U: S>e:U:D:U6B:h>7;S>f:T6e>S:U:D2S>DBT:E6C:S:f6B:S:37T:d>e>U>f:S>UJgBU>V>D:f: S>g6B:T6T6S6e:U>U6T>D:E?C:T>T6T:T>T6D23;E:U636D;U6B64;S6474?6CU>6?TGg:36C: e6T>B6D:U:E:e:E6T>e>D2S:S>U>e>S>S:S:U:B6D:f>T>e>e:S:U>D23?5?T>U>U6T>T>5?D: S:f:E6T:D2S:SBD:S>UBT6T>U>e>gBU6e>7?g>6;e:f:U>5?C:D:e>T>eBf:U>e>g:SB46S6e: e>T6e>e:3Ff:U>T6eFf:D:eBD:e>BBFC7?eBgNHCU6T:fBT>F:e:e>d:U>f:e>gBV:C:U>6;T> U>V6T:f:E:e:eBg>g>U>U:f:f:3FU>E:e:5?e:f>gBe:T:S>5;e>U:C:U>h:U:5?F:T>g>f>6? 6?D:UCf:fBT>U:S>U>V:S:e>g:f>U>4?f>eBU6h6T>TBfBU>T>gBU68C5?f>eBW>f:D:h:e> F6FGFGg:5CU6S>FCWGiFWC7GGK4KFGHKEKWCY?6CGCW7EGX?WCFCWKWB7GGKiJWKXFi> 5C5G7GRBXCGKWO4GWGUKjB5G7GH7EK7?6CGCWFFGWKGB7GXJW;e>eBgB57dFWKjF8C7GXGH> 6GFKXFWGXFH?eBgB7?F:FCGGUGXFf>6?FGFBjB6G7G8>gBGCGFFKHBF:D:f:U>ECU:eB5GF; 5G5?6?F:gB5CVB7GUGe>eB5GC>5C4GU>fBg:5?6?F;7G775;D:U>g>U24Ce>gBG>gBVFF7T:f: 5CTB7?e>eB5;gBgB77e>5;6C36D:U:D:E6fBF75;e:5C57e:f>67gB635?C6T6e>e> eB5CUFF7U:S>eBf>U;f:5?F;S:e>e>f>6;U6T6e>D2SNHCf>U>gBT>g>e>e:S:U>U>5?gFV>D: U>g6S>T>V6T6e:f>e>eB5?6?T>U6e:5?UB4:D:S:e:e:f:gBS6B:S>4?5?U>D:U>g:f:5?E:D: g>e:f:5CU6D?C6T>S>36C:D:U:S:S>f:f:D:e:S:S>U6h>U>U>gBT>D:U>g>hFe:S>eBF:36D: h:S>V65C5Gg>eB;PHC6?6?g:fBgBU>V6f:U66C5Cg>g:5?FGE:D>f>e:S>DCgBU>FC5?4; EC5C5G7?8;B:D:36g>e:g:fBU>U>6K6C5?g:5?VC5?eBE;U6TCUFFGFK7C5Oh6C2d:e:U6T6D? U>D:E?e:37DFgBgB7?fG6?g:7?6;7?6?FGgG6GgBgBW?g:f:fGgBV?DKHKYG7GHTYGg>e>e>S: f:U64;R:S62?U>g:5?e>eBh6C2U:U>D:DFf:U6eFU>DBSFgBgB7?UCD2T6D64;D:3;S>g:f:5? 8?UB5?e>eJgBU>UFe:SJg:7G7GHCgBI?D:C>C>e:e:SFf:U6TFU>TBS67?6?FCfNh>e:C? eBCC5C5GgNhB7?6?FK5?e>eN7?6KUFXGiKGCWOHCU:D:U>C:U:S:S:R6D:T:e:UBE:36D:f6C: D:E2C6T6U:S:S>f:f:D:U6T6e:DBD:46S6T:S6T:U>S6S6B:3;e:D:36D:V6T6e:56C:V:e:f: 5?T6D?T6T>C:D6B6D:E6B6S:U6T:D:d:e:S>D:h:D:D>U>D>D:D:U:hBe:e:S>F:C:36h:S: F25C5Gg>eBkK7?f:U>V:U>T>U:E:D:f:f:5;U:U6e:UBD:S:U6S:C:4?T>U:f:S:d:5?T>e:S: h:T6B:T6U6e>T6T>T6D:3Ff:U:U6e:5;S6B:37T6C?UBfB5?e>eJg:C:U:C:D6B64;C: D6e6B6d6TBf:U>D:UCU:f:U6e:g:e:U6D?U>D:D:D;U:S6TCU:E;3C7GgBgB5PHCf>e>e:S>f: U6e6S:S:d>U>5?e:S>e>V2S6T>D:36DBf:U6eBU>U>SBU>U>U>D?C6C2C6e:D:e>e:U6T6T6h> U>e:S>eFU>D:UBS6BFU6gBgBg>U>8;36S:S:S6C6BBT6D2SBD:D>B6g:f:f:TJg>e:3?e>3?e> e>eJ6?g:f:fFe:S:SJg:fFDBGCGC6?6WkK7?U>U:E:f>T:SBT:D6TBf:4Cf:U>U>D?C:e:f: S6T6h>T:S>h:e:F65?6?U>fJV:T:36eBT6SBU:U>e>T6TCf:g:U>U>8?e:f:W6D:V6BCGCgB6? gGU6T6E:U6T:D6h>D:S:h:S:F2dB5Cf:f>I?U:DFU:F>gBg>e>ICgB5Cf:i:U>U:h:S:i: WKGCGGFCkK7?T6T6T2S:D:36E6C2C6U:S>U:U6T6eBD2C:S:S6S62;D:364;S:d23?e>e>U:h: C6D6B:E6B6U6T>T>D:TFU:d:U6T6D?e:e:37D:D?DB5C5Cg>eJg:S6T2d:D:U64;D:C:3? T6e63BfBU>f:UCT6D2V6e2g:f:f>TCfBfBU>E;U>U6TCU>E;3G7GGCgBGTYGg>e>e>S:f:U64; S:S:3?U>g:5?e>e>h6C6U:U>D:DFf:U6eFU>DBSFgBgBg>UC46T6D23;D:4;S>g:f:f:8?UB5? e>eJgBU>UFe:SJg:7G7G7CgBI?C6B>C>e:S:SFf:U6TFU>DBS67?6?6?fNh>e:C? eBCC5C5CfNhB7?6?6K5?e>eN7?6KUFXGXGGCG[;PHCg>eBV:d:5?TFU:S>UBU:f:3Gg:f> TCD2d:S>g:S:h:e:S>V6D2W>HC5Cg:5Oh6T6e:3BD6T>36FCU>f:SCU:fBU:U>h: U6T6iBU6ICUGFG7?FC6LV:C:E2eBU6T>h:e:D:V6D6W>TGgB6?eBI?T>DBD:FFg>gBU>8;5?e> e>9Gg:f>ZGgB9?HKXGFKGC7?D6e:5?F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:fBE:U> fBFB5C6>F6S:S>T>D:6;fB5CR>5?3CG:S:U>g:dBU6T:f:U>e>5CE:U>UB57S6B:C:S>T>5CG> V:U>5?F6T>e>V>5?F>g6B6D:U6e6e:f>3?6>C6T6e:e:G:T>U>V6D:e:f>e>V:T>D:U6D:eK7? D6B:S6C:C2C6T646S6T6D:e:S6S6B:U:S:C:D6B6D>C2C6T>D:T:S>T>D:U64?e:S:D:T2C:d: e:D:T6T6V6D:S6S6BBU:S:D>C2CBD:fBU>g:U>7?U>f:S>T6T>e>S636SBU:S>T6U>f:f: SFE6B6d:S:d:e:S>DFg>U>f:fBT6T:SFU:UBCB7?FC5?6SYGg:D:S>D:S6S:C>T6B:T>D:U:S> T6D:3?D6T:C:D6B6V6S:C:E2C6E:g>e:U6eFg>T6T6D>36T:C:f:D:e:C?D:T>T6D:V6D6C2V: C2h:4C5?g:5?UGg:e>E6e>T6T>V6T636U636V:3?U>5?T>8;C:D>36EBf:U>D:h:e:T:S>h> T6T>8?U>W:7GFC5G6?kK7?T6T6T2S:D:36E6C2C6U:S>U:U6T6TBD2C:S:S6C62;D:364;S: d23?e>e>T:h:D6D6B6E6B6U6T>T:D:TFU:d:U6T6D?e:T:37D6C?DB5C5Cf>eJg:S:T2d:D: T64;D:C63?T6e63Bf>U>f:UCU6D2V6e2g:f:f:UCfBf>U>E;U:T6TCU>E;3G7G7CgBFTYGg:T: C>C:f:S64;T:364;D6g:U>e>T6h:S:E:U6T:DFf:S6TFU6TB3>gBg>e>UCf:e:C:4;D23?D>e> f:D:8;DBU>e>TJg:f>UFD:TBD67G7C5CgBICU>U>SBU:f>TFf:S:TFg:eBD65C6?U>5Oh>D:C? DBdB5Cf:fN7C5C6?UJU>f>TFU:UJUFXG7GGC7SYGg:C636D2S:S6S>D6D6B>C2d:S>T>D:4?D: S2d:D:T6V:S6S6g:D:E6g>g:f>eFg:S>T6T>S63BU:f:f>e:D?C2U>T>D:7?U>f:V:S:h:4C7? 6C5?VGg:U:E:g>e>U>V>T6T:7?U>V:3?6C5?U>8;D:CBU:EBfBU>f:HC6?6C5?h>e>U>8?5?W: WGFG7GFGHCU:5?gBW>g>eBg>SBU>6C4?F7g:f:e>g:d>5;g6e>U>U>eBg>F>e>E>V:C:e:S>U: 6;eB5?d:5Cc>F:T6T>U>4?F:f:e>V:S:e>T:f>eB6;D:S6B:SBU>fBG>E:U>e>V:S>f:E:e:U> g:C2C:D:5;U>6?d:E>T6S:U6e666C:D:f6T:S:5?f:f>e:U>D:U:CTYGg>e:5?e:U:f:4?T6e> 4?eBE:5?U>e:7?D:f:e>T6TFU:f:eBC:DBeF6?gBU>VGg:U>U:3;S>f2SBg>e>g:8?e>5?U> eFT>T6DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBS:CFf:7C5C7?5Oh:e>47SBDCgB5?eJE> g>e:UJ6?U>5O7C5KfJWGHCWG7WkK7?U>T>E:d:e:SBD:C:DBU:f:dBU:U>D?D2d:S:U:S6h:e: S>V6D2F:7?5?g:fJg:S6T63BD6T>365?U>e:SCU:fBU:U>h:U6T6W>T68?DCFC7?6?gGg:S: E2e>T6T>h:e:D:V6D6V:CCgB5?eBICU>DBD:FFg>gBU>8;5?e>e>iBf:U>ICfBi: GKWGFGFCLTYGg>U:4;DBf:U:h:U:S:h:TBDB5?5?UJg:SBD>U>U>TCf:U:E?D:C;3G6G6? 5CICU>e:T6h:D:V62?6?g>TNh:4C5?5?UCU>e>T?e>D?TJGKGCFGFSHCU>4;dBf>e>UCf:f:E? D:D?TBGC7CfB7Lg>e:h:C;FCFCg>gG5?gBg>eC5C5?UCf:fCUKYKGKHKWGg:eBeB57eBe:f: E6U>e>U>gBDCS:S>e>4:e>dBD:T>U:e:f:5;gBg6e:36D:T>e6d>S:U>F:U>EB53C6T6T>U>g: S:S>e>U>U>g:S:e>f>D:D:D:36V6T>53e6S6e>e:S6T:f:U>f6e:D6C2C:SBU>e>TB57T6B:S: TBD7T6e:f>B6S:SBT:f>D:f:f:U6TNHCU:U>g>d>V>T>5;4;f:5;5?UFF6T>U>e6fBF>V:S>6? U>T>5C5?5Ce:S6T6D:eBTBV>U>F;e>e:6?36e>T64;5?D6T>U>g:e>6?U6eBT:e:f:D:T6D?e> 6?dBT6eBg>E:D:5Cf>eBe:E:T:C2C:h:U:f>g>e6D:D:S:hFD:e>e:F2S>U:E6S:V:5Cf:f>e: HCU6S6e:5:e6D:T>C>S:U>S>e6g2C6T6e:S:f2e6S6e>T6D:T>U>e>E:U6T6B:D:U6f6T>eBC: e:e>F6B:D:T>S>D2C6T6e:S:e>T6D:f>e:f:S:D:eBU:e>F:U6D:f:U2C:S>f:e:U:U:S>D: C23;S6T:e:E:D:D2S:3?V:S>D:f:36T64;S>f63CU>f:fBfK7?T>e>57e>T:f:U6T:e>T>fB4? S:S>e>E6e:d>C:D:U>T:f:5?U>f:e>D:D:D:4;R:S6T:U:T>U>57D2S6e:V>f:S:S>eBD:T>U> S:SBf:U>U>U:D:h6C:e6e6B6S:S>C6T6e>T>T:S:U6T6T:CFU:e>e>e:e:S:S:SF5; U6T6eBS6B:SFU6eBD>6?6?f:fRYGg>g>eBe>T6eBU>e:S>g:U>F>T>U6e>4;e:E>46e:S>U6e> U>T6T:U>g:S:D2SFE>U6e>U:D:f6T>e:36e:3;U>C:T6T>E2C6T6F:T6h>5?e>U6e:TCT:eBe: C:T6T>E2S:D:D6D:U>4?D:e:S:h:S>f:D:T>T6D:36V>S6D6B:W>D2C:8?D:h:gB6?eBf:kK7? 5;f>V:f>T>U>E>T:f>f>5;g:U6D:fBT:f:f6S:T64?T>U>e>e>f:5?T6e:S:h:f6T>e>U:e>e> V>T6B:UFf>U:U6D:5;S:e:47T:D?fBf:5?e>eJg>e>V:U:D:D:5;C:T:d:e:f:UBf:S>U:UCU: f:f:f:g:D:U6D?V>e:C:E;U:36TCU:C;3C5GgBgBfK7?T>S>e6S>T6T6T2D:S:T:U>4?S6B:S> E6S:S>36C:D>T6T6e>U>U:S>D:D:U:3;S:B6D:U6D:T>e6D6D2S:V:U:S6B:SBD:D:U>B6SBT: U>U>g:D:h:D:e6S:C2S:S>C2C6T>D:T:S6U:U6e:SFU:S:d>e:d:S:S>TF5;U: U6eBS6T6BFU6TB3>6?FCf:5SYGg>V>g>T>g>T>e>d:U:f>5?fFV:D:U64;T>U>V6S:f:g>T> eB6?5?U:f:f:S>UFU>E:T:f>e:e>g>T:e:36D?5?U:D:U6h:e:5?F6T>V:4?6?eBf:UCf:f>T> U:S:U6V:C:e>g:e>U:e>5?D:U>8?U:UBg>U>U>U6e>8Gf>5?D:W:e>D2h:e:W6FGgB7C5C; PHCf:5?e>f>U6eBVBT:S>g>U>g:S:f:DFf>e>f:36T>E?U6e>6?T>e:S>fBU6e>8?6;S6e:V: D:f:T6e:U6BJg>f:S:f:D?D:S>47B:e6CB6Gg:5CfN7CU>e>T:S:S>D?D2S:5;C:e:S:5?g:S> gGf:S>g:e:e>6?D:UCg:U>U:C;S>T63;S:C;DGHC5G7C5PHCU:S>e:T:T6T:f:E6T:f:T>e:T: U:S:g>D:T:S6S6TBT6T:e>D:D>T>f:U>D:EC4?36T:d6S:T:S>T:S:D2h:T:T:S:SBD: 36DBD6CBT:6?gBU>g>H?U6e:D6T:36eBD6C:S>36CBS:f>e>U6eJV:S:e:S>e>e>e:SFf: U6T6TFU:D:TFU>TFTFFC7?FCg>D2S>6CGKEGiBFCG;VCGKW;FGiJiB5C7GH> GKiF8C7GWGdBFCGKDGHKDKU>5?FC574K8GWGX;FGH?XO5?6GFK7:FGfB5C7G3C7GWG3GFGTGH: e:5?e>V:EGXOEK6GFGHKdBFCGKDGHKDKh:fB5GgBC>6GF;GKD?e>gB7?eJ5? 6GFKdB5C7GCCGKcBC:S>D:f:7?D2S:e>F>57T>e>SBe>gBR>5767D:e:5;e>675;e:fBE6T>e> V>5?F>F2C:S>D:U>6;fB5CS>5?4CW:S:U>g:R>E6D:e:f:e:fBU>U>UB57T:S:36TBfB5CW>g> U>5?V6T>e>g>5?VBg:S:U>U6e6S:U>e>F>36S6e:3?V:S:U>g:D:e>g>e>V6e>U>U6T>eK7? D236S:D:S636d:E:T6T2C:U:T6T:S:g>e>D:U:S:U>S636SBU:S>T>e>U>U6DC5?e>U>f6T:3? f>U>f:f:V2C>T6T:SFg>e>UBT6TBD:5CgBg:fBHCgB6?eBf:fB5Ce:D:eFg>eBf:gB6?6?eFE: C23?T>e:f>e>DJ7CgB6?6Gf:f>eFU>fBSFGCGC5C7SYGg:S6B:U6S6T63Bf:S:S>36T6d>T6T> DCU:f6S>U:S:V6T636U636V:g>e>g:eJ7Cf:f:UBD:D>T:6?U>5?D?36e>T6T>g:D:T6h>T6h: 4C5C7?5CfK7?5CV:5Cf:fBh:f:D:g:D:h>DCgBFCfB8;S:C>D6VBf:fBU:7?f:f>e>8Cf:fB8? U>W:7GWG6G7?kK7?D6C2S6B:D:C6U:S636E6B>D:U:T6TBU6T:B>T6T:3;D:C63?T6e63?f>e> U>7?U:U:S:E:C2g:e>e>U>UFE6c:U:T6DCf:f>4;D:D?TB6C5CgB5K7?e>f64?U>f:5;U:S: DCf:5;DB5CgBg:UCT6T6g:e6g>f:f>TG6C5CgBF?U>f:UCf>E;DG7GGC7GVGg:S>e:57f>D:f> T:V:5?F>eBc>S:D:e>U>fBd>S>e:f:D:f>e6T>e:5;C2C:D:5?5CT>gBU:eBE>5;D:S:f:E> e2S:D:e:C:S:U>e:U>gBT6T>D6T67?g>F;f:f:U>5?C:U>e:T>e>5?U:S:f:SBT6e>E:e: U636S:S>e636S6eBT6D:eBU>e>T>e>g:e>DJ7?D:E:U>R:E:S>e6d6T>e6e:EB56D:D:T6T>5: E6D:e:D:S:e>e:f>S>D6C2C6T>T>E:e:f6S:U:fBC2C:S:e6e:36C:D:U6T:f:D:S:f:U:T6T: S64?e:fBS>T:S:U>46S6T>U:U>T>T6T:S:36V6D:T:U>S:D636C6gBT6T:S:E6B6D:V6T>U6f> e>U>e:YGg:S:e>D>57T6e>TBe>eBT>U:67B:e:D>e>675;D:fBf6T6e>g>U>V>D:T:C2C:g>6; f:5CT>U>5CU6S:U:SBT>U6B:e:4?D:fBf:S>U:S>f>T6T>eFgB5CU>g>T>5?f6T6e>6?U>g>e: e>U:S6D?S:S>f>T>S:T636CCg:e>U:3;C:e:e6B6474Cg>e>gBUGg:36C:e6T>B6D:T6E:e: E6T>e>C2C:S:U:e>S>D:S:U:B6D:e>T>e:e:S:D:C23?e>S:U>U6T>e>5;D:T6T:E6T:C2C: SBU:S:U>S6T>U>e>U>T6T>7?U>5;e>T6T>e>S6D:eBU>e>e:U>f:U:SB46S6e:e:T6T:S63Fg> U>f:UBT6e:SBD:e>BB6?g>e>gNHCU6T:eBC:E6e:S:R6D:U:T:U>E:36T>f6C:D:E2S6T6E6S: S>U:U:D:U6T6T:CBD:46S6T:S6T:U>S6S6B:3;T:D:36D:V6D6e:56D:V>e:f:f>T6D?T6T>C: D6B6D:U6B6S:U6T:D:d:e:S>T:h6C:D>T>D>D:U>T6h>e:e:S>F:D:36h:S:F25C5Cg>e>kK7? e:D:U:U6B:U6E>D:f>T6e6T:U6B:UBT:e:U6S:D:e6B:T6T6S6e:5?D:e:S:h:f6T>e:U6e>T: U>T6D:UBT6D:D6B:f:C2C:37D:C?eBU>5?e>TJg>e>V:T:D:e:5;C:T6e:T6e:UBf:U>U:E? 36T:D6e:U:S:U63?T:S:D:D;U:S6TCU6D;3?6GgBg>4PHCU>S:e:T>D6e:e:E:e:f:T>e>e: D2S>g>e>T>T:S:SBD6T:D>T>e>eBf:S>U:EC5?e>U>f6T>e>5?U>D:f:h:T:e:D2SBU:S: SBT6TFU>6?eBg>g>HCgB6?e>f:f:5CT:D:DBf>eBf:gBU>6?eJV6S:e:e>4?U6e>TFg>U>U: fFf:U6eJg>DFUFgBGCFCgNHCU646D:C6D6B:S:S2C:S:S6T>D:C:36e:D:D6T636S6E6B6S: U6T:D:U:U6e:SBU>D:T6T:B6D>T>T6T:S:3;S6D:C:36g:D:T6E6B6V6e>g:5?e:ECf:f>D:U: S:U>E:C2C:g:D:U:d:f>e>D:h:36C>D:D>T>D:U:7?f:f>e>V:S:D:h:e:V6FC5GgB5CkK7? e6e:T:e:D6T>U>S:T>U>T>g:T:U6BBf:f:e>T6T>4;D6T>5?T>f:e>5?D:U>7?g:f>e>E:T:g> f>e>U6TFU>e:T:U6BCf:f>4;D:4;SBFCU>gB5K7C5Cg:5?U>5?4;U:S:ECf:5?UB5Cg:f: UCU6S:g:e:f>g:S>UG6C5Cg:E?U>f:C?e>E?DK7?FC7G7?D:5GFCW? GGgBGGVB8CWGiFFKDG5CgBFGdFGKEG5GFCG;gBGGF76GF;W?f:fBgBW:VK6GHKWBFKWFW? gB5CGCdFF;5CgBF3fB5C77FC7;HKT6T>U>g>U>GGi?G?FC7GW7fB7GF76GF;WGU>e>6?5;4? FGGBF;h>U>5C57D;U>5?F;5?gBF;7GF767B6T6e:DNHCU>gB5GeBf:5Cf>4?eB6;gBG:U>U: fB5?f>VBE:f>e>f:5CfBD:f>fBU:S:U6eFgBV:5?g>U>6;eBf:D:e>4;gBS>U:fB56T:S:V>f: 6Cg>e>g:e>TG6?5Gf>e>e:fBV6e>U>E:U>gB5?U>5?T>h>eBg:S>f>T6T>D:F:T636S:h>T6T> 7?U>g:gBFCfBg:YGg:5;f>F:U:T>U>D>D:f>e:57U6T6e:U>T:e6U2S:D:e:S>U:U:S>T:f:D: S6B:g:f6S>e:T6e>S:U:C2C:DBe:E6T6S:f6B:S:d6T:3?f>U>e:S>TFg>T>V:D:D:S:f6B: T6T6S6e:U>T6T>D6D?D:f:T6T:f:T6D23;E:T6363;D6B6D?T64;3?gBU>g>4PHCU>e:f:f>D: e>e:V:U>g>e>e>D:D:e:g>fBe>S6e:fBD:e>e>T6e>U:f:U:C:EC5CT>eBf:e:U>U>T:S:D:h> e:D:D:eBD2S:UBD:U>T:6?g>T>g>HCg>g>f:U:U>fBD:S>e>T6eBU>f>e>U:eJV6T>f:D>U>U> T6SFf:S>T63FU:D:TBD6BFTFFCg>FCgNHCU6D:S>T:D2S:D>e6S>e:D:E:T:C2C:4?T:U:D:D: S:E2S:D:D6D:U>U:S:U:SFg>U6e:U>C:U:T>f:D:e:3;D:S:C2C:U:36S6V:S6g:f>e>g>e> TGg:eBU:e>T6T>V6T6D:U6D:V>4?U>5?T>h6B:T:C:U>T6T>T6g:U6T>T6h>e:U>h:D: F6gBFCgBg:kK7?e:U>V:f:S>U:E:T:f:f:5;e:U6S:fBD:S:U6S:S>4;S>U:f6e:d:5?T>e:S: h:T6B:T6U6e>T6T>T6D:3Ff:U:U6S:5;S6B:47T6D?UBfB5?e>eJg:C:U:C:D6B64?D:D6e6B: d6TBf:U>D:UCD:f:E6e:g:e>g:D?T>D:U>D;f:U6TCU:E;3C7GgBgBETYGgBf:5?f:D:5?4; U6eBf>eBD:5?D:f:h:U>f:T>U6eBD:f>e>B:TBeFg:fBU>UCf>D:f>4;S>f6e>g>e:U6h>e:f: D:eBS:C2CFe:DJg>7?6GgBg>ICU:5?U:f:D:eFU:U:SBC:SBe:7C5?g:5KV6e>f2SB4?U>5? TFD>U:S:fJ5?U>eN7?eJUFFGHCGCgVkK7?V>fBU>e:e>eBf:S>fBU>g:eBf:S>DCU:f>T>U:C: h:e>T:F6e:V>7CU>g:5K7Cf:f:UBD:f>T>6?U:5?TCU>fBf:S>W:U:36h>T68?EGgB7?FCgK7? 5CV:5Cf:eBh:f:D6V:D:h>DCg>FCfBI?T>UBC:VF6?eBU>i:5?U6eB8Cf:eBICg:8? HCWGFKGCkK7?e6T:U6D:C:D:U:36T:U6e:D:U:S6DBU6S:D6T6363;C:D6e6B:d64?U>e:S>7? U:S:S6E2S:D6e>T6T>DFU6T:U:S64;S6D62;D6B?TBgB5?eBfJ7?T>f6S>U:S:5;S:C2d:C23; DBf:fBU:UCU6T6E2d6g>e:U6D?T>e:D:E?U:S:UCf:E?DC7GgB7C5?D:5G5GF;6G5?FCG> hBFCWB7GUGeB5C5CRBFG4GfB5G775?6CG;7GG7F;U>U>5CF6EG5C7GH>6GVFW;U>6?6CSB7?e> 5C57gB6G735?F77GD:D:e>U>D:6GW;F?5?FGF3e>gBG76GF7FCD:f:f>e:dB5CVFF7V:e>e>g: U;f>6?67e:5C5;gBG;g:C2C:T6TNHCU>V>gBC:U>e:S:R6D:U:e:UBE:36T>f6C:D:E2S6T6U: S:S>f:f:D:U6T6T6DBD:46S6e:S6T:U>S6C6B64?e:D:36D:V6T6e:56D:V>e:f:f:U6D?T6T> C:D6B:D:U6B6S:U6T:D:d:T:S:T:7?D:D>U>D>D:U>D:hBe>T:S:F:T636h:S:F25C5C5?e> kK7?e6e:U:e:D:U>E>S:S>U>T>g:S6T6TBT:f:e:36e>4;D6T>5?T>f:S>e>T6T:h:f6T6eBE: D:f>T6T:D6BFU>e:S6T6D?D:e>47B:f6DB5Cf:f>eJg>e>T:f:C:f:4;D2S>5?D:f:S:f>U:S: UCU6S:g:e:e:f:U:UCg:f>U:C;S>T63;T6C;3G7C5CgBfK7?D:B:S6C:C2S6T646S6T6D:e: S6D6B6U6S:C:D6B:D>C2C6T>D:T:S>e:D:T64?T:S6D:U2C:d:e:D:T6D6V6D:S6D6BBU:S:D> D2SBD:5?U>f:f>7?D:e:S>T6T:S>S636TBU:S>S6U>f:U:SFU6B6d:S:d:U:S:UFg>U>f: UBU6e>TFU>TBTF6?6C5CgRYGg:E:U>T:T:S>e>C6S>D>T:f>T>D:D:4;B:S:T6D2S:V:S:S> V6e:U>g:f:f:TFE6C6B:S>C6T>T>e:S:S:C?T:U>D:D:h:U6T6F:36h:3?6?6?f:UCD2C:D:D: D636V:T6B:V6D6564?e>e>T:8?D:DBD:EBU>U>U>8?5?e>e>W>D:U>8?e>h:FGFG6C5C;PHC5; U>g:D:S>U:V:36e:U6e:D>g:S:DFE:S:D6e:364;C:U6e6B:37DCU>f:S>8;T:C:T6E2S: D6eBU6T>DFU6T:U:S64;S6D6B;U6RCUFgB6?eBfNh:S:f:S:U:S64;S:C2d:C237DFg:fBU> UCU6T:E2d6g>e:U6D?T>e:D:T?g:S:fGg:UCECGGgB7CECU6eB6G7?GK5C5GXB8G7GXBGCUKU> FG6?dFWKEK6?FKH75C5GX;GCW;77eBg>e>V:VKFGFKYBGChJH?eBGCgBTBG?U>FG6;6? FKH7gBW3gBS>U:S:fBU>GKH?WCgBWKG75C5GX;GCW;7GS>6?U>5?dBgBWF7;G:5Cf:f>U? eBGCg:U>FG67U>6;5?T636S:UVkK7?T:f:f>g>D:5C4;f:5Ce>4Cg:U>U:C?fBg>g:S>6?h>D: 5C7?eBg:5?6?U>fJgBV>U>FCe>eB6?U>f>T6TCe>g:U>U:8?e>6?W6eB66DCGCgB6?gG6?6? fBg:eBg>h>D:5C7?eBg:fB6Cf:fBI?U6eFg:g>gBg>e>IGgB6Cf:i:5?U:G:U:i: WKGCGGFCkK7?D6S:S:e:D2S>U>S:S>E:D>f:S>T63BU:f:e>D6e>4;D2S>5?D:f:S>g>T6T>7? f:U6eBE:D:g>e:e>U:SFE:e:S>T6CCU:f>4?D:f6BB7Cf:fB6K7?e>e:5?T>f:4;U6S>ECU:5; S>5Cg>e:UCT6B:g:d:eBf:D:TG6?5Cg>DCU>6?5;S>E;UG7C5CGGFTYGg:T:U>S>f:S64;T:S> 4;T:g>U>e>T6h6S:U>U6D:DFf:S6eFU6TBS>gBg>e>UCT:T6B:5;D64?T>e:f:D:8;TBU>e> TJg:U>UFD:SBD27G7C5CgBI?D:D>S>D:T:CFf:T6TFU6TB365?6?U>fNh>D:C?DBdB5Cf: fN7C5?6?UJU>e>eFU6eJUFXG7GGC7CU6B:f>6G4CW>5?F7E?6GF75CWFW>eBgBF:6GWBh> gBGCR>5?FG3C7G3GD:f:f>e:dFhBFCW75C7;GKe:5C5CF65CT>eBgBe>gBGCeB5GCC76T6T:S: f:4CGK4GfB5G7GS>5?FG4C7G3GV6e>e>U>4:fB576G3;S>U>f:UFe:5C5CU>eBgB4?FGS>e> T636S:7?D:5C6Gi>F?5GgBTB5?FC4CF;G?g:5CG7d>6;F?eB5CE>fBgBGBFCV>g:S>5Cf>4:6; fB5GdB5CDCG:U>U>6;4CV:f:5?V>5?5GF:5?VB77B:e>T:S>C>5CG>V:U>6?V:U>fBFB5C6> g6D:D:f>f6f>6?3CG>T6e:5?f:W>T>gBW6e:f:f>gBV>D:f>T636SGg:5G6?F?FCU>FCU>7? FGWB5G3CeBU>FCTB6GECeB6?67U>6C53fB57F;U6eBU>g6EGfB7GVB5GGBF;f>e>6?TB57e>U> F7T>e>g:5?g>7GD2S>D:U:V:6CW;6;5?gBF;U>6C57fB57FCT:S:f:5?d:5C6>57V:D:5?e: 37D:e:5?e:U>5CgB5?g:S>g:T63J7?eBhB6G4Ch>5G67E?6GF;6CWFW>g>eBW:6GWBh>gBgBe> 5C6?3C7G3Ge:D:5?6?eFhBFCG75C7;GKe:f:5Gg:6CT>f>eBe>gBgBeB5CECW:36e:f:5? 5CGK4GfB5C5GT>5?6?4C7G4GV6T6eBU>V>fB676G3;T:S>g>UFe:f:5GU>e>eB6?6?5?U6eBf> T67?D:5;5?F>5;U>gBRBe>gBdB5;77e:f:57d>675;e:5CE:U>fBFB5C6>F:S:S>f>D:6; fB5GR>5?3CG:S>U>g:dBU6T:f:U>e>5CE:U>VB57T6B:U:S>T>5CG>V:U>6?F6T>eBV>5?F> g6B:D:U6e:e:f>3?6>C6T6e>e:G:T>U>V6D:f:f>eBV>e>D:5?U>TGg:5G5G6;6G5?5CG> hB6CWB7CUGT>5CU>TBFG4Gf>5C7;5?5CG;7CG767T>U6eBg:EG5C6GG>6CVFG;T>5?eBUB7?T> 5CU>g>6G7;f>6;gBe>D2S>U>g>6GG;F?f>6Gg:e>fBF?6CF;6CD:e:S>eBfBfBVF67F:e>D: fBU;e>6?e>T:fBU>U>6?fBg:S>6?gNHCU>6C7?EGgBU>F;VC5?F;6CfFV6eB7?e>GChFV> eB5Gf>U>6G4?5C3?B:5?D:5C5K8?gB7;gB576CD:U>g:5;6CT6e>6?f:e>6?e:5?d:U>e:36e> ECFGFCECe:5?FCf:U>gBe>fB4?F:D:U6eBh>f:5;g>33S:f:S>VFC:e>e:U6e:f>T6e>U> gBU6eB6?HCU6e>5CVBg:f>5CeFU>6Cd>6;g:T>5?g>5C5;g6e>U>V:e>5?F>eBU>F6T>e:S> VBG?eB6?d:5Cc>F:T6eBU>d>F:T>e>V:S>e>e:f>TB5;D:U6B:fFfFgBWBE:f>eBW:S>f:E:e: U>g:D2S>D:5;T>fBe:E>C:S:U6e666D:D:57T:S:f>e:f:f:5?D:5CECU6B:T>57fBS:U>F:V> 5?6:fB3CS6e>eBT>5CdBT>e>g6S:U>6;fB5;57B:D:U6e:5Ce>gBF:fBEBF;D:e:5?4:f6S6e> e>T>eBg>f:f:gBS:U>D2S>g>gBF;5;f:fB5;S:U>5;fB5?6?D:S:f:S>C:e:U>5;E2S:S> DB47D:f:5CT6T>5?U>5;S>5?g:S>6K7?D:f>6GeBW>5?5;4?gB675CWFW>T>gBh6fBVBh:f>6? T>5?5G5C7CeBD6e:5?DBTBV>5?F;5?6;7GS:e>eBg65CT>T>gBg>g>FCU>fB5CV:f:f:36D?e> 6GdBT>eBgBU>e>5C5?6CeBf:T:S>U6V:fBf>6Gf:C:U>g:hFe:eB5GF:T>U>g>5CU: 5C5CU6eBHCU:5?6CW:5?fBU>C>e:5?eB5;7;U6e>F;R:f65;S>e>T:U>U>VB5CE:U6B:eBf: E6f6T>eBS>e>3?66D:D:f>eBU6T6e:f>e>eBU6e:f>g:S:S>U6BBD:e>6:E6D:f:U6D:T>U>e> E:U:D:36e>4?e:f:5?V:D2S6e>5;G:D:U>g2S6T64;U>f:S>U>6?D:fK7?5G6?F?5CU>6?U:g> 5GVB5G3Ce>T>FCE>5C4CT>g>g>U>6?5;fB5;5?D6eBU>5;4Ce>gBV>fBVBF7e:e:f>VB57e>T> 5?T>e>g>e>fB6CU:U>f>D2h:fBF75;e:fB5?T:f>5?fB5;5?f:T6T>gFf:5CU>5?f:C:e>eB5; D:e:5CS:T>eFf>5CU>5?6Cg:S:C:5GHKYOVKIKWKi? hGXOiCiKIS9GGKHKYBXO9KIGHKjKEKWKiOgKjOUO6CGCWKW7EOIKiK9@ WKYCjSFCWKWOXBiK7GGKHKUGXKjKDKWOfKj>6?FGFC7:VKjSVOGKWOYO4GWGiOUKYOUO8? FGFK7GdFHKXCYOUC6G7GXGDSFGWKWO3GFKHKTGiODGe>eBgB5Cg:T> FCWGiBWC7G7GeFFCGGEKWCY?6?FCW74CG?WC5CFGVB7G7GiJWKWBh>eB5G6CC>G? 6GFK4GFGUGX>fBgBG;EK7?6?FCWFFGFKG>6CWFG;S>eBf>e:RBFGXBh>gBGCG>gB6GWFFGGB7; T>U>6?V:FCGCUGXBf:5?FCVBjBgB7GH:f>6?VB6GGB56D:U:D:UGg>fB5GF;5G5?6?V: fB5CfB7GUGe>eB5GD:5?4GU>U>g>5?6?F?7G7;5?D:U>g>f6d>e:f>V>gBVFF7T6e:5?fB7?e> eB5?gBgB7;e>e>6?D:U>g>D:V2T>575;S:e>e:e:f:5;gBg6e>D2S6e:TBfB5CfFF;f:S> eBfBU;f:5?F?S:S>eBf:5?U:f:5CU6eRYG6CgBgBU>6C5?e>T>U>UB6?6GgBU>gB7;S>e>g: U6e:6C5?eB6?6?U>g:5?FCgFE6T:S:S>f:f>gBe:S>eBEC6?gBU>gB7?g:5?V>D:7?4?6?FGg: UC46D:T>D:36D:g>e:S>g:f:E:4?e>eBg:8CgBUBgBUBU>gB7C8G5?eB5GW>D:U>8? eBW6FGFK7C5GkK7?f:f:U6e>U>D:E6T6T6f>e>g:U6e:5C46D:e:S6B:3?U>D:5?e>e64?e> eBf:h6C636C:U:S:f:U>D:D:UFf>e:U6e:E?e:S>47D2C?DB5C5Gg>eJV6B6T6T6D6D23;D: 364;S:d2CBU>U>g:TCf:U6g:f6g:f:5?UCgBU>U>F;U6T6TCU>E;3G7GHCgBGTYG6C5?5?e:g> g:5;e:e>4CfBf:5?eB5?h6D:f:T>D:UFg>g:5CU>DBeFg>gBU>UCD:D6T63?T>f:S>g:e: U68Cf>5?eB5GU>D:UFe:SJg:7C7GgBgBI?D2S>D:e:D:SFU:U6eBD:3BS:7?5?g:fN7?5?4? eBDCfB5?eJg>g:f:fJ5?T>eN7?5KUFWGHCGC7WkK7CgBgBU>5C5?eBD>U>DB6?6CfBU>gBF?S: d>f:U6e:7C5?eB7?g:V>7?6?6?gJV2S:S6BBf:UBU>5?e>e>TC6?gBU>gB8?g:5?W>D:8? DCGCGC6?gGE636U:U>D:D:h>e:S>h:U6F:CC5C5Cf>ICgBUFgBVFgBgBgBICFC5C5CiBU>U> IC5Ci:WKWKGGFGLTYG6?6?5;fBg>U>h6f:T67CfFgB5?6?gJV:DBfBU>e>TCg>U>VCf>D; 4GFG6?6CI?C>U6D:h>T:h:4?gBg>eN7CEC5?6?gGgB5CU?e:E?DJWKGCGGFS8;T62;4?e:f: TCg:U>UCU>D;SB7G7C5C6L6?f:8?E;FCGCgB6LFC7G7CfC5?6?UCU>fCUOYKWKHKWGg:T> eB57eBe:f:E6U>e>U>gBDCS:S>eB4:e>dBD:T>U:e:f:5;gBg6e:36D:U:e6d>S:U>E:U> EB53C6T6e:U>g:S:S>e>U>U>g:S:e>f>D:D:U:36V6T>53e6S6T>e:S6T:f:U>f6e: D6D2S6SBT>e>TB57T6B:S>TBD7T6e:5?B6T:SBT:f>D:f:5?T6eRYGg:D:D:46T:S6B>C636C> T6e>T>D:D:5;36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2C>C2C>D:e:e:S>D?T6U>D:D:h: U:U6F:C:h:3?6?FCf:UCU6T:46U:S:D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5? eBW>T>D:8?e>W6FGFK7C5G;PHCf:U:f6D>T>D:V6D6T6g:e>D>g:e:UFU6B>D:e:D:C?T>D:5; S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJg:e>g:e:E?e:S:C;U:SCUF6GFC5C5O7?D:e6R>U: S:E?T>T64;S63;DF6?gBU>gGU:U6V6477?5?g:UCeBU>U>U?g>e:fGg>V?DGHK7G7GgK7?fB5? F;5?U>6?U:f:5CfB5G4?e>T>5?E:U>4?S>U:f>U>6?5;U>U:5?D:U>D:5;d>D:f>T>eBF> e6T6S:U6gB5;e>T>5?D:D:U>e>TB6?U:U>D:D:h:T:57U2S:D:e>D:f:e:D:T:e>U:S6D2SFf: 5CU>e:f:S>e:SB47D2S6eBS:C:eFf:eBU>5?g:f:UNHCf>V>gBT>g>e>e:S:U>U>5?gFV>D:U> f6S>T>V6T6e:f>e>eB5?6?T>U6e:f:UB4:D:S:e:e:f:gBS6B:S:4?5?U>D:U>g:f:5?E:D:g> e:f:f:U6D?C6T>S>36C:D:U:S:S>f:f:D:e:S:S:S67?U>U>gBT>D:U>U>hFe:S>e>F:36D:h: S>V65C5C5?e>kK7?f:5?U:5?U:U>E>e:e>fBf>7;T6e:UBT:f:5;C:e>4?U:U>6CfBf:T>e>e: f:h6f6T6eBU>T>5?U6D:D:SFfBf:T6e:E?T>eB57S:f:DB5Cf:f>eJV:e>T:U6B:f:4;D6T>5? T>f:S:U>U:S:TCf:e:6?f:e:f:U>UCh:U>U>D;S6T64;36D;3G7C5CgBfK7?T:S>e6S> T6T6T2D:S:T:U>4?S6B:S>E6S:S>36C:D>T6T6e>U>U:S>D:D:f:3;S:B6D:U6D:T>e6D6D2S: V:U:S6B:SBD:D:U>B6TBT:U>U>f:D:h:C:e6S:C2S:S>C2C6T>D:T:S6U:U6T:SFU:S:d>e:d: S:S>UF5;U:U6eBS6T6BFU6TB3>6?6Cf:5SYGg>U>fBT>f>e>e>S:T>U>f>gBU>D:U>5;S:T> U6T6e:g>e>eBg:f:U>g:f:f:UFE6D6S:S>T:f>U>e:S:S:C?f>U>D:U>h:U6e:F:D:h>4?6?6? f:UC46D:T:D:36D:V:S:S>V6T:E:4?e>e>T:8?U>UBU>UBU>U>U>8C5?e>e>W>D:D:8?e> W6FGFG6C5C;PHC6?U>g>U>eBg:V>D:5?f:5;U>g:e>UFU:S:U6e>D:5?T>U:f:S:3;ECU>f:S> 8;e6B:U6U6e>T6eBU6T:3Ff:U:U6e:5;S6B:C;U6SCUFgB6?eBfNh6D:U:C:U6B:5;C: T6e6B637TFg:f>D:UCU:f:U6e:g:e:U6D?U>D:D:T?g:S:eGg:U?DCGGgB7CETYG6C5?5?e>g> g:5;e:e>4CfB5?5?e:5?h6T:f>T>D:SFg>g:UBU>UBeFg>eBU>UCT:D6T:4?T>f>e>g:D: U68Cf>5?e:5GU>D:TFe:SJg:7C5GgBgBI?D:e>T:e:D2SFU:U6DBD:TBS:7?U>g:fN7?5?4? eBDCf:5?eJ6?g:U:fJ5?T6eN7?UJUF7GHCGC7SYGg>U>U>D:f>e:S>C:D:D>f:fBU>D:U>6;B: S:U6D2S6g>e:S>g:f:E:g:f:5?UFE6C6B6S>T6T>U>e:S:S>D?f:U>D:U>h:U6e:F:36h:3?6? FCf:UCD2C:D:D:C:36V:S6B:V6T6563?e>eBU:8?U>DBU>EBU>U>g>8C5?e>eBW>D:D:8?e> W6FGFK7C5G;PHC6?6?f:5Cg>U>V:f:e:6CfB7?f:5?eFE:U>5?T:S>DCg>U>FCfB5;4C5CU>6? 8;T:D6T>g>T>6?f>U>U6eJ6C5?f:5?TCf>eBE;T6D?DFFGgB7C5Oh:S:e:f:T:U6B?U:D:E?T> 47SBgBg:5?fG6?f:7?5;6?6?eBgG7CgBg:U?f:f:SCU>U?DKHCWG7G7?D6eB5GF;6G5?6CG> hBFCWB7GUGe>5C5GRBFG4GfB5C775?6CG;7GG7F;T>U>g>F6EG5C7GG>6GVFW;U>5?FCSB7?e> 5C57gB6G735?677GS:D:U:U>D:6GW;F?5?6GF3e>gBF76GF7FCD:e:5?e:dB5CVFF7V:e>eBf: U;f>6?F7e:fB5;gBF7f6D2S6S:UJ7?D6D:U>R:E:S:e6d6T>e6e:EB56S:D:U6T>5:E6D:e:D: S:e>e:f>S>D6D2S6S>T>E:e:f6S:U:fBC2C:S>e6e:36S:D:U6T>f:T:S:f:U:U6e:S64?e: fBS>T:S:U>46S6T>U:U>e>T6T:S:36V6D:T:U>S:C:36D6gBT6T:S>E6B6T>V6T>E:5?eBU>e> YGg:e:U>F:U:S>U:D>D:f>e:57U6T6S:U>T:e6U2S:D:e:S>U:U:S:T:f:D:S6B:g:f6S>e: T6e>S:U:C2C:DBe:E6T6S:f6B6T:d6T:3?f>U>e:S>TFg>T>V:D:D:S:f6B:T6T6S6e:U>T6T> D6D?D:f:T6T:U:S6D23;E:C6364;D6B6D?T64;3?gBU>g>eK7?T>S>e6S>T6T6T2D:S:T:U>4? S6B:S:E6S:S>36C:D>T6T6e>U>U:S>D:D:D:3;S:B6D:T6D:T>e6D6C2C6V:U:S6B:SBD:D:U> B6TBT:U>U>U:D:h:D:e6S:C2C:S>C2C6T>D:T:S6U:T6T:SFU:S:d>e:d:S:S:SF5;U: T6TBS6C6BFU6TB3>6?6?f:fRYGg:D:U:T:U:C:e>d6T6e>e:eBU6D:D:3;T>U:U6B:e:V:C:e> g:e>U6e:f:D:TFU>E:D:f>S:S>f:D:T:C2C?e:U6D:D:h:S:f:F2S:E64?6?U>f:UCf:f:T> U6S:U:V:36T>g:S>U6T>f>T6T>8;D6TBU:U:U>U:S:8CU>f>T6W6T:D6V6S6W6FG6?6C5?YGg: C2S6D6S636S:D:B6D:D:S:U6D6D2S>D6T6S:C2C:d636S:e:S:U:e:e:S:D:g:T6D:S:46S6U: U:S:D:CBD:S6D6D23?T6T:d6363;S>5?e>U>eFg:S:U6e:D:T6e6D6B64?T6e6D>e>U>T6D? C2C:U6T:U:U6T:CCf>e>U>4;D:T6D?T>473GgB6?gB6PHCU:S:e:S:T6T6e6C6S:d:T>f:e:S: S:V2S6T:D:36DBT6T6eBD:T>SBU>U>U:D?C6C2C6e6C:e:e:U6T6T:h:T>e:S:SFU>D: DBS6BFU6gBgBg>U>8;36S:S:S6S6BBT6D2SBD:C>B6g:f:f>TJV:S:3;S>3?e>e>TJg>g:f: fFe:S:SJg:fFDBGCGC6?6WkK7?U:S>U:S6e>DBT6B:U>D:U:dBU6T:C?S6T:C:U6B:V6S:D: E2C:F:7?e>U6eJV:T6S:D>36T:C:5?D:e:C?D:T>T6D:V6D6C2W>D28?DC5Cg:5?fGU6T>U6T> T6D:V6T636U636F:CCU>5?e>8;C:T>36EBf:U>D:h:e:T:S>iBU6T>ICU>i:7GGC5G6?;PHCf: U:f6T>T>D:V:D6T:g:e>U>g:D:UFU6T>T:e:D2C?T>D:3;S:47DCf:5?e>8?U:T:S:V6S:U: fBf:S>UJg:e>g:D:E?e:T6C;U:SCUF6?FC5C5O7?e>f6e>U>D:E?T>T62?T64;DF6?eBg>gGU: U6V6477?U>g:UCfBf>T>V?g>D:fGg>T?DGFK7G7GFCU:5GFCW?FCgBGCV>7? FGhFFKDC5CfBFCSB6GECeB6?6;gBGCF7gB6;F?U:fBU>V6EGfB7GVB5GGBF;f>e>6?eFF; 5CfBF7U>fBg65Cg:GGD6T>D:U>U:6CW;6;5?gBF7U>6C53fB57FCT:S:f:5?4?FGFB5;g>T>5? e:D7T:f:5;e>U>5?6C5;g:S6D2S6DRYGg>gB5GeBf:5Cf>e>eBg>gBW:U>U:fB5?e:UBE:f:e> g:5CfBE:f:fBg>e:U6eFg>U6e>U>U>6;S>f:D:e:C?gBT>U:fBF6T6S:V>U:7C5C5?g:5?UGg: eBf:e>T6T>V6e>T>56T:V>5?U>5?T>8?eBg>S>fBf:U>D:W:e:D:S6h>T6T>8?U>h:7GFC5G6? kK7?5;f>V:U>T>U>E:D:f:f:5;U:U6e:UBD:S:U6S:C:4?T>U:f:S:d:5?T>e:S:h:T6B: T6U6e>T6T>T6D:3Ff:U:U6e:5;S6B:37T6C?UBfB5?e>eJg:C:U:C:D6B64;C:D6e6B6d6TBf: U>D:UCU:f:U6e:g:f:U6D?U>D:D:D;U:S6TCU:E;3C7GgBgBETYGg>e:f>e:U:e:4;U6T>5?e> f:U>T>e:h:T>f:T6T6TFU:e:eBD6TBT>g>g>T>UCf>D:S>4;S:f:D>e>e:D68?e>U>T>eFU6D: DFD:DBT67C7CfBgBICU:U>T:U:D:TFU:S:SBD2SBD:5C5?U:5Oh:T>4;CBeBfBf:eJg>e:f: DJU>U>TFU:SJUFWG7CGC7SYGg:D:S>D:S6S:C>T6B:T>D:U:S>T6D:3?D6T:C:D6B6V6S:C: E2C:E:g>e:U6eFg:T6T6D>36T:C:f:D:e:C?D:T>T6D:V6D:C2V:C2h:4C5?g:5?UGg:S>E6e> T6T>V6T636U636V:3?U>5?T>8;C:D>36EBf:U>D:h:e:U:S:h>T6T>8?U>W:7GFC5G6?;PHCf: U>g:U>T>U:V:D:f:g:5?T>g:e:UFE:S>U:e:C:D?T>U:5;S:3;ECfB5?e>8;S:C:D6V6e> E6eBU:U>DJg:f>g:e:E?e:S:C;U6SCUF6GFC5C5Oh:36e:S:U:S6D?T>D64;S627TFg>gBU> fGU:f:V64;7?5?g:UCeBU>U>U?g:e:fGg>V?DGHK7G7GFCU:5G5GF;5G5?6?F:gB5CVB7GUGe> eB5CC>5C4GU>fBg:5?6?F;7G775;D:U>fBU24Ce>gBG>gBVFF7T:f:fBTB7?e>eB5;gBgB77e> 5;6C36D:T>D:E6fBF75;e:5C57e:f>67gB635?C6T6T>e>eB5CUFF7U:S>e>f>U;f:5?6;S:e> e>f>6;U6T6T6D2SRYGg>V>gBD:f>e:S>C:D:D>f:fBU>D:U>5;B:S:U6D2S6g>e:S>g:f:E:g: f:f:UFE6C6B6S>T6T>U>e:S:S:CCf:U>D:U>h:U6e:F:36h:3?6?6?g:UCD2C:D:D:C636g: S6B:V6T6563?e>e>e:HCU>DBU>EBU>gBU>8C5?e>e>W>D:D:8?e>W6FGFGFC5C;PHCf:f:f6e> U:D:V:T6S:g>TBg>e:f:UFE6T>e>D:S:C?U:D:E?T>47dB5Cf:f>8;T:D2S>V:C:g:e:U>U: SJg>4?e:f:UCU>e>D;S64;3FFG6?6C5Oh:S:d6e:S:T6C?U6D:D?D:47B>gBg>e>fGg:T6h: 475?6?g>gG6?gBg>T?e:f:D?D:T?DKHGFG7G6PHCU:S:S:B:T6D2d6C6B6d:D:f:e:S:S: V6B6D:D:C63BT6D2SBD:D>BBU>U>U:D?D6S636e636d:S:U:T6T:h:D>e:S:SFU>T: DBS6DFU6gBgBg>U>8?D:S:B>T6T:SBT6D6CBU:S>C2g>f:f>eJg:S62;S>2?e>e>eJg>g>f: fFe:U:SJg:fFDBGCGC6?6K7?T>gB7C4ChBfBF7E?6?F;FCgJW:fBgBU:6GWBh> eBGCeBfBFGDCFG3?S:f:U>5?dFhBgBW75C5;GCD:5Cf:f:FCU:fBgB5?5CGCe:5Gd>U6T6D:e: 5;4CGC4Gf:5G7CT>U>FG4C5G3?66e>T6T>V>g>6;7C37T>U>e>gJT>5C5?U6eBg>T:e>f>e> T6T:S67?D6e:5?F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:5CE:U>fBFB5C6>F6T:S>U>D:6; fB5GR>5?3CG:S>U>f:dBU6T:f:U>e>5CE:U>VB57T6B:D:e>D>5CG>V:U>6?F6T>eBV>5?F> g6B:D:T6e6e:f>3?6>C:T6e>e:G:e>U>V:D:f:f>eBV:e>D:T6T>TGg:eB5CF;5Cf>6?F:f> 5CUB6GDCe>eB5CD:5?4CT>U>g:f>6?F;gB675;D:U>U>f6d>e:f>F>fBFBF7T6e:5?UB6;e> eB5?U>fBg:e>e>6?D:D:D:D:V2T>575;S:e>e:T:f:5;fBf6e>D2S6e:TBe>5CUB57U:S>e> eBD7T:f:5?S:S>eBf:5?U:f:f:T6TNHCfB7C5G5Cf:5Gg:5?eB7;gBGBU>g:5Cf:5?VBE:5? eBe:5CgBd:f>eBf:S>U6eBTBg:5Cg6U>63fBS>D:5?e:gBS>f:fBT6T:f:U>f:6Cg:S:D2S:D? d>5G4?S>f:fBT6e>U>S:U>eBf:36e:S>V>eB67U>d:T6T>D:EBB6T:S>F:T6T>h>U>6?U>f:S> T6YGg>F?6CW>6?fBgBTBf>6C5CF;7;f:U>6?d>6;6;e>f:f>fBgBUB5CV>g:S6e>e>V:6; fB5Ce>5C3CG:T:S>gB5CV:f:U>g>e>5?f:f>5C6?T6e:S:SFU>5CG>V:U>U>g:T>f>T>5?V>g> T6B:U:E?f>6?4?V>U6D:f:5;G:T>T>67T>D:E?f>4?e>eBU>U>TGg:eBeB57eBe:f:E6U>e>U> gBDCS:S>eB4:e>dBD:T>U:e:f:5;gBg6e:36D:U>e6d>S:U>F:U>EB53C6T6e>U>g:S:S>e>U> U>g:S:e>f>D:D:U:36V6T>53e6S6e>e:S6T:f:U>f6e:D6D2S:SBU>e>TB57T6B:S>TBD7T6e: 5?B6T:SBT:f>D:f:5?U6eNHCfBhB7CeBhBfB5;4?g>6?FCgJW:U>g:f6fBVBh:e>6? fBfB5GECFCe>T6e:S>gBTBV>f>6;5?5;7CC:e>D:5?FCU:U>g:6?5?FCU:fBf>f:f:S>U6D?e> 6CdBT:e>g:U>T>5C5?5Ce>U:e:36T>7?g>g>7Ce:D:U6e>hJT>eBU>F6e>U6V:f>g:5CU>6?e> kK7?5?FCUB6?g:5GfFf>eB5Cg>7;S>6?UB4C5;6;D:fB6?f:5ChBfBU>D:e>T6eBh>G?e:5?f> U>4?E2S:f:SF5Cg:S>5?5?T>eBf:S>U:T>fBU6e>TJgBgBUBE:S>eB5;T6e>g>T>U>e6e:U6B: UCf>eB5?U>S:f:D:E?W6D:U>47B:e:e6S:4;5C7?eBg>eK7?T>eB57f>e:f>V:V:f>V>fB4?S: f>e>U>U>d>S:e:f>T:f>5;U>U:f:e:D:D:5?5CD:f>T:e>E>e:C:S:U6V>f:S:T>e>D:D:U>T: T>f>f:U>D:f>7;g:57U2S:D:5?C:T>e:D:T>e>T:S:D2SFU:e>f>e:U:S:S:SB47D2S6eBD6C: eBT:eBeB5?g:5CgJ7?D6D:U>R:E:S:e6d6T>e6e:EB56S:D:U6T>5:E6D:f:D:S:e>e:f>S>D: D2S:S>T>E:e:f6S:U:fBC2S:S>e6e:36S:D:U6T:f:T:S>f:U>U6e:S>6?e:fBS>S:S:U> 46S6e>U:U>e>T6T:S:36V6D:T:U>S:S:36T6gBT6S:S>U6B:U>V6e>E:6?eBU>FCYGg:e:5?F> 5;U>fBT>e>g>eB5;77T:f:5?T>g65;e:eBf:U>fBgB5CV>g:e:S>U6g6f:U>fBT>5?5CW:C:U> gBeBU6T:f:5?e>5Cf:U:5Cf>5?eBU6eFV:e>V>V6T:f:f6T>T>6?5?f:f>T>U>U6B?e:f>5?V> U:U6e>DCh>T>U>6;D6e:E?T>6;4GgB7?eBW6B: 5GGKiCXOFGHKiFIKiKjFXOgOFCGKWO4KiOVOGKWKY;FGHKi?XOi?iC5C7GHCG> hOWKYOjFXO8O9D7GWGiKdFXCFCGKW;GKWKY;WGX?YOe>gB7?6GSBXO9DiGWGXOi;FGHKi?XOi? iKgBFCWGF34GWGiJi?8?6GFK77gC7GWGi;FCGKW;HKi7F;e:5?eBgBU6B:f>6G4CW>5?67E? 6GF75CWFW>e>gBG:6GWBh>gBFCR>5?6G3C7G4GD:e:5?e:eFhBFCG75C7;GKf:fB5GF65CT>e> gBe>gBFC3C5CCC76S:f:S>f:5CGK4G5C5C7GS>5?6G4C7GDGV6T>5CU>4:fB576G4;S:U>g: UFf:fB5Ge>e>6G4?6GS>T:S:36T6HCU6B6S:E:e2S:S:T>S>U>C:e:f636S:f>e:57e:T6T> U2S:S:f:f:U>U6T:S:36g>g:f>e>D:f:fBV:S:U>U>C:T636S:5?T6T>f>U>f>e:f>e>D: eFgB5CV:f>U>5?g6T:S:5?f:fBg>e>U>U64;B:D:U>U>D:T6T6BCf>e>U>5;D:e>6;S: f23CgBg:fBfK7?D:S6e:T:36T:d:E6e:U:S>S:T636S:g>T>T:S:S6T>36T:S:S:S>f>T6T> D6DC5?T>U>e6S>T:f>U:S:f:V:S6T636S>D6B6TBT6TBU>f:fBU:f:HCg>6?T:f:U>5CD:D:S> T:SBf:g>e>g:eFE2S:T6T>f:D:e:CBU:D:T6TFf:D:eFU:SBCB5C7?5CUNHCU646D:C6D6B:T: S2C:S:S6T>D:C636d:D:D6T636S6E6B6T:U6T>T:U:T6T:SBU>D:T6T:B6D>T>T6T:S:3;S6D: C636g:D:T6E6B6V6e>f:f>e:ECf:f>D:U:S:U>E:C2C:g:D:U:d:f>e>D:h:36S>D:T>T:D:T: 7?f:f>e>V:S:D:h:T:V66C5CgB5?kK7?D6S:S:e:D2S:U>S:S>E:D>f:S:T63Bf:f:e>D6T>4; D2S:5?D:f:T>f>T6T>7?g:f:e>E:D:g>e:e>U:SFE:e:S:T6CCU:f>4;C:e6BB6Cf: fB5K7C5Cf:5?T>5?5;U6S:ECU:5?T>5Cg>e:UCT6B:g:d:e>f:D:TG6?5Cg>D?T>f:4;S:D; DG7C5C7GgK7?D236T:C:S636d:D:S6T2S:U>T6T:S6g:S:D:U:S:D>S636SBU:S>S>e>U> T6DCf:e:D:e6D:3?e>U>f:U:V2S>T6T:SFg>e>UBT6TBD:5CgBf:fBHCU>f>SBf:f>eBe:D: TFg>eBT6gB6?g>eFE:C23?T>d:f>e:DJ7CgB6?gFf:f>eFU>fBSFGC7C5C7SYGg:C6S>46T: S6B>C636D>C6e:T>D:D:4;36S6T6D6D2V:S6B:V6D656g:f:f>TFU:C:C2C>C2C>D:e:e:S>D? C6U>D:D:h:U:U6F:C:h:3?6?6Cf:UCU6T:46U:S:D:V:S:S6g:D:E62?5?eBU>8;T:3BD:5BU> U>f:8?5?5?eBW>T>D:8?e>W6FGFG7C5C7?D:5?gBWB6?eB6?dFfB7G4?F76;f>e>6;4CF;6;5? gBF>eB6?6>5?FBW:D:e>eBU>G?5GFCd>FC3CW>e:fBg:4?F:f>e>F:e:fBU>gBUFF736S:T> UBfB6GXBV>gB5CW:eB5?F>5?VB7;S6T>f:f6U>6Cc>FBT:S:f:U6V:S:U>g>U>e>gB5?V>U6T> D6T62PHCU>e:5?e:D:f:4?U6e>f>eBD:f:D:e:7?T>f:e>T6TBD:f:e>B:TBeBf:fBU:UG6?U> U>4;S>f6eBg>e>g:h>e:f:D:eBS:C2CFf:DFg>6?6Gg>6?YGg>6CT>6?U>5GU>U:SBS:SFf: 7C5C7?5KV6e>e2SB4?U>5?TFD>U:S:UJ6?U>5Kg>eFTFFGHCFGgRYGg:E:T>D:S6S:S>T6B:T> D:U:S>T6D:3?D6T:C:D6B6V6S:C:E2S:E:g>e:U6eFg>T6T6D>36T:C:f:D:e:C?D:T>T6D: V6D6C2V:C2h:4C5?g:5?UGg:e>E6e>T6T>V6T636U636V:3?U>5?T>8?D:D>36EBf:U>D:h:e: T:S:h>T6T>8?U>h:7GFC5G6?;PHCU:D:e:T>T6T6g>D:S>V6T>T>e>e:DFg:e>T:U:D:D? T6T64;364;dBgBf:eBHCg>e:e:V6D:U:3?f:f>TJV6e>e>e:D?D:T:C?T:3;CF7G6? 5G6OHCfB5;eBf>e>E?e:T64?D6D?TB6?6Cf>gGU:S:V62;5C5?U:UCf:f>U:SCf>e>E?T6T? UGHG6GHGFCU6eBeB57fBe:5?6:V>5?F>gBDCS>e>e>C>5CdBT>e>g6e:f>67gB6357T:D:T> U64Ce>gB6:fBEBF7D:e:f>D>g:S:e>e:U>fBg6e:f:gBC636C:U>U:fBF75;e:fB57S:U>5; fB575?36S6T:S>T>e>EB53E6T:S:T>D7T>f:f:T6T>e>U>5;U:T6T:T6DRYGg:E:U>46T:S6B> C636D>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C:C2C>C2C>D:e:T:S:D?T6U> D:D:h:U:T6F:C6h:3?6?6?f:UCU6T:46U:S:D:V:S:C6g:D:E62?f>e>U>8?U:3BD:5BU>U>U> 8?5?f>e>W>T:D:8?e>W6FGFG6C5CHCU6e>5CUBF;f:5CdF5C5GdBg:G;S>5?U:4CG;F?U>6GV: f:5CWBgBGB56T>T6T>U>G?6?FGdBgBDGV6e>g>e>dBV:S>5?f>U>6GV>eBF>e:T:C2C: eBfBFGVBh>eBFCV:f:5ChBgBWB57S:U:S:5;e>eB4CEBB:e:D:4?W6e>g>e:T>5?U:S:f:f>U: S:U>DCU6B:T>57fBS:U>E:V>5?6:fB3CT6T>e>D>5CdBT>e>g6S:U>5;fB5757B6T>T6e:4Ce> gBF:fBUBF7D:e:f>4:f6T6T>e>e>e>g:e:f:gBS:D:C2C:g:fBF75;e:fB5;S:U>5?fB5;5?D: T6T:S>C:e:U>57E2C:e:DB5;D:e>g>S:f>e>U>5;S>f:U:S:UJ7?D:f>5GT>V:5?e6d:U>g6f> FBV>D:fBV2T>E>V6e:f:T:e>eBe>g>S>D2S:f>T>C>E:e:f6e:f6gBB:S:S>e6f>C:D:U>U:U: 5?D:U>fBU6T6T:C23;S:fBR>C:S:U>D:S:e>e:f>S>T:S6B:S:V:T>U:fBT:36D:U:VBS6S> eB56T>D:V>e>U6e>e>U:S:YGg:5?U>V>g:S>g:TBU>6Cd:53f6e:S>g>d>5;g6e>U>U:S>f:E: e:U>g:36e>e>V:6;eB5?e:5Cd>F:T6T>g>d:56T:S>V6T6T>e:U>4C5?D:e:S:CFU>fBG>U:U> e>g:S>f:U:f:U>g>T6D:U:5;D:f>S:U>D6B:f:e:E6B6T>57D:e:E?e:5?e:fBU>U:dK7?eBe> 57fBT:5?U:V>5?V>fB3CS>U6eBU>5CdBT>e>e>T:f>U:fB5;5?T6B:U>6?5Ce>gBV:fBUBF;D: D:5?V>f6S:U6e>T>e>e>f:fBgBf:S>U:U:7?gBF;5?f:f:5?S:U>U>fB5?6?U>D:f:SFU:e>U> 5;f:D2S>TB5;D:D:5CT6T:5GU>UBfBU>6?5?UJ7?D:E:U>R:E:S>e6d6T>e6e:EB56T>D:U6T> 5:E6D:e:D:S:e>e:f>S>D6D2S6e>T>E:e:f6S:U:fBC2C:S>e6e:36S:D:U6T>f:T:S:f:U: U6e:S64?e:fBS>T:S:U>46S6T>U:U>e>T6T:S:36V6D:T:U>S:D:36D6gBT6T:S>E6B6T>V6T> U:5?eBU>e>YGg:5;5?E>5;U:fBTBe>fBeBf:77S>g:S>e>675;T:fBf:U:fBgBfBV>U:e: 36eBg>6;f>5CT>f>5CV:S:U6eBeBU6S>f:3?T>6Cf>U>f>e>5?D:U>eFgB5CV>g>U>5?e6T:e> 6?f>gBg>e>U6T6D?e:e>5?U>e:U6B:DCh>e>U64;D:e>4;S:5;5Gg:5?gB6PHCU>fBU:6?e:S> g>h:U>g>f:4?36eBU6gBgB4?S6e:5CT:S>5?U:f:U6e:U6B:ECFGU>eBf>e:U>f:S:S>D:h>f: 36T>UBD6e>U>T:U:D:5?g:S>g>HC7?g>g:U>U>gBD:S>e>T:e>f>e>e>D:eJV:D:f>T:E:f> D2SF5;T:T6DBD6D:e>36SBSFFCU>FCgNHCU6T:f>e>D:U:f>5;S>f:T>E>T6S:f>4;g:E>46T: S>E6T:U>T6e:U>T:S:D2SFfFV6e>U:D:f6T>T:36e:3;T>C6S6T>E2S:T6F:U6f:f>e>U6e> TC5?eBe:S>U6eBE2S:D:D6D:U>e>D:e:S>h6S:e:D:T:T:D:36V>S:C6B:W:D2C:V6D:F:gB6? eBg:HCU6B6S:E:e2S:S:T>S>U>C:e:f636S:f>e:57e6T6T>U2S:S:f:e:U>U6T:S:36g>g:e> e>D:f:e>V:S6T>U>C:T636S:5;S6T>e:U>e>e:f>e>D:fFgBfBV:U>U>e>g6S:S:f:e:f>g>e: U>U64;B:D:U:U>D:T6T6B?U>T:D:5?D:S:5;S:f23CgBg:5Cf:S> FKWGiCXK7GXKhFIGiK9KWOUKFG7GWK4KXOVKFKWGX?7GXKW;GKW?iC6?6G7GH> hOGKYOiFWOiJiC7GFGXG4KW?FG7GW76GFGH;WGH?YOf:fBgB7CTBXK9DXCWGHKi;6GHKW;GKW? iKgB5CGCF7ECWKXFW?8CgBFGF3U?gBFCW7FC7GW;HKW;G;S:f:5?UJ7?eB7GFK5G6?FG6; EC5GG?7GX>gBg>6Gg:6ChFV>6C5C4?FG6GS>6C4Gf:e>g:5CfFh>FC7;gBG75Ge>U>5Cf> 7GeBg>6GD:f>e>fB6?EGW:S:U6e:EC5CFK4CeB5?6Gf:5CgBT>gB5Gg:D:e>eBVB5G77eB4?U: fBU>5>S:D:e>V>f:fB6CgB5?U>5?T>U6;PHC5?gB7?g>eBg>7?U>6?6?F?eBg>e>gJ7?eBg>6? U>E?eBg>67e>D?FCgBFCfBYGgB5Cf:h:5CF:EG6?6GgJ6?gBg>e>F;f:D:TCg> TG6G7GWG6G7SYGgBF?4G7C5CWC5Cf:E;f:TCgJGCGK7ChGU>6?F:E?7C5C7?U?2Cf: fBfG7C5ChG6?V?UGXOHGXGVGg:5G5CF;5?f>6?F:g:5CVB5G4?e>eB5?D>fB4?S>f:f:U>6? 57U>g65;D:U>D:f:4CT>gBE>eB6>57T:S:f:UB57e>T>5;D:U>U:e>U>6CT6D:36D:g:f> F7f6e:U>5;D:f>e6T>e:5?D6B6T6eBf:5CU>e6U:C:e:S>33S:T6T>S:D:eBf>e>U>e:U6e: UNHCU>gB5C4Cg:fBg:E?5?F;gBFBV:f:fBf:6CWBV>eB5Cf:fBgBe>eB4?S:S:U:5CfFh>gB7; fB576?D:U>f:5;gBS:f:fBU:S>5?f:5?e>f>e:D6e:DC5CFC4Ce:5?6CU:U>gBe>eB5?V:D: T6T>h>e>6;f:47T6T>T>VB36T>T6V6e:f>U:D:g>gBf:eBf:HCU6e:U>F>f:S>f:TBT>gBd: 53f6T:S:f>e>57f6e:U>U:S>f:E:e:U>V636S:U>g:6;eB5?T:5?d>V:S6T>U>d:56T:S: U6T6T>e>U>eB5;D:e:D:DFg>fBW>E:U>e>g6S>e:U:e:f>g>T6T>D64;D:f>S:U>D6B6T:e: U6B6T>4;D:e>6?e:f:e:fBf:f:dK7?eB5?F;5CU>6?U:f>5CUB5GdBe>T>5CE:U>4?T>U>g>U> 6?5;eBU:5?D6T>U>5;d>D:f>T>eBF>e6T6e:U6VB57e>T>5?S>D:f>e>eB6?U:U>D:D:h:T: 57U2S:D:e>D:f:e:D:U:e>f:T6D2SFf:5CU:e>f:C:e:SBe:D2S:fBS:S>eFf:5CU>5?g:f: URYGgB7C5G5Cf:5Gg>5?eB7;gBG:U>g:5C5;5?VBE:5?eBf:5CgBD:f>fBg:S>U6eFUBg:5Cg> U>6;eBe>D:5?4;gBS>f:fB56T:S:V>f:7C6?e>g:f:TCf>5G4?S>f:fBV6e>U>E:U>fB5?U>e: S>h>eB6;S>f>T6T>D:F:T636S:W>T6T>8?U>7?gBFC5Cf:kK7?F?6CW>g>fBgBUBU>6C5?F;f: f:U>gBf>5;g6e>U:5?eBg>f:eBf>6?U6e:S>7?6;eB5?f:5Ce>g>T6S>UF5?V:f:T>67S>U64; f>DC6Cg:5?eBfJ7CfBh>U>U>T>6;S>f:e:e:5?gBf:eBU:UCU>6?U:f>g>D:U6D;U>T6B:E?U: C:UCf:D?DC5GgB7CfK7?eBe>57e:T:f:U6U6e>U>eBd:S:S>e:U:T>d:B:T6T>D:f:e:D:U:e> T6D:364?e>C:U>T:S>E:e:D6B6T6V>e6S:C:e>36T:D>S:DBf>f:U>D:U:7?U:5;T6T6D:e> 36T:S:C:S>e:U:S:U6SFU6e>T:S:e>T:S6BBe6T:C2SBT636SFU:SBDB5?g:5? URYGgBhB6CeBf>fB5?4?e>6?gBVBU:U>g:5?f>VBE:e>e>g:fBfBf:e>f>f>e:S6eFgBV:f>g> U>5;f>f:D:D:D?gBT:U:f:V6S>f:V:f:g>5C5?e:5?UG6?5Cf>e>e:f:V6T>U>U:T>g>5?U>U> T>8?e>g>U:f>g>U6D:hBT>U:36h>T6T6h:D:h:7GgB5G6?;PHC5?gBfB6?e:5?gFf>eB6?g>g: S>e>UF6C5?6;D:fBF?e:5?6?D:f>T>gBU6eBHCG?e:5?g>U>U>e:f:f:SJ6?g:S>e>E;36eB5; S>e:TB7Gg:5G6OHGgB5Cf>e>eBE?T6e>67D:5?e>6?6?e>gGU>eBV:d>eB5?D:U?U6e:U6B?T: S:4;C2C;TGHC5GHGg:S>FKFKW?GKFCWGXB8GWGiFHKgK5GFGFGdFWKEK6GFKH;FCGGX?HKX;W? gBgBFG7:VKFGHKYBGKhJi?gBGCGGdFHC5CFGF;7GGKH7FCW;HKU>U>5CgBC>GKi? WCFCWKW75C7GX;GKW;WGU>6?6C5;4GFGhJW;h>5C5C77g?6CGCG35?FGF77GX;7?T6T>f:fJ7? eBhB7GT>gB5?e6d:U>g:5?gFV>D:fBV2T>E>V6e:f:T>e>eB4?6?S>D2S:f:U>C>E:e:57e: f6gBB:S:S:f:5?D:D:U>f:f:5?D:U>fBU6T6T6D23;S:fBR>C:S>U>D:S:e>e:f>S>T:C6B6T: g:U>U>gBT:36D:T>VFS:S>e>56T:D:V>e>U6e>e>e:S>YGg:5;5?F>5;U>gBTBe>eBeBf:77e: f:f>d>675;D:5Cf:U:fBgBfBV>D:S:S:f>V:6;f:5GT>U>4CE2S>U:SBeBU6S:f:5?T>5Cf:S> V:U>e>T6T:SFU>5CE>V:S>6?f6T6eBg>U>V>e6T:D6B6D?e:e>5?U>T6T6D:D?W6T>U>47B:f: e6e:4?eBg>e>U>TGg:S>S>e2T>S6e:E6E:e:E:U>3?B:U:S:D:e>R>C:S>U:S6T:f:U>f6e: S636S:f:d>S:U>F6T>T>5736T6T:E:U6B6T:S>D:e>U:T6e>U>e:D:T6T:g:T>57e:S6e>e: B6D:f>T>e:e:D:T6D6BBD:S:T>e6T:D6B6DB5;D:T6T>D2S>eBD:f>eBf:f>e>UNHCU>V>gBd> U>eB5;T:eBU:f>VBE:U>U>f6S>D>E:U6e>U:e>eBf:5?eBU6T6T6eB4:D:S>e:T:f:fBS6B:e> 4;f>D:D:U>V6e:f:U>D:6?e:f:f:T6D?C6T>T>36D:D:E6S:S>U:U:D:f:S>e:C6h:T>U>U>T> U:D:D:hBe:S:S:V:36T>h:S>g:5C5Cf>e>kK7?F?gBW>U>eBg>U>D:5?e:57U:f:e>UBT> e6U2S>D:f:S>g:U:S>e:5?D:T6B:h6f:S>f:T6e>S:U>D2S>DBe:E6e:S:f6B:U:37e:C?gBU> f:S>TJV:T>V>D6T:S:f6B:T6T6S6e:UBU6T>D:D?D:f>T6T:f>T6D23;E:T636C;U6B6TCU6D? 4?6CU>g>4PHC5G5CF;e>f>g:f6U:eBf>fB4?e:S:5?V:e>e>C:U:SBU:f:U>U>g>eBU:S>D:D? e>S:U>f:T>U>5;U:36T:h>f:e:S6eBD:U>TBS>UF5?g>eBU>U>8?U>5;e:T6T6eBD6T:D>T>e> e:g>D:f:fJg:e>e>e>4?e:e:SF5;f>D6TFe>D2SJg:DFDBgB7?6?gNHCU>V>gBC:U>e:S:R6D: U:e:UBE:36T>f6C:D:E2S6T6U:S:S>f:f:D:U6T6T6DBD:46S6e:S6T:U>S6C6B64?e:D:36D: V6T6e:56T:V>e:f:f:U6D?T6T>C:D6B:D:U6B6S:U6T:D:d:T:S:T:7?D:D>U>D>D:U>D:hBe> T:S:F:T636h:S:F25C5C5?e>kK7?F?FCV:5?g>U>E>e:e>fBf>7;T6e>eBT:f:5;C:e>4?U:U> 6CfBf:e>e>D:e:h:f6T:e>U>T>5?U:T:D2SFgBf:T6e:C?T>eB57S>5;fB5CU>5?eJg>e>U:f: D:e:3?D6T>5?T>f:T>f>U6e>UGg:e:6?f:f:5?e:UCh>g>U6D;e>T6B?U:D;3G7?6GgB6?D: 5GGKHCXOFGFKjFIKHKjFXGgOgBWKGC4KiOVOGCWOY;FGFKj?XGi?H;5G7C5CG> hOWKWOkFXG8OYC5GXG7GdFXCgBWKG;GCWOY;7Gi77GeBg>e>6GTBXOYCiG7GiOX;FGFKj?XGi? HKeBGCgBF;4G7GiJH?X>FG6?6;gC5GXG77gBWKG3gBG7F;f:D:e>gRYGg:f>6?4CW>U>F?E?6? F?5CfFW6eBg>4;6GWBh>eBGCV>U>FG6C5G5?e:f:D:eFfFhBgBW?5C5?GCD:5Cf:E?5CU6eBg> 7?eBGCg:5GE:5?6?U>f:UC5CGC4Gf:5G7CV>U>FG6C5G5?V>f>T6T>8;f:5C6?5;U>U:S:8GU> 5Cf:W6eBg>66e>W>FG6?6C5?YGg:S:e>D>57T6eBTBe>eBT>U:67B:f:D>e>675;D: 5Cf6T6eBg>U>V>D:U:C2C:g:6;f:5GT>U>5CU6S>U:SBT>U6B:f:4?D:5Cf:T>V:S>g>T6T> fFg>5CU>g:S>6?f6T6eB6?U>g>e:e>U:S6D?S:S>f>T>S>T636CCg:e>U:3?D:f:f6B:57DCg> e>6C5PHCU>f>g:eBT>e:f6U>eBf>f>5CD:S>f:V:e>eBD:U>UBT:e:5Cf:f>e:U>U:S:D?d>S: S>g:U:fBf:S6T6T>h>f>D:S>eFU6T>gBS>e>U6gBg>e>U>8;T>U:e:36e>TBT6S:fBU:f>D:e: f:U:TJV:T>4?U>T>e>T6TJ6?e:f:DFe:S:SBD2SFDBGCgB6?gVkK7?g>eBfBU6eBUB4?e>6?U> U>f:U6eBE?f>VBE:e>e>V6T>U>U:S>g:5?e>U6eJVBV:U>g>U>5;f:U>D:e:D?U>T6T6e>V6B: e:W6e:V>DC5Cg:5?fGf>5?f>T6e:f>V6T>U>U:S>g:fBU>f:e>8;S:f>T6f:f:U:C:h>D:U: C2i:U6T:h:36i:7GGC5G6?;PHC5;f>g>5?T>g>VBe>eBg>f>6?e:D:fFf>6?5;D:f:E?T:f>4? U>6?eBf:f:e>8?6;f:5CV>U>5Cf:f:S:SJg>f>e:D:E?D:f:E;S>5;fF6?6?5C5O7C5Cf>g>T> U>E?T6e>4?U>6?e>6?e>e>gGU:e>g>4?5?U>U:UCg:5?T:S?e>D:D?U6R?DGFG6G7Gg: 36eB6GW?GK5C7GXB8GWGXBGKUK5?FGFGdFWKEK6GFKH75C7GX;GKW;W?eBgB6?F: VKFGHKYBGKhJi?gBGCGGRBG?5?FGF76GFKH;FCW;HKS>U>f:fBD>GKi?WCFCWKW75C7GX;GKW; WGU>6?6C57dBFCWFW;h:5C5Cg:U?gBGCG;5?FGF77GX357e>U:S:fJ7?D2C6T>S:56T6e:d6T> e6S:U>U6B:f>e:T>E:U6D:f:46T6e>U>U>U>D:f:D6BBU>E:e:5;S:U>fBT6e:S:e6S:T6B:U> g:D:5?F:eBf:U>6?U:S:ECU:fBT>U:S>U>E:S6e>g:U>U>e:5?e:D:V2S:S>e>U:S>U:C27?f: 5?e:W>e>D:V6e>56FG6?U>5CYGg:S:T>F6e6S>D:4:S6e:T:e:f6D2S:f>C6T6e6B:S:d6C:D: f:e:T6e:S:S:D6V6T2C:S>D:S:e:E:C:36TBT:T6D2S64;S6S>e2S:5;U>e>e>U:SFU6S: E6T636T6e:36C:e:S:T6D>T>D:f:D?C6T6U:U6U6e:U:C?U>T>D:47e:D2C?D:47cBgB6?U>5? D:5GGGiCFK6GHCh>7GFKhFGKUKFC5GWKTBFGEKgB7G7;6CGCW;GKG?FCU> 6G7CF6EG5C7GXB7GhJW;5?6?FGdFG?5C5GF76G6GH;5GF?WGD:fBg>U>4:6GW;F?5?FGF75? 6CG;7GG7FCe:f:5C6;4CFGVFW;g>eB5G6;U?g>FCW?eB5C5;FCG7g2S>g>T6TFg:5GHGFKFK7? FK7?VGFKX?7GXFhB7?FKW>GG8KhBGGFG4?FG7G3C7GDK5?eB7?F;4K8CWGH?7GX;GK5CgBFGF> 7GeB6?FKc>gBFC3GFCTGi:S>g:5?f6EGWOEG5GFCGK4?FG7G3C7GDKh>U>5C5GTB5GG76GD?f: 5GgBSFe:fB5GeB5?6GEC7GDC36eBf>T67?eBWCGGiFWC6GHG4KFGHKEGW?X?FCgBW7EGX? WCFCGCWB6GGGVFWGXFiBf:5GFGTBXCGKWK4GWGUKjB5C5GH;EGh>6CgBGBFCGCGB7GWJW? U6eB5C5?eFWKjF8C7G7GH>6GFGVFWGXFH?e>eB7?g:6CGGDGXFf>U>FCV>iB5C5GX> gBgBhFFGgFV6B:5Cg>4?D:5G5GF;6G5?FCG>hBFCWB7GUGeB5C5GRBFG4GfB5G775?6CG; 7GG7F;U>U>6CF6EG5C7GH>6GVFW;U>6?FCSB7?e>5C57gB6G735?F77Ge>D:5?U>D:6GW;F?5? FGF3e>gBG76GF7FCD:f:5?e:dB5CVFF7V:e>eBg:U;f>6?F7e:5C5;gBG?g>D2S>6?gFg: 5G8GHGEG8G6GW;VCGGW?WG7Oi>6G7?F>GKiF8C6GWG4G6GWKUGWKDGe>6?eBG;4K8GGGX;FGG? XKf>6GgBW>WGg>6G7?DCFGXG3CFGCCW>g:S>6?g:EGXKEK6CFGHCdB6CGKDGGKDGW:fBU> gBUB7CG?HGD;fBg:5C5OfBFGgBe>5C7?4?FG5Cg:36eBFCHCU>FGWG6KHC7?FKEO7GFKEG7CH? eBWGg:VKWCH?gB7GXB6?FGiF6GWFF:5Gg:5GfFjGFCWGEC7GDGh:5?FC5?EGh> eBFGVBfBFGFB5G6B57eBU6eB6C5KHK7KhB5GFKWB5?FCGB6CWFF7e:5?eB7;6C5GDCVFS>5CU> g>X:fBgBU>eB5CF>eBV>gBU6B:5GFCU6eB6GG?GC5C6GWB8?FGWBFGECf>6GFCeF7GECeB6? F7fB6GF;gB7?F;e>gBU>g>VKgBGGVB5GGBF;f>eB7?TBF;f>gBF7U>gBg:5Cg67GS:5?D: 5CVBGCW?7;5CgBW7U>6C53fB57FCT:S>g:5?d>6CGB5;V:U>5?e:D7e:f:5?e>U>5;gB5;5?5? D2S>6CU6B:f>6G4CW>5?F7E?6GF75CWFW>eBgBG:6GWBh>gBFCR>5?FG3C7G4GD:f:5?e: eFhBFCG75C7;GKf:fB5GF65CT>eBgBe>gBGC4C5CCC76e>g:S>g:5CGK4G5C5C7GS>5? 6G3C7GDGV6T>5CU>4:fB576G4;S>U>g:UFe:5C5Gf>e>6G4?6GS>eBg:36eB7?D:5CFGiBW? 6G6GeFFCGG4GW?X?g>FCW;4CG?WC5CFGF>6G6GXFWGhBh:eB5Gg:E>G?6GFK4GFGUGX>fBgBG; 4Gh>g>FChBFCFKW>6CWFG7S>5CU6eBTBFGXBh>gBGCW>gB6GWFFGGB7;T>U>6?e65C7CDGXBU: 5?FC5?iBfB7Gi:f>6?gB6GW>U>6CU6B:ECU:5GFGW?5G6C7?V:gB5GgB7GUG5?eBFKC>5C4GU> gBg:5?6?F;7G7;5?D:fB7CU24Ce>gBG>gBVFF7e:f:5CUB7?e>eB5;gBgB77eB5;FC36T>6?D: E6fBF75;e:5C5;e:f>67gB635?S6T6eBgBeB5CUFF7U:S>eB6?U;f:5?F;S>e>e>5?6;U6e>6? D2SJ7?5GHGFK6G7?FG6?EC6GH?7GXFhBg>FKW:6GhFh>FCFC4?FG6G3C7G4Gf:eB7?6? dFhBFCG;6CG;GKeBfB5Cg>7GeBg>6Ge>gBFCeB6CEGW6S>6Cg:3;4CGK4GfB5C7Gf> 5C6G4C7G3GV>T>e>FCVB5G776G4?U:fBgBUFf:fB5GU>f>gB6C6G5?T>FGg:36HC5GiGgB7G7? eB7?5KgBFG4?F76;5?eB7;EGF?7;fBgBG>eB6?6>5?FBV>D:5?eBUBXC5CGC4?6G3CW:f:5Cf: 4?F:f>eBG:e:fBU>fBUB6;36e>5CUBfF7GhFV>5C5GW>e>6?F>5?VB67T6e>eBh6U>6Cc>FBT: S>g:U6V:S:U>g>T>e>g>f>gBU6eB6CU62 ; map<unsigned long long, int> inds = { {0ull, 0}, {1ull, 1}, {2ull, 173}, {3ull, 223}, {4ull, 247}, {5ull, 259}, {6ull, 268}, {7ull, 274}, {8ull, 277}, {9ull, 278}, {10ull, 279}, {11ull, 280}, {12ull, 281}, {13ull, 282}, {14ull, 283}, {15ull, 284}, {16ull, 285}, {17ull, 286}, {18ull, 287}, {19ull, 288}, {24ull, 2}, {25ull, 96}, {26ull, 128}, {27ull, 142}, {28ull, 151}, {29ull, 157}, {30ull, 161}, {31ull, 162}, {32ull, 163}, {33ull, 164}, {34ull, 165}, {35ull, 166}, {36ull, 167}, {37ull, 168}, {38ull, 169}, {39ull, 170}, {40ull, 171}, {41ull, 172}, {48ull, 174}, {49ull, 193}, {50ull, 202}, {51ull, 208}, {52ull, 212}, {53ull, 213}, {54ull, 214}, {55ull, 215}, {56ull, 216}, {57ull, 217}, {58ull, 218}, {59ull, 219}, {60ull, 220}, {61ull, 221}, {62ull, 222}, {72ull, 224}, {73ull, 231}, {74ull, 235}, {75ull, 237}, {76ull, 238}, {77ull, 239}, {78ull, 240}, {79ull, 241}, {80ull, 242}, {81ull, 243}, {82ull, 244}, {83ull, 245}, {84ull, 246}, {96ull, 248}, {97ull, 250}, {98ull, 251}, {99ull, 252}, {100ull, 253}, {101ull, 254}, {102ull, 255}, {103ull, 256}, {104ull, 257}, {105ull, 258}, {120ull, 260}, {121ull, 261}, {122ull, 262}, {123ull, 263}, {124ull, 264}, {125ull, 265}, {126ull, 266}, {127ull, 267}, {144ull, 269}, {145ull, 270}, {146ull, 271}, {147ull, 272}, {148ull, 273}, {168ull, 275}, {169ull, 276}, {553ull, 3}, {554ull, 50}, {555ull, 67}, {556ull, 76}, {557ull, 82}, {558ull, 85}, {559ull, 86}, {560ull, 87}, {561ull, 88}, {562ull, 89}, {563ull, 90}, {564ull, 91}, {565ull, 92}, {566ull, 93}, {567ull, 94}, {568ull, 95}, {577ull, 97}, {578ull, 108}, {579ull, 114}, {580ull, 118}, {581ull, 119}, {582ull, 120}, {583ull, 121}, {584ull, 122}, {585ull, 123}, {586ull, 124}, {587ull, 125}, {588ull, 126}, {589ull, 127}, {601ull, 129}, {602ull, 133}, {603ull, 134}, {604ull, 135}, {605ull, 136}, {606ull, 137}, {607ull, 138}, {608ull, 139}, {609ull, 140}, {610ull, 141}, {625ull, 143}, {626ull, 144}, {627ull, 145}, {628ull, 146}, {629ull, 147}, {630ull, 148}, {631ull, 149}, {632ull, 150}, {649ull, 152}, {650ull, 153}, {651ull, 154}, {652ull, 155}, {653ull, 156}, {673ull, 158}, {674ull, 159}, {675ull, 160}, {1106ull, 175}, {1107ull, 181}, {1108ull, 184}, {1109ull, 185}, {1110ull, 186}, {1111ull, 187}, {1112ull, 188}, {1113ull, 189}, {1114ull, 190}, {1115ull, 191}, {1116ull, 192}, {1130ull, 194}, {1131ull, 195}, {1132ull, 196}, {1133ull, 197}, {1134ull, 198}, {1135ull, 199}, {1136ull, 200}, {1137ull, 201}, {1154ull, 203}, {1155ull, 204}, {1156ull, 205}, {1157ull, 206}, {1158ull, 207}, {1178ull, 209}, {1179ull, 210}, {1180ull, 211}, {1659ull, 225}, {1660ull, 226}, {1661ull, 227}, {1662ull, 228}, {1663ull, 229}, {1664ull, 230}, {1683ull, 232}, {1684ull, 233}, {1685ull, 234}, {1707ull, 236}, {2212ull, 249}, {12720ull, 4}, {12721ull, 24}, {12722ull, 33}, {12723ull, 38}, {12724ull, 41}, {12725ull, 42}, {12726ull, 43}, {12727ull, 44}, {12728ull, 45}, {12729ull, 46}, {12730ull, 47}, {12731ull, 48}, {12732ull, 49}, {12744ull, 51}, {12745ull, 56}, {12746ull, 59}, {12747ull, 60}, {12748ull, 61}, {12749ull, 62}, {12750ull, 63}, {12751ull, 64}, {12752ull, 65}, {12753ull, 66}, {12768ull, 68}, {12769ull, 69}, {12770ull, 70}, {12771ull, 71}, {12772ull, 72}, {12773ull, 73}, {12774ull, 74}, {12775ull, 75}, {12792ull, 77}, {12793ull, 78}, {12794ull, 79}, {12795ull, 80}, {12796ull, 81}, {12816ull, 83}, {12817ull, 84}, {13273ull, 98}, {13274ull, 101}, {13275ull, 102}, {13276ull, 103}, {13277ull, 104}, {13278ull, 105}, {13279ull, 106}, {13280ull, 107}, {13297ull, 109}, {13298ull, 110}, {13299ull, 111}, {13300ull, 112}, {13301ull, 113}, {13321ull, 115}, {13322ull, 116}, {13323ull, 117}, {13826ull, 130}, {13827ull, 131}, {13828ull, 132}, {25440ull, 176}, {25441ull, 177}, {25442ull, 178}, {25443ull, 179}, {25444ull, 180}, {25464ull, 182}, {25465ull, 183}, {292561ull, 5}, {292562ull, 13}, {292563ull, 17}, {292564ull, 18}, {292565ull, 19}, {292566ull, 20}, {292567ull, 21}, {292568ull, 22}, {292569ull, 23}, {292585ull, 25}, {292586ull, 27}, {292587ull, 28}, {292588ull, 29}, {292589ull, 30}, {292590ull, 31}, {292591ull, 32}, {292609ull, 34}, {292610ull, 35}, {292611ull, 36}, {292612ull, 37}, {292633ull, 39}, {292634ull, 40}, {293114ull, 52}, {293115ull, 53}, {293116ull, 54}, {293117ull, 55}, {293138ull, 57}, {293139ull, 58}, {305281ull, 99}, {305282ull, 100}, {6728904ull, 6}, {6728905ull, 8}, {6728906ull, 9}, {6728907ull, 10}, {6728908ull, 11}, {6728909ull, 12}, {6728928ull, 14}, {6728929ull, 15}, {6728930ull, 16}, {6729457ull, 26}, {154764793ull, 7}}; void solve() { vector<bool> bits; for (char c : encoded) { int cur = c; if (c > ) { --cur; } cur -= 50; for (int j = 0; j < 6; ++j) { bits.push_back(cur & (1 << j)); } } int c = 0; for (int i = 0; i < 289; ++i) { for (int j = 0; j < 289; ++j) { for (int k = 0; k < 4; ++k) { real_dist[i][j] \|= bits[c++] << k; } } } vector<int> sieve(MAXV); for (int i = 2; i < MAXV; ++i) { if (!sieve[i]) { sieve[i] = i; for (long long j = (long long)i * i; j < MAXV; j += i) { sieve[j] = i; } } } function<int(int)> get_ind = [&](int a) { vector<int> pows; map<int, int> cnt; int tmp = a; while (tmp > 1) { int div = sieve[tmp]; cnt[div]++; tmp /= div; } for (pair<int, int> p : cnt) { pows.push_back(p.second); } sort(pows.begin(), pows.end()); unsigned long long h = 0; for (int num : pows) { h = h * 23 + num; } return inds[h]; }; int t; cin >> t; for (int i = 0; i < t; ++i) { int a, b; cin >> a >> b; int ind1 = get_ind(a); int ind2 = get_ind(b); cout << real_dist[ind1][ind2] << n ; } } int main() { cerr << fixed << setprecision(15); cout << fixed << setprecision(15); ios::sync_with_stdio(false); int tests = 1; for (int it = 1; it <= tests; ++it) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long a, b, c, i, j; cin >> a >> b >> c; string f, s, third; if (a) { s = string(a + 1, 0 ); } if (c) { f = string(c + 1, 1 ); } if (b) { bool flag; if (a == 0 && c) { flag = true; for (i = 0; i < b; i++) { if (flag) { third += 0 ; flag = false; } else { third += 1 ; flag = true; } } cout << f << third << endl; continue; } if (c) { b--; } flag = true; for (i = 0; i < b; i++) { if (flag) { third += 1 ; flag = false; } else { third += 0 ; flag = true; } } if (a == 0 && c == 0) { if (b & 1) third += 0 ; else third += 1 ; } } cout << f << s << third << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; for (int i = 0; i < s1.size(); i++) { s1[i] = tolower(s1[i]); s2[i] = tolower(s2[i]); } if (s1 < s2) { cout << -1; } else if (s2 < s1) { cout << 1; } else { cout << 0; } return 0; }
#include <bits/stdc++.h> using namespace std; const float pi = acos(-1.0); const int maxn = 1e5 + 5; int c[maxn]; long long a[5][maxn], b[maxn]; vector<int> vec[maxn]; void dfs(int u, int fa) { for (auto p : vec[u]) { if (p != fa) { c[p] = 6 - c[u] - c[fa]; dfs(p, u); } } } int main() { int u, v; int t, n; cin >> n; for (int i = 1; i <= 3; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; int fu, fv; for (int i = 1; i <= n - 1; i++) { cin >> u >> v; vec[u].push_back(v); vec[v].push_back(u); } int cnt = 0, cnt1 = 0; for (int i = 1; i <= n; i++) { if (vec[i].size() == 2) { cnt++; } if (vec[i].size() == 1) { fv = i; cnt1++; } } if (cnt != n - 2 && cnt1 != 2) { puts( -1 ); return 0; } long long res = 1e17, ans = 0; ; for (int i = 1; i <= 3; i++) { for (int j = 1; j <= 3; j++) { if (i == j) continue; fu = vec[fv][0]; c[fu] = i, c[fv] = j; dfs(fu, fv); ans = 0; for (int k = 1; k <= n; k++) ans += a[c[k]][k]; if (ans < res) { res = ans; for (int k = 1; k <= n; k++) { b[k] = c[k]; } } } } printf( %lld n , res); for (int i = 1; i <= n; i++) cout << b[i] << ; cout << endl; }
#include <bits/stdc++.h> using namespace std; int n, a, b, d[500], s; int main() { scanf( %d , &n); for (int i = 1; i <= 2 * n; i++) scanf( %d , &d[i]); for (int i = 1; i <= 2 * n; i++) for (int j = 1; j <= 2 * n; j++) if (d[i] == d[i + (2 * j - 1)]) s++; printf( %d , s); scanf( ); }
#include <bits/stdc++.h> template <class T> T Min(const T &a, const T &b) { return a < b ? a : b; } template <class T> T Max(const T &a, const T &b) { return a > b ? a : b; } template <class T> bool Chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <class T> bool Chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } struct fast_input { static const int L = 1 << 15 \| 1; char buf[L], l, r; fast_input() { l = r = buf; } void Next(char &c) { if (l == r) r = (l = buf) + fread(buf, 1, L, stdin); c = l == r ? (char)EOF : l++; } template <class T> void operator()(T &x) { char c, f = 0; for (Next(c); !isdigit(c); Next(c)) if (c == - ) f = 1; for (x = 0; isdigit(c); Next(c)) x = x 10 + c - 0 ; if (f) x = -x; } } input; const int N = 1000 + 3; const int M = 100000 + 7; const int MOD = 998244353; int n, m, a[N], f[N][N], ans[M], b[M]; int Power(int x, int y) { int ret = 1; while (y) { if (y & 1) ret = 1LL * x * ret % MOD; x = 1LL * x * x % MOD, y >>= 1; } return ret; } int main() { int x, y, z; input(n), input(m); for (int i = (1), i_end = (n); i <= i_end; ++i) input(a[i]), b[a[i]] = 1; std::sort(a + 1, a + n + 1); ans[0] = 1; for (int i = (m + 1), i_end = (n); i <= i_end; ++i) ans[0] = 1LL * ans[0] * i % MOD; for (int i = (2), i_end = (n - m); i <= i_end; ++i) ans[0] = 1LL * ans[0] * Power(i, MOD - 2) % MOD; int maxans = 0; while (ans[maxans++]) { x = 0; for (int i = (1), i_end = (n); i <= i_end; ++i) x \|= (a[i] - maxans + 1 >= 0 && b[a[i] - maxans + 1]); if (!x) { ans[maxans] = ans[maxans - 1]; continue; } f[0][0] = 1, x = 0; for (int j = (1), j_end = (n); j <= j_end; ++j) { for (int k = (1), k_end = (m); k <= k_end; ++k) { while (a[j] - a[x + 1] >= maxans) ++x; f[j][k] = (f[j - 1][k] + f[x][k - 1]) % MOD; } f[j][0] = f[j - 1][0]; } ans[maxans] = f[n][m]; } int ret = 0; for (int i = (1), i_end = (maxans - 2); i <= i_end; ++i) ret = (ret + 1LL * (ans[i] - ans[i + 1]) * i) % MOD; printf( %d n , (ret + MOD) % MOD); return 0; }
#include <bits/stdc++.h> using namespace std; struct S { long long prime; int q, h, ji; }; S xxx[300000]; priority_queue<S> sum[4]; bool biao[300000]; bool operator<(const S &a, const S &b) { return a.prime > b.prime; } int main() { int x, y; cin >> x; for (int a = 0; a < x; a++) { cin >> xxx[a].prime; xxx[a].ji = a; } for (int a = 0; a < x; a++) cin >> xxx[a].q; for (int a = 0; a < x; a++) cin >> xxx[a].h; for (int a = 0; a < x; a++) { sum[xxx[a].q].push(xxx[a]); sum[xxx[a].h].push(xxx[a]); } cin >> y; while (y--) { cin >> x; while (!sum[x].empty() && biao[sum[x].top().ji]) sum[x].pop(); if (sum[x].empty()) cout << -1 ; else { cout << sum[x].top().prime; biao[sum[x].top().ji] = 1; sum[x].pop(); } y == 0 ? cout << endl : cout << ; } return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; long long n, m, a, b, c, k, temp, x, y; const int MAXN = 1e5 + 11, mod = 1e9 + 7; inline long long max(long long a, long long b) { return ((a > b) ? a : b); } inline long long min(long long a, long long b) { return ((a > b) ? b : a); } inline vector<long long> read(int n) { vector<long long> v(n); for (int i = 0; i < v.size(); i++) cin >> v[i]; return v; } long long setbits(long long n) { if (n % 4 == 0) return n; if (n % 4 == 1) return 1; if (n % 4 == 2) return n + 1; if (n % 4 == 3) return 0; return 1e18; } long long getxor(long long x, long long m) { return setbits(x + m - 1) ^ setbits(x - 1); } void sol() { cin >> n; long long txor = 0; for (int i = 0; i < n; i++) { cin >> x >> m; txor = txor ^ getxor(x, m); } if (txor) cout << tolik ; else cout << bolik ; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int test = 1; for (int i = 1; i <= test; i++) sol(); }
#include <bits/stdc++.h> using namespace std; int main() { int a[101], dif[100], i, unique[101], c = 0; int min = 0, n, dif1, dif2; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); unique[c] = a[0]; c++; for (i = 1; i < n; i++) { if (a[i] != a[i - 1]) { unique[c] = a[i]; c++; } } if (c >= 4) { cout << -1; } else if (c == 1) { cout << 0 << endl; } else if (c == 2) { if ((unique[1] - unique[0]) % 2) { cout << unique[1] - unique[0]; } else { cout << (unique[1] - unique[0]) / 2; } } else { if (unique[2] - unique[1] == unique[1] - unique[0]) { cout << unique[2] - unique[1]; } else { cout << -1 << endl; } } }
#include <bits/stdc++.h> using namespace std; long long n; int k; long long a[100050]; int main() { cin >> n >> k; for (int i = 1; i <= k; i++) cin >> a[i]; long long A = 1, B = 0, C = 0; for (int i = 1; i <= k; i++) { if (n - n % a[i] > C) { A = 1ll * i, B = n / a[i]; C = n - n % a[i]; } } cout << A << << B; return 0; }
#include <bits/stdc++.h> using namespace std; int n, q, A[100005 * 3], B[100005 * 3], ans[100005]; int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } vector<pair<int, int> > G[100005]; vector<int> E[100005]; pair<int, int> SL(pair<int, int> a) { int t = gcd(abs(a.first), abs(a.second)); a.first /= t, a.second /= t; return a; } int tr[100005]; void upd(int u, int v) { for (; u <= n; u += u & -u) tr[u] += v; } int qry(int u) { int r = 0; for (; u; u -= u & -u) r += tr[u]; return r; } map<pair<int, int>, int> mAp; int main() { scanf( %d , &n); for (int i = (1), LIM = (n); i <= LIM; i++) { int K; scanf( %d , &K); for (int j = (0), LIM = (K - 1); j <= LIM; j++) { scanf( %d%d , &A[j], &B[j]); if (j) G[i].push_back(SL(make_pair(A[j] - A[j - 1], B[j] - B[j - 1]))); } G[i].push_back(SL(make_pair(A[0] - A[K - 1], B[0] - B[K - 1]))); } scanf( %d , &q); for (int i = (1), LIM = (q); i <= LIM; i++) { scanf( %d%d , &A[i], &B[i]); E[B[i]].push_back(i); } for (int i = (1), LIM = (n); i <= LIM; i++) { for (auto u : G[i]) { int t = mAp[u]; upd(t + 1, 1), upd(i + 1, -1); mAp[u] = i; } for (int u : E[i]) ans[u] = qry(A[u]); } for (int i = (1), LIM = (q); i <= LIM; i++) printf( %d n , ans[i]); }
#include <bits/stdc++.h> using namespace std; inline int inp() { return 0; } inline int inp(bool& A) { if (cin >> A) return 1; return -1; } inline int inp(char& A) { return scanf( %c , &A); } inline int inp(int& A) { return scanf( %d , &A); } inline int inp(float& A) { if (cin >> A) return 1; return -1; } inline int inp(long long& A) { return scanf( %I64d , &A); } inline int inp(double& A) { return scanf( %lf , &A); } inline int inp(char* A) { return scanf( %s , A); } inline int inp(string& A) { if (cin >> A) return 1; return -1; } template <class Front, class... Queue> inline int inp(Front& A, Queue&... B) { return inp(A) + inp(B...); } inline int oup() { return 0; } inline int oup(bool A) { if (cout << A) return 1; return -1; } inline int oup(char A) { return printf( %c , A); } inline int oup(int A) { return printf( %d , A); } inline int oup(float A) { if (cout << A) return 1; return -1; } inline int oup(long long A) { return printf( %I64d , A); } inline int oup(double A) { return printf( %lf , A); } inline int oup(char* A) { return printf(A); } inline int oup(const char* A) { return printf( %s , A); } inline int oup(string& A) { if (cout << A) return 1; return -1; } template <class Front, class... Queue> inline int oup(Front A, Queue... B) { return oup(A) + oup(B...); } template <class T> inline void remax(T& A, T B) { if (A < B) A = B; } template <class T> inline void remin(T& A, T B) { if (A > B) A = B; } string ToString(long long num) { string ret; do { ret += ((num % 10) + 0 ); num /= 10; } while (num); reverse(ret.begin(), ret.end()); return ret; } long long ToNumber(string s) { long long r = 0, p = 1; for (int i = s.size() - 1; i >= 0; --i) r += (s[i] - 0 ) * p, p = 10; return r; } long long Gcd(long long a, long long b) { while (a %= b ^= a ^= b ^= a) ; return b; } long long Power(long long base, long long power) { long long ret = 1; while (power) { if (power & 1) ret = base; power >>= 1; base = base; } return ret; } long long PowerMod(long long base, long long power, long long mod) { if (!power) return 1; if (power & 1) return (base PowerMod(base, power - 1, mod)) % mod; return PowerMod((base * base) % mod, power >> 1, mod); } int Log(long long num, long long base) { int ret = 0; while (num) { ++ret; num /= base; } return ret; } int Count(long long mask) { int ret = 0; while (mask) { if (mask & 1) ++ret; mask >>= 1; } return ret; } inline void run() { in:; int n, m, k; if (inp(n, m, k) != 3) return; vector<int> a(m), b(m), c(m); long long ans = 0; for (int i = 0; i < m; ++i) inp(a[i], b[i], c[i]); while (k--) { int tmp; inp(tmp); for (int i = 0; i < m; ++i) if (tmp >= a[i] && tmp <= b[i]) ans += (long long)c[i] + tmp - a[i]; } oup(ans, n ); goto in; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); run(); return 0; }
#include <bits/stdc++.h> using namespace std; string s, ss; int idx; int main() { cin >> s; for (int i = 0; i < s.length(); i++) { if (s[i] == . ) { idx = i; break; } } if (s[idx - 1] != 9 ) { if (s[idx + 1] < 5 ) { ss = s.substr(0, idx); } else { ss = s.substr(0, idx); ss[ss.length() - 1]++; } } else if (s[idx - 1] == 9 ) { cout << GOTO Vasilisa. ; } cout << ss; return 0; }
#include <bits/stdc++.h> using namespace std; int n, i, k, x; string s; int main() { cin >> n >> k >> s; for (i = 0; i < n; i++) { if (s[i] == # ) x++; else x = 0; if (x == k) { cout << NO ; return 0; } } cout << YES ; }
#include <bits/stdc++.h> using namespace std; struct Node { int u; map<char, int> child; }; vector<Node> grafo; int win[100005], lose[100005]; void addTrie(int u, string &s) { for (char c : s) { if (grafo[u].child.count(c) == 0) { Node novo; novo.u = grafo.size(); grafo[u].child[c] = grafo.size(); grafo.push_back(novo); } u = grafo[grafo[u].child[c]].u; } } void solve(int u) { if (grafo[u].child.size() == 0) { win[u] = 0; lose[u] = 1; } for (pair<int, int> par : grafo[u].child) { int v = par.second; solve(v); win[u] = (win[u] \|\| !win[v]); lose[u] = (lose[u] \|\| !lose[v]); } } int main() { ios::sync_with_stdio(false); Node root; root.u = 0; grafo.push_back(root); int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { string s; cin >> s; addTrie(0, s); } solve(0); int w = win[0], l = lose[0]; if (w == 0) cout << Second << endl; else if (w == 1 && l == 1) cout << First << endl; else if (w == 1 && l == 0 && k % 2 != 0) cout << First << endl; else cout << Second << endl; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> using v2d = vector<vector<T> >; template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); const int maxN = 2e5 + 10; const long long inf = 1e18; int n; long long k, a[maxN]; bool check(long long d) { long long c = 1, x = d - 1, y = 0, sum = 0; bool ovf = 0; for (int i = n; i; i--) { if (a[i] > 0 && (ovf \|\| (long double)sum + (long double)c * a[i] > inf)) { return 1; } if (a[i] > 0) { sum += c * a[i]; } if (sum >= k) { return 1; } x++; y++; if ((long double)c * x / y > inf) { ovf = 1; } else { __int128 tmp = c; tmp = x; tmp /= y; c = tmp; } } return sum >= k; } void solve() { cin >> n >> k; for (int i = 1; i <= (int)(n); ++i) { cin >> a[i]; } if (max_element(a + 1, a + n + 1) >= k) { cout << 0; return; } long long l = 0, r = inf; while (r - l > 1) { long long mid = (l + r) / 2; if (check(mid)) { r = mid; } else { l = mid; } } cout << r; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int T = 1; while (T--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; inline int qr() { int f = 0, fu = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) fu = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << 1) + c - 48; c = getchar(); } return f * fu; } const int N = 2e5 + 10; int a[N], n, k, T; pair<int, int> b[N]; int main() { T = qr(); while (T--) { n = qr(), k = qr(); for (register int i = 1; i <= n; ++i) a[i] = qr(); for (register int i = 1; i <= n; ++i) qr(); sort(a + 1, a + n + 1); int m = 0; for (register int i = 1; i <= n; ++i) { b[++m] = {a[i], 0}; int j = i; while (a[j] == a[i]) b[m].second++, j++; i = j - 1; } for (register int i = 1; i <= m; ++i) b[i].second += b[i - 1].second; if (k * 2 >= a[n] - a[1]) { printf( %d n , n); continue; } vector<int> st(m + 1); int ans = 0; for (int i = 1, j = 1; i <= m; i++) { while (b[i].first - b[j].first > k) j++; st[i] = max(st[i - 1], b[i].second - b[j - 1].second); ans = max(ans, b[i].second - b[j - 1].second + st[j - 1]); } printf( %d n , ans); } return 0; }
#include <bits/stdc++.h> using namespace std; long long a[1000006]; map<pair<long long, long long>, long long> mp; int main() { long long n, k; cin >> n >> k; if (k == 0 && n != 1) { cout << No solution ; return 0; } if (n == 1) { cout << k; return 0; } if (k != 1) { cout << k - 1; for (int i = 0; i < n - 2; i++) cout << 0; cout << 1; return 0; } if (k == 1) { cout << 9; for (int i = 0; i < n - 2; i++) cout << 0; cout << 1; return 0; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int64_t k; cin >> k; int64_t r = 2, c = 3; cout << r << << c << endl; int64_t arr[2][3]; int64_t ones = ((int64_t)1 << 18) - 1; arr[0][0] = ones; arr[0][1] = ((int64_t)1 << 17); arr[0][2] = 0; arr[1][0] = k; arr[1][1] = ones; arr[1][2] = k; for (int64_t i = 0; i < r; i++) { for (int64_t j = 0; j < c; j++) { cout << arr[i][j] << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int a[2][2]; cin >> a[0][0] >> a[0][1] >> a[1][0] >> a[1][1]; int n[2]; if (!a[0][0] && !a[1][0] && !a[0][1] && !a[1][1]) { cout << 0 ; return 0; } for (int i = 0; 1; i++) { int temp = i * (i - 1) / 2; if (temp == a[0][0]) { n[0] = i; break; } if (temp > a[0][0]) { cout << Impossible ; return 0; } } for (int i = 0; 1; i++) { int temp = i * (i - 1) / 2; if (temp == a[1][1]) { n[1] = i; break; } if (temp > a[1][1]) { cout << Impossible ; return 0; } } if (n[0] == 0) if (a[0][1] \|\| a[1][0]) n[0] = 1; if (n[1] == 0) if (a[0][1] \|\| a[1][0]) n[1] = 1; if ((a[0][1] + a[1][0]) != n[0] * n[1]) { cout << Impossible ; return 0; } int base = n[1]; while (1) { if (a[0][1] > base) { cout << 0 ; n[0]--; a[0][1] -= base; } else { for (int i = 0; i < base - a[0][1]; ++i) cout << 1 ; if (n[0] > 0) { cout << 0 ; n[0]--; } for (int i = 0; i < a[0][1]; ++i) cout << 1 ; for (int i = 0; i < n[0]; ++i) cout << 0 ; break; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n = 0; long long moves = 0; cin >> n; vector<long long> arr(n, 0); for (int i = 0; i < n; i++) cin >> arr[i]; long long last = arr[0]; long long min = INT_MAX; bool found = false; for (int i = 1; i < n; i++) { if (arr[i] < arr[i - 1]) { if (arr[i] < min) { min = arr[i]; found = true; } } if (arr[i] > arr[i - 1] \|\| i + 1 == n) { if (found) { moves += last - min; found = false; } min = INT_MAX; last = arr[i]; } } cout << moves << endl; return 0; }
#include <bits/stdc++.h> using namespace std; long a, b, r; int main() { ios_base::sync_with_stdio(0); cin >> a >> b >> r; if (min(a, b) >= 2 * r) cout << First << endl; else cout << Second << endl; cin.get(); cin.get(); return 0; }
#include <bits/stdc++.h> using namespace std; template <typename T, size_t N> struct ma : array<T, N> { T &operator[](size_t n) { return (static_cast<array<T, N> >(this))[n]; } }; template <class T> string to_str(const T &a) { ostringstream os; os << a; return os.str(); } template <> string to_str<long double>(const long double &a) { ostringstream os; os.precision(10); os.setf(ios::fixed); os << a; return os.str(); } template <class T> T from_str(const string &s) { istringstream is; T val; is >> val; return val; } int cond = (long long)0; map<int, vector<int> > nei; int dat[(int)1e5 + 11]; void solve() { int n, m; scanf( %d%d , &n, &m); for (auto i = (0); i < (m); ++i) { scanf( %d , &dat[i]); } long long turn = 0; for (auto i = (0); i < (m - 1); ++i) { int a = dat[i], b = dat[i + 1]; turn += abs(a - b); if (a != b) { nei[a].push_back(b); nei[b].push_back(a); } } long long res = turn; for (auto &it : (nei)) { auto kol = it.second; sort((kol).begin(), (kol).end()); int mid = kol.size() / 2; long long cand1 = 0; long long cand2 = 0; for (auto &jt : (kol)) { cand1 += abs(it.first - jt); cand2 += abs(jt - kol[mid]); } res = min(res, turn + cand2 - cand1); } cout << res << endl; } void brute() {} void gen(int i, int n, int k) {} int main(int argc, char **argv) { ios::sync_with_stdio(false); vector<string> args; int nr_test = -1; int t = 1; for (auto i = (1); i <= (argc - 1); ++i) args.push_back(argv[i]); for (auto &it : (args)) if (it == q ) cond = 10000000; for (auto &it : (args)) if (it == all ) t = 1000; for (auto &it : (args)) if (atoi(it.c_str()) > 0) nr_test = atoi(it.c_str()); for (auto &it : (args)) if (it == b ) { brute(); return 0; } for (auto &it : (args)) if (it == g && args.size() >= 4) { gen(atoi(args[1].c_str()), atoi(args[2].c_str()), atoi(args[3].c_str())); return 0; } for (auto i = (1); i <= (t); ++i) { if (nr_test == -1 \|\| i <= nr_test) solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { string s; vector<int> v; int n, d, p = 0, cnt = 0, mx = -1; cin >> n >> d >> s; for (int i = 0; i < n; i++) if (s[i] == 1 ) v.push_back(i); for (int i = 1; i < v.size(); i++) { if (v[i] - v[i - 1] > mx) mx = v[i] - v[i - 1]; } if (mx > d) { cout << -1; return 0; } while (p < n - 1) { p += d; while (s[p] == 0 ) p--; cnt++; } cout << cnt; return 0; }
#include <bits/stdc++.h> using namespace std; struct Hill { int Lid, Mid, Rid; long long Lv, Mv, Rv; bool valid; Hill() : valid(false) {} Hill(int Lid, int Mid, int Rid, long long Lv, long long Mv, long long Rv) : Lid(Lid), Mid(Mid), Rid(Rid), Lv(Lv), Mv(Mv), Rv(Rv), valid(true) {} int Len() const { return valid ? Rid - Lid + 1 : 0; } Hill operator+(const Hill B) const { Hill Ans; if (Rv == B.Lv) return Ans; if (Rv < B.Lv) { if (Mid == Rid) return Hill(Lid, B.Mid, B.Rid, Lv, B.Mv, B.Rv); else return Hill(Rid, B.Mid, B.Rid, Rv, B.Mv, B.Rv); } else { if (B.Mid == B.Lid) return Hill(Lid, Mid, B.Rid, Lv, Mv, B.Rv); else return Hill(Lid, Mid, B.Lid, Lv, Mv, B.Lv); } } bool operator<(const Hill B) const { return Len() < B.Len(); } void show() { if (valid) printf( A[%d]=%d A[%d]=%d A[%d]=%d n , Lid, int(Lv), Mid, int(Mv), Rid, int(Rv)); else printf( ERROR! n ); } }; Hill CLeft(const Hill A, const Hill B) { if (!B.valid \|\| B.Lv == A.Rv) return A; if (A.Mid == A.Rid) { if (B.Lv > A.Rv) return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv); else if (B.Lid == B.Mid) return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv); else return Hill(A.Lid, A.Mid, B.Lid, A.Lv, A.Mv, B.Lv); } else { if (B.Lv < A.Rv) { if (B.Lid == B.Mid) return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv); else return Hill(A.Lid, A.Mid, B.Lid, A.Lv, A.Mv, B.Lv); } else return A; } } Hill CRight(const Hill A, const Hill B) { if (!A.valid \|\| A.Rv == B.Lv) return B; if (B.Mid == B.Lid) { if (A.Rv > B.Lv) return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv); else if (A.Rid == A.Mid) return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv); else return Hill(A.Rid, B.Mid, B.Rid, A.Rv, B.Mv, B.Rv); } else { if (A.Rv < B.Lv) { if (A.Rid == A.Mid) return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv); else return Hill(A.Rid, B.Mid, B.Rid, A.Rv, B.Mv, B.Rv); } else return B; } } struct Segment { Hill L, M, R; bool pure; Segment() {} Segment(Hill L, Hill M, Hill R, bool pure) : L(L), M(M), R(R), pure(pure) {} Segment operator+(const Segment B) const { Segment Ans; Ans.L = pure ? CLeft(L, B.L) : L; Ans.R = B.pure ? CRight(R, B.R) : B.R; Hill CM = M < B.M ? B.M : M; Ans.M = R + B.L; if (Ans.M < CM) Ans.M = CM; Ans.pure = Ans.M.Len() == Ans.R.Rid - Ans.L.Lid + 1; return Ans; } void Add(const long long D) { L.Lv += D; L.Mv += D; L.Rv += D; M.Lv += D; M.Mv += D; M.Rv += D; R.Lv += D; R.Mv += D; R.Rv += D; } void show() { L.show(); M.show(); R.show(); } }; Segment S[300001 << 2]; long long Add[300001 << 2]; int mm[300001 << 2]; void PushUp(int rt) { S[rt] = S[rt << 1] + S[rt << 1 \| 1]; } void PushDown(int rt) { int ls = rt << 1, rs = ls \| 1; if (Add[rt]) { Add[ls] += Add[rt]; Add[rs] += Add[rt]; S[ls].Add(Add[rt]); S[rs].Add(Add[rt]); Add[rt] = 0; } } void Build(int l, int r, int rt) { if (l == r) { int v; scanf( %d , &v); Hill tempH(l, l, l, v, v, v); S[rt] = Segment(tempH, tempH, tempH, true); return; } int m = mm[rt] = (l + r) >> 1; Build(l, m, rt << 1); Build(m + 1, r, rt << 1 \| 1); PushUp(rt); Add[rt] = 0; } void Update(const int L, const int R, const long long D, const int l, const int r, const int rt) { if (L <= l && r <= R) { Add[rt] += D; S[rt].Add(D); return; } const int m = mm[rt]; PushDown(rt); if (L <= m) Update(L, R, D, l, m, rt << 1); if (R > m) Update(L, R, D, m + 1, r, rt << 1 \| 1); PushUp(rt); } void Search(int l, int r, int rt) { if (l == r) { printf( %d , int(S[rt].L.Lv)); return; } PushDown(rt); int m = (l + r) >> 1; Search(l, m, rt << 1); Search(m + 1, r, rt << 1 \| 1); } int main() { int n, m; while (~scanf( %d , &n)) { Build(1, n, 1); scanf( %d , &m); for (int i = 0; i < m; ++i) { static int l, r, d; scanf( %d%d%d , &l, &r, &d); Update(l, r, d, 1, n, 1); printf( %d n , S[1].M.Len()); } } return 0; }
#include <bits/stdc++.h> using namespace std; pair<int, pair<int, int> > A[2003 * 2003], B[2003 * 2003]; pair<int, int> a[2003], b[2003]; int m, n, r, s, x, y, i, j, asd; long long t1, t2, mn; bool h; int main() { cin >> m; for (i = 1; i <= m; i++) { cin >> a[i].first; t1 += a[i].first; a[i].second = i; } cin >> n; for (i = 1; i <= n; i++) { cin >> b[i].first; t2 += b[i].first; b[i].second = i; } for (i = 1; i <= m; i++) for (j = i + 1; j <= m; j++) A[++r] = make_pair(a[i].first + a[j].first, make_pair(i, j)); for (i = 1; i <= n; i++) for (j = i + 1; j <= n; j++) B[++s] = make_pair(b[i].first + b[j].first, make_pair(i, j)); sort(a + 1, a + m + 1); sort(b + 1, b + n + 1); sort(A + 1, A + r + 1); sort(B + 1, B + s + 1); if (t1 < t2) { h = 1; swap(t1, t2); swap(m, n); swap(r, s); swap(a, b); swap(A, B); } mn = t1 - t2; for (i = j = 1; i <= m; i++) { while (abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first)) > abs(t1 - a[i].first + b[j + 1].first - (t2 - b[j + 1].first + a[i].first)) && j < n) j++; if (mn > abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first))) { mn = abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first)); asd = 1; x = i; y = j; } } for (i = j = 1; i <= r && s; i++) { while (abs(t1 - A[i].first + B[j].first - (t2 - B[j].first + A[i].first)) > abs(t1 - A[i].first + B[j + 1].first - (t2 - B[j + 1].first + A[i].first)) && j < s) j++; if (mn > abs((t1 - A[i].first + B[j].first) - (t2 - B[j].first + A[i].first))) { mn = abs((t1 - A[i].first + B[j].first) - (t2 - B[j].first + A[i].first)); asd = 2; x = i; y = j; } } cout << mn << endl << asd << endl; if (asd == 1) { if (!h) cout << a[x].second << << b[y].second; else cout << b[y].second << << a[x].second; } else if (asd) { if (!h) { cout << A[x].second.first << << B[y].second.first << endl; cout << A[x].second.second << << B[y].second.second; } else { cout << B[y].second.first << << A[x].second.first << endl; cout << B[y].second.second << << A[x].second.second; } } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int t, i, j, n, x, y; cin >> x >> y; bool c = 0; char a; for (i = 0; i < x; i++) { for (j = 0; j < y; j++) { cin >> a; if (a != W && a != B && a != G ) c = 1; } } if (c) puts( #Color ); else puts( #Black&White ); return 0; }
#include <bits/stdc++.h> double const EPS = 3e-8; using namespace std; template <class T> T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a % b) : a); } template <class T> T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); } struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << t ; return this; } } dbg; template <class A, class B> ostream& operator<<(ostream& o, const pair<A, B>& p) { return o << ( << p.first << , << p.second << ) ; } template <class T> ostream& operator<<(ostream& o, const vector<T>& v) { o << [ ; for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it) o << it << , ; return o << ] ; } template <class T> ostream& operator<<(ostream& o, const set<T>& v) { o << [ ; for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it) o << it << , ; return o << ] ; } template <class T> inline bool read(T& x) { int c = getchar(); int sgn = 1; while (~c && c < 0 \|\| c > 9 ) { if (c == - ) sgn = -1; c = getchar(); } for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x 10 + c - 0 ; x *= sgn; return ~c; } int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; const int NX = 1e6 + 10; int fromFront[NX], fromBack[NX]; string a, b; void solve(int cs) { cin >> a >> b; int asz = a.size(); int bsz = b.size(); int backIdx = bsz - 1; int cur = 0; for (int i = asz - 1; i >= 0; i--) { if (backIdx >= 0 && a[i] == b[backIdx]) { backIdx--; cur++; } fromBack[i] = cur; } int frontIdx = 0; cur = 0; for (int i = 0; i < asz; i++) { if (frontIdx < bsz && a[i] == b[frontIdx]) { frontIdx++; cur++; } fromFront[i] = cur; } int low = 0, high = 0; int ans = 0; while (high < asz) { int f = 0, b = 0; if (low > 0) f = fromFront[low - 1]; if (high + 1 < asz) b = fromBack[high + 1]; if (f + b >= bsz) { ans = max(ans, high - low + 1); } else { while (f + b < bsz && low <= high) { low++; f = fromFront[low - 1]; if (high + 1 < asz) b = fromBack[high + 1]; } } high++; } printf( %d n , ans); } int main() { int t = 1; for (int cs = 1; cs <= t; cs++) solve(cs); return 0; }
#include <bits/stdc++.h> int main() { int n, k; while (~scanf( %d%d , &n, &k)) { int ant[55] = {0}; int temp = 0; int count = k; for (int i = 1; i <= n; i++) { scanf( %d , &ant[i - 1]); if (i == k) temp = ant[i - 1]; } if (temp) for (int i = k + 1; i <= n; i++) { if (ant[i - 1] >= temp) count++; else break; } else for (int i = k; i >= 1; i--) { if (!ant[i - 1]) count--; } printf( %d n , count); } return 0; }
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << << *it << = << a; err(++it, args...); } template <typename T, typename U> inline void min_self(T& x, U y) { if (y < x) x = y; } template <typename T, typename U> inline void max_self(T& x, U y) { if (x < y) x = y; } template <class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> pair) { return out << ( << pair.first << , << pair.second << ) ; } template <class T> ostream& operator<<(ostream& out, vector<T> vec) { out << ( ; for (auto& v : vec) out << v << , ; return out << ) ; } template <class T> ostream& operator<<(ostream& out, set<T> vec) { out << ( ; for (auto& v : vec) out << v << , ; return out << ) ; } template <class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out << ( ; for (auto& v : vec) out << [ << v.first << , << v.second << ] ; return out << ) ; } template <class A, class B> istream& operator>>(istream& in, pair<A, B>& a) { return in >> a.first >> a.second; } template <class A> istream& operator>>(istream& in, vector<A>& a) { for (A& i : a) in >> i; return in; } long long XX[4] = {-1, 0, 1, 0}; long long YY[4] = {0, -1, 0, 1}; void solve() { long long n, res = 0; cin >> n; vector<pair<long long, long long>> a(n); for (long long i = 0; i <= n - 1; i++) cin >> a[i]; sort(a.begin(), a.end()); long long maxi = a[0].second; for (long long i = 1; i <= n - 1; i++) { if (a[i].second < maxi && a[i].first > a[i - 1].first) { res++; } max_self(maxi, a[i].second); } cout << res << n ; return; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; while (t--) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int N, K; cin >> N >> K; double res = 0; long double t1x, t1y, t2x, t2y; cin >> t1x >> t1y; for (int i = 1; i < N; ++i) { t2x = t1x; t2y = t1y; cin >> t1x >> t1y; res += sqrt((t1x - t2x) * (t1x - t2x) + (t1y - t2y) * (t1y - t2y)); } printf( %.15lf n , res * K / 50); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 100005; int down[N], sz[N], up[N], n; vector<pair<int, bool> > adj[N]; void dfs(int s, int p) { sz[s] = 1; for (auto it : adj[s]) { if (it.first != p) { dfs(it.first, s); sz[s] += sz[it.first]; if (it.second) down[s] += sz[it.first]; else down[s] += down[it.first]; } } } void dfs2(int s, int p) { for (auto it : adj[s]) { if (it.first != p) { if (it.second) up[it.first] = n - sz[it.first]; else up[it.first] = down[s] - down[it.first] + up[s]; dfs2(it.first, s); } } } int main() { int i; scanf( %d , &n); for (i = 0; i < n - 1; i++) { int a, b, c, te; bool flag = true; scanf( %d%d%d , &a, &b, &c); while (c > 0) { if (c % 10 == 4 \|\| c % 10 == 7) ; else flag = false; c /= 10; } adj[a - 1].push_back(make_pair(b - 1, flag)); adj[b - 1].push_back(make_pair(a - 1, flag)); } long long ans = 0; dfs(0, -1); dfs2(0, -1); for (i = 0; i < n; i++) { long long temp = up[i] + down[i]; ans += temp * (temp - 1); } cout << ans; }
#include <bits/stdc++.h> double p[1010][1010]; int a[1010]; int n, m; int main() { double t, ans; int i, j, x, y; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) if (a[i] > a[j]) p[i][j] = 1; else p[i][j] = 0; for (i = 1; i <= m; i++) { scanf( %d%d , &x, &y); p[x][y] = 0.5; p[y][x] = 0.5; for (j = 1; j <= n; j++) if ((j != x) && (j != y)) { t = (p[j][x] + p[j][y]) * 0.5; p[j][x] = t; p[x][j] = 1 - t; p[j][y] = t; p[y][j] = 1 - t; } } ans = 0; for (i = 1; i <= n - 1; i++) for (j = i + 1; j <= n; j++) ans += p[i][j]; printf( %.10lf n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int one, two, three, four; bool check(deque<int> x) { int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0; for (int i = 0; i < x.size(); i++) { if (x[i] == 0) cnt1++; if (x[i] == 1) cnt2++; if (x[i] == 2) cnt3++; if (x[i] == 3) cnt4++; } if (cnt1 == one && cnt2 == two && cnt3 == three & cnt4 == four) { for (int i = 0; i + 1 < x.size(); i++) { if (abs(x[i] - x[i + 1]) != 1) return 0; } cout << YES << n ; for (int i : x) cout << i << ; exit(0); } return 0; } deque<int> merge(deque<int> x, deque<int> y) { for (int i : y) x.push_back(i); return x; } void go2(pair<int, int> a, pair<int, int> b, deque<int> ans) { deque<int> ans2 = ans; if (a.first < b.first) { for (int i = 0; i < a.first; i++) { ans.push_back(b.second); ans.push_back(a.second); } ans.push_back(b.second); } else { for (int i = 0; i < b.first; i++) { ans.push_back(a.second); ans.push_back(b.second); } if (a.first != b.first) ans.push_back(a.second); } check(ans); ans = ans2; if (a.first <= b.first) { for (int i = 0; i < a.first; i++) { ans.push_back(b.second); ans.push_back(a.second); } if (a.first != b.first) ans.push_back(b.second); } else { for (int i = 0; i < b.first; i++) { ans.push_back(a.second); ans.push_back(b.second); } if (a.first != b.first) ans.push_back(a.second); } ans = ans2; deque<int> zl; if (a.first < b.first) { for (int i = 0; i < a.first; i++) { zl.push_back(b.second); zl.push_back(a.second); } zl.push_back(b.second); } else { for (int i = 0; i < b.first; i++) { zl.push_back(a.second); zl.push_back(b.second); } if (a.first != b.first) zl.push_back(a.second); } check(merge(zl, ans)); zl.clear(); if (a.first <= b.first) { for (int i = 0; i < a.first; i++) { zl.push_back(b.second); zl.push_back(a.second); } if (a.first != b.first) zl.push_back(b.second); } else { for (int i = 0; i < b.first; i++) { zl.push_back(a.second); zl.push_back(b.second); } if (a.first != b.first) zl.push_back(a.second); } check(merge(zl, ans)); } void go3(pair<int, int> a, pair<int, int> b, pair<int, int> c, deque<int> cur) { deque<int> ans; if (a.first <= b.first) { for (int i = 0; i < a.first; i++) { ans.push_back(a.second); ans.push_back(b.second); } go2(pair<int, int>(b.first - a.first, b.second), c, merge(cur, ans)); go2(pair<int, int>(b.first - a.first, b.second), c, merge(ans, cur)); ans.clear(); for (int i = 0; i < a.first; i++) { ans.push_back(b.second); ans.push_back(a.second); } go2(pair<int, int>(b.first - a.first, b.second), c, merge(cur, ans)); go2(pair<int, int>(b.first - a.first, b.second), c, merge(ans, cur)); } ans.clear(); if (c.first <= b.first) { for (int i = 0; i < c.first; i++) { ans.push_back(c.second); ans.push_back(b.second); } go2(a, pair<int, int>(b.first - c.first, b.second), merge(cur, ans)); go2(a, pair<int, int>(b.first - c.first, b.second), merge(ans, cur)); ans.clear(); for (int i = 0; i < c.first; i++) { ans.push_back(b.second); ans.push_back(c.second); } go2(a, pair<int, int>(b.first - c.first, b.second), merge(cur, ans)); go2(a, pair<int, int>(b.first - c.first, b.second), merge(ans, cur)); } } void go4(int a, int b, int c, int d) { if (a <= b) { deque<int> lul; for (int i = 0; i < a; i++) { lul.push_back(0); lul.push_back(1); } go3(pair<int, int>(b - a, 1), pair<int, int>(c, 2), pair<int, int>(d, 3), lul); lul.clear(); for (int i = 0; i < a; i++) { lul.push_back(1); lul.push_back(0); } go3(pair<int, int>(b - a, 1), pair<int, int>(c, 2), pair<int, int>(d, 3), lul); } if (d <= c) { deque<int> lul; for (int i = 0; i < d; i++) { lul.push_back(3); lul.push_back(2); } go3(pair<int, int>(a, 0), pair<int, int>(b, 1), pair<int, int>(c - d, 2), lul); lul.clear(); for (int i = 0; i < d; i++) { lul.push_back(2); lul.push_back(3); } go3(pair<int, int>(a, 0), pair<int, int>(b, 1), pair<int, int>(c - d, 2), lul); } } int main() { cin >> one >> two >> three >> four; go4(one, two, three, four); cout << NO ; return 0; }
#include <bits/stdc++.h> using namespace std; long long range(long long L) { switch (L & 3) { case 0: return L; case 1: return 1; case 2: return L + 1; case 3: return 0; } } int main() { for (int N; cin >> N;) { long long sum = 0; for (int i = 0; i < (int)(N); ++i) { long long m, x; cin >> x >> m; long long b = range(x - 1); long long a = range(x + m - 1); sum ^= b; sum ^= a; } if (sum == 0) cout << bolik << endl; else cout << tolik << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; struct trie { char ch; int son, next, father, suffix; vector<int> danger; int sum; }; trie a[205]; int now, m; void clear(int x) { a[x].son = a[x].next = 0; a[x].danger.clear(); } void insert(char s, int l, int t, int x) { if (!a[x].son) { a[x].son = ++m; clear(m); a[m].father = x; a[m].ch = s[t]; if (t + 1 == l) a[m].danger.push_back(now); else insert(s, l, t + 1, m); return; } int i = a[x].son; while (1) { if (!a[i].next \|\| a[i].ch == s[t]) break; i = a[i].next; } if (a[i].ch == s[t] && t + 1 == l) a[i].danger.push_back(now); else if (a[i].ch == s[t]) insert(s, l, t + 1, i); else { a[i].next = ++m; clear(m); a[m].father = x; a[m].ch = s[t]; if (t + 1 == l) a[m].danger.push_back(now); else insert(s, l, t + 1, m); } } int q[205]; int child(int x, char ch) { for (int i = a[x].son; i; i = a[i].next) if (a[i].ch == ch) return (i); if (x == 1) return (1); return (child(a[x].suffix, ch)); } void build_trie() { int l, r; l = r = 1; q[1] = 1; while (l <= r) { int x = q[l++]; for (int i = a[x].son; i; i = a[i].next) q[++r] = i; } a[1].suffix = 1; for (int i = 2; i <= r; i++) { int x = q[i]; if (a[x].father == 1) { a[x].suffix = 1; continue; } a[x].suffix = child(a[a[x].father].suffix, a[x].ch); for (int j = 0; j < (int)a[a[x].suffix].danger.size(); j++) a[x].danger.push_back(a[a[x].suffix].danger[j]); } } int n, base, k; void read(char s) { int l; scanf( %d , &l); s[l] = 0 ; for (int i = 0; i < l; ++i) { int a; scanf( %d , &a); s[i] = a + a ; } } int v[205]; char l[205], r[205], s[205]; const int MOD = 1000000007; int curl; char cur[205]; int f[205][205][505]; int dp(int i, int state, int sum, bool cmp, bool first) { if (sum > k) { return 0; } if (i == 0) { return 1; } if (!first && !cmp && f[i][state][sum] != -1) { return f[i][state][sum]; } int ret = 0; int r = cur[curl - i] - a ; for (int d = first; d < base; ++d) { if (cmp && d > r) { continue; } int nstate = child(state, d + a ), nsum = sum + a[nstate].sum; bool ncmp = cmp && d == r; ret += dp(i - 1, nstate, nsum, ncmp, false); if (ret >= MOD) { ret -= MOD; } } if (!cmp && !first) { f[i][state][sum] = ret; } return ret; } int cal(char s) { int l = strlen(s); curl = l; for (int i = 0; i < l; ++i) { cur[i] = s[i]; } int ret = 0; while (curl) { ret += dp(curl, 1, 0, curl == l, true); --curl; if (ret >= MOD) { ret -= MOD; } } return ret; } int check(char s) { int sum = 0, cur = 1, l = strlen(s); for (int i = 0; i < l; ++i) { cur = child(cur, s[i]); sum += a[cur].sum; } return sum <= k; } int main() { memset(f, -1, sizeof(f)); scanf( %d%d%d , &n, &base, &k); read(l), read(r); clear(m = 1); for (int i = 0; i < n; i++) { read(s); scanf( %d , v + i); now = i; insert(s, strlen(s), 0, 1); } build_trie(); for (int i = 1; i <= m; ++i) { a[i].sum = 0; for (int j = 0; j < (int)a[i].danger.size(); ++j) { a[i].sum += v[a[i].danger[j]]; } } long long ansl = cal(l), ansr = cal(r); cout << ((ansr - ansl + check(l)) % MOD + MOD) % MOD << endl; return 0; }
#include <bits/stdc++.h> #include <cmath> #include <regex> #define ff first #define ss second #define pb push_back #define mp make_pair #define ba back #define ppb pop_back #define eb emplace_back #define eps 1e-6 #define vec vector<long long int> #define sz(x) (int((x.size()))) #define all(x) (x).begin(),(x).end() #define FAST ios_base :: sync_with_stdio (false); cin.tie (NULL) #define ll long long #define loop(i,s,n) for(int i=s;i<n;i++) using namespace std; //----------------------------------------------------------------------------------------------------------------- const ll M = 1e9 + 7; const ll N = 2e5 + 5; const ll inf = 2e18; ll mod(ll x){ return (x%M);} ll mod_minus(ll a, ll b){ ll ans= (mod(a)-mod(b)); if(ans<0) ans=mod(ans+M); return ans;} ll mod_mul(ll a,ll b){ return mod(mod(a)mod(b));} ll mod_add(ll a,ll b){ return mod(a+b);} ll power(ll a,ll n){ if(n==0) return 1; else if(n==1) return a; ll R=power(a,n/2)%M; if(n%2==0) { return mod(mod_mul(R,R)); } else { return mod(mod_mul(mod_mul(R,a),mod(R))); } } ll mod_inv(ll n){ return power(n,M-2);} // only if M is prime ll mod_div(ll a,ll b){ ll ans=mod(a); ll b1=power(b,M-2); ans= mod(mod_mul(ans,b1)); return ans; } ll fact_mod(ll n){ vec fact(n+1); fact[0]=1; loop(i,1,n+1){ fact[i]=mod_mul(fact[i-1],i); } return fact[n]; } unsigned long long nCr_mod(unsigned long long n, ll r) { if (r == 0) return 1; unsigned long long fac[n + 1]; fac[0] = 1; for (int i = 1; i <= n; i++) fac[i] = (fac[i - 1] i) % M; return (fac[n] * mod_inv(fac[r]) % M * mod_inv(fac[n - r]) % M) % M; } //-------------------------------------------------------------------------------------------------------------- void solve(){ ll n; cin>>n; ll a[n]; ll sum=0; loop(i,0,n){ cin>>a[i]; sum+=a[i]; } sort(a,a+n); ll mx=a[n-1],mn=a[0]; ll z=(n-1)-sum%(n-1); if(z==(n-1)){ z=0; } sum+=z; if(mx<=sum/(n-1)){ cout<<z<<endl; return; } cout<<mx*(n-1)-sum+z<<endl; } int main(){ FAST; int t; cin>>t; while(t--){ solve(); } }
#include <bits/stdc++.h> using namespace std; int read() { int x; scanf( %d , &x); return x; } const int N = 1123456; int a[N]; vector<int> v[N]; int c[N]; priority_queue<int> q[N]; void dfs(int x, int t) { c[x] = t; q[t].push(a[x]); for (int i = 0; i < v[x].size(); i++) { int to = v[x][i]; if (!c[to]) { dfs(to, t); } } } int main() { int n, m, i, j, x, y; n = read(); m = read(); for (i = 1; i <= n; i++) { a[i] = read(); } for (i = 1; i <= m; i++) { x = read(); y = read(); v[x].push_back(y); v[y].push_back(x); } int cnt = 1; for (i = 1; i <= n; i++) { if (!c[i]) { dfs(i, cnt++); } } for (i = 1; i <= n; i++) { printf( %d , q[c[i]].top()); q[c[i]].pop(); } }
#include <bits/stdc++.h> using namespace std; stack<pair<int, int> > a; int main() { int n, m = 0, i = 1; cin >> n; while (n--) { int b, c; char d, e, f[40]; scanf( ); scanf( %c , &d); scanf( %d%c%d , &b, &e, &c); gets(f); b %= 12; if (f[1] == p ) b += 12; if (m) { if ((b < a.top().first) \|\| (b == a.top().first && c < a.top().second)) ; else m--; if (b == a.top().first && c == a.top().second) i++; else i = 1; } if (i > 10) { m++; i -= 10; } a.push({b, c}); m++; } cout << m << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long long maxn = 100010; const long long inf = 1e9 + 7; long long n, a[maxn]; long long minv = inf; long long sum[3]; int main() { scanf( %I64d , &n); for (long long i = 1; i <= n; i++) { scanf( %I64d , &a[i]); minv = min(minv, a[i]); } for (long long i = 1; i <= n; i++) a[i] -= minv; for (long long i = 1; i <= n; i++) sum[a[i]]++; sort(a + 1, a + n + 1); if (a[n] < 2) { printf( %I64d n , n); for (long long i = 1; i <= n; i++) printf( %I64d , a[i] + minv); return 0; } else { long long temp = min(sum[0], sum[2]); long long temp2 = sum[1] >> 1; if (temp > temp2) { sum[1] += (temp << 1); sum[0] -= temp; sum[2] -= temp; } else { temp = temp2; sum[1] -= (temp << 1); sum[0] += temp; sum[2] += temp; } printf( %I64d n , n - (temp << 1)); for (long long i = 0; i < 3; i++) for (long long j = 1; j <= sum[i]; j++) printf( %I64d , i + minv); } return 0; }
#include <bits/stdc++.h> using namespace std; inline long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); } long long n, k, x, type(1), amt, box; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for (int i = 1; i <= k; i++) { cin >> x; if (x * (n / x) > amt) { amt = x * (n / x); box = n / x; type = i; } } cout << type << << box << endl; }
#include <bits/stdc++.h> using namespace std; void debug_out() { cerr << endl; } void clock_out() { cerr << nTime Elapsed : << 1.0 * clock() / CLOCKS_PER_SEC << s n ; } void fileio() { freopen( /home/dwai/Desktop/cp/input.txt , r , stdin); freopen( /home/dwai/Desktop/cp/output.txt , w , stdout); freopen( /home/dwai/Desktop/cp/debug.txt , w , stderr); } void ofileio() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << H; debug_out(T...); } int IT_MAX = 1 << 20; const long long MOD = 1000000007; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1); const double ERR = 1e-10; int main() { 42; ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand(time(NULL)); long long n, m; cin >> n >> m; long long a[n], b[m]; long long i; long long mn = 0, mx = 0; for (i = 0; i < n; i++) { cin >> a[i]; if (i == 0) { mx = a[i]; mn = a[i]; } else mx = max(mx, a[i]); mn = min(mn, a[i]); } long long ans = mn * 2; for (i = 0; i < n; i++) { if (a[i] > ans) ans = a[i]; } for (i = 0; i < m; i++) { cin >> b[i]; if (b[i] <= ans) return cout << -1, 0; } cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int N, K; int T[200005]; vector<int> danger; vector<pair<int, int> > v; bool cf(pair<int, int> x, pair<int, int> y) { return x.second * y.first > y.second * x.first; } int main() { scanf( %d %d , &N, &K); for (int i = 0; i < N; i++) { scanf( %d , &T[i]); if (T[i] < 0) { danger.push_back(i); } } if (danger.size() > K) puts( -1 ); else { int change = danger.size() * 2; K -= danger.size(); for (int i = 0; i < (int)danger.size(); i++) { if (i == danger.size() - 1) v.push_back(make_pair(N - danger[i] - 1, 1)); else v.push_back(make_pair(danger[i + 1] - danger[i] - 1, 2)); } sort(v.begin(), v.end(), cf); int idx = 0; while (idx < v.size()) { if (K - v[idx].first >= 0) { K -= v[idx].first; change -= v[idx].second; } idx++; } printf( %d n , change); } return 0; }
#include <bits/stdc++.h> #define ff first #define ss second #define ll long long #define ld long double #define pb push_back #define eb emplace_back #define mp make_pair #define mt make_tuple #define pii pair<int, int> #define pll pair<ll,ll> #define vi vector<int> #define vl vector<ll> #define vii vector<pii> #define sws ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define endl n #define teto(a, b) ((a+b-1)/(b)) using namespace std; // Extra #define forn(i, n) for(int i = 0; i < (int)n; i++) #define forne(i, a, b) for(int i = a; i <= b; i++) #define all(x) x.begin(), x.end() #define dbg(msg, var) cout << msg << << var << endl; // const int MAX = 200010; const ll MOD = (int)1e9 +7; const int INF = 1e9; const ll LLINF = 0x3f3f3f3f3f3f3f3f; const ld EPS = 1e-8; int n, l, r, s; vector<vector<bool>> tab; vector<vector<bool>> btab; int dp(int idx, int soma) { if(soma > s) return 0; if(idx >= n) { return (soma == s); } if(btab[idx][soma]) return tab[idx][soma]; // cout << idx << << soma << endl; int res = 0; int pega = dp(idx+1, soma + idx+1); int npega = dp(idx+1, soma); if(npega >= pega) { res = npega; } else { res = pega; } btab[idx][soma] = true; return tab[idx][soma] = res; } vi solve(vi vals, int sz, bool& ruim) { int t = vals.size(); vi foi(n+1, 0); forn(i, t) foi[vals[i]] = 1; ruim = false; while(t < sz and !ruim) { bool brk = false; forne(i, 1, n) { if(!foi[i]) continue; forne(j, 1, i-1) { if(j == i-j) continue; if(!foi[j] and !foi[i-j]) { foi[i] = 0; foi[j] = 1; foi[i-j] = 1; t++; brk = true; break; } } if(brk) break; } if(!brk) ruim = true; } return foi; } int32_t main() { // sws; int t; cin >> t; while(t--) { cin >> n >> l >> r >> s; tab.assign(n, vector<bool>(s+1, -1)); btab.assign(n, vector<bool>(s+1, 0)); bool win = dp(0, 0); if(win) { vi vals, p(n+1, -1); set<int> pos; forne(i, 1, n) pos.insert(i); int idx = 0, soma = 0; while(idx < n) { if(dp(idx+1, soma)) { idx++; } else { soma += idx+1; vals.pb(idx+1); idx++; } } if(vals.size() > (r-l+1)) { cout << -1 << endl; continue; } bool ruim; // for(auto val : vals) cout << val << ; // cout << endl; vi foi = solve(vals, (r-l+1), ruim); // cout << ruim = << ruim << endl; // forne(i, 1, n) cout << foi[i] << ; // cout << endl; if(ruim) cout << -1 << endl; else { int id1 = 1, id2 = 1; forne(i, 1, n) { if(l <= i and i <= r) { while(id1 <= n and !foi[id1]) id1++; cout << id1 << ; id1++; } else { while(id2 <= n and foi[id2]) id2++; cout << id2 << ; id2++; } } cout << endl; } } else { cout << -1 << endl; } } // verificar limites, long long return 0; }
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimization( unroll-loops ) std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}, {-1, 1}, {-1, -1}, {1, 1}, {1, -1}}; using namespace std; const long long mod = 998244353; long long nop = 70; vector<int> primes(nop + 1, 1); void sieve() { primes[1] = primes[0] = 0; for (long long i = 2; i * i <= nop; i++) { if (primes[i]) { for (long long j = i * i; j <= nop; j += i) { primes[j] = 0; } } } } long long gcd(long long a, long long b) { if (b > a) swap(b, a); if (b == 0) return a; return gcd(b, a % b); } void extgcd(long long a, long long b, long long& x, long long& y) { if (a == 0) { x = a; y = b; return; } extgcd(b % a, a, x, y); long long y1 = y, x1 = x; x = y1 - (b / a) * x1; y = x1; } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } long long bexp(long long num, long long e) { long long ans = 1; while (e > 0) { if (e & 1) { ans = num; } num = num; e >>= 1; } return ans; } long long mexp(long long num, long long e) { long long ans = 1; while (e > 0) { if (e & 1) { ans = (ans * num) % mod; } num *= num; num %= mod; e >>= 1; } return ans % mod; } long long modinv(long long a) { a %= mod; return mexp(a, mod - 2); } void solve() { long long n, k; cin >> n >> k; string s; cin >> s; sort(s.begin(), s.end()); vector<long long> cnt(26, 0); for (long long i = 0; i < (n); i++) { cnt[s[i] - a ]++; } int first = -1, last = -1, nod = 0; for (long long i = 0; i < (26); i++) { if (cnt[i]) { nod++; if (first == -1) first = i; last = i; } } if (cnt[first] < k) { cout << s[k - 1] << n ; return; } string worst = ; worst += char( a + first); if (nod >= 3 \|\| (nod == 2 && cnt[first] > k)) { for (long long i = k; i < n; i++) { worst += s[i]; } } else { for (long long i = k; i < n; i++) { worst += s[i]; i += (k - 1); } } cout << worst << n ; } int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); int t = 1; cin >> t; for (long long T = 1; T <= (t); T++) { solve(); } return 0; }
#include <bits/stdc++.h> using namespace std; char str[100010]; int ct[100010][4]; int main() { int N, x[5], R, L, M; scanf( %s , str); N = strlen(str); for (int i = 1; i <= N; i++) { for (int j = 0; j < 3; j++) ct[i][j] = ct[i - 1][j]; ct[i][str[i - 1] - x ]++; } scanf( %d , &M); for (int i = 0; i < M; i++) { scanf( %d%d , &L, &R); L--; if (R - L < 3) { puts( YES ); continue; } for (int j = 0; j < 3; j++) x[j] = ct[R][j] - ct[L][j]; if (x[0] <= x[1] && x[1] <= x[2] && x[2] - x[0] <= 1) puts( YES ); else if (x[1] <= x[2] && x[2] <= x[0] && x[0] - x[1] <= 1) puts( YES ); else if (x[2] <= x[0] && x[0] <= x[1] && x[1] - x[2] <= 1) puts( YES ); else puts( NO ); } return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n, a[maxn]; struct node { int pre; bool flag; int other; } num[2 * maxn]; int main(int argc, char const *argv[]) { while (cin >> n) { bool flag = true; for (int i = 0; i <= n; i++) { cin >> a[i]; if (a[i] != 1) flag = false; } if (flag == true) { cout << perfect << endl; continue; } bool temp = false; bool ans = false; int cnt = 1; for (int i = 0; i <= n; i++) { if (i > 0 && a[i] > 1 && a[i - 1] > 1 && ans == false) { ans = true; int par = cnt - 1; int k = a[i]; k--; while (k--) { num[cnt].pre = par; num[cnt].other = par - 1; num[cnt].flag = true; cnt++; } num[cnt].pre = num[cnt].other = par; num[cnt].flag = true; cnt++; } else { int par = cnt - 1; int k = a[i]; while (k--) { num[cnt].pre = par; num[cnt].flag = false; cnt++; } } } if (ans == false) { cout << perfect << endl; continue; } cout << ambiguous << endl; for (int i = 1; i < cnt; i++) cout << num[i].pre << ; cout << endl; for (int i = 1; i < cnt; i++) { if (num[i].flag == false) cout << num[i].pre; else cout << num[i].other; cout << ; } cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int mymax(int x) { int max = 0; while (x) { int s = x % 10; if (s > max) max = s; x /= 10; } return max; } int zh(int x, int n) { int s = 0, p = 1; while (x) { s += x % 10 * p; x /= 10; p *= n; } return s; } int main() { int a, b; cin >> a >> b; int n = max(mymax(a), mymax(b)) + 1; int num = zh(a, n) + zh(b, n); int j = 0; while (num) { int s = num % n; num /= n; j++; } cout << j << endl; return 0; }
#include <bits/stdc++.h> using namespace std; class Constellation { static const long long N = 100010; inline long long sign(long long x) { return x > 0 ? 1 : x == 0 ? 0 : -1; } struct point { long long x, y, num; } b[N]; long long n; long long cross(const point &a, const point &b, const point &c) { return sign((b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x)); } bool contain(const point &a, const point &b, const point &c, const point &p) { long long v1 = cross(a, b, p), v2 = cross(b, c, p), v3 = cross(c, a, p); return v1 * v2 >= 0 && v2 * v3 >= 0 && v3 * v1 >= 0; } public: void solve() { cin >> n; for (long long i = 1; i <= n; ++i) cin >> b[i].x >> b[i].y; long long p1 = 1, p2 = 2, p3 = 0; for (long long i = 3; i <= n; ++i) if (cross(b[p1], b[p2], b[i])) { p3 = i; break; } for (long long i = 1; i <= n; ++i) if (i != p1 && i != p2 && i != p3 && contain(b[p1], b[p2], b[p3], b[i])) { if (cross(b[p1], b[p2], b[i])) p3 = i; else p2 = i; } cout << p1 << << p2 << << p3 << endl; } } T; int main() { T.solve(); }
#include <bits/stdc++.h> double eps = 1e-9; using namespace std; int main() { std::ios::sync_with_stdio(false); int x, y, z, w, b, a; cin >> x >> y >> z >> w >> b >> a; cout << (2 * (2 * x + a + y) * (z + y) - (a * a + b * b + y * y + z * z)) / 2; return 0; }
#include <bits/stdc++.h> using namespace std; int dirx[] = {1, 0, -1, 0}; int diry[] = {0, 1, 0, -1}; int a; vector<int> graph[100005]; int dist[100005]; bool visit[100005]; int cnt = 0; bool flag = false; int dfs(int u, int par) { visit[u] = true; for (int i = 0; i < graph[u].size(); i++) { if (!visit[graph[u][i]]) dist[u] += dfs(graph[u][i], u); } if (dist[u] != 0 && (dist[u] + 1) % 2 == 0) { cnt++; dist[u] = 0; return 0; } else return 1; } int main() { scanf( %d , &a); int x, y; int start = 0; for (int i = 0; i < a - 1; i++) { scanf( %d %d , &x, &y); start = x; graph[x].push_back(y); graph[y].push_back(x); } if (a % 2 == 1) { cout << -1 << endl; return 0; } dfs(start, 0); cout << cnt - 1 << endl; }
#include <bits/stdc++.h> #pragma comment(linker, /STACK:167772160000 ) using namespace std; long long dp[5100][5100]; long long x[5100]; int a[5100], b[5100], c[5100], d[5100]; int main() { int leftminright = 0; int n, s, e; cin >> n >> s >> e; s--; e--; for (int i = 0; i < n; i++) cin >> x[i]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; for (int i = 0; i < n; i++) cin >> c[i]; for (int i = 0; i < n; i++) cin >> d[i]; x[n] = 0; for (int i = 0; i < n + 2; i++) for (int j = 0; j < n + 2; j++) dp[i][j] = 1E18; dp[0][0] = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i != 0) { if (j == 0 && leftminright != 1) continue; } if (i == s) { leftminright--; long long now = dp[i][j]; now += d[i]; dp[i + 1][j + 1] = min(dp[i + 1][j + 1], now + (x[i + 1] - x[i]) * ((j + 1) * 2 + leftminright)); now -= d[i]; now += c[i]; if (j + leftminright + 1 > 0) dp[i + 1][j] = min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); leftminright++; continue; } if (i == e) { leftminright++; long long now = dp[i][j]; now += b[i]; dp[i + 1][j] = min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); now -= b[i]; now += a[i]; if (j == 0) { leftminright--; continue; } dp[i + 1][j - 1] = min(dp[i + 1][j - 1], now + (x[i + 1] - x[i]) * (2 * (j - 1) + leftminright)); leftminright--; continue; } long long now = dp[i][j]; now += b[i]; now += d[i]; dp[i + 1][j + 1] = min(dp[i + 1][j + 1], now + (x[i + 1] - x[i]) * ((j + 1) * 2 + leftminright)); now -= d[i]; now += c[i]; if (j + leftminright > 0) dp[i + 1][j] = min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); now -= b[i]; now += a[i]; now -= c[i]; now += d[i]; if (j > 0) dp[i + 1][j] = min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); now -= d[i]; now += c[i]; if (j > 0 && j + leftminright > 0) dp[i + 1][j - 1] = min(dp[i + 1][j - 1], now + (x[i + 1] - x[i]) * ((j - 1) * 2 + leftminright)); } if (i == s) leftminright--; if (i == e) leftminright++; } cout << dp[n][0]; return 0; }
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double EPS = 1e-8; const long long INF = 0x3f3f3f3f3f3f3f3f; inline long long readll() { long long x(0), op(1); char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) op = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x * op; } const int sz = 2e5 + 9; long long a[sz], n; long long solve(long long a, long long b) { if (a == 0 \|\| a == b) return 0; int l = 1, r = n; if (b) { if (b < a) l = b + 1; else r = b - 1; } return (a - l + 1) * (r - a + 1); } int main() { n = readll(); for (int i = 1; i < n + 1; ++i) a[i] = readll(); a[0] = a[n + 1] = 0; long long ans = 0; for (int i = 0; i < n + 1; ++i) { ans += solve(a[i], a[i + 1]); ans += solve(a[i + 1], a[i]); } cout << ans / 2 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const int max_n = 200222, inf = 1000111222; int n, m, a[max_n]; bool check(int cnt) { long long sum = 0; int last = 1; for (int i = 0; i < n; ++i) { if (i % cnt == 0) --last; if (a[i] + last < 0) break; sum += (a[i] + last); } return sum >= m; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); sort(a, a + n); reverse(a, a + n); int l = 0, r = n + 1; while (r - l > 1) { int mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid; } if (r > n) puts( -1 ); else printf( %d n , r); return 0; }
#include <bits/stdc++.h> using namespace std; long long t[4 * 100100], dp[100100], a[100100], b[100100]; long long K = 1, n, m; void build() { while (K < m + 2) K <<= 1; } long long query(long long l, long long r) { long long ans = 0; for (l += K - 1, r += K + 1; l ^ r ^ 1; l >>= 1, r >>= 1) { if (~l ^ 1) ans = ((ans) >= (t[l + 1]) ? (ans) : (t[l + 1])); if (r ^ 1) ans = ((ans) >= (t[r - 1]) ? (ans) : (t[r - 1])); } return ans; } void update(long long id, long long v) { for (t[id += K] = v, id >>= 1; id >= 1; id >>= 1) t[id] = max(t[id << 1 \| 1], t[id << 1]); } long long get_id(long long x) { long long l = 1, r = m, mid; while (l < r) { mid = (l + r + 1) >> 1; if (b[mid] > x) r = mid - 1; else l = mid; } return l; } void unique() { m = 1; for (long long i = 2; i <= n; i++) if (b[i] != b[m]) b[++m] = b[i]; } void input() { scanf( %I64d , &n); for (long long i = 1, r, h; i <= n; i++) { scanf( %I64d%I64d , &r, &h); a[i] = b[i] = r * r * h; } return; } void init() { sort(b + 1, b + n + 1); unique(); build(); return; } void work() { for (long long i = 1; i <= n; i++) { long long id = get_id(a[i]); dp[i] = query(1, id - 1) + a[i]; update(id, dp[i]); } return; } void output() { printf( %.15lf , query(1, m) * M_PI); return; } int main() { input(); init(); work(); output(); return 0; }
#include <bits/stdc++.h> using namespace std; int n, k, c[100005], visit[100005], tp = 0; vector<int> a[100005], ans; bool ok[100005]; void dfs(int u) { visit[u] = tp; for (int i = 0; i < a[u].size(); i++) { int v = a[u][i]; if (ok[v]) continue; if (visit[v] == tp) { cout << -1; exit(0); } else dfs(v); } ans.push_back(u); ok[u] = 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for (int i = 1; i <= k; i++) cin >> c[i]; for (int i = 1; i <= n; i++) { int t; cin >> t; while (t--) { int u; cin >> u; a[i].push_back(u); } } for (int i = 1; i <= k; i++) { if (!visit[c[i]]) { tp++; dfs(c[i]); } } cout << ans.size() << n ; for (int i = 0; i < ans.size(); i++) cout << ans[i] << ; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long int sum = n * (n - 1) / 2; if (n == 0) { cout << 0; return 0; } if ((n % 2 == 0 && n % 4 != 0) \|\| (n % 2 == 1 && n % 4 != 3)) cout << 1; else cout << 0; return 0; }
#include <bits/stdc++.h> using namespace std; template <typename F, typename S> ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; typename vector<T>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << it; } return os << } ; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { os << [ ; typename set<T>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << it; } return os << ] ; } template <typename F, typename S> ostream &operator<<(ostream &os, const map<F, S> &v) { os << [ ; typename map<F, S>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << it->first << = << it->second; } return os << ] ; } int n, m; string hor, ver; int give_dir(char ch) { if (ch == > \|\| ch == v ) return 1; else return -1; } bool valid(int x, int y) { if (x < 0 \|\| y < 0 \|\| x >= n \|\| y >= m) return false; return true; } void dfs(int x, int y, vector<vector<bool> > &visited) { visited[x][y] = true; int nx, ny; nx = x + give_dir(ver[y]); ny = y + give_dir(hor[x]); if (valid(nx, y) && !visited[nx][y]) dfs(nx, y, visited); if (valid(x, ny) && !visited[x][ny]) dfs(x, ny, visited); } int main() { cin >> n >> m; cin >> hor >> ver; for (int k = 0; k < (n); k++) { for (int l = 0; l < (m); l++) { vector<vector<bool> > visited(n, vector<bool>(m, false)); dfs(k, l, visited); for (int i = 0; i < (n); i++) { for (int j = 0; j < (m); j++) { if (!visited[i][j]) { cout << NO << endl; return 0; } } } } } cout << YES << endl; return 0; }
#include <bits/stdc++.h> template <class T> void cxk(T& a, T b) { a = a > b ? a : b; } template <class T> void cnk(T& a, T b) { a = a < b ? a : b; } long long gi() { long long x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) f ^= ch == - , ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f ? x : -x; } int col[200010], f[200010][2][2][2], p2[400010]; void inc(int& x, int y) { x = x + y >= 1000000007 ? x + y - 1000000007 : x + y; } int main() { int n = gi(), p = gi(); for (int i = 1; i <= n; ++i) col[i] = gi(); p2[0] = 1; for (int i = 1; i <= n + n; ++i) p2[i] = 2 * p2[i - 1] % 1000000007; f[1][0][0][0] = 1; for (int i = 1; i <= n; ++i) for (int j = 0; j < 2; ++j) for (int k = 0; k < 2; ++k) for (int l = 0; l < 2; ++l) if (f[i][j][k][l]) { if (col[i] != 1) { inc(f[i + 1][1][k][!l], 1ll * p2[i - 1 - !!k] * f[i][j][k][l] % 1000000007); if (k) inc(f[i + 1][j][k][l], 1ll * p2[i - 2] * f[i][j][k][l] % 1000000007); } if (col[i] != 0) { inc(f[i + 1][j][1][!l], 1ll * p2[i - 1 - !!j] * f[i][j][k][l] % 1000000007); if (j) inc(f[i + 1][j][k][l], 1ll * p2[i - 2] * f[i][j][k][l] % 1000000007); } } int ans = 0; for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) inc(ans, f[n + 1][i][j][p]); printf( %d n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; #define me(a, b) memset(a, b, sizeof(a)) #define IOS() ios::sync_with_stdio(false), cin.tie(0) #define endl n typedef long long ll; typedef pair<ll, ll> pll; typedef pair<int, int> pii; const int INF = 0x3f3f3f3f; const int maxn = 2e5 + 5; const ll mod = 1e9 + 7; int cnt[26]; int n, k; vector<pii> ans; int check() { ans.clear(); int sum = 0; for(int i = 0; i < 26; ++i) { int r = cnt[i] % k; if(r){ ans.push_back(pii(i, k - r)); sum += k - r; } } return sum; } void solve() { me(cnt, 0); string s; cin >> n >> k >> s; for(char &c : s) ++cnt[c - a ]; if(check() == 0) { cout << s << endl; return ; } for(int i = s.size()-1; i >= 0; --i) { char &c = s[i]; --cnt[c - a ]; for(int j = s[i] - a + 1; j < 26; ++j) { c = j + a ; ++cnt[j]; int sum = s.size()-i-1 - check(); --cnt[j]; if(sum >= 0 && sum % k == 0) { string t; for(int p = 0; p <= i; ++p) t.push_back(s[p]); t.append(sum, a ); for(pii p : ans) { t.append(p.second, p.first+ a ); } cout << t << endl; return ; } } } cout << -1 n ; } int main() { IOS(); int T; cin >> T; while(T--) solve(); return 0; }
#include <bits/stdc++.h> using namespace std; int f[100001], g[100001], h[100001]; int n, cnt; bool work() { cnt = -1; for (int i = 0; i < n; ++i) { if (g[i] != -1) { if (f[i] != i) return false; } else { if (g[f[i]] == -1) { g[i] = ++cnt; h[cnt] = f[i]; g[f[i]] = cnt; } else { if (h[g[f[i]]] != f[i]) return false; h[g[f[i]]] = f[i]; g[i] = g[f[i]]; } } } return true; } int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> f[i]; for (int i = 0; i < n; ++i) --f[i]; for (int i = 0; i < n; ++i) g[i] = h[i] = -1; if (work()) { cout << ++cnt << endl; for (int i = 0; i < n; ++i) cout << ++g[i] << ; cout << endl; for (int i = 0; i < cnt; ++i) cout << ++h[i] << ; } else cout << -1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; cout << n / 2 + 1; }
#include <bits/stdc++.h> using namespace std; const int maxl = 200005; int T, n, mk, seq[maxl]; char s[maxl]; inline char read() { char ch = getchar(); while (ch != < && ch != > ) ch = getchar(); return ch; } int main() { scanf( %d , &T); while (T--) { scanf( %d , &n); mk = 0; memset(seq, 0, sizeof(seq)); for (register int i = 1; i < n; i++) s[i] = read(); s[0] = > ; s[n] = < ; for (register int i = n; i; i--) if (s[i - 1] == > && s[i] == < ) seq[i] = ++mk; mk = n; for (register int i = 1, j, tmp; i <= n; i++) { if (seq[i]) continue; if (s[i - 1] == > ) seq[i] = mk--; else { for (j = i; s[j] != > && j < n; j++) ; tmp = j; for (; j >= i; j--) seq[j] = mk--; i = tmp; } } for (register int i = 1; i <= n; i++) printf( %d , seq[i]); printf( n ); memset(seq, 0, sizeof(seq)); mk = 0; for (register int i = 1; i <= n; i++) if (s[i - 1] == > && s[i] == < ) seq[i] = ++mk; mk = n; for (register int i = n, j, tmp; i; i--) { if (seq[i]) continue; if (s[i] == < ) seq[i] = mk--; else { for (j = i; s[j - 1] != < && j > 1; j--) ; tmp = j; for (; j <= i; j++) seq[j] = mk--; i = tmp; } } for (register int i = 1; i <= n; i++) printf( %d , seq[i]); printf( n ); } return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ifstream in( date.in ); ofstream out( date.out ); long long nr2, k, rez[4001], con = 0, nr, n, pli[4001], plp[4001], inc[4001], i, j; cin >> n; for (i = 1; i <= n; i++) cin >> pli[i] >> plp[i] >> inc[i]; for (i = 1; i <= n; i++) { nr = nr2 = 0; if (inc[i] >= 0) { rez[++con] = i; nr = pli[i]; for (j = i + 1; nr > 0 && j <= n; j++) { if (inc[j] >= 0) { inc[j] -= nr--; } else { if (pli[j]) { inc[j] -= nr; pli[j] = 0; nr2 = plp[j]; for (k = j + 1; k <= n; k++) inc[k] -= nr2; } } } } else { if (pli[i]) { pli[i] = 0; nr2 = plp[i]; for (k = i + 1; k <= n; k++) inc[k] -= nr2; } } } cout << con << n ; for (j = 1; j <= con; j++) cout << rez[j] << ; return 0; }
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const int N = 128; int num[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; ++i) { cin >> num[i]; } int m; cin >> m; for (int i = 0; i < m; ++i) { int x, y; cin >> x >> y; num[x - 1] += y - 1; num[x + 1] += num[x] - y; num[x] = 0; } for (int i = 1; i <= n; ++i) { cout << num[i] << endl; } }
#include <bits/stdc++.h> using namespace std; int p[3010000], n; int main() { scanf( %d , &n); for (int i = 1; i < n + 1; i++) p[i] = i; for (int i = 2; i < n + 1; i++) { int s = p[i - 1], ns; for (int j = i - 1; j <= n + i - 2; j += i) { ns = p[j + i]; if (j + i <= n + i - 2) p[j + i] = s; else p[n + i - 1] = s; s = ns; } } for (int i = 1; i < n + 1; i++) printf( %d , p[n - 1 + i]); }
#include <bits/stdc++.h> using namespace std; int main() { int arr[101]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); for (int i = 0; i < n; i++) { cout << arr[i] << ; } }
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 100; long long arr[N], d[N], tree[N << 2], mx[N << 2]; void build(int rt, int l, int r) { if (l == r) { tree[rt] = mx[rt] = arr[l]; return; } int m = (l + r) / 2; build(rt << 1, l, m); build(rt << 1 \| 1, m + 1, r); tree[rt] = tree[rt << 1] + tree[rt << 1 \| 1]; mx[rt] = max(mx[rt << 1], mx[rt << 1 \| 1]); } void update(int L, int R, int rt, int l, int r) { if (mx[rt] <= 2) return; if (l == r) { tree[rt] = mx[rt] = d[tree[rt]]; return; } int m = (l + r) >> 1; if (L <= m) update(L, R, rt << 1, l, m); if (R > m) update(L, R, rt << 1 \| 1, m + 1, r); tree[rt] = tree[rt << 1] + tree[rt << 1 \| 1]; mx[rt] = max(mx[rt << 1], mx[rt << 1 \| 1]); } long long query(int L, int R, int rt, int l, int r) { if (L <= l && r <= R) { return tree[rt]; } int m = (l + r) >> 1; long long ans = 0; if (L <= m) ans += query(L, R, rt << 1, l, m); if (R > m) ans += query(L, R, rt << 1 \| 1, m + 1, r); return ans; } int main() { ios::sync_with_stdio(false); int n, m, t, l, r; for (int i = 1; i < N; i++) { for (int j = i; j < N; j += i) d[j]++; } cin >> n >> m; for (int i = 1; i <= n; i++) cin >> arr[i]; build(1, 1, n); while (m--) { cin >> t >> l >> r; if (t == 1) update(l, r, 1, 1, n); else cout << query(l, r, 1, 1, n) << endl; } }
#include <bits/stdc++.h> using namespace std; const int a[] = {0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2}; int main() { int n; cin >> n; cout << a[n]; return 0; }
#include <bits/stdc++.h> using namespace std; template <class T> inline bool fs(T &x) { int c = getchar(); int sgn = 1; while (~c && c < 0 \|\| c > 9 ) { if (c == - ) sgn = -1; c = getchar(); } for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; x = sgn; return ~c; } int main() { long long int n, m, cnt = 0; fs(n); fs(m); for (long long int i = 1; i i <= m; i++) { if (m % i == 0 && m / i <= n) { if (m / i != i) cnt++; cnt++; } } cout << cnt << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int solve(vector<pair<int, int> > v, int price) { if (v.size() < 2) return 0; vector<int> p, b; for (int i = 0; i < v.size(); i++) p.push_back(v[i].first), b.push_back(v[i].second); int amx[v.size()]; amx[0] = b[0]; for (int i = 1; i < b.size(); i++) amx[i] = max(amx[i - 1], b[i]); int ans = 0; for (int i = 0; i < v.size(); i++) { int id = upper_bound(p.begin(), p.begin() + i, price - p[i]) - p.begin(); id--; if (id < 0 \|\| id >= v.size()) continue; if (id != i) ans = max(ans, b[i] + amx[id]); } return ans; } int main() { int i, j, k; int n, m; int c, d; int x, y; char ch; cin >> n >> c >> d; int mc = 0, md = 0; vector<pair<int, int> > coins, diamonds; for (i = 0; i < n; i++) { cin >> x >> y >> ch; if (ch == C ) { if (c >= y) mc = max(mc, x), coins.push_back({y, x}); } else { if (d >= y) md = max(md, x), diamonds.push_back({y, x}); } } int ans = 0; if (mc > 0 && md > 0) ans = mc + md; sort(coins.begin(), coins.end()); sort(diamonds.begin(), diamonds.end()); ans = max(ans, solve(coins, c)); ans = max(ans, solve(diamonds, d)); printf( %d , ans); return 0; }
#include <bits/stdc++.h> using namespace std; int _, n; char s[100005]; int main() { scanf( %d , &_); while (_--) { scanf( %d , &n); s[0] = a ; scanf( %s , s + 1); int p = -1; for (int i = n; i >= 1; i--) { if (s[i] == 0 ) { p = i; break; } } bool f = 0; for (int i = 1; i <= n; i++) { if (s[i] == 1 ) { if (s[i + 1] == 0 ) f = 1; else f = 0; if (i < p) { continue; } printf( 1 ); } else { if (f) { printf( 0 ); i = p; continue; } printf( 0 ); } } puts( ); } }
#include <bits/stdc++.h> using namespace std; int n, ans, notOK; map<int, int> M; int main() { cin >> n; for (int i = 0, x; i < n; i++) cin >> x, M[x]++; for (map<int, int>::iterator it = M.begin(); it != M.end(); it++) { if (it->first) { if (it->second == 2) ans++; else if (it->second > 2) notOK = 1; } } cout << (notOK ? -1 : ans); }
#include <bits/stdc++.h> using namespace std; vector<int> cr1[27]; vector<int> cr2[27]; int s1[27]; int s2[27]; struct node { int x; int y; }; int main() { int n; cin >> n; char c; for (int i = 0; i < n; i++) { cin >> c; if (c == ? ) { s1[26]++; cr1[26].push_back(i); } else { s1[c - a ]++; cr1[c - a ].push_back(i); } } for (int i = 0; i < n; i++) { cin >> c; if (c == ? ) { s2[26]++; cr2[26].push_back(i); } else { s2[c - a ]++; cr2[c - a ].push_back(i); } } int cnt = 0; vector<node> nd; for (int i = 0; i < 26; i++) { int x = s1[i] - 1; int y = s2[i] - 1; while (x >= 0 && y >= 0) { node n1; n1.x = cr1[i][x]; n1.y = cr2[i][y]; nd.push_back(n1); cnt++; x--; y--; } if (x >= 0 && y < 0) { node n1; while (x >= 0 && s2[26] > 0) { n1.x = cr1[i][x]; n1.y = cr2[26][s2[26] - 1]; nd.push_back(n1); cnt++; s2[26]--; x--; } } else if (x < 0 && y >= 0) { node n1; while (y >= 0 && s1[26] > 0) { n1.x = cr1[26][s1[26] - 1]; n1.y = cr2[i][y]; nd.push_back(n1); cnt++; s1[26]--; y--; } } } while (s1[26] > 0 && s2[26] > 0) { node n1; n1.x = cr1[26][s1[26] - 1]; n1.y = cr2[26][s2[26] - 1]; nd.push_back(n1); cnt++; s1[26]--; s2[26]--; } cout << cnt << endl; for (int i = 0; i < nd.size(); i++) cout << nd[i].x + 1 << << nd[i].y + 1 << endl; }
#include <bits/stdc++.h> using namespace std; void actionFun() { long long n; cin >> n; long long c = 2; for (int i = 0; i < n; i++) { cout << c << ; ++c; } cout << endl; return; } int main() { int t; cin >> t; while (t--) { actionFun(); } }
#include <bits/stdc++.h> using namespace std; int main() { int n; while (~scanf( %d , &n)) { int cnt = 0; for (int i = 1; i < n; i++) { for (int j = i + 1; j < n; j++) { int sum = i * i + j * j; if (sum <= n * n) { if ((int)sqrt(sum) * (int)sqrt(sum) == sum) cnt++; } } } printf( %d n , cnt); } return 0; }
#include <bits/stdc++.h> using namespace std; int k[1005], n, i, j; long long kx[1005]; int main() { cin >> n; for (i = 1; i <= n; i++) cin >> k[i]; kx[1] = 2; for (i = 2; i <= n; i++) { if (k[i] == i) kx[i] = 2; else { for (j = k[i]; j < i; j++) kx[i] = (kx[i] + kx[j]) % 1000000007; kx[i] = (kx[i] + 2) % 1000000007; } } long long ans = 0; for (i = 1; i <= n; i++) ans = (ans + kx[i]) % 1000000007; cout << ans; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL); long long n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } if (n == 1) { cout << YES ; return 0; } vector<long long> v; long long cnt0 = 1; for (int i = 1; i < n; i++) { if (a[i] != a[i - 1]) { v.push_back(cnt0); cnt0 = 1; } else cnt0++; if (i == n - 1) { v.push_back(cnt0); } } long long cnt = 1; for (int i = 0; i < v.size(); i++) { if (v[i] == v[i + 1]) cnt++; } if (cnt == v.size()) cout << YES ; else cout << NO ; }
#include <bits/stdc++.h> using namespace std; #pragma GCC push_options #pragma GCC optimize( unroll-loops ) int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int INF = 10e18; long long t; cin >> t; while (t--) { long long n; cin >> n; long long a[n], b[n], c[n]; for (long long i = 0; i < n; i++) { cin >> a[i] >> b[i]; } for (long long i = 1; i <= n; i++) { c[i % n] = max(0ll, a[i % n] - b[i - 1]); } long long sum = accumulate(c, c + n, 0ll); long long res = INF; for (long long i = 0; i < n; i++) { res = min(res, sum + a[i] - c[i]); } cout << res << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int contrib[312345] = {0}; bool in_set[312345] = {0}; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<int> ans; int cnt = 0; for (int i = 1; i <= n / 2; i++) { if (cnt + contrib[i] <= k) { ans.push_back(i); in_set[i] = true; cnt += contrib[i]; for (int j = i + i; j <= n; j += i) contrib[j]++; } else { while (cnt + contrib[i] > k) { cnt -= contrib[ans.back()]; for (int j = ans.back() + ans.back(); j <= n; j += ans.back()) contrib[j]--; in_set[ans.back()] = false; ans.pop_back(); } ans.push_back(i); in_set[i] = true; cnt += contrib[i]; for (int j = i + i; j <= n; j += i) contrib[j]++; } if (cnt == k) break; } priority_queue<pair<int, int> > pq; for (int i = n / 2 + 1; i <= n; i++) { if (in_set[i]) continue; pq.push(make_pair(contrib[i], i)); } while (!pq.empty()) { while (!pq.empty() && cnt + pq.top().first > k) pq.pop(); if (pq.empty()) break; cnt += pq.top().first; ans.push_back(pq.top().second); pq.pop(); } if (cnt != k) { cout << No << endl; return 0; } cout << Yes << endl; cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { if (i) cout << ; cout << ans[i]; } cout << endl; }
#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; void qread(int &x) { int neg = 1; x = 0; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) neg = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = 10 * x + c - 0 , c = getchar(); x = neg; } const int maxn = 200005; char c[maxn]; int n, m; string s, t; int main() { scanf( %d%d , &n, &m); scanf( %s , c); s = c; scanf( %s , c); t = c; bool ok = false; for (int(i) = 0; (i) < n; i++) if (s[i] == ) ok = true; if (!ok) { puts(s == t ? YES : NO ); return 0; } int pre = 0, suf = 0; while (s[pre] != * && s[pre] == t[pre]) pre++; while (s[n - suf - 1] != * && s[n - suf - 1] == t[m - suf - 1]) suf++; if (s[pre] == * && s[n - suf - 1] == * && pre - 1 < m - suf) puts( YES ); else puts( NO ); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n == 1) { cout << -1 << endl; return 0; } cout << n << << n + 1 << << n * (n + 1) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; using int64 = long long; using pii = pair<int, int>; using vchar = vector<char>; using vvchar = vector<vchar>; using vint = vector<int>; using vint64 = vector<int64>; using vvint = vector<vint>; using vbool = vector<bool>; using vpii = vector<pii>; template <typename T> T sqr(T x) { return x * x; } template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); } pair<int, vint> solveD(vvint g, int k) { enum { NOT_VISITED, STARTED, FINISHED }; const int n = g.size(); vint depth(n, -1); depth[0] = 0; vint parent(n, -1); vint loopState(n, NOT_VISITED); pair<int, vint> result; result.first = 0; std::function<void(int)> DFS = [&](int v) { loopState[v] = STARTED; const int previous = parent[v]; if (result.first != 0) return; int backVertex = -1; int backDepth = -1; for (auto to : g[v]) { if (to == previous) continue; if (loopState[to] == STARTED && depth[to] > backDepth) { backVertex = to; backDepth = depth[to]; } } if (backVertex != -1) { vint loop; for (int u = v; u != backVertex; u = parent[u]) { loop.push_back(u); } loop.push_back(backVertex); reverse(std::begin(loop), std::end(loop)); assert(depth[v] - depth[backVertex] + 1 == loop.size()); const int loopLength = loop.size(); if (loopLength > k) { result.first = 1; for (int i = 0; i < loop.size(); i += 2) { result.second.push_back(loop[i]); } result.second.resize((k + 1) / 2); } else { result.first = 2; result.second = loop; } return; } for (auto to : g[v]) { if (loopState[to] == NOT_VISITED) { parent[to] = v; depth[to] = depth[v] + 1; DFS(to); if (result.first != 0) return; } } loopState[v] = FINISHED; }; DFS(0); if (result.first != 0) { return result; } vint colors(n, -1); std::function<void(int, int)> biColor = [&](int v, int color) { colors[v] = color; for (auto to : g[v]) { if (colors[to] == -1) { biColor(to, 1 - color); } } }; biColor(0, 0); int colorCount[2] = {0}; for (int i = 0; i < n; ++i) { colorCount[colors[i]]++; } const int bestColor = colorCount[0] > colorCount[1] ? 0 : 1; result.first = 1; for (int i = 0; i < n; ++i) { if (colors[i] == bestColor) { result.second.push_back(i); } } result.second.resize((k + 1) / 2); return result; } int main() { int T = 1; std::ios::sync_with_stdio(false); while (T--) { int n; cin >> n; ; int m; cin >> m; ; int k; cin >> k; ; vvint g(n); while (m--) { int u; cin >> u; ; int v; cin >> v; ; u--, v--; g[u].push_back(v); g[v].push_back(u); } auto result = solveD(g, k); assert(result.first == 1 \|\| result.first == 2); cout << result.first << endl; for (int& v : result.second) { v++; } if (result.first == 2) { cout << result.second.size() << endl; } std::copy(std::begin(result.second), std::end(result.second), ostream_iterator<int>(cout, )); cout << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; int a[500000]; int mina, maxa; int n, k; long long sum = 0; bool check(int c) { sum = 0; for (int i = 0; i < n; i++) { if (a[i] + c < mina) { sum += mina - c - a[i]; } else { break; } } if (sum > k) return false; return true; } bool checkp(int c) { sum = 0; for (int i = 0; i < n; i++) { if (a[i] - c > maxa) { sum += a[i] - c - maxa; } } if (sum > k) return false; return true; } int main() { scanf( %d %d , &n, &k); long long sum = 0; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } if (sum % n == 0) { mina = maxa = sum / n; } else { mina = sum / n; maxa = sum / n + 1; } sort(a, a + n); int ll = 0, rr = 1000000000; while (ll != rr) { int mid = (ll + rr) / 2; if (check(mid)) { rr = mid; } else { ll = mid + 1; } } int lll = 0, rrr = 1000000000; while (lll != rrr) { int mid = (lll + rrr) / 2; if (checkp(mid)) { rrr = mid; } else { lll = mid + 1; } } printf( %lld , (long long)lll + ll + maxa - mina); scanf( %d , &n); return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, m, s, f, i; cin >> n >> m >> s >> f; long long t; map<long long, pair<int, int>> h; pair<int, int> R; for (i = 0; i < m; i++) { cin >> t >> R.first >> R.second; h[t] = R; } i = 1; if (s < f) while (s != f) { if (h.find(i) == h.end()) { cout << R ; s++; } else { if ((h[i].first <= s && s <= h[i].second) \|\| (h[i].first <= s + 1 && s + 1 <= h[i].second)) { cout << X ; } else { cout << R ; s++; } } i++; } else { while (s != f) { if (h.find(i) == h.end()) { cout << L ; s--; } else { if ((h[i].first <= s && s <= h[i].second) \|\| (h[i].first <= s - 1 && s - 1 <= h[i].second)) { cout << X ; } else { cout << L ; s--; } } i++; } } }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int d[n]; int total = 0; for (int i = 0; i < n; i++) { cin >> d[i]; total += d[i]; } int s, t; cin >> s >> t; if (s == t) { cout << 0; return 0; } if (s > t) swap(s, t); int ans = 0; for (int i = s; i < t; i++) { ans += d[i - 1]; } cout << min(ans, total - ans); }
#include <bits/stdc++.h> using namespace std; int n, m, Q; double sy, l[200100], r[200100], sum[200100], zl, zr, x, y, ans; struct Node { double x, y; } bj[2][200100], tmp, L, R; inline bool lef(Node u, Node v, Node w) { if (u.x == v.x) return w.x < u.x; double t; t = v.x - (v.x - u.x) * (v.y - w.y) / (v.y - u.y); return w.x < t; } inline double ask(int u) { double p, q; if (bj[0][u].x == x) p = x; else { p = x - (x - bj[0][u].x) * (y - sy) / y; } if (bj[1][u].x == x) q = x; else { q = x - (x - bj[1][u].x) * (y - sy) / y; } return max((double)0, min(q, zr) - max(p, zl)); } int main() { int i, j, p, q, mid, a, b; cin >> sy >> zl >> zr >> n; L.y = R.y = sy, L.x = zl, R.x = zr; for (i = 1; i <= n; i++) { scanf( %lf%lf , &l[i], &r[i]); sum[i] = sum[i - 1] + r[i] - l[i]; bj[0][i].y = 0, bj[0][i].x = l[i]; bj[1][i].y = 0, bj[1][i].x = r[i]; } cin >> m; for (i = 1; i <= m; i++) { scanf( %lf%lf , &x, &y); ans = 0; tmp.x = x, tmp.y = y; for (p = 1, q = n; p < q;) { mid = ((p + q) >> 1); if (lef(tmp, bj[0][mid], L)) q = mid; else p = mid + 1; } a = p - 1; for (p = 1, q = n; p < q;) { mid = ((p + q) >> 1); if (!lef(tmp, bj[1][mid], R)) p = mid + 1; else q = mid; } b = p; printf( %.10f n , ask(a) + ask(b) * (a != b) + max((double)0, sum[b - 1] - sum[a]) * (y - sy) / y); } }
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) const int MAX_N = 1000009; const long long mod = 998244353; long long modpow(long long a, long long b, long long m) { long long p = 1, q = a; for (int i = 0; i < 32; i++) { if ((b / (1LL << i)) % 2 == 1) { p = q; p %= m; } q = q; q %= m; } return p; } long long N, fact[MAX_N], factinv[MAX_N]; void init() { fact[0] = 1; for (int i = 1; i <= 1000000; i++) fact[i] = (1LL * fact[i - 1] * i) % mod; for (int i = 0; i <= 1000000; i++) factinv[i] = modpow(fact[i], mod - 2, mod); } long long ncr(long long n, long long r) { if (r < 0 \|\| n < r) return 0; return (fact[n] * factinv[r] % mod) * factinv[n - r] % mod; } int main() { cin >> N; init(); long long V1 = modpow(modpow(3, N, mod), N, mod) - modpow((modpow(3, N, mod) - 3LL + mod), N, mod); V1 += mod; V1 = 2LL; V1 %= mod; long long V2 = 0; for (int i = 1; i <= N; i++) { long long E1 = ncr(N, i); long long E2 = modpow(3, N - i, mod); long long E3 = (E2 + mod - 1) % mod; E2 = modpow(E2, N, mod); E3 = modpow(E3, N, mod); if (i % 2 == 1) V2 += E1 (E2 - E3 + mod); if (i % 2 == 0) V2 -= E1 * (E2 - E3 + mod); while (V2 < 0) V2 += mod * mod; V2 %= mod; } V2 *= 3LL; V2 %= mod; cout << (V1 - V2 + mod) % mod << endl; return 0; }
#include <bits/stdc++.h> using namespace std; const long double pi = 4 * atan((long double)1); const long long mod = 1e9 + 7; const long long inf = 922337203685477; const long long nax = 1e5 + 5; long long n, p, m; long long d[nax], t[nax]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> p >> m; for (long long i = 1; i <= n; i++) { cin >> d[i] >> t[i]; } d[0] = 1; d[n + 1] = m + 1; long long cur = 0, ans = 0; for (long long i = 1; i <= n + 1; i++) { long long dif = 0; if (cur > 0) { dif = cur / p; } long long minus = d[i] - d[i - 1] - dif; if (minus < 0) { minus = 0; } ans += minus; cur -= (d[i] - d[i - 1]) * p; cur += t[i]; } cout << ans << n ; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int SIZ_TREE = 3e5 + 10; int n, m; struct Node { int u, v; Node(int U = 0, int V = 0) { u = U, v = V; if (u < v) swap(u, v); } bool operator<(const Node A) const { if (u < A.u \|\| (u == A.u && v < A.v)) return true; return false; } }; vector<int> f[N], ans[2]; vector<Node> edg; map<Node, bool> col; bool v[N], opr[N], flag1, flag2, add[N]; int cnt_p, cnt_opr; void init() { char s; int x, y; scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d %d , &x, &y); while ((s = getchar()) == ) ; f[y].push_back(x); f[x].push_back(y); edg.push_back(Node(x, y)); col[Node(x, y)] = (s == R ? false : true); } } bool dfs(int x) { v[x] = true; cnt_p++; cnt_opr += opr[x]; for (int i = 0; i < f[x].size(); i++) { int y = f[x][i]; if (v[y]) { if ((col[Node(x, y)] ^ opr[x] ^ opr[y]) == true) return false; } else { opr[y] = col[Node(x, y)] ^ opr[x]; if (!dfs(y)) return false; } } return true; } void add_ans(int x, bool s1, int s2) { if (add[x]) return; opr[x] ^= s1; add[x] = true; if (opr[x]) ans[s2].push_back(x); for (int i = 0; i < f[x].size(); i++) add_ans(f[x][i], s1, s2); } bool solve(int sign) { memset(opr, 0, sizeof(opr)); memset(v, 0, sizeof(v)); memset(add, 0, sizeof(add)); for (int i = 1; i <= n; i++) if (!v[i]) { cnt_opr = cnt_p = 0; if (!dfs(i)) return false; add_ans(i, (cnt_opr * 2 > cnt_p), sign); } return true; } void print(int s) { printf( %d n , ans[s].size()); for (int i = 0; i < ans[s].size(); i++) printf( %d , ans[s][i]); printf( n ); } void work() { flag1 = solve(0); for (int i = 0; i < edg.size(); i++) col[edg[i]] = (!col[edg[i]]); flag2 = solve(1); if (!flag1 && !flag2) printf( -1 n ); else if (flag1 && !flag2) print(0); else if (!flag1 && flag2) print(1); else if (ans[0].size() < ans[1].size()) print(0); else print(1); } int main() { init(); work(); return 0; }
#include <bits/stdc++.h> using namespace std; const int MOD = 1e6 + 3; long long power(long long base, long long exp) { long long ans = 1; while (exp) { if (exp & 1) ans = (ans * base) % MOD; base = (base * base) % MOD; exp >>= 1; } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, k; cin >> n >> k; if (n <= 63 && k > (1LL << n)) { cout << 1 << << 1; return 0; } long long v2 = 0; int digits = __builtin_popcountll(k - 1); v2 = k - 1 - digits; long long ntmp = n % (MOD - 1); if (ntmp < 0) ntmp += (MOD - 1); long long ktmp = k % (MOD - 1); if (ktmp < 0) ktmp += (MOD - 1); long long v2tmp = v2 % (MOD - 1); if (v2tmp < 0) v2tmp += (MOD - 1); long long exponent = ntmp * (ktmp - 1) - v2tmp; exponent %= (MOD - 1); if (exponent < 0) exponent += MOD - 1; long long denom = power(2, exponent); long long numpart = 0; if (k - 1 >= MOD) { numpart = 0; } else { long long prod = 1; long long ntmp2 = power(2, ntmp); prod = power(2, v2tmp); prod = power(prod, MOD - 2); if (prod < 0) prod += MOD; for (long long y = 1; y <= k - 1; y++) { prod = (prod * (ntmp2 - y)) % MOD; } numpart = prod; } long long num = (denom - numpart) % MOD; num %= MOD; denom %= MOD; if (num < 0) num += MOD; if (denom < 0) denom += MOD; cout << num << << denom; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; long long n, k, i; cin >> n >> k; vector<pair<long long, long long> > v; long long a[n], b[n]; long long x, y; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) cin >> b[i]; for (i = 0; i < n; i++) { x = a[i] - b[i]; v.push_back(make_pair(x, i)); } sort(v.begin(), v.end()); i = 0; y = 0; while (i < n) { if (i < k \|\| v[i].first <= 0) y = y + a[v[i].second]; else if (i >= k && v[i].first > 0) break; ++i; } while (i < n) { y = y + b[v[i].second]; ++i; } cout << y; }

#include <bits/stdc++.h> using namespace std; int n, a[16], b[16]; int main() { double cnt = 0; ios::sync_with_stdio(false); cin >> n; for (register int i = 0; i < n; i++) cin >> a[i]; for (register int i = 0; i < n; i++) cin >> b[i]; for (register int i = 0; i < 1e6; ++i) { register bool f = false; for (register int j = 0; !f && j < n; ++j) f |= i % a[j] == b[j]; cnt += f; } cout.setf(ios::fixed, ios::floatfield); return (cout << setprecision(7) << cnt / 1e6 << endl) && 0; }

#include <bits/stdc++.h> using namespace std; long long n, k1, k2; long long a[1005]; long long b[1005]; void ReadData() { cin >> n >> k1 >> k2; for (long long i = 1; i <= n; i++) cin >> a[i]; for (long long i = 1; i <= n; i++) cin >> b[i]; } long long c[1005]; void process() { long long k = k1 + k2; priority_queue<long long> heap; for (long long i = 1; i <= n; i++) { c[i] = abs(a[i] - b[i]); heap.push(c[i]); } while (k--) { long long tmp = heap.top(); heap.pop(); tmp--; heap.push(abs(tmp)); } long long res = 0; while (!heap.empty()) { long long tmp = heap.top(); heap.pop(); res += tmp * tmp; } cout << res; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ReadData(); process(); }

#include <bits/stdc++.h> using namespace std; const int N = 1002, M = 10002; pair<int, long long> dp[N][M]; map<long long, int> di; bool vis[N][M]; int nxt[N][M]; long long a[N], b[N], k; int T[M][N]; int n; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } int main() { scanf( %d %lld , &n, &k); for (int i = 0; i < n; ++i) { scanf( %lld , b + i); a[i] = gcd(b[i], k); } if (k == 1) return printf( %d n%ld n , 1, min_element(b, b + n) - b + 1), 0; vector<long long> divisor; for (long long i = 1; i * i <= k; ++i) if (k % i == 0) { divisor.push_back(i); divisor.push_back(k / i); } sort(divisor.begin(), divisor.end()); divisor.resize(unique(divisor.begin(), divisor.end()) - divisor.begin()); int m = divisor.size(); for (int i = 0; i < m; ++i) di[divisor[i]] = i; for (int i = 0; i < m; ++i) for (int j = 0; j < n; ++j) T[i][j] = di[divisor[i] / gcd(divisor[i], a[j])]; nxt[n][0] = -1; dp[n][0] = {0, 0}; for (int i = 1; i < m; ++i) dp[n][i] = {n + 1, 0}; for (int i = 0; i < m; ++i) for (int j = n - 1; j >= 0; --j) { pair<int, long long> ans1 = dp[j + 1][i]; pair<int, long long> ans2 = dp[j + 1][T[i][j]]; ans2.first += 1; ans2.second += b[j]; if (ans1 <= ans2) { nxt[j][i] = nxt[j + 1][i]; dp[j][i] = ans1; } else { nxt[j][i] = j; dp[j][i] = ans2; } } pair<int, long long> ans = dp[0][m - 1]; if (ans.first > n) return puts( -1 ), 0; printf( %d n , ans.first); int pos = 0; int nx = m - 1; while (pos != -1) { if (nxt[pos][nx] != pos) pos = nxt[pos][nx]; else { nx = T[nx][pos]; printf( %d , pos + 1); pos += 1; } } puts( ); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; int a[100005]; for (int i = 0; i < n; i++) cin >> a[i]; sort(a, a + n); if (n == 1) { cout << -1 << endl; return 0; } bool flag = true; for (int i = 1; i < n; i++) flag = flag && (a[0] == a[i]); if (flag) { cout << 1 << endl; cout << a[0] << endl; return 0; } if (n == 2) { if ((a[0] + a[1]) % 2 == 0) cout << 3 << endl; else cout << 2 << endl; cout << 2 * a[0] - a[1] << ; if ((a[0] + a[1]) % 2 == 0) cout << (a[1] + a[0]) / 2 << ; cout << 2 * a[1] - a[0] << ; return 0; } flag = true; for (int i = 2; i < n; i++) flag = flag && (a[1] - a[0] == a[i] - a[i - 1]); if (flag) { cout << 2 << endl; cout << 2 * a[0] - a[1] << ; cout << 2 * a[n - 1] - a[n - 2] << endl; return 0; } vector<int> diff; set<int> di; for (int i = 1; i < n; i++) { diff.push_back(a[i] - a[i - 1]); di.insert(a[i] - a[i - 1]); } if (di.size() != 2) { cout << 0 << endl; return 0; } sort(diff.begin(), diff.end()); int chan = diff[n - 2]; if (chan != 2 * diff[0]) { cout << 0 << endl; return 0; } for (int i = n - 3; i >= 0; i--) { if (diff[i] == chan || diff[i] != diff[0]) { cout << 0 << endl; return 0; } } for (int i = 1; i < n; i++) { if (a[i] - a[i - 1] == chan) { if ((a[i] + a[i - 1]) % 2 == 0) { cout << 1 << endl; cout << (a[i] + a[i - 1]) / 2 << endl; return 0; } else { cout << 0 << endl; return 0; } } } return 0; }

#include <bits/stdc++.h> using namespace std; vector<long int> fib(46, -1); int adv_fib(int n) { if (n == 0 || n == 1) { return 1; } else if (fib[n] == -1) { return fib[n] = adv_fib(n - 1) + adv_fib(n - 2); } else { return fib[n]; } } int main() { int n, curr = 1; cin >> n; for (int i = 1; i <= n; i++) { if (adv_fib(curr) == i) { cout << O ; curr++; } else { cout << o ; } } }

#include <bits/stdc++.h> using namespace std; long long i, j, k, l, m, n, t, a[211111], b[211111], c[111111], d, s; string p[111111], q[111111]; int main() { cin >> n; for (i = 1; i <= n; i++) scanf( %I64d , &a[i]); for (i = 1; i <= n; i++) scanf( %I64d , &b[i]); i = 1; j = 1; while (i <= n) { while (a[i] != b[j] && j <= n) j++; if (j <= n) i++; else break; } if (i > n) { cout << 0; return 0; } cout << n - i + 1; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (auto &x : v) cin >> x; int mine = *min_element(v.begin(), v.end()); vector<int> temp; for (int i = 0; i < n; i++) { if (v[i] == mine) temp.push_back(i); } for (int i = 0; i < temp.size() - 1; i++) temp[i] = temp[i + 1] - temp[i]; cout << *min_element(temp.begin(), temp.end() - 1) << endl; }

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 50; int n, a[maxn], ans, maxx = 0; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; maxx = max(maxx, a[i]); } cout << maxx; return 0; }

#include <bits/stdc++.h> using namespace std; const int INF = 1e9 + 7; const long long INFL = 1e18 + 123; const double PI = atan2(0, -1); mt19937 tw(960172); long long rnd(long long x, long long y) { static uniform_int_distribution<long long> d; return d(tw) % (y - x + 1) + x; } const int MAXV = 1e6 + 5; int real_dist[289][289]; string encoded = B:5GiO9T[SJLjS9XhW9T;XhSJLKLYO:PJD8TKLJP9PJX:KjS9XKSJTKS[GiOiSYOEOKP:XJ] hSJTHX]OiSkS;@hSZKYO:P:O9PJX:OkSKWJDWKWOHKi;VSJX]SlOkSKT;KjS9XKSJTKS; LWOYOkKYBiOkS7TKSHKjK9PiJ[OiSkSlJYO:P:S9XlJ9G7GHCGKH2S>FKXO9HjSWKYO:KZO9P: KjS7TWGiOiSEO9ThSXOiSk?WKYO:DjS9D9HFKHKYGXB8TiOkS;KjSISJHHKjK9P4KjGWGiOi? XOiSk?iK9DkS5G7GHCGKdFjSJH9LiK9T9@WKYO:DjS9D9P7GXGiKW7EKiK9O9DICWKWOH; 7HHKjK9<WGiOi?YO:<W?6?FC5CG;36eBGGXOVK9GWGi?hGXOi? WK9O9GFKHKYBXO9KIGHKjK4GWGiOUKYOUOgBGCWGF7EOIKiK9@WKYCjSFCWKWOH> WK6GFKHKDGHKjKDKWOfKY>6?FC5CG:VKjSVOGKWOYO4GWGiOUKYOUO8?FGFK7GRBGKW? XOUC5G7GHC3OFCWKWO3GFKHKTGiO3Ge>eBU>5CU6B:5CFGiFW?6GFK4KFGHK4GW?X? gBGCW7EGX?WCFCWKG>6GFKXFWGXFi:5C5GgBSBXCGKWO4GWGUKjB5G7GH34Gh> gBGCGBFCWKGB7GXJW7e>eBU>5;eFWKjF8C7GXGH>6GFKXFWGXFH?eBgB7?F65C7GDGXFU>6? FCU>iB5G7GX>gBGCGFFK8>F:D:U6T>5?D2S>fBF;6Ge>gBG>hBFCG>6GDGe: 5C5GSBFG4GfB5G73e>gBG76GF7F;S>U>g:U:EG5C7GH>6GVFW;U>6?FCC>6;e:5C5;fB5G7;5? F77GB:D:U6T>U>6GW;F?5?FGF7e>gBG;6GF;FCD:f:5?e:R>5?FBF7V6e>eBU>D;U>6?F?e: 5C5;gBG7e:f:U6B:5Gg:36T:fBd>F:e:574;fB53e>FBF:S>U>V:fBF>V:U>6?C:e:5Ce> gBeB36T6e:S>eBV>5?F7e>g:6GT6e>eBU2e>C:S>U>U:U>6?U>eB4?F:f:U6B:5?5?6GeBf> eBgBD:e:5Cf>gBfBU6e>e>D:E6T>e:fBe6B:D:U6gBU6e>eBg:S>U>f:5CD:5C5?D: 5GHCU6B6S:E:e2C:S>T>S:U>C:e:f:36T6e>e:f6e:T6e>T2C:S>f:e:f:U6e>e:36g>g:f> eBD:e:f>g:S>U>U>C:T:36T64?U6e>4?D:f>e:5C5?D:5GgB5CV:f>U>6?g6T:S>5?f:5?U> eBgBU64;B6D:U:f:D:f:U6BC5?eBgBECU>6?6;S>f23G7Gg:5GiK7?D236S:D:S:36e:E: T6T2C:U:U6e>e:g>e>D:f:S>U>S:36TBf:SBU>eBgBU6DC5?e>U>g6T:3?fBU>6?g:V2C>U6e> eF6?eBgFg:5CD:5G7Gg:5GHCgB6?eBg:5C5Ce>D:fF6?eFg:gBGC7?eFE:D23?UBf:5C5? DJ7GgBGC7K7?FGFGU>6CSFXGHC5GiOHCU636D:C6D6B6S:S2C:S:S6T>D:S:36e:D: D6T636T6E6B6S:U6T:D:U>U6e:SBU>D:T6e:B6D>T>T6e:S:3;S6D:S:36g:D:U6U6B:V6eBg: 5?e>FCf:f>D:U:S>U>E:C2S:g:D:U:d:5?e>D:h636C>D:D>e>D:U67?f:5?e>g:S>U>h:f:F: GC5GgBFGYGg:36B6T:S6D6B6U>S:D:46S>T:D:T6TBf:f:S>T6T>e6D6B64?T6e:e:f>e>D:7? g:f>e>E:T6g>f>e>U>UB46d:D:T6DCf:f>4?D:5;S>6C5CU>6K7C5Cg:5?U>5?6;U:S:ECf:5? UB5CgBg:E?S636g:e:U>f:f:SG6C5CgBFCU>6?F?e>57DG7G7?FG6PHCU6D2S>D6D:D62? U6T6e6B:D6f:D:e>7?T>E6e>T6TBD:D6B>T6BBUBf:fBg:UG6?U>U>4;S:d:TBg>e>6?h6B:f: D:eBf:S:UFg:UFU:6?6G7?6?YGg>6CT>6?U>5GU>U:SBf:SFg:7C5CGC5KV6T6d:DB5?U> 5CUFgBU>5?gJ7?gBFKg>eFTFFGXGFGgRYGg:C636D2S:S6D>T6D6B>C2d:S>e:D:4?D:T2d:D: T6V:S6D6g:D:U6gBf:f>eFg>T>T6e>S63BU:f:f>e>D?C2U>e:D:7?U>f:g:S>h:5G6? 6C5CVGg:f>E:g>e>U>V>T6T:7?U>g:3?6C5CU>8;D:TBU:UB5?U>f:HC6?6C5C7?eBgB8?g>W> HGFG7GGC;PHCU:T6c:S>U6e:g>e:C:V:3BU>eBf:DFg:f>SBU:f>D?U6e:DCU:5?eB7Cf: fBHCg>g:eBV>D67?4?5Cg>eJV:3?eBf:TGg>6CECU>6;SFHG6?6GGOHC5C5;ECfB6?E?g:e> UGg>FCUBFG7C5?gGf:S>7?4?5G6?U>fKGCFG7CUGgBGCF?eBV?gKHGFGXKWGg:C:S>e2T>S6T: E6E:e:E:U>3?B6S:S>D:e>R>C:S>U:S6T:f:U>f6e:S:36T6e:e>S:U>F6T>T>5736T6e:E: U6B6S:S>D:T>U:S6e>U>e>D:U6T>g:U>57e:T6e>e:B6D:f>T>e:e:D:U6T6BBD:S:T> e6T6T6B:DB5;D:U6e>D2S:SBD:f>CBg:5?e>6SYGg:D:D:46T:S6B>C636C>T6e>T>D:D:5; 36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2S>C2C>D:e:e:S>D?T6U>D:D:h:U:U6F:S:h:3? 6?FCf:UCU6T:46U:S>D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5?eBW>e>D:8?e> W6FGFK7C5GkK7?D6C2S6B:D:C:U:S636E6B>D:U:U6eBU6T:B>T6T:3;D:C:3?T6e63?5?eBU> 7?U:U:S:E:C2g:e>e>U>UFE6c:U:U6DCf:f>4;D:D?TBFC5GgB5K7?e>f64?U>f:5;U:S:DCf: 5;DB5CgBg:UCT6D6g:e6g>g:5?TG6C5CgBF?U>f:UCfBE;DK7GHC7GGTYGg:T6S>D2U:U:3? T6T63;C:E25?U>e:7?D:E2e>T6TFU:U:SBD:SBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5? U>eFU>e:DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e:4;SBDCgB5? eJg>gBf:5K6?U>5O7C5KfJWGHCWG7K7?D2C6T>S:56S6T:e6T>e6S:U>E6B6D:f:U>E:U:D:e: 46S6T>U:U>T>D:T6T6BBfBU>f:f:S:U>fBT6T>e>e6S:D6B6D:g:D:e:U:S:f:U>f:f:S>EC5? 6CT>f>e>gBE:T6T>g>U>f>e:f>e>D:V2C:S>T>T:S:D:D27?f:f>e>g:S>U>V6T>566C5CU>6? YGg:S6D:U:T6B:T6U>C:U>T6e6T:D6B6TBf:e:T6T6D:e6B:T6T6S6e:f:D:e>D:7?g:e>e: E6e:T:f>T6T>UBT6D:D6B6e:D2C:3?D:3?e>U>5CU>UJ7CfBg:T>U>e>6;S:S6e:T64?UBf: fBg:E?36T:D6e:U:S:f:3?e:S:U>DCU>e>F?T6473?6G7?6?eK7?D:B:S6C:C2S6T646S6T6D: e:S6D6B6U:S:C:D6B:D>C2C6T>D:T:S>e:D:T64?e:S:D:U2C:d:e:D:T6T6V6D:S6D6BBU:S: D>D2SBD:5?U>f:f>7?U>f:S>T6e>e>S636TBU:S>T6U>f:f:SFU6B6d:S:d:U:S:UFg>U>f: fBU6e>eFU>TBTF6?6C5CgRYGg:C6T6T:U:36e>e6T6e>S:d>U6e:D62?U>U:f:C:f:V:36e>g: S>U6eBf:D:eFgBU>U:5?S:SBf:U:f>T6D?S:U6e:D67?T>f:g:S>E23G6?U>5CVG6?6?U>g: eBg>V>D6e>7?T>g:e>6Cf:U>8;D2SBU6U:5?U:S:HCg>6Cf:7?eBg>V6e>W>HG6?6GGCYGg: 36B6T6S6T6B:U:S6D:46S>T>D:f:DBU6T:S>T6e:d6T6B:4?T647e:5Cf:D:7?U:U:S>E:S6g: f>eBU>TB46d>D:f:DCf:5?D;U>5;S>FG6?U>5K7?e>f64?U>g:5;U:S>DCf:5;DB5GgBf:E?S: 36g:47U>6?U:SG6C5GgBU?gBg:E?eB67DKHG6?6G7PHCU6C6e:B:T6D2d6C6B:d6C:U:e:S:S: V6B6D:D:C:3BT6D2SBD:C>BBU>U>f:D?T6S636e636d:S:U:U6e:h6C>e:S:SFU>T> DBS6TFU6gBgB6?U>8?D:T:B>T6e:SBT6T6DBU:S>C2g>g:5?eJV:T62;S>2?e>e>UJg>g>g: 5Ge:f:SJg:fFDBGCGG6?6WkK7?T6B:E:S6e:3BT:C:T>36T6dBU6T>E?D:e:S:U:S6V6T636U: 36F:7?e>6?fJg>T:T6TBD6T>T:5?U>eBE?36e>T6T>g>D:e:W>e:8?DC5CGC6?fGg:f>E:f>e: U>h:e:D:g>D:V:CCgB5GgB8;S:C>T6FBf:fBg:7?g:fB5?iB5?U>ICU>i:7GWKGG6?7?D6e:5? F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:5CE:U>fBFB5C6>F6S:S>U>D:6;fB5GR>5?3CG:S> U>g:dBU6T:f:U>e>5CE:U>VB57T6B:D:S>T>5CG>V:U>6?F6T>eBV>5?F>g6B:D:U6e6e:f>3? 6>C6T6e>e:G:T>U>V6D:f:f>eBV:e>D:U6T>fK7?T:S>e6S>T6T6T2D:S:T:U>4?S6B:S>E6S: S>36C:D>T6T6e>U>U:S>D:D:f:3;S:B6D:U6D:T>e6D6D2S:V:U:S6B:SBD:D:U>B6SBT:U>U> g:D:h:D:e6S:C2S:S>C2C6T>D:T:S6U:U6e:SFU:S:d>e:d:S:S>UF5;U:U6eBS6T6BFU6TB3> 6?FCf:5WkK7?U>U>E:e>e:SB4:D:3Bf:5?eBU>U>F?C6c:e:U6T6h>e:S>h:U6F:7?6? FCfJV6R:S6SBT6DBD:5?e>eBUCf:gBU>U>8?g:f:W>D:8?DCGCWG6?gGU6D6E6U>T>D:h>e:S: h:U:F:CC5C5Gg>I?U>DFU>FFgBgB7?I?FC5C5GiBU>U>IC5Ci:WKWOHGFKYGg:C2S6D6S636C: D:B6D:D:S:U6D6D2S>T6T6S:C2C:d636C:e:S:T6e:e:S>D:g:U6T:S:46S6U:U:S:D:DBD: S6D6D23?T6T:d6363;S>5?eBU>eFg>e>U6e:D:e:f6D6B64?T6e:D>e>U>U6D?C2C6U6T6U: U6e:CCf>e>U>5;D:T6D?T>473GgB7?gB6PHCU:S6e:S6D6T6d:D2S:e:S>T6e:D:S6g:C:T6S: C2CBD6T6S>36C>SBf:U>D:ECf:D:D:d6B:T6S>U:S:U6h:S:e:D:SBD:S63BT63FU:6?gBU>g> HCU:f>C:f:D:eBD:D6B>D6BBT6g>e>g:eJV6S:d6B>3?U>e:SFU:U>T6eFf:D:eJg>eFTFFC7? FCgRYGg:D:D:46T:S6B>C636C>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C: C2S>C2C>D:e:T:S:D?T6U>D:D:h:U:T6F:S6h:3?6?6?f:UCU6T:46U:S:D:V:S6C6g:D:E62? f>e>U>8?D:3BD:5BU>U>U>8?5?f>e>W>e:D:8?e>W6FGFG6C5C;PHCU:T6d6S>U6D:V:T6B:V: CBU>e:f:DFU6T>S>D:T:C?U6D:D?D:47cB5Cf:f>8?U:U6S>V:36g:d:f>U:SJV:3?e:f:TCU> f>D;S>4;SFFG6?6C5O7?e>e64?T>f:D?U6T:DCU:5;C>6Cg>e>gGf:S6h:375?6?U>fG6?6Cg> T?eBf:D?e>T?DKHGFG7G6PHCU6C6B:36T6D:e:C:C2d636U6e:f:S:g:S646U:S>DBT6D:DBU: S>DB5CU>f:ECU6e:D:f6D62?T>U>g:U:h63>e:f:SFg>eBUBU6eFU>FGgB6?6GHCU>T>SBf:5? eBe:D:UFg>eBT6gB7?g>eJV:S64?T>4?6?e>UJ7CgB7?gFg:5CfJgBgFeJHCGGFGHWkK7?T:D: E6d>e:SB4:D:3BT64;dBU>U>E?C6c6d:U6T6h>e:S:h:U6F:7?6?6?fJV6R:S6SBT6DBD:5?e> e>UCT6gBU>U>8?g:f:W>D:8?DCGCGC6?gGU6D6E6U>T>D:h>e:S:h:U:F:CC5C5Cg>I?U>DFU> FFgBgBg>I?FC5C5CiBU>U>IC5Ci:WKWKGGFG7?D2S:e>F>57T>e>SBe>gBR>5767D:e:5;e> 675;e:fBE6T>e>V>5?F>F2C:S>D:U>6;fB5CS>5?4CW:S:U>g:R>E6D:e:f:e:fBU:U>UB57T: S:36TBfB5CW>g>U>5?V6T>e>g>5?V>g:S:U>U6e6S:U>e>F>36S6e:3?V:S:U>g:D:e:f>e> V6e>U>U6e>eK7?D236S:D:S636d:E:T6T2C:U:T6T:S:g>e>D:U:S:U>S636SBU:S>T>e>U> U6DC5?e>U>f6T:3?f>U>f:f:V2C>T6T:SFg>e>UBT6TBD:5CgBg:fBHCgB6?eBf:fB5Ce:D: eFg>eBf:gB6?6?eFE:C23?T>e:f>e>DJ7CgB6?6Gf:f>eFU>fBSFGCGC5C7SYGg:S6B: U6S6T63Bf:S:S>36T6d>T6T>DCU:f6S>U:S:V6T636U636V:g>e>g:eJ7Cf:f:UBD:D>T:6?U> 5?D?36e>T6T>g:D:T6h>T6h:4C5C7?5CfK7?5CV:5Cf:fBh:f:D:g:D:h>DCgBFCfB8;S:C> D6VBf:fBU:7?f:f>e>8Cf:fB8?U>W:7GWG6G7?kK7?D6C2S6B:D:C6U:S636E6B>D:U: T6TBU6T:B>T6T:3;D:C63?T6e63?f>e>U>7?U:U:S:E:C2g:e>e>U>UFE6c:U:T6DCf:f>4;D: D?TB6C5CgB5K7?e>f64?U>f:5;U:S:DCf:5;DB5CgBg:UCT6T6g:e6g>f:f>TG6C5CgBF?U>f: UCf>E;DG7GGC7GFTYGg:T:3>D:f:S:4?U>D64;D2g:U>f>T67?e>E:g:e>UFf:S:TFg:eBD> 6Cg>e>VG6?5?T>5;U6CCUBfB6?U>8;DBU>f>TJ7?5CgFU:fBD:GG7C5C7GYGgBgBeFg>6CfF5? T>fJ7?5GU:6GGCgB5Oh>D:DCUBeB6Cf:fNHG6GGCgJg>6CfFU>fJfJXG7GWGHK7?D:U>eBd> U6e>U:4;eB57U>6>E:T6T>f:f>F>E:U>e>T6e>U>S:U>eBD6B6T6eBfBV:5?g:T>g6fBT6D:e> e6U>B:T6T>D6D:e:U>e:5?V:S:f:S:CC5?5Ge>e>e:fBE6e:U>T:U>fBf:D:e>D:V:S>f6T>e: C2C:D:U>D2C:S>g:S6T>g:U>U:U>5CU>U6;PHCU>D:5?D>e>T67?U>U:V6e>BBg>e>gJ7?eBD> 6?U>E?e>T647T6C?ECgBFCfBYGgB5Cf:h:f:F:DG6?6GgJV6eBg>e>F;f:D:TCg> TCfF7GWG6G7SYGgBF?4G7C5CWC5Cf:E;f:TCgJGCGK7ChGU>U:F:D?7C5C7?U?4Cf: fBgG7C5ChG6?V?UGXOHGXGFTYGg:T6S>D2U:U:3?T6T63;C:E25?U>e:7?D:E2e>T6TFU:U: SBD:SBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5?U>eFU>e:DFf:DJg>GC7GgB7CYGg:fBD> 6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e>4;SBDCgB5?eJg>gBf:fJ6?U>5O7C5KfJWGHCWG7K7?D: E:U>R:E:S>e6d6T>e6e:EB56D:D:T6T>5:E6D:f:D:S:e>e:f>S>D:C2C:T>T>E:e:57S:U: fBC2S:S:e6e:36C:D:U6T:f:D:S>f:U>T6T:S:4?e:fBS>T:S>U>46S6e>U:U>T>T6T:S: 36V6D:T:U>S:T636S6gBT6T:S:U6B:D:V6e>U6g>e>U>f:YGg:S:e>D>57T6eBTBe>eBT>U: 67B:f:D>e>675;D:5Cf6T6eBg>U>V>D:U:C2C:g>6;f:5GT>U>5CU6S>U:SBT>U6B:f:4?D: 5Cf:S>V:S>g>T6T>fFgB5CU>g>T>6?f6T6eB6?U>g>e:e>U:S6D?S:S>f>T>S>T636CCg:e>U: 3?D:f:e6B:47DCg>e>6CUGg:36C:e6T>B6D:U6E:e:E6T>e>D2S:S:U:e>S>D:S>U:B6D:f>T> e>e:S>U:C23?e>S:U>V6T>e>5;D:U6T:E6T:D2S:SBU:S>UBS6e>U>eBg>T6T>7?U>5;e>T6e> e>S6D:fBU>e>e:U>g:U:SB46S6e:e>T6e>T63Fg>U>g:UFe:f:SBD:f>BBGCg>e>6OHCU6T: eBC:E6e:S:R6D:U:T:U>E:36T>f6C:D:E2S6T6E6S:S>U:U:D:U6T6T:CBD:46S6e:S6T:U> S6S6B:5;T:D:36D:V6D6e:56D:V>e:f:f>T6D?T6T>C:D6B:D:U6B6S:U6T:D:d:e:S>U:h6C: D>T>D>D:U>T6h>e:e:S>F:U:36h:S:F25C5Cg>e>kK7?e:D:U:U6B:U6E>D:f>T6e6T:U6B: UBT:e:U6S:D:e6B:T6T6S6e:5?D:e>T:h:f6T>e:U6e>T:U>T6D:UBT6D:D6B:f:D2C:37D:C? eBU>5Cf>TJg>e>V:T:D:e:5;C:T6e:T6e:UBf:U>g:E?36T:D6e:U:S>g:3?e:S:U>D;U> T6TCU6D;3?6G7Cg>4PHCU>S:e:T>D6e:e:E:e:f:T>e>e:D2S>g>e>T>T:S:SBD6T:D>T>e> eBf:S>g:EC5?e>U>f6T>e>5?U>D:f:h:T:e:D2SBf:S:SBT6TFU>6?eB7?g>HCgB6?e>f:f: 5CT:D:DBf>eBf:gBU>6?eJV6S:e:e>4?U6eBUFgBU>U>gFf:f:eJg>DFUFgBWGFCgNHCU646D: C6D6B:S:S2C:S:S6T>D:S:36e:D:D6T636T6E6B6S:U6T:D:U>U6e:SBU>D:T6e:B6D>T>T6e: S:3;S6D:S:36g:D:U6U6B:V6eBg:5?e>FCf:f>D:U:S>U>E:C2S:g:D:U:d:5?e>D:h:36C>D: D>e>D:f:7?f:5?e>g:S>U>h:f:g:GC5GgBFCkK7?e6e:T:e:D6T>U>S:T>U>T>g:T>U6BBf:f: e>T6T>4;D6T>5?T>f:e>6?D:U>7?g:f>e>E:T:g>f>e>U6TFU>e:T>U6BCf:f>4?D:4;SBGCU> gBFK7C5Cg:5?U>5?4;U:S:ECf:5?UB5Cg:f:UCU6S:g:e:fBg:S>UG6C5Cg:ECU>5?D?eBE? UK7?FCGKGTYGg:T>D>f:U6B:5?V6D:5;T6f:D:U>D27CU>f:T6T6eFU6B:eBD6T>D:5?g:S> VGFCU>e>4;S6e:T>e>e>D:8;T>D:U>DFU:e:DBU6D>36FC7?eBGCYG7?gBU>U>U>gFU:S:SBU: SBU:5C5CU>5Oh:364;C>T>gBU6eJg>fBf:UFg:U>fBD:fFeJWGgBWK7CU6S>gB7G4ChB5CF7E? 6GF;FChJW>fBgB7:6GWBh>gBGCdB5CFGDCGG3GT:f:5C57dFhBFCW75C7;GKe:5C5GF:FCU> fBgB3?6CGCcB5GCCG6T6e>e:U64CGK4GfB5G7GR>5?FG3C7G3GV6e>eBU>D>gB6;7G3;T>U>6? eJe>5C5GS>eBgB4?FGd>T6B:D:S:HCU:e:5?F:5;U>U>C>e:f>eB5;77T6e:5;R:f65;S:e>T: U>U>VB5CE:U6B:S>T:E6f6T>eBS>e>3?66C:D:f>eBU6T6e:f>e>eBU6T:f>f:S:S>U6BBD:e> 6:E6D:f:U6D:T>U>e>E:U:C:36T64;e:f:4?F:D2S6e:4;G:D:U>g2C6T64;T>f:S>U>g:D: 5PHCf>e>e:S>f:U6e6S:S:d>U>5?e:S>eBV2S6T>D:36DBf:U6eBU>U>SBU>U>6?D?C6C2C6e: D:e>e:U6T6e>h>U>e:S>eFU>D:UBS6BFU6gBgB7?U>8;36S:S:S6S6BBT6D2SBD:D>B6g:f:5? TJg>e:3?e>3?e>eBgJ6?g:f:5Ge:S:SJg:fFDBGCWG6?FSYGg:D:D:46T:S6B>C636C>T6e>T> D:D:5;36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2C>C2C>D:e:e:S>D?T6U>D:D:h:U:U6F: C:h:3?6?FCf:UCU6T:46U:S:D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5?eBW>T> D:8?e>W6FGFK7C5G;PHCf:U:f6D>T>D:V6D6T6g:e>D>g:e:UFU6B>D:e:D:C?T>D:5; S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJg:e>g:e:E?e:S:C;U:SCUF6GFC5C5O7?D:e6R>U: S:E?T>T64;S63;DF6?gBU>gGU:U6V6477?5?g:UCeBU>U>U?g>e:fGg>V?DGHK7G7GFTYGg>e> e>S:f:U64;R:S62?U>g:5?e>e>h6C2U:U>D:DFf:U6eFU>DBSFgBgBg>UCD2T6D63;D:3;S>g: f:f:8?UB5?e>eJgBU>UFe:SJg:7G7G7CgBI?D:C>C>e:T:SFf:U6TFU>TBS67?6?6?fN7?e:C? eBCC5C5C5OhB7?6?6K5?e>eN7?6KUFXGXGGCGK7?D6D:U>R:E:S:e6d6T>e6e:EB56C:D:U6T> 5:E6D:e:D:S:e>e:f>S>D6D2S6S>T>E:e:f6S:U:fBC2C:S>e6e:36C:D:U6T:f:D:S:f:U: U6e:S64?e:fBS>T:S:U>46S6T>U:U>T>T6T:S:36V6D:T:U>S:C:36D6gBT6T:S>E6B6D:V6T> E65?eBU>e>kK7?D6C2S6B:D:C:U:S636E6B>D:U:U6eBU6T:B>T6T:3;D:C:3?T6e63?5?eBU> 7?U:U:S:E:C2g:e>e>U>UFE6c:U:U6DCf:f>4;D:D?TBFC5GgB5K7?e>f64?U>f:5;U:S:DCf: 5;DB5CgBg:UCT6D6g:e6g>g:5?TG6C5CgBF?U>f:UCfBE;DK7GHC7GGTYGg:T6S>D2U:U:3? T6T63;C:E25?U>e:7?D:E2e>T6TFU:U:SBD:CBTF6?gBU>VGg:U>U:3;S:d:CBg>e>g:8;C>5? U>eFU>T:DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBU:SFf:7C5C7?5Oh:e:4;SBDCgB5? eJg>g>f:5K6?U>5O7C5KfJWGHCWG7OHCU:U>eBS>T6e>T:d:S>f:U>F>D:D6T>e:T:E>46T:S: U6e>T>T6T:T>U:S6D2SBU>E6e:U:D:f6T>T636S:3;U>C:D6T>E2C6T6E:T6g>f>e:U6e:DCf: eBT:S:S6T>E2S:D:D6D:U>e:D:e:C:h:S>U:D:T>T6D:36V>S6D6B:V:C2C:h:D:V6gB5?eBf: YGg:e6e:E6e:D:D:4:S6T:T>e:g6D2S6T>C6T6e6B6S:d:D:D:f>e>T6e:S:S:S6V6T2C:S>D: S:e:E:C636SBT>T6D2S64;S:S>e2C64;T>e>e>T:SFU:S:E6T636T6e636C:e:S:T6D>T:D: T6D?T6T6f:U6U6T6T6D?V>T:D:47D:C2C?D:47cBgBg>U>5PHCU:S>T:T>T6S:f6E:D:f:U:5? D:S:S6V:e>T>D2S>UBT6S:fBU:f>D:U>U:S:D?e>S:S>g6T6e>U:S:T636h:U>D:S:SFU6T> UB36e>C6gBg>e>U>8?U>U:e>D6e>TBT6B:fBU6e>D:e>f:D:eJV:C:4?T>T>e>T6TJ6?e>f: DFD:U:CBD:DFDBGCgB6?gNHCU636D:C6D6B6S:S2C:S:S6T>D:S:36e:C:D6T636T6E6B6S: U6T:D:U>U6T:SBU:D:S6e:B6D>T>T6e:S63;S6D:S:36g:D:U6U6B:V6eBg:f>e>FCU6T>D:U: S>D:E:C2S:g:D:E:d:5?e:D:h636C>D:D>e>D:T67?f:5?e:g:S>U:h:f:F:GC5CgBFCkK7? T6T:U6T:D:D:E6C6T6U:e>U:U6T6TB46D:T:S6B:3;D:D:5;S:e64?e>e>T:h6C636C:E6S:U: U>D:D:TFU:e:U6T6D?e:S:37D2C?DB5C5Cf>eJV6B6T6T6D6D23;D:364;S6d2CBU>U>f: TCT6T6V6e6g:f:f:TCfBU>U>E;U6T6TCU>E;3G7G7CgBFTYGg>T6e>T6D:f:3;D2S>e:S>T65? D:T6h6D:T6S>D2SBD6T:S>36CBSFg:f>D:UCT:D6T:d6B:T6S>g:S:U6h:S:e:D:SBD:S63Fe: 3Jg:7?6CU>g>I?D:e>D:e:D:SBD:D6B>D6BBS67?e>g:fJV6S:e6B>3?U>e:SFU:U>T6eJ5?D: eN7?eJUFFG7?FCgVkK7?U>T>E:e:e:SBT:C:TBU:f>eBU:S>D?D:e:T:U:36h:e:S6V6T:F:7? U>g:fJg>T:T6TBD6T>T>5?U6e>TCU:fBU:S>h:U>D6W>T68?DCgB7?6?gGg:f>E:f>e:S>h:e: D2g:D:V:CCg:5CfBI?T>DBD:FFg>eBU>8?5?g:eBiBf:S>ICf:i:GCWGFGFCkK7?T6T6T2S:D: 36E6C2C6U:S>U:U6T6eBD2C:S:S6S62;D:364;S:d23?e>eBU:h:D6D6B:E6B6U6T>T>D:UFU: d:U6T6D?e:e:37D:D?DB5C5Gg>eJg:S:T2d:D:U64;D:C:3?T6e63BfBU>g:UCU6D2V6e2g:f: 5?UCfBfBU>F;U>U6TCU>E;3G7GHCgB7?D2S>fBF;6Ge>gBF>hBFCG>6GDGe: fB5GSBFG4GfB5C73e>gBF76GF7F;S:U>g:U:EG5C7GG>6GVFW;U>5?FCC>6;e:fB5;fB5C775? 677GB6D:U6T>U>6GW;F?5?6GF7e>gBF;6GF;FCD:e:5?e:R>5?FBF7V6T>eBU>D;U>5?F;e: fB5;gBF7e:T6T6B:DJ7?D2C6T>S:56S6T:e6T>e6S:U>E6B6D:f:U>E:U:D:e:46S6T>U:U>T> D:T6T6BBfBU>f:f:S:U>fBT6T>e>e6S:D6B6D:g:D:e:U:S:f:U>f:f:S:EC5?6CT>f>e>gBE: T6T>g>U>f>e:f>e>D:V2C:S>T>T:S:D:D27?f:f>e>V:S:U>V6T>566C5CU>5?YGg:S6D:U: T6B:T6U>C:U>T6e6T:D6B6TBf:e:T6T6D:e6B:T6T6S6e:f:D:e:C:7?g:e>e:E6e:T:f>T6T> UBT6D:D6B6e:C2C:3;D:3?e>U>5?T>UJ7CfBg:T>U>e>6;S:S6e:T64?UBf:fBU:E?36T:D6e: U:S:U63?T:S:D:D?U:S:E?T6473?6Gg>6?eK7?D:B:S6C:C2S6T646S6T6D:e:S6C6B6U:S:C: D6B6D>C2C6T>D:T:S>T:D:T64?e:S:D:T2C:d:e:D:T6T6V6D:S6C6BBU:S:D>C2CBD:f>U>f: U>7?U>f:S>T6T>e>S636SBU:S>T6U>f:f:SFU6B6d:S:d:T:S:TFg>U>f:fBT6T:SFU:TBDB6? 6C5?gRYGg:C6T6T:U:36T>e6T6e>S:d>U6T:D62?U>U:f:C:e:V:36T>g:S>U6e>f:D:eFgBU> U:f>S:SBf:U:f>T6D?S:U6T:D67?T>f:V6S:E23C6?U>5?VG6?6?U>g:e>g>V>D6T>7?T>g:e> 6Cf:U>8;D2SBU6U:f>U:S:HCg>6Cf:h:e>U:V6T:W:GG6?6GFCYGg:36B6T6S6D6B6U:S6D: 46S>T:D:T6DBU6T:S>T6T:d6D6B64?T6e6e:f>e:D:7?U:U:S:E:S6g:f>e>U>TB46d:D: T6DCf:f>4;D:5;S>6C5?U>5K7?e>f64?U>f:5;U:S:DCf:5;DB5CgBf:E?S636g:e6U>f:U: SG6C5CgBE?U>g:E?e>57DG7G6?6G6PHCU6C6e:B:T6D2d6C6B:d6C:U:e:S:S:V6B6D:D:C: 3BT6D2SBD:C>BBU>U>f:D?T6S636d636d:S:U:U6e:h6C>e:S:SFU>T>DBS6SFU6gBgB6?U>8? D:T:B>T6T:SBT6T6DBU:S>C2g>g:5?eJV:T62;S>2?e>e>UJg>g>g:5Ge:e:SJg:fFDBGCGG6? 6WkK7?T6B:E:S6e:3BT:C:T>36T6dBU6T>D?D:e:S:U:S6V6T636U636F:7?e>g:fJg>T: T6TBD6T>T:5?U>e>D?36e>T6T>g:D:T6W>T68?DC5C7?6?fGg:f>E:f>e:U>h:e:D:g:D:V: CCgB5CfB8;S:C>D6FBf:fBU:7?f:f>e>iBf:U>ICU>i:7GWGFG6?;PHCU:D6e:S>T>T6g>T:D: V6S>T>g>D:fFg:f>S>f:U6D?T>T62?T64;DCg:5CfBHCg>f>e>V:T6g>5C5?eBgJV6d>g>D: ECf:f:D?U>TCfF7?FG6G6OHC5C6;5CgBU>F?f>e:CCf:E?UFFC5G7?gGU:U:g:4;7CU>6? UG6C5CfBVCgBU>gG6?T?UGFKHGHGFCU6eB5?F;6CU>6CE>h>FCWB5G3Ce>U>5CTB6G4CeB5? 67U>6C53fB57F;T6T>U>g:EGfB7GF>5GFBF;U>e>6?TB57e>U>57T>e>g:5?g:7GC2C:D:U:g> 6CW;6;5?gBF;T>gB57fB5;FCD:S:f:e>d:5C6>57V:D:e>e:37D:e:5?e:U>5?gB5;f:S:f:S: 3RYGg:U>eBU>T6e>TBf:S>f>U>V6e>T6T>DCU:f>T>U:S:V6e>T>56T:V>g>e>g:eJ7Cf:f: UBD:f>S>6?U>5?D?U>e>T6T>F:D6B6h>T67?5C5C7?5CfK7?5CV:5Cf:fBh:f:D:F:D:h> DCgBFCfB8;S>U>B:VBf:fBU:W6f:D:e>8Cf:fB8?U>W:7GWG6G7?kK7?e6T:U6D:C:D:U:36T: U6e:D:U:S6DBU6S:D6T6363;C:D6e6B:d64?U>e:S>7?U:S:S6E2S:D6e>T6T>DFU6T:U:S64; S6D62;D6B?TBgB5?eBfJ7?T>f6S>U:S:5;S:C2d:C23;DBf:fBU:UCU6T6E2d6g>e:U6D?T>e: D:D?U:S:UCf:E?DC7GgB7CETYGg:T6T>T:U:S:3?U6D:5;S:U:U>U>T67?T>U:e:T6TFU:S: SBD2SBD>6?g>T>VG6?U>T>4;S6e:DBf>e>U:8;S>U>U>TFU6e:DFU:DBD6GC7CfB7CYGg>gBT> g>U>fFU>T:SBU6SFU:6C5Cg>5Oh:D:4;3BeBgBf:eJg>eBf:DJg>U>fFU:SJfJWG7CWG7SYGg: S6B:U6S6T63BU:S:S>36T6d>T6T>DCU6e6S>U:S:V6T636U:36V:g>e>g>eJ7?e:f:DBD:D>D: 6?U>5?D?36e>T6T>g>D:e:h>e:h:4C5C7C5CfK7?e>V65Cf:fBh:f:D:g:D:h>DCgBFCfB8;S: C>T6VBf:fBf:7?g:fBf:8C5?gB8?U>W:7GWG7G7?;PHCU:D:f6T>T>D6V6D6T6V6e>S>g:e: UFU6B>D:e:D:C?T>D64;S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJV6e>g:e:E?e:S:C;U: SCUF6GFC5C5O7?D:e6R>U:S:E?T>U:4;S:3;DF6?gBU>gGU>U6V:477?5?g:UCeBU>U>U?g>e: fGg>V?DGHK7G7GFCU6eBeB57fBe:5?6:V>5?F>gBDCS>e>e>C>5CdBT>eBg6e:f>67gB6357D: D:e>U64Ce>gB7:fBEBF7D:f:f>D>g:S:e>e:U>fBg6e:5;gBS636S:D:U:fBF75;e:5C57S:U> 6;fB575?36T6T:S>T>e>EB53E6S:S:U>D7T:f:f:S6e>e>U>6;U>T6T>e:DRYGg:E:U>46T: S6B>C636D>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C:C2S>C2C>D:e:T:S:D? T6U>D:D:h:U:T6F:S6h:3?6?6?f:UCU6T:46U:S:D:V:S:C6g:D:E62?f>e>U>8?U:3BD:5BU> U>U>8?5?f>e>W>e:D:8?e>W6FGFG6C5C;PHCU:T6e6S>U6D:V:T6B:V:CBU>e:f:DFU6T>S>D: T:C?U6D:D?D:47cB5Cf:f>8?U:U6S>V:36g:d:f>U:SJV:3?e:f:TCU>f>D;S>4;SFFG6? 6C5O7?e>e64?T>f:D?U6T:DCU:5;C>6Cg>e>gGf:T6h:375?6?U>fG6?6Cg>T?eBf:D?e:T? DKHGFG7GVGg:S>fBg:6Ge>eBG>hBgBG>6?DGD:5Cf:TBFG4Gf:5G7;e>eBG;6?F7g2S>U:S:f: EG5C5GH>6?VF7;S>6?U>E>6;D:5Cf>f:5G7;U>F7U>e:D6B6T>g>6G7;F?U>FG6;e>eBG?6?F; gBC:f:D:eBT>U>VBg666e>T6TBE;S>6?U>D:5Cf:D:f>eBf:D:e>UFg:36T:fBd>F:e:574; fB53e>FBF:S>U>U6fBF>V:U>6?C:e:5Ce>gBeB36T6T:S>TBV>5?F7e>g:6GS6e>e>U2e>C:S> U>U:U>6?U>eB4?F:f:D6B64?e>6GdBT>eBgBD:e:5Cf>gBeBU6e:S:D:E6T>e:fBe6B:D: T6gBT6e>e>F:S>U>f:5CD:5Cf:D:e>HCU6e>fBW:5;eBU>C>e:5?d>576;U6e>6;R:f65;S>e> T:T>U>V>5?E:U6B:e>T:E6f6T>eBS>e>3?66D:D:f>d>E6T6e:f:e:eBU6e:f>g:S:S:D6BBD: e>6:E6D:f:U6D:T>U>e>E:U:D:36e:4;T:f:e>V:D2S6e:4;F:C:U>g2S6T64;U>f:S>U>f:D: eK7?eBf:5;5?D:5?T:g:5CF>eBc>S>D:5?E>fB4?S>f:f:D:f>e6T>e:5?D2S>D:5;4CT>gBU> eBF>57T:S:f:E>e2S:D:5;C:S:U>e:UBgBU6T>U:D6h:f>F7f:e:U>5?D:f>e:T>e:5?U:S6e: eBT6e>E:e:U636e:S>e:36S6eBS6D:eFU>eBU>e>6?f:DNHCU>V>fBd>V:eBf:4;fB5;f>FBF: U:S>g:fBF>V:U>U>U:e>f:e>gBeBU:36e:fBfBV>5?6;e>g:6GT6T6eB5;f>C:T:S>U:U>U>U> e>6?g>D:5?e:DC5?6GeBf>e>eBE:e:f:f>gBfBf:U6e>D:h:T>f:fBe>T6B:U:gBU6T6eBV:S: S>h:f:g:g:5GgBf:HCU6e6e:5:e6D:U>C>S:U>S>e6g2S6T6e:S:f2e6S6e>T6D:T>U>e>E: U6T6B:U:U:f6T>eBC:e:e>F6B:D:U>S>D2C6T6e:S:e>T6D:f>e:f:S>D:eBU>e>F:U:D:f: U2C:S>f:e:U:U:S>D:D23;S6T:e:E:T:D2S:3?V:S>D:f:36T64;S>f:3CU>g:fBfK7? eBeBf6fBe:e>V:V>f>V>g>DCC:e>D:U>5CdBT:e>g>e:e>6?g>6;f:e>D2S>5?5Ce>fBV:f> fB6;D:e:S>V>g:C:e>DBU:fBg>T:f>U>5CU6e:fB7?gB6;5?f:fBU>S:T>5Cf>5?f>U>f:S: SFU>T>fBf:U>f:36TFF?U>f:SBU6T>DBD:fBTF7?eB5C7SYGg:f>g:4CU>D:5?E?e:5?f> TBE2S>g:3?6?VBE:S>eBV:D:fBf:e>e:S>e:36eF6Gh:U>g>U>e:f>D:D:U6D?f>D2S:f:V6S: f:U6e:T6eB5?D:5CUGFC5?5?e:f:5?V6D:U>U:T>f:U>U>U6T>8;T6e>U:e6e>U6B:hBT:U: S6g:S6T:E2S:F:7Gg:5G7?YGg:S:e>U>U6T:e>fBD:f>T:f6U:C:e:UB4?e6U2S:D:f6S:e:U: S>e:U:D:U6B:h>7;S>f:T6e>S:U:D2S>DBT:E6C:S:f6B:S:37T:d>e>U>f:S>UJgBU>V>D:f: S>g6B:T6T6S6e:U>U6T>D:E?C:T>T6T:T>T6D23;E:U636D;U6B64;S6474?6CU>6?TGg:36C: e6T>B6D:U:E:e:E6T>e>D2S:S>U>e>S>S:S:U:B6D:f>T>e>e:S:U>D23?5?T>U>U6T>T>5?D: S:f:E6T:D2S:SBD:S>UBT6T>U>e>gBU6e>7?g>6;e:f:U>5?C:D:e>T>eBf:U>e>g:SB46S6e: e>T6e>e:3Ff:U>T6eFf:D:eBD:e>BBFC7?eBgNHCU6T:fBT>F:e:e>d:U>f:e>gBV:C:U>6;T> U>V6T:f:E:e:eBg>g>U>U:f:f:3FU>E:e:5?e:f>gBe:T:S>5;e>U:C:U>h:U:5?F:T>g>f>6? 6?D:UCf:fBT>U:S>U>V:S:e>g:f>U>4?f>eBU6h6T>TBfBU>T>gBU68C5?f>eBW>f:D:h:e> F6FGFGg:5CU6S>FCWGiFWC7GGK4KFGHKEKWCY?6CGCW7EGX?WCFCWKWB7GGKiJWKXFi> 5C5G7GRBXCGKWO4GWGUKjB5G7GH7EK7?6CGCWFFGWKGB7GXJW;e>eBgB57dFWKjF8C7GXGH> 6GFKXFWGXFH?eBgB7?F:FCGGUGXFf>6?FGFBjB6G7G8>gBGCGFFKHBF:D:f:U>ECU:eB5GF; 5G5?6?F:gB5CVB7GUGe>eB5GC>5C4GU>fBg:5?6?F;7G775;D:U>g>U24Ce>gBG>gBVFF7T:f: 5CTB7?e>eB5;gBgB77e>5;6C36D:U:D:E6fBF75;e:5C57e:f>67gB635?C6T6e>e> eB5CUFF7U:S>eBf>U;f:5?F;S:e>e>f>6;U6T6e>D2SNHCf>U>gBT>g>e>e:S:U>U>5?gFV>D: U>g6S>T>V6T6e:f>e>eB5?6?T>U6e:5?UB4:D:S:e:e:f:gBS6B:S>4?5?U>D:U>g:f:5?E:D: g>e:f:5CU6D?C6T>S>36C:D:U:S:S>f:f:D:e:S:S>U6h>U>U>gBT>D:U>g>hFe:S>eBF:36D: h:S>V65C5Gg>eB;PHC6?6?g:fBgBU>V6f:U66C5Cg>g:5?FGE:D>f>e:S>DCgBU>FC5?4; EC5C5G7?8;B:D:36g>e:g:fBU>U>6K6C5?g:5?VC5?eBE;U6TCUFFGFK7C5Oh6C2d:e:U6T6D? U>D:E?e:37DFgBgB7?fG6?g:7?6;7?6?FGgG6GgBgBW?g:f:fGgBV?DKHKYG7GHTYGg>e>e>S: f:U64;R:S62?U>g:5?e>eBh6C2U:U>D:DFf:U6eFU>DBSFgBgB7?UCD2T6D64;D:3;S>g:f:5? 8?UB5?e>eJgBU>UFe:SJg:7G7GHCgBI?D:C>C>e:e:SFf:U6TFU>TBS67?6?FCfNh>e:C? eBCC5C5GgNhB7?6?FK5?e>eN7?6KUFXGiKGCWOHCU:D:U>C:U:S:S:R6D:T:e:UBE:36D:f6C: D:E2C6T6U:S:S>f:f:D:U6T6e:DBD:46S6T:S6T:U>S6S6B:3;e:D:36D:V6T6e:56C:V:e:f: 5?T6D?T6T>C:D6B6D:E6B6S:U6T:D:d:e:S>D:h:D:D>U>D>D:D:U:hBe:e:S>F:C:36h:S: F25C5Gg>eBkK7?f:U>V:U>T>U:E:D:f:f:5;U:U6e:UBD:S:U6S:C:4?T>U:f:S:d:5?T>e:S: h:T6B:T6U6e>T6T>T6D:3Ff:U:U6e:5;S6B:37T6C?UBfB5?e>eJg:C:U:C:D6B64;C: D6e6B6d6TBf:U>D:UCU:f:U6e:g:e:U6D?U>D:D:D;U:S6TCU:E;3C7GgBgB5PHCf>e>e:S>f: U6e6S:S:d>U>5?e:S>e>V2S6T>D:36DBf:U6eBU>U>SBU>U>U>D?C6C2C6e:D:e>e:U6T6T6h> U>e:S>eFU>D:UBS6BFU6gBgBg>U>8;36S:S:S6C6BBT6D2SBD:D>B6g:f:f:TJg>e:3?e>3?e> e>eJ6?g:f:fFe:S:SJg:fFDBGCGC6?6WkK7?U>U:E:f>T:SBT:D6TBf:4Cf:U>U>D?C:e:f: S6T6h>T:S>h:e:F65?6?U>fJV:T:36eBT6SBU:U>e>T6TCf:g:U>U>8?e:f:W6D:V6BCGCgB6? gGU6T6E:U6T:D6h>D:S:h:S:F2dB5Cf:f>I?U:DFU:F>gBg>e>ICgB5Cf:i:U>U:h:S:i: WKGCGGFCkK7?T6T6T2S:D:36E6C2C6U:S>U:U6T6eBD2C:S:S6S62;D:364;S:d23?e>e>U:h: C6D6B:E6B6U6T>T>D:TFU:d:U6T6D?e:e:37D:D?DB5C5Cg>eJg:S6T2d:D:U64;D:C:3? T6e63BfBU>f:UCT6D2V6e2g:f:f>TCfBfBU>E;U>U6TCU>E;3G7GGCgBGTYGg>e>e>S:f:U64; S:S:3?U>g:5?e>e>h6C6U:U>D:DFf:U6eFU>DBSFgBgBg>UC46T6D23;D:4;S>g:f:f:8?UB5? e>eJgBU>UFe:SJg:7G7G7CgBI?C6B>C>e:S:SFf:U6TFU>DBS67?6?6?fNh>e:C? eBCC5C5CfNhB7?6?6K5?e>eN7?6KUFXGXGGCG[;PHCg>eBV:d:5?TFU:S>UBU:f:3Gg:f> TCD2d:S>g:S:h:e:S>V6D2W>HC5Cg:5Oh6T6e:3BD6T>36FCU>f:SCU:fBU:U>h: U6T6iBU6ICUGFG7?FC6LV:C:E2eBU6T>h:e:D:V6D6W>TGgB6?eBI?T>DBD:FFg>gBU>8;5?e> e>9Gg:f>ZGgB9?HKXGFKGC7?D6e:5?F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:fBE:U> fBFB5C6>F6S:S>T>D:6;fB5CR>5?3CG:S:U>g:dBU6T:f:U>e>5CE:U>UB57S6B:C:S>T>5CG> V:U>5?F6T>e>V>5?F>g6B6D:U6e6e:f>3?6>C6T6e:e:G:T>U>V6D:e:f>e>V:T>D:U6D:eK7? D6B:S6C:C2C6T646S6T6D:e:S6S6B:U:S:C:D6B6D>C2C6T>D:T:S>T>D:U64?e:S:D:T2C:d: e:D:T6T6V6D:S6S6BBU:S:D>C2CBD:fBU>g:U>7?U>f:S>T6T>e>S636SBU:S>T6U>f:f: SFE6B6d:S:d:e:S>DFg>U>f:fBT6T:SFU:UBCB7?FC5?6SYGg:D:S>D:S6S:C>T6B:T>D:U:S> T6D:3?D6T:C:D6B6V6S:C:E2C6E:g>e:U6eFg>T6T6D>36T:C:f:D:e:C?D:T>T6D:V6D6C2V: C2h:4C5?g:5?UGg:e>E6e>T6T>V6T636U636V:3?U>5?T>8;C:D>36EBf:U>D:h:e:T:S>h> T6T>8?U>W:7GFC5G6?kK7?T6T6T2S:D:36E6C2C6U:S>U:U6T6TBD2C:S:S6C62;D:364;S: d23?e>e>T:h:D6D6B6E6B6U6T>T:D:TFU:d:U6T6D?e:T:37D6C?DB5C5Cf>eJg:S:T2d:D: T64;D:C63?T6e63Bf>U>f:UCU6D2V6e2g:f:f:UCfBf>U>E;U:T6TCU>E;3G7G7CgBFTYGg:T: C>C:f:S64;T:364;D6g:U>e>T6h:S:E:U6T:DFf:S6TFU6TB3>gBg>e>UCf:e:C:4;D23?D>e> f:D:8;DBU>e>TJg:f>UFD:TBD67G7C5CgBICU>U>SBU:f>TFf:S:TFg:eBD65C6?U>5Oh>D:C? DBdB5Cf:fN7C5C6?UJU>f>TFU:UJUFXG7GGC7SYGg:C636D2S:S6S>D6D6B>C2d:S>T>D:4?D: S2d:D:T6V:S6S6g:D:E6g>g:f>eFg:S>T6T>S63BU:f:f>e:D?C2U>T>D:7?U>f:V:S:h:4C7? 6C5?VGg:U:E:g>e>U>V>T6T:7?U>V:3?6C5?U>8;D:CBU:EBfBU>f:HC6?6C5?h>e>U>8?5?W: WGFG7GFGHCU:5?gBW>g>eBg>SBU>6C4?F7g:f:e>g:d>5;g6e>U>U>eBg>F>e>E>V:C:e:S>U: 6;eB5?d:5Cc>F:T6T>U>4?F:f:e>V:S:e>T:f>eB6;D:S6B:SBU>fBG>E:U>e>V:S>f:E:e:U> g:C2C:D:5;U>6?d:E>T6S:U6e666C:D:f6T:S:5?f:f>e:U>D:U:CTYGg>e:5?e:U:f:4?T6e> 4?eBE:5?U>e:7?D:f:e>T6TFU:f:eBC:DBeF6?gBU>VGg:U>U:3;S>f2SBg>e>g:8?e>5?U> eFT>T6DFf:DJg>GC7GgB7CYGg:fBD>6?U>5GU>U:SBS:CFf:7C5C7?5Oh:e>47SBDCgB5?eJE> g>e:UJ6?U>5O7C5KfJWGHCWG7WkK7?U>T>E:d:e:SBD:C:DBU:f:dBU:U>D?D2d:S:U:S6h:e: S>V6D2F:7?5?g:fJg:S6T63BD6T>365?U>e:SCU:fBU:U>h:U6T6W>T68?DCFC7?6?gGg:S: E2e>T6T>h:e:D:V6D6V:CCgB5?eBICU>DBD:FFg>gBU>8;5?e>e>iBf:U>ICfBi: GKWGFGFCLTYGg>U:4;DBf:U:h:U:S:h:TBDB5?5?UJg:SBD>U>U>TCf:U:E?D:C;3G6G6? 5CICU>e:T6h:D:V62?6?g>TNh:4C5?5?UCU>e>T?e>D?TJGKGCFGFSHCU>4;dBf>e>UCf:f:E? D:D?TBGC7CfB7Lg>e:h:C;FCFCg>gG5?gBg>eC5C5?UCf:fCUKYKGKHKWGg:eBeB57eBe:f: E6U>e>U>gBDCS:S>e>4:e>dBD:T>U:e:f:5;gBg6e:36D:T>e6d>S:U>F:U>EB53C6T6T>U>g: S:S>e>U>U>g:S:e>f>D:D:D:36V6T>53e6S6e>e:S6T:f:U>f6e:D6C2C:SBU>e>TB57T6B:S: TBD7T6e:f>B6S:SBT:f>D:f:f:U6TNHCU:U>g>d>V>T>5;4;f:5;5?UFF6T>U>e6fBF>V:S>6? U>T>5C5?5Ce:S6T6D:eBTBV>U>F;e>e:6?36e>T64;5?D6T>U>g:e>6?U6eBT:e:f:D:T6D?e> 6?dBT6eBg>E:D:5Cf>eBe:E:T:C2C:h:U:f>g>e6D:D:S:hFD:e>e:F2S>U:E6S:V:5Cf:f>e: HCU6S6e:5:e6D:T>C>S:U>S>e6g2C6T6e:S:f2e6S6e>T6D:T>U>e>E:U6T6B:D:U6f6T>eBC: e:e>F6B:D:T>S>D2C6T6e:S:e>T6D:f>e:f:S:D:eBU:e>F:U6D:f:U2C:S>f:e:U:U:S>D: C23;S6T:e:E:D:D2S:3?V:S>D:f:36T64;S>f63CU>f:fBfK7?T>e>57e>T:f:U6T:e>T>fB4? S:S>e>E6e:d>C:D:U>T:f:5?U>f:e>D:D:D:4;R:S6T:U:T>U>57D2S6e:V>f:S:S>eBD:T>U> S:SBf:U>U>U:D:h6C:e6e6B6S:S>C6T6e>T>T:S:U6T6T:CFU:e>e>e:e:S:S:SF5; U6T6eBS6B:SFU6eBD>6?6?f:fRYGg>g>eBe>T6eBU>e:S>g:U>F>T>U6e>4;e:E>46e:S>U6e> U>T6T:U>g:S:D2SFE>U6e>U:D:f6T>e:36e:3;U>C:T6T>E2C6T6F:T6h>5?e>U6e:TCT:eBe: C:T6T>E2S:D:D6D:U>4?D:e:S:h:S>f:D:T>T6D:36V>S6D6B:W>D2C:8?D:h:gB6?eBf:kK7? 5;f>V:f>T>U>E>T:f>f>5;g:U6D:fBT:f:f6S:T64?T>U>e>e>f:5?T6e:S:h:f6T>e>U:e>e> V>T6B:UFf>U:U6D:5;S:e:47T:D?fBf:5?e>eJg>e>V:U:D:D:5;C:T:d:e:f:UBf:S>U:UCU: f:f:f:g:D:U6D?V>e:C:E;U:36TCU:C;3C5GgBgBfK7?T>S>e6S>T6T6T2D:S:T:U>4?S6B:S> E6S:S>36C:D>T6T6e>U>U:S>D:D:U:3;S:B6D:U6D:T>e6D6D2S:V:U:S6B:SBD:D:U>B6SBT: U>U>g:D:h:D:e6S:C2S:S>C2C6T>D:T:S6U:U6e:SFU:S:d>e:d:S:S>TF5;U: U6eBS6T6BFU6TB3>6?FCf:5SYGg>V>g>T>g>T>e>d:U:f>5?fFV:D:U64;T>U>V6S:f:g>T> eB6?5?U:f:f:S>UFU>E:T:f>e:e>g>T:e:36D?5?U:D:U6h:e:5?F6T>V:4?6?eBf:UCf:f>T> U:S:U6V:C:e>g:e>U:e>5?D:U>8?U:UBg>U>U>U6e>8Gf>5?D:W:e>D2h:e:W6FGgB7C5C; PHCf:5?e>f>U6eBVBT:S>g>U>g:S:f:DFf>e>f:36T>E?U6e>6?T>e:S>fBU6e>8?6;S6e:V: D:f:T6e:U6BJg>f:S:f:D?D:S>47B:e6CB6Gg:5CfN7CU>e>T:S:S>D?D2S:5;C:e:S:5?g:S> gGf:S>g:e:e>6?D:UCg:U>U:C;S>T63;S:C;DGHC5G7C5PHCU:S>e:T:T6T:f:E6T:f:T>e:T: U:S:g>D:T:S6S6TBT6T:e>D:D>T>f:U>D:EC4?36T:d6S:T:S>T:S:D2h:T:T:S:SBD: 36DBD6CBT:6?gBU>g>H?U6e:D6T:36eBD6C:S>36CBS:f>e>U6eJV:S:e:S>e>e>e:SFf: U6T6TFU:D:TFU>TFTFFC7?FCg>D2S>6CGKEGiBFCG;VCGKW;FGiJiB5C7GH> GKiF8C7GWGdBFCGKDGHKDKU>5?FC574K8GWGX;FGH?XO5?6GFK7:FGfB5C7G3C7GWG3GFGTGH: e:5?e>V:EGXOEK6GFGHKdBFCGKDGHKDKh:fB5GgBC>6GF;GKD?e>gB7?eJ5? 6GFKdB5C7GCCGKcBC:S>D:f:7?D2S:e>F>57T>e>SBe>gBR>5767D:e:5;e>675;e:fBE6T>e> V>5?F>F2C:S>D:U>6;fB5CS>5?4CW:S:U>g:R>E6D:e:f:e:fBU>U>UB57T:S:36TBfB5CW>g> U>5?V6T>e>g>5?VBg:S:U>U6e6S:U>e>F>36S6e:3?V:S:U>g:D:e>g>e>V6e>U>U6T>eK7? D236S:D:S636d:E:T6T2C:U:T6T:S:g>e>D:U:S:U>S636SBU:S>T>e>U>U6DC5?e>U>f6T:3? f>U>f:f:V2C>T6T:SFg>e>UBT6TBD:5CgBg:fBHCgB6?eBf:fB5Ce:D:eFg>eBf:gB6?6?eFE: C23?T>e:f>e>DJ7CgB6?6Gf:f>eFU>fBSFGCGC5C7SYGg:S6B:U6S6T63Bf:S:S>36T6d>T6T> DCU:f6S>U:S:V6T636U636V:g>e>g:eJ7Cf:f:UBD:D>T:6?U>5?D?36e>T6T>g:D:T6h>T6h: 4C5C7?5CfK7?5CV:5Cf:fBh:f:D:g:D:h>DCgBFCfB8;S:C>D6VBf:fBU:7?f:f>e>8Cf:fB8? U>W:7GWG6G7?kK7?D6C2S6B:D:C6U:S636E6B>D:U:T6TBU6T:B>T6T:3;D:C63?T6e63?f>e> U>7?U:U:S:E:C2g:e>e>U>UFE6c:U:T6DCf:f>4;D:D?TB6C5CgB5K7?e>f64?U>f:5;U:S: DCf:5;DB5CgBg:UCT6T6g:e6g>f:f>TG6C5CgBF?U>f:UCf>E;DG7GGC7GVGg:S>e:57f>D:f> T:V:5?F>eBc>S:D:e>U>fBd>S>e:f:D:f>e6T>e:5;C2C:D:5?5CT>gBU:eBE>5;D:S:f:E> e2S:D:e:C:S:U>e:U>gBT6T>D6T67?g>F;f:f:U>5?C:U>e:T>e>5?U:S:f:SBT6e>E:e: U636S:S>e636S6eBT6D:eBU>e>T>e>g:e>DJ7?D:E:U>R:E:S>e6d6T>e6e:EB56D:D:T6T>5: E6D:e:D:S:e>e:f>S>D6C2C6T>T>E:e:f6S:U:fBC2C:S:e6e:36C:D:U6T:f:D:S:f:U:T6T: S64?e:fBS>T:S:U>46S6T>U:U>T>T6T:S:36V6D:T:U>S:D636C6gBT6T:S:E6B6D:V6T>U6f> e>U>e:YGg:S:e>D>57T6e>TBe>eBT>U:67B:e:D>e>675;D:fBf6T6e>g>U>V>D:T:C2C:g>6; f:5CT>U>5CU6S:U:SBT>U6B:e:4?D:fBf:S>U:S>f>T6T>eFgB5CU>g>T>5?f6T6e>6?U>g>e: e>U:S6D?S:S>f>T>S:T636CCg:e>U:3;C:e:e6B6474Cg>e>gBUGg:36C:e6T>B6D:T6E:e: E6T>e>C2C:S:U:e>S>D:S:U:B6D:e>T>e:e:S:D:C23?e>S:U>U6T>e>5;D:T6T:E6T:C2C: SBU:S:U>S6T>U>e>U>T6T>7?U>5;e>T6T>e>S6D:eBU>e>e:U>f:U:SB46S6e:e:T6T:S63Fg> U>f:UBT6e:SBD:e>BB6?g>e>gNHCU6T:eBC:E6e:S:R6D:U:T:U>E:36T>f6C:D:E2S6T6E6S: S>U:U:D:U6T6T:CBD:46S6T:S6T:U>S6S6B:3;T:D:36D:V6D6e:56D:V>e:f:f>T6D?T6T>C: D6B6D:U6B6S:U6T:D:d:e:S>T:h6C:D>T>D>D:U>T6h>e:e:S>F:D:36h:S:F25C5Cg>e>kK7? e:D:U:U6B:U6E>D:f>T6e6T:U6B:UBT:e:U6S:D:e6B:T6T6S6e:5?D:e:S:h:f6T>e:U6e>T: U>T6D:UBT6D:D6B:f:C2C:37D:C?eBU>5?e>TJg>e>V:T:D:e:5;C:T6e:T6e:UBf:U>U:E? 36T:D6e:U:S:U63?T:S:D:D;U:S6TCU6D;3?6GgBg>4PHCU>S:e:T>D6e:e:E:e:f:T>e>e: D2S>g>e>T>T:S:SBD6T:D>T>e>eBf:S>U:EC5?e>U>f6T>e>5?U>D:f:h:T:e:D2SBU:S: SBT6TFU>6?eBg>g>HCgB6?e>f:f:5CT:D:DBf>eBf:gBU>6?eJV6S:e:e>4?U6e>TFg>U>U: fFf:U6eJg>DFUFgBGCFCgNHCU646D:C6D6B:S:S2C:S:S6T>D:C:36e:D:D6T636S6E6B6S: U6T:D:U:U6e:SBU>D:T6T:B6D>T>T6T:S:3;S6D:C:36g:D:T6E6B6V6e>g:5?e:ECf:f>D:U: S:U>E:C2C:g:D:U:d:f>e>D:h:36C>D:D>T>D:U:7?f:f>e>V:S:D:h:e:V6FC5GgB5CkK7? e6e:T:e:D6T>U>S:T>U>T>g:T:U6BBf:f:e>T6T>4;D6T>5?T>f:e>5?D:U>7?g:f>e>E:T:g> f>e>U6TFU>e:T:U6BCf:f>4;D:4;SBFCU>gB5K7C5Cg:5?U>5?4;U:S:ECf:5?UB5Cg:f: UCU6S:g:e:f>g:S>UG6C5Cg:E?U>f:C?e>E?DK7?FC7G7?D:5GFCW? GGgBGGVB8CWGiFFKDG5CgBFGdFGKEG5GFCG;gBGGF76GF;W?f:fBgBW:VK6GHKWBFKWFW? gB5CGCdFF;5CgBF3fB5C77FC7;HKT6T>U>g>U>GGi?G?FC7GW7fB7GF76GF;WGU>e>6?5;4? FGGBF;h>U>5C57D;U>5?F;5?gBF;7GF767B6T6e:DNHCU>gB5GeBf:5Cf>4?eB6;gBG:U>U: fB5?f>VBE:f>e>f:5CfBD:f>fBU:S:U6eFgBV:5?g>U>6;eBf:D:e>4;gBS>U:fB56T:S:V>f: 6Cg>e>g:e>TG6?5Gf>e>e:fBV6e>U>E:U>gB5?U>5?T>h>eBg:S>f>T6T>D:F:T636S:h>T6T> 7?U>g:gBFCfBg:YGg:5;f>F:U:T>U>D>D:f>e:57U6T6e:U>T:e6U2S:D:e:S>U:U:S>T:f:D: S6B:g:f6S>e:T6e>S:U:C2C:DBe:E6T6S:f6B:S:d6T:3?f>U>e:S>TFg>T>V:D:D:S:f6B: T6T6S6e:U>T6T>D6D?D:f:T6T:f:T6D23;E:T6363;D6B6D?T64;3?gBU>g>4PHCU>e:f:f>D: e>e:V:U>g>e>e>D:D:e:g>fBe>S6e:fBD:e>e>T6e>U:f:U:C:EC5CT>eBf:e:U>U>T:S:D:h> e:D:D:eBD2S:UBD:U>T:6?g>T>g>HCg>g>f:U:U>fBD:S>e>T6eBU>f>e>U:eJV6T>f:D>U>U> T6SFf:S>T63FU:D:TBD6BFTFFCg>FCgNHCU6D:S>T:D2S:D>e6S>e:D:E:T:C2C:4?T:U:D:D: S:E2S:D:D6D:U>U:S:U:SFg>U6e:U>C:U:T>f:D:e:3;D:S:C2C:U:36S6V:S6g:f>e>g>e> TGg:eBU:e>T6T>V6T6D:U6D:V>4?U>5?T>h6B:T:C:U>T6T>T6g:U6T>T6h>e:U>h:D: F6gBFCgBg:kK7?e:U>V:f:S>U:E:T:f:f:5;e:U6S:fBD:S:U6S:S>4;S>U:f6e:d:5?T>e:S: h:T6B:T6U6e>T6T>T6D:3Ff:U:U6S:5;S6B:47T6D?UBfB5?e>eJg:C:U:C:D6B64?D:D6e6B: d6TBf:U>D:UCD:f:E6e:g:e>g:D?T>D:U>D;f:U6TCU:E;3C7GgBgBETYGgBf:5?f:D:5?4; U6eBf>eBD:5?D:f:h:U>f:T>U6eBD:f>e>B:TBeFg:fBU>UCf>D:f>4;S>f6e>g>e:U6h>e:f: D:eBS:C2CFe:DJg>7?6GgBg>ICU:5?U:f:D:eFU:U:SBC:SBe:7C5?g:5KV6e>f2SB4?U>5? TFD>U:S:fJ5?U>eN7?eJUFFGHCGCgVkK7?V>fBU>e:e>eBf:S>fBU>g:eBf:S>DCU:f>T>U:C: h:e>T:F6e:V>7CU>g:5K7Cf:f:UBD:f>T>6?U:5?TCU>fBf:S>W:U:36h>T68?EGgB7?FCgK7? 5CV:5Cf:eBh:f:D6V:D:h>DCg>FCfBI?T>UBC:VF6?eBU>i:5?U6eB8Cf:eBICg:8? HCWGFKGCkK7?e6T:U6D:C:D:U:36T:U6e:D:U:S6DBU6S:D6T6363;C:D6e6B:d64?U>e:S>7? U:S:S6E2S:D6e>T6T>DFU6T:U:S64;S6D62;D6B?TBgB5?eBfJ7?T>f6S>U:S:5;S:C2d:C23; DBf:fBU:UCU6T6E2d6g>e:U6D?T>e:D:E?U:S:UCf:E?DC7GgB7C5?D:5G5GF;6G5?FCG> hBFCWB7GUGeB5C5CRBFG4GfB5G775?6CG;7GG7F;U>U>5CF6EG5C7GH>6GVFW;U>6?6CSB7?e> 5C57gB6G735?F77GD:D:e>U>D:6GW;F?5?FGF3e>gBG76GF7FCD:f:f>e:dB5CVFF7V:e>e>g: U;f>6?67e:5C5;gBG;g:C2C:T6TNHCU>V>gBC:U>e:S:R6D:U:e:UBE:36T>f6C:D:E2S6T6U: S:S>f:f:D:U6T6T6DBD:46S6e:S6T:U>S6C6B64?e:D:36D:V6T6e:56D:V>e:f:f:U6D?T6T> C:D6B:D:U6B6S:U6T:D:d:T:S:T:7?D:D>U>D>D:U>D:hBe>T:S:F:T636h:S:F25C5C5?e> kK7?e6e:U:e:D:U>E>S:S>U>T>g:S6T6TBT:f:e:36e>4;D6T>5?T>f:S>e>T6T:h:f6T6eBE: D:f>T6T:D6BFU>e:S6T6D?D:e>47B:f6DB5Cf:f>eJg>e>T:f:C:f:4;D2S>5?D:f:S:f>U:S: UCU6S:g:e:e:f:U:UCg:f>U:C;S>T63;T6C;3G7C5CgBfK7?D:B:S6C:C2S6T646S6T6D:e: S6D6B6U6S:C:D6B:D>C2C6T>D:T:S>e:D:T64?T:S6D:U2C:d:e:D:T6D6V6D:S6D6BBU:S:D> D2SBD:5?U>f:f>7?D:e:S>T6T:S>S636TBU:S>S6U>f:U:SFU6B6d:S:d:U:S:UFg>U>f: UBU6e>TFU>TBTF6?6C5CgRYGg:E:U>T:T:S>e>C6S>D>T:f>T>D:D:4;B:S:T6D2S:V:S:S> V6e:U>g:f:f:TFE6C6B:S>C6T>T>e:S:S:C?T:U>D:D:h:U6T6F:36h:3?6?6?f:UCD2C:D:D: D636V:T6B:V6D6564?e>e>T:8?D:DBD:EBU>U>U>8?5?e>e>W>D:U>8?e>h:FGFG6C5C;PHC5; U>g:D:S>U:V:36e:U6e:D>g:S:DFE:S:D6e:364;C:U6e6B:37DCU>f:S>8;T:C:T6E2S: D6eBU6T>DFU6T:U:S64;S6D6B;U6RCUFgB6?eBfNh:S:f:S:U:S64;S:C2d:C237DFg:fBU> UCU6T:E2d6g>e:U6D?T>e:D:T?g:S:fGg:UCECGGgB7CECU6eB6G7?GK5C5GXB8G7GXBGCUKU> FG6?dFWKEK6?FKH75C5GX;GCW;77eBg>e>V:VKFGFKYBGChJH?eBGCgBTBG?U>FG6;6? FKH7gBW3gBS>U:S:fBU>GKH?WCgBWKG75C5GX;GCW;7GS>6?U>5?dBgBWF7;G:5Cf:f>U? eBGCg:U>FG67U>6;5?T636S:UVkK7?T:f:f>g>D:5C4;f:5Ce>4Cg:U>U:C?fBg>g:S>6?h>D: 5C7?eBg:5?6?U>fJgBV>U>FCe>eB6?U>f>T6TCe>g:U>U:8?e>6?W6eB66DCGCgB6?gG6?6? fBg:eBg>h>D:5C7?eBg:fB6Cf:fBI?U6eFg:g>gBg>e>IGgB6Cf:i:5?U:G:U:i: WKGCGGFCkK7?D6S:S:e:D2S>U>S:S>E:D>f:S>T63BU:f:e>D6e>4;D2S>5?D:f:S>g>T6T>7? f:U6eBE:D:g>e:e>U:SFE:e:S>T6CCU:f>4?D:f6BB7Cf:fB6K7?e>e:5?T>f:4;U6S>ECU:5; S>5Cg>e:UCT6B:g:d:eBf:D:TG6?5Cg>DCU>6?5;S>E;UG7C5CGGFTYGg:T:U>S>f:S64;T:S> 4;T:g>U>e>T6h6S:U>U6D:DFf:S6eFU6TBS>gBg>e>UCT:T6B:5;D64?T>e:f:D:8;TBU>e> TJg:U>UFD:SBD27G7C5CgBI?D:D>S>D:T:CFf:T6TFU6TB365?6?U>fNh>D:C?DBdB5Cf: fN7C5?6?UJU>e>eFU6eJUFXG7GGC7CU6B:f>6G4CW>5?F7E?6GF75CWFW>eBgBF:6GWBh> gBGCR>5?FG3C7G3GD:f:f>e:dFhBFCW75C7;GKe:5C5CF65CT>eBgBe>gBGCeB5GCC76T6T:S: f:4CGK4GfB5G7GS>5?FG4C7G3GV6e>e>U>4:fB576G3;S>U>f:UFe:5C5CU>eBgB4?FGS>e> T636S:7?D:5C6Gi>F?5GgBTB5?FC4CF;G?g:5CG7d>6;F?eB5CE>fBgBGBFCV>g:S>5Cf>4:6; fB5GdB5CDCG:U>U>6;4CV:f:5?V>5?5GF:5?VB77B:e>T:S>C>5CG>V:U>6?V:U>fBFB5C6> g6D:D:f>f6f>6?3CG>T6e:5?f:W>T>gBW6e:f:f>gBV>D:f>T636SGg:5G6?F?FCU>FCU>7? FGWB5G3CeBU>FCTB6GECeB6?67U>6C53fB57F;U6eBU>g6EGfB7GVB5GGBF;f>e>6?TB57e>U> F7T>e>g:5?g>7GD2S>D:U:V:6CW;6;5?gBF;U>6C57fB57FCT:S:f:5?d:5C6>57V:D:5?e: 37D:e:5?e:U>5CgB5?g:S>g:T63J7?eBhB6G4Ch>5G67E?6GF;6CWFW>g>eBW:6GWBh>gBgBe> 5C6?3C7G3Ge:D:5?6?eFhBFCG75C7;GKe:f:5Gg:6CT>f>eBe>gBgBeB5CECW:36e:f:5? 5CGK4GfB5C5GT>5?6?4C7G4GV6T6eBU>V>fB676G3;T:S>g>UFe:f:5GU>e>eB6?6?5?U6eBf> T67?D:5;5?F>5;U>gBRBe>gBdB5;77e:f:57d>675;e:5CE:U>fBFB5C6>F:S:S>f>D:6; fB5GR>5?3CG:S>U>g:dBU6T:f:U>e>5CE:U>VB57T6B:U:S>T>5CG>V:U>6?F6T>eBV>5?F> g6B:D:U6e:e:f>3?6>C6T6e>e:G:T>U>V6D:f:f>eBV>e>D:5?U>TGg:5G5G6;6G5?5CG> hB6CWB7CUGT>5CU>TBFG4Gf>5C7;5?5CG;7CG767T>U6eBg:EG5C6GG>6CVFG;T>5?eBUB7?T> 5CU>g>6G7;f>6;gBe>D2S>U>g>6GG;F?f>6Gg:e>fBF?6CF;6CD:e:S>eBfBfBVF67F:e>D: fBU;e>6?e>T:fBU>U>6?fBg:S>6?gNHCU>6C7?EGgBU>F;VC5?F;6CfFV6eB7?e>GChFV> eB5Gf>U>6G4?5C3?B:5?D:5C5K8?gB7;gB576CD:U>g:5;6CT6e>6?f:e>6?e:5?d:U>e:36e> ECFGFCECe:5?FCf:U>gBe>fB4?F:D:U6eBh>f:5;g>33S:f:S>VFC:e>e:U6e:f>T6e>U> gBU6eB6?HCU6e>5CVBg:f>5CeFU>6Cd>6;g:T>5?g>5C5;g6e>U>V:e>5?F>eBU>F6T>e:S> VBG?eB6?d:5Cc>F:T6eBU>d>F:T>e>V:S>e>e:f>TB5;D:U6B:fFfFgBWBE:f>eBW:S>f:E:e: U>g:D2S>D:5;T>fBe:E>C:S:U6e666D:D:57T:S:f>e:f:f:5?D:5CECU6B:T>57fBS:U>F:V> 5?6:fB3CS6e>eBT>5CdBT>e>g6S:U>6;fB5;57B:D:U6e:5Ce>gBF:fBEBF;D:e:5?4:f6S6e> e>T>eBg>f:f:gBS:U>D2S>g>gBF;5;f:fB5;S:U>5;fB5?6?D:S:f:S>C:e:U>5;E2S:S> DB47D:f:5CT6T>5?U>5;S>5?g:S>6K7?D:f>6GeBW>5?5;4?gB675CWFW>T>gBh6fBVBh:f>6? T>5?5G5C7CeBD6e:5?DBTBV>5?F;5?6;7GS:e>eBg65CT>T>gBg>g>FCU>fB5CV:f:f:36D?e> 6GdBT>eBgBU>e>5C5?6CeBf:T:S>U6V:fBf>6Gf:C:U>g:hFe:eB5GF:T>U>g>5CU: 5C5CU6eBHCU:5?6CW:5?fBU>C>e:5?eB5;7;U6e>F;R:f65;S>e>T:U>U>VB5CE:U6B:eBf: E6f6T>eBS>e>3?66D:D:f>eBU6T6e:f>e>eBU6e:f>g:S:S>U6BBD:e>6:E6D:f:U6D:T>U>e> E:U:D:36e>4?e:f:5?V:D2S6e>5;G:D:U>g2S6T64;U>f:S>U>6?D:fK7?5G6?F?5CU>6?U:g> 5GVB5G3Ce>T>FCE>5C4CT>g>g>U>6?5;fB5;5?D6eBU>5;4Ce>gBV>fBVBF7e:e:f>VB57e>T> 5?T>e>g>e>fB6CU:U>f>D2h:fBF75;e:fB5?T:f>5?fB5;5?f:T6T>gFf:5CU>5?f:C:e>eB5; D:e:5CS:T>eFf>5CU>5?6Cg:S:C:5GHKYOVKIKWKi? hGXOiCiKIS9GGKHKYBXO9KIGHKjKEKWKiOgKjOUO6CGCWKW7EOIKiK9@ WKYCjSFCWKWOXBiK7GGKHKUGXKjKDKWOfKj>6?FGFC7:VKjSVOGKWOYO4GWGiOUKYOUO8? FGFK7GdFHKXCYOUC6G7GXGDSFGWKWO3GFKHKTGiODGe>eBgB5Cg:T> FCWGiBWC7G7GeFFCGGEKWCY?6?FCW74CG?WC5CFGVB7G7GiJWKWBh>eB5G6CC>G? 6GFK4GFGUGX>fBgBG;EK7?6?FCWFFGFKG>6CWFG;S>eBf>e:RBFGXBh>gBGCG>gB6GWFFGGB7; T>U>6?V:FCGCUGXBf:5?FCVBjBgB7GH:f>6?VB6GGB56D:U:D:UGg>fB5GF;5G5?6?V: fB5CfB7GUGe>eB5GD:5?4GU>U>g>5?6?F?7G7;5?D:U>g>f6d>e:f>V>gBVFF7T6e:5?fB7?e> eB5?gBgB7;e>e>6?D:U>g>D:V2T>575;S:e>e:e:f:5;gBg6e>D2S6e:TBfB5CfFF;f:S> eBfBU;f:5?F?S:S>eBf:5?U:f:5CU6eRYG6CgBgBU>6C5?e>T>U>UB6?6GgBU>gB7;S>e>g: U6e:6C5?eB6?6?U>g:5?FCgFE6T:S:S>f:f>gBe:S>eBEC6?gBU>gB7?g:5?V>D:7?4?6?FGg: UC46D:T>D:36D:g>e:S>g:f:E:4?e>eBg:8CgBUBgBUBU>gB7C8G5?eB5GW>D:U>8? eBW6FGFK7C5GkK7?f:f:U6e>U>D:E6T6T6f>e>g:U6e:5C46D:e:S6B:3?U>D:5?e>e64?e> eBf:h6C636C:U:S:f:U>D:D:UFf>e:U6e:E?e:S>47D2C?DB5C5Gg>eJV6B6T6T6D6D23;D: 364;S:d2CBU>U>g:TCf:U6g:f6g:f:5?UCgBU>U>F;U6T6TCU>E;3G7GHCgBGTYG6C5?5?e:g> g:5;e:e>4CfBf:5?eB5?h6D:f:T>D:UFg>g:5CU>DBeFg>gBU>UCD:D6T63?T>f:S>g:e: U68Cf>5?eB5GU>D:UFe:SJg:7C7GgBgBI?D2S>D:e:D:SFU:U6eBD:3BS:7?5?g:fN7?5?4? eBDCfB5?eJg>g:f:fJ5?T>eN7?5KUFWGHCGC7WkK7CgBgBU>5C5?eBD>U>DB6?6CfBU>gBF?S: d>f:U6e:7C5?eB7?g:V>7?6?6?gJV2S:S6BBf:UBU>5?e>e>TC6?gBU>gB8?g:5?W>D:8? DCGCGC6?gGE636U:U>D:D:h>e:S>h:U6F:CC5C5Cf>ICgBUFgBVFgBgBgBICFC5C5CiBU>U> IC5Ci:WKWKGGFGLTYG6?6?5;fBg>U>h6f:T67CfFgB5?6?gJV:DBfBU>e>TCg>U>VCf>D; 4GFG6?6CI?C>U6D:h>T:h:4?gBg>eN7CEC5?6?gGgB5CU?e:E?DJWKGCGGFS8;T62;4?e:f: TCg:U>UCU>D;SB7G7C5C6L6?f:8?E;FCGCgB6LFC7G7CfC5?6?UCU>fCUOYKWKHKWGg:T> eB57eBe:f:E6U>e>U>gBDCS:S>eB4:e>dBD:T>U:e:f:5;gBg6e:36D:U:e6d>S:U>E:U> EB53C6T6e:U>g:S:S>e>U>U>g:S:e>f>D:D:U:36V6T>53e6S6T>e:S6T:f:U>f6e: D6D2S6SBT>e>TB57T6B:S>TBD7T6e:5?B6T:SBT:f>D:f:5?T6eRYGg:D:D:46T:S6B>C636C> T6e>T>D:D:5;36S6T6D6D2V:S6B:V6T656g:f:5?TFU:C:C2C>C2C>D:e:e:S>D?T6U>D:D:h: U:U6F:C:h:3?6?FCf:UCU6T:46U:S:D:V:S6S6g:D:E62?5?eBU>8;D:3BD:5BU>U>g:8?5?5? eBW>T>D:8?e>W6FGFK7C5G;PHCf:U:f6D>T>D:V6D6T6g:e>D>g:e:UFU6B>D:e:D:C?T>D:5; S627DCfB5?e>8?D:S:C2V6S:E2dBf:U>DJg:e>g:e:E?e:S:C;U:SCUF6GFC5C5O7?D:e6R>U: S:E?T>T64;S63;DF6?gBU>gGU:U6V6477?5?g:UCeBU>U>U?g>e:fGg>V?DGHK7G7GgK7?fB5? F;5?U>6?U:f:5CfB5G4?e>T>5?E:U>4?S>U:f>U>6?5;U>U:5?D:U>D:5;d>D:f>T>eBF> e6T6S:U6gB5;e>T>5?D:D:U>e>TB6?U:U>D:D:h:T:57U2S:D:e>D:f:e:D:T:e>U:S6D2SFf: 5CU>e:f:S>e:SB47D2S6eBS:C:eFf:eBU>5?g:f:UNHCf>V>gBT>g>e>e:S:U>U>5?gFV>D:U> f6S>T>V6T6e:f>e>eB5?6?T>U6e:f:UB4:D:S:e:e:f:gBS6B:S:4?5?U>D:U>g:f:5?E:D:g> e:f:f:U6D?C6T>S>36C:D:U:S:S>f:f:D:e:S:S:S67?U>U>gBT>D:U>U>hFe:S>e>F:36D:h: S>V65C5C5?e>kK7?f:5?U:5?U:U>E>e:e>fBf>7;T6e:UBT:f:5;C:e>4?U:U>6CfBf:T>e>e: f:h6f6T6eBU>T>5?U6D:D:SFfBf:T6e:E?T>eB57S:f:DB5Cf:f>eJV:e>T:U6B:f:4;D6T>5? T>f:S:U>U:S:TCf:e:6?f:e:f:U>UCh:U>U>D;S6T64;36D;3G7C5CgBfK7?T:S>e6S> T6T6T2D:S:T:U>4?S6B:S>E6S:S>36C:D>T6T6e>U>U:S>D:D:f:3;S:B6D:U6D:T>e6D6D2S: V:U:S6B:SBD:D:U>B6TBT:U>U>f:D:h:C:e6S:C2S:S>C2C6T>D:T:S6U:U6T:SFU:S:d>e:d: S:S>UF5;U:U6eBS6T6BFU6TB3>6?6Cf:5SYGg>U>fBT>f>e>e>S:T>U>f>gBU>D:U>5;S:T> U6T6e:g>e>eBg:f:U>g:f:f:UFE6D6S:S>T:f>U>e:S:S:C?f>U>D:U>h:U6e:F:D:h>4?6?6? f:UC46D:T:D:36D:V:S:S>V6T:E:4?e>e>T:8?U>UBU>UBU>U>U>8C5?e>e>W>D:D:8?e> W6FGFG6C5C;PHC6?U>g>U>eBg:V>D:5?f:5;U>g:e>UFU:S:U6e>D:5?T>U:f:S:3;ECU>f:S> 8;e6B:U6U6e>T6eBU6T:3Ff:U:U6e:5;S6B:C;U6SCUFgB6?eBfNh6D:U:C:U6B:5;C: T6e6B637TFg:f>D:UCU:f:U6e:g:e:U6D?U>D:D:T?g:S:eGg:U?DCGGgB7CETYG6C5?5?e>g> g:5;e:e>4CfB5?5?e:5?h6T:f>T>D:SFg>g:UBU>UBeFg>eBU>UCT:D6T:4?T>f>e>g:D: U68Cf>5?e:5GU>D:TFe:SJg:7C5GgBgBI?D:e>T:e:D2SFU:U6DBD:TBS:7?U>g:fN7?5?4? eBDCf:5?eJ6?g:U:fJ5?T6eN7?UJUF7GHCGC7SYGg>U>U>D:f>e:S>C:D:D>f:fBU>D:U>6;B: S:U6D2S6g>e:S>g:f:E:g:f:5?UFE6C6B6S>T6T>U>e:S:S>D?f:U>D:U>h:U6e:F:36h:3?6? FCf:UCD2C:D:D:C:36V:S6B:V6T6563?e>eBU:8?U>DBU>EBU>U>g>8C5?e>eBW>D:D:8?e> W6FGFK7C5G;PHC6?6?f:5Cg>U>V:f:e:6CfB7?f:5?eFE:U>5?T:S>DCg>U>FCfB5;4C5CU>6? 8;T:D6T>g>T>6?f>U>U6eJ6C5?f:5?TCf>eBE;T6D?DFFGgB7C5Oh:S:e:f:T:U6B?U:D:E?T> 47SBgBg:5?fG6?f:7?5;6?6?eBgG7CgBg:U?f:f:SCU>U?DKHCWG7G7?D6eB5GF;6G5?6CG> hBFCWB7GUGe>5C5GRBFG4GfB5C775?6CG;7GG7F;T>U>g>F6EG5C7GG>6GVFW;U>5?FCSB7?e> 5C57gB6G735?677GS:D:U:U>D:6GW;F?5?6GF3e>gBF76GF7FCD:e:5?e:dB5CVFF7V:e>eBf: U;f>6?F7e:fB5;gBF7f6D2S6S:UJ7?D6D:U>R:E:S:e6d6T>e6e:EB56S:D:U6T>5:E6D:e:D: S:e>e:f>S>D6D2S6S>T>E:e:f6S:U:fBC2C:S>e6e:36S:D:U6T>f:T:S:f:U:U6e:S64?e: fBS>T:S:U>46S6T>U:U>e>T6T:S:36V6D:T:U>S:C:36D6gBT6T:S>E6B6T>V6T>E:5?eBU>e> YGg:e:U>F:U:S>U:D>D:f>e:57U6T6S:U>T:e6U2S:D:e:S>U:U:S:T:f:D:S6B:g:f6S>e: T6e>S:U:C2C:DBe:E6T6S:f6B6T:d6T:3?f>U>e:S>TFg>T>V:D:D:S:f6B:T6T6S6e:U>T6T> D6D?D:f:T6T:U:S6D23;E:C6364;D6B6D?T64;3?gBU>g>eK7?T>S>e6S>T6T6T2D:S:T:U>4? S6B:S:E6S:S>36C:D>T6T6e>U>U:S>D:D:D:3;S:B6D:T6D:T>e6D6C2C6V:U:S6B:SBD:D:U> B6TBT:U>U>U:D:h:D:e6S:C2C:S>C2C6T>D:T:S6U:T6T:SFU:S:d>e:d:S:S:SF5;U: T6TBS6C6BFU6TB3>6?6?f:fRYGg:D:U:T:U:C:e>d6T6e>e:eBU6D:D:3;T>U:U6B:e:V:C:e> g:e>U6e:f:D:TFU>E:D:f>S:S>f:D:T:C2C?e:U6D:D:h:S:f:F2S:E64?6?U>f:UCf:f:T> U6S:U:V:36T>g:S>U6T>f>T6T>8;D6TBU:U:U>U:S:8CU>f>T6W6T:D6V6S6W6FG6?6C5?YGg: C2S6D6S636S:D:B6D:D:S:U6D6D2S>D6T6S:C2C:d636S:e:S:U:e:e:S:D:g:T6D:S:46S6U: U:S:D:CBD:S6D6D23?T6T:d6363;S>5?e>U>eFg:S:U6e:D:T6e6D6B64?T6e6D>e>U>T6D? C2C:U6T:U:U6T:CCf>e>U>4;D:T6D?T>473GgB6?gB6PHCU:S:e:S:T6T6e6C6S:d:T>f:e:S: S:V2S6T:D:36DBT6T6eBD:T>SBU>U>U:D?C6C2C6e6C:e:e:U6T6T:h:T>e:S:SFU>D: DBS6BFU6gBgBg>U>8;36S:S:S6S6BBT6D2SBD:C>B6g:f:f>TJV:S:3;S>3?e>e>TJg>g:f: fFe:S:SJg:fFDBGCGC6?6WkK7?U:S>U:S6e>DBT6B:U>D:U:dBU6T:C?S6T:C:U6B:V6S:D: E2C:F:7?e>U6eJV:T6S:D>36T:C:5?D:e:C?D:T>T6D:V6D6C2W>D28?DC5Cg:5?fGU6T>U6T> T6D:V6T636U636F:CCU>5?e>8;C:T>36EBf:U>D:h:e:T:S>iBU6T>ICU>i:7GGC5G6?;PHCf: U:f6T>T>D:V:D6T:g:e>U>g:D:UFU6T>T:e:D2C?T>D:3;S:47DCf:5?e>8?U:T:S:V6S:U: fBf:S>UJg:e>g:D:E?e:T6C;U:SCUF6?FC5C5O7?e>f6e>U>D:E?T>T62?T64;DF6?eBg>gGU: U6V6477?U>g:UCfBf>T>V?g>D:fGg>T?DGFK7G7GFCU:5GFCW?FCgBGCV>7? FGhFFKDC5CfBFCSB6GECeB6?6;gBGCF7gB6;F?U:fBU>V6EGfB7GVB5GGBF;f>e>6?eFF; 5CfBF7U>fBg65Cg:GGD6T>D:U>U:6CW;6;5?gBF7U>6C53fB57FCT:S:f:5?4?FGFB5;g>T>5? e:D7T:f:5;e>U>5?6C5;g:S6D2S6DRYGg>gB5GeBf:5Cf>e>eBg>gBW:U>U:fB5?e:UBE:f:e> g:5CfBE:f:fBg>e:U6eFg>U6e>U>U>6;S>f:D:e:C?gBT>U:fBF6T6S:V>U:7C5C5?g:5?UGg: eBf:e>T6T>V6e>T>56T:V>5?U>5?T>8?eBg>S>fBf:U>D:W:e:D:S6h>T6T>8?U>h:7GFC5G6? kK7?5;f>V:U>T>U>E:D:f:f:5;U:U6e:UBD:S:U6S:C:4?T>U:f:S:d:5?T>e:S:h:T6B: T6U6e>T6T>T6D:3Ff:U:U6e:5;S6B:37T6C?UBfB5?e>eJg:C:U:C:D6B64;C:D6e6B6d6TBf: U>D:UCU:f:U6e:g:f:U6D?U>D:D:D;U:S6TCU:E;3C7GgBgBETYGg>e:f>e:U:e:4;U6T>5?e> f:U>T>e:h:T>f:T6T6TFU:e:eBD6TBT>g>g>T>UCf>D:S>4;S:f:D>e>e:D68?e>U>T>eFU6D: DFD:DBT67C7CfBgBICU:U>T:U:D:TFU:S:SBD2SBD:5C5?U:5Oh:T>4;CBeBfBf:eJg>e:f: DJU>U>TFU:SJUFWG7CGC7SYGg:D:S>D:S6S:C>T6B:T>D:U:S>T6D:3?D6T:C:D6B6V6S:C: E2C:E:g>e:U6eFg:T6T6D>36T:C:f:D:e:C?D:T>T6D:V6D:C2V:C2h:4C5?g:5?UGg:S>E6e> T6T>V6T636U636V:3?U>5?T>8;C:D>36EBf:U>D:h:e:U:S:h>T6T>8?U>W:7GFC5G6?;PHCf: U>g:U>T>U:V:D:f:g:5?T>g:e:UFE:S>U:e:C:D?T>U:5;S:3;ECfB5?e>8;S:C:D6V6e> E6eBU:U>DJg:f>g:e:E?e:S:C;U6SCUF6GFC5C5Oh:36e:S:U:S6D?T>D64;S627TFg>gBU> fGU:f:V64;7?5?g:UCeBU>U>U?g:e:fGg>V?DGHK7G7GFCU:5G5GF;5G5?6?F:gB5CVB7GUGe> eB5CC>5C4GU>fBg:5?6?F;7G775;D:U>fBU24Ce>gBG>gBVFF7T:f:fBTB7?e>eB5;gBgB77e> 5;6C36D:T>D:E6fBF75;e:5C57e:f>67gB635?C6T6T>e>eB5CUFF7U:S>e>f>U;f:5?6;S:e> e>f>6;U6T6T6D2SRYGg>V>gBD:f>e:S>C:D:D>f:fBU>D:U>5;B:S:U6D2S6g>e:S>g:f:E:g: f:f:UFE6C6B6S>T6T>U>e:S:S:CCf:U>D:U>h:U6e:F:36h:3?6?6?g:UCD2C:D:D:C636g: S6B:V6T6563?e>e>e:HCU>DBU>EBU>gBU>8C5?e>e>W>D:D:8?e>W6FGFGFC5C;PHCf:f:f6e> U:D:V:T6S:g>TBg>e:f:UFE6T>e>D:S:C?U:D:E?T>47dB5Cf:f>8;T:D2S>V:C:g:e:U>U: SJg>4?e:f:UCU>e>D;S64;3FFG6?6C5Oh:S:d6e:S:T6C?U6D:D?D:47B>gBg>e>fGg:T6h: 475?6?g>gG6?gBg>T?e:f:D?D:T?DKHGFG7G6PHCU:S:S:B:T6D2d6C6B6d:D:f:e:S:S: V6B6D:D:C63BT6D2SBD:D>BBU>U>U:D?D6S636e636d:S:U:T6T:h:D>e:S:SFU>T: DBS6DFU6gBgBg>U>8?D:S:B>T6T:SBT6D6CBU:S>C2g>f:f>eJg:S62;S>2?e>e>eJg>g>f: fFe:U:SJg:fFDBGCGC6?6K7?T>gB7C4ChBfBF7E?6?F;FCgJW:fBgBU:6GWBh> eBGCeBfBFGDCFG3?S:f:U>5?dFhBgBW75C5;GCD:5Cf:f:FCU:fBgB5?5CGCe:5Gd>U6T6D:e: 5;4CGC4Gf:5G7CT>U>FG4C5G3?66e>T6T>V>g>6;7C37T>U>e>gJT>5C5?U6eBg>T:e>f>e> T6T:S67?D6e:5?F>5;U>fBRBe>gBdB5;77T:f:57d>675;e:5CE:U>fBFB5C6>F6T:S>U>D:6; fB5GR>5?3CG:S>U>f:dBU6T:f:U>e>5CE:U>VB57T6B:D:e>D>5CG>V:U>6?F6T>eBV>5?F> g6B:D:T6e6e:f>3?6>C:T6e>e:G:e>U>V:D:f:f>eBV:e>D:T6T>TGg:eB5CF;5Cf>6?F:f> 5CUB6GDCe>eB5CD:5?4CT>U>g:f>6?F;gB675;D:U>U>f6d>e:f>F>fBFBF7T6e:5?UB6;e> eB5?U>fBg:e>e>6?D:D:D:D:V2T>575;S:e>e:T:f:5;fBf6e>D2S6e:TBe>5CUB57U:S>e> eBD7T:f:5?S:S>eBf:5?U:f:f:T6TNHCfB7C5G5Cf:5Gg:5?eB7;gBGBU>g:5Cf:5?VBE:5? eBe:5CgBd:f>eBf:S>U6eBTBg:5Cg6U>63fBS>D:5?e:gBS>f:fBT6T:f:U>f:6Cg:S:D2S:D? d>5G4?S>f:fBT6e>U>S:U>eBf:36e:S>V>eB67U>d:T6T>D:EBB6T:S>F:T6T>h>U>6?U>f:S> T6YGg>F?6CW>6?fBgBTBf>6C5CF;7;f:U>6?d>6;6;e>f:f>fBgBUB5CV>g:S6e>e>V:6; fB5Ce>5C3CG:T:S>gB5CV:f:U>g>e>5?f:f>5C6?T6e:S:SFU>5CG>V:U>U>g:T>f>T>5?V>g> T6B:U:E?f>6?4?V>U6D:f:5;G:T>T>67T>D:E?f>4?e>eBU>U>TGg:eBeB57eBe:f:E6U>e>U> gBDCS:S>eB4:e>dBD:T>U:e:f:5;gBg6e:36D:U>e6d>S:U>F:U>EB53C6T6e>U>g:S:S>e>U> U>g:S:e>f>D:D:U:36V6T>53e6S6e>e:S6T:f:U>f6e:D6D2S:SBU>e>TB57T6B:S>TBD7T6e: 5?B6T:SBT:f>D:f:5?U6eNHCfBhB7CeBhBfB5;4?g>6?FCgJW:U>g:f6fBVBh:e>6? fBfB5GECFCe>T6e:S>gBTBV>f>6;5?5;7CC:e>D:5?FCU:U>g:6?5?FCU:fBf>f:f:S>U6D?e> 6CdBT:e>g:U>T>5C5?5Ce>U:e:36T>7?g>g>7Ce:D:U6e>hJT>eBU>F6e>U6V:f>g:5CU>6?e> kK7?5?FCUB6?g:5GfFf>eB5Cg>7;S>6?UB4C5;6;D:fB6?f:5ChBfBU>D:e>T6eBh>G?e:5?f> U>4?E2S:f:SF5Cg:S>5?5?T>eBf:S>U:T>fBU6e>TJgBgBUBE:S>eB5;T6e>g>T>U>e6e:U6B: UCf>eB5?U>S:f:D:E?W6D:U>47B:e:e6S:4;5C7?eBg>eK7?T>eB57f>e:f>V:V:f>V>fB4?S: f>e>U>U>d>S:e:f>T:f>5;U>U:f:e:D:D:5?5CD:f>T:e>E>e:C:S:U6V>f:S:T>e>D:D:U>T: T>f>f:U>D:f>7;g:57U2S:D:5?C:T>e:D:T>e>T:S:D2SFU:e>f>e:U:S:S:SB47D2S6eBD6C: eBT:eBeB5?g:5CgJ7?D6D:U>R:E:S:e6d6T>e6e:EB56S:D:U6T>5:E6D:f:D:S:e>e:f>S>D: D2S:S>T>E:e:f6S:U:fBC2S:S>e6e:36S:D:U6T:f:T:S>f:U>U6e:S>6?e:fBS>S:S:U> 46S6e>U:U>e>T6T:S:36V6D:T:U>S:S:36T6gBT6S:S>U6B:U>V6e>E:6?eBU>FCYGg:e:5?F> 5;U>fBT>e>g>eB5;77T:f:5?T>g65;e:eBf:U>fBgB5CV>g:e:S>U6g6f:U>fBT>5?5CW:C:U> gBeBU6T:f:5?e>5Cf:U:5Cf>5?eBU6eFV:e>V>V6T:f:f6T>T>6?5?f:f>T>U>U6B?e:f>5?V> U:U6e>DCh>T>U>6;D6e:E?T>6;4GgB7?eBW6B: 5GGKiCXOFGHKiFIKiKjFXOgOFCGKWO4KiOVOGKWKY;FGHKi?XOi?iC5C7GHCG> hOWKYOjFXO8O9D7GWGiKdFXCFCGKW;GKWKY;WGX?YOe>gB7?6GSBXO9DiGWGXOi;FGHKi?XOi? iKgBFCWGF34GWGiJi?8?6GFK77gC7GWGi;FCGKW;HKi7F;e:5?eBgBU6B:f>6G4CW>5?67E? 6GF75CWFW>e>gBG:6GWBh>gBFCR>5?6G3C7G4GD:e:5?e:eFhBFCG75C7;GKf:fB5GF65CT>e> gBe>gBFC3C5CCC76S:f:S>f:5CGK4G5C5C7GS>5?6G4C7GDGV6T>5CU>4:fB576G4;S:U>g: UFf:fB5Ge>e>6G4?6GS>T:S:36T6HCU6B6S:E:e2S:S:T>S>U>C:e:f636S:f>e:57e:T6T> U2S:S:f:f:U>U6T:S:36g>g:f>e>D:f:fBV:S:U>U>C:T636S:5?T6T>f>U>f>e:f>e>D: eFgB5CV:f>U>5?g6T:S:5?f:fBg>e>U>U64;B:D:U>U>D:T6T6BCf>e>U>5;D:e>6;S: f23CgBg:fBfK7?D:S6e:T:36T:d:E6e:U:S>S:T636S:g>T>T:S:S6T>36T:S:S:S>f>T6T> D6DC5?T>U>e6S>T:f>U:S:f:V:S6T636S>D6B6TBT6TBU>f:fBU:f:HCg>6?T:f:U>5CD:D:S> T:SBf:g>e>g:eFE2S:T6T>f:D:e:CBU:D:T6TFf:D:eFU:SBCB5C7?5CUNHCU646D:C6D6B:T: S2C:S:S6T>D:C636d:D:D6T636S6E6B6T:U6T>T:U:T6T:SBU>D:T6T:B6D>T>T6T:S:3;S6D: C636g:D:T6E6B6V6e>f:f>e:ECf:f>D:U:S:U>E:C2C:g:D:U:d:f>e>D:h:36S>D:T>T:D:T: 7?f:f>e>V:S:D:h:T:V66C5CgB5?kK7?D6S:S:e:D2S:U>S:S>E:D>f:S:T63Bf:f:e>D6T>4; D2S:5?D:f:T>f>T6T>7?g:f:e>E:D:g>e:e>U:SFE:e:S:T6CCU:f>4;C:e6BB6Cf: fB5K7C5Cf:5?T>5?5;U6S:ECU:5?T>5Cg>e:UCT6B:g:d:e>f:D:TG6?5Cg>D?T>f:4;S:D; DG7C5C7GgK7?D236T:C:S636d:D:S6T2S:U>T6T:S6g:S:D:U:S:D>S636SBU:S>S>e>U> T6DCf:e:D:e6D:3?e>U>f:U:V2S>T6T:SFg>e>UBT6TBD:5CgBf:fBHCU>f>SBf:f>eBe:D: TFg>eBT6gB6?g>eFE:C23?T>d:f>e:DJ7CgB6?gFf:f>eFU>fBSFGC7C5C7SYGg:C6S>46T: S6B>C636D>C6e:T>D:D:4;36S6T6D6D2V:S6B:V6D656g:f:f>TFU:C:C2C>C2C>D:e:e:S>D? C6U>D:D:h:U:U6F:C:h:3?6?6Cf:UCU6T:46U:S:D:V:S:S6g:D:E62?5?eBU>8;T:3BD:5BU> U>f:8?5?5?eBW>T>D:8?e>W6FGFG7C5C7?D:5?gBWB6?eB6?dFfB7G4?F76;f>e>6;4CF;6;5? gBF>eB6?6>5?FBW:D:e>eBU>G?5GFCd>FC3CW>e:fBg:4?F:f>e>F:e:fBU>gBUFF736S:T> UBfB6GXBV>gB5CW:eB5?F>5?VB7;S6T>f:f6U>6Cc>FBT:S:f:U6V:S:U>g>U>e>gB5?V>U6T> D6T62PHCU>e:5?e:D:f:4?U6e>f>eBD:f:D:e:7?T>f:e>T6TBD:f:e>B:TBeBf:fBU:UG6?U> U>4;S>f6eBg>e>g:h>e:f:D:eBS:C2CFf:DFg>6?6Gg>6?YGg>6CT>6?U>5GU>U:SBS:SFf: 7C5C7?5KV6e>e2SB4?U>5?TFD>U:S:UJ6?U>5Kg>eFTFFGHCFGgRYGg:E:T>D:S6S:S>T6B:T> D:U:S>T6D:3?D6T:C:D6B6V6S:C:E2S:E:g>e:U6eFg>T6T6D>36T:C:f:D:e:C?D:T>T6D: V6D6C2V:C2h:4C5?g:5?UGg:e>E6e>T6T>V6T636U636V:3?U>5?T>8?D:D>36EBf:U>D:h:e: T:S:h>T6T>8?U>h:7GFC5G6?;PHCU:D:e:T>T6T6g>D:S>V6T>T>e>e:DFg:e>T:U:D:D? T6T64;364;dBgBf:eBHCg>e:e:V6D:U:3?f:f>TJV6e>e>e:D?D:T:C?T:3;CF7G6? 5G6OHCfB5;eBf>e>E?e:T64?D6D?TB6?6Cf>gGU:S:V62;5C5?U:UCf:f>U:SCf>e>E?T6T? UGHG6GHGFCU6eBeB57fBe:5?6:V>5?F>gBDCS>e>e>C>5CdBT>e>g6e:f>67gB6357T:D:T> U64Ce>gB6:fBEBF7D:e:f>D>g:S:e>e:U>fBg6e:f:gBC636C:U>U:fBF75;e:fB57S:U>5; fB575?36S6T:S>T>e>EB53E6T:S:T>D7T>f:f:T6T>e>U>5;U:T6T:T6DRYGg:E:U>46T:S6B> C636D>T6e>T>D:D:4;36S6T6D6C2V:S6B:V6T656g:f:f:TFU:C:C2C>C2C>D:e:T:S:D?T6U> D:D:h:U:T6F:C6h:3?6?6?f:UCU6T:46U:S:D:V:S:C6g:D:E62?f>e>U>8?U:3BD:5BU>U>U> 8?5?f>e>W>T:D:8?e>W6FGFG6C5CHCU6e>5CUBF;f:5CdF5C5GdBg:G;S>5?U:4CG;F?U>6GV: f:5CWBgBGB56T>T6T>U>G?6?FGdBgBDGV6e>g>e>dBV:S>5?f>U>6GV>eBF>e:T:C2C: eBfBFGVBh>eBFCV:f:5ChBgBWB57S:U:S:5;e>eB4CEBB:e:D:4?W6e>g>e:T>5?U:S:f:f>U: S:U>DCU6B:T>57fBS:U>E:V>5?6:fB3CT6T>e>D>5CdBT>e>g6S:U>5;fB5757B6T>T6e:4Ce> gBF:fBUBF7D:e:f>4:f6T6T>e>e>e>g:e:f:gBS:D:C2C:g:fBF75;e:fB5;S:U>5?fB5;5?D: T6T:S>C:e:U>57E2C:e:DB5;D:e>g>S:f>e>U>5;S>f:U:S:UJ7?D:f>5GT>V:5?e6d:U>g6f> FBV>D:fBV2T>E>V6e:f:T:e>eBe>g>S>D2S:f>T>C>E:e:f6e:f6gBB:S:S>e6f>C:D:U>U:U: 5?D:U>fBU6T6T:C23;S:fBR>C:S:U>D:S:e>e:f>S>T:S6B:S:V:T>U:fBT:36D:U:VBS6S> eB56T>D:V>e>U6e>e>U:S:YGg:5?U>V>g:S>g:TBU>6Cd:53f6e:S>g>d>5;g6e>U>U:S>f:E: e:U>g:36e>e>V:6;eB5?e:5Cd>F:T6T>g>d:56T:S>V6T6T>e:U>4C5?D:e:S:CFU>fBG>U:U> e>g:S>f:U:f:U>g>T6D:U:5;D:f>S:U>D6B:f:e:E6B6T>57D:e:E?e:5?e:fBU>U:dK7?eBe> 57fBT:5?U:V>5?V>fB3CS>U6eBU>5CdBT>e>e>T:f>U:fB5;5?T6B:U>6?5Ce>gBV:fBUBF;D: D:5?V>f6S:U6e>T>e>e>f:fBgBf:S>U:U:7?gBF;5?f:f:5?S:U>U>fB5?6?U>D:f:SFU:e>U> 5;f:D2S>TB5;D:D:5CT6T:5GU>UBfBU>6?5?UJ7?D:E:U>R:E:S>e6d6T>e6e:EB56T>D:U6T> 5:E6D:e:D:S:e>e:f>S>D6D2S6e>T>E:e:f6S:U:fBC2C:S>e6e:36S:D:U6T>f:T:S:f:U: U6e:S64?e:fBS>T:S:U>46S6T>U:U>e>T6T:S:36V6D:T:U>S:D:36D6gBT6T:S>E6B6T>V6T> U:5?eBU>e>YGg:5;5?E>5;U:fBTBe>fBeBf:77S>g:S>e>675;T:fBf:U:fBgBfBV>U:e: 36eBg>6;f>5CT>f>5CV:S:U6eBeBU6S>f:3?T>6Cf>U>f>e>5?D:U>eFgB5CV>g>U>5?e6T:e> 6?f>gBg>e>U6T6D?e:e>5?U>e:U6B:DCh>e>U64;D:e>4;S:5;5Gg:5?gB6PHCU>fBU:6?e:S> g>h:U>g>f:4?36eBU6gBgB4?S6e:5CT:S>5?U:f:U6e:U6B:ECFGU>eBf>e:U>f:S:S>D:h>f: 36T>UBD6e>U>T:U:D:5?g:S>g>HC7?g>g:U>U>gBD:S>e>T:e>f>e>e>D:eJV:D:f>T:E:f> D2SF5;T:T6DBD6D:e>36SBSFFCU>FCgNHCU6T:f>e>D:U:f>5;S>f:T>E>T6S:f>4;g:E>46T: S>E6T:U>T6e:U>T:S:D2SFfFV6e>U:D:f6T>T:36e:3;T>C6S6T>E2S:T6F:U6f:f>e>U6e> TC5?eBe:S>U6eBE2S:D:D6D:U>e>D:e:S>h6S:e:D:T:T:D:36V>S:C6B:W:D2C:V6D:F:gB6? eBg:HCU6B6S:E:e2S:S:T>S>U>C:e:f636S:f>e:57e6T6T>U2S:S:f:e:U>U6T:S:36g>g:e> e>D:f:e>V:S6T>U>C:T636S:5;S6T>e:U>e>e:f>e>D:fFgBfBV:U>U>e>g6S:S:f:e:f>g>e: U>U64;B:D:U:U>D:T6T6B?U>T:D:5?D:S:5;S:f23CgBg:5Cf:S> FKWGiCXK7GXKhFIGiK9KWOUKFG7GWK4KXOVKFKWGX?7GXKW;GKW?iC6?6G7GH> hOGKYOiFWOiJiC7GFGXG4KW?FG7GW76GFGH;WGH?YOf:fBgB7CTBXK9DXCWGHKi;6GHKW;GKW? iKgB5CGCF7ECWKXFW?8CgBFGF3U?gBFCW7FC7GW;HKW;G;S:f:5?UJ7?eB7GFK5G6?FG6; EC5GG?7GX>gBg>6Gg:6ChFV>6C5C4?FG6GS>6C4Gf:e>g:5CfFh>FC7;gBG75Ge>U>5Cf> 7GeBg>6GD:f>e>fB6?EGW:S:U6e:EC5CFK4CeB5?6Gf:5CgBT>gB5Gg:D:e>eBVB5G77eB4?U: fBU>5>S:D:e>V>f:fB6CgB5?U>5?T>U6;PHC5?gB7?g>eBg>7?U>6?6?F?eBg>e>gJ7?eBg>6? U>E?eBg>67e>D?FCgBFCfBYGgB5Cf:h:5CF:EG6?6GgJ6?gBg>e>F;f:D:TCg> TG6G7GWG6G7SYGgBF?4G7C5CWC5Cf:E;f:TCgJGCGK7ChGU>6?F:E?7C5C7?U?2Cf: fBfG7C5ChG6?V?UGXOHGXGVGg:5G5CF;5?f>6?F:g:5CVB5G4?e>eB5?D>fB4?S>f:f:U>6? 57U>g65;D:U>D:f:4CT>gBE>eB6>57T:S:f:UB57e>T>5;D:U>U:e>U>6CT6D:36D:g:f> F7f6e:U>5;D:f>e6T>e:5?D6B6T6eBf:5CU>e6U:C:e:S>33S:T6T>S:D:eBf>e>U>e:U6e: UNHCU>gB5C4Cg:fBg:E?5?F;gBFBV:f:fBf:6CWBV>eB5Cf:fBgBe>eB4?S:S:U:5CfFh>gB7; fB576?D:U>f:5;gBS:f:fBU:S>5?f:5?e>f>e:D6e:DC5CFC4Ce:5?6CU:U>gBe>eB5?V:D: T6T>h>e>6;f:47T6T>T>VB36T>T6V6e:f>U:D:g>gBf:eBf:HCU6e:U>F>f:S>f:TBT>gBd: 53f6T:S:f>e>57f6e:U>U:S>f:E:e:U>V636S:U>g:6;eB5?T:5?d>V:S6T>U>d:56T:S: U6T6T>e>U>eB5;D:e:D:DFg>fBW>E:U>e>g6S>e:U:e:f>g>T6T>D64;D:f>S:U>D6B6T:e: U6B6T>4;D:e>6?e:f:e:fBf:f:dK7?eB5?F;5CU>6?U:f>5CUB5GdBe>T>5CE:U>4?T>U>g>U> 6?5;eBU:5?D6T>U>5;d>D:f>T>eBF>e6T6e:U6VB57e>T>5?S>D:f>e>eB6?U:U>D:D:h:T: 57U2S:D:e>D:f:e:D:U:e>f:T6D2SFf:5CU:e>f:C:e:SBe:D2S:fBS:S>eFf:5CU>5?g:f: URYGgB7C5G5Cf:5Gg>5?eB7;gBG:U>g:5C5;5?VBE:5?eBf:5CgBD:f>fBg:S>U6eFUBg:5Cg> U>6;eBe>D:5?4;gBS>f:fB56T:S:V>f:7C6?e>g:f:TCf>5G4?S>f:fBV6e>U>E:U>fB5?U>e: S>h>eB6;S>f>T6T>D:F:T636S:W>T6T>8?U>7?gBFC5Cf:kK7?F?6CW>g>fBgBUBU>6C5?F;f: f:U>gBf>5;g6e>U:5?eBg>f:eBf>6?U6e:S>7?6;eB5?f:5Ce>g>T6S>UF5?V:f:T>67S>U64; f>DC6Cg:5?eBfJ7CfBh>U>U>T>6;S>f:e:e:5?gBf:eBU:UCU>6?U:f>g>D:U6D;U>T6B:E?U: C:UCf:D?DC5GgB7CfK7?eBe>57e:T:f:U6U6e>U>eBd:S:S>e:U:T>d:B:T6T>D:f:e:D:U:e> T6D:364?e>C:U>T:S>E:e:D6B6T6V>e6S:C:e>36T:D>S:DBf>f:U>D:U:7?U:5;T6T6D:e> 36T:S:C:S>e:U:S:U6SFU6e>T:S:e>T:S6BBe6T:C2SBT636SFU:SBDB5?g:5? URYGgBhB6CeBf>fB5?4?e>6?gBVBU:U>g:5?f>VBE:e>e>g:fBfBf:e>f>f>e:S6eFgBV:f>g> U>5;f>f:D:D:D?gBT:U:f:V6S>f:V:f:g>5C5?e:5?UG6?5Cf>e>e:f:V6T>U>U:T>g>5?U>U> T>8?e>g>U:f>g>U6D:hBT>U:36h>T6T6h:D:h:7GgB5G6?;PHC5?gBfB6?e:5?gFf>eB6?g>g: S>e>UF6C5?6;D:fBF?e:5?6?D:f>T>gBU6eBHCG?e:5?g>U>U>e:f:f:SJ6?g:S>e>E;36eB5; S>e:TB7Gg:5G6OHGgB5Cf>e>eBE?T6e>67D:5?e>6?6?e>gGU>eBV:d>eB5?D:U?U6e:U6B?T: S:4;C2C;TGHC5GHGg:S>FKFKW?GKFCWGXB8GWGiFHKgK5GFGFGdFWKEK6GFKH;FCGGX?HKX;W? gBgBFG7:VKFGHKYBGKhJi?gBGCGGdFHC5CFGF;7GGKH7FCW;HKU>U>5CgBC>GKi? WCFCWKW75C7GX;GKW;WGU>6?6C5;4GFGhJW;h>5C5C77g?6CGCG35?FGF77GX;7?T6T>f:fJ7? eBhB7GT>gB5?e6d:U>g:5?gFV>D:fBV2T>E>V6e:f:T>e>eB4?6?S>D2S:f:U>C>E:e:57e: f6gBB:S:S:f:5?D:D:U>f:f:5?D:U>fBU6T6T6D23;S:fBR>C:S>U>D:S:e>e:f>S>T:C6B6T: g:U>U>gBT:36D:T>VFS:S>e>56T:D:V>e>U6e>e>e:S>YGg:5;5?F>5;U>gBTBe>eBeBf:77e: f:f>d>675;D:5Cf:U:fBgBfBV>D:S:S:f>V:6;f:5GT>U>4CE2S>U:SBeBU6S:f:5?T>5Cf:S> V:U>e>T6T:SFU>5CE>V:S>6?f6T6eBg>U>V>e6T:D6B6D?e:e>5?U>T6T6D:D?W6T>U>47B:f: e6e:4?eBg>e>U>TGg:S>S>e2T>S6e:E6E:e:E:U>3?B:U:S:D:e>R>C:S>U:S6T:f:U>f6e: S636S:f:d>S:U>F6T>T>5736T6T:E:U6B6T:S>D:e>U:T6e>U>e:D:T6T:g:T>57e:S6e>e: B6D:f>T>e:e:D:T6D6BBD:S:T>e6T:D6B6DB5;D:T6T>D2S>eBD:f>eBf:f>e>UNHCU>V>gBd> U>eB5;T:eBU:f>VBE:U>U>f6S>D>E:U6e>U:e>eBf:5?eBU6T6T6eB4:D:S>e:T:f:fBS6B:e> 4;f>D:D:U>V6e:f:U>D:6?e:f:f:T6D?C6T>T>36D:D:E6S:S>U:U:D:f:S>e:C6h:T>U>U>T> U:D:D:hBe:S:S:V:36T>h:S>g:5C5Cf>e>kK7?F?gBW>U>eBg>U>D:5?e:57U:f:e>UBT> e6U2S>D:f:S>g:U:S>e:5?D:T6B:h6f:S>f:T6e>S:U>D2S>DBe:E6e:S:f6B:U:37e:C?gBU> f:S>TJV:T>V>D6T:S:f6B:T6T6S6e:UBU6T>D:D?D:f>T6T:f>T6D23;E:T636C;U6B6TCU6D? 4?6CU>g>4PHC5G5CF;e>f>g:f6U:eBf>fB4?e:S:5?V:e>e>C:U:SBU:f:U>U>g>eBU:S>D:D? e>S:U>f:T>U>5;U:36T:h>f:e:S6eBD:U>TBS>UF5?g>eBU>U>8?U>5;e:T6T6eBD6T:D>T>e> e:g>D:f:fJg:e>e>e>4?e:e:SF5;f>D6TFe>D2SJg:DFDBgB7?6?gNHCU>V>gBC:U>e:S:R6D: U:e:UBE:36T>f6C:D:E2S6T6U:S:S>f:f:D:U6T6T6DBD:46S6e:S6T:U>S6C6B64?e:D:36D: V6T6e:56T:V>e:f:f:U6D?T6T>C:D6B:D:U6B6S:U6T:D:d:T:S:T:7?D:D>U>D>D:U>D:hBe> T:S:F:T636h:S:F25C5C5?e>kK7?F?FCV:5?g>U>E>e:e>fBf>7;T6e>eBT:f:5;C:e>4?U:U> 6CfBf:e>e>D:e:h:f6T:e>U>T>5?U:T:D2SFgBf:T6e:C?T>eB57S>5;fB5CU>5?eJg>e>U:f: D:e:3?D6T>5?T>f:T>f>U6e>UGg:e:6?f:f:5?e:UCh>g>U6D;e>T6B?U:D;3G7?6GgB6?D: 5GGKHCXOFGFKjFIKHKjFXGgOgBWKGC4KiOVOGCWOY;FGFKj?XGi?H;5G7C5CG> hOWKWOkFXG8OYC5GXG7GdFXCgBWKG;GCWOY;7Gi77GeBg>e>6GTBXOYCiG7GiOX;FGFKj?XGi? HKeBGCgBF;4G7GiJH?X>FG6?6;gC5GXG77gBWKG3gBG7F;f:D:e>gRYGg:f>6?4CW>U>F?E?6? F?5CfFW6eBg>4;6GWBh>eBGCV>U>FG6C5G5?e:f:D:eFfFhBgBW?5C5?GCD:5Cf:E?5CU6eBg> 7?eBGCg:5GE:5?6?U>f:UC5CGC4Gf:5G7CV>U>FG6C5G5?V>f>T6T>8;f:5C6?5;U>U:S:8GU> 5Cf:W6eBg>66e>W>FG6?6C5?YGg:S:e>D>57T6eBTBe>eBT>U:67B:f:D>e>675;D: 5Cf6T6eBg>U>V>D:U:C2C:g:6;f:5GT>U>5CU6S>U:SBT>U6B:f:4?D:5Cf:T>V:S>g>T6T> fFg>5CU>g:S>6?f6T6eB6?U>g>e:e>U:S6D?S:S>f>T>S>T636CCg:e>U:3?D:f:f6B:57DCg> e>6C5PHCU>f>g:eBT>e:f6U>eBf>f>5CD:S>f:V:e>eBD:U>UBT:e:5Cf:f>e:U>U:S:D?d>S: S>g:U:fBf:S6T6T>h>f>D:S>eFU6T>gBS>e>U6gBg>e>U>8;T>U:e:36e>TBT6S:fBU:f>D:e: f:U:TJV:T>4?U>T>e>T6TJ6?e:f:DFe:S:SBD2SFDBGCgB6?gVkK7?g>eBfBU6eBUB4?e>6?U> U>f:U6eBE?f>VBE:e>e>V6T>U>U:S>g:5?e>U6eJVBV:U>g>U>5;f:U>D:e:D?U>T6T6e>V6B: e:W6e:V>DC5Cg:5?fGf>5?f>T6e:f>V6T>U>U:S>g:fBU>f:e>8;S:f>T6f:f:U:C:h>D:U: C2i:U6T:h:36i:7GGC5G6?;PHC5;f>g>5?T>g>VBe>eBg>f>6?e:D:fFf>6?5;D:f:E?T:f>4? U>6?eBf:f:e>8?6;f:5CV>U>5Cf:f:S:SJg>f>e:D:E?D:f:E;S>5;fF6?6?5C5O7C5Cf>g>T> U>E?T6e>4?U>6?e>6?e>e>gGU:e>g>4?5?U>U:UCg:5?T:S?e>D:D?U6R?DGFG6G7Gg: 36eB6GW?GK5C7GXB8GWGXBGKUK5?FGFGdFWKEK6GFKH75C7GX;GKW;W?eBgB6?F: VKFGHKYBGKhJi?gBGCGGRBG?5?FGF76GFKH;FCW;HKS>U>f:fBD>GKi?WCFCWKW75C7GX;GKW; WGU>6?6C57dBFCWFW;h:5C5Cg:U?gBGCG;5?FGF77GX357e>U:S:fJ7?D2C6T>S:56T6e:d6T> e6S:U>U6B:f>e:T>E:U6D:f:46T6e>U>U>U>D:f:D6BBU>E:e:5;S:U>fBT6e:S:e6S:T6B:U> g:D:5?F:eBf:U>6?U:S:ECU:fBT>U:S>U>E:S6e>g:U>U>e:5?e:D:V2S:S>e>U:S>U:C27?f: 5?e:W>e>D:V6e>56FG6?U>5CYGg:S:T>F6e6S>D:4:S6e:T:e:f6D2S:f>C6T6e6B:S:d6C:D: f:e:T6e:S:S:D6V6T2C:S>D:S:e:E:C:36TBT:T6D2S64;S6S>e2S:5;U>e>e>U:SFU6S: E6T636T6e:36C:e:S:T6D>T>D:f:D?C6T6U:U6U6e:U:C?U>T>D:47e:D2C?D:47cBgB6?U>5? D:5GGGiCFK6GHCh>7GFKhFGKUKFC5GWKTBFGEKgB7G7;6CGCW;GKG?FCU> 6G7CF6EG5C7GXB7GhJW;5?6?FGdFG?5C5GF76G6GH;5GF?WGD:fBg>U>4:6GW;F?5?FGF75? 6CG;7GG7FCe:f:5C6;4CFGVFW;g>eB5G6;U?g>FCW?eB5C5;FCG7g2S>g>T6TFg:5GHGFKFK7? FK7?VGFKX?7GXFhB7?FKW>GG8KhBGGFG4?FG7G3C7GDK5?eB7?F;4K8CWGH?7GX;GK5CgBFGF> 7GeB6?FKc>gBFC3GFCTGi:S>g:5?f6EGWOEG5GFCGK4?FG7G3C7GDKh>U>5C5GTB5GG76GD?f: 5GgBSFe:fB5GeB5?6GEC7GDC36eBf>T67?eBWCGGiFWC6GHG4KFGHKEGW?X?FCgBW7EGX? WCFCGCWB6GGGVFWGXFiBf:5GFGTBXCGKWK4GWGUKjB5C5GH;EGh>6CgBGBFCGCGB7GWJW? U6eB5C5?eFWKjF8C7G7GH>6GFGVFWGXFH?e>eB7?g:6CGGDGXFf>U>FCV>iB5C5GX> gBgBhFFGgFV6B:5Cg>4?D:5G5GF;6G5?FCG>hBFCWB7GUGeB5C5GRBFG4GfB5G775?6CG; 7GG7F;U>U>6CF6EG5C7GH>6GVFW;U>6?FCSB7?e>5C57gB6G735?F77Ge>D:5?U>D:6GW;F?5? FGF3e>gBG76GF7FCD:f:5?e:dB5CVFF7V:e>eBg:U;f>6?F7e:5C5;gBG?g>D2S>6?gFg: 5G8GHGEG8G6GW;VCGGW?WG7Oi>6G7?F>GKiF8C6GWG4G6GWKUGWKDGe>6?eBG;4K8GGGX;FGG? XKf>6GgBW>WGg>6G7?DCFGXG3CFGCCW>g:S>6?g:EGXKEK6CFGHCdB6CGKDGGKDGW:fBU> gBUB7CG?HGD;fBg:5C5OfBFGgBe>5C7?4?FG5Cg:36eBFCHCU>FGWG6KHC7?FKEO7GFKEG7CH? eBWGg:VKWCH?gB7GXB6?FGiF6GWFF:5Gg:5GfFjGFCWGEC7GDGh:5?FC5?EGh> eBFGVBfBFGFB5G6B57eBU6eB6C5KHK7KhB5GFKWB5?FCGB6CWFF7e:5?eB7;6C5GDCVFS>5CU> g>X:fBgBU>eB5CF>eBV>gBU6B:5GFCU6eB6GG?GC5C6GWB8?FGWBFGECf>6GFCeF7GECeB6? F7fB6GF;gB7?F;e>gBU>g>VKgBGGVB5GGBF;f>eB7?TBF;f>gBF7U>gBg:5Cg67GS:5?D: 5CVBGCW?7;5CgBW7U>6C53fB57FCT:S>g:5?d>6CGB5;V:U>5?e:D7e:f:5?e>U>5;gB5;5?5? D2S>6CU6B:f>6G4CW>5?F7E?6GF75CWFW>eBgBG:6GWBh>gBFCR>5?FG3C7G4GD:f:5?e: eFhBFCG75C7;GKf:fB5GF65CT>eBgBe>gBGC4C5CCC76e>g:S>g:5CGK4G5C5C7GS>5? 6G3C7GDGV6T>5CU>4:fB576G4;S>U>g:UFe:5C5Gf>e>6G4?6GS>eBg:36eB7?D:5CFGiBW? 6G6GeFFCGG4GW?X?g>FCW;4CG?WC5CFGF>6G6GXFWGhBh:eB5Gg:E>G?6GFK4GFGUGX>fBgBG; 4Gh>g>FChBFCFKW>6CWFG7S>5CU6eBTBFGXBh>gBGCW>gB6GWFFGGB7;T>U>6?e65C7CDGXBU: 5?FC5?iBfB7Gi:f>6?gB6GW>U>6CU6B:ECU:5GFGW?5G6C7?V:gB5GgB7GUG5?eBFKC>5C4GU> gBg:5?6?F;7G7;5?D:fB7CU24Ce>gBG>gBVFF7e:f:5CUB7?e>eB5;gBgB77eB5;FC36T>6?D: E6fBF75;e:5C5;e:f>67gB635?S6T6eBgBeB5CUFF7U:S>eB6?U;f:5?F;S>e>e>5?6;U6e>6? D2SJ7?5GHGFK6G7?FG6?EC6GH?7GXFhBg>FKW:6GhFh>FCFC4?FG6G3C7G4Gf:eB7?6? dFhBFCG;6CG;GKeBfB5Cg>7GeBg>6Ge>gBFCeB6CEGW6S>6Cg:3;4CGK4GfB5C7Gf> 5C6G4C7G3GV>T>e>FCVB5G776G4?U:fBgBUFf:fB5GU>f>gB6C6G5?T>FGg:36HC5GiGgB7G7? eB7?5KgBFG4?F76;5?eB7;EGF?7;fBgBG>eB6?6>5?FBV>D:5?eBUBXC5CGC4?6G3CW:f:5Cf: 4?F:f>eBG:e:fBU>fBUB6;36e>5CUBfF7GhFV>5C5GW>e>6?F>5?VB67T6e>eBh6U>6Cc>FBT: S>g:U6V:S:U>g>T>e>g>f>gBU6eB6CU62 ; map<unsigned long long, int> inds = { {0ull, 0}, {1ull, 1}, {2ull, 173}, {3ull, 223}, {4ull, 247}, {5ull, 259}, {6ull, 268}, {7ull, 274}, {8ull, 277}, {9ull, 278}, {10ull, 279}, {11ull, 280}, {12ull, 281}, {13ull, 282}, {14ull, 283}, {15ull, 284}, {16ull, 285}, {17ull, 286}, {18ull, 287}, {19ull, 288}, {24ull, 2}, {25ull, 96}, {26ull, 128}, {27ull, 142}, {28ull, 151}, {29ull, 157}, {30ull, 161}, {31ull, 162}, {32ull, 163}, {33ull, 164}, {34ull, 165}, {35ull, 166}, {36ull, 167}, {37ull, 168}, {38ull, 169}, {39ull, 170}, {40ull, 171}, {41ull, 172}, {48ull, 174}, {49ull, 193}, {50ull, 202}, {51ull, 208}, {52ull, 212}, {53ull, 213}, {54ull, 214}, {55ull, 215}, {56ull, 216}, {57ull, 217}, {58ull, 218}, {59ull, 219}, {60ull, 220}, {61ull, 221}, {62ull, 222}, {72ull, 224}, {73ull, 231}, {74ull, 235}, {75ull, 237}, {76ull, 238}, {77ull, 239}, {78ull, 240}, {79ull, 241}, {80ull, 242}, {81ull, 243}, {82ull, 244}, {83ull, 245}, {84ull, 246}, {96ull, 248}, {97ull, 250}, {98ull, 251}, {99ull, 252}, {100ull, 253}, {101ull, 254}, {102ull, 255}, {103ull, 256}, {104ull, 257}, {105ull, 258}, {120ull, 260}, {121ull, 261}, {122ull, 262}, {123ull, 263}, {124ull, 264}, {125ull, 265}, {126ull, 266}, {127ull, 267}, {144ull, 269}, {145ull, 270}, {146ull, 271}, {147ull, 272}, {148ull, 273}, {168ull, 275}, {169ull, 276}, {553ull, 3}, {554ull, 50}, {555ull, 67}, {556ull, 76}, {557ull, 82}, {558ull, 85}, {559ull, 86}, {560ull, 87}, {561ull, 88}, {562ull, 89}, {563ull, 90}, {564ull, 91}, {565ull, 92}, {566ull, 93}, {567ull, 94}, {568ull, 95}, {577ull, 97}, {578ull, 108}, {579ull, 114}, {580ull, 118}, {581ull, 119}, {582ull, 120}, {583ull, 121}, {584ull, 122}, {585ull, 123}, {586ull, 124}, {587ull, 125}, {588ull, 126}, {589ull, 127}, {601ull, 129}, {602ull, 133}, {603ull, 134}, {604ull, 135}, {605ull, 136}, {606ull, 137}, {607ull, 138}, {608ull, 139}, {609ull, 140}, {610ull, 141}, {625ull, 143}, {626ull, 144}, {627ull, 145}, {628ull, 146}, {629ull, 147}, {630ull, 148}, {631ull, 149}, {632ull, 150}, {649ull, 152}, {650ull, 153}, {651ull, 154}, {652ull, 155}, {653ull, 156}, {673ull, 158}, {674ull, 159}, {675ull, 160}, {1106ull, 175}, {1107ull, 181}, {1108ull, 184}, {1109ull, 185}, {1110ull, 186}, {1111ull, 187}, {1112ull, 188}, {1113ull, 189}, {1114ull, 190}, {1115ull, 191}, {1116ull, 192}, {1130ull, 194}, {1131ull, 195}, {1132ull, 196}, {1133ull, 197}, {1134ull, 198}, {1135ull, 199}, {1136ull, 200}, {1137ull, 201}, {1154ull, 203}, {1155ull, 204}, {1156ull, 205}, {1157ull, 206}, {1158ull, 207}, {1178ull, 209}, {1179ull, 210}, {1180ull, 211}, {1659ull, 225}, {1660ull, 226}, {1661ull, 227}, {1662ull, 228}, {1663ull, 229}, {1664ull, 230}, {1683ull, 232}, {1684ull, 233}, {1685ull, 234}, {1707ull, 236}, {2212ull, 249}, {12720ull, 4}, {12721ull, 24}, {12722ull, 33}, {12723ull, 38}, {12724ull, 41}, {12725ull, 42}, {12726ull, 43}, {12727ull, 44}, {12728ull, 45}, {12729ull, 46}, {12730ull, 47}, {12731ull, 48}, {12732ull, 49}, {12744ull, 51}, {12745ull, 56}, {12746ull, 59}, {12747ull, 60}, {12748ull, 61}, {12749ull, 62}, {12750ull, 63}, {12751ull, 64}, {12752ull, 65}, {12753ull, 66}, {12768ull, 68}, {12769ull, 69}, {12770ull, 70}, {12771ull, 71}, {12772ull, 72}, {12773ull, 73}, {12774ull, 74}, {12775ull, 75}, {12792ull, 77}, {12793ull, 78}, {12794ull, 79}, {12795ull, 80}, {12796ull, 81}, {12816ull, 83}, {12817ull, 84}, {13273ull, 98}, {13274ull, 101}, {13275ull, 102}, {13276ull, 103}, {13277ull, 104}, {13278ull, 105}, {13279ull, 106}, {13280ull, 107}, {13297ull, 109}, {13298ull, 110}, {13299ull, 111}, {13300ull, 112}, {13301ull, 113}, {13321ull, 115}, {13322ull, 116}, {13323ull, 117}, {13826ull, 130}, {13827ull, 131}, {13828ull, 132}, {25440ull, 176}, {25441ull, 177}, {25442ull, 178}, {25443ull, 179}, {25444ull, 180}, {25464ull, 182}, {25465ull, 183}, {292561ull, 5}, {292562ull, 13}, {292563ull, 17}, {292564ull, 18}, {292565ull, 19}, {292566ull, 20}, {292567ull, 21}, {292568ull, 22}, {292569ull, 23}, {292585ull, 25}, {292586ull, 27}, {292587ull, 28}, {292588ull, 29}, {292589ull, 30}, {292590ull, 31}, {292591ull, 32}, {292609ull, 34}, {292610ull, 35}, {292611ull, 36}, {292612ull, 37}, {292633ull, 39}, {292634ull, 40}, {293114ull, 52}, {293115ull, 53}, {293116ull, 54}, {293117ull, 55}, {293138ull, 57}, {293139ull, 58}, {305281ull, 99}, {305282ull, 100}, {6728904ull, 6}, {6728905ull, 8}, {6728906ull, 9}, {6728907ull, 10}, {6728908ull, 11}, {6728909ull, 12}, {6728928ull, 14}, {6728929ull, 15}, {6728930ull, 16}, {6729457ull, 26}, {154764793ull, 7}}; void solve() { vector<bool> bits; for (char c : encoded) { int cur = c; if (c > ) { --cur; } cur -= 50; for (int j = 0; j < 6; ++j) { bits.push_back(cur & (1 << j)); } } int c = 0; for (int i = 0; i < 289; ++i) { for (int j = 0; j < 289; ++j) { for (int k = 0; k < 4; ++k) { real_dist[i][j] |= bits[c++] << k; } } } vector<int> sieve(MAXV); for (int i = 2; i < MAXV; ++i) { if (!sieve[i]) { sieve[i] = i; for (long long j = (long long)i * i; j < MAXV; j += i) { sieve[j] = i; } } } function<int(int)> get_ind = [&](int a) { vector<int> pows; map<int, int> cnt; int tmp = a; while (tmp > 1) { int div = sieve[tmp]; cnt[div]++; tmp /= div; } for (pair<int, int> p : cnt) { pows.push_back(p.second); } sort(pows.begin(), pows.end()); unsigned long long h = 0; for (int num : pows) { h = h * 23 + num; } return inds[h]; }; int t; cin >> t; for (int i = 0; i < t; ++i) { int a, b; cin >> a >> b; int ind1 = get_ind(a); int ind2 = get_ind(b); cout << real_dist[ind1][ind2] << n ; } } int main() { cerr << fixed << setprecision(15); cout << fixed << setprecision(15); ios::sync_with_stdio(false); int tests = 1; for (int it = 1; it <= tests; ++it) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long t; cin >> t; while (t--) { long long a, b, c, i, j; cin >> a >> b >> c; string f, s, third; if (a) { s = string(a + 1, 0 ); } if (c) { f = string(c + 1, 1 ); } if (b) { bool flag; if (a == 0 && c) { flag = true; for (i = 0; i < b; i++) { if (flag) { third += 0 ; flag = false; } else { third += 1 ; flag = true; } } cout << f << third << endl; continue; } if (c) { b--; } flag = true; for (i = 0; i < b; i++) { if (flag) { third += 1 ; flag = false; } else { third += 0 ; flag = true; } } if (a == 0 && c == 0) { if (b & 1) third += 0 ; else third += 1 ; } } cout << f << s << third << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; for (int i = 0; i < s1.size(); i++) { s1[i] = tolower(s1[i]); s2[i] = tolower(s2[i]); } if (s1 < s2) { cout << -1; } else if (s2 < s1) { cout << 1; } else { cout << 0; } return 0; }

#include <bits/stdc++.h> using namespace std; const float pi = acos(-1.0); const int maxn = 1e5 + 5; int c[maxn]; long long a[5][maxn], b[maxn]; vector<int> vec[maxn]; void dfs(int u, int fa) { for (auto p : vec[u]) { if (p != fa) { c[p] = 6 - c[u] - c[fa]; dfs(p, u); } } } int main() { int u, v; int t, n; cin >> n; for (int i = 1; i <= 3; i++) for (int j = 1; j <= n; j++) cin >> a[i][j]; int fu, fv; for (int i = 1; i <= n - 1; i++) { cin >> u >> v; vec[u].push_back(v); vec[v].push_back(u); } int cnt = 0, cnt1 = 0; for (int i = 1; i <= n; i++) { if (vec[i].size() == 2) { cnt++; } if (vec[i].size() == 1) { fv = i; cnt1++; } } if (cnt != n - 2 && cnt1 != 2) { puts( -1 ); return 0; } long long res = 1e17, ans = 0; ; for (int i = 1; i <= 3; i++) { for (int j = 1; j <= 3; j++) { if (i == j) continue; fu = vec[fv][0]; c[fu] = i, c[fv] = j; dfs(fu, fv); ans = 0; for (int k = 1; k <= n; k++) ans += a[c[k]][k]; if (ans < res) { res = ans; for (int k = 1; k <= n; k++) { b[k] = c[k]; } } } } printf( %lld n , res); for (int i = 1; i <= n; i++) cout << b[i] << ; cout << endl; }

#include <bits/stdc++.h> using namespace std; int n, a, b, d[500], s; int main() { scanf( %d , &n); for (int i = 1; i <= 2 * n; i++) scanf( %d , &d[i]); for (int i = 1; i <= 2 * n; i++) for (int j = 1; j <= 2 * n; j++) if (d[i] == d[i + (2 * j - 1)]) s++; printf( %d , s); scanf( ); }

#include <bits/stdc++.h> template <class T> T Min(const T &a, const T &b) { return a < b ? a : b; } template <class T> T Max(const T &a, const T &b) { return a > b ? a : b; } template <class T> bool Chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template <class T> bool Chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } struct fast_input { static const int L = 1 << 15 | 1; char buf[L], *l, *r; fast_input() { l = r = buf; } void Next(char &c) { if (l == r) r = (l = buf) + fread(buf, 1, L, stdin); c = l == r ? (char)EOF : *l++; } template <class T> void operator()(T &x) { char c, f = 0; for (Next(c); !isdigit(c); Next(c)) if (c == - ) f = 1; for (x = 0; isdigit(c); Next(c)) x = x * 10 + c - 0 ; if (f) x = -x; } } input; const int N = 1000 + 3; const int M = 100000 + 7; const int MOD = 998244353; int n, m, a[N], f[N][N], ans[M], b[M]; int Power(int x, int y) { int ret = 1; while (y) { if (y & 1) ret = 1LL * x * ret % MOD; x = 1LL * x * x % MOD, y >>= 1; } return ret; } int main() { int x, y, z; input(n), input(m); for (int i = (1), i_end = (n); i <= i_end; ++i) input(a[i]), b[a[i]] = 1; std::sort(a + 1, a + n + 1); ans[0] = 1; for (int i = (m + 1), i_end = (n); i <= i_end; ++i) ans[0] = 1LL * ans[0] * i % MOD; for (int i = (2), i_end = (n - m); i <= i_end; ++i) ans[0] = 1LL * ans[0] * Power(i, MOD - 2) % MOD; int maxans = 0; while (ans[maxans++]) { x = 0; for (int i = (1), i_end = (n); i <= i_end; ++i) x |= (a[i] - maxans + 1 >= 0 && b[a[i] - maxans + 1]); if (!x) { ans[maxans] = ans[maxans - 1]; continue; } f[0][0] = 1, x = 0; for (int j = (1), j_end = (n); j <= j_end; ++j) { for (int k = (1), k_end = (m); k <= k_end; ++k) { while (a[j] - a[x + 1] >= maxans) ++x; f[j][k] = (f[j - 1][k] + f[x][k - 1]) % MOD; } f[j][0] = f[j - 1][0]; } ans[maxans] = f[n][m]; } int ret = 0; for (int i = (1), i_end = (maxans - 2); i <= i_end; ++i) ret = (ret + 1LL * (ans[i] - ans[i + 1]) * i) % MOD; printf( %d n , (ret + MOD) % MOD); return 0; }

#include <bits/stdc++.h> using namespace std; struct S { long long prime; int q, h, ji; }; S xxx[300000]; priority_queue<S> sum[4]; bool biao[300000]; bool operator<(const S &a, const S &b) { return a.prime > b.prime; } int main() { int x, y; cin >> x; for (int a = 0; a < x; a++) { cin >> xxx[a].prime; xxx[a].ji = a; } for (int a = 0; a < x; a++) cin >> xxx[a].q; for (int a = 0; a < x; a++) cin >> xxx[a].h; for (int a = 0; a < x; a++) { sum[xxx[a].q].push(xxx[a]); sum[xxx[a].h].push(xxx[a]); } cin >> y; while (y--) { cin >> x; while (!sum[x].empty() && biao[sum[x].top().ji]) sum[x].pop(); if (sum[x].empty()) cout << -1 ; else { cout << sum[x].top().prime; biao[sum[x].top().ji] = 1; sum[x].pop(); } y == 0 ? cout << endl : cout << ; } return 0; }

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; long long n, m, a, b, c, k, temp, x, y; const int MAXN = 1e5 + 11, mod = 1e9 + 7; inline long long max(long long a, long long b) { return ((a > b) ? a : b); } inline long long min(long long a, long long b) { return ((a > b) ? b : a); } inline vector<long long> read(int n) { vector<long long> v(n); for (int i = 0; i < v.size(); i++) cin >> v[i]; return v; } long long setbits(long long n) { if (n % 4 == 0) return n; if (n % 4 == 1) return 1; if (n % 4 == 2) return n + 1; if (n % 4 == 3) return 0; return 1e18; } long long getxor(long long x, long long m) { return setbits(x + m - 1) ^ setbits(x - 1); } void sol() { cin >> n; long long txor = 0; for (int i = 0; i < n; i++) { cin >> x >> m; txor = txor ^ getxor(x, m); } if (txor) cout << tolik ; else cout << bolik ; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int test = 1; for (int i = 1; i <= test; i++) sol(); }

#include <bits/stdc++.h> using namespace std; int main() { int a[101], dif[100], i, unique[101], c = 0; int min = 0, n, dif1, dif2; cin >> n; for (i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); unique[c] = a[0]; c++; for (i = 1; i < n; i++) { if (a[i] != a[i - 1]) { unique[c] = a[i]; c++; } } if (c >= 4) { cout << -1; } else if (c == 1) { cout << 0 << endl; } else if (c == 2) { if ((unique[1] - unique[0]) % 2) { cout << unique[1] - unique[0]; } else { cout << (unique[1] - unique[0]) / 2; } } else { if (unique[2] - unique[1] == unique[1] - unique[0]) { cout << unique[2] - unique[1]; } else { cout << -1 << endl; } } }

#include <bits/stdc++.h> using namespace std; long long n; int k; long long a[100050]; int main() { cin >> n >> k; for (int i = 1; i <= k; i++) cin >> a[i]; long long A = 1, B = 0, C = 0; for (int i = 1; i <= k; i++) { if (n - n % a[i] > C) { A = 1ll * i, B = n / a[i]; C = n - n % a[i]; } } cout << A << << B; return 0; }

#include <bits/stdc++.h> using namespace std; int n, q, A[100005 * 3], B[100005 * 3], ans[100005]; int gcd(int a, int b) { return !b ? a : gcd(b, a % b); } vector<pair<int, int> > G[100005]; vector<int> E[100005]; pair<int, int> SL(pair<int, int> a) { int t = gcd(abs(a.first), abs(a.second)); a.first /= t, a.second /= t; return a; } int tr[100005]; void upd(int u, int v) { for (; u <= n; u += u & -u) tr[u] += v; } int qry(int u) { int r = 0; for (; u; u -= u & -u) r += tr[u]; return r; } map<pair<int, int>, int> mAp; int main() { scanf( %d , &n); for (int i = (1), LIM = (n); i <= LIM; i++) { int K; scanf( %d , &K); for (int j = (0), LIM = (K - 1); j <= LIM; j++) { scanf( %d%d , &A[j], &B[j]); if (j) G[i].push_back(SL(make_pair(A[j] - A[j - 1], B[j] - B[j - 1]))); } G[i].push_back(SL(make_pair(A[0] - A[K - 1], B[0] - B[K - 1]))); } scanf( %d , &q); for (int i = (1), LIM = (q); i <= LIM; i++) { scanf( %d%d , &A[i], &B[i]); E[B[i]].push_back(i); } for (int i = (1), LIM = (n); i <= LIM; i++) { for (auto u : G[i]) { int t = mAp[u]; upd(t + 1, 1), upd(i + 1, -1); mAp[u] = i; } for (int u : E[i]) ans[u] = qry(A[u]); } for (int i = (1), LIM = (q); i <= LIM; i++) printf( %d n , ans[i]); }

#include <bits/stdc++.h> using namespace std; inline int inp() { return 0; } inline int inp(bool& A) { if (cin >> A) return 1; return -1; } inline int inp(char& A) { return scanf( %c , &A); } inline int inp(int& A) { return scanf( %d , &A); } inline int inp(float& A) { if (cin >> A) return 1; return -1; } inline int inp(long long& A) { return scanf( %I64d , &A); } inline int inp(double& A) { return scanf( %lf , &A); } inline int inp(char* A) { return scanf( %s , A); } inline int inp(string& A) { if (cin >> A) return 1; return -1; } template <class Front, class... Queue> inline int inp(Front& A, Queue&... B) { return inp(A) + inp(B...); } inline int oup() { return 0; } inline int oup(bool A) { if (cout << A) return 1; return -1; } inline int oup(char A) { return printf( %c , A); } inline int oup(int A) { return printf( %d , A); } inline int oup(float A) { if (cout << A) return 1; return -1; } inline int oup(long long A) { return printf( %I64d , A); } inline int oup(double A) { return printf( %lf , A); } inline int oup(char* A) { return printf(A); } inline int oup(const char* A) { return printf( %s , A); } inline int oup(string& A) { if (cout << A) return 1; return -1; } template <class Front, class... Queue> inline int oup(Front A, Queue... B) { return oup(A) + oup(B...); } template <class T> inline void remax(T& A, T B) { if (A < B) A = B; } template <class T> inline void remin(T& A, T B) { if (A > B) A = B; } string ToString(long long num) { string ret; do { ret += ((num % 10) + 0 ); num /= 10; } while (num); reverse(ret.begin(), ret.end()); return ret; } long long ToNumber(string s) { long long r = 0, p = 1; for (int i = s.size() - 1; i >= 0; --i) r += (s[i] - 0 ) * p, p *= 10; return r; } long long Gcd(long long a, long long b) { while (a %= b ^= a ^= b ^= a) ; return b; } long long Power(long long base, long long power) { long long ret = 1; while (power) { if (power & 1) ret *= base; power >>= 1; base *= base; } return ret; } long long PowerMod(long long base, long long power, long long mod) { if (!power) return 1; if (power & 1) return (base * PowerMod(base, power - 1, mod)) % mod; return PowerMod((base * base) % mod, power >> 1, mod); } int Log(long long num, long long base) { int ret = 0; while (num) { ++ret; num /= base; } return ret; } int Count(long long mask) { int ret = 0; while (mask) { if (mask & 1) ++ret; mask >>= 1; } return ret; } inline void run() { in:; int n, m, k; if (inp(n, m, k) != 3) return; vector<int> a(m), b(m), c(m); long long ans = 0; for (int i = 0; i < m; ++i) inp(a[i], b[i], c[i]); while (k--) { int tmp; inp(tmp); for (int i = 0; i < m; ++i) if (tmp >= a[i] && tmp <= b[i]) ans += (long long)c[i] + tmp - a[i]; } oup(ans, n ); goto in; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); run(); return 0; }

#include <bits/stdc++.h> using namespace std; string s, ss; int idx; int main() { cin >> s; for (int i = 0; i < s.length(); i++) { if (s[i] == . ) { idx = i; break; } } if (s[idx - 1] != 9 ) { if (s[idx + 1] < 5 ) { ss = s.substr(0, idx); } else { ss = s.substr(0, idx); ss[ss.length() - 1]++; } } else if (s[idx - 1] == 9 ) { cout << GOTO Vasilisa. ; } cout << ss; return 0; }

#include <bits/stdc++.h> using namespace std; int n, i, k, x; string s; int main() { cin >> n >> k >> s; for (i = 0; i < n; i++) { if (s[i] == # ) x++; else x = 0; if (x == k) { cout << NO ; return 0; } } cout << YES ; }

#include <bits/stdc++.h> using namespace std; struct Node { int u; map<char, int> child; }; vector<Node> grafo; int win[100005], lose[100005]; void addTrie(int u, string &s) { for (char c : s) { if (grafo[u].child.count(c) == 0) { Node novo; novo.u = grafo.size(); grafo[u].child[c] = grafo.size(); grafo.push_back(novo); } u = grafo[grafo[u].child[c]].u; } } void solve(int u) { if (grafo[u].child.size() == 0) { win[u] = 0; lose[u] = 1; } for (pair<int, int> par : grafo[u].child) { int v = par.second; solve(v); win[u] = (win[u] || !win[v]); lose[u] = (lose[u] || !lose[v]); } } int main() { ios::sync_with_stdio(false); Node root; root.u = 0; grafo.push_back(root); int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { string s; cin >> s; addTrie(0, s); } solve(0); int w = win[0], l = lose[0]; if (w == 0) cout << Second << endl; else if (w == 1 && l == 1) cout << First << endl; else if (w == 1 && l == 0 && k % 2 != 0) cout << First << endl; else cout << Second << endl; return 0; }

#include <bits/stdc++.h> using namespace std; template <class T> using v2d = vector<vector<T> >; template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); const int maxN = 2e5 + 10; const long long inf = 1e18; int n; long long k, a[maxN]; bool check(long long d) { long long c = 1, x = d - 1, y = 0, sum = 0; bool ovf = 0; for (int i = n; i; i--) { if (a[i] > 0 && (ovf || (long double)sum + (long double)c * a[i] > inf)) { return 1; } if (a[i] > 0) { sum += c * a[i]; } if (sum >= k) { return 1; } x++; y++; if ((long double)c * x / y > inf) { ovf = 1; } else { __int128 tmp = c; tmp *= x; tmp /= y; c = tmp; } } return sum >= k; } void solve() { cin >> n >> k; for (int i = 1; i <= (int)(n); ++i) { cin >> a[i]; } if (*max_element(a + 1, a + n + 1) >= k) { cout << 0; return; } long long l = 0, r = inf; while (r - l > 1) { long long mid = (l + r) / 2; if (check(mid)) { r = mid; } else { l = mid; } } cout << r; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int T = 1; while (T--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; inline int qr() { int f = 0, fu = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) fu = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { f = (f << 3) + (f << 1) + c - 48; c = getchar(); } return f * fu; } const int N = 2e5 + 10; int a[N], n, k, T; pair<int, int> b[N]; int main() { T = qr(); while (T--) { n = qr(), k = qr(); for (register int i = 1; i <= n; ++i) a[i] = qr(); for (register int i = 1; i <= n; ++i) qr(); sort(a + 1, a + n + 1); int m = 0; for (register int i = 1; i <= n; ++i) { b[++m] = {a[i], 0}; int j = i; while (a[j] == a[i]) b[m].second++, j++; i = j - 1; } for (register int i = 1; i <= m; ++i) b[i].second += b[i - 1].second; if (k * 2 >= a[n] - a[1]) { printf( %d n , n); continue; } vector<int> st(m + 1); int ans = 0; for (int i = 1, j = 1; i <= m; i++) { while (b[i].first - b[j].first > k) j++; st[i] = max(st[i - 1], b[i].second - b[j - 1].second); ans = max(ans, b[i].second - b[j - 1].second + st[j - 1]); } printf( %d n , ans); } return 0; }

#include <bits/stdc++.h> using namespace std; long long a[1000006]; map<pair<long long, long long>, long long> mp; int main() { long long n, k; cin >> n >> k; if (k == 0 && n != 1) { cout << No solution ; return 0; } if (n == 1) { cout << k; return 0; } if (k != 1) { cout << k - 1; for (int i = 0; i < n - 2; i++) cout << 0; cout << 1; return 0; } if (k == 1) { cout << 9; for (int i = 0; i < n - 2; i++) cout << 0; cout << 1; return 0; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int64_t k; cin >> k; int64_t r = 2, c = 3; cout << r << << c << endl; int64_t arr[2][3]; int64_t ones = ((int64_t)1 << 18) - 1; arr[0][0] = ones; arr[0][1] = ((int64_t)1 << 17); arr[0][2] = 0; arr[1][0] = k; arr[1][1] = ones; arr[1][2] = k; for (int64_t i = 0; i < r; i++) { for (int64_t j = 0; j < c; j++) { cout << arr[i][j] << ; } cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int a[2][2]; cin >> a[0][0] >> a[0][1] >> a[1][0] >> a[1][1]; int n[2]; if (!a[0][0] && !a[1][0] && !a[0][1] && !a[1][1]) { cout << 0 ; return 0; } for (int i = 0; 1; i++) { int temp = i * (i - 1) / 2; if (temp == a[0][0]) { n[0] = i; break; } if (temp > a[0][0]) { cout << Impossible ; return 0; } } for (int i = 0; 1; i++) { int temp = i * (i - 1) / 2; if (temp == a[1][1]) { n[1] = i; break; } if (temp > a[1][1]) { cout << Impossible ; return 0; } } if (n[0] == 0) if (a[0][1] || a[1][0]) n[0] = 1; if (n[1] == 0) if (a[0][1] || a[1][0]) n[1] = 1; if ((a[0][1] + a[1][0]) != n[0] * n[1]) { cout << Impossible ; return 0; } int base = n[1]; while (1) { if (a[0][1] > base) { cout << 0 ; n[0]--; a[0][1] -= base; } else { for (int i = 0; i < base - a[0][1]; ++i) cout << 1 ; if (n[0] > 0) { cout << 0 ; n[0]--; } for (int i = 0; i < a[0][1]; ++i) cout << 1 ; for (int i = 0; i < n[0]; ++i) cout << 0 ; break; } } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n = 0; long long moves = 0; cin >> n; vector<long long> arr(n, 0); for (int i = 0; i < n; i++) cin >> arr[i]; long long last = arr[0]; long long min = INT_MAX; bool found = false; for (int i = 1; i < n; i++) { if (arr[i] < arr[i - 1]) { if (arr[i] < min) { min = arr[i]; found = true; } } if (arr[i] > arr[i - 1] || i + 1 == n) { if (found) { moves += last - min; found = false; } min = INT_MAX; last = arr[i]; } } cout << moves << endl; return 0; }

#include <bits/stdc++.h> using namespace std; long a, b, r; int main() { ios_base::sync_with_stdio(0); cin >> a >> b >> r; if (min(a, b) >= 2 * r) cout << First << endl; else cout << Second << endl; cin.get(); cin.get(); return 0; }

#include <bits/stdc++.h> using namespace std; template <typename T, size_t N> struct ma : array<T, N> { T &operator[](size_t n) { return (*static_cast<array<T, N> *>(this))[n]; } }; template <class T> string to_str(const T &a) { ostringstream os; os << a; return os.str(); } template <> string to_str<long double>(const long double &a) { ostringstream os; os.precision(10); os.setf(ios::fixed); os << a; return os.str(); } template <class T> T from_str(const string &s) { istringstream is; T val; is >> val; return val; } int cond = (long long)0; map<int, vector<int> > nei; int dat[(int)1e5 + 11]; void solve() { int n, m; scanf( %d%d , &n, &m); for (auto i = (0); i < (m); ++i) { scanf( %d , &dat[i]); } long long turn = 0; for (auto i = (0); i < (m - 1); ++i) { int a = dat[i], b = dat[i + 1]; turn += abs(a - b); if (a != b) { nei[a].push_back(b); nei[b].push_back(a); } } long long res = turn; for (auto &it : (nei)) { auto kol = it.second; sort((kol).begin(), (kol).end()); int mid = kol.size() / 2; long long cand1 = 0; long long cand2 = 0; for (auto &jt : (kol)) { cand1 += abs(it.first - jt); cand2 += abs(jt - kol[mid]); } res = min(res, turn + cand2 - cand1); } cout << res << endl; } void brute() {} void gen(int i, int n, int k) {} int main(int argc, char **argv) { ios::sync_with_stdio(false); vector<string> args; int nr_test = -1; int t = 1; for (auto i = (1); i <= (argc - 1); ++i) args.push_back(argv[i]); for (auto &it : (args)) if (it == q ) cond = 10000000; for (auto &it : (args)) if (it == all ) t = 1000; for (auto &it : (args)) if (atoi(it.c_str()) > 0) nr_test = atoi(it.c_str()); for (auto &it : (args)) if (it == b ) { brute(); return 0; } for (auto &it : (args)) if (it == g && args.size() >= 4) { gen(atoi(args[1].c_str()), atoi(args[2].c_str()), atoi(args[3].c_str())); return 0; } for (auto i = (1); i <= (t); ++i) { if (nr_test == -1 || i <= nr_test) solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { string s; vector<int> v; int n, d, p = 0, cnt = 0, mx = -1; cin >> n >> d >> s; for (int i = 0; i < n; i++) if (s[i] == 1 ) v.push_back(i); for (int i = 1; i < v.size(); i++) { if (v[i] - v[i - 1] > mx) mx = v[i] - v[i - 1]; } if (mx > d) { cout << -1; return 0; } while (p < n - 1) { p += d; while (s[p] == 0 ) p--; cnt++; } cout << cnt; return 0; }

#include <bits/stdc++.h> using namespace std; struct Hill { int Lid, Mid, Rid; long long Lv, Mv, Rv; bool valid; Hill() : valid(false) {} Hill(int Lid, int Mid, int Rid, long long Lv, long long Mv, long long Rv) : Lid(Lid), Mid(Mid), Rid(Rid), Lv(Lv), Mv(Mv), Rv(Rv), valid(true) {} int Len() const { return valid ? Rid - Lid + 1 : 0; } Hill operator+(const Hill B) const { Hill Ans; if (Rv == B.Lv) return Ans; if (Rv < B.Lv) { if (Mid == Rid) return Hill(Lid, B.Mid, B.Rid, Lv, B.Mv, B.Rv); else return Hill(Rid, B.Mid, B.Rid, Rv, B.Mv, B.Rv); } else { if (B.Mid == B.Lid) return Hill(Lid, Mid, B.Rid, Lv, Mv, B.Rv); else return Hill(Lid, Mid, B.Lid, Lv, Mv, B.Lv); } } bool operator<(const Hill B) const { return Len() < B.Len(); } void show() { if (valid) printf( A[%d]=%d A[%d]=%d A[%d]=%d n , Lid, int(Lv), Mid, int(Mv), Rid, int(Rv)); else printf( ERROR! n ); } }; Hill CLeft(const Hill A, const Hill B) { if (!B.valid || B.Lv == A.Rv) return A; if (A.Mid == A.Rid) { if (B.Lv > A.Rv) return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv); else if (B.Lid == B.Mid) return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv); else return Hill(A.Lid, A.Mid, B.Lid, A.Lv, A.Mv, B.Lv); } else { if (B.Lv < A.Rv) { if (B.Lid == B.Mid) return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv); else return Hill(A.Lid, A.Mid, B.Lid, A.Lv, A.Mv, B.Lv); } else return A; } } Hill CRight(const Hill A, const Hill B) { if (!A.valid || A.Rv == B.Lv) return B; if (B.Mid == B.Lid) { if (A.Rv > B.Lv) return Hill(A.Lid, A.Mid, B.Rid, A.Lv, A.Mv, B.Rv); else if (A.Rid == A.Mid) return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv); else return Hill(A.Rid, B.Mid, B.Rid, A.Rv, B.Mv, B.Rv); } else { if (A.Rv < B.Lv) { if (A.Rid == A.Mid) return Hill(A.Lid, B.Mid, B.Rid, A.Lv, B.Mv, B.Rv); else return Hill(A.Rid, B.Mid, B.Rid, A.Rv, B.Mv, B.Rv); } else return B; } } struct Segment { Hill L, M, R; bool pure; Segment() {} Segment(Hill L, Hill M, Hill R, bool pure) : L(L), M(M), R(R), pure(pure) {} Segment operator+(const Segment B) const { Segment Ans; Ans.L = pure ? CLeft(L, B.L) : L; Ans.R = B.pure ? CRight(R, B.R) : B.R; Hill CM = M < B.M ? B.M : M; Ans.M = R + B.L; if (Ans.M < CM) Ans.M = CM; Ans.pure = Ans.M.Len() == Ans.R.Rid - Ans.L.Lid + 1; return Ans; } void Add(const long long D) { L.Lv += D; L.Mv += D; L.Rv += D; M.Lv += D; M.Mv += D; M.Rv += D; R.Lv += D; R.Mv += D; R.Rv += D; } void show() { L.show(); M.show(); R.show(); } }; Segment S[300001 << 2]; long long Add[300001 << 2]; int mm[300001 << 2]; void PushUp(int rt) { S[rt] = S[rt << 1] + S[rt << 1 | 1]; } void PushDown(int rt) { int ls = rt << 1, rs = ls | 1; if (Add[rt]) { Add[ls] += Add[rt]; Add[rs] += Add[rt]; S[ls].Add(Add[rt]); S[rs].Add(Add[rt]); Add[rt] = 0; } } void Build(int l, int r, int rt) { if (l == r) { int v; scanf( %d , &v); Hill tempH(l, l, l, v, v, v); S[rt] = Segment(tempH, tempH, tempH, true); return; } int m = mm[rt] = (l + r) >> 1; Build(l, m, rt << 1); Build(m + 1, r, rt << 1 | 1); PushUp(rt); Add[rt] = 0; } void Update(const int L, const int R, const long long D, const int l, const int r, const int rt) { if (L <= l && r <= R) { Add[rt] += D; S[rt].Add(D); return; } const int m = mm[rt]; PushDown(rt); if (L <= m) Update(L, R, D, l, m, rt << 1); if (R > m) Update(L, R, D, m + 1, r, rt << 1 | 1); PushUp(rt); } void Search(int l, int r, int rt) { if (l == r) { printf( %d , int(S[rt].L.Lv)); return; } PushDown(rt); int m = (l + r) >> 1; Search(l, m, rt << 1); Search(m + 1, r, rt << 1 | 1); } int main() { int n, m; while (~scanf( %d , &n)) { Build(1, n, 1); scanf( %d , &m); for (int i = 0; i < m; ++i) { static int l, r, d; scanf( %d%d%d , &l, &r, &d); Update(l, r, d, 1, n, 1); printf( %d n , S[1].M.Len()); } } return 0; }

#include <bits/stdc++.h> using namespace std; pair<int, pair<int, int> > A[2003 * 2003], B[2003 * 2003]; pair<int, int> a[2003], b[2003]; int m, n, r, s, x, y, i, j, asd; long long t1, t2, mn; bool h; int main() { cin >> m; for (i = 1; i <= m; i++) { cin >> a[i].first; t1 += a[i].first; a[i].second = i; } cin >> n; for (i = 1; i <= n; i++) { cin >> b[i].first; t2 += b[i].first; b[i].second = i; } for (i = 1; i <= m; i++) for (j = i + 1; j <= m; j++) A[++r] = make_pair(a[i].first + a[j].first, make_pair(i, j)); for (i = 1; i <= n; i++) for (j = i + 1; j <= n; j++) B[++s] = make_pair(b[i].first + b[j].first, make_pair(i, j)); sort(a + 1, a + m + 1); sort(b + 1, b + n + 1); sort(A + 1, A + r + 1); sort(B + 1, B + s + 1); if (t1 < t2) { h = 1; swap(t1, t2); swap(m, n); swap(r, s); swap(a, b); swap(A, B); } mn = t1 - t2; for (i = j = 1; i <= m; i++) { while (abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first)) > abs(t1 - a[i].first + b[j + 1].first - (t2 - b[j + 1].first + a[i].first)) && j < n) j++; if (mn > abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first))) { mn = abs(t1 - a[i].first + b[j].first - (t2 - b[j].first + a[i].first)); asd = 1; x = i; y = j; } } for (i = j = 1; i <= r && s; i++) { while (abs(t1 - A[i].first + B[j].first - (t2 - B[j].first + A[i].first)) > abs(t1 - A[i].first + B[j + 1].first - (t2 - B[j + 1].first + A[i].first)) && j < s) j++; if (mn > abs((t1 - A[i].first + B[j].first) - (t2 - B[j].first + A[i].first))) { mn = abs((t1 - A[i].first + B[j].first) - (t2 - B[j].first + A[i].first)); asd = 2; x = i; y = j; } } cout << mn << endl << asd << endl; if (asd == 1) { if (!h) cout << a[x].second << << b[y].second; else cout << b[y].second << << a[x].second; } else if (asd) { if (!h) { cout << A[x].second.first << << B[y].second.first << endl; cout << A[x].second.second << << B[y].second.second; } else { cout << B[y].second.first << << A[x].second.first << endl; cout << B[y].second.second << << A[x].second.second; } } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int t, i, j, n, x, y; cin >> x >> y; bool c = 0; char a; for (i = 0; i < x; i++) { for (j = 0; j < y; j++) { cin >> a; if (a != W && a != B && a != G ) c = 1; } } if (c) puts( #Color ); else puts( #Black&White ); return 0; }

#include <bits/stdc++.h> double const EPS = 3e-8; using namespace std; template <class T> T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a % b) : a); } template <class T> T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); } struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << t ; return *this; } } dbg; template <class A, class B> ostream& operator<<(ostream& o, const pair<A, B>& p) { return o << ( << p.first << , << p.second << ) ; } template <class T> ostream& operator<<(ostream& o, const vector<T>& v) { o << [ ; for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it) o << *it << , ; return o << ] ; } template <class T> ostream& operator<<(ostream& o, const set<T>& v) { o << [ ; for (__typeof((v).end()) it = (v).begin(); it != (v).end(); ++it) o << *it << , ; return o << ] ; } template <class T> inline bool read(T& x) { int c = getchar(); int sgn = 1; while (~c && c < 0 || c > 9 ) { if (c == - ) sgn = -1; c = getchar(); } for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; x *= sgn; return ~c; } int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; const int NX = 1e6 + 10; int fromFront[NX], fromBack[NX]; string a, b; void solve(int cs) { cin >> a >> b; int asz = a.size(); int bsz = b.size(); int backIdx = bsz - 1; int cur = 0; for (int i = asz - 1; i >= 0; i--) { if (backIdx >= 0 && a[i] == b[backIdx]) { backIdx--; cur++; } fromBack[i] = cur; } int frontIdx = 0; cur = 0; for (int i = 0; i < asz; i++) { if (frontIdx < bsz && a[i] == b[frontIdx]) { frontIdx++; cur++; } fromFront[i] = cur; } int low = 0, high = 0; int ans = 0; while (high < asz) { int f = 0, b = 0; if (low > 0) f = fromFront[low - 1]; if (high + 1 < asz) b = fromBack[high + 1]; if (f + b >= bsz) { ans = max(ans, high - low + 1); } else { while (f + b < bsz && low <= high) { low++; f = fromFront[low - 1]; if (high + 1 < asz) b = fromBack[high + 1]; } } high++; } printf( %d n , ans); } int main() { int t = 1; for (int cs = 1; cs <= t; cs++) solve(cs); return 0; }

#include <bits/stdc++.h> int main() { int n, k; while (~scanf( %d%d , &n, &k)) { int ant[55] = {0}; int temp = 0; int count = k; for (int i = 1; i <= n; i++) { scanf( %d , &ant[i - 1]); if (i == k) temp = ant[i - 1]; } if (temp) for (int i = k + 1; i <= n; i++) { if (ant[i - 1] >= temp) count++; else break; } else for (int i = k; i >= 1; i--) { if (!ant[i - 1]) count--; } printf( %d n , count); } return 0; }

#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) {} template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << << *it << = << a; err(++it, args...); } template <typename T, typename U> inline void min_self(T& x, U y) { if (y < x) x = y; } template <typename T, typename U> inline void max_self(T& x, U y) { if (x < y) x = y; } template <class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> pair) { return out << ( << pair.first << , << pair.second << ) ; } template <class T> ostream& operator<<(ostream& out, vector<T> vec) { out << ( ; for (auto& v : vec) out << v << , ; return out << ) ; } template <class T> ostream& operator<<(ostream& out, set<T> vec) { out << ( ; for (auto& v : vec) out << v << , ; return out << ) ; } template <class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out << ( ; for (auto& v : vec) out << [ << v.first << , << v.second << ] ; return out << ) ; } template <class A, class B> istream& operator>>(istream& in, pair<A, B>& a) { return in >> a.first >> a.second; } template <class A> istream& operator>>(istream& in, vector<A>& a) { for (A& i : a) in >> i; return in; } long long XX[4] = {-1, 0, 1, 0}; long long YY[4] = {0, -1, 0, 1}; void solve() { long long n, res = 0; cin >> n; vector<pair<long long, long long>> a(n); for (long long i = 0; i <= n - 1; i++) cin >> a[i]; sort(a.begin(), a.end()); long long maxi = a[0].second; for (long long i = 1; i <= n - 1; i++) { if (a[i].second < maxi && a[i].first > a[i - 1].first) { res++; } max_self(maxi, a[i].second); } cout << res << n ; return; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long t = 1; while (t--) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int N, K; cin >> N >> K; double res = 0; long double t1x, t1y, t2x, t2y; cin >> t1x >> t1y; for (int i = 1; i < N; ++i) { t2x = t1x; t2y = t1y; cin >> t1x >> t1y; res += sqrt((t1x - t2x) * (t1x - t2x) + (t1y - t2y) * (t1y - t2y)); } printf( %.15lf n , res * K / 50); return 0; }

#include <bits/stdc++.h> using namespace std; const int N = 100005; int down[N], sz[N], up[N], n; vector<pair<int, bool> > adj[N]; void dfs(int s, int p) { sz[s] = 1; for (auto it : adj[s]) { if (it.first != p) { dfs(it.first, s); sz[s] += sz[it.first]; if (it.second) down[s] += sz[it.first]; else down[s] += down[it.first]; } } } void dfs2(int s, int p) { for (auto it : adj[s]) { if (it.first != p) { if (it.second) up[it.first] = n - sz[it.first]; else up[it.first] = down[s] - down[it.first] + up[s]; dfs2(it.first, s); } } } int main() { int i; scanf( %d , &n); for (i = 0; i < n - 1; i++) { int a, b, c, te; bool flag = true; scanf( %d%d%d , &a, &b, &c); while (c > 0) { if (c % 10 == 4 || c % 10 == 7) ; else flag = false; c /= 10; } adj[a - 1].push_back(make_pair(b - 1, flag)); adj[b - 1].push_back(make_pair(a - 1, flag)); } long long ans = 0; dfs(0, -1); dfs2(0, -1); for (i = 0; i < n; i++) { long long temp = up[i] + down[i]; ans += temp * (temp - 1); } cout << ans; }

#include <bits/stdc++.h> double p[1010][1010]; int a[1010]; int n, m; int main() { double t, ans; int i, j, x, y; scanf( %d%d , &n, &m); for (i = 1; i <= n; i++) scanf( %d , &a[i]); for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) if (a[i] > a[j]) p[i][j] = 1; else p[i][j] = 0; for (i = 1; i <= m; i++) { scanf( %d%d , &x, &y); p[x][y] = 0.5; p[y][x] = 0.5; for (j = 1; j <= n; j++) if ((j != x) && (j != y)) { t = (p[j][x] + p[j][y]) * 0.5; p[j][x] = t; p[x][j] = 1 - t; p[j][y] = t; p[y][j] = 1 - t; } } ans = 0; for (i = 1; i <= n - 1; i++) for (j = i + 1; j <= n; j++) ans += p[i][j]; printf( %.10lf n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int one, two, three, four; bool check(deque<int> x) { int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0; for (int i = 0; i < x.size(); i++) { if (x[i] == 0) cnt1++; if (x[i] == 1) cnt2++; if (x[i] == 2) cnt3++; if (x[i] == 3) cnt4++; } if (cnt1 == one && cnt2 == two && cnt3 == three & cnt4 == four) { for (int i = 0; i + 1 < x.size(); i++) { if (abs(x[i] - x[i + 1]) != 1) return 0; } cout << YES << n ; for (int i : x) cout << i << ; exit(0); } return 0; } deque<int> merge(deque<int> x, deque<int> y) { for (int i : y) x.push_back(i); return x; } void go2(pair<int, int> a, pair<int, int> b, deque<int> ans) { deque<int> ans2 = ans; if (a.first < b.first) { for (int i = 0; i < a.first; i++) { ans.push_back(b.second); ans.push_back(a.second); } ans.push_back(b.second); } else { for (int i = 0; i < b.first; i++) { ans.push_back(a.second); ans.push_back(b.second); } if (a.first != b.first) ans.push_back(a.second); } check(ans); ans = ans2; if (a.first <= b.first) { for (int i = 0; i < a.first; i++) { ans.push_back(b.second); ans.push_back(a.second); } if (a.first != b.first) ans.push_back(b.second); } else { for (int i = 0; i < b.first; i++) { ans.push_back(a.second); ans.push_back(b.second); } if (a.first != b.first) ans.push_back(a.second); } ans = ans2; deque<int> zl; if (a.first < b.first) { for (int i = 0; i < a.first; i++) { zl.push_back(b.second); zl.push_back(a.second); } zl.push_back(b.second); } else { for (int i = 0; i < b.first; i++) { zl.push_back(a.second); zl.push_back(b.second); } if (a.first != b.first) zl.push_back(a.second); } check(merge(zl, ans)); zl.clear(); if (a.first <= b.first) { for (int i = 0; i < a.first; i++) { zl.push_back(b.second); zl.push_back(a.second); } if (a.first != b.first) zl.push_back(b.second); } else { for (int i = 0; i < b.first; i++) { zl.push_back(a.second); zl.push_back(b.second); } if (a.first != b.first) zl.push_back(a.second); } check(merge(zl, ans)); } void go3(pair<int, int> a, pair<int, int> b, pair<int, int> c, deque<int> cur) { deque<int> ans; if (a.first <= b.first) { for (int i = 0; i < a.first; i++) { ans.push_back(a.second); ans.push_back(b.second); } go2(pair<int, int>(b.first - a.first, b.second), c, merge(cur, ans)); go2(pair<int, int>(b.first - a.first, b.second), c, merge(ans, cur)); ans.clear(); for (int i = 0; i < a.first; i++) { ans.push_back(b.second); ans.push_back(a.second); } go2(pair<int, int>(b.first - a.first, b.second), c, merge(cur, ans)); go2(pair<int, int>(b.first - a.first, b.second), c, merge(ans, cur)); } ans.clear(); if (c.first <= b.first) { for (int i = 0; i < c.first; i++) { ans.push_back(c.second); ans.push_back(b.second); } go2(a, pair<int, int>(b.first - c.first, b.second), merge(cur, ans)); go2(a, pair<int, int>(b.first - c.first, b.second), merge(ans, cur)); ans.clear(); for (int i = 0; i < c.first; i++) { ans.push_back(b.second); ans.push_back(c.second); } go2(a, pair<int, int>(b.first - c.first, b.second), merge(cur, ans)); go2(a, pair<int, int>(b.first - c.first, b.second), merge(ans, cur)); } } void go4(int a, int b, int c, int d) { if (a <= b) { deque<int> lul; for (int i = 0; i < a; i++) { lul.push_back(0); lul.push_back(1); } go3(pair<int, int>(b - a, 1), pair<int, int>(c, 2), pair<int, int>(d, 3), lul); lul.clear(); for (int i = 0; i < a; i++) { lul.push_back(1); lul.push_back(0); } go3(pair<int, int>(b - a, 1), pair<int, int>(c, 2), pair<int, int>(d, 3), lul); } if (d <= c) { deque<int> lul; for (int i = 0; i < d; i++) { lul.push_back(3); lul.push_back(2); } go3(pair<int, int>(a, 0), pair<int, int>(b, 1), pair<int, int>(c - d, 2), lul); lul.clear(); for (int i = 0; i < d; i++) { lul.push_back(2); lul.push_back(3); } go3(pair<int, int>(a, 0), pair<int, int>(b, 1), pair<int, int>(c - d, 2), lul); } } int main() { cin >> one >> two >> three >> four; go4(one, two, three, four); cout << NO ; return 0; }

#include <bits/stdc++.h> using namespace std; long long range(long long L) { switch (L & 3) { case 0: return L; case 1: return 1; case 2: return L + 1; case 3: return 0; } } int main() { for (int N; cin >> N;) { long long sum = 0; for (int i = 0; i < (int)(N); ++i) { long long m, x; cin >> x >> m; long long b = range(x - 1); long long a = range(x + m - 1); sum ^= b; sum ^= a; } if (sum == 0) cout << bolik << endl; else cout << tolik << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; struct trie { char ch; int son, next, father, suffix; vector<int> danger; int sum; }; trie a[205]; int now, m; void clear(int x) { a[x].son = a[x].next = 0; a[x].danger.clear(); } void insert(char *s, int l, int t, int x) { if (!a[x].son) { a[x].son = ++m; clear(m); a[m].father = x; a[m].ch = s[t]; if (t + 1 == l) a[m].danger.push_back(now); else insert(s, l, t + 1, m); return; } int i = a[x].son; while (1) { if (!a[i].next || a[i].ch == s[t]) break; i = a[i].next; } if (a[i].ch == s[t] && t + 1 == l) a[i].danger.push_back(now); else if (a[i].ch == s[t]) insert(s, l, t + 1, i); else { a[i].next = ++m; clear(m); a[m].father = x; a[m].ch = s[t]; if (t + 1 == l) a[m].danger.push_back(now); else insert(s, l, t + 1, m); } } int q[205]; int child(int x, char ch) { for (int i = a[x].son; i; i = a[i].next) if (a[i].ch == ch) return (i); if (x == 1) return (1); return (child(a[x].suffix, ch)); } void build_trie() { int l, r; l = r = 1; q[1] = 1; while (l <= r) { int x = q[l++]; for (int i = a[x].son; i; i = a[i].next) q[++r] = i; } a[1].suffix = 1; for (int i = 2; i <= r; i++) { int x = q[i]; if (a[x].father == 1) { a[x].suffix = 1; continue; } a[x].suffix = child(a[a[x].father].suffix, a[x].ch); for (int j = 0; j < (int)a[a[x].suffix].danger.size(); j++) a[x].danger.push_back(a[a[x].suffix].danger[j]); } } int n, base, k; void read(char *s) { int l; scanf( %d , &l); s[l] = 0 ; for (int i = 0; i < l; ++i) { int a; scanf( %d , &a); s[i] = a + a ; } } int v[205]; char l[205], r[205], s[205]; const int MOD = 1000000007; int curl; char cur[205]; int f[205][205][505]; int dp(int i, int state, int sum, bool cmp, bool first) { if (sum > k) { return 0; } if (i == 0) { return 1; } if (!first && !cmp && f[i][state][sum] != -1) { return f[i][state][sum]; } int ret = 0; int r = cur[curl - i] - a ; for (int d = first; d < base; ++d) { if (cmp && d > r) { continue; } int nstate = child(state, d + a ), nsum = sum + a[nstate].sum; bool ncmp = cmp && d == r; ret += dp(i - 1, nstate, nsum, ncmp, false); if (ret >= MOD) { ret -= MOD; } } if (!cmp && !first) { f[i][state][sum] = ret; } return ret; } int cal(char *s) { int l = strlen(s); curl = l; for (int i = 0; i < l; ++i) { cur[i] = s[i]; } int ret = 0; while (curl) { ret += dp(curl, 1, 0, curl == l, true); --curl; if (ret >= MOD) { ret -= MOD; } } return ret; } int check(char *s) { int sum = 0, cur = 1, l = strlen(s); for (int i = 0; i < l; ++i) { cur = child(cur, s[i]); sum += a[cur].sum; } return sum <= k; } int main() { memset(f, -1, sizeof(f)); scanf( %d%d%d , &n, &base, &k); read(l), read(r); clear(m = 1); for (int i = 0; i < n; i++) { read(s); scanf( %d , v + i); now = i; insert(s, strlen(s), 0, 1); } build_trie(); for (int i = 1; i <= m; ++i) { a[i].sum = 0; for (int j = 0; j < (int)a[i].danger.size(); ++j) { a[i].sum += v[a[i].danger[j]]; } } long long ansl = cal(l), ansr = cal(r); cout << ((ansr - ansl + check(l)) % MOD + MOD) % MOD << endl; return 0; }

#include <bits/stdc++.h> #include <cmath> #include <regex> #define ff first #define ss second #define pb push_back #define mp make_pair #define ba back #define ppb pop_back #define eb emplace_back #define eps 1e-6 #define vec vector<long long int> #define sz(x) (int((x.size()))) #define all(x) (x).begin(),(x).end() #define FAST ios_base :: sync_with_stdio (false); cin.tie (NULL) #define ll long long #define loop(i,s,n) for(int i=s;i<n;i++) using namespace std; //----------------------------------------------------------------------------------------------------------------- const ll M = 1e9 + 7; const ll N = 2e5 + 5; const ll inf = 2e18; ll mod(ll x){ return (x%M);} ll mod_minus(ll a, ll b){ ll ans= (mod(a)-mod(b)); if(ans<0) ans=mod(ans+M); return ans;} ll mod_mul(ll a,ll b){ return mod(mod(a)*mod(b));} ll mod_add(ll a,ll b){ return mod(a+b);} ll power(ll a,ll n){ if(n==0) return 1; else if(n==1) return a; ll R=power(a,n/2)%M; if(n%2==0) { return mod(mod_mul(R,R)); } else { return mod(mod_mul(mod_mul(R,a),mod(R))); } } ll mod_inv(ll n){ return power(n,M-2);} // only if M is prime ll mod_div(ll a,ll b){ ll ans=mod(a); ll b1=power(b,M-2); ans= mod(mod_mul(ans,b1)); return ans; } ll fact_mod(ll n){ vec fact(n+1); fact[0]=1; loop(i,1,n+1){ fact[i]=mod_mul(fact[i-1],i); } return fact[n]; } unsigned long long nCr_mod(unsigned long long n, ll r) { if (r == 0) return 1; unsigned long long fac[n + 1]; fac[0] = 1; for (int i = 1; i <= n; i++) fac[i] = (fac[i - 1] * i) % M; return (fac[n] * mod_inv(fac[r]) % M * mod_inv(fac[n - r]) % M) % M; } //-------------------------------------------------------------------------------------------------------------- void solve(){ ll n; cin>>n; ll a[n]; ll sum=0; loop(i,0,n){ cin>>a[i]; sum+=a[i]; } sort(a,a+n); ll mx=a[n-1],mn=a[0]; ll z=(n-1)-sum%(n-1); if(z==(n-1)){ z=0; } sum+=z; if(mx<=sum/(n-1)){ cout<<z<<endl; return; } cout<<mx*(n-1)-sum+z<<endl; } int main(){ FAST; int t; cin>>t; while(t--){ solve(); } }

#include <bits/stdc++.h> using namespace std; int read() { int x; scanf( %d , &x); return x; } const int N = 1123456; int a[N]; vector<int> v[N]; int c[N]; priority_queue<int> q[N]; void dfs(int x, int t) { c[x] = t; q[t].push(a[x]); for (int i = 0; i < v[x].size(); i++) { int to = v[x][i]; if (!c[to]) { dfs(to, t); } } } int main() { int n, m, i, j, x, y; n = read(); m = read(); for (i = 1; i <= n; i++) { a[i] = read(); } for (i = 1; i <= m; i++) { x = read(); y = read(); v[x].push_back(y); v[y].push_back(x); } int cnt = 1; for (i = 1; i <= n; i++) { if (!c[i]) { dfs(i, cnt++); } } for (i = 1; i <= n; i++) { printf( %d , q[c[i]].top()); q[c[i]].pop(); } }

#include <bits/stdc++.h> using namespace std; stack<pair<int, int> > a; int main() { int n, m = 0, i = 1; cin >> n; while (n--) { int b, c; char d, e, f[40]; scanf( ); scanf( %c , &d); scanf( %d%c%d , &b, &e, &c); gets(f); b %= 12; if (f[1] == p ) b += 12; if (m) { if ((b < a.top().first) || (b == a.top().first && c < a.top().second)) ; else m--; if (b == a.top().first && c == a.top().second) i++; else i = 1; } if (i > 10) { m++; i -= 10; } a.push({b, c}); m++; } cout << m << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const long long maxn = 100010; const long long inf = 1e9 + 7; long long n, a[maxn]; long long minv = inf; long long sum[3]; int main() { scanf( %I64d , &n); for (long long i = 1; i <= n; i++) { scanf( %I64d , &a[i]); minv = min(minv, a[i]); } for (long long i = 1; i <= n; i++) a[i] -= minv; for (long long i = 1; i <= n; i++) sum[a[i]]++; sort(a + 1, a + n + 1); if (a[n] < 2) { printf( %I64d n , n); for (long long i = 1; i <= n; i++) printf( %I64d , a[i] + minv); return 0; } else { long long temp = min(sum[0], sum[2]); long long temp2 = sum[1] >> 1; if (temp > temp2) { sum[1] += (temp << 1); sum[0] -= temp; sum[2] -= temp; } else { temp = temp2; sum[1] -= (temp << 1); sum[0] += temp; sum[2] += temp; } printf( %I64d n , n - (temp << 1)); for (long long i = 0; i < 3; i++) for (long long j = 1; j <= sum[i]; j++) printf( %I64d , i + minv); } return 0; }

#include <bits/stdc++.h> using namespace std; inline long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); } inline long long lcm(long long a, long long b) { return a * b / gcd(a, b); } long long n, k, x, type(1), amt, box; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for (int i = 1; i <= k; i++) { cin >> x; if (x * (n / x) > amt) { amt = x * (n / x); box = n / x; type = i; } } cout << type << << box << endl; }

#include <bits/stdc++.h> using namespace std; void debug_out() { cerr << endl; } void clock_out() { cerr << nTime Elapsed : << 1.0 * clock() / CLOCKS_PER_SEC << s n ; } void fileio() { freopen( /home/dwai/Desktop/cp/input.txt , r , stdin); freopen( /home/dwai/Desktop/cp/output.txt , w , stdout); freopen( /home/dwai/Desktop/cp/debug.txt , w , stderr); } void ofileio() { freopen( input.txt , r , stdin); freopen( output.txt , w , stdout); } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << << H; debug_out(T...); } int IT_MAX = 1 << 20; const long long MOD = 1000000007; const int INF = 0x3f3f3f3f; const long long LL_INF = 0x3f3f3f3f3f3f3f3f; const double PI = acos(-1); const double ERR = 1e-10; int main() { 42; ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); srand(time(NULL)); long long n, m; cin >> n >> m; long long a[n], b[m]; long long i; long long mn = 0, mx = 0; for (i = 0; i < n; i++) { cin >> a[i]; if (i == 0) { mx = a[i]; mn = a[i]; } else mx = max(mx, a[i]); mn = min(mn, a[i]); } long long ans = mn * 2; for (i = 0; i < n; i++) { if (a[i] > ans) ans = a[i]; } for (i = 0; i < m; i++) { cin >> b[i]; if (b[i] <= ans) return cout << -1, 0; } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int N, K; int T[200005]; vector<int> danger; vector<pair<int, int> > v; bool cf(pair<int, int> x, pair<int, int> y) { return x.second * y.first > y.second * x.first; } int main() { scanf( %d %d , &N, &K); for (int i = 0; i < N; i++) { scanf( %d , &T[i]); if (T[i] < 0) { danger.push_back(i); } } if (danger.size() > K) puts( -1 ); else { int change = danger.size() * 2; K -= danger.size(); for (int i = 0; i < (int)danger.size(); i++) { if (i == danger.size() - 1) v.push_back(make_pair(N - danger[i] - 1, 1)); else v.push_back(make_pair(danger[i + 1] - danger[i] - 1, 2)); } sort(v.begin(), v.end(), cf); int idx = 0; while (idx < v.size()) { if (K - v[idx].first >= 0) { K -= v[idx].first; change -= v[idx].second; } idx++; } printf( %d n , change); } return 0; }

#include <bits/stdc++.h> #define ff first #define ss second #define ll long long #define ld long double #define pb push_back #define eb emplace_back #define mp make_pair #define mt make_tuple #define pii pair<int, int> #define pll pair<ll,ll> #define vi vector<int> #define vl vector<ll> #define vii vector<pii> #define sws ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define endl n #define teto(a, b) ((a+b-1)/(b)) using namespace std; // Extra #define forn(i, n) for(int i = 0; i < (int)n; i++) #define forne(i, a, b) for(int i = a; i <= b; i++) #define all(x) x.begin(), x.end() #define dbg(msg, var) cout << msg << << var << endl; // const int MAX = 200010; const ll MOD = (int)1e9 +7; const int INF = 1e9; const ll LLINF = 0x3f3f3f3f3f3f3f3f; const ld EPS = 1e-8; int n, l, r, s; vector<vector<bool>> tab; vector<vector<bool>> btab; int dp(int idx, int soma) { if(soma > s) return 0; if(idx >= n) { return (soma == s); } if(btab[idx][soma]) return tab[idx][soma]; // cout << idx << << soma << endl; int res = 0; int pega = dp(idx+1, soma + idx+1); int npega = dp(idx+1, soma); if(npega >= pega) { res = npega; } else { res = pega; } btab[idx][soma] = true; return tab[idx][soma] = res; } vi solve(vi vals, int sz, bool& ruim) { int t = vals.size(); vi foi(n+1, 0); forn(i, t) foi[vals[i]] = 1; ruim = false; while(t < sz and !ruim) { bool brk = false; forne(i, 1, n) { if(!foi[i]) continue; forne(j, 1, i-1) { if(j == i-j) continue; if(!foi[j] and !foi[i-j]) { foi[i] = 0; foi[j] = 1; foi[i-j] = 1; t++; brk = true; break; } } if(brk) break; } if(!brk) ruim = true; } return foi; } int32_t main() { // sws; int t; cin >> t; while(t--) { cin >> n >> l >> r >> s; tab.assign(n, vector<bool>(s+1, -1)); btab.assign(n, vector<bool>(s+1, 0)); bool win = dp(0, 0); if(win) { vi vals, p(n+1, -1); set<int> pos; forne(i, 1, n) pos.insert(i); int idx = 0, soma = 0; while(idx < n) { if(dp(idx+1, soma)) { idx++; } else { soma += idx+1; vals.pb(idx+1); idx++; } } if(vals.size() > (r-l+1)) { cout << -1 << endl; continue; } bool ruim; // for(auto val : vals) cout << val << ; // cout << endl; vi foi = solve(vals, (r-l+1), ruim); // cout << ruim = << ruim << endl; // forne(i, 1, n) cout << foi[i] << ; // cout << endl; if(ruim) cout << -1 << endl; else { int id1 = 1, id2 = 1; forne(i, 1, n) { if(l <= i and i <= r) { while(id1 <= n and !foi[id1]) id1++; cout << id1 << ; id1++; } else { while(id2 <= n and foi[id2]) id2++; cout << id2 << ; id2++; } } cout << endl; } } else { cout << -1 << endl; } } // verificar limites, long long return 0; }

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC optimization( unroll-loops ) std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}, {-1, 1}, {-1, -1}, {1, 1}, {1, -1}}; using namespace std; const long long mod = 998244353; long long nop = 70; vector<int> primes(nop + 1, 1); void sieve() { primes[1] = primes[0] = 0; for (long long i = 2; i * i <= nop; i++) { if (primes[i]) { for (long long j = i * i; j <= nop; j += i) { primes[j] = 0; } } } } long long gcd(long long a, long long b) { if (b > a) swap(b, a); if (b == 0) return a; return gcd(b, a % b); } void extgcd(long long a, long long b, long long& x, long long& y) { if (a == 0) { x = a; y = b; return; } extgcd(b % a, a, x, y); long long y1 = y, x1 = x; x = y1 - (b / a) * x1; y = x1; } long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); } long long bexp(long long num, long long e) { long long ans = 1; while (e > 0) { if (e & 1) { ans *= num; } num *= num; e >>= 1; } return ans; } long long mexp(long long num, long long e) { long long ans = 1; while (e > 0) { if (e & 1) { ans = (ans * num) % mod; } num *= num; num %= mod; e >>= 1; } return ans % mod; } long long modinv(long long a) { a %= mod; return mexp(a, mod - 2); } void solve() { long long n, k; cin >> n >> k; string s; cin >> s; sort(s.begin(), s.end()); vector<long long> cnt(26, 0); for (long long i = 0; i < (n); i++) { cnt[s[i] - a ]++; } int first = -1, last = -1, nod = 0; for (long long i = 0; i < (26); i++) { if (cnt[i]) { nod++; if (first == -1) first = i; last = i; } } if (cnt[first] < k) { cout << s[k - 1] << n ; return; } string worst = ; worst += char( a + first); if (nod >= 3 || (nod == 2 && cnt[first] > k)) { for (long long i = k; i < n; i++) { worst += s[i]; } } else { for (long long i = k; i < n; i++) { worst += s[i]; i += (k - 1); } } cout << worst << n ; } int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); int t = 1; cin >> t; for (long long T = 1; T <= (t); T++) { solve(); } return 0; }

#include <bits/stdc++.h> using namespace std; char str[100010]; int ct[100010][4]; int main() { int N, x[5], R, L, M; scanf( %s , str); N = strlen(str); for (int i = 1; i <= N; i++) { for (int j = 0; j < 3; j++) ct[i][j] = ct[i - 1][j]; ct[i][str[i - 1] - x ]++; } scanf( %d , &M); for (int i = 0; i < M; i++) { scanf( %d%d , &L, &R); L--; if (R - L < 3) { puts( YES ); continue; } for (int j = 0; j < 3; j++) x[j] = ct[R][j] - ct[L][j]; if (x[0] <= x[1] && x[1] <= x[2] && x[2] - x[0] <= 1) puts( YES ); else if (x[1] <= x[2] && x[2] <= x[0] && x[0] - x[1] <= 1) puts( YES ); else if (x[2] <= x[0] && x[0] <= x[1] && x[1] - x[2] <= 1) puts( YES ); else puts( NO ); } return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 5; int n, a[maxn]; struct node { int pre; bool flag; int other; } num[2 * maxn]; int main(int argc, char const *argv[]) { while (cin >> n) { bool flag = true; for (int i = 0; i <= n; i++) { cin >> a[i]; if (a[i] != 1) flag = false; } if (flag == true) { cout << perfect << endl; continue; } bool temp = false; bool ans = false; int cnt = 1; for (int i = 0; i <= n; i++) { if (i > 0 && a[i] > 1 && a[i - 1] > 1 && ans == false) { ans = true; int par = cnt - 1; int k = a[i]; k--; while (k--) { num[cnt].pre = par; num[cnt].other = par - 1; num[cnt].flag = true; cnt++; } num[cnt].pre = num[cnt].other = par; num[cnt].flag = true; cnt++; } else { int par = cnt - 1; int k = a[i]; while (k--) { num[cnt].pre = par; num[cnt].flag = false; cnt++; } } } if (ans == false) { cout << perfect << endl; continue; } cout << ambiguous << endl; for (int i = 1; i < cnt; i++) cout << num[i].pre << ; cout << endl; for (int i = 1; i < cnt; i++) { if (num[i].flag == false) cout << num[i].pre; else cout << num[i].other; cout << ; } cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int mymax(int x) { int max = 0; while (x) { int s = x % 10; if (s > max) max = s; x /= 10; } return max; } int zh(int x, int n) { int s = 0, p = 1; while (x) { s += x % 10 * p; x /= 10; p *= n; } return s; } int main() { int a, b; cin >> a >> b; int n = max(mymax(a), mymax(b)) + 1; int num = zh(a, n) + zh(b, n); int j = 0; while (num) { int s = num % n; num /= n; j++; } cout << j << endl; return 0; }

#include <bits/stdc++.h> using namespace std; class Constellation { static const long long N = 100010; inline long long sign(long long x) { return x > 0 ? 1 : x == 0 ? 0 : -1; } struct point { long long x, y, num; } b[N]; long long n; long long cross(const point &a, const point &b, const point &c) { return sign((b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x)); } bool contain(const point &a, const point &b, const point &c, const point &p) { long long v1 = cross(a, b, p), v2 = cross(b, c, p), v3 = cross(c, a, p); return v1 * v2 >= 0 && v2 * v3 >= 0 && v3 * v1 >= 0; } public: void solve() { cin >> n; for (long long i = 1; i <= n; ++i) cin >> b[i].x >> b[i].y; long long p1 = 1, p2 = 2, p3 = 0; for (long long i = 3; i <= n; ++i) if (cross(b[p1], b[p2], b[i])) { p3 = i; break; } for (long long i = 1; i <= n; ++i) if (i != p1 && i != p2 && i != p3 && contain(b[p1], b[p2], b[p3], b[i])) { if (cross(b[p1], b[p2], b[i])) p3 = i; else p2 = i; } cout << p1 << << p2 << << p3 << endl; } } T; int main() { T.solve(); }

#include <bits/stdc++.h> double eps = 1e-9; using namespace std; int main() { std::ios::sync_with_stdio(false); int x, y, z, w, b, a; cin >> x >> y >> z >> w >> b >> a; cout << (2 * (2 * x + a + y) * (z + y) - (a * a + b * b + y * y + z * z)) / 2; return 0; }

#include <bits/stdc++.h> using namespace std; int dirx[] = {1, 0, -1, 0}; int diry[] = {0, 1, 0, -1}; int a; vector<int> graph[100005]; int dist[100005]; bool visit[100005]; int cnt = 0; bool flag = false; int dfs(int u, int par) { visit[u] = true; for (int i = 0; i < graph[u].size(); i++) { if (!visit[graph[u][i]]) dist[u] += dfs(graph[u][i], u); } if (dist[u] != 0 && (dist[u] + 1) % 2 == 0) { cnt++; dist[u] = 0; return 0; } else return 1; } int main() { scanf( %d , &a); int x, y; int start = 0; for (int i = 0; i < a - 1; i++) { scanf( %d %d , &x, &y); start = x; graph[x].push_back(y); graph[y].push_back(x); } if (a % 2 == 1) { cout << -1 << endl; return 0; } dfs(start, 0); cout << cnt - 1 << endl; }

#include <bits/stdc++.h> #pragma comment(linker, /STACK:167772160000 ) using namespace std; long long dp[5100][5100]; long long x[5100]; int a[5100], b[5100], c[5100], d[5100]; int main() { int leftminright = 0; int n, s, e; cin >> n >> s >> e; s--; e--; for (int i = 0; i < n; i++) cin >> x[i]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; for (int i = 0; i < n; i++) cin >> c[i]; for (int i = 0; i < n; i++) cin >> d[i]; x[n] = 0; for (int i = 0; i < n + 2; i++) for (int j = 0; j < n + 2; j++) dp[i][j] = 1E18; dp[0][0] = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i != 0) { if (j == 0 && leftminright != 1) continue; } if (i == s) { leftminright--; long long now = dp[i][j]; now += d[i]; dp[i + 1][j + 1] = min(dp[i + 1][j + 1], now + (x[i + 1] - x[i]) * ((j + 1) * 2 + leftminright)); now -= d[i]; now += c[i]; if (j + leftminright + 1 > 0) dp[i + 1][j] = min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); leftminright++; continue; } if (i == e) { leftminright++; long long now = dp[i][j]; now += b[i]; dp[i + 1][j] = min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); now -= b[i]; now += a[i]; if (j == 0) { leftminright--; continue; } dp[i + 1][j - 1] = min(dp[i + 1][j - 1], now + (x[i + 1] - x[i]) * (2 * (j - 1) + leftminright)); leftminright--; continue; } long long now = dp[i][j]; now += b[i]; now += d[i]; dp[i + 1][j + 1] = min(dp[i + 1][j + 1], now + (x[i + 1] - x[i]) * ((j + 1) * 2 + leftminright)); now -= d[i]; now += c[i]; if (j + leftminright > 0) dp[i + 1][j] = min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); now -= b[i]; now += a[i]; now -= c[i]; now += d[i]; if (j > 0) dp[i + 1][j] = min(dp[i + 1][j], now + (x[i + 1] - x[i]) * (j * 2 + leftminright)); now -= d[i]; now += c[i]; if (j > 0 && j + leftminright > 0) dp[i + 1][j - 1] = min(dp[i + 1][j - 1], now + (x[i + 1] - x[i]) * ((j - 1) * 2 + leftminright)); } if (i == s) leftminright--; if (i == e) leftminright++; } cout << dp[n][0]; return 0; }

#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); const double EPS = 1e-8; const long long INF = 0x3f3f3f3f3f3f3f3f; inline long long readll() { long long x(0), op(1); char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) op = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) x = x * 10 + ch - 0 , ch = getchar(); return x * op; } const int sz = 2e5 + 9; long long a[sz], n; long long solve(long long a, long long b) { if (a == 0 || a == b) return 0; int l = 1, r = n; if (b) { if (b < a) l = b + 1; else r = b - 1; } return (a - l + 1) * (r - a + 1); } int main() { n = readll(); for (int i = 1; i < n + 1; ++i) a[i] = readll(); a[0] = a[n + 1] = 0; long long ans = 0; for (int i = 0; i < n + 1; ++i) { ans += solve(a[i], a[i + 1]); ans += solve(a[i + 1], a[i]); } cout << ans / 2 << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const int max_n = 200222, inf = 1000111222; int n, m, a[max_n]; bool check(int cnt) { long long sum = 0; int last = 1; for (int i = 0; i < n; ++i) { if (i % cnt == 0) --last; if (a[i] + last < 0) break; sum += (a[i] + last); } return sum >= m; } int main() { scanf( %d%d , &n, &m); for (int i = 0; i < n; ++i) scanf( %d , &a[i]); sort(a, a + n); reverse(a, a + n); int l = 0, r = n + 1; while (r - l > 1) { int mid = (l + r) / 2; if (check(mid)) r = mid; else l = mid; } if (r > n) puts( -1 ); else printf( %d n , r); return 0; }

#include <bits/stdc++.h> using namespace std; long long t[4 * 100100], dp[100100], a[100100], b[100100]; long long K = 1, n, m; void build() { while (K < m + 2) K <<= 1; } long long query(long long l, long long r) { long long ans = 0; for (l += K - 1, r += K + 1; l ^ r ^ 1; l >>= 1, r >>= 1) { if (~l ^ 1) ans = ((ans) >= (t[l + 1]) ? (ans) : (t[l + 1])); if (r ^ 1) ans = ((ans) >= (t[r - 1]) ? (ans) : (t[r - 1])); } return ans; } void update(long long id, long long v) { for (t[id += K] = v, id >>= 1; id >= 1; id >>= 1) t[id] = max(t[id << 1 | 1], t[id << 1]); } long long get_id(long long x) { long long l = 1, r = m, mid; while (l < r) { mid = (l + r + 1) >> 1; if (b[mid] > x) r = mid - 1; else l = mid; } return l; } void unique() { m = 1; for (long long i = 2; i <= n; i++) if (b[i] != b[m]) b[++m] = b[i]; } void input() { scanf( %I64d , &n); for (long long i = 1, r, h; i <= n; i++) { scanf( %I64d%I64d , &r, &h); a[i] = b[i] = r * r * h; } return; } void init() { sort(b + 1, b + n + 1); unique(); build(); return; } void work() { for (long long i = 1; i <= n; i++) { long long id = get_id(a[i]); dp[i] = query(1, id - 1) + a[i]; update(id, dp[i]); } return; } void output() { printf( %.15lf , query(1, m) * M_PI); return; } int main() { input(); init(); work(); output(); return 0; }

#include <bits/stdc++.h> using namespace std; int n, k, c[100005], visit[100005], tp = 0; vector<int> a[100005], ans; bool ok[100005]; void dfs(int u) { visit[u] = tp; for (int i = 0; i < a[u].size(); i++) { int v = a[u][i]; if (ok[v]) continue; if (visit[v] == tp) { cout << -1; exit(0); } else dfs(v); } ans.push_back(u); ok[u] = 1; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for (int i = 1; i <= k; i++) cin >> c[i]; for (int i = 1; i <= n; i++) { int t; cin >> t; while (t--) { int u; cin >> u; a[i].push_back(u); } } for (int i = 1; i <= k; i++) { if (!visit[c[i]]) { tp++; dfs(c[i]); } } cout << ans.size() << n ; for (int i = 0; i < ans.size(); i++) cout << ans[i] << ; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; long long int sum = n * (n - 1) / 2; if (n == 0) { cout << 0; return 0; } if ((n % 2 == 0 && n % 4 != 0) || (n % 2 == 1 && n % 4 != 3)) cout << 1; else cout << 0; return 0; }

#include <bits/stdc++.h> using namespace std; template <typename F, typename S> ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << ( << p.first << , << p.second << ) ; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << { ; typename vector<T>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } return os << } ; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { os << [ ; typename set<T>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << *it; } return os << ] ; } template <typename F, typename S> ostream &operator<<(ostream &os, const map<F, S> &v) { os << [ ; typename map<F, S>::const_iterator it; for (it = v.begin(); it != v.end(); it++) { if (it != v.begin()) os << , ; os << it->first << = << it->second; } return os << ] ; } int n, m; string hor, ver; int give_dir(char ch) { if (ch == > || ch == v ) return 1; else return -1; } bool valid(int x, int y) { if (x < 0 || y < 0 || x >= n || y >= m) return false; return true; } void dfs(int x, int y, vector<vector<bool> > &visited) { visited[x][y] = true; int nx, ny; nx = x + give_dir(ver[y]); ny = y + give_dir(hor[x]); if (valid(nx, y) && !visited[nx][y]) dfs(nx, y, visited); if (valid(x, ny) && !visited[x][ny]) dfs(x, ny, visited); } int main() { cin >> n >> m; cin >> hor >> ver; for (int k = 0; k < (n); k++) { for (int l = 0; l < (m); l++) { vector<vector<bool> > visited(n, vector<bool>(m, false)); dfs(k, l, visited); for (int i = 0; i < (n); i++) { for (int j = 0; j < (m); j++) { if (!visited[i][j]) { cout << NO << endl; return 0; } } } } } cout << YES << endl; return 0; }

#include <bits/stdc++.h> template <class T> void cxk(T& a, T b) { a = a > b ? a : b; } template <class T> void cnk(T& a, T b) { a = a < b ? a : b; } long long gi() { long long x = 0, f = 1; char ch = getchar(); while (!isdigit(ch)) f ^= ch == - , ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f ? x : -x; } int col[200010], f[200010][2][2][2], p2[400010]; void inc(int& x, int y) { x = x + y >= 1000000007 ? x + y - 1000000007 : x + y; } int main() { int n = gi(), p = gi(); for (int i = 1; i <= n; ++i) col[i] = gi(); p2[0] = 1; for (int i = 1; i <= n + n; ++i) p2[i] = 2 * p2[i - 1] % 1000000007; f[1][0][0][0] = 1; for (int i = 1; i <= n; ++i) for (int j = 0; j < 2; ++j) for (int k = 0; k < 2; ++k) for (int l = 0; l < 2; ++l) if (f[i][j][k][l]) { if (col[i] != 1) { inc(f[i + 1][1][k][!l], 1ll * p2[i - 1 - !!k] * f[i][j][k][l] % 1000000007); if (k) inc(f[i + 1][j][k][l], 1ll * p2[i - 2] * f[i][j][k][l] % 1000000007); } if (col[i] != 0) { inc(f[i + 1][j][1][!l], 1ll * p2[i - 1 - !!j] * f[i][j][k][l] % 1000000007); if (j) inc(f[i + 1][j][k][l], 1ll * p2[i - 2] * f[i][j][k][l] % 1000000007); } } int ans = 0; for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) inc(ans, f[n + 1][i][j][p]); printf( %d n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; #define me(a, b) memset(a, b, sizeof(a)) #define IOS() ios::sync_with_stdio(false), cin.tie(0) #define endl n typedef long long ll; typedef pair<ll, ll> pll; typedef pair<int, int> pii; const int INF = 0x3f3f3f3f; const int maxn = 2e5 + 5; const ll mod = 1e9 + 7; int cnt[26]; int n, k; vector<pii> ans; int check() { ans.clear(); int sum = 0; for(int i = 0; i < 26; ++i) { int r = cnt[i] % k; if(r){ ans.push_back(pii(i, k - r)); sum += k - r; } } return sum; } void solve() { me(cnt, 0); string s; cin >> n >> k >> s; for(char &c : s) ++cnt[c - a ]; if(check() == 0) { cout << s << endl; return ; } for(int i = s.size()-1; i >= 0; --i) { char &c = s[i]; --cnt[c - a ]; for(int j = s[i] - a + 1; j < 26; ++j) { c = j + a ; ++cnt[j]; int sum = s.size()-i-1 - check(); --cnt[j]; if(sum >= 0 && sum % k == 0) { string t; for(int p = 0; p <= i; ++p) t.push_back(s[p]); t.append(sum, a ); for(pii p : ans) { t.append(p.second, p.first+ a ); } cout << t << endl; return ; } } } cout << -1 n ; } int main() { IOS(); int T; cin >> T; while(T--) solve(); return 0; }

#include <bits/stdc++.h> using namespace std; int f[100001], g[100001], h[100001]; int n, cnt; bool work() { cnt = -1; for (int i = 0; i < n; ++i) { if (g[i] != -1) { if (f[i] != i) return false; } else { if (g[f[i]] == -1) { g[i] = ++cnt; h[cnt] = f[i]; g[f[i]] = cnt; } else { if (h[g[f[i]]] != f[i]) return false; h[g[f[i]]] = f[i]; g[i] = g[f[i]]; } } } return true; } int main() { cin >> n; for (int i = 0; i < n; ++i) cin >> f[i]; for (int i = 0; i < n; ++i) --f[i]; for (int i = 0; i < n; ++i) g[i] = h[i] = -1; if (work()) { cout << ++cnt << endl; for (int i = 0; i < n; ++i) cout << ++g[i] << ; cout << endl; for (int i = 0; i < cnt; ++i) cout << ++h[i] << ; } else cout << -1 << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { long long int n; cin >> n; cout << n / 2 + 1; }

#include <bits/stdc++.h> using namespace std; const int maxl = 200005; int T, n, mk, seq[maxl]; char s[maxl]; inline char read() { char ch = getchar(); while (ch != < && ch != > ) ch = getchar(); return ch; } int main() { scanf( %d , &T); while (T--) { scanf( %d , &n); mk = 0; memset(seq, 0, sizeof(seq)); for (register int i = 1; i < n; i++) s[i] = read(); s[0] = > ; s[n] = < ; for (register int i = n; i; i--) if (s[i - 1] == > && s[i] == < ) seq[i] = ++mk; mk = n; for (register int i = 1, j, tmp; i <= n; i++) { if (seq[i]) continue; if (s[i - 1] == > ) seq[i] = mk--; else { for (j = i; s[j] != > && j < n; j++) ; tmp = j; for (; j >= i; j--) seq[j] = mk--; i = tmp; } } for (register int i = 1; i <= n; i++) printf( %d , seq[i]); printf( n ); memset(seq, 0, sizeof(seq)); mk = 0; for (register int i = 1; i <= n; i++) if (s[i - 1] == > && s[i] == < ) seq[i] = ++mk; mk = n; for (register int i = n, j, tmp; i; i--) { if (seq[i]) continue; if (s[i] == < ) seq[i] = mk--; else { for (j = i; s[j - 1] != < && j > 1; j--) ; tmp = j; for (; j <= i; j++) seq[j] = mk--; i = tmp; } } for (register int i = 1; i <= n; i++) printf( %d , seq[i]); printf( n ); } return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ifstream in( date.in ); ofstream out( date.out ); long long nr2, k, rez[4001], con = 0, nr, n, pli[4001], plp[4001], inc[4001], i, j; cin >> n; for (i = 1; i <= n; i++) cin >> pli[i] >> plp[i] >> inc[i]; for (i = 1; i <= n; i++) { nr = nr2 = 0; if (inc[i] >= 0) { rez[++con] = i; nr = pli[i]; for (j = i + 1; nr > 0 && j <= n; j++) { if (inc[j] >= 0) { inc[j] -= nr--; } else { if (pli[j]) { inc[j] -= nr; pli[j] = 0; nr2 = plp[j]; for (k = j + 1; k <= n; k++) inc[k] -= nr2; } } } } else { if (pli[i]) { pli[i] = 0; nr2 = plp[i]; for (k = i + 1; k <= n; k++) inc[k] -= nr2; } } } cout << con << n ; for (j = 1; j <= con; j++) cout << rez[j] << ; return 0; }

#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; const int N = 128; int num[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; ++i) { cin >> num[i]; } int m; cin >> m; for (int i = 0; i < m; ++i) { int x, y; cin >> x >> y; num[x - 1] += y - 1; num[x + 1] += num[x] - y; num[x] = 0; } for (int i = 1; i <= n; ++i) { cout << num[i] << endl; } }

#include <bits/stdc++.h> using namespace std; int p[3010000], n; int main() { scanf( %d , &n); for (int i = 1; i < n + 1; i++) p[i] = i; for (int i = 2; i < n + 1; i++) { int s = p[i - 1], ns; for (int j = i - 1; j <= n + i - 2; j += i) { ns = p[j + i]; if (j + i <= n + i - 2) p[j + i] = s; else p[n + i - 1] = s; s = ns; } } for (int i = 1; i < n + 1; i++) printf( %d , p[n - 1 + i]); }

#include <bits/stdc++.h> using namespace std; int main() { int arr[101]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } sort(arr, arr + n); for (int i = 0; i < n; i++) { cout << arr[i] << ; } }

#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 100; long long arr[N], d[N], tree[N << 2], mx[N << 2]; void build(int rt, int l, int r) { if (l == r) { tree[rt] = mx[rt] = arr[l]; return; } int m = (l + r) / 2; build(rt << 1, l, m); build(rt << 1 | 1, m + 1, r); tree[rt] = tree[rt << 1] + tree[rt << 1 | 1]; mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]); } void update(int L, int R, int rt, int l, int r) { if (mx[rt] <= 2) return; if (l == r) { tree[rt] = mx[rt] = d[tree[rt]]; return; } int m = (l + r) >> 1; if (L <= m) update(L, R, rt << 1, l, m); if (R > m) update(L, R, rt << 1 | 1, m + 1, r); tree[rt] = tree[rt << 1] + tree[rt << 1 | 1]; mx[rt] = max(mx[rt << 1], mx[rt << 1 | 1]); } long long query(int L, int R, int rt, int l, int r) { if (L <= l && r <= R) { return tree[rt]; } int m = (l + r) >> 1; long long ans = 0; if (L <= m) ans += query(L, R, rt << 1, l, m); if (R > m) ans += query(L, R, rt << 1 | 1, m + 1, r); return ans; } int main() { ios::sync_with_stdio(false); int n, m, t, l, r; for (int i = 1; i < N; i++) { for (int j = i; j < N; j += i) d[j]++; } cin >> n >> m; for (int i = 1; i <= n; i++) cin >> arr[i]; build(1, 1, n); while (m--) { cin >> t >> l >> r; if (t == 1) update(l, r, 1, 1, n); else cout << query(l, r, 1, 1, n) << endl; } }

#include <bits/stdc++.h> using namespace std; const int a[] = {0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2}; int main() { int n; cin >> n; cout << a[n]; return 0; }

#include <bits/stdc++.h> using namespace std; template <class T> inline bool fs(T &x) { int c = getchar(); int sgn = 1; while (~c && c < 0 || c > 9 ) { if (c == - ) sgn = -1; c = getchar(); } for (x = 0; ~c && 0 <= c && c <= 9 ; c = getchar()) x = x * 10 + c - 0 ; x *= sgn; return ~c; } int main() { long long int n, m, cnt = 0; fs(n); fs(m); for (long long int i = 1; i * i <= m; i++) { if (m % i == 0 && m / i <= n) { if (m / i != i) cnt++; cnt++; } } cout << cnt << endl; return 0; }

#include <bits/stdc++.h> using namespace std; int solve(vector<pair<int, int> > v, int price) { if (v.size() < 2) return 0; vector<int> p, b; for (int i = 0; i < v.size(); i++) p.push_back(v[i].first), b.push_back(v[i].second); int amx[v.size()]; amx[0] = b[0]; for (int i = 1; i < b.size(); i++) amx[i] = max(amx[i - 1], b[i]); int ans = 0; for (int i = 0; i < v.size(); i++) { int id = upper_bound(p.begin(), p.begin() + i, price - p[i]) - p.begin(); id--; if (id < 0 || id >= v.size()) continue; if (id != i) ans = max(ans, b[i] + amx[id]); } return ans; } int main() { int i, j, k; int n, m; int c, d; int x, y; char ch; cin >> n >> c >> d; int mc = 0, md = 0; vector<pair<int, int> > coins, diamonds; for (i = 0; i < n; i++) { cin >> x >> y >> ch; if (ch == C ) { if (c >= y) mc = max(mc, x), coins.push_back({y, x}); } else { if (d >= y) md = max(md, x), diamonds.push_back({y, x}); } } int ans = 0; if (mc > 0 && md > 0) ans = mc + md; sort(coins.begin(), coins.end()); sort(diamonds.begin(), diamonds.end()); ans = max(ans, solve(coins, c)); ans = max(ans, solve(diamonds, d)); printf( %d , ans); return 0; }

#include <bits/stdc++.h> using namespace std; int _, n; char s[100005]; int main() { scanf( %d , &_); while (_--) { scanf( %d , &n); s[0] = a ; scanf( %s , s + 1); int p = -1; for (int i = n; i >= 1; i--) { if (s[i] == 0 ) { p = i; break; } } bool f = 0; for (int i = 1; i <= n; i++) { if (s[i] == 1 ) { if (s[i + 1] == 0 ) f = 1; else f = 0; if (i < p) { continue; } printf( 1 ); } else { if (f) { printf( 0 ); i = p; continue; } printf( 0 ); } } puts( ); } }

#include <bits/stdc++.h> using namespace std; int n, ans, notOK; map<int, int> M; int main() { cin >> n; for (int i = 0, x; i < n; i++) cin >> x, M[x]++; for (map<int, int>::iterator it = M.begin(); it != M.end(); it++) { if (it->first) { if (it->second == 2) ans++; else if (it->second > 2) notOK = 1; } } cout << (notOK ? -1 : ans); }

#include <bits/stdc++.h> using namespace std; vector<int> cr1[27]; vector<int> cr2[27]; int s1[27]; int s2[27]; struct node { int x; int y; }; int main() { int n; cin >> n; char c; for (int i = 0; i < n; i++) { cin >> c; if (c == ? ) { s1[26]++; cr1[26].push_back(i); } else { s1[c - a ]++; cr1[c - a ].push_back(i); } } for (int i = 0; i < n; i++) { cin >> c; if (c == ? ) { s2[26]++; cr2[26].push_back(i); } else { s2[c - a ]++; cr2[c - a ].push_back(i); } } int cnt = 0; vector<node> nd; for (int i = 0; i < 26; i++) { int x = s1[i] - 1; int y = s2[i] - 1; while (x >= 0 && y >= 0) { node n1; n1.x = cr1[i][x]; n1.y = cr2[i][y]; nd.push_back(n1); cnt++; x--; y--; } if (x >= 0 && y < 0) { node n1; while (x >= 0 && s2[26] > 0) { n1.x = cr1[i][x]; n1.y = cr2[26][s2[26] - 1]; nd.push_back(n1); cnt++; s2[26]--; x--; } } else if (x < 0 && y >= 0) { node n1; while (y >= 0 && s1[26] > 0) { n1.x = cr1[26][s1[26] - 1]; n1.y = cr2[i][y]; nd.push_back(n1); cnt++; s1[26]--; y--; } } } while (s1[26] > 0 && s2[26] > 0) { node n1; n1.x = cr1[26][s1[26] - 1]; n1.y = cr2[26][s2[26] - 1]; nd.push_back(n1); cnt++; s1[26]--; s2[26]--; } cout << cnt << endl; for (int i = 0; i < nd.size(); i++) cout << nd[i].x + 1 << << nd[i].y + 1 << endl; }

#include <bits/stdc++.h> using namespace std; void actionFun() { long long n; cin >> n; long long c = 2; for (int i = 0; i < n; i++) { cout << c << ; ++c; } cout << endl; return; } int main() { int t; cin >> t; while (t--) { actionFun(); } }

#include <bits/stdc++.h> using namespace std; int main() { int n; while (~scanf( %d , &n)) { int cnt = 0; for (int i = 1; i < n; i++) { for (int j = i + 1; j < n; j++) { int sum = i * i + j * j; if (sum <= n * n) { if ((int)sqrt(sum) * (int)sqrt(sum) == sum) cnt++; } } } printf( %d n , cnt); } return 0; }

#include <bits/stdc++.h> using namespace std; int k[1005], n, i, j; long long kx[1005]; int main() { cin >> n; for (i = 1; i <= n; i++) cin >> k[i]; kx[1] = 2; for (i = 2; i <= n; i++) { if (k[i] == i) kx[i] = 2; else { for (j = k[i]; j < i; j++) kx[i] = (kx[i] + kx[j]) % 1000000007; kx[i] = (kx[i] + 2) % 1000000007; } } long long ans = 0; for (i = 1; i <= n; i++) ans = (ans + kx[i]) % 1000000007; cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL); long long n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } if (n == 1) { cout << YES ; return 0; } vector<long long> v; long long cnt0 = 1; for (int i = 1; i < n; i++) { if (a[i] != a[i - 1]) { v.push_back(cnt0); cnt0 = 1; } else cnt0++; if (i == n - 1) { v.push_back(cnt0); } } long long cnt = 1; for (int i = 0; i < v.size(); i++) { if (v[i] == v[i + 1]) cnt++; } if (cnt == v.size()) cout << YES ; else cout << NO ; }

#include <bits/stdc++.h> using namespace std; #pragma GCC push_options #pragma GCC optimize( unroll-loops ) int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); long long int INF = 10e18; long long t; cin >> t; while (t--) { long long n; cin >> n; long long a[n], b[n], c[n]; for (long long i = 0; i < n; i++) { cin >> a[i] >> b[i]; } for (long long i = 1; i <= n; i++) { c[i % n] = max(0ll, a[i % n] - b[i - 1]); } long long sum = accumulate(c, c + n, 0ll); long long res = INF; for (long long i = 0; i < n; i++) { res = min(res, sum + a[i] - c[i]); } cout << res << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int contrib[312345] = {0}; bool in_set[312345] = {0}; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<int> ans; int cnt = 0; for (int i = 1; i <= n / 2; i++) { if (cnt + contrib[i] <= k) { ans.push_back(i); in_set[i] = true; cnt += contrib[i]; for (int j = i + i; j <= n; j += i) contrib[j]++; } else { while (cnt + contrib[i] > k) { cnt -= contrib[ans.back()]; for (int j = ans.back() + ans.back(); j <= n; j += ans.back()) contrib[j]--; in_set[ans.back()] = false; ans.pop_back(); } ans.push_back(i); in_set[i] = true; cnt += contrib[i]; for (int j = i + i; j <= n; j += i) contrib[j]++; } if (cnt == k) break; } priority_queue<pair<int, int> > pq; for (int i = n / 2 + 1; i <= n; i++) { if (in_set[i]) continue; pq.push(make_pair(contrib[i], i)); } while (!pq.empty()) { while (!pq.empty() && cnt + pq.top().first > k) pq.pop(); if (pq.empty()) break; cnt += pq.top().first; ans.push_back(pq.top().second); pq.pop(); } if (cnt != k) { cout << No << endl; return 0; } cout << Yes << endl; cout << ans.size() << endl; for (int i = 0; i < ans.size(); i++) { if (i) cout << ; cout << ans[i]; } cout << endl; }

#include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; void qread(int &x) { int neg = 1; x = 0; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) neg = -1; c = getchar(); } while (c >= 0 && c <= 9 ) x = 10 * x + c - 0 , c = getchar(); x *= neg; } const int maxn = 200005; char c[maxn]; int n, m; string s, t; int main() { scanf( %d%d , &n, &m); scanf( %s , c); s = c; scanf( %s , c); t = c; bool ok = false; for (int(i) = 0; (i) < n; i++) if (s[i] == * ) ok = true; if (!ok) { puts(s == t ? YES : NO ); return 0; } int pre = 0, suf = 0; while (s[pre] != * && s[pre] == t[pre]) pre++; while (s[n - suf - 1] != * && s[n - suf - 1] == t[m - suf - 1]) suf++; if (s[pre] == * && s[n - suf - 1] == * && pre - 1 < m - suf) puts( YES ); else puts( NO ); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; if (n == 1) { cout << -1 << endl; return 0; } cout << n << << n + 1 << << n * (n + 1) << endl; return 0; }

#include <bits/stdc++.h> using namespace std; using int64 = long long; using pii = pair<int, int>; using vchar = vector<char>; using vvchar = vector<vchar>; using vint = vector<int>; using vint64 = vector<int64>; using vvint = vector<vint>; using vbool = vector<bool>; using vpii = vector<pii>; template <typename T> T sqr(T x) { return x * x; } template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); } pair<int, vint> solveD(vvint g, int k) { enum { NOT_VISITED, STARTED, FINISHED }; const int n = g.size(); vint depth(n, -1); depth[0] = 0; vint parent(n, -1); vint loopState(n, NOT_VISITED); pair<int, vint> result; result.first = 0; std::function<void(int)> DFS = [&](int v) { loopState[v] = STARTED; const int previous = parent[v]; if (result.first != 0) return; int backVertex = -1; int backDepth = -1; for (auto to : g[v]) { if (to == previous) continue; if (loopState[to] == STARTED && depth[to] > backDepth) { backVertex = to; backDepth = depth[to]; } } if (backVertex != -1) { vint loop; for (int u = v; u != backVertex; u = parent[u]) { loop.push_back(u); } loop.push_back(backVertex); reverse(std::begin(loop), std::end(loop)); assert(depth[v] - depth[backVertex] + 1 == loop.size()); const int loopLength = loop.size(); if (loopLength > k) { result.first = 1; for (int i = 0; i < loop.size(); i += 2) { result.second.push_back(loop[i]); } result.second.resize((k + 1) / 2); } else { result.first = 2; result.second = loop; } return; } for (auto to : g[v]) { if (loopState[to] == NOT_VISITED) { parent[to] = v; depth[to] = depth[v] + 1; DFS(to); if (result.first != 0) return; } } loopState[v] = FINISHED; }; DFS(0); if (result.first != 0) { return result; } vint colors(n, -1); std::function<void(int, int)> biColor = [&](int v, int color) { colors[v] = color; for (auto to : g[v]) { if (colors[to] == -1) { biColor(to, 1 - color); } } }; biColor(0, 0); int colorCount[2] = {0}; for (int i = 0; i < n; ++i) { colorCount[colors[i]]++; } const int bestColor = colorCount[0] > colorCount[1] ? 0 : 1; result.first = 1; for (int i = 0; i < n; ++i) { if (colors[i] == bestColor) { result.second.push_back(i); } } result.second.resize((k + 1) / 2); return result; } int main() { int T = 1; std::ios::sync_with_stdio(false); while (T--) { int n; cin >> n; ; int m; cin >> m; ; int k; cin >> k; ; vvint g(n); while (m--) { int u; cin >> u; ; int v; cin >> v; ; u--, v--; g[u].push_back(v); g[v].push_back(u); } auto result = solveD(g, k); assert(result.first == 1 || result.first == 2); cout << result.first << endl; for (int& v : result.second) { v++; } if (result.first == 2) { cout << result.second.size() << endl; } std::copy(std::begin(result.second), std::end(result.second), ostream_iterator<int>(cout, )); cout << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; int a[500000]; int mina, maxa; int n, k; long long sum = 0; bool check(int c) { sum = 0; for (int i = 0; i < n; i++) { if (a[i] + c < mina) { sum += mina - c - a[i]; } else { break; } } if (sum > k) return false; return true; } bool checkp(int c) { sum = 0; for (int i = 0; i < n; i++) { if (a[i] - c > maxa) { sum += a[i] - c - maxa; } } if (sum > k) return false; return true; } int main() { scanf( %d %d , &n, &k); long long sum = 0; for (int i = 0; i < n; i++) { scanf( %d , &a[i]); sum += a[i]; } if (sum % n == 0) { mina = maxa = sum / n; } else { mina = sum / n; maxa = sum / n + 1; } sort(a, a + n); int ll = 0, rr = 1000000000; while (ll != rr) { int mid = (ll + rr) / 2; if (check(mid)) { rr = mid; } else { ll = mid + 1; } } int lll = 0, rrr = 1000000000; while (lll != rrr) { int mid = (lll + rrr) / 2; if (checkp(mid)) { rrr = mid; } else { lll = mid + 1; } } printf( %lld , (long long)lll + ll + maxa - mina); scanf( %d , &n); return 0; }

#include <bits/stdc++.h> using namespace std; int main() { int n, m, s, f, i; cin >> n >> m >> s >> f; long long t; map<long long, pair<int, int>> h; pair<int, int> R; for (i = 0; i < m; i++) { cin >> t >> R.first >> R.second; h[t] = R; } i = 1; if (s < f) while (s != f) { if (h.find(i) == h.end()) { cout << R ; s++; } else { if ((h[i].first <= s && s <= h[i].second) || (h[i].first <= s + 1 && s + 1 <= h[i].second)) { cout << X ; } else { cout << R ; s++; } } i++; } else { while (s != f) { if (h.find(i) == h.end()) { cout << L ; s--; } else { if ((h[i].first <= s && s <= h[i].second) || (h[i].first <= s - 1 && s - 1 <= h[i].second)) { cout << X ; } else { cout << L ; s--; } } i++; } } }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int d[n]; int total = 0; for (int i = 0; i < n; i++) { cin >> d[i]; total += d[i]; } int s, t; cin >> s >> t; if (s == t) { cout << 0; return 0; } if (s > t) swap(s, t); int ans = 0; for (int i = s; i < t; i++) { ans += d[i - 1]; } cout << min(ans, total - ans); }

#include <bits/stdc++.h> using namespace std; int n, m, Q; double sy, l[200100], r[200100], sum[200100], zl, zr, x, y, ans; struct Node { double x, y; } bj[2][200100], tmp, L, R; inline bool lef(Node u, Node v, Node w) { if (u.x == v.x) return w.x < u.x; double t; t = v.x - (v.x - u.x) * (v.y - w.y) / (v.y - u.y); return w.x < t; } inline double ask(int u) { double p, q; if (bj[0][u].x == x) p = x; else { p = x - (x - bj[0][u].x) * (y - sy) / y; } if (bj[1][u].x == x) q = x; else { q = x - (x - bj[1][u].x) * (y - sy) / y; } return max((double)0, min(q, zr) - max(p, zl)); } int main() { int i, j, p, q, mid, a, b; cin >> sy >> zl >> zr >> n; L.y = R.y = sy, L.x = zl, R.x = zr; for (i = 1; i <= n; i++) { scanf( %lf%lf , &l[i], &r[i]); sum[i] = sum[i - 1] + r[i] - l[i]; bj[0][i].y = 0, bj[0][i].x = l[i]; bj[1][i].y = 0, bj[1][i].x = r[i]; } cin >> m; for (i = 1; i <= m; i++) { scanf( %lf%lf , &x, &y); ans = 0; tmp.x = x, tmp.y = y; for (p = 1, q = n; p < q;) { mid = ((p + q) >> 1); if (lef(tmp, bj[0][mid], L)) q = mid; else p = mid + 1; } a = p - 1; for (p = 1, q = n; p < q;) { mid = ((p + q) >> 1); if (!lef(tmp, bj[1][mid], R)) p = mid + 1; else q = mid; } b = p; printf( %.10f n , ask(a) + ask(b) * (a != b) + max((double)0, sum[b - 1] - sum[a]) * (y - sy) / y); } }

#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) const int MAX_N = 1000009; const long long mod = 998244353; long long modpow(long long a, long long b, long long m) { long long p = 1, q = a; for (int i = 0; i < 32; i++) { if ((b / (1LL << i)) % 2 == 1) { p *= q; p %= m; } q *= q; q %= m; } return p; } long long N, fact[MAX_N], factinv[MAX_N]; void init() { fact[0] = 1; for (int i = 1; i <= 1000000; i++) fact[i] = (1LL * fact[i - 1] * i) % mod; for (int i = 0; i <= 1000000; i++) factinv[i] = modpow(fact[i], mod - 2, mod); } long long ncr(long long n, long long r) { if (r < 0 || n < r) return 0; return (fact[n] * factinv[r] % mod) * factinv[n - r] % mod; } int main() { cin >> N; init(); long long V1 = modpow(modpow(3, N, mod), N, mod) - modpow((modpow(3, N, mod) - 3LL + mod), N, mod); V1 += mod; V1 *= 2LL; V1 %= mod; long long V2 = 0; for (int i = 1; i <= N; i++) { long long E1 = ncr(N, i); long long E2 = modpow(3, N - i, mod); long long E3 = (E2 + mod - 1) % mod; E2 = modpow(E2, N, mod); E3 = modpow(E3, N, mod); if (i % 2 == 1) V2 += E1 * (E2 - E3 + mod); if (i % 2 == 0) V2 -= E1 * (E2 - E3 + mod); while (V2 < 0) V2 += mod * mod; V2 %= mod; } V2 *= 3LL; V2 %= mod; cout << (V1 - V2 + mod) % mod << endl; return 0; }

#include <bits/stdc++.h> using namespace std; const long double pi = 4 * atan((long double)1); const long long mod = 1e9 + 7; const long long inf = 922337203685477; const long long nax = 1e5 + 5; long long n, p, m; long long d[nax], t[nax]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> p >> m; for (long long i = 1; i <= n; i++) { cin >> d[i] >> t[i]; } d[0] = 1; d[n + 1] = m + 1; long long cur = 0, ans = 0; for (long long i = 1; i <= n + 1; i++) { long long dif = 0; if (cur > 0) { dif = cur / p; } long long minus = d[i] - d[i - 1] - dif; if (minus < 0) { minus = 0; } ans += minus; cur -= (d[i] - d[i - 1]) * p; cur += t[i]; } cout << ans << n ; }

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; const int SIZ_TREE = 3e5 + 10; int n, m; struct Node { int u, v; Node(int U = 0, int V = 0) { u = U, v = V; if (u < v) swap(u, v); } bool operator<(const Node A) const { if (u < A.u || (u == A.u && v < A.v)) return true; return false; } }; vector<int> f[N], ans[2]; vector<Node> edg; map<Node, bool> col; bool v[N], opr[N], flag1, flag2, add[N]; int cnt_p, cnt_opr; void init() { char s; int x, y; scanf( %d %d , &n, &m); for (int i = 1; i <= m; i++) { scanf( %d %d , &x, &y); while ((s = getchar()) == ) ; f[y].push_back(x); f[x].push_back(y); edg.push_back(Node(x, y)); col[Node(x, y)] = (s == R ? false : true); } } bool dfs(int x) { v[x] = true; cnt_p++; cnt_opr += opr[x]; for (int i = 0; i < f[x].size(); i++) { int y = f[x][i]; if (v[y]) { if ((col[Node(x, y)] ^ opr[x] ^ opr[y]) == true) return false; } else { opr[y] = col[Node(x, y)] ^ opr[x]; if (!dfs(y)) return false; } } return true; } void add_ans(int x, bool s1, int s2) { if (add[x]) return; opr[x] ^= s1; add[x] = true; if (opr[x]) ans[s2].push_back(x); for (int i = 0; i < f[x].size(); i++) add_ans(f[x][i], s1, s2); } bool solve(int sign) { memset(opr, 0, sizeof(opr)); memset(v, 0, sizeof(v)); memset(add, 0, sizeof(add)); for (int i = 1; i <= n; i++) if (!v[i]) { cnt_opr = cnt_p = 0; if (!dfs(i)) return false; add_ans(i, (cnt_opr * 2 > cnt_p), sign); } return true; } void print(int s) { printf( %d n , ans[s].size()); for (int i = 0; i < ans[s].size(); i++) printf( %d , ans[s][i]); printf( n ); } void work() { flag1 = solve(0); for (int i = 0; i < edg.size(); i++) col[edg[i]] = (!col[edg[i]]); flag2 = solve(1); if (!flag1 && !flag2) printf( -1 n ); else if (flag1 && !flag2) print(0); else if (!flag1 && flag2) print(1); else if (ans[0].size() < ans[1].size()) print(0); else print(1); } int main() { init(); work(); return 0; }

#include <bits/stdc++.h> using namespace std; const int MOD = 1e6 + 3; long long power(long long base, long long exp) { long long ans = 1; while (exp) { if (exp & 1) ans = (ans * base) % MOD; base = (base * base) % MOD; exp >>= 1; } return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); long long n, k; cin >> n >> k; if (n <= 63 && k > (1LL << n)) { cout << 1 << << 1; return 0; } long long v2 = 0; int digits = __builtin_popcountll(k - 1); v2 = k - 1 - digits; long long ntmp = n % (MOD - 1); if (ntmp < 0) ntmp += (MOD - 1); long long ktmp = k % (MOD - 1); if (ktmp < 0) ktmp += (MOD - 1); long long v2tmp = v2 % (MOD - 1); if (v2tmp < 0) v2tmp += (MOD - 1); long long exponent = ntmp * (ktmp - 1) - v2tmp; exponent %= (MOD - 1); if (exponent < 0) exponent += MOD - 1; long long denom = power(2, exponent); long long numpart = 0; if (k - 1 >= MOD) { numpart = 0; } else { long long prod = 1; long long ntmp2 = power(2, ntmp); prod = power(2, v2tmp); prod = power(prod, MOD - 2); if (prod < 0) prod += MOD; for (long long y = 1; y <= k - 1; y++) { prod = (prod * (ntmp2 - y)) % MOD; } numpart = prod; } long long num = (denom - numpart) % MOD; num %= MOD; denom %= MOD; if (num < 0) num += MOD; if (denom < 0) denom += MOD; cout << num << << denom; return 0; }

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ; long long n, k, i; cin >> n >> k; vector<pair<long long, long long> > v; long long a[n], b[n]; long long x, y; for (i = 0; i < n; i++) cin >> a[i]; for (i = 0; i < n; i++) cin >> b[i]; for (i = 0; i < n; i++) { x = a[i] - b[i]; v.push_back(make_pair(x, i)); } sort(v.begin(), v.end()); i = 0; y = 0; while (i < n) { if (i < k || v[i].first <= 0) y = y + a[v[i].second]; else if (i >= k && v[i].first > 0) break; ++i; } while (i < n) { y = y + b[v[i].second]; ++i; } cout << y; }