solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
bool used[1234567] = {0};
int a[12345];
int main() {
int n;
scanf("%d", &n);
long long res = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
if (!used[a[i]]) {
used[a[i]] = 1;
} else {
while (used[a[i]]) {
a[i]++;
res++;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int TREE = 1002000;
vector<int> xx;
vector<int> yy;
int n, m;
int x[TREE], y[TREE];
char o[TREE];
map<int, bool> ux;
map<int, bool> uy;
int tx[TREE * 5], ty[TREE * 5];
map<int, int> mx;
map<int, int> my;
int getx(int v, int l, int r, int pos) {
if (pos > r || pos < ... | 14 |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.1415926535897932384626433832795l;
template <typename T>
inline auto sqr(T x) -> decltype(x * x) {
return x * x;
}
template <typename T>
inline T abs(T x) {
return x > T() ? x : -x;
}
template <typename T1, typename T2>
inline bool umx(T1& a, T2 ... | 19 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 10000;
vector<pair<int, int>> graph[MAX_N + 1];
queue<int> q;
int n;
int mx[MAX_N + 1], my[MAX_N + 1];
int lvl[MAX_N + 1];
int finlev, cut;
bool bfs() {
bool res = false;
int now, sz, target;
finlev = n + 100;
while (!q.empty()) q.pop();
for (int... | 11 |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 100 + 7;
const long long MOD = 1e9 + 7;
long long a[MAXN], b[MAXN], c[MAXN];
long long cge[3][105][MAXN];
int main() {
int n, T, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) cge[1][0][i] = cge[2][0][i] = i;
for (int i = 1; i <= n; i... | 10 |
#include <bits/stdc++.h>
using namespace std;
int n, m, n2, i, j, x, s;
int L[151], R[151];
char A[151][151];
int main() {
scanf("%d%d", &n, &m);
n2 = -1;
for (i = 0; i < n; i++) {
scanf("%s", A[i]);
L[i] = m;
R[i] = -1;
for (j = 0; j < m; j++)
if (A[i][j] == 'W') {
L[i] = min(L[i], ... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {-1, 0, 1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int MAXN = 5e3 + 9;
const int oo = 2e9 + 9;
struct edg {
int pos, cap, rev;
};
vector<edg> gph[MAXN];
void clear() {
for (int i = 0; i < MAXN; i++) gph[i].clear();
}
void a... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long d1 = ({
long long x;
scanf("%lld", &x);
x;
});
long long d2 = ({
long long x;
scanf("%lld", &x);
x;
});
long long d3 = ({
long long x;
scanf("%lld", &x);
x;
});
long long ans = d1 + d2 + d3;
ans = mi... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
pair<int, int> getRes(const string &s, int &pnt) {
char c = s[pnt++];
if (c == '0') return pair<int, int>(0, 1);
if (c == '1') return pair<int, int>(1, 1);
if (c == '?') return pair<int, int>(2, 2);
pair<int, int> p1 = getRes(s, pnt);
c = s[pnt+... | 18 |
#include <bits/stdc++.h>
using namespace std;
int countbit(int n) { return (n == 0) ? 0 : (1 + countbit(n & (n - 1))); }
int lowbit(int n) { return (n ^ (n - 1)) & n; }
const double pi = acos(-1.0);
const double eps = 1e-11;
template <class T>
T sqr(T x) {
return x * x;
}
template <class T>
void checkmin(T &a, T b) {... | 17 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T b, T p, T m) {
T ret;
if (p == 0) return 1;
if (p & 1) {
ret = (bigmod(b, p / 2, m) % m);
return ((b % m) * ret * ret) % m;
} else {
ret = (bigmod(b, p / 2, m) % m);
return (ret * ret) % m;
}
}
int dx4[] = {1, -... | 12 |
#include <bits/stdc++.h>
using namespace std;
long long n, k, x[100010], bit[12][100010]{};
void upd(long long *bit, int i, long long v) {
while (i <= n) {
bit[i] += v;
i += i & -i;
}
}
long long query(long long *bit, int i) {
long long s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
retu... | 11 |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
string a, b;
int aux[1000007][20];
int stval[1000007];
int enval[1000007];
int dp[1 << 20];
int nw[1 << 20];
void input() {
cin >> n >> m >> k;
cin >> a >> b;
for (int i = 0; i < k; ++i) {
aux[0][i] = i;
}
for (int i = 1; i <= n; ++i) {
int x,... | 21 |
#include <bits/stdc++.h>
using namespace std;
long long m, b = 0, s = 0, c = 0, nb, ns, nc, pb, ps, pc;
bool check(long long mid) {
long long nnb = mid * b, nns = mid * s, nnc = mid * c;
long long cb = nnb - nb, cs = nns - ns, cc = nnc - nc;
if (cb < 0) cb = 0;
if (cs < 0) cs = 0;
if (cc < 0) cc = 0;
long l... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long double d, h, v, e, pi = 3.14159265358979323846, a, ans, p;
cin >> d >> h >> v >> e;
p = (pi * d * d * e) / 4.0;
a = (pi * d * d * h) / 4.0;
if (p < v) {
cout << "YES\n";
ans = a / (v - p);
cout << setprecision(20) << ans;
} else
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int m[505050];
int x[505050];
int n;
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &m[i]);
}
ans = 0;
int ansId = -1;
for (int i = 1; i <= n; i++) {
long long cur = 0;
cur += m[i];
int mx = m[i];
for ... | 7 |
#include <bits/stdc++.h>
using namespace std;
int a[1000001], b[1000001], c, d, e, n, m;
long long sum, ans, k;
string second, t, st;
char ch2[1001][1001];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) ch2[i][j] = '.';
for (int i = 1; i <= n; i++) {
if (i % 2) {
fo... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<int> c, inp;
vector<vector<int> > G, GT;
int n;
int calc(int ini) {
queue<int> q[3];
vector<int> cinp = inp;
int fets = 0, ans = 0;
for (int i = 0; i < n; ++i)
if (cinp[i] == 0) q[c[i]].push(i);
int on = ini;
while (fets < n) {
while (!q[on].empty... | 9 |
#include <bits/stdc++.h>
long long int mod = 1000000007;
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
int n, t;
cin >> n >> t;
string s1, s2;
cin >> s1;
cin >> s2;
int a = 0, b = 0;
int x = (n - t);
for (int i = 0; i < n; i++) {
if (s1[i] == s2[i]) {
a++;... | 9 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long offset = N;
long long __abs(long long x) { return x > 0 ? x : -x; }
vector<pair<long long, long long> > pos[4 * N], neg[4 * N];
map<pair<long long, long long>, long long> label;
long long get(long long x, long long dir, long long n) {
... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int mod = int(1e9) + 7, INF = 0x3fffffff, maxn = 1e5 + 12;
int ct[maxn * 2];
class cmp {
public:
bool operator()(const long long a, const long long b) { return a > b; }
};
int main(void) {
int n, k, b, c;
while (cin >> n >> k >> b >> c) {
for (int i = 0; i ... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 50000 + 10;
int find(vector<int>& v, int x) {
return lower_bound(v.begin(), v.end(), x) - v.begin() + 1;
}
vector<int> val[11];
int d[maxn][11], k;
int loseId;
vector<vector<int>> LoseM, LoseQ;
vector<int> LoseNum;
set<pair<int, int>> SetM[11], SetQ[11];
... | 19 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream& operator<<(ostream& out, vector<T>& arr) {
for (int64_t i = 0; i < (int64_t)arr.size() - 1; ++i) {
out << arr[i] << " ";
}
if (arr.size()) {
out << arr.back() << '\n';
}
return out;
}
template <typename T>
istream& operator>>... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
map<string, int> mymap;
mymap["C"] = 0;
mymap["C#"] = 1;
mymap["D"] = 2;
mymap["D#"] = 3;
mymap["E"] = 4;
mymap["F"] = 5;
mymap["F#"] = 6;
mymap["G"] = 7;
mymap["G#"] = 8;
mymap["A"] = 9;
mymap["B"] = 10;
mymap["H"] = 11;
vector<int>... | 4 |
#include <bits/stdc++.h>
using namespace std;
int n, i, j, a, b, x, y, use[40], grad[40];
vector<int> G[40];
queue<int> frunze;
pair<int, int> ans[40];
int X[] = {1, -1, 0, 0};
int Y[] = {0, 0, 1, -1};
void solve(int nod, int x, int y, int lungime, int poz) {
int k = -1;
use[nod] = 1;
ans[nod].first = x;
ans[no... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
char ans[100000 + 5], str[100000 + 5];
memset(ans, '.', sizeof(ans));
int n, i;
cin >> n;
gets(str);
while (n--) {
gets(str);
for (i = 0; str[i]; i++) {
if (ans[i] == '?') {
continue;
}
if (str[i] != '?') {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000005;
char s[MAX];
int z[MAX];
void zfun(int n) {
int l = 0, r = 0;
for (int i = 1; i < n; ++i) {
if (i <= r) z[i] = min(z[i - l], r - i + 1);
while (i + z[i] < n && s[i + z[i]] == s[z[i]]) z[i]++;
if (i + z[i] - 1 > r) l = i, r = i + z[i]... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[100];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int min = 0;
for (int i = n - 1; i >= 0; i--) {
if (k % a[i] == 0) {
min = a[i];
break;
}
}
cout << k / min;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename TF>
void debug(ostream &out, TF const &f) {
out << f << std::endl;
}
template <typename TF, typename... TR>
void debug(ostream &out, TF const &f, TR const &...rest) {
out << f << " ";
debug(out, rest...);
}
using ll = long long;
using ull = unsigned... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
long long a, b;
cin >> a >> b;
long long ans = 0, k = 1;
while (1) {
k *= 10;
if ((k - 1) <= b)
ans += a;
else
break;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
if (m >= n) {
cout << n << " ";
cout << (m - n) / 2;
} else {
cout << m << " ";
cout << (n - m) / 2;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2010;
const int MOD = 1000 * 1000 * 1000 + 7;
long long int dp[MAXN][MAXN];
long long int sum[MAXN][MAXN];
long long int sum2[MAXN][MAXN];
void M(long long int &a) { a = a % MOD; }
int main() {
for (int i = 2; i < MAXN; i++) dp[0][i] = 1;
for (int h = 0... | 16 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int N = 300300;
long long a[N], b[N];
void solve() {
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
int p = i - 1;
if (p < 0) p += n;
if (a[i] > ... | 8 |
#include <bits/stdc++.h>
using namespace std;
char ch[101][101];
int main() {
int i, j, n, ans = 0;
cin >> n;
for (i = 0; i < n; i++) cin >> ch[i];
for (i = 0; i < n; i++) {
int cnt = 0, cnt2 = 0;
for (j = 0; j < n; j++) {
if (ch[i][j] == 'C') cnt++;
if (ch[j][i] == 'C') cnt2++;
}
an... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 9;
int n;
double a[MAX], sum[MAX];
double cal(double X) {
double hsgs = 0, Mn = 0, Mx = 0;
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + a[i] - X;
hsgs = max(max(fabs(sum[i] - Mn), fabs(sum[i] - Mx)), hsgs);
Mn = min(Mn, sum[i]),... | 12 |
#include <bits/stdc++.h>
const int MOD = 1000000007;
int dp[101][2601];
char str[101];
int main() {
int i, j, k;
for (i = 0; i < 26; i++) dp[1][i] = 1;
for (i = 1; i < 100; i++) {
for (j = 0; j < 2501; j++) {
int v = dp[i][j];
if (!v) continue;
for (k = 0; k < 26; k++) {
dp[i + 1][j ... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int rep = (n - 7) / 4;
int sub = (n - 7) % 4;
string s = "ROYGBIV";
string s2 = "GBIV";
for (int i = 0; i < rep; i++) {
s += s2;
}
s += s2.substr(0, sub);
cout << s;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int n;
int main() {
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int cur = 0, best = 0;
for (int i = 0; i < n; i++) {
cur += a[i];
if (cur < 0) cur = 0;
if (cur > best) best = cur;
}
cout... | 10 |
#include <bits/stdc++.h>
using namespace std;
const double PI = atan(1.0) * 4;
const long long int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if (a == d || b == e || c == f)
cout << "YES" << endl;
el... | 3 |
#include <bits/stdc++.h>
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
int read() {
char ch = getchar();
int x = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9... | 12 |
#include <bits/stdc++.h>
using namespace std;
int n, d, vx[20], vy[20];
int memo1[401][401][2][2], memo2[401][401][2][2];
bool solve1(int, int, bool, bool);
bool solve2(int, int, bool, bool);
bool solve1(int x, int y, bool flip1, bool flip2) {
if (x * x + y * y > d * d) return true;
int &res = memo1[x + 200][y + 20... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const long long maxn = 1e6 + 10;
int a[4], b[10] = {0, 1, 2, 0, 2, 1, 0}, c[4];
int check(int w) {
int sum = 0;
for (int i = 0; i < 3; i++) c[i] = a[i];
for (int i = w; i < 7; i++) {
if (c[b[i]] == 0) break;
--c[b[i]], ++sum;
}
int... | 6 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define cy cout<<"YES"<<endl
#define cn cout<<"NO"<<endl
#define ms(a,b) memset(a, b, sizeof a);
#define scd(n) scanf("%d",&n)
#define scld(n) scanf("%lld",&n)
#define lp(i,a,b) for(i=a; i<b; i++)
const int INF = 0x3f3f3f3f;
#define MOD 1000000009
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > V;
vector<int> R1, R2, R3;
int main() {
int n, i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
V.push_back(make_pair(a, i));
}
sort(V.begin(), V.end());
for (i = 0; i < n; i++) R1.push_back(V[i].second);... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, a[26][10001];
string s, t;
cin >> s >> t;
for (i = 0; i < 26; i++)
for (j = 0; j <= s.size(); j++) a[i][j] = -1;
for (j = s.size() - 1; j > -1; j--) {
for (i = 0; i < 26; i++) {
if (s[j] - 'a' == i)
a[i][j] = j;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
while (n--) {
long long a, b, sub;
cin >> a >> b;
if (b > a) {
std::swap(a, b);
}
sub = a - b;
if (sub > 1) {
cout << "YES"
<< "\n";
} else {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long w[1005];
signed main() {
long long t;
scanf("%lld", &t);
while (t--) {
long long n;
scanf("%lld", &n);
long long sum = 0;
for (long long i = 1; i <= n; i++) {
scanf("%lld", &w[i]);
sum += w[i];
... | 0 |
#include <bits/stdc++.h>
int diru[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dirv[] = {-1, 0, 1, -1, 1, -1, 0, 1};
using namespace std;
template <class T>
T sq(T n) {
return n * n;
}
template <class T>
T gcd(T a, T b) {
return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
return (a / gcd<T>(a,... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int ioo = 1000000000;
long long loo = 1000000000000000000;
void add_self(int &x, int y) {
if ((x += y) >= mod) x -= mod;
}
int add(int x, int y) { return add_self(x, y), x; }
void sub_self(int &x, int y) {
if ((x -= y) < 0) x += mod;
}
int su... | 10 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int T;
cin >> T;
vector<pair<int, int>> edges;
vector<int> matching;
vector<bool> used;
while (T--) {
int n, m;
scanf("%d %d", &n, &m);
matching.clear();
edges.clear();
edges.... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
if (n == 1) {
cout << -1 << "\n";
} else {
cout << 2;
for (int i = 1; i < n; i++) {
cout << 3;
}
}
cout << "\n";
}
return 0;
}
| 2 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("mmx,avx,fma")
#pragma GCC optimize("unroll-loops")
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; ... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long a[100009];
signed main() {
long long i, n, k = -1, j, ct = 0;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
for (j = 30; j >= 0; j--) {
ct = 0;
for (i = 0; i < n; i++) {
if ((a[i] >> j) & 1) {
ct++;
k = i;
}
}
i... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
long long a[maxn];
int main() {
long long ans = 0;
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n / 2; i++)
ans += (a[i] + a[n - i - 1]) * (a[i] + a[n - i - 1]);
cout << ans << end... | 1 |
#include <bits/stdc++.h>
using namespace std;
int t[20][20][20], ans[20][20];
struct msp {
int num, dep;
};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string s;
cin >> s;
memset(t, -1, sizeof(t));
for (int i = 0; i <= 9; i += 1)
for (int j = 0; j <= 9; j += 1) {
deque<msp> b... | 9 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
string s;
cin >> n >> m >> s;
vector<vector<int> > cnt(m, vector<int>(m, 0));
for (int i = 1; i < n; i++) {
cnt[s[i] - 'a'][s[i - 1] - 'a']++;
cnt[s[i - 1] - 'a'... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
struct SegTree {
vector<int> tree;
int base;
SegTree(int a) {
base = 1;
while (base < a) base <<= 1;
tree.resize(base * 2 + 2, INF);
base--;
}
void update(int idx, int val) {
idx += base;
tree[idx] = val;
idx >>= 1;... | 16 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<doub... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long int rj = 0;
int n, tr = 0, kolko = 0;
vector<pair<int, int> > raz;
set<pair<int, int> > najm;
vector<int> nes;
int main() {
int x;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
nes.push_back(x);
raz.push_back(make_pair(i - x, i)... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for (int el = 0; el < n; ++el) {
int v;
cin >> v;
ans = max(ans, v);
}
cout << max(25, ans) - 25 << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<string> name(n + 1);
vector<short> type(n + 1);
int e = 0;
for (int i = 0; i < n; i++) {
cin >> name[i] >> type[i];
if (type[i] == 1) e++;
}
set<string> example... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
string now = "Aa";
vector<string> ans;
for (int i = 0; i < k - 1; i++) {
ans.push_back(now);
if (now.back() == 'z') {
now += "a";
} else {
now.back()++;
}
}
for (int i = 0; i < n - k + 1; i++) {... | 7 |
#include <bits/stdc++.h>
long long getSquareDistance(std::vector<long long> &first,
std::vector<long long> &second) {
long long squareDistance = 0l;
for (int i = 0; i < first.size(); ++i) {
squareDistance += (first[i] - second[i]) * (first[i] - second[i]);
}
return squareDistance... | 12 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T>
void chmin(T& a, const T& b) noexcept {
if (b < a) a = b;
}
template <class T>
void chmax(T& a, const T& b) noexcept {
if (a < b) a = b;
}
template <class T>
void drop(const T& x) {
std::cout << x << endl;
exit(0);
}
void deb... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int test, n, i;
cin >> test;
while (test--) {
cin >> n;
long long int arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
if (arr[0] + arr[1] > arr[n - 1])
cout << -1 << endl;
else
cout << 1 << " " <<... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
vector<int> G[N];
int fa[N][17], tin[N], tout[N], dep[N], dfs_tag = 0;
void dfs(int u, int father) {
fa[u][0] = father;
for (int i = 1; i < 17; ++i) {
fa[u][i] = fa[fa[u][i - 1]][i - 1];
}
tin[u] = ++dfs_tag;
for (auto v : G[u]) {
if ... | 20 |
#include <bits/stdc++.h>
using namespace std;
long long const INF = 2e18 + 100;
int const MAX = 3 * 1e5 + 10;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t, n, i, x;
cin >> t;
while (t--) {
cin >> n;
int arr[n + 1];
map<int, int> mp;
x = n;
for (i = 1; i <= n; i++)... | 4 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INF = 1e9;
const int N = 2e5 + 5;
const ll MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string a, b;
cin >> a >> b;
vector<int> cum;
int n = a.size(), m = b.size();
int sum = 0, i;
for (i = 0; i <= m - n; i... | 7 |
#include <bits/stdc++.h>
using namespace std;
struct EDGE {
int to, next, w;
} e[200010];
int head[100010], top;
const long long mod = 1000000007;
void add(int u, int v, int w) {
e[top].to = v;
e[top].next = head[u];
e[top].w = w;
head[u] = top++;
}
int fa[100010];
struct _ {
long long cfa, c;
_ operator+... | 16 |
#include <bits/stdc++.h>
using namespace std;
int n, i, b, c, x;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> x;
if (x < 0) {
c += x;
} else {
b += x;
}
}
cout << b - c;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const char NAMES[8][9] = {"vaporeon", "jolteon", "flareon", "espeon",
"umbreon", "leafeon", "glaceon", "sylveon"};
int i;
char str[9];
inline bool eq(const char* a, const char* b) {
int i;
for (i = 0; a[i] != '\0' && b[i] != '\0'; i++)
if ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int j, i, p = 0, t, m, q = 0, d[1000], k, n, l = 0, r, sum = 0, b,
y, x1, x2, x3, x4;
vector<long> v(4);
vector<pair<int, int> > v1;
pair<int, int> p1[100];
string s;
stack<int> s1, s2;
cin >> n;
cin >> s;
for (... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, i;
string a;
cin >> a;
l = a.size();
int kx = 0, ky = 0;
for (i = 0; i < l; i++) {
if (a[i] == 'x') {
kx++;
}
if (a[i] == 'y') {
ky++;
}
}
if (kx > ky) {
for (i = 1; i <= kx - ky; i++) {
cout << 'x';
... | 4 |
#include <bits/stdc++.h>
using namespace std;
std::mt19937 rng(
(int)std::chrono::steady_clock::now().time_since_epoch().count());
inline long long mod(long long n, long long m) {
long long ret = n % m;
if (ret < 0) ret += m;
return ret;
}
long long gcd(long long a, long long b) {
return (b == 0LL ? a : gcd... | 16 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
return x * x;
}
int n, num[100000 + 10], last = -1, sum = 0;
bool zero = false, boleh[100000 + 10];
int main() {
memset(boleh, true, sizeof boleh);
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", num + i);
for (int i = 0; i... | 8 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
int main() {
int n;
scanf("%d", &n);
long long G = 0;
for (int i = 1; i <= n; i++) {
long long x;
scanf("%I64d", &x);
if (G == 0)
G = x;
else
G = gcd(G, x);
... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
int x;
scanf("%d", &x);
if (x == 3)
printf("5\n");
else {
if (x % 2 == 1) x--;
int ans = 1;
while (1) {
int g = (ans * ans - 1) / 2;
if (g < x)
ans += 2;
else
break;
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200100;
struct tree {
int l, r;
long long c1, c2, tag;
} d[maxn << 2];
struct edge {
int to, nex, dis;
} e[maxn << 1];
int n, Q, cnt, cc;
int st[maxn], en[maxn], fa[maxn], dep[maxn], mindis[maxn], dis[maxn], a[maxn],
son[maxn], sz[maxn], head[maxn... | 13 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void out(T A[], int n) {
for (int i = 0; i < n; i++) cout << A[i] << " ";
cout << endl;
}
template <class T>
void out(vector<T> A, int n = -1) {
if (n == -1) n = A.size();
for (int i = 0; i < n; i++) cout << A[i] << " ";
cout << endl;
}
const in... | 13 |
#include <bits/stdc++.h>
using namespace std;
int prime[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
int n;
int a[111];
int f[111][1 << 16], g[111][1 << 16], S[111][1 << 16];
int p[61][1 << 16];
int pd(int x, int s) {
int ret = 0;
for (int i = 0; i < 16; i++) {
while (x % prime[i] == 0) {... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 99999999;
const double EPS = 1e-9;
int n, prev, now;
vector<int> ary;
int main() {
cin >> n;
ary.resize(n);
for (int i = 0; i < (n); ++i) cin >> ary[i];
sort((ary).begin(), (ary).end());
if (ary[ary.size() - 1] != 1)
ary[ary.size() - 1] = 1;
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n, k, flag = 0, x, i, j;
string st;
cin >> n >> k >> st;
for (i = 0; i < n; i++) {
if (st[i] == 'G') {
break;
}
}
for (j = i + k; j < n; j = j + k) {
if (st[j] == '#') {
break;
}
if (st[j] == 'T') {
cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> num, position;
long long p;
int check(long long x) {
int index = 0;
for (int i = 0; i < num.size(); i++) {
if (abs(num[i] - p) > x) return 0;
int flag = 0;
for (int j = index; j < position.size(); j++) {
if (abs(num[i] - position[j]) ... | 10 |
#include <bits/stdc++.h>
int intcmp(const void *f, const void *s) { return (*(int *)f - *(int *)s); }
int gcd(int a, int b) { return ((b == 0) ? a : gcd(b, a % b)); }
int preprocess() { return 0; }
int main() {
int cases;
int i, j, n;
int a, m;
preprocess();
scanf("%d", &n);
scanf("%d", &m);
int ones = 0,... | 0 |
#include <bits/stdc++.h>
using namespace std;
int p[6], n, k, ans, total;
void att(int z) {
if (z == k) {
total++;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++) ans += p[i] > p[j];
return;
}
for (int i = 0; i < n; i++)
for (int j = i; j < n; j++) {
reverse(p + i, p + j + ... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
cin >> t;
while (t--) {
cin >> n;
cout << (n < 2 ? 0 : n - 2) << endl;
}
return 0;
}
| 8 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define prec(n) fixed<<setprecision(n)
#define optimize ios::sync_with_stdio(0); cin.tie(0);
#define PI acos(-1.0)
#define RESET(a, b) memset(a, b, sizeof(a))
#define pb push_back
#define pii ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5 + 10;
vector<bool> seive(mxN + 10, true);
void pre() {
seive[0] = seive[1] = false;
for (int i = 2; i * i <= mxN; i++) {
if (seive[i]) {
for (int j = i * i; j <= mxN; j += i) {
seive[j] = false;
}
}
}
return;
}
void so... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc;
cin >> tc;
for (int i = 0; i < tc; i++) {
int n;
cin >> n;
string str;
cin >> str;
int flag = 1;
for (int i = 0; i < n; i++) {
if (str[i] == '0') {
flag = 0... | 7 |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> st[5 * 100005];
long long arr[100005];
void build(long long p, long long l, long long r) {
if (l == r) {
st[p] = {arr[l], arr[l]};
return;
}
long long mid = (l + r) / 2;
build(2 * p, l, mid);
build(2 * p + 1, mid + 1, r);
st[p]... | 11 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int main() {
cin >> s;
cin >> t;
s[s.size() - 1]++;
reverse(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
if (s[i] > 'z') {
s[i] -= 26;
if (i + 1 < s.size())
s[i + 1]++;
else
s += 'a';
}
}
reve... | 8 |
#include <bits/stdc++.h>
using namespace std;
const long long sz = 1e5 + 10, mod = 1e9 + 7;
long long fact[sz], inv[sz], ara[sz];
long long fastPow(long long x, long long n, long long MOD) {
long long ret = 1;
while (n) {
if (n & 1) ret = (ret * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return ret % M... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
vector<int> vec;
vector<int> adj[5005];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
vec.push_back(x);
adj[i + 1].push_back(x);
}
for (int i = 0; i < n; i++) {
if (adj[adj[vec[i]][0]][0] == i + 1) {
cout << "YE... | 0 |
#include <bits/stdc++.h>
using namespace std;
char s[6000065];
int n, root, r, c, a[6000065], dp[1000005][21], pw[22], st[1000055], l;
int main() {
pw[0] = 1;
for (int i = 1; i <= 20; i++) pw[i] = pw[i - 1] * 2;
scanf("%d%d%d", &n, &r, &c);
for (int i = 1; i <= n; i++) {
scanf("%s", s + root);
st[i] = r... | 13 |
#include <bits/stdc++.h>
const long long mod = (long long)1e9 + 7;
using namespace std;
long long calc(long long i1, long long i2, const vector<string> &vc) {
long long c = (vc[i1][i2] - '0') + (vc[i1 + 1][i2] - '0') +
(vc[i1][i2 + 1] - '0') + (vc[i1 + 1][i2 + 1] - '0');
return c;
}
vector<long long... | 7 |
#include <bits/stdc++.h>
const int Max = 1e5 + 10;
using namespace std;
struct edge {
int to;
int next;
};
struct heap {
priority_queue<int, vector<int>, greater<int> > add, del;
int getMin() {
while (!add.empty() && !del.empty() && add.top() == del.top()) {
add.pop();
del.pop();
}
retur... | 24 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
vector<int> a(n), pre(n), mxpsuf(n, 0);
int mx = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
(i - 1) > -1 ? pre[i] = pre[i - 1] + a[i] : pre[i] = a[i];
mx = max(mx, pre[i]);
}
if (mx > d) {
cout << -1 << ... | 11 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
struct point {
ll x, y;
};
struct segment {
point p1, p2;
};
int sign(ll x) { return x < 0 ? -1 : 1; }
bool intersect(const segment& s1, const segment& s2, pair<ll, ll>* p) {
... | 16 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int mod = 998244353;
const int inf = 1 << 30;
const int maxn = 300000 + 5;
int n, a[maxn];
int main() {
int T;
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%... | 6 |
#include <bits/stdc++.h>
using namespace std;
map<string, int> mp;
map<string, string> res;
int N;
void scan() {
string a;
int pts;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> a >> pts;
mp[a] = max(mp[a], pts);
}
}
void solve() {
N = mp.size();
for (map<string, int>::iterator it = mp.begin(); i... | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.