solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> operator+(const pair<int, int> &a, const pair<int, int> &b) {
return make_pair(a.first + b.first, a.second + b.second);
}
pair<int, int> operator-(const pair<int, int> &a, const pair<int, int> &b) {
return make_pair(a.first - b.first, a.second - b.second)... | 21 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
double p = pow(abs(c - a), 2) + pow(abs(d - b), 2);
p = sqrt(p);
int q = ceil(p / (2 * n));
cout << q;
}
| 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e6 + 10;
long long int dp[MAXN], last[1000];
int main() {
long long int n, k;
cin >> n >> k;
string s;
cin >> s;
long long int l = s.length();
dp[0] = 1;
long long int ma, ind = 0, mini;
for (long long int i = 1; i < l + 1 + n; ++i) {
d... | 14 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N >> M;
int _f = N / 2, _g = M / 2;
for (int x = 1; x <= _f; x++) {
int tmp = N - x + 1;
for (int i = 0; i < M; i++) {
cout << x << ' ' << i + 1 << '\n';
cou... | 10 |
#include <bits/stdc++.h>
int n, t, atm = 0;
std::vector<int> ans;
int ask(int l, int r) {
std::cout << "? " << l << " " << r << std::endl;
int x;
std::cin >> x;
return x;
}
bool same(const std::vector<int>& a) {
bool r = true;
for (int x : a) r &= x == a[0];
return r;
}
int distinct(const std::vector<int>... | 18 |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
long long v1, v2, t, d;
int dp[2002][2002];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> v1 >> v2;
cin >> t >> d;
dp[1][v1] = v1;
for (int i = 1; i < t; ++i)
for (int j = 0; j <= 2000; ++j)... | 6 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
int toint(T t) {
stringstream ss;
ss << t;
int r;
ss >> r;
return r;
}
int main() {
int a;
string b;
cin >> a >> b;
reverse(b.begin(), b.end());
cout << (toint(b) + a) << endl;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 2) {
cout << 2;
} else {
cout << 1;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
int dx[] = {0, 1, -1, 0, 1, -1, 1, -1, -2, 2, 0, 0},
dy[] = {1, 0, 0, -1, -1, 1, 1, -1, 0, 0, -2, 2};
using namespace std;
long long N[200005], D[200005];
const int M = 1e9 + 7;
long long dp[3000];
long long POWER(int b, int e) {
if (e == 0) return 1;
if (e & 1)
return (POWER(b, e -... | 14 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rd(chrono ::system_clock ::now().time_since_epoch().count());
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, m, k, q;
cin >> n >> m >> k >> q;
int i, r, c;
vector<int> gift[n];
... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, h = 0, sol = 0;
scanf("%I64d", &n);
while (++h) {
long long int r = 3 * h * (h + 1) / 2 - h;
if (r > n) break;
if ((n - r) % 3 == 0) sol++;
}
printf("%I64d\n", sol);
return 0;
}
| 9 |
#include <bits/stdc++.h>
using namespace std;
long long int n, k, a[100014];
vector<long long int> res;
long long int get_diff(int i, long long int x) {
return -3 * x * x + 3 * x + a[i] - 1;
}
long long int eval(long long int minval, bool compres = false) {
long long int totk = 0;
for (int i = (0); i < (n); i++) ... | 19 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
struct RBNode {
enum Color { RED, BLACK };
RBNode *right = nullptr, *left = nullptr, *parent = nullptr;
T value;
int size = 0;
int color = RED;
inline bool isBlack() const { return color == BLACK; }
inline bool isRed() const { return colo... | 12 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<pair<int, int> > > D;
vector<bool> used;
int last;
int dfs(int v, int sum) {
used[v] = 1;
last = v;
if (D[v].size() == 0) {
return sum;
}
int to = D[v][0].first;
if (used[to] == 1) {
return -228;
}
int len = D[v][0].second;
return dfs... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
set<char> vowels;
vowels.insert('a');
vowels.insert('e');
vowels.insert('i');
vowels.insert('o');
vowels.insert('u');
bool aaaa = true;
bool aabb = false;
bool abba = false;
bool abab = false;
bool foundaaaa = ... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, a[maxn], lst[maxn], maxL, ans;
inline int read() {
int ret = 0;
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
while (ch >= '0' && ch <= '9') ret = ret * 10 + ch - 48, ch = getchar();
return ret;
}
int main() {
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 10000017;
int n, i, j, b, a[N], l, r, m, rez[N];
bool navp[N];
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (i = 0; i < n; ++i) {
cin >> b;
++a[b];
}
i = 2;
while (i < N) {
j = i * 2;
rez[i] = a[i];
while (j < N) {
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int N = 800005;
int n, a[N], pos[N], c[N], num[N];
long long sum[N];
void update(int x) {
for (; x <= n; x += (x & (-x))) c[x]++;
}
int Query(int x) {
int ans = 0;
for (; x; x -= (x & (-x))) ans += c[x];
return ans;
}
void modify(int cur, int l, int r, int pos... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s1, s2;
vector<pair<string, string>> lst;
for (int i = 0; i < n; i++) {
cin >> s1 >> s2;
bool got = false;
for (vector<pair<string, string>>::iterator it = lst.begin();
it != lst.end(); it++) {
if (it... | 3 |
#include <bits/stdc++.h>
using namespace std;
void solve(string s, string t) {
int n = s.length();
unordered_map<char, int> mp;
for (int i = 0; i < n; i++) {
mp[s[i]]++;
}
for (int i = 0; i < n; i++) {
mp[t[i]]++;
}
for (auto i : mp) {
if (i.second % 2 == 1) {
cout << "NO"
<< ... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int vowels = 0, odd = 0;
cin >> str;
for (int i = 0; i < str.size(); i++) {
if (str[i] == 'a' || str[i] == 'e' || str[i] == 'i' || str[i] == 'o' ||
str[i] == 'u')
vowels++;
else if ((str[i] - '0' >= 0 && str[i] - '0' <=... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long const DIM = 104;
long long i, c;
char a;
int main() {
while (cin >> a) {
if (a == 'H' || a == 'Q' || a == '9') c = 1;
}
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#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")
using namespace std;
int a, b, c, d, e, f, p = 1000000007, base = 157, mi = 1e9, i... | 20 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
struct num {
vector<long long> z;
num() { z = vector<long long>(5); }
num operator+(const num &b) const {
num c;
for (int i = 0; i < 5; ++i) {
c.z[i] = z[i] + b.z[i];
}
return c;
}
num operator-(const num &b) const {
... | 26 |
#include <bits/stdc++.h>
using namespace std;
int xd[] = {0, 1, 0, -1};
int yd[] = {1, 0, -1, 0};
int xx[] = {0, 1, 0, -1, 1, -1, 1, -1};
int yy[] = {1, 0, -1, 0, 1, 1, -1, -1};
int kx[] = {-2, -1, -2, -1, 1, 2, 2, 1};
int ky[] = {1, 2, -1, -2, -2, -1, 1, 2};
bool islucky(int x) {
int four = 0, seven = 0;
while (x)... | 4 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void smin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
inline void smax(T &a, T b) {
if (a < b) a = b;
}
const int maxn = 100 * 1000 + 100;
const int RANGE = 3 * 100 * 1000 + 100;
int n;
pair<pair<int, int>, pair<int, int> > LVR[maxn], V... | 16 |
#include <bits/stdc++.h>
using namespace std;
inline int getint() {
char c;
while ((c = getchar()) < '0' || c > '9')
;
return c - '0';
}
int a[200005], n, c[200005], flip;
pair<int, int> b[200005];
int fun(int pos, int len, int dir) {
int tl, t1, temp, temp2;
if (len == 0) {
return b[pos].second;
}
... | 17 |
#include <bits/stdc++.h>
using namespace std;
long long int n, m, sum, k, a, b, dp[1000005], pref[1000005];
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
cin >> n >> a >> b >> k;
for (int j = 0; j <= k; j++) {
for (int i = 1; i <= n; i++) {
if (j == 0) {
dp[a] = 1;
... | 11 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using dd = double;
using ldd = long double;
using si = short int;
using usi = unsigned short int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
struct me {
pair<int, int> x;
ll y;
me *l, *r;
int c... | 14 |
#include <bits/stdc++.h>
#define code \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define endl '\n'
#define MM(a, b) memset(a, b, sizeof(a))
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll MOD = ... | 14 |
#include <bits/stdc++.h>
int n, m, s;
long long t;
std::map<std::pair<int, long long>, int> map;
int walk(int s) {
int &r = map[{s, 1}] = s;
for (int i = n - 1; i; --i)
if (r < m)
r = (r + i) % n;
else
r = (r + n - i) % n;
return r;
}
int run(int s, long long times) {
if (map.count({s, times... | 21 |
#include <bits/stdc++.h>
using namespace std;
using namespace std;
namespace pcf {
long long dp[100][100010];
unsigned int ar[(10000010 >> 6) + 5] = {0};
int len = 0, primes[666666], counter[10000010];
void Sieve() {
(((ar[(0) >> 6]) |= (1 << (((0) >> 1) & 31)))),
(((ar[(1) >> 6]) |= (1 << (((1) >> 1) & 31))));... | 16 |
#include <bits/stdc++.h>
using namespace std;
typedef struct node {
int nxt[2];
int cnt;
} ND;
int n, m, tot;
const int p = 1000000000;
long long fact[20];
long long qpow(long long a, long long b, long long modp) {
long long ans;
for (ans = 1; b; b >>= 1, a = a * a % modp)
if (b & 1) ans = ans * a % modp;
... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000 + 10, INF = INT_MAX, MOD = 1e9 + 7;
long long a[MAXN];
int main() {
ios::sync_with_stdio(false);
long long n, m;
cin >> n >> m;
for (int i = 0, t; i < m; i++) cin >> t >> a[i];
sort(a, a + m, greater<int>());
long long ans = 0;
for ... | 12 |
#include <bits/stdc++.h>
const int N = 111111;
const long long mod = 1000000007;
struct Point {
int w, sccno;
} p[N];
struct Edge {
int u, v, next;
} e[3 * N], d[3 * N];
int tot, tod, eh[N], ed[N];
void add1(int u, int v) {
e[tot].u = u, e[tot].v = v, e[tot].next = eh[u], eh[u] = tot++;
}
void add2(int u, int v) ... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int nNums, r;
cin >> nNums;
vector<int> nums(nNums), accMin(nNums);
for (int i = 0; i < nNums; i++) {
cin >> nums[i];
}
for (int i = nNums - 1; i >= 0; i--) {
if (i == nNums - 1)
accMin[i] = num... | 7 |
#include <bits/stdc++.h>
using namespace std;
string s;
int n, a[100005], b[100005];
bool f;
void cty(int o) {
int q = 0;
for (int i = 1; i <= n; i++) q = q * 10 + a[i];
int c[10];
for (int i = 1; i <= o; i++) c[i] = 9;
while (c[1]) {
int r = 0, r2 = 0;
for (int i = 1; i <= o; i++) r = r * 10 + c[i];
... | 16 |
#include <bits/stdc++.h>
using namespace std;
int k[1000000], wei[400], q[400], f[1000000];
int cmp(int a, int b) { return a > b; }
int main() {
int n;
int b, g = 0;
scanf("%d", &n);
scanf("%d", &q[0]);
b = q[0];
while (b > 0) {
if (b > 9) {
k[g++] = 9;
b -= 9;
} else {
k[g++] = b;... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
int w, h, n;
int xx1, xx2, yy1, yy2;
int cnt;
bool e[110][110][4];
bool vis[110][110];
vector<int> ans;
void dfs(int x, int y) {
if (x < 0 || x >= w || y < 0 || y >= h || vis[x][y]) return;
vis[x][y] = true... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int no, no1;
int n;
bool in = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s >> no >> no1;
if (no >= 2400 && no1 > no) in = 1;
}
if (in)
cout << "YES";
else
cout << "NO";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
int temp = 0;
int i;
for (i = 0; i < n; i++) {
if (arr[i] == arr[0])
temp++;
else
break;
}
int ans = 0;
for (int j = i; j < n;) {
int cnt ... | 1 |
#include <bits/stdc++.h>
int n = 0, m = 0;
long long d = 0, lcm = 0;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void exgcd(int a, int b, long long &x, long long &y) {
if (b) {
exgcd(b, a % b, y, x);
y -= x * (a / b);
} else {
x = 1;
y = 0;
}
}
long long calc(int x, int y) {
if ((y -... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[11][11];
for (int i = 1; i <= n; ++i) {
a[i][1] = 1;
a[1][i] = 1;
}
for (int i = 2; i <= n; ++i) {
for (int j = 2; j <= n; ++j) a[i][j] = a[i - 1][j] + a[i][j - 1];
}
cout << a[n][n];
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, K;
cin >> n >> K;
vector<string> v(n);
unordered_map<string, int> ind;
for (int i = 0; i < n; i++) {
cin >> v[i];
ind[v[i]] = i;
}
long long ans = 0;
for (int i = 0; i < n; i++) {
f... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
double x, y, minx = 999999999;
int diff = a - b;
int sum = a + b;
if (diff < 0) {
cout << -1 << endl;
return 0;
} else {
printf("%.12f\n", (a + b) / (2. * ((a + b) / (2 * b))));
}
return 0;
}
| 9 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
/*-----for personal-----*/
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define repn(i,n) rep(i,0,n)
/*-----for lib-----*/
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#def... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, n;
cin >> q;
while (q--) {
cin >> n;
int count = 0;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
for (int i = 0; i < n - 1; i++)
if (v[i + 1] - v[i] == 1) {
count++;
... | 0 |
#include <bits/stdc++.h>
inline int rd() {
int x = 0, p = 1;
char a = getchar();
while ((a < 48 || a > 57) && a != '-') a = getchar();
if (a == '-') p = -p, a = getchar();
while (a > 47 && a < 58) x = (x << 1) + (x << 3) + (a & 15), a = getchar();
return x * p;
}
const int N = 200002;
const int mod = 1e9 + ... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long longinf = 1LL << 60;
const long long mod = 1e9 + 7;
const long long mod2 = 998244353;
const long double eps = 1e-10;
template <typename T1, typename T2>
inline void chmin(T1 &a, T2 b) {
if (a > b) a = b;
}
template <typename T1, ty... | 7 |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-8;
const long long INF = 0x3f3f3f3f;
const long long MAXN = 1e3 + 10;
const long long mod = 1e9 + 7;
long long a[205];
void solve() {
long long n;
cin >> n;
for (long long i = (1); i <= (n); ++i) cin >> a[i];
long ... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, q, a[100101], b[100100], i, j, l, r, v;
long long sa, sb[100100], minb, maxb;
long long cauta() {
long long* p = lower_bound(sb + 1, sb + m - n + 2, sa);
long long poz = p - sb;
if (poz == 1)
return sb[1] - sa;
else if (poz == m - n + 2)
retu... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
if (k > n) {
cout << "-1";
return 0;
}
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
cout << a[n - k] << " " << a[n - k] << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int a[20], n, s, x, y, i, j, d3[4] = {2, 4, 6}, d4[5] = {3, 6, 9, 12};
int t[5][5], ch = 100;
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 0; i < n * n; i++) cin >> a[i];
sort(a, a + n);
bool f;
while (next_permutation(a, a + n * n) || ch) {... | 7 |
#include <bits/stdc++.h>
double x[3], y[3], r[3], s[3];
inline double sq(double x) { return x * x; }
inline double sc(double rx, double ry) {
int i;
for (i = 0; i < 3; i++) s[i] = sqrt(sq(rx - x[i]) + sq(ry - y[i])) / r[i];
double r = 0;
for (i = 0; i < 3; i++) r += sq(s[i] - s[(i + 1) % 3]);
return r;
}
int ... | 18 |
#include <bits/stdc++.h>
using namespace std;
int arr[100];
int rra[100];
int main() {
int a, b, c, d = 0;
cin >> a >> b;
for (int i = 0; i < b; i++) cin >> arr[i];
for (int i = 0; i < b; i++) {
c = arr[i];
d = 0;
while (c <= a) {
if (rra[d] == 0) rra[d] = arr[i];
c++;
d++;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 55;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long getRand(long long l, long long r) {
uniform_int_distribution<long long> uid(l, r);
return uid(rng);
}
long long n, k;
long long a[N];
int32_t main() {
ios::sync_with... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int mod = 1000000007;
int n;
int ans[N], cnt[N];
vector<int> a[N], b[N];
set<int> s[N];
set<int> flag;
bool gao(int st) {
flag.clear();
int now = st;
for (int i = 0; i < n - 1; i++) {
s[i].clear();
for (int j = 0; j < a[i].size(); j... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int M = (1e5 + 5) * 3;
int main() {
string first, sec;
cin >> first >> sec;
if (first != sec)
cout << "1";
else
cout << first;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0, m = 0;
cin >> n >> m;
n++;
vector<int> buf(n, 0);
while (cin >> m) {
for (int i = m; i < n; i++) {
if (buf[i] == 0) {
buf[i] = m;
} else {
break;
}
}
}
for (int i = 1; i < n; i++) {
cout << ... | 1 |
#include <bits/stdc++.h>
char c;
int neg;
int inp() {
c = getchar();
neg = 1;
while (c < '0' || c > '9') {
if (c == '-') neg = -1;
c = getchar();
}
int sum = 0;
while (c >= '0' && c <= '9') {
sum = sum * 10 + c - '0';
c = getchar();
}
return neg * sum;
}
int ch[7000010][2], cc[40];
int c... | 16 |
#include <bits/stdc++.h>
using namespace std;
struct data {
int x;
data(int _x) { x = _x; }
bool operator<(const data& cc) const { return x > cc.x; }
};
priority_queue<data> H1;
int a[100010], cnt, k;
long long b, now;
bool go(int x) {
now += x;
bool res = (now > b);
cnt++;
H1.push(data(x));
if (cnt >= ... | 9 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
cout << x << endl;
exit(0);
}
using ll = long long;
const int maxn = 1e6 + 5;
int n;
int a[maxn];
vector<int> basis, vec;
void add(int x) {
int save = x;
for (int b : basis) {
x = min(x, x ^ b);
}
if (x > 0) {
basis.... | 16 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string a, b;
cin >> a;
cin >> b;
vector<int> ans;
for (int i = 0; i < n; ++i)
if (a[i] != b[i]) {
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << n / 2 << endl;
for (int i = 1; i < n / 2; i++) {
cout << "2 ";
}
if (n % 2 == 0) {
cout << "2";
} else {
cout << "3";
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
stack<char> st;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
string s;
cin >> s;
while (!st.empty()) {
st.pop();
}
int ans = m / 2, len = s.size();
for (int i = 0; i < len; i++) {
if (s[i] =... | 2 |
#include <bits/stdc++.h>
using namespace std;
int p[1000], sum[1000], good[1000], n, k, m, x, y;
int find(int x) {
if (p[x] == x)
return x;
else
return p[x] = find(p[x]);
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) p[i] = i;
for (int i = 1; i <= k; i++) {
cin >> x >> y;
p[find(y... | 7 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int x1, y1, x2, y2;
map<pair<long long int, long long int>, int> m;
int test = 0;
int hor = 0;
int ver = 0;
for (int i = 0; i < 4; i++) {
cin >> x1 >> y1 >> x2 >> y2;
if ((y2 - y1) != 0) {
ver++;
}
if ((x2 - x1) != 0)... | 9 |
#include <bits/stdc++.h>
int main(void) {
unsigned int n, m;
scanf("%d %d", &n, &m);
unsigned int points = m * n;
unsigned int moves = 0;
while (points != 0) {
points -= (m + n - 1);
m--;
n--;
moves++;
}
(moves % 2 != 0) ? printf("Akshat\n") : printf("Malvika\n");
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
string tar;
queue<int> q;
set<string> ans;
bool vis[60000][5] = {false}, check[60000] = {false};
int main() {
cin >> tar;
int len = tar.length();
vis[len][3] = true;
vis[len][2] = true;
q.push(len - 2);
q.push(len - 3);
while (!q.empty()) {
int pos = q.fro... | 10 |
#include <bits/stdc++.h>
using namespace std;
void out(bool f) {
if (f & 1)
cout << "Stannis" << endl;
else
cout << "Daenerys" << endl;
}
int main() {
int odd = 0, even = 0;
int n, k;
cin >> n >> k;
k = n - k;
for (int i = 0, x; i < n && cin >> x; i++)
if (x & 1)
++odd;
else
++... | 14 |
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
typedef long long int ll;
#define MAX 1000000000
#define mod 1000000007
ll gcd(ll a, ll b){
if (a == 0)
return b;
else
return gcd(b % a, a);
}
ll lcm(ll a, ll b) {
return (a*b)/gcd(a, b);
}
ll fact(ll n){
if(n==0)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[10];
bool isprime(int z) {
if (z == 4 || z == 6 || z == 8 || z == 9) return false;
return true;
}
int main() {
int z;
cin >> z;
string s;
cin >> s;
int mx = 0;
for (int i = 0; i < z; i++) {
if (s[i] - '0' == 0 || s[i] - '0' == 1) continue;
for ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, l, m, n, r1, r2, q;
cin >> n >> m;
string s[n + 10];
string t[m + 10];
for (i = 0; i < n; i++) cin >> s[i];
for (i = 0; i < m; i++) cin >> t[i];
cin >> q;
while (q--) {
cin >> l;
l--;
r1 = l % n;
r2 = l % m;
cout... | 0 |
#include <bits/stdc++.h>
using namespace std;
set<int> s;
vector<int> ans;
int main() {
int n, m, a;
cin >> n >> m;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
s.insert(a);
}
int i = 1, an = 0;
while (m >= i) {
if (s.find(i) == s.end()) {
an++;
ans.push_back(i);
m -= i;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
namespace io {
const int SI = 1 << 21 | 1;
char IB[SI], *IS, *IT, OB[SI], *OS = OB, *OT = OS + SI - 1, c, ch[100];
int f, t;
inline void flush() { fwrite(OB, 1, OS - OB, stdout), OS = OB; }
inline void pc(char x) {
*OS++ = x;
if (OS == OT) flush();
}
template <class I>
... | 13 |
#include <bits/stdc++.h>
using namespace std;
namespace my_std {
bool ccc(long long a, long long b) { return a > b; }
long long my_pow(long long a, long long b, long long mod) {
long long res = 1;
if (!b) return 1;
while (b) {
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ... | 11 |
#include<cstdio>
#include<algorithm>
using namespace std;
const int md=1000000007;
int f[101][10001];
int a[101],b[101],x[100001],ans[100001];
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=2;i<=n;i++){
scanf("%d",&b[i]);
b[i]+=b[i-1];
}
for(int i=2;i<=n;i++)
b[i]+=... | 21 |
#include <bits/stdc++.h>
using namespace std;
int vis[110];
int main() {
int n, m, a, b;
cin >> n >> m;
memset(vis, 0, sizeof(vis));
while (n--) {
cin >> a >> b;
for (int i = a + 1; i <= b; i++) vis[i] = 1;
}
int sum = 0;
for (int i = 1; i <= m; i++)
if (vis[i]) sum++;
if (sum == m)
prin... | 3 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(const pair<int, int>& lhs, const pair<int, int>& rhs) {
return lhs.second < rhs.second;
}
int main() {
int n;
cin >> n;
pair<int, int> a[500001];
for (int i = 0; i < n; i++) cin >> a[i].first >> a[i].second;
sort(a, a + n, cmp);
int ans = 0, cur = 0;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, p;
cin >> n >> p;
set<pair<int, int> > t;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
t.insert({x, i});
}
queue<int> qu;
qu.push((*t.begin()).second);
long long time = (*t.begin()).first;
long long res[n];
t.erase(t.b... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5001;
long long d[2][maxn * 2];
long long get(long long a, long long l, long long r) {
if (a < l) {
return l - a;
} else if (a > r) {
return a - r;
}
return 0;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
long long x;
... | 13 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using std::abs;
using std::cerr;
using std::cin;
using std::cout;
using std::map;
using std::max;
using std::min;
using std::pair;
using std::set;
using std::string;
using std::swap;
using std::vector;
u... | 18 |
#include <bits/stdc++.h>
using namespace std;
int v[200010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> v[i];
sort(v, v + n);
int mn = INT_MAX;
for (int i = 1; i < n; ++i) mn = min(abs(v[i] - v[i - 1]), mn);
int ans = 0;
for (int i = 1; i < n; ++i)
if (abs(v[i] - v[i - 1]) == m... | 3 |
#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
bool Finish_read;
template <class T>
inline void read(T &x) {
Finish_read = 0;
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
if (ch == EOF) return;
ch = getchar();
}
while (isdigit(ch))... | 11 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, k, ans = 0, x = 0;
cin >> n >> k;
string s, a;
cin >> s;
sort(s.begin(), s.end());
a.push_back(s[0]);
for (long long i = 1; i < n; i++) {
if (a[x] < s[i] - 1) a.push_back(s[i]), x++;
}
if (k > a.size()) {
cout << -1 << '... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t, n, m, val, sum;
cin >> t;
while (t--) {
cin >> n >> m;
sum = 0;
for (int i = 0; i < n; i++) {
cin >> val;
sum += val;
}
cout << (sum == m ? "YES" : "NO") << endl;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j;
cin >> n;
long long int a[n], s = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
if (s % 2) {
cout << "NO\n";
return 0;
}
s /= 2;
long long int ss = 0;
map<long long int, long long int> mp;
fo... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100000;
int ps[MAX_N], cns[MAX_N], ss[MAX_N];
vector<int> nbrs[MAX_N];
double es[MAX_N];
int main() {
int n;
scanf("%d", &n);
ps[0] = -1;
for (int i = 1; i < n; i++) {
scanf("%d", ps + i), ps[i]--;
cns[ps[i]]++;
nbrs[ps[i]].push_back(i)... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string s, t;
cin >> s >> t;
int st = 0;
while (s[st] == t[st] && st < k) {
cout << s[st];
st++;
}
vector<int> q;
int p = 0;
for (int i = k - 1; i >= st; --i) {
int s1 = s[i] - 'a';
int t1 = t[i] - 'a';
in... | 11 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
char s[2000010];
int a[2000010];
vector<int> q;
inline void check(int x, int rnd) {
if (a[x]) return;
a[x] = rnd;
int now = s[x];
if (rnd & 1) now = 'W' + 'B' - now;
int last = (x - 1 + n) % n, nxt = (x + 1) % n;
if ((a[last] && a[last] != rnd) && (a[n... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 305;
const int maxe = 100000;
int a[maxn], b[maxn];
int c[maxn], p[maxn];
bool vis[maxn];
int cc[maxn][maxn];
char tt[maxn];
int par[maxn], high[maxn];
void init(int n) {
for (int i = 0; i <= n; i++) {
par[i] = i;
high[i] = 0;
}
}
int Find(int x... | 8 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9, MOD = 1e9 + 7, MOD2 = 1e6 + 3;
int n, mx;
vector<int> v;
vector<int> add[1000000];
pair<int, int> d[1000000];
int main() {
cin >> n;
vector<int> v(2 * n, -1);
for (int i = 0; i < n; i++) {
scanf("%d", &d[i].first);
d[i].second = i + ... | 12 |
#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, k, endX, endY;
int use[20][20];
int pos[2][20];
int dir[4] = {0, -1, 0, 1};
char A[20][20];
map<vector<int>, int> M;
vector<vector<int> > c;
inline int opposite(int x) {
if (x & 1) return 4 - x;
return 2 - x;
}
int solvable() {
use[endX][endY] = 1;
f... | 14 |
#include <bits/stdc++.h>
using namespace std;
int D[100000], S[100000];
int main() {
int N;
cin >> N;
queue<int> Q;
for (int i = 0; i < N; i++) {
cin >> D[i] >> S[i];
if (D[i] == 1) {
Q.push(i);
}
}
vector<pair<int, int> > edges;
while (!Q.empty()) {
int i = Q.front();
Q.pop();
... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long linf = 0x3f3f3f3f3f3f3f;
const double eps = 1e-6;
const double pi = 3.14159265358979;
const int maxn = 1e5 + 5;
const int maxm = 2e7 + 5;
const int mod = 1e9 + 7;
int n, rev[maxn], t[maxn];
char s[maxn], tmp[4][maxn];
int mul_inv(... | 14 |
#include <bits/stdc++.h>
using namespace std;
mt19937_64 mt(time(0));
long long gcd(long long a, long long b) {
if (a > b) swap(a, b);
if (a == 0) return b;
return gcd(b % a, a);
}
pair<long long, long long> get_res(long long a, long long b, long long n,
long long c) {
long lo... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
char a, b;
int count, mx = 0;
int i, j;
cin >> n;
cin >> s;
for (i = 0; i < n - 1; i++) {
count = 0;
for (j = 0; j < n - 1; j++) {
if (s[j] == s[i] && s[j + 1] == s[i + 1]) count++;
}
if (count > mx) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
string s[MAXN], str[MAXN];
pair<string, string> e[MAXN];
map<string, int> mp;
map<string, pair<long long, long long>> mincost;
pair<int, int> num[MAXN];
int num2[MAXN], len[MAXN];
vector<int> par[MAXN];
bool v[MAXN];
bool cmp(pair<int, int> v1, pai... | 16 |
#include <bits/stdc++.h>
int isgood[128];
char goods[32];
int plen;
char pat[100001];
int starpos;
char query[100001];
int match(int i, int j, int n) {
while (n-- > 0) {
if (query[i] != pat[j]) {
if ('?' != pat[j]) return 0;
if (0 == isgood[query[i]]) return 0;
}
i++;
j++;
}
return 1;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[2][55], b[55], i, j;
cin >> n;
for (i = 1; i <= n - 1; ++i) cin >> a[0][i];
a[0][0] = 0;
for (i = 0; i < n - 1; ++i) cin >> a[1][i];
a[1][n - 1] = 0;
for (i = 0; i < n; ++i) cin >> b[i];
for (i = 1, j = n - 2; i < n, j >= 0; ++i, --j) {... | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.