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 main(int argc, char const *argv[]) { long long n; cin >> n; vector<long long> a(n); for (int i = 0; i < n - 1; ++i) { long long u, v; cin >> u >> v; a[u - 1]++; a[v - 1]++; } for (int i = 0; i < n; ++i) { if (a[i...
#include <bits/stdc++.h> using namespace std; double dp[2020][2020]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, t; double p; cin >> n >> p >> t; dp[0][0] = 1; for (int i = 1; i <= t; i++) dp[i][0] = dp[i - 1][0] * (1 - p); for (int i = 1; i <= t; i++) { for...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = ...
#include <bits/stdc++.h> using namespace std; const int N = 200010; struct E { int to, nxt; } e[N << 1]; int n, m, head[N], cnt, l[N], r[N], ans[N], ans_cnt, fa[N]; bool b[N]; int Write[20], WRI; void judge() { freopen( .in , r , stdin); freopen( .out , w , stdout); } int read() { ...
#include <bits/stdc++.h> using namespace std; int l, r, n, k, m, now, tot, all; int a[200000], s[200000]; struct fk { int num, val; bool operator==(const fk &b) { return (num + b.num == k && val == b.val); } } tp[200000]; int main() { scanf( %d%d%d , &n, &k, &m); for (int i = 1; i <= n; ++i)...
#include <bits/stdc++.h> using namespace std; int main() { int n; int ans = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = i; j <= n; j++) { int k = i ^ j; if (k <= n && k >= 1 && k >= j && i + j > k) ans++; } printf( %d , ans); }
#include <bits/stdc++.h> using namespace std; int main() { string s; int n, c = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> s; c = s == Tetrahedron ? c += 4 : c; c = s == Cube ? c += 6 : c; c = s == Octahedron ? c += 8 : c; c = s == Dodecahedron ? c += 12 ...
#include <bits/stdc++.h> using namespace std; void imprimirVector(vector<int> v) { if (!v.empty()) { int p = v.size(); cout << [ ; for (int i = 0; i < (int)(p - 1); i++) cout << v[i] << , ; cout << v[p - 1] << ] << endl; } else cout << [] << endl; } int toNumber(strin...
#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( -Ofast , -funroll-all-loops , -ffast-math ) using namespace std; using LL = long long; constexpr LL mod = 1e9 + 7; long long ex_gcd(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1; y = 0; ...
#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } string toBin(long long a) { string res = ; while (a) { res += char((a & 1) + 0 ); a >>= 1; } reverse(res.begin(), res.end()); return re...
#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; long long N, S; long long fa[maxn], q[maxn], d[maxn], head, tail, sz[maxn], son[maxn]; bool check(long long Mid) { long long tN = N, now = 1, p = 1, res = 0; while (tN) { res += min(p, tN) * now; if (res > S) return fa...
#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; const int maxN = 2e6 + 5; string s[maxN]; int type[maxN]; int n; pair<int, int> rang[3]; int sum[maxN]; bool in_range(int x, int type) { return x >= rang[type].first && x <= rang[type].second; } int conv(string s) { if ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); int k = min(n, m); if (k & 1) printf( Akshat ); else printf( Malvika ); return 0; }
#include <bits/stdc++.h> using namespace std; char a[1000005]; char c[1000005]; bool H(char a[], char c[], int i, int x) { int d = 0; for (int q = 0; q < i; q += x) { int s = 0; for (int o = 0; o < x; o++) { if (a[o + q] > c[o]) return 1; else if (a[o + q] == c[o]) ...
#include <bits/stdc++.h> using namespace std; const long long int MOD = 1000000007; const long long int INF = LONG_MAX; const vector<vector<long long int> > adj4({{0, 1}, {0, -1}, {1, 0}, {-1, 0}}); const vector<vector<long long int> > adj8( {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {-1, -1}, {1, -1}, {-1, 1},...
#include <bits/stdc++.h> using namespace std; char s[5005]; int main() { int i, j, k; scanf( %s , s); int len, n, m; len = strlen(s); int Q, D, ans; ans = 0; for (i = 0; i < len; i++) { Q = 0; D = 0; for (j = i; j < len; j++) { Q += s[j] == ( ; Q -= s...
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; vector<int> g[2 * N]; vector<pair<int, int> > mark[N]; int n, m; long long val[N]; struct Bit { long long c[N]; int lowbit(int x) { return x & -x; } long long Sum(int x) { long long res = 0; while (x > 0) { ...
#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; template <class T1, class T2> inline void remin(T1& a, T2 b) { a = min(a, (T1)b); } const int maxN = 1 << 18, maxTS = maxN * 2, INF = 1 << 30; vector<int> G[maxN]; int A[maxN], pat[maxN], whole[maxN], ile[maxN], sz[maxN], re...
#include <bits/stdc++.h> using namespace std; int n, k; vector<bool> is_important; vector<vector<int> > graph; vector<int> used; vector<int> res; bool dfs(int v) { used[v] = 1; bool f_p = is_important[v]; for (int u : graph[v]) { if (used[u] == 0) { f_p = dfs(u) \|\| f_p; } e...
#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int lcm(int a, int b) { return a * (b / gcd(a, b)); } const int maxSize = 100000 + 5; int main() { int n, k; cin >> n >> k; vector<long long int> arr(n); for (int i = 0; i < n; i++) { ...
#include <bits/stdc++.h> const int mod = 1000000007; const int inf = 1000000009; const long long int INF = 1000000000000000009; const long long big = 1000000000000000; const long double eps = 0.0000000001; using namespace std; queue<int> K; vector<int> H; vector<int> P[100005]; int S[100005], G[1000...
#include <bits/stdc++.h> using namespace std; template <typename Arg1> void debug_out(const char* name, Arg1&& arg1) { cout << name << = << arg1 << ] << n ; } template <typename Arg1, typename... Args> void debug_out(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strc...
#include <bits/stdc++.h> using namespace std; string itos(int x) { stringstream ss; ss << x; return ss.str(); } int n, m, d[300010], vis[300010]; pair<int, int> a[300010]; vector<int> e[300010], res; int dfs(int now) { if (vis[now]) return 0; vis[now] = 1; d[now] = (d[now] == 1); ...
#include <bits/stdc++.h> using namespace std; const long long INF = 2000000000000000000LL; const int inf = 0x3f3f3f3f; const long double EPS = 1e-9; string a, b; inline void solve() { vector<long long> mapa(26); for (long long i = 0; i < a.size(); i++) { mapa[a[i] - a ]++; } for (int ...
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; vector<int> sol; set<int> fac; int main() { ios_base::sync_with_stdio, cin.tie(0), cout.tie(0); int n; cin >> n; while (n--) { int a, b; cin >> a >> b; cout << a + b << endl; } }
#include <bits/stdc++.h> using namespace std; void sll(long long &x) { register char c = getchar(); x = 0; int neg = 0; for (; ((c < 48 \|\| c > 57) && c != - ); c = getchar()) ; if (c == - ) { neg = 1; c = getchar(); } for (; c > 47 && c < 58; c = getchar()) { x ...
#include<bits/stdc++.h> #define rep(i,n) for(int i=0 ; i<n ; i++) #define ll long long #define pb push_back #define mp make_pair #define all(x) x.begin(),x.end() using namespace std; const ll MX=1e6+2; const ll MOD=1e9+7; int main(){ int t; cin>>t; while(t--){ ll n; ...
#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); for (int i = 1; i <= n - n / 3; i++) printf( 1 %d n , i); for (int i = 1; i <= n / 3; i++) printf( 4 %d n , 2 * i); return 0; }
#include <bits/stdc++.h> using namespace std; const int maxn = 1e5, maxf = 1 << 18; const int mod = 998244353; namespace usual { int fac[maxf + 5], ifac[maxf + 5]; int add(int ta, int tb) { return ta + tb >= mod ? ta + tb - mod : ta + tb; } int sub(int ta, int tb) { return ta < tb ? ta - tb + mod : ta - t...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); bool hole[n + 1]; bool contain[n + 1]; memset(hole, false, sizeof hole); memset(contain, false, sizeof contain); int first; while (m--) { scanf( %d , &first); hole[first] ...
#include <bits/stdc++.h> using namespace std; using i64 = long long; using u64 = unsigned long long; struct debug { ~debug() { cerr << endl; } template <class c> debug& operator<<(c x) { cerr << x; return *this; } template <class c, class d> debug& operator<<(pair<c, d> x) { ...
#include <bits/stdc++.h> using namespace std; int main() { double m, R; cin >> m >> R; double answer = (m * (m + 1) * (m + 2) / 3 - m) * 2; answer += (sqrt(2.0) - 2) * ((m * m - m) + (m * m - m - (m - 1) * 2)); answer /= (m * m); answer *= R; cout << setprecision(7) << answer << endl; ...
#include <bits/stdc++.h> const double PI = 3.1415926535897932384626433832795; using namespace std; long long mod = 1e9 + 7; bool visited[3005]; vector<vector<int> > G; bool cycle[3005]; int dp[3005], P[3005]; void dfs(int u, int v) { visited[u] = true; int sz = G[u].size(); for (int i = 0; i...
#include <bits/stdc++.h> using namespace std; char a[55]; char s[1005][55]; bool can[1005]; int have[30]; int tmp[30]; int pos[55], tot; int len, n, ans, rest; set<char> se; int main() { scanf( %d , &len); scanf( %s , a + 1); scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %s , ...
#include <bits/stdc++.h> using namespace std; const int inf = 987654321; const long long int INF = 123456789987654321; FILE fin, fout; int N, M; vector<vector<int> > V; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { scanf( %d %d , &N, &M); V = vector<vector<int> >(N, vect...
#include <bits/stdc++.h> using namespace std; bool deb_mode = 0; class debugger { vector<string> vars; public: template <typename T> debugger &operator,(const T v) { stringstream ss; ss << v, vars.push_back(ss.str()); return *this; } void printall() { int j = 0, l...
#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; while (a > 0 && b > 0) { if (a >= 2 * b) { a = a - (a / (2 * b)) * (2 * b); } else if (b >= 2 * a) { b = b - (b / (2 * a)) * (2 * a); } else { break; } } cout...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int a[N], n, ans[N], b[N]; int main() { scanf( %d , &n); if (n == 1) { printf( 1 n ); return 0; } for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) { b[0] = 0; int to = (...
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; int flag = 0; for (int i = 0, j = s2.length() - 1; i < s1.length(), j >= 0; i++, j--) { if (s1[i] == s2[j]) { flag++; } } if (flag == s1.length()) cout << YES << endl; e...
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5, MOD = 1e9 + 7; bool c[11]; int main() { int n, k; scanf( %d %d , &n, &k); long long ans[n]; pair<int, pair<int, int>> a[n]; priority_queue<int> pq; for (int i = 0; i < n; i++) { scanf( %d , &a[i].first); } ...
#include <bits/stdc++.h> using namespace std; int n, a[1001], k; int main() { scanf( %d%d , &n, &k); n = 2 * n + 1; for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 2; i < n; i += 2) if (k && a[i - 1] + 1 < a[i] && a[i] > a[i + 1] + 1) { a[i]--; k--; } ...
#include <bits/stdc++.h> using namespace std; void File() { freopen( output.txt , w , stdout); freopen( input.txt , r , stdin); } void yAsEr_HaFiz() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}; int dy[] = {1, -1, 0, 0, -1, 1,...
#include<bits/stdc++.h> using namespace std; #ifdef LOCAL #include debug.h #endif #ifdef LOCAL #define debug(...) cerr << [ << #__VA_ARGS__ << ]: , debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif #define endl n typedef long long ll; typedef long double ld; typedef ve...
#include <bits/stdc++.h> #define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define hell 1000000007 #define pb push_back #define endl n #define rep(i, s, n) for(ll i = s; i < (n); ++i) #define F first #define S second #define ll long long #define sz(a) a.size() #define...
#include <bits/stdc++.h> using std::abs; using std::array; using std::cerr; using std::cin; using std::cout; using std::generate; using std::make_pair; using std::map; using std::max; using std::max_element; using std::min; using std::min_element; using std::pair; using std::reverse; using...
#include <bits/stdc++.h> using namespace std; long long int n, k; long long int i; long long int sum = 0; long long int cheng = 1; long long int ans[200010]; struct xxx { long long int num; long long int id; bool operator<(const struct xxx &node) const { return num > node.num; } } xxx[200010...
#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int a[105], n, K, sn; struct Mat { int a[105][105]; Mat() { memset(a, 0, sizeof(a)); } Mat operator*(const Mat &b) const { Mat c = Mat(); for (int i = 0; i <= sn; i++) for (int j = 0; j <= sn; j++) ...
#include <bits/stdc++.h> using namespace std; int main() { int n, s, sum = 0, big; cin >> n >> s; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } sort(arr, arr + n); big = arr[n - 1]; if (sum - big <= s) cout << YES ; else cout <...
#include <bits/stdc++.h> const int N = 26, M = 50006; int n, a[3][N], b[2 * N], f[N][M * N]; int main() { std::cin >> n; std::multiset<int> nums; for (int i = 1; i <= 2 * n; ++i) { std::cin >> b[i]; } std::sort(b + 1, b + 2 * n + 1); a[1][1] = b[1], a[2][n] = b[2]; int sum = 0; ...
#include <bits/stdc++.h> using namespace std; const int N = 100010; long long f[N]; const int mod = 1000000007; int main() { string s; cin >> s; s += , ; long long ans = 1; int l = s.size(); f[0] = 1, f[1] = 1, f[2] = 2; for (int i = 3; i <= l; i++) f[i] = (f[i - 1] + f[i - 2]) % ...
#include <bits/stdc++.h> using namespace std; int n, s[50005], ans[50005]; pair<int, int> t[50005]; int main() { scanf( %d , &n); for (int i = (1); i <= (n); i++) scanf( %d , &s[i]); s[n + 1] = s[1]; for (int i = (1); i <= (n); i++) t[i] = make_pair(s[i] + s[i + 1], i); sort(t + 1, t + n + 1...
#include <bits/stdc++.h> using namespace std; int n, i, j, p[3005], a; int main() { scanf( %d , &n); for (i = 1; i <= n; i++) scanf( %d , &p[i]); for (i = 1; i < n; i++) for (j = i + 1; j <= n; j++) if (p[i] > p[j]) a++; printf( %d n , a * 2 - a % 2); return 0; }
#include <bits/stdc++.h> using namespace std; void die(string S) { puts(S.c_str()); exit(0); } char occ[10][10]; bool T[4][3][3] = {{{1, 1, 1}, {0, 1, 0}, {0, 1, 0}}, {{0, 1, 0}, {0, 1, 0}, {1, 1, 1}}, {{1, 0, 0}, {1, 1, 1}, {1, 0, 0}}, {{...
#include <bits/stdc++.h> using namespace std; map<int, int> mp; long long v[500000]; long long f[100005], p[100005]; bool chk(int n) { while (n) { int t = n % 10; if (t == 4 \|\| t == 7) { n /= 10; } else return false; } return true; } void egcd(long long a, lon...
#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { solve(); } return 0; } void solve() { string s, t; cin >> s >> t; long long a[10]; memset(a, 0,...
#include <bits/stdc++.h> using namespace std; int a[100001]; int main() { int n, x = 0; cin >> n; for (int i = 2; i <= n; i++) { if (a[i] == 0) { x++; a[i] = x; for (int j = i; j <= n; j += i) a[j] = x; } } for (int i = 2; i <= n; i++) cout << a[i] << ; ...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n; double edge; while (t) { cin >> n; n = n * 2; edge = sin(3.1415926535897932384626 / n / 2); edge = 0.5 / edge; cout << setprecision(12); cout << edge << endl; --t; } ...
#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 7; struct node { int x1, y1, x2, y2; node() {} node(int _x1, int _y1, int _x2, int _y2) : x1(_x1), y1(_y1), x2(_x2), y2(_y2) {} } q[N]; int n, m, r[N], r1[N], c[N], c1[N]; int main() { scanf( %d , &n); for (int i =...
#include <bits/stdc++.h> using namespace std; int n, k, a[10010]; long long ans; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); for (int i = 1; i <= k; i++) ans += a[i]; printf( %lld n , ans); return 0; }
#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } bo...
#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double esp = 0.0000000001; const double PI = acos(-1.0); const int mod = 1e9 + 7; const int MY = 1400 + 5; const int MX = 1010 + 5; int num, n, k; vector<int> G[MX]; int d[MX * MX], g[MX][MX], vis[MX]; struct node { ...
#include <bits/stdc++.h> using namespace std; const long long int MAXN = 2e5 + 51; long long int n, r; long long int prefix[MAXN], f[MAXN]; inline long long int read() { register long long int num = 0, neg = 1; register char ch = getchar(); while (!isdigit(ch) && ch != - ) { ch = getchar();...
#include <bits/stdc++.h> using namespace std; const long long int INF = 2e18; const long long int N = 2e5 + 5; bool isPrime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 \|\| n % 3 == 0) return false; for (long long int i = 5; i * i <= n; i = i + 6) { i...
#include <bits/stdc++.h> using namespace std; void optimise() { ios_base::sync_with_stdio(false); cin.tie(NULL); } void solve() { string s; cin >> s; string s2; cin >> s2; sort(s.begin(), s.end()); for (long long int i = 0; i < s.size(); i++) { for (long long int j = i + 1;...
#include <bits/stdc++.h> using namespace std; template <class T> inline T modinv(T a, T n) { T i = n, v = 0, d = 1; while (a > 0) { T t = i / a, x = a; a = i % x; i = x; x = d; d = v - t * x; v = x; } return (v + n) % n; } long long modpow(long long n, long ...
#include <bits/stdc++.h> using namespace std; int a[50], p[50], b[50]; bool cmp(int x, int y) { if (a[x] < a[y]) return 1; return 0; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); p[i] = i; } sort(p, p + n, cmp); for (int i ...
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 100; int f[maxn]; int a[maxn]; char s[maxn]; int main() { int d; scanf( %d , &d); scanf( %s , s); int len = strlen(s); a[1] = s[0] - 0 ; for (int i = 1; i < len; i++) { a[i + 1] = a[i] + (s[i] - 0 ); } ...
#include <bits/stdc++.h> using namespace std; const int kN = 2e5 + 10; int N, M; struct Ele { long long len; char c; void read() { len = 0; char s[30]; scanf( %s , s); for (int i = 0; s[i]; i++) { if (s[i] == - ) { c = s[i + 1]; break; } e...
#include <bits/stdc++.h> using namespace std; const int N = 200005; vector<int> g[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, s; cin >> n >> s; for (int i = 0; i < n - 1; ++i) { int a, b; cin >> a >> b; g[a].push_back(b); g[b].push_back(a); }...
#include <bits/stdc++.h> using namespace std; void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } long long gcd(long long a, long long b) { if (b == 0) return a; else gcd(b, a % b); } long long lcd(long long a, long long b) { return (a * b) / gcd(a, b)...
#include <bits/stdc++.h> using namespace std; int n, a[1010], b[1010], cnt, x[1010], y[1010], z[1010], w[1010]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1; i <= n; ++i) scanf( %d , &b[i]); for (int i = 1; i <= n; ++i) { if (a[i] == i && b[i]...
#include <bits/stdc++.h> using namespace std; int main() { double a, b, c, d; cin >> a >> b >> c >> d; cout << (long long)ceil((ceil(b / c) * a) / d) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } map<int, int> mpi; map<string, int> mps; map<int, vector<int> > path; map<int, int> visited; set<int> st; vector<int> v; map<int, int>::iterator iti; map<string, int>::iterator it...
#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long ans = 1; for (long long int i = 2; i * i <= n; i++) { long long int temp = 0; while (n % i == 0) { temp++; n /= i; } ans = (temp + 1); } if (n > 1) ans = 2; ...
#include <bits/stdc++.h> using namespace std; bool isGeometrical(int a, int n) { if (a[0] == 0) { for (int i = 0; i < n; i++) if (a[i] != 0) return false; return true; } for (int i = 0; i < n - 1; i++) if (a[i + 1] a[0] != a[i] * a[1]) return false; return true; } in...
#include <bits/stdc++.h> using namespace std; int n, kk, a, b; double dp[1123][111][111]; int arr[111]; void solve() { scanf( %d , &n); ; scanf( %d , &kk); ; kk = min(kk, 1000); double dd = n * (n + 1) / 2; double ans = 0.0; for (int i = 0; i < n; i++) { scanf( %d , &arr[...
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10, mod = 1e9 + 7, L = 20; vector<int> G[N], g[N]; int h[N], x[5 * N], y[5 * N], par[N][L]; map<int, bool> mp[N]; void dfs(int v, int p) { par[v][0] = p; for (int i = 1; i < L; i++) par[v][i] = par[par[v][i - 1]][i - 1]; for (int ...
#include <bits/stdc++.h> using namespace std; long long blk = 300; struct data { long long l, r, i; data() { l = r = i = 0; } data(long long v1, long long v2, long long v3) { l = v1; r = v2; i = v3; } bool operator<(const data &x) const { if (l / blk != x.l / blk) ...
#include <bits/stdc++.h> using namespace std; const int tam = 100010; const int MOD = 1000000007; const int MOD1 = 998244353; const double EPS = 1e-9; const double PI = acos(-1); int ar[3000000]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n...
#include <bits/stdc++.h> using namespace std; int main() { string str; int n; cin >> n >> str; bool flag = true; int fs = 0, ss = 0; for (int i = 0; i < n; i++) { if (str[i] != 4 && str[i] != 7 ) { flag = false; } } for (int i = 0; i < n / 2; i++) { fs +=...
#include <bits/stdc++.h> inline int gi() { register int x = 0, f = 0; register char ch = getchar(); while (!isdigit(ch)) f ^= ch == - , ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } std::set<std::pair<int, int> > st[100010]; std::bitset<2000...
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 5; const int M = 1e6; const long long INF = (long long)(1e18); const int inf = 1e9; const long long MOD = 1000000007LL; long long n, m; long long a[MAX_N]; long long ans[MAX_N]; long long suff[MAX_N]; void solve() {} int main(...
#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) struct E { int to; vector<long long> w; }; const long long INF = 1e18; const int N = 3e5 + 5, L = 20; vector<E> g[N]; long long t[N], d[2][2][N][L]; int anc[N][L], tin[N], tout[N]; int timer = 0, n; void deep(int...
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; long long ans = 0; for (int i = 0; i < k && n >= 2; i++) { ans += n - 1 + n - 2; n -= 2; } cout << ans; }
#include <bits/stdc++.h> using namespace std; char src[2002], tar[2002]; int ans[2002 * 4], n; int get(int l, int r, char ch) { for (int i = l; i <= r; i++) if (src[i] == ch) return i; return -1; } void reverse(int l, int r) { for (int i = l; i < r - i + l; i++) swap(src[i], src[r - i + l]...
#include <bits/stdc++.h> using namespace std; const int N = 100100; int main() { ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int t; cin >> t; for (int hh = 1; hh <= t; hh++) { int a, b, c, r, aa, bb; cin >> aa >> bb >> c >> r; int r1, r2; r1 = c - r; r...
#include <bits/stdc++.h> using namespace std; const int mxn = 300001; int n; long long a[mxn], dp[mxn]; map<int, int> first[mxn]; void answer() { cin >> n; long long ret = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; first[i].clear(); if (first[i - 1].count(a[i])) { i...
#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<int> a(n); int prev = -1; bool invalid = false; for (int i = 0; i < n; i++) { cin >> a[i]; invalid = (prev > a[i]) \|\| (a[i] > i + 1); prev = a[i]; } if (invalid) { cout << -1 ...
#include <bits/stdc++.h> using namespace std; const int MAXN = (1 << 20) + 50; const int MAXLOG = 21; long long int a[MAXN]; long long int data[MAXLOG][MAXN]; long long int answer[2][MAXN]; long long int n; void build(int s = 0, int e = (1 << n), int h = 0) { if (e - s < 2) { data[h][s] = a[s]...
#include <bits/stdc++.h> using namespace std; const int N = 200005; int n, a[N], cnt[N], sum[N]; vector<int> pos[N]; set<int> S; int main() { scanf( %d , &n); for (int i = (1); i <= (n); ++i) scanf( %d , &a[i]), ++cnt[a[i]], pos[a[i]].push_back(i); int tt = 0, mx = 0; for (int i = (1);...
#include <bits/stdc++.h> using namespace std; int n, k; long long a[1 << 24], dp[1 << 24], b[2]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[1 << i]; cin >> k; for (int i = 0; i < k; i++) cin >> b[i]; for (int i = 1; i < (1 << n); i++) { long long s = 0; int t = i...
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) #pragma GCC optimize( no-stack-protector ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( fast-math ) #pragma GCC target( sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native ) mt19937 rng(time(NULL)); const int inf = 1e9 + 1...
#include <bits/stdc++.h> using namespace std; void wldd() { long long n, a, b; cin >> n >> a >> b; b = b % n; long long sum = 0; if (b < 0) { sum = n + a + b; } else { sum = a + b; } if (sum % n == 0) cout << n << n ; else cout << abs(sum % n) << n ; ...
#include <bits/stdc++.h> using namespace std; int sgn(double x) { return (x > 1e-8) - (x < -1e-8); } int count_bit(int x) { return x == 0 ? 0 : count_bit(x >> 1) + (x & 1); } template <class T> inline void to_min(T &a, const T b) { if (b < a) a = b; } template <class T> inline void to_max(T &a, cons...
#include <bits/stdc++.h> using namespace std; int n; int main() { scanf( %d , &n); printf( +------------------------+ n ); printf( \| ); if (n >= 1) printf( O. ); else printf( #. ); for (int i = 2; i <= 11; i++) if ((i - 2) * 3 + 4 + 1 <= n) printf( O. ); els...
#include <bits/stdc++.h> using namespace std; template <class T> T gcd(T a, T b) { if (!b) return a; while (b ^= a ^= b ^= a %= b) ; return a; } template <class T> T max(const T& t1, const T& t2, const T& t3) { return max(max(t1, t2), t3); } template <class T> T max(const T& t1, ...
#include <bits/stdc++.h> using namespace std; int main() { int n, m, x, y; int a[1005], b[1005], c[1005], d[1005]; cin >> n >> m >> x >> y; for (int i = 1; i <= m; i++) { cin >> a[i] >> b[i] >> c[i] >> d[i]; } int dp[1005][11]; int temp, i, j, k, t; for (int i = 0; i <= n; i++)...
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int a, b, ans = 0; cin >> a >> b; ans = min(a, b); ans = min(ans, (a + b) / 3); cout << ans << endl; } return 0; }
#include <bits/stdc++.h> using namespace std; struct node { long long x; int c; friend bool operator<(node x, node y) { return x.x < y.x; } } a[400001]; long long leftdata[400001], rightdata[400001]; int n; long long ans; long long max1, max2, l1, r1, ttt; void work1() { long long tans; ...
#include <bits/stdc++.h> using namespace std; int n, d, h; vector<pair<int, int> > ans; int main() { ios::sync_with_stdio(0); cin >> n >> d >> h; if (2 * h < d \|\| (d == 1 && n > 2)) { cout << -1 << n ; return 0; } for (int i = 2; i <= h + 1; i++) ans.push_back(make_pair(i - 1, ...

#include <bits/stdc++.h> using namespace std; int main(int argc, char const *argv[]) { long long n; cin >> n; vector<long long> a(n); for (int i = 0; i < n - 1; ++i) { long long u, v; cin >> u >> v; a[u - 1]++; a[v - 1]++; } for (int i = 0; i < n; ++i) { if (a[i...

#include <bits/stdc++.h> using namespace std; double dp[2020][2020]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, t; double p; cin >> n >> p >> t; dp[0][0] = 1; for (int i = 1; i <= t; i++) dp[i][0] = dp[i - 1][0] * (1 - p); for (int i = 1; i <= t; i++) { for...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; long long ans = 0; for (int i = (0); i < (n); ++i) { long long t, T, x, cost; cin >> t >> T >> x >> cost; if (t >= T) { ans += cost + m * x; continue; } long long aux1 = ...

#include <bits/stdc++.h> using namespace std; const int N = 200010; struct E { int to, nxt; } e[N << 1]; int n, m, head[N], cnt, l[N], r[N], ans[N], ans_cnt, fa[N]; bool b[N]; int Write[20], WRI; void judge() { freopen( .in , r , stdin); freopen( .out , w , stdout); } int read() { ...

#include <bits/stdc++.h> using namespace std; int l, r, n, k, m, now, tot, all; int a[200000], s[200000]; struct fk { int num, val; bool operator==(const fk &b) { return (num + b.num == k && val == b.val); } } tp[200000]; int main() { scanf( %d%d%d , &n, &k, &m); for (int i = 1; i <= n; ++i)...

#include <bits/stdc++.h> using namespace std; int main() { int n; int ans = 0; scanf( %d , &n); for (int i = 1; i <= n; i++) for (int j = i; j <= n; j++) { int k = i ^ j; if (k <= n && k >= 1 && k >= j && i + j > k) ans++; } printf( %d , ans); }

#include <bits/stdc++.h> using namespace std; int main() { string s; int n, c = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> s; c = s == Tetrahedron ? c += 4 : c; c = s == Cube ? c += 6 : c; c = s == Octahedron ? c += 8 : c; c = s == Dodecahedron ? c += 12 ...

#include <bits/stdc++.h> using namespace std; void imprimirVector(vector<int> v) { if (!v.empty()) { int p = v.size(); cout << [ ; for (int i = 0; i < (int)(p - 1); i++) cout << v[i] << , ; cout << v[p - 1] << ] << endl; } else cout << [] << endl; } int toNumber(strin...

#include <bits/stdc++.h> #pragma GCC optimize( O3 ) #pragma GCC optimize( -Ofast , -funroll-all-loops , -ffast-math ) using namespace std; using LL = long long; constexpr LL mod = 1e9 + 7; long long ex_gcd(long long a, long long b, long long &x, long long &y) { if (!b) { x = 1; y = 0; ...

#include <bits/stdc++.h> using namespace std; long long gcd(long long a, long long b) { if (b == 0) return a; return gcd(b, a % b); } string toBin(long long a) { string res = ; while (a) { res += char((a & 1) + 0 ); a >>= 1; } reverse(res.begin(), res.end()); return re...

#include <bits/stdc++.h> using namespace std; const int maxn = 1000010; long long N, S; long long fa[maxn], q[maxn], d[maxn], head, tail, sz[maxn], son[maxn]; bool check(long long Mid) { long long tN = N, now = 1, p = 1, res = 0; while (tN) { res += min(p, tN) * now; if (res > S) return fa...

#include <bits/stdc++.h> using namespace std; const int inf = 1e9 + 7; const int maxN = 2e6 + 5; string s[maxN]; int type[maxN]; int n; pair<int, int> rang[3]; int sum[maxN]; bool in_range(int x, int type) { return x >= rang[type].first && x <= rang[type].second; } int conv(string s) { if ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m; scanf( %d%d , &n, &m); int k = min(n, m); if (k & 1) printf( Akshat ); else printf( Malvika ); return 0; }

#include <bits/stdc++.h> using namespace std; char a[1000005]; char c[1000005]; bool H(char a[], char c[], int i, int x) { int d = 0; for (int q = 0; q < i; q += x) { int s = 0; for (int o = 0; o < x; o++) { if (a[o + q] > c[o]) return 1; else if (a[o + q] == c[o]) ...

#include <bits/stdc++.h> using namespace std; const long long int MOD = 1000000007; const long long int INF = LONG_MAX; const vector<vector<long long int> > adj4({{0, 1}, {0, -1}, {1, 0}, {-1, 0}}); const vector<vector<long long int> > adj8( {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {-1, -1}, {1, -1}, {-1, 1},...

#include <bits/stdc++.h> using namespace std; char s[5005]; int main() { int i, j, k; scanf( %s , s); int len, n, m; len = strlen(s); int Q, D, ans; ans = 0; for (i = 0; i < len; i++) { Q = 0; D = 0; for (j = i; j < len; j++) { Q += s[j] == ( ; Q -= s...

#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 5; vector<int> g[2 * N]; vector<pair<int, int> > mark[N]; int n, m; long long val[N]; struct Bit { long long c[N]; int lowbit(int x) { return x & -x; } long long Sum(int x) { long long res = 0; while (x > 0) { ...

#include <bits/stdc++.h> #pragma GCC optimize( Ofast ) using namespace std; template <class T1, class T2> inline void remin(T1& a, T2 b) { a = min(a, (T1)b); } const int maxN = 1 << 18, maxTS = maxN * 2, INF = 1 << 30; vector<int> G[maxN]; int A[maxN], pat[maxN], whole[maxN], ile[maxN], sz[maxN], re...

#include <bits/stdc++.h> using namespace std; int n, k; vector<bool> is_important; vector<vector<int> > graph; vector<int> used; vector<int> res; bool dfs(int v) { used[v] = 1; bool f_p = is_important[v]; for (int u : graph[v]) { if (used[u] == 0) { f_p = dfs(u) || f_p; } e...

#include <bits/stdc++.h> using namespace std; int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int lcm(int a, int b) { return a * (b / gcd(a, b)); } const int maxSize = 100000 + 5; int main() { int n, k; cin >> n >> k; vector<long long int> arr(n); for (int i = 0; i < n; i++) { ...

#include <bits/stdc++.h> const int mod = 1000000007; const int inf = 1000000009; const long long int INF = 1000000000000000009; const long long big = 1000000000000000; const long double eps = 0.0000000001; using namespace std; queue<int> K; vector<int> H; vector<int> P[100005]; int S[100005], G[1000...

#include <bits/stdc++.h> using namespace std; template <typename Arg1> void debug_out(const char* name, Arg1&& arg1) { cout << name << = << arg1 << ] << n ; } template <typename Arg1, typename... Args> void debug_out(const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strc...

#include <bits/stdc++.h> using namespace std; string itos(int x) { stringstream ss; ss << x; return ss.str(); } int n, m, d[300010], vis[300010]; pair<int, int> a[300010]; vector<int> e[300010], res; int dfs(int now) { if (vis[now]) return 0; vis[now] = 1; d[now] = (d[now] == 1); ...

#include <bits/stdc++.h> using namespace std; const long long INF = 2000000000000000000LL; const int inf = 0x3f3f3f3f; const long double EPS = 1e-9; string a, b; inline void solve() { vector<long long> mapa(26); for (long long i = 0; i < a.size(); i++) { mapa[a[i] - a ]++; } for (int ...

#include <bits/stdc++.h> using namespace std; const int MAXN = 2e5 + 10; vector<int> sol; set<int> fac; int main() { ios_base::sync_with_stdio, cin.tie(0), cout.tie(0); int n; cin >> n; while (n--) { int a, b; cin >> a >> b; cout << a + b << endl; } }

#include <bits/stdc++.h> using namespace std; void sll(long long &x) { register char c = getchar(); x = 0; int neg = 0; for (; ((c < 48 || c > 57) && c != - ); c = getchar()) ; if (c == - ) { neg = 1; c = getchar(); } for (; c > 47 && c < 58; c = getchar()) { x ...

#include<bits/stdc++.h> #define rep(i,n) for(int i=0 ; i<n ; i++) #define ll long long #define pb push_back #define mp make_pair #define all(x) x.begin(),x.end() using namespace std; const ll MX=1e6+2; const ll MOD=1e9+7; int main(){ int t; cin>>t; while(t--){ ll n; ...

#include <bits/stdc++.h> int main() { int n; scanf( %d , &n); for (int i = 1; i <= n - n / 3; i++) printf( 1 %d n , i); for (int i = 1; i <= n / 3; i++) printf( 4 %d n , 2 * i); return 0; }

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5, maxf = 1 << 18; const int mod = 998244353; namespace usual { int fac[maxf + 5], ifac[maxf + 5]; int add(int ta, int tb) { return ta + tb >= mod ? ta + tb - mod : ta + tb; } int sub(int ta, int tb) { return ta < tb ? ta - tb + mod : ta - t...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, k; scanf( %d%d%d , &n, &m, &k); bool hole[n + 1]; bool contain[n + 1]; memset(hole, false, sizeof hole); memset(contain, false, sizeof contain); int first; while (m--) { scanf( %d , &first); hole[first] ...

#include <bits/stdc++.h> using namespace std; using i64 = long long; using u64 = unsigned long long; struct debug { ~debug() { cerr << endl; } template <class c> debug& operator<<(c x) { cerr << x; return *this; } template <class c, class d> debug& operator<<(pair<c, d> x) { ...

#include <bits/stdc++.h> using namespace std; int main() { double m, R; cin >> m >> R; double answer = (m * (m + 1) * (m + 2) / 3 - m) * 2; answer += (sqrt(2.0) - 2) * ((m * m - m) + (m * m - m - (m - 1) * 2)); answer /= (m * m); answer *= R; cout << setprecision(7) << answer << endl; ...

#include <bits/stdc++.h> const double PI = 3.1415926535897932384626433832795; using namespace std; long long mod = 1e9 + 7; bool visited[3005]; vector<vector<int> > G; bool cycle[3005]; int dp[3005], P[3005]; void dfs(int u, int v) { visited[u] = true; int sz = G[u].size(); for (int i = 0; i...

#include <bits/stdc++.h> using namespace std; char a[55]; char s[1005][55]; bool can[1005]; int have[30]; int tmp[30]; int pos[55], tot; int len, n, ans, rest; set<char> se; int main() { scanf( %d , &len); scanf( %s , a + 1); scanf( %d , &n); for (int i = 1; i <= n; i++) scanf( %s , ...

#include <bits/stdc++.h> using namespace std; const int inf = 987654321; const long long int INF = 123456789987654321; FILE *fin, *fout; int N, M; vector<vector<int> > V; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { scanf( %d %d , &N, &M); V = vector<vector<int> >(N, vect...

#include <bits/stdc++.h> using namespace std; bool deb_mode = 0; class debugger { vector<string> vars; public: template <typename T> debugger &operator,(const T v) { stringstream ss; ss << v, vars.push_back(ss.str()); return *this; } void printall() { int j = 0, l...

#include <bits/stdc++.h> using namespace std; int main() { long long a, b; cin >> a >> b; while (a > 0 && b > 0) { if (a >= 2 * b) { a = a - (a / (2 * b)) * (2 * b); } else if (b >= 2 * a) { b = b - (b / (2 * a)) * (2 * a); } else { break; } } cout...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int a[N], n, ans[N], b[N]; int main() { scanf( %d , &n); if (n == 1) { printf( 1 n ); return 0; } for (int i = 1; i <= n; i++) scanf( %d , &a[i]); for (int i = 1; i <= n; i++) { b[0] = 0; int to = (...

#include <bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; int flag = 0; for (int i = 0, j = s2.length() - 1; i < s1.length(), j >= 0; i++, j--) { if (s1[i] == s2[j]) { flag++; } } if (flag == s1.length()) cout << YES << endl; e...

#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 5, MOD = 1e9 + 7; bool c[11]; int main() { int n, k; scanf( %d %d , &n, &k); long long ans[n]; pair<int, pair<int, int>> a[n]; priority_queue<int> pq; for (int i = 0; i < n; i++) { scanf( %d , &a[i].first); } ...

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

#include <bits/stdc++.h> using namespace std; void File() { freopen( output.txt , w , stdout); freopen( input.txt , r , stdin); } void yAsEr_HaFiz() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}; int dy[] = {1, -1, 0, 0, -1, 1,...

#include<bits/stdc++.h> using namespace std; #ifdef LOCAL #include debug.h #endif #ifdef LOCAL #define debug(...) cerr << [ << #__VA_ARGS__ << ]: , debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif #define endl n typedef long long ll; typedef long double ld; typedef ve...

#include <bits/stdc++.h> #define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define hell 1000000007 #define pb push_back #define endl n #define rep(i, s, n) for(ll i = s; i < (n); ++i) #define F first #define S second #define ll long long #define sz(a) a.size() #define...

#include <bits/stdc++.h> using std::abs; using std::array; using std::cerr; using std::cin; using std::cout; using std::generate; using std::make_pair; using std::map; using std::max; using std::max_element; using std::min; using std::min_element; using std::pair; using std::reverse; using...

#include <bits/stdc++.h> using namespace std; long long int n, k; long long int i; long long int sum = 0; long long int cheng = 1; long long int ans[200010]; struct xxx { long long int num; long long int id; bool operator<(const struct xxx &node) const { return num > node.num; } } xxx[200010...

#include <bits/stdc++.h> using namespace std; const int mod = 1000000007; int a[105], n, K, sn; struct Mat { int a[105][105]; Mat() { memset(a, 0, sizeof(a)); } Mat operator*(const Mat &b) const { Mat c = Mat(); for (int i = 0; i <= sn; i++) for (int j = 0; j <= sn; j++) ...

#include <bits/stdc++.h> using namespace std; int main() { int n, s, sum = 0, big; cin >> n >> s; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; sum += arr[i]; } sort(arr, arr + n); big = arr[n - 1]; if (sum - big <= s) cout << YES ; else cout <...

#include <bits/stdc++.h> const int N = 26, M = 50006; int n, a[3][N], b[2 * N], f[N][M * N]; int main() { std::cin >> n; std::multiset<int> nums; for (int i = 1; i <= 2 * n; ++i) { std::cin >> b[i]; } std::sort(b + 1, b + 2 * n + 1); a[1][1] = b[1], a[2][n] = b[2]; int sum = 0; ...

#include <bits/stdc++.h> using namespace std; const int N = 100010; long long f[N]; const int mod = 1000000007; int main() { string s; cin >> s; s += , ; long long ans = 1; int l = s.size(); f[0] = 1, f[1] = 1, f[2] = 2; for (int i = 3; i <= l; i++) f[i] = (f[i - 1] + f[i - 2]) % ...

#include <bits/stdc++.h> using namespace std; int n, s[50005], ans[50005]; pair<int, int> t[50005]; int main() { scanf( %d , &n); for (int i = (1); i <= (n); i++) scanf( %d , &s[i]); s[n + 1] = s[1]; for (int i = (1); i <= (n); i++) t[i] = make_pair(s[i] + s[i + 1], i); sort(t + 1, t + n + 1...

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

#include <bits/stdc++.h> using namespace std; void die(string S) { puts(S.c_str()); exit(0); } char occ[10][10]; bool T[4][3][3] = {{{1, 1, 1}, {0, 1, 0}, {0, 1, 0}}, {{0, 1, 0}, {0, 1, 0}, {1, 1, 1}}, {{1, 0, 0}, {1, 1, 1}, {1, 0, 0}}, {{...

#include <bits/stdc++.h> using namespace std; map<int, int> mp; long long v[500000]; long long f[100005], p[100005]; bool chk(int n) { while (n) { int t = n % 10; if (t == 4 || t == 7) { n /= 10; } else return false; } return true; } void egcd(long long a, lon...

#include <bits/stdc++.h> using namespace std; void solve(); int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int TESTS = 1; while (TESTS--) { solve(); } return 0; } void solve() { string s, t; cin >> s >> t; long long a[10]; memset(a, 0,...

#include <bits/stdc++.h> using namespace std; int a[100001]; int main() { int n, x = 0; cin >> n; for (int i = 2; i <= n; i++) { if (a[i] == 0) { x++; a[i] = x; for (int j = i; j <= n; j += i) a[j] = x; } } for (int i = 2; i <= n; i++) cout << a[i] << ; ...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; int n; double edge; while (t) { cin >> n; n = n * 2; edge = sin(3.1415926535897932384626 / n / 2); edge = 0.5 / edge; cout << setprecision(12); cout << edge << endl; --t; } ...

#include <bits/stdc++.h> using namespace std; const int N = 1e3 + 7; struct node { int x1, y1, x2, y2; node() {} node(int _x1, int _y1, int _x2, int _y2) : x1(_x1), y1(_y1), x2(_x2), y2(_y2) {} } q[N]; int n, m, r[N], r1[N], c[N], c1[N]; int main() { scanf( %d , &n); for (int i =...

#include <bits/stdc++.h> using namespace std; int n, k, a[10010]; long long ans; int main() { scanf( %d%d , &n, &k); for (int i = 1; i <= n; i++) scanf( %d , &a[i]); sort(a + 1, a + n + 1); for (int i = 1; i <= k; i++) ans += a[i]; printf( %lld n , ans); return 0; }

#include <bits/stdc++.h> using namespace std; long long int power(long long int x, long long int y, long long int p) { long long int res = 1; x = x % p; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } bo...

#include <bits/stdc++.h> using namespace std; const int INF = 0x3f3f3f3f; const double esp = 0.0000000001; const double PI = acos(-1.0); const int mod = 1e9 + 7; const int MY = 1400 + 5; const int MX = 1010 + 5; int num, n, k; vector<int> G[MX]; int d[MX * MX], g[MX][MX], vis[MX]; struct node { ...

#include <bits/stdc++.h> using namespace std; const long long int MAXN = 2e5 + 51; long long int n, r; long long int prefix[MAXN], f[MAXN]; inline long long int read() { register long long int num = 0, neg = 1; register char ch = getchar(); while (!isdigit(ch) && ch != - ) { ch = getchar();...

#include <bits/stdc++.h> using namespace std; const long long int INF = 2e18; const long long int N = 2e5 + 5; bool isPrime(long long int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (long long int i = 5; i * i <= n; i = i + 6) { i...

#include <bits/stdc++.h> using namespace std; void optimise() { ios_base::sync_with_stdio(false); cin.tie(NULL); } void solve() { string s; cin >> s; string s2; cin >> s2; sort(s.begin(), s.end()); for (long long int i = 0; i < s.size(); i++) { for (long long int j = i + 1;...

#include <bits/stdc++.h> using namespace std; template <class T> inline T modinv(T a, T n) { T i = n, v = 0, d = 1; while (a > 0) { T t = i / a, x = a; a = i % x; i = x; x = d; d = v - t * x; v = x; } return (v + n) % n; } long long modpow(long long n, long ...

#include <bits/stdc++.h> using namespace std; int a[50], p[50], b[50]; bool cmp(int x, int y) { if (a[x] < a[y]) return 1; return 0; } int main() { int n; scanf( %d , &n); for (int i = 0; i < n; i++) { scanf( %d , &a[i]); p[i] = i; } sort(p, p + n, cmp); for (int i ...

#include <bits/stdc++.h> using namespace std; const int maxn = 1e6 + 100; int f[maxn]; int a[maxn]; char s[maxn]; int main() { int d; scanf( %d , &d); scanf( %s , s); int len = strlen(s); a[1] = s[0] - 0 ; for (int i = 1; i < len; i++) { a[i + 1] = a[i] + (s[i] - 0 ); } ...

#include <bits/stdc++.h> using namespace std; const int kN = 2e5 + 10; int N, M; struct Ele { long long len; char c; void read() { len = 0; char s[30]; scanf( %s , s); for (int i = 0; s[i]; i++) { if (s[i] == - ) { c = s[i + 1]; break; } e...

#include <bits/stdc++.h> using namespace std; const int N = 200005; vector<int> g[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, s; cin >> n >> s; for (int i = 0; i < n - 1; ++i) { int a, b; cin >> a >> b; g[a].push_back(b); g[b].push_back(a); }...

#include <bits/stdc++.h> using namespace std; void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } long long gcd(long long a, long long b) { if (b == 0) return a; else gcd(b, a % b); } long long lcd(long long a, long long b) { return (a * b) / gcd(a, b)...

#include <bits/stdc++.h> using namespace std; int n, a[1010], b[1010], cnt, x[1010], y[1010], z[1010], w[1010]; int main() { scanf( %d , &n); for (int i = 1; i <= n; ++i) scanf( %d , &a[i]); for (int i = 1; i <= n; ++i) scanf( %d , &b[i]); for (int i = 1; i <= n; ++i) { if (a[i] == i && b[i]...

#include <bits/stdc++.h> using namespace std; int main() { double a, b, c, d; cin >> a >> b >> c >> d; cout << (long long)ceil((ceil(b / c) * a) / d) << endl; return 0; }

#include <bits/stdc++.h> using namespace std; void fast() { ios_base::sync_with_stdio(false); cin.tie(NULL); } map<int, int> mpi; map<string, int> mps; map<int, vector<int> > path; map<int, int> visited; set<int> st; vector<int> v; map<int, int>::iterator iti; map<string, int>::iterator it...

#include <bits/stdc++.h> using namespace std; int main() { long long n; cin >> n; long long ans = 1; for (long long int i = 2; i * i <= n; i++) { long long int temp = 0; while (n % i == 0) { temp++; n /= i; } ans *= (temp + 1); } if (n > 1) ans *= 2; ...

#include <bits/stdc++.h> using namespace std; bool isGeometrical(int *a, int n) { if (a[0] == 0) { for (int i = 0; i < n; i++) if (a[i] != 0) return false; return true; } for (int i = 0; i < n - 1; i++) if (a[i + 1] * a[0] != a[i] * a[1]) return false; return true; } in...

#include <bits/stdc++.h> using namespace std; int n, kk, a, b; double dp[1123][111][111]; int arr[111]; void solve() { scanf( %d , &n); ; scanf( %d , &kk); ; kk = min(kk, 1000); double dd = n * (n + 1) / 2; double ans = 0.0; for (int i = 0; i < n; i++) { scanf( %d , &arr[...

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10, mod = 1e9 + 7, L = 20; vector<int> G[N], g[N]; int h[N], x[5 * N], y[5 * N], par[N][L]; map<int, bool> mp[N]; void dfs(int v, int p) { par[v][0] = p; for (int i = 1; i < L; i++) par[v][i] = par[par[v][i - 1]][i - 1]; for (int ...

#include <bits/stdc++.h> using namespace std; long long blk = 300; struct data { long long l, r, i; data() { l = r = i = 0; } data(long long v1, long long v2, long long v3) { l = v1; r = v2; i = v3; } bool operator<(const data &x) const { if (l / blk != x.l / blk) ...

#include <bits/stdc++.h> using namespace std; const int tam = 100010; const int MOD = 1000000007; const int MOD1 = 998244353; const double EPS = 1e-9; const double PI = acos(-1); int ar[3000000]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for (int i = 0; i < n...

#include <bits/stdc++.h> using namespace std; int main() { string str; int n; cin >> n >> str; bool flag = true; int fs = 0, ss = 0; for (int i = 0; i < n; i++) { if (str[i] != 4 && str[i] != 7 ) { flag = false; } } for (int i = 0; i < n / 2; i++) { fs +=...

#include <bits/stdc++.h> inline int gi() { register int x = 0, f = 0; register char ch = getchar(); while (!isdigit(ch)) f ^= ch == - , ch = getchar(); while (isdigit(ch)) x = x * 10 + ch - 0 , ch = getchar(); return f ? -x : x; } std::set<std::pair<int, int> > st[100010]; std::bitset<2000...

#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5 + 5; const int M = 1e6; const long long INF = (long long)(1e18); const int inf = 1e9; const long long MOD = 1000000007LL; long long n, m; long long a[MAX_N]; long long ans[MAX_N]; long long suff[MAX_N]; void solve() {} int main(...

#include <bits/stdc++.h> using namespace std; #pragma warning(disable : 4996) struct E { int to; vector<long long> w; }; const long long INF = 1e18; const int N = 3e5 + 5, L = 20; vector<E> g[N]; long long t[N], d[2][2][N][L]; int anc[N][L], tin[N], tout[N]; int timer = 0, n; void deep(int...

#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; long long ans = 0; for (int i = 0; i < k && n >= 2; i++) { ans += n - 1 + n - 2; n -= 2; } cout << ans; }

#include <bits/stdc++.h> using namespace std; char src[2002], tar[2002]; int ans[2002 * 4], n; int get(int l, int r, char ch) { for (int i = l; i <= r; i++) if (src[i] == ch) return i; return -1; } void reverse(int l, int r) { for (int i = l; i < r - i + l; i++) swap(src[i], src[r - i + l]...

#include <bits/stdc++.h> using namespace std; const int N = 100100; int main() { ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); int t; cin >> t; for (int hh = 1; hh <= t; hh++) { int a, b, c, r, aa, bb; cin >> aa >> bb >> c >> r; int r1, r2; r1 = c - r; r...

#include <bits/stdc++.h> using namespace std; const int mxn = 300001; int n; long long a[mxn], dp[mxn]; map<int, int> first[mxn]; void answer() { cin >> n; long long ret = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; first[i].clear(); if (first[i - 1].count(a[i])) { i...

#include <bits/stdc++.h> using namespace std; void solve() { int n; cin >> n; vector<int> a(n); int prev = -1; bool invalid = false; for (int i = 0; i < n; i++) { cin >> a[i]; invalid = (prev > a[i]) || (a[i] > i + 1); prev = a[i]; } if (invalid) { cout << -1 ...

#include <bits/stdc++.h> using namespace std; const int MAXN = (1 << 20) + 50; const int MAXLOG = 21; long long int a[MAXN]; long long int data[MAXLOG][MAXN]; long long int answer[2][MAXN]; long long int n; void build(int s = 0, int e = (1 << n), int h = 0) { if (e - s < 2) { data[h][s] = a[s]...

#include <bits/stdc++.h> using namespace std; const int N = 200005; int n, a[N], cnt[N], sum[N]; vector<int> pos[N]; set<int> S; int main() { scanf( %d , &n); for (int i = (1); i <= (n); ++i) scanf( %d , &a[i]), ++cnt[a[i]], pos[a[i]].push_back(i); int tt = 0, mx = 0; for (int i = (1);...

#include <bits/stdc++.h> using namespace std; int n, k; long long a[1 << 24], dp[1 << 24], b[2]; int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[1 << i]; cin >> k; for (int i = 0; i < k; i++) cin >> b[i]; for (int i = 1; i < (1 << n); i++) { long long s = 0; int t = i...

#include <bits/stdc++.h> using namespace std; #pragma GCC optimize( O3 ) #pragma GCC optimize( no-stack-protector ) #pragma GCC optimize( unroll-loops ) #pragma GCC optimize( fast-math ) #pragma GCC target( sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native ) mt19937 rng(time(NULL)); const int inf = 1e9 + 1...

#include <bits/stdc++.h> using namespace std; void wldd() { long long n, a, b; cin >> n >> a >> b; b = b % n; long long sum = 0; if (b < 0) { sum = n + a + b; } else { sum = a + b; } if (sum % n == 0) cout << n << n ; else cout << abs(sum % n) << n ; ...

#include <bits/stdc++.h> using namespace std; int sgn(double x) { return (x > 1e-8) - (x < -1e-8); } int count_bit(int x) { return x == 0 ? 0 : count_bit(x >> 1) + (x & 1); } template <class T> inline void to_min(T &a, const T b) { if (b < a) a = b; } template <class T> inline void to_max(T &a, cons...

#include <bits/stdc++.h> using namespace std; int n; int main() { scanf( %d , &n); printf( +------------------------+ n ); printf( | ); if (n >= 1) printf( O. ); else printf( #. ); for (int i = 2; i <= 11; i++) if ((i - 2) * 3 + 4 + 1 <= n) printf( O. ); els...

#include <bits/stdc++.h> using namespace std; template <class T> T gcd(T a, T b) { if (!b) return a; while (b ^= a ^= b ^= a %= b) ; return a; } template <class T> T max(const T& t1, const T& t2, const T& t3) { return max(max(t1, t2), t3); } template <class T> T max(const T& t1, ...

#include <bits/stdc++.h> using namespace std; int main() { int n, m, x, y; int a[1005], b[1005], c[1005], d[1005]; cin >> n >> m >> x >> y; for (int i = 1; i <= m; i++) { cin >> a[i] >> b[i] >> c[i] >> d[i]; } int dp[1005][11]; int temp, i, j, k, t; for (int i = 0; i <= n; i++)...

#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long int a, b, ans = 0; cin >> a >> b; ans = min(a, b); ans = min(ans, (a + b) / 3); cout << ans << endl; } return 0; }

#include <bits/stdc++.h> using namespace std; struct node { long long x; int c; friend bool operator<(node x, node y) { return x.x < y.x; } } a[400001]; long long leftdata[400001], rightdata[400001]; int n; long long ans; long long max1, max2, l1, r1, ttt; void work1() { long long tans; ...

#include <bits/stdc++.h> using namespace std; int n, d, h; vector<pair<int, int> > ans; int main() { ios::sync_with_stdio(0); cin >> n >> d >> h; if (2 * h < d || (d == 1 && n > 2)) { cout << -1 << n ; return 0; } for (int i = 2; i <= h + 1; i++) ans.push_back(make_pair(i - 1, ...