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; long long fastpower(long a, long b, long long n = 1000000007) { long res = 1; while (b > 0) { if ((b & 1) != 0) { res = (res % n * a % n) % n; } a = (a % n * a % n) % n; b = b >> 1; } return res; } bool isPrime(long lo...
#include <bits/stdc++.h> using namespace std; bool compare(pair<pair<long long int, long long int>, long long int> p1, pair<pair<long long int, long long int>, long long int> p2) { return p1.first.first < p2.first.first; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); ...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int q; cin >> q; while (q--) { int n; cin >> n; long long l = 0, r = n + 1; while (r - l > 1) { long long k = (l + r) >> 1; if ((long long)(n - k) * (n - k - 1) >= 2LL * k)...
#include <bits/stdc++.h> using namespace std; int countBits(long long mask) { int res = 0; while (mask) mask &= (mask - 1), ++res; return res; } string toString(long long n) { stringstream ss; ss << n; return ss.str(); } long long toNumber(string s) { stringstream ss; long lo...
#include <bits/stdc++.h> const long long mod = 998244853; long long C[5050][5050], n, m, g[5050], ans; signed main() { scanf( %lld%lld , &n, &m); for (long long i = 0; i <= n + m; i++) { C[i][0] = 1; for (long long j = 1; j <= i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; ...
#include <bits/stdc++.h> using namespace std; const long long inf = 2147383647; const double pi = 2 * acos(0.0); const double eps = 1e-9; struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return *this; } } dbg; inline long long gcd(long lon...
#include <bits/stdc++.h> using namespace std; using vint = vector<int>; using pint = pair<int, int>; using vpint = vector<pint>; template <typename A, typename B> inline void chmin(A& a, B b) { if (a > b) a = b; } template <typename A, typename B> inline void chmax(A& a, B b) { if (a < b) a = ...
#include <bits/stdc++.h> using namespace std; void __print(int x) { cout << x; } void __print(long x) { cout << x; } void __print(long long x) { cout << x; } void __print(unsigned x) { cout << x; } void __print(unsigned long x) { cout << x; } void __print(unsigned long long x) { cout << x; } void __prin...
#include <bits/stdc++.h> using namespace std; long long n; void exgcd(long long a, long long b, long long& x, long long& y) { if (b == 0) { x = 1; y = 0; return; } exgcd(b, a % b, x, y); long long p = x - a / b * y; x = y; y = p; } long long dv(long long a, long long ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int tt; cin >> tt; while (tt--) { int n; cin >> n; cout << (1ll * ((n - 1) / 2) * (((n - 1) / 2) + 1) * (2 * ((n - 1) / 2) + 1) *...
#include <bits/stdc++.h> using namespace std; const int MAXN = 1000; int from[MAXN + 5]; void Gauss(int n, int d, double a[][MAXN + 5], double *Ans) { for (int i = 1; i <= n; i++) from[i] = i; for (int i = 1; i <= n; i++) { if (!a[i][i]) for (int j = i + 1; j <= min(n, i + d); j++) ...
#include <bits/stdc++.h> using namespace std; void winter_is_coming() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } double k, arr[10001]; int n; double check(double md, double k) { double sum = 0; for (int i = 0; i < n; i++) if (arr[i] > md) { double...
#include <bits/stdc++.h> using namespace std; int main() { string a, b, c; cin >> a >> b; if (a.size() > b.size()) { for (int i = b.size(); i < a.size(); i++) c += 0 ; b = c + b; } if (a.size() < b.size()) { for (int i = a.size(); i < b.size(); i++) c += 0 ; a = c + a; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 65; const int inf = 1e9; int n, m, r; int dp[maxn][maxn][maxn]; int a[maxn][maxn][maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> r; for (int i = 0; i < m; i++) for (int j = ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx ) using namespace std; const double eps = 0.000001; const long double pi = acos(-1); const int maxn = 1e7 + 9; const int mod = 1e9 + 7; const long long MOD = 1e18 + 9; const long long INF ...
#include <bits/stdc++.h> #pragma comment(linker, /stack:64000000 ) using namespace std; const double PI = 2 * acos(0.0); const double eps = 1e-9; template <class T> T jog(T a, T b) { return a + b; } template <class T> T bog(T a, T b) { return a - b; } template <class T> T gon(T a, T b) ...
#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma warning(disable : 4996) using namespace std; const long long INF = 2147483647; const double PI = acos(-1); const int mod = 1e9 + 7; bool vis[3][120000]; int main() { long long n, q; cin >> n >> q; long long obstacles = 0; for (int ...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1000000; struct UnionFind { int par[MAX_N], ra[MAX_N]; void init(int n) { for (int(i) = 0; (i) < (n); (i)++) par[i] = i, ra[i] = 0; } int find(int x) { return par[x] == x ? x : par[x] = find(par[x]); } bool same(int x, int y...
#include <bits/stdc++.h> using namespace std; const int MAXN = 10010; vector<int> v[MAXN]; int childcnt[MAXN] = {0}; int main() { int n; cin >> n; for (int i = 1; i < n; i++) { int a, b; scanf( %d%d , &a, &b); v[a].push_back(b); v[b].push_back(a); } int root = 0; ...
#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long LINF = (long long)1e18; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math,O3 ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; long long n, k, ans, pw[11], a[200005]; map<int, int> w[11]; int main() { ios_base::sync_with_stdio(0); ...
#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long m, n, f[22], inv[22]; inline long long read() { long long s = 0, f = 1; char c = getchar(); while (c < 0 \|\| c > 9 ) { if (c == - ) { f = -1; } c = getchar(); } while (c >= 0 ...
#include <bits/stdc++.h> using namespace std; const long inf = 1000000000; long n, nn; long d[40000][100]; long dem[40000]; long tong[40000]; long lon[40000]; long canh[40000][30][2]; long res[40000], kq, mot, hai, ans[40000], cans[40000]; string x, s[40], y; vector<string> chuoi; long max(long ...
#include <bits/stdc++.h> using namespace std; template <class T> inline void chkmin(T &a, T b) { if (a > b) a = b; } template <class T> inline void chkmax(T &a, T b) { if (a < b) a = b; } double fail[310][3100], p[310][3100], val[310], nf[3100]; int main() { int N, M, i, j, u; double r...
#include <bits/stdc++.h> using namespace std; int s[1001000]; int g[1001000]; int ans[1001000]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> s[i] >> g[i]; ans[i] = 1001000; } ans[0] = s[0] + g[0]; for (int i = 0; i < n - 1; i++) { ans[i + 1] = mi...
#include <bits/stdc++.h> const long long int N = 2e5 + 5; using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int x, y, a, b; cin >> x >> y >> a >> b; vector<pair<long long int, long long int>> mp; for (int i = a; i <= x; i++) { fo...
#include <bits/stdc++.h> char s[100001]; int main() { int n; int i, j; scanf( %s , s); n = strlen(s); for (i = 0; i < n; i++) if (s[i] == 0 ) break; if (i == n) { for (j = 0; j < n - 1; j++) printf( %c , s[j]); printf( n ); } else { for (j = 0; j < i; j++) print...
#include <bits/stdc++.h> using namespace std; const int N = 105555; int a[N]; int main() { int n; scanf( %d , &n); int mn = 1e7, mi, mx = -1e7, xi; for (int i = 0; i < n; ++i) { scanf( %d , a + i); if (i > 1 && xi < i - 1 && mx > a[i - 1] && a[i - 1] < a[i]) { printf( 3 n%d %...
#include <bits/stdc++.h> using namespace std; set<long long int> blacklist; long long int par(long long int* parent, long long int f, long long int n) { if (parent[f] < 0) return parent[f]; if (parent[f] == f) return f; else { parent[f] = par(parent, parent[f], n); return parent[f]; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { long long int n; scanf( %lld , &n); printf( %lld n , n); } return 0; }
#include <bits/stdc++.h> using namespace std; class TaskC { public: void solve(std::istream& in, std::ostream& out); }; void TaskC::solve(std::istream& in, std::ostream& out) { int n; in >> n; int a[310][310]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; ++j) { in >>...
#include <bits/stdc++.h> using namespace std; void solve() { long long int n, k; cin >> n >> k; vector<long long int> a(n); for (long long int i = 0; i < n; i++) cin >> a[i]; long long int ans = -1e18; for (long long int i = 0; i < n; i++) { for (long long int j = i; j < n; j++) { ...
#include <bits/stdc++.h> using namespace std; const int N = 100010; const int SIZ = 500; inline void read(int &x) { x = 0; int f = 1; char ch = getchar(); while (ch < 0 \|\| ch > 9 ) { if (ch == - ) { f = -1; } ch = getchar(); } while (ch >= 0 && ch <= 9 ) ...
#include <bits/stdc++.h> using namespace std; int A[1111111]; int B[1111111]; int main(void) { int alen = 0; int blen = 0; scanf( %d %d , &alen, &blen); for (int i = 0; i < alen; i++) scanf( %d , &A[i]); memset(B, -1, sizeof(B)); for (int i = 0; i < blen; i++) { int x = 0; sc...
#include <bits/stdc++.h> const int N = 3e4 + 10; long long ri() { char c = getchar(); long long x = 0, f = 1; for (; c < 0 \|\| c > 9 ; c = getchar()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; c = getchar()) x = (x << 1) + (x << 3) - 0 + c; return x * f; } long long len[66]...
#include <bits/stdc++.h> using namespace std; class Solution { public: int n, m; std::vector<int> r; std::vector<std::vector<int>> d; std::vector<std::vector<std::array<int, 2>>> v; std::vector<bool> visited; std::vector<int> val; void dfs(int cur, int col) { visited[cur] = true...
#include <bits/stdc++.h> using namespace std; const long long N = 1e5; long long pref1[N + 5]; long long pref2[N + 5]; long long ans; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, type, l, r; cin >> n; n++; int arr[n]; for (int i = 1;...
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<int> a(n); int i; for (i = 0; i < n; i++) { scanf( %d , &a[i]); } vector<int> b(n); for (i = 0; i < n - 1; i++) { b[i] = a[i] + a[i + 1]; } b[n - 1] = a[n - 1]; for (i = ...
#include <bits/stdc++.h> int main() { int t, x, i, z, n, max = 0, s = 0, a[1000], m; scanf( %d %d , &n, &m); for (i = 0; i < n; i++) { scanf( %d , &a[i]); s += a[i]; if (max < a[i]) { max = a[i]; } } max = max + m; s = s + m; if (s % n == 0) { x = s / ...
#include <bits/stdc++.h> using namespace std; bool comp(string a, string b) { return (a.length() > b.length()); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout.setf(ios::fixed); cout.setf(ios::showpoint); { long long int n, x, y; cin >> n >>...
#include <bits/stdc++.h> using namespace std; int n; vector<int> re; int main() { cin >> n; int least[n]; for (int i = 0; i < n; i++) cin >> least[i]; sort(least, least + n); int cont = 0; for (int i = 1; i < n; i++) { if (least[i] == least[i - 1]) { re.push_back(least[i]);...
#include <bits/stdc++.h> using namespace std; void optimise() { ios_base::sync_with_stdio(false); cin.tie(NULL); } long long int mod = 1e6 + 3; void normalize(long long int &a) { a = (a + mod) % mod; } long long int modmul(long long int a, long long int b) { a = a % mod; b = b % mod; nor...
#include <bits/stdc++.h> using namespace std; const int N = 5e4 + 5, P = 1e9 + 7; struct Trie { int ch[2], siz, mn, mx; } t[N * 32]; int n, a[N], cntnode = 1, s[N][33], rt[N], ans; long long kth, m; void Insert(int x) { int now = 1; t[now].siz++; for (int i = 31; ~i; --i) { int& nxt ...
#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; vector<pair<int, int> > g[maxn]; set<pair<int, int> > s; int c[maxn], dis[maxn]; void dijekstra(int u) { dis[u] = 0; s.insert(make_pair(u, dis[u])); while (s.size()) { pair<int, int> a = *s.begin(); s.erase(a); ...
#include <bits/stdc++.h> using namespace std; long long dp[100003][3], ara[100003], mod = 1000000007, n, m; long long solve(long long idx, long long sta) { if (idx == n) { if (sta == 0 \|\| sta == 2) return 1; else { return 0; } } else if (dp[idx][sta] != -1) return d...
#include <bits/stdc++.h> void read(int& x) { x = 0; char c; do { c = getchar(); } while (c < 0 \|\| c > 9 ); while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } } using namespace std; int n, m, f[1000 + 5][1000 + 5], ans, sum[1000 + 5]; int s[100000...
#include <bits/stdc++.h> using namespace std; int main() { int64_t n; cin >> n; multiset<int64_t> S; if (n & 1) { n--; cout << n / 2 << endl; while (n) { S.insert(2); n = n - 2; } auto itr = S.end(); itr--; S.erase(itr); S.insert(3); ...
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n; while (cin >> n) { string s; getline(cin, s); getline(cin, s); stringstream ss(s); string token; string res = ; vector<int> numelements; bool error = 0; ...
#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, k, l, m, n, x, y, z; cin >> n >> x >> y; string s; cin >> s; for (i = 0; i < n; i++) { if (s[i] == 0 ) break; } if (i == n) return cout << 0 << endl, 0; for (j = s.size() - 1; j >= 0; j--) if ...
#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; const int N = 2e5 + 5; int gcd(int a, int b) { if (b == 0) return a; a %= b; return gcd(b, a); } bool compare(long long i, long long j) { return i > j; } long long power(long long x, long long y) { if (y == 0) ...
#include <bits/stdc++.h> using namespace std; ifstream fin( A.in ); ofstream fout( A.out ); long long r, h; int main() { cin >> r >> h; if (h % r == 0) { cout << (h / r) * 2 + 1; return 0; } double d = double(h) / double(r); int z = h / r; double dd = z + 0.5; if (d >= ...
#include <bits/stdc++.h> const int maxn = 1e2 + 10; const int dis[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}}; using namespace std; long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); } long long qpow(long long p, long long q) { long long f = 1; while (q) { if (q & 1) f =...
#include <bits/stdc++.h> using namespace std; void CP() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); return; } int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; int a[n + 1]; a[1] = 1; for (i...
#include<bits/stdc++.h> #define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0) #define arin(x,n) for(int i=0;i<n;i++)cin>>x[i] #define debug(x,n) for(int i=0;i<n;i++)cout<<x[i]<< #define pb push_back #define all(c) begin(c), end(c) #define isAll(c) (int)(c).size() typedef long long int ll; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, a, b; string s = , s1; cin >> n >> a >> b; for (int i = 0; i < b; i++) s += ( a + i); for (int i = b; i < a; i++) s += a ; s1 = s; int x = n / a, y = n % a; ...
#include <bits/stdc++.h> inline long long read() { long long x = 0; char ch = getchar(), w = 1; while (ch < 0 \|\| ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * w; } void...
#include <bits/stdc++.h> using namespace std; void task() { int s, t, q, r = 1; long long tm, cs; cin >> t >> s >> q; cs = s; while (cs < t) { tm = cs; cs = (q - 1) * tm + cs; if (cs < t) r++; } cout << r; } int main() { ios_base::sync_with_stdio(false); tas...
#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) { cerr << n ; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << setw(2) << *it << = << setw(2) << a << ; err(++it, args...); } void solve() { in...
#include <bits/stdc++.h> using namespace std; int n, k; int a[1000000]; vector<pair<int, int> > ans; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= k; i++) { int high = 1, low = 1; for (int j = 2; j <= n;...
#include <bits/stdc++.h> using namespace std; const int MN = 44, MS = (1 << 21) + 2; int n, K; long long adj[MN]; int dp[MS], clique; bool is[MS]; int main() { ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> K; for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++...
#include <bits/stdc++.h> using namespace std; vector<pair<long long, int> > v; int n; long long A[100005]; long long B[100005]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int a, b; scanf( %d %d , &a, &b); A[i] = (long long)a; B[i] = (long long)b; v.pus...
#include <bits/stdc++.h> using namespace std; map<int, string> mapa; int main() { mapa[0] = zero ; mapa[1] = one ; mapa[2] = two ; mapa[3] = three ; mapa[4] = four ; mapa[5] = five ; mapa[6] = six ; mapa[7] = seven ; mapa[8] = eight ; mapa[9] = nine ; mapa[10]...
#include <bits/stdc++.h> using namespace std; int main() { int x, y, a = 0; cin >> x >> y; for (int i = 1; i <= x; i++) { if (i % 2 == 0) { if (a == 0) { for (int k = 0; k < y - 1; k++) { cout << . ; } cout << # << endl; a++; }...
#include <bits/stdc++.h> using namespace std; int cmpfunc(const void* a, const void* b) { return ((int)a - (int)b); } int main() { int A, B, i; long long int sum = 0; int a[100001] = {0}; cin >> A; cin >> B; for (i = 0; i < A; i++) { cin >> a[i]; } qsort(a, A, sizeof(int)...
#include <bits/stdc++.h> using namespace std; string s; bool vis[26]; int main() { cin >> s; long long ans = 1; int cnt1 = 0; int cnt2 = 0; memset(vis, 0, sizeof(vis)); for (int i = 0; i < s.size(); i++) { if (s[i] == ? ) cnt2++; else if (s[i] >= A && s[i] <= Z ) ...
#include <bits/stdc++.h> using namespace std; const int N = 1010; const long long INF = 1e9 + 19; const int LOG = 11; int n, m; int a[N][N]; int b[N][N]; int pref[N][N]; short table[LOG][LOG][N][N]; int deg[N]; void read() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) for (int...
#include <bits/stdc++.h> using namespace std; class Computational_Geometry { public: void init(); void solve(); Computational_Geometry() { EPS = 1e-10; Pi = acos(-1.0); } private: struct node { long long x, y; } point[100010], line[100010]; struct inter { ...
#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) using namespace std; const int N = 1000090, M = 1000000007; int B[N]; void up(int i, int v) { for (; i < N; i += (i & (-i))) B[i] += v; } int sm(int i) { int s = 0; f...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; vector<vector<int>> v(200001, vector<int>(32)); for (int i = 0; i < 2e5 + 1; i++) { for (int j = 0; j < 32; j++) { if (i & (1 << j)) v[i][j] = 1; } } for (int i = 1; i < 2e5 + 1; i++) { for ...
#include <bits/stdc++.h> using namespace std; map<long long, int> mm; long long Abs(long long a) { if (a < 0) a = -a; return a; } int main() { int q, l, m, a; long long b; scanf( %lld%d%d%d , &b, &q, &l, &m); for (int i = 0; i < m; i++) { scanf( %d , &a); mm[a] = 1; } ...
#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int maxn = 200100; map<int, long long> m1; map<int, long long> m2; int a[maxn]; int main() { m1.clear(); m2.clear(); int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++)...
#include <bits/stdc++.h> using namespace std; const int oo = (1 << 29); const int N = 1024; int indeg[N], outdeg[N]; int dis[N][N]; int net[N][N]; bool vis[N]; int n, m; int tmp; void dfs(int sta, int u) { vis[u] = true; for (int i = 1; i <= n; i++) { if (!vis[i] && net[u][i]) { ...
#include <bits/stdc++.h> using namespace std; int n; double ans = 5, a; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a >> a; ans += a * 1.0 / n; } cout << ans; }
#include <bits/stdc++.h> int main() { int t, s, q; scanf( %d %d %d , &t, &s, &q); int j = 0; while (s < t) { s *= q; j++; } printf( %d n , j); return 0; }
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector<vector<int>> a(n, vector<int>(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) cin >> a[i][j]; } vecto...
#include <bits/stdc++.h> using namespace std; int main() { int n; string s; int a, b = 0; cin >> n; cin >> s; int ans = 2000000000; for (int i = 0; i < n; i++) { a = b; cin >> b; if (i) { if (s[i] == L && s[i - 1] == R ) ans = min(ans, (b - a) / 2); } ...
#include <bits/stdc++.h> using namespace std; int n, f[1000010][4][4], m; int a[1000010], b[1000010]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; b[a[i]]++; } for (int i = 1; i <= m; i++) for (int j = 0; j <= 2; j++) for (int k = 0; k <= 2; k...
#include <bits/stdc++.h> using namespace std; int n; int cost[2005]; bool have[2005][3]; int dp[2003][10]; int solve(int i, int vits) { if (i >= n) { if (vits == 7) return 0; return 1e9; } int &ret = dp[i][vits]; if (ret + 1) return ret; int sol1 = 0, sol2 = 0; sol1 = sol...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using ll = long long; using ull = unsigned long long; using ld = long double; using namespace std; int n; void solve() { cin >> n; if (n % 2 == 0) { cout << NO ; return; } cout << YES n ; vector<int> v(2 * n + 1); ...
#include <bits/stdc++.h> using namespace std; int main() { int b, h, a; long long int count = 0; cin >> b >> h; for (int i = h - 1; i >= 0; i = i - 2) { for (int j = b - 1; j >= 0; j = j - 2) { a = j * i; count += a; } } cout << count << endl; return 0; }
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) int main() { ios::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); long long n, p, d, w; cin >> n >> p >> w >> d; for (register int y = (0); y <= (w); ++y) { long long x = (p - y * d) / w; if (x < 0) ...
#include <bits/stdc++.h> using namespace std; int num[2005]; int sum[2005]; bool cmp(int a, int b) { return a > b; } int main() { int n, i, j, t; int temp; while (cin >> n) { memset(num, 0, sizeof(num)); for (i = 0; i < n; i++) { cin >> temp; num[temp]++; } ...
#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; cin >> n >> a >> b; int val = n - a; if (val > (b + 1)) { cout << b + 1 << endl; } else { cout << val << endl; } }
#include <bits/stdc++.h> using namespace std; long long int ABS(long long int a) { if (a < 0) return (-a); return a; } void input() {} int main() { long long int n, t; int f = 0; scanf( %llu , &n); scanf( %llu , &t); long long int x[n]; for (int i = (1); i < (n); ++i) { s...
#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1000000000 ) static char s[1000][1000]; static int dp[2][505][505]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m, res = 0, d1, d2; cin >> n >> m; for (int i = 0; i < n; ++i) cin >> s[i]; dp...
#include <bits/stdc++.h> using namespace std; template <typename T> vector<T> &operator+=(vector<T> &v, T x) { v.push_back(x); return v; } void solve() { int n; cin >> n; int a[n], b[n]; int cash = 1, t = 0; for (int i = (0), _b_ = (n); i < _b_; i++) { cin >> a[i] >> b[i]; ...
#include <bits/stdc++.h> using namespace std; const int maxn = 500005; int tot, head[maxn << 1], n, m, a[maxn << 1], b, maxdep, xzynb, son[maxn << 1], size, ans[maxn << 1]; template <typename Tp> inline void read(Tp& o) { o = 0; register int f = 1; register char c = getchar(); while (c <...
#include <bits/stdc++.h> using namespace std; struct atom { int x, y; } x[110000]; int A[800], f[2][800], n, m; int compare(atom k1, atom k2) { return k1.y < k2.y; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) scanf( %d%d , &x[i].x, &x[i].y); sort(x + 1, x + m + 1, compa...
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int MX = 1e6 + 5; long long MD = 1e9 + 7; const int MDL = 99824453; auto time0 = chrono::high_resolution_clock::now(); long long a[MX], LPF[MX]; long long bin_power(long long a, long long b, long long md) { long long res = 1; ...
#include <bits/stdc++.h> using namespace std; int main() { char no[20]; cin >> no; int len = strlen(no); int ans = (1 << len) - 2; for (int i = (len - 1), pos = 0; i >= 0; i--, pos++) { if (no[i] == 7 ) ans += (1 << pos); } cout << ans + 1 << endl; return 0; }
#include <bits/stdc++.h> using namespace std; inline void Read(int &x) { int f = 1; char c = getchar(); x = 0; while (c < 0 \|\| c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 3) + (x << 1) + c - 0 ; c = getchar(); } ...
#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int minu = 1, temp = 0, n, ans = 0; cin >> n; ans = ((n) * (n + 1)) / 2; while (minu <= n) { temp += minu; minu = 2; } ans -= (2 temp); ...
#include <bits/stdc++.h> using namespace std; template <typename T> void dbg(T t) { cerr << t << endl; } template <typename T, typename... Args> void dbg(T t, Args... args) { cerr << t << ; dbg(args...); } int main() { ios::sync_with_stdio(0); cin.tie(0); int n, a, spec = 3; ...
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); string str; cin >> str; int n = str.size(); vector<int> arr(26, 1e8); for (int i = 0; i < n; i++) { arr[str[i] - 0 - 49] = min(...
#include <bits/stdc++.h> using namespace std; long long power(long long b, long long e) { long long p = 1; while (e > 0) { if (e & 1) { p = (p * b) % 1000000007; } e = e >> 1; b = (b * b) % 1000000007; } return p; } vector<string> num; string s, s1; int main()...
#include <bits/stdc++.h> using namespace std; vector<long long> ydidicreate; int dontknowy[100000]; int main() { int tt; cin >> tt; while (tt--) { int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; ; sort(a, a + n); int f[k]; f...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; const long long mm = 1e9 + 7; int ch[maxn][27], fail[maxn]; long long cnt[maxn]; long long s[maxn], len[maxn]; int slink[maxn]; int dif[maxn]; char sp[maxn]; long long g[maxn]; int last, sz, n; int newnode(int x) { for ...
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<vector<long long>> a; bool tr = true; for (long long l, r, i = 0; i < n; i++) { cin >> l >> r; a.push_back({l, r}); } sort(a.begin(), a.end(), [](const vector<long long>& a, const vect...
#include <bits/stdc++.h> using namespace std; long long cdiv(long long a, long long b) { return a / b + ((a ^ b) > 0 && a % b); } long long fdiv(long long a, long long b) { return a / b - ((a ^ b) < 0 && a % b); } void solve() { long long int n; cin >> n; vector<long long int> v(n); ...
#include <bits/stdc++.h> using namespace std; const int N = 100005; int a[N]; int main() { int n; long long sum = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); sum += a[i] - 1; if (sum % 2 == 1) printf( 1 n ); else printf( 2 n ); ...

#include <bits/stdc++.h> using namespace std; long long fastpower(long a, long b, long long n = 1000000007) { long res = 1; while (b > 0) { if ((b & 1) != 0) { res = (res % n * a % n) % n; } a = (a % n * a % n) % n; b = b >> 1; } return res; } bool isPrime(long lo...

#include <bits/stdc++.h> using namespace std; bool compare(pair<pair<long long int, long long int>, long long int> p1, pair<pair<long long int, long long int>, long long int> p2) { return p1.first.first < p2.first.first; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); ...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); int q; cin >> q; while (q--) { int n; cin >> n; long long l = 0, r = n + 1; while (r - l > 1) { long long k = (l + r) >> 1; if ((long long)(n - k) * (n - k - 1) >= 2LL * k)...

#include <bits/stdc++.h> using namespace std; int countBits(long long mask) { int res = 0; while (mask) mask &= (mask - 1), ++res; return res; } string toString(long long n) { stringstream ss; ss << n; return ss.str(); } long long toNumber(string s) { stringstream ss; long lo...

#include <bits/stdc++.h> const long long mod = 998244853; long long C[5050][5050], n, m, g[5050], ans; signed main() { scanf( %lld%lld , &n, &m); for (long long i = 0; i <= n + m; i++) { C[i][0] = 1; for (long long j = 1; j <= i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod; ...

#include <bits/stdc++.h> using namespace std; const long long inf = 2147383647; const double pi = 2 * acos(0.0); const double eps = 1e-9; struct debugger { template <typename T> debugger& operator,(const T& v) { cerr << v << ; return *this; } } dbg; inline long long gcd(long lon...

#include <bits/stdc++.h> using namespace std; using vint = vector<int>; using pint = pair<int, int>; using vpint = vector<pint>; template <typename A, typename B> inline void chmin(A& a, B b) { if (a > b) a = b; } template <typename A, typename B> inline void chmax(A& a, B b) { if (a < b) a = ...

#include <bits/stdc++.h> using namespace std; void __print(int x) { cout << x; } void __print(long x) { cout << x; } void __print(long long x) { cout << x; } void __print(unsigned x) { cout << x; } void __print(unsigned long x) { cout << x; } void __print(unsigned long long x) { cout << x; } void __prin...

#include <bits/stdc++.h> using namespace std; long long n; void exgcd(long long a, long long b, long long& x, long long& y) { if (b == 0) { x = 1; y = 0; return; } exgcd(b, a % b, x, y); long long p = x - a / b * y; x = y; y = p; } long long dv(long long a, long long ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ; int tt; cin >> tt; while (tt--) { int n; cin >> n; cout << (1ll * ((n - 1) / 2) * (((n - 1) / 2) + 1) * (2 * ((n - 1) / 2) + 1) *...

#include <bits/stdc++.h> using namespace std; const int MAXN = 1000; int from[MAXN + 5]; void Gauss(int n, int d, double a[][MAXN + 5], double *Ans) { for (int i = 1; i <= n; i++) from[i] = i; for (int i = 1; i <= n; i++) { if (!a[i][i]) for (int j = i + 1; j <= min(n, i + d); j++) ...

#include <bits/stdc++.h> using namespace std; void winter_is_coming() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } double k, arr[10001]; int n; double check(double md, double k) { double sum = 0; for (int i = 0; i < n; i++) if (arr[i] > md) { double...

#include <bits/stdc++.h> using namespace std; int main() { string a, b, c; cin >> a >> b; if (a.size() > b.size()) { for (int i = b.size(); i < a.size(); i++) c += 0 ; b = c + b; } if (a.size() < b.size()) { for (int i = a.size(); i < b.size(); i++) c += 0 ; a = c + a; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 65; const int inf = 1e9; int n, m, r; int dp[maxn][maxn][maxn]; int a[maxn][maxn][maxn]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m >> r; for (int i = 0; i < m; i++) for (int j = ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) #pragma GCC target( sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx ) using namespace std; const double eps = 0.000001; const long double pi = acos(-1); const int maxn = 1e7 + 9; const int mod = 1e9 + 7; const long long MOD = 1e18 + 9; const long long INF ...

#include <bits/stdc++.h> #pragma comment(linker, /stack:64000000 ) using namespace std; const double PI = 2 * acos(0.0); const double eps = 1e-9; template <class T> T jog(T a, T b) { return a + b; } template <class T> T bog(T a, T b) { return a - b; } template <class T> T gon(T a, T b) ...

#include <bits/stdc++.h> #pragma GCC optimize(2) #pragma warning(disable : 4996) using namespace std; const long long INF = 2147483647; const double PI = acos(-1); const int mod = 1e9 + 7; bool vis[3][120000]; int main() { long long n, q; cin >> n >> q; long long obstacles = 0; for (int ...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 1000000; struct UnionFind { int par[MAX_N], ra[MAX_N]; void init(int n) { for (int(i) = 0; (i) < (n); (i)++) par[i] = i, ra[i] = 0; } int find(int x) { return par[x] == x ? x : par[x] = find(par[x]); } bool same(int x, int y...

#include <bits/stdc++.h> using namespace std; const int MAXN = 10010; vector<int> v[MAXN]; int childcnt[MAXN] = {0}; int main() { int n; cin >> n; for (int i = 1; i < n; i++) { int a, b; scanf( %d%d , &a, &b); v[a].push_back(b); v[b].push_back(a); } int root = 0; ...

#include <bits/stdc++.h> using namespace std; const long long MOD = 1e9 + 7; const long long LINF = (long long)1e18; const long double PI = acos((long double)-1); const long double EPS = 1e-9; inline long long gcd(long long a, long long b) { long long r; while (b) { r = a % b; a = b; ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast,no-stack-protector,unroll-loops,fast-math,O3 ) #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native ) using namespace std; long long n, k, ans, pw[11], a[200005]; map<int, int> w[11]; int main() { ios_base::sync_with_stdio(0); ...

#include <bits/stdc++.h> using namespace std; const long long mod = 1e9 + 7; long long m, n, f[22], inv[22]; inline long long read() { long long s = 0, f = 1; char c = getchar(); while (c < 0 || c > 9 ) { if (c == - ) { f = -1; } c = getchar(); } while (c >= 0 ...

#include <bits/stdc++.h> using namespace std; const long inf = 1000000000; long n, nn; long d[40000][100]; long dem[40000]; long tong[40000]; long lon[40000]; long canh[40000][30][2]; long res[40000], kq, mot, hai, ans[40000], cans[40000]; string x, s[40], y; vector<string> chuoi; long max(long ...

#include <bits/stdc++.h> using namespace std; template <class T> inline void chkmin(T &a, T b) { if (a > b) a = b; } template <class T> inline void chkmax(T &a, T b) { if (a < b) a = b; } double fail[310][3100], p[310][3100], val[310], nf[3100]; int main() { int N, M, i, j, u; double r...

#include <bits/stdc++.h> using namespace std; int s[1001000]; int g[1001000]; int ans[1001000]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> s[i] >> g[i]; ans[i] = 1001000; } ans[0] = s[0] + g[0]; for (int i = 0; i < n - 1; i++) { ans[i + 1] = mi...

#include <bits/stdc++.h> const long long int N = 2e5 + 5; using namespace std; int main() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); long long int x, y, a, b; cin >> x >> y >> a >> b; vector<pair<long long int, long long int>> mp; for (int i = a; i <= x; i++) { fo...

#include <bits/stdc++.h> char s[100001]; int main() { int n; int i, j; scanf( %s , s); n = strlen(s); for (i = 0; i < n; i++) if (s[i] == 0 ) break; if (i == n) { for (j = 0; j < n - 1; j++) printf( %c , s[j]); printf( n ); } else { for (j = 0; j < i; j++) print...

#include <bits/stdc++.h> using namespace std; const int N = 105555; int a[N]; int main() { int n; scanf( %d , &n); int mn = 1e7, mi, mx = -1e7, xi; for (int i = 0; i < n; ++i) { scanf( %d , a + i); if (i > 1 && xi < i - 1 && mx > a[i - 1] && a[i - 1] < a[i]) { printf( 3 n%d %...

#include <bits/stdc++.h> using namespace std; set<long long int> blacklist; long long int par(long long int* parent, long long int f, long long int n) { if (parent[f] < 0) return parent[f]; if (parent[f] == f) return f; else { parent[f] = par(parent, parent[f], n); return parent[f]; ...

#include <bits/stdc++.h> using namespace std; int main() { int t; scanf( %d , &t); while (t--) { long long int n; scanf( %lld , &n); printf( %lld n , n); } return 0; }

#include <bits/stdc++.h> using namespace std; class TaskC { public: void solve(std::istream& in, std::ostream& out); }; void TaskC::solve(std::istream& in, std::ostream& out) { int n; in >> n; int a[310][310]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; ++j) { in >>...

#include <bits/stdc++.h> using namespace std; void solve() { long long int n, k; cin >> n >> k; vector<long long int> a(n); for (long long int i = 0; i < n; i++) cin >> a[i]; long long int ans = -1e18; for (long long int i = 0; i < n; i++) { for (long long int j = i; j < n; j++) { ...

#include <bits/stdc++.h> using namespace std; const int N = 100010; const int SIZ = 500; inline void read(int &x) { x = 0; int f = 1; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) { f = -1; } ch = getchar(); } while (ch >= 0 && ch <= 9 ) ...

#include <bits/stdc++.h> using namespace std; int A[1111111]; int B[1111111]; int main(void) { int alen = 0; int blen = 0; scanf( %d %d , &alen, &blen); for (int i = 0; i < alen; i++) scanf( %d , &A[i]); memset(B, -1, sizeof(B)); for (int i = 0; i < blen; i++) { int x = 0; sc...

#include <bits/stdc++.h> const int N = 3e4 + 10; long long ri() { char c = getchar(); long long x = 0, f = 1; for (; c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (; c >= 0 && c <= 9 ; c = getchar()) x = (x << 1) + (x << 3) - 0 + c; return x * f; } long long len[66]...

#include <bits/stdc++.h> using namespace std; class Solution { public: int n, m; std::vector<int> r; std::vector<std::vector<int>> d; std::vector<std::vector<std::array<int, 2>>> v; std::vector<bool> visited; std::vector<int> val; void dfs(int cur, int col) { visited[cur] = true...

#include <bits/stdc++.h> using namespace std; const long long N = 1e5; long long pref1[N + 5]; long long pref2[N + 5]; long long ans; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, type, l, r; cin >> n; n++; int arr[n]; for (int i = 1;...

#include <bits/stdc++.h> using namespace std; int main() { int n; scanf( %d , &n); vector<int> a(n); int i; for (i = 0; i < n; i++) { scanf( %d , &a[i]); } vector<int> b(n); for (i = 0; i < n - 1; i++) { b[i] = a[i] + a[i + 1]; } b[n - 1] = a[n - 1]; for (i = ...

#include <bits/stdc++.h> int main() { int t, x, i, z, n, max = 0, s = 0, a[1000], m; scanf( %d %d , &n, &m); for (i = 0; i < n; i++) { scanf( %d , &a[i]); s += a[i]; if (max < a[i]) { max = a[i]; } } max = max + m; s = s + m; if (s % n == 0) { x = s / ...

#include <bits/stdc++.h> using namespace std; bool comp(string a, string b) { return (a.length() > b.length()); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout.setf(ios::fixed); cout.setf(ios::showpoint); { long long int n, x, y; cin >> n >>...

#include <bits/stdc++.h> using namespace std; int n; vector<int> re; int main() { cin >> n; int least[n]; for (int i = 0; i < n; i++) cin >> least[i]; sort(least, least + n); int cont = 0; for (int i = 1; i < n; i++) { if (least[i] == least[i - 1]) { re.push_back(least[i]);...

#include <bits/stdc++.h> using namespace std; void optimise() { ios_base::sync_with_stdio(false); cin.tie(NULL); } long long int mod = 1e6 + 3; void normalize(long long int &a) { a = (a + mod) % mod; } long long int modmul(long long int a, long long int b) { a = a % mod; b = b % mod; nor...

#include <bits/stdc++.h> using namespace std; const int N = 5e4 + 5, P = 1e9 + 7; struct Trie { int ch[2], siz, mn, mx; } t[N * 32]; int n, a[N], cntnode = 1, s[N][33], rt[N], ans; long long kth, m; void Insert(int x) { int now = 1; t[now].siz++; for (int i = 31; ~i; --i) { int& nxt ...

#include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; vector<pair<int, int> > g[maxn]; set<pair<int, int> > s; int c[maxn], dis[maxn]; void dijekstra(int u) { dis[u] = 0; s.insert(make_pair(u, dis[u])); while (s.size()) { pair<int, int> a = *s.begin(); s.erase(a); ...

#include <bits/stdc++.h> using namespace std; long long dp[100003][3], ara[100003], mod = 1000000007, n, m; long long solve(long long idx, long long sta) { if (idx == n) { if (sta == 0 || sta == 2) return 1; else { return 0; } } else if (dp[idx][sta] != -1) return d...

#include <bits/stdc++.h> void read(int& x) { x = 0; char c; do { c = getchar(); } while (c < 0 || c > 9 ); while (c >= 0 && c <= 9 ) { x = x * 10 + c - 0 ; c = getchar(); } } using namespace std; int n, m, f[1000 + 5][1000 + 5], ans, sum[1000 + 5]; int s[100000...

#include <bits/stdc++.h> using namespace std; int main() { int64_t n; cin >> n; multiset<int64_t> S; if (n & 1) { n--; cout << n / 2 << endl; while (n) { S.insert(2); n = n - 2; } auto itr = S.end(); itr--; S.erase(itr); S.insert(3); ...

#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); int n; while (cin >> n) { string s; getline(cin, s); getline(cin, s); stringstream ss(s); string token; string res = ; vector<int> numelements; bool error = 0; ...

#include <bits/stdc++.h> using namespace std; int main() { long long int i, j, k, l, m, n, x, y, z; cin >> n >> x >> y; string s; cin >> s; for (i = 0; i < n; i++) { if (s[i] == 0 ) break; } if (i == n) return cout << 0 << endl, 0; for (j = s.size() - 1; j >= 0; j--) if ...

#include <bits/stdc++.h> using namespace std; const long long mod = 998244353; const int N = 2e5 + 5; int gcd(int a, int b) { if (b == 0) return a; a %= b; return gcd(b, a); } bool compare(long long i, long long j) { return i > j; } long long power(long long x, long long y) { if (y == 0) ...

#include <bits/stdc++.h> using namespace std; ifstream fin( A.in ); ofstream fout( A.out ); long long r, h; int main() { cin >> r >> h; if (h % r == 0) { cout << (h / r) * 2 + 1; return 0; } double d = double(h) / double(r); int z = h / r; double dd = z + 0.5; if (d >= ...

#include <bits/stdc++.h> const int maxn = 1e2 + 10; const int dis[4][2] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}}; using namespace std; long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); } long long qpow(long long p, long long q) { long long f = 1; while (q) { if (q & 1) f =...

#include <bits/stdc++.h> using namespace std; void CP() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); return; } int main() { ios_base::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; int a[n + 1]; a[1] = 1; for (i...

#include<bits/stdc++.h> #define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0) #define arin(x,n) for(int i=0;i<n;i++)cin>>x[i] #define debug(x,n) for(int i=0;i<n;i++)cout<<x[i]<< #define pb push_back #define all(c) begin(c), end(c) #define isAll(c) (int)(c).size() typedef long long int ll; ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { int n, a, b; string s = , s1; cin >> n >> a >> b; for (int i = 0; i < b; i++) s += ( a + i); for (int i = b; i < a; i++) s += a ; s1 = s; int x = n / a, y = n % a; ...

#include <bits/stdc++.h> inline long long read() { long long x = 0; char ch = getchar(), w = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) w = -1; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { x = x * 10 + ch - 0 ; ch = getchar(); } return x * w; } void...

#include <bits/stdc++.h> using namespace std; void task() { int s, t, q, r = 1; long long tm, cs; cin >> t >> s >> q; cs = s; while (cs < t) { tm = cs; cs = (q - 1) * tm + cs; if (cs < t) r++; } cout << r; } int main() { ios_base::sync_with_stdio(false); tas...

#include <bits/stdc++.h> using namespace std; void err(istream_iterator<string> it) { cerr << n ; } template <typename T, typename... Args> void err(istream_iterator<string> it, T a, Args... args) { cerr << setw(2) << *it << = << setw(2) << a << ; err(++it, args...); } void solve() { in...

#include <bits/stdc++.h> using namespace std; int n, k; int a[1000000]; vector<pair<int, int> > ans; int main() { ios_base::sync_with_stdio(false); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i <= k; i++) { int high = 1, low = 1; for (int j = 2; j <= n;...

#include <bits/stdc++.h> using namespace std; const int MN = 44, MS = (1 << 21) + 2; int n, K; long long adj[MN]; int dp[MS], clique; bool is[MS]; int main() { ios_base ::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n >> K; for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++...

#include <bits/stdc++.h> using namespace std; vector<pair<long long, int> > v; int n; long long A[100005]; long long B[100005]; int main() { scanf( %d , &n); for (int i = 1; i <= n; i++) { int a, b; scanf( %d %d , &a, &b); A[i] = (long long)a; B[i] = (long long)b; v.pus...

#include <bits/stdc++.h> using namespace std; map<int, string> mapa; int main() { mapa[0] = zero ; mapa[1] = one ; mapa[2] = two ; mapa[3] = three ; mapa[4] = four ; mapa[5] = five ; mapa[6] = six ; mapa[7] = seven ; mapa[8] = eight ; mapa[9] = nine ; mapa[10]...

#include <bits/stdc++.h> using namespace std; int main() { int x, y, a = 0; cin >> x >> y; for (int i = 1; i <= x; i++) { if (i % 2 == 0) { if (a == 0) { for (int k = 0; k < y - 1; k++) { cout << . ; } cout << # << endl; a++; }...

#include <bits/stdc++.h> using namespace std; int cmpfunc(const void* a, const void* b) { return (*(int*)a - *(int*)b); } int main() { int A, B, i; long long int sum = 0; int a[100001] = {0}; cin >> A; cin >> B; for (i = 0; i < A; i++) { cin >> a[i]; } qsort(a, A, sizeof(int)...

#include <bits/stdc++.h> using namespace std; string s; bool vis[26]; int main() { cin >> s; long long ans = 1; int cnt1 = 0; int cnt2 = 0; memset(vis, 0, sizeof(vis)); for (int i = 0; i < s.size(); i++) { if (s[i] == ? ) cnt2++; else if (s[i] >= A && s[i] <= Z ) ...

#include <bits/stdc++.h> using namespace std; const int N = 1010; const long long INF = 1e9 + 19; const int LOG = 11; int n, m; int a[N][N]; int b[N][N]; int pref[N][N]; short table[LOG][LOG][N][N]; int deg[N]; void read() { scanf( %d%d , &n, &m); for (int i = 0; i < n; i++) for (int...

#include <bits/stdc++.h> using namespace std; class Computational_Geometry { public: void init(); void solve(); Computational_Geometry() { EPS = 1e-10; Pi = acos(-1.0); } private: struct node { long long x, y; } point[100010], line[100010]; struct inter { ...

#include <bits/stdc++.h> #pragma GCC target( avx2 ) #pragma GCC optimization( O3 ) #pragma GCC optimization( unroll-loops ) using namespace std; const int N = 1000090, M = 1000000007; int B[N]; void up(int i, int v) { for (; i < N; i += (i & (-i))) B[i] += v; } int sm(int i) { int s = 0; f...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; vector<vector<int>> v(200001, vector<int>(32)); for (int i = 0; i < 2e5 + 1; i++) { for (int j = 0; j < 32; j++) { if (i & (1 << j)) v[i][j] = 1; } } for (int i = 1; i < 2e5 + 1; i++) { for ...

#include <bits/stdc++.h> using namespace std; map<long long, int> mm; long long Abs(long long a) { if (a < 0) a = -a; return a; } int main() { int q, l, m, a; long long b; scanf( %lld%d%d%d , &b, &q, &l, &m); for (int i = 0; i < m; i++) { scanf( %d , &a); mm[a] = 1; } ...

#include <bits/stdc++.h> #pragma comment(linker, /STACK:1024000000,1024000000 ) using namespace std; const int maxn = 200100; map<int, long long> m1; map<int, long long> m2; int a[maxn]; int main() { m1.clear(); m2.clear(); int n, k; scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++)...

#include <bits/stdc++.h> using namespace std; const int oo = (1 << 29); const int N = 1024; int indeg[N], outdeg[N]; int dis[N][N]; int net[N][N]; bool vis[N]; int n, m; int tmp; void dfs(int sta, int u) { vis[u] = true; for (int i = 1; i <= n; i++) { if (!vis[i] && net[u][i]) { ...

#include <bits/stdc++.h> using namespace std; int n; double ans = 5, a; int main() { cin >> n; for (int i = 0; i < n; i++) { cin >> a >> a; ans += a * 1.0 / n; } cout << ans; }

#include <bits/stdc++.h> int main() { int t, s, q; scanf( %d %d %d , &t, &s, &q); int j = 0; while (s < t) { s *= q; j++; } printf( %d n , j); return 0; }

#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; vector<vector<int>> a(n, vector<int>(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) cin >> a[i][j]; } vecto...

#include <bits/stdc++.h> using namespace std; int main() { int n; string s; int a, b = 0; cin >> n; cin >> s; int ans = 2000000000; for (int i = 0; i < n; i++) { a = b; cin >> b; if (i) { if (s[i] == L && s[i - 1] == R ) ans = min(ans, (b - a) / 2); } ...

#include <bits/stdc++.h> using namespace std; int n, f[1000010][4][4], m; int a[1000010], b[1000010]; int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; b[a[i]]++; } for (int i = 1; i <= m; i++) for (int j = 0; j <= 2; j++) for (int k = 0; k <= 2; k...

#include <bits/stdc++.h> using namespace std; int n; int cost[2005]; bool have[2005][3]; int dp[2003][10]; int solve(int i, int vits) { if (i >= n) { if (vits == 7) return 0; return 1e9; } int &ret = dp[i][vits]; if (ret + 1) return ret; int sol1 = 0, sol2 = 0; sol1 = sol...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using ll = long long; using ull = unsigned long long; using ld = long double; using namespace std; int n; void solve() { cin >> n; if (n % 2 == 0) { cout << NO ; return; } cout << YES n ; vector<int> v(2 * n + 1); ...

#include <bits/stdc++.h> using namespace std; int main() { int b, h, a; long long int count = 0; cin >> b >> h; for (int i = h - 1; i >= 0; i = i - 2) { for (int j = b - 1; j >= 0; j = j - 2) { a = j * i; count += a; } } cout << count << endl; return 0; }

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( Ofast ) int main() { ios::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); long long n, p, d, w; cin >> n >> p >> w >> d; for (register int y = (0); y <= (w); ++y) { long long x = (p - y * d) / w; if (x < 0) ...

#include <bits/stdc++.h> using namespace std; int num[2005]; int sum[2005]; bool cmp(int a, int b) { return a > b; } int main() { int n, i, j, t; int temp; while (cin >> n) { memset(num, 0, sizeof(num)); for (i = 0; i < n; i++) { cin >> temp; num[temp]++; } ...

#include <bits/stdc++.h> using namespace std; int main() { int n, a, b; cin >> n >> a >> b; int val = n - a; if (val > (b + 1)) { cout << b + 1 << endl; } else { cout << val << endl; } }

#include <bits/stdc++.h> using namespace std; long long int ABS(long long int a) { if (a < 0) return (-a); return a; } void input() {} int main() { long long int n, t; int f = 0; scanf( %llu , &n); scanf( %llu , &t); long long int x[n]; for (int i = (1); i < (n); ++i) { s...

#include <bits/stdc++.h> using namespace std; #pragma comment(linker, /STACK:1000000000 ) static char s[1000][1000]; static int dp[2][505][505]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, m, res = 0, d1, d2; cin >> n >> m; for (int i = 0; i < n; ++i) cin >> s[i]; dp...

#include <bits/stdc++.h> using namespace std; template <typename T> vector<T> &operator+=(vector<T> &v, T x) { v.push_back(x); return v; } void solve() { int n; cin >> n; int a[n], b[n]; int cash = 1, t = 0; for (int i = (0), _b_ = (n); i < _b_; i++) { cin >> a[i] >> b[i]; ...

#include <bits/stdc++.h> using namespace std; const int maxn = 500005; int tot, head[maxn << 1], n, m, a[maxn << 1], b, maxdep, xzynb, son[maxn << 1], size, ans[maxn << 1]; template <typename Tp> inline void read(Tp& o) { o = 0; register int f = 1; register char c = getchar(); while (c <...

#include <bits/stdc++.h> using namespace std; struct atom { int x, y; } x[110000]; int A[800], f[2][800], n, m; int compare(atom k1, atom k2) { return k1.y < k2.y; } int main() { scanf( %d%d , &n, &m); for (int i = 1; i <= m; i++) scanf( %d%d , &x[i].x, &x[i].y); sort(x + 1, x + m + 1, compa...

#include <bits/stdc++.h> using namespace std; const int INF = 1e9; const int MX = 1e6 + 5; long long MD = 1e9 + 7; const int MDL = 99824453; auto time0 = chrono::high_resolution_clock::now(); long long a[MX], LPF[MX]; long long bin_power(long long a, long long b, long long md) { long long res = 1; ...

#include <bits/stdc++.h> using namespace std; int main() { char no[20]; cin >> no; int len = strlen(no); int ans = (1 << len) - 2; for (int i = (len - 1), pos = 0; i >= 0; i--, pos++) { if (no[i] == 7 ) ans += (1 << pos); } cout << ans + 1 << endl; return 0; }

#include <bits/stdc++.h> using namespace std; inline void Read(int &x) { int f = 1; char c = getchar(); x = 0; while (c < 0 || c > 9 ) { if (c == - ) f = -1; c = getchar(); } while (c >= 0 && c <= 9 ) { x = (x << 3) + (x << 1) + c - 0 ; c = getchar(); } ...

#include <bits/stdc++.h> using namespace std; int main() { long long int t; cin >> t; while (t--) { long long int minu = 1, temp = 0, n, ans = 0; cin >> n; ans = ((n) * (n + 1)) / 2; while (minu <= n) { temp += minu; minu *= 2; } ans -= (2 * temp); ...

#include <bits/stdc++.h> using namespace std; template <typename T> void dbg(T t) { cerr << t << endl; } template <typename T, typename... Args> void dbg(T t, Args... args) { cerr << t << ; dbg(args...); } int main() { ios::sync_with_stdio(0); cin.tie(0); int n, a, spec = 3; ...

#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); string str; cin >> str; int n = str.size(); vector<int> arr(26, 1e8); for (int i = 0; i < n; i++) { arr[str[i] - 0 - 49] = min(...

#include <bits/stdc++.h> using namespace std; long long power(long long b, long long e) { long long p = 1; while (e > 0) { if (e & 1) { p = (p * b) % 1000000007; } e = e >> 1; b = (b * b) % 1000000007; } return p; } vector<string> num; string s, s1; int main()...

#include <bits/stdc++.h> using namespace std; vector<long long> ydidicreate; int dontknowy[100000]; int main() { int tt; cin >> tt; while (tt--) { int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; ; sort(a, a + n); int f[k]; f...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 10; const long long mm = 1e9 + 7; int ch[maxn][27], fail[maxn]; long long cnt[maxn]; long long s[maxn], len[maxn]; int slink[maxn]; int dif[maxn]; char sp[maxn]; long long g[maxn]; int last, sz, n; int newnode(int x) { for ...

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<vector<long long>> a; bool tr = true; for (long long l, r, i = 0; i < n; i++) { cin >> l >> r; a.push_back({l, r}); } sort(a.begin(), a.end(), [](const vector<long long>& a, const vect...

#include <bits/stdc++.h> using namespace std; long long cdiv(long long a, long long b) { return a / b + ((a ^ b) > 0 && a % b); } long long fdiv(long long a, long long b) { return a / b - ((a ^ b) < 0 && a % b); } void solve() { long long int n; cin >> n; vector<long long int> v(n); ...

#include <bits/stdc++.h> using namespace std; const int N = 100005; int a[N]; int main() { int n; long long sum = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) { scanf( %d , &a[i]); sum += a[i] - 1; if (sum % 2 == 1) printf( 1 n ); else printf( 2 n ); ...