solution stringlengths 53 181k | difficulty int64 0 13 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
float PHI = 1.6180339;
const float PI_F = 3.14159265358979f;
long long modpow(long long x, long long n, long long m) {
if (n == 0) return 1 % m;
long long u = modpow(x, n / 2, m);
u = (u * u) % m;
if (n % 2 == 1) u = (u * x) % m;
return u;
}
long long add(long lon... | 4 |
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000007;
const long double pii = 3.141592653589793238;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (... | 3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T pow(T a, T b, long long int m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
template <typename T>
void swap(T *a, T *b) {
T temp = *a;
*a = *b;
*b = temp;
r... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
vector<pair<string, string> > v;
for (int i = 0; i < q; i++) {
string a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
vector<pair<string, string> > ans;
for (int i = 0; i < (int)(v.size());) {
string s = v[i].... | 1 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
register int s = 0, f = 0;
register char ch = getchar();
while (!isdigit(ch)) f |= (ch == '-'), ch = getchar();
while (isdigit(ch)) s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
return f ? -s : s;
}
int n, m, w;
const int MAX = 500015;
i... | 4 |
#include <bits/stdc++.h>
using namespace std;
bool comparator(int a, int b) { return a > b; }
long long pw(int x, int y) {
long long res = 1;
while (y) {
if (y & 1) res *= x;
y = (y >> 1);
x *= x;
}
return res;
}
int main() {
;
ios::sync_with_stdio(false);
cin.tie(0);
;
int t;
cin >> t;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int a[1005][105];
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
}
}
printf("%d\n", m * (m - 1) / 2);
if (k == 0)
for (int i = 1; i <= m; i++) {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int arr[111];
int main() {
int n;
scanf("%d", &n);
for (int i = (0); i < (n); ++i) scanf("%d", &arr[i]);
sort(arr, arr + n);
int t = 10;
int ans = 0;
int qts = 0;
for (int i = (0); i < (n); ++i) {
t += arr[i];
if (t > 720) break;
qts++;
if (t... | 5 |
#include <bits/stdc++.h>
using namespace std;
struct v {
int x, y, s;
} t, e;
pair<int, int> p;
set<pair<int, int> > S;
queue<v> q;
int d[8][2] = {1, 0, 1, 1, 0, 1, -1, 1, -1, 0, -1, -1, 0, -1, 1, -1};
int main() {
int i, j, k, x1, y1, x2, y2, n, a, b, r;
scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &n);
while (n--)... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
struct PBTrie {
char pos;
T v;
shared_ptr<PBTrie> next[2];
PBTrie(long long maxVal) {
for (pos = -1; maxVal; ++pos, maxVal >>= 1)
;
}
PBTrie(const char pos) : pos(pos) {}
void updateHelper(const long long i, const T v) {
if (po... | 7 |
#include <bits/stdc++.h>
using namespace std;
int const MAX = 1e6 + 5;
int n, m, cnt, tot, all;
int outd[MAX], a[MAX], ans[MAX];
multiset<int> e[MAX];
void DFS(int x) {
while (!e[x].empty()) {
int i = *(e[x].begin());
e[x].erase(e[x].begin());
e[i].erase(e[i].find(x));
DFS(i);
}
ans[++all] = x;
}
... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, s;
cin >> n >> s;
s *= 100;
int max = -1;
while (n--) {
int x, y;
cin >> x >> y;
int amount = x * 100 + y;
int temp = s / amount;
if (temp) {
amount %= 100;
amount = 100 - amount;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int ans;
string a, b;
int main() {
cin >> a >> b;
for (int i = 0; i + b.length() <= a.length(); ++i) {
if (a.substr(i, b.length()) == b) {
++ans;
a[i + b.length() - 1] = '#';
}
}
cout << ans << endl;
return 0;
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, q, i, j, ans = 0;
;
int b[505];
int a[505][505];
cin >> n >> m >> q;
for (i = 0; i < n; i++) {
int c = 0, maxr = 0;
;
for (j = 0; j < m; j++) {
cin >> a[i][j];
if (a[i][j] == 1)
c++;
else {
max... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m;
int a[N], b[N];
vector<int> v[N];
vector<int> g[N];
vector<int> who[N];
int cur;
stack<int> s;
int start[N];
int iiiii;
vector<int> arr;
bool mark[N];
int col[N];
int subtree[N];
void dfs1(int node, int parent) {
subtree[node] = 1;
for (... | 10 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
template <typename T>
void etch(T V) {
for (auto x : V) cout << x << ' ';
cout << '\n';
}
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while (!s.empty()) {
res.push_back(s.substr(0,... | 7 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int first = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) {
if (ch == '-') f = -1;
}
for (; isdigit(ch); ch = getchar()) {
first = first * 10 + ch - 48;
}
return first * f;
}
const int mxN = 1000;
struct Matrix... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e4 + 7;
pair<int, int> p[MAX_N];
set<pair<int, int> > ans;
void daq(int l, int r) {
if (r - l == 1) {
return;
}
int mid = (r + l) / 2;
daq(l, mid);
daq(mid, r);
int x = p[mid].first;
for (int i = l; i < r; ++i) {
ans.insert({x, p[i].... | 7 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x;
}
inline void write(int num) {
if (num == 0) {
putchar('0');
return;
}
int t[8], ... | 10 |
#include <bits/stdc++.h>
using namespace std;
int n, a[(long long)2e5 + 10], l[(long long)2e5 + 10], r[(long long)2e5 + 10],
ans[(long long)2e5 + 10];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
stack<int> s;
for (int i = 0; i < n; ++i) {
while (!s.empty() && a[s.top()] >= a[i]) s.po... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int time_hrs, time_mins, curr_hrs, curr_mins;
scanf("%d:%d", &curr_hrs, &curr_mins);
scanf("%d:%d", &time_hrs, &time_mins);
curr_hrs -= time_hrs;
curr_mins -= time_mins;
if (curr_mins < 0) {
curr_hrs--;
curr_mins = -1 * curr_mins;
curr_m... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int mo = 1e9 + 7;
const int N = 55;
int f[2][2 * N][N];
int g[2][2][2 * N][N][N];
int e[N][N], st[N * N], ed[N * N], n, m;
int v1[2 * N][N][N], v2[2 * N][N][N];
vector<int> seq[N * N];
pair<int, int> walk(vector<int> &vec, int x, int flg) {
int p = 0;
for (; p + 1... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin >> s;
string t;
cin >> t;
long long n = s.length();
long long m = t.length();
long long pre[n + 5];
memset(pre, 0, sizeof(pre));
pre[0] = (s[0] == t[0]);
lo... | 4 |
#include <bits/stdc++.h>
using namespace std;
int F[100005], pF[100005];
int Fast(int x, int k) {
int res = 1;
while (k) {
if (k & 1) res = 1ll * res * x % 1000000007;
x = 1ll * x * x % 1000000007;
k >>= 1;
}
return res;
}
int C(long long n, long long m) {
if (n < 0 || m < 0) return 0;
if (n < m... | 7 |
#include <bits/stdc++.h>
using namespace std;
static const int N = 30001;
int m[500][N];
int n, d;
int v[N];
int h[3] = {-1, 0, 1};
int f(int pos, int dif) {
if (m[250 + dif][pos] == -1) {
m[250 + dif][pos] = 0;
for (int i = 0; i < 3; i++)
if ((pos + d + dif + h[i] < N) && (d + dif + h[i] > 0) &&
... | 5 |
#include <bits/stdc++.h>
using namespace std;
int a[200005], n, k;
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 <= n / 2; i++)
if (a[i] > k) ans += a[i] - k;
for (int i = n / 2 + 2; i <= n; i++)
if (a[i] <... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
int main() {
double l, p, q;
cin >> l >> p >> q;
cout << p * l / (p + q) << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
double n;
int l, d, j;
double suma = 0.0;
typedef struct niz {
int vrednost;
double pozicija;
} niz;
niz a[100001], c[100001];
void merge_count1(int x, int y) {
int m;
m = ((x + y) / 2);
if (x < y) {
merge_count1(x, m);
merge_count1(m + 1, y);
l = x;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 111111;
vector<int> vec[66];
int n, cnt, prime[66], gen[66], arr[111], brr[111], dp[111][1 << 17];
bool isGood(int num, int mask) {
for (int i = 0; i < vec[num].size(); ++i) {
if (mask & (1 << prime[vec[num][i]])) return false;
}
return true;
}
vo... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
vector<int> g;
for (int i = 0; i < n; i++) {
g.push_back((6 * i + 1) * k);
g.push_back((6 * i + 2) * k);
g.push_back((6 * i + 3) * k);
g.push_back((6 * i + 5) * k);
}
cout << g[g.size() - 1] << endl;
for (int... | 5 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
//#define ll int
#define pb push_back
#define binabreakwalabreak continue
#define lb lower_bound
#define ub upper_bound
#define pu ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, v, ans = 0, tank = 0;
cin >> n >> v;
int need = n - 1;
if (need <= v) {
cout << need;
return 0;
}
ans += v;
need -= v;
need++;
ans += need * (need + 1) / 2;
ans--;
cout << ans;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 5, M = 100000 + 5;
const bool T_BUS = false, T_PERSON = true;
const int EVENT = N + M;
const int SIZELS = EVENT * 2;
int n, m;
struct Event {
bool type;
int id;
int l, r, t;
inline bool operator<(const Event &b) const {
if (r != b.r) retur... | 8 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const int MOD = 1000000007;
bool ispalindrome(string &s) {
for (int i = 0; i < (int)s.size() / 2; i++) {
if (s[i] == s[(s.size() - i - 1)])
continue;
else
return false;
}
return 1;
}
... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d[100009 * 2];
long long x, y;
set<long long> s;
map<long long, bool> mp;
int main() {
cin >> a >> b >> c;
for (int i = 1; i <= a; i++) cin >> d[i];
long long z = 0;
for (int i = 1; i <= c; i++) {
cin >> x >> y;
if (x == 1) {
if (z <... | 2 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> officers(2e5);
vector<int> order;
vector<pair<int, int>> range(2e5);
void dfs(int i) {
int st = order.size();
order.push_back(i);
for (auto x : officers[i]) dfs(x);
int en = order.size();
range[i] = make_pair(st, en - st);
}
int main() {
int ... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long dx[] = {-1, 1, 0, 0};
long long dy[] = {0, 0, -1, 1};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
vector<long long> l(n);
vector<long long> r(n);
for (auto &k : l) cin >> k;
for (auto &... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 8;
string c[N];
bool blocked[N + 1][N][N];
char stat[N + 1][N][N];
int main() {
for (int i = 0; i < N; i++) {
cin >> c[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
blocked[0][i][j] = (c[i][j] == 'S');
}
}
for (i... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5000;
int sum[N][N];
int main() {
int n, m, ans = 0;
string s;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s;
int r = m;
for (int j = m - 1; j >= 0; j--)
if (s[j] == '1')
sum[j][r - 1] += 1;
else
r = j;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 2e5;
long long t[4 * MaxN];
long long getSum(int v, int tl, int tr, int l, int r) {
if (l > r) return 0;
if (l == tl && r == tr) {
return t[v];
}
int mid = (tl + tr) / 2;
return getSum(v * 2, tl, mid, l, min(r, mid)) +
getSum(v * 2 + ... | 7 |
#include <bits/stdc++.h>
int n;
long long solve(std::vector<int>& arr) {
long long ans = 0;
int i, j, cnt;
std::vector<int> b;
for (i = 0; i <= 24; i++) {
b.clear();
for (j = 0; j < n; j++) b.push_back(arr[j] % (1 << (i + 1)));
std::sort(b.begin(), b.end());
cnt = 0;
for (j = 0; j < n; j++) ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n;
const int maxn = 105;
struct node {
int l, r;
void read() { cin >> l >> r; }
} a[maxn];
int head[maxn], rear[maxn];
int tot;
int main() {
tot = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i].l, &a[i].r);
}
for (int i = 1; i <= n; i+... | 3 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int x[100010], y[100010... | 11 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = 0;
for (int i = 0; 1; ++i) {
if (n < (i + 1) * (i + 1)) {
if (n <= i * (i + 1)) {
int left = n - i * i;
ans = 4 * i;
if (left) ans += 2;
} else {
i... | 1 |
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
int main() {
int n, k, p;
cin >> n >> k >> p;
vector<int> tabo(0);
vector<int> tabe(0);
for (int i = int(0); i < int(n); ++i) {
int tmp;
cin >> tmp;
if (tmp % 2 == 1)
tab... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int LIM = 307;
int dp[LIM][LIM][LIM], T[3];
void solve() {
int n;
cin >> n;
for (int i = 0; i < (n); ++i) cin >> T[i];
if (n == 3) {
if ((T[0] ^ T[1] ^ T[2]) != 0) {
cout << "BitLGM\n";
} else {
cout << "BitAryo\n";
}
return;
}
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353, G = 3, Gi = 332748118;
int n, m, m2, invm2, k;
int fact[100010], inv[100010];
int nxt[100010], mi[100010], ss[100010];
int rev[270000], tot, bit;
long long A[270000], B[270000];
long long ans;
inline int read() {
int x = 0, w = 0;
char ch = 0;... | 9 |
#include <bits/stdc++.h>
int main() {
int n, k, a[1000], b[1000];
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 0; i < n; i++) scanf("%d", &b[i]);
int flag, minn = 99999;
while (k >= 0) {
for (int i = 0; i < n; i++) {
if (minn > b[i] / a[i]) {
minn = b... | 3 |
#include <bits/stdc++.h>
using namespace std;
int const INF = (int)1e9 + 1e3;
long long const INFL = (long long)1e18 + 1e6;
mt19937 tw(chrono::high_resolution_clock::now().time_since_epoch().count());
uniform_int_distribution<long long> ll_distr;
long long rnd(long long a, long long b) {
return ll_distr(tw) % (b - a ... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, k;
long long n;
cin >> t;
while (t) {
cin >> n >> k;
if (n < k)
cout << "NO\n";
else if (n % 2 == 1 && k % 2 == 0)
cout << "NO\n";
else if (n % 2 == 0) {
if (k <= n / 2) {
cout << "YES\n";
for (in... | 2 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,t;
cin>>t;
while(t--)
{
string s;
cin>>a>>s;
if(s[0]=='2'&&s[1]=='0'&&s[2]=='2'&&s[3]=='0')
{
cout<<"YES"<<endl;
}
else if(s[0]=='2'&&s[1]=='0'&&s[2]=='2'&&s[a-1]=='0')
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
template <typename T... | 6 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vec... | 13 |
#include <bits/stdc++.h>
const double eps = 1e-9;
const int int_inf = 2000000000;
const long long i64_inf = 1000000000000000000LL;
const double pi = acos(-1.0);
using namespace std;
int c[10000010];
bool isSq[10000010];
long long res = 0;
int a, n;
int main() {
cin >> a >> n;
for (int i = a; i <= a + n - 1; i++) c[... | 3 |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > v;
int main() {
int r, c, q, x, a, b, _c, i, j;
cin >> r >> c >> q;
int matrix[r + 1][c + 1];
for (i = 1; i <= r; i++)
for (j = 1; j <= c; j++) matrix[i][j] = 0;
while (q--) {
cin >> x >> a;
if (x < 3) {
v.push_back(make_p... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int data[105000], num[105000], w[105000], cnt[105000];
pair<int, int> mat[105000];
queue<int> que;
bool in_que[105000];
vector<int> ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n * m; i++) {
scanf("%d", &data[i]);
mat[i].first = data[i]... | 7 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ans1;
char ans[1000010], temp[1000010];
void update(int t, int b) {
int len = 1, i, k;
while (t != b && t >= 0 && b > +0) {
if (t > b) {
temp[len++] = 'T';
t -= b;
} else {
temp[len++] = 'B';
b -= t;
}
}
if (len != n || ... | 6 |
#include <bits/stdc++.h>
const int MAX = 1e6 + 10, inf = 1e9 + 10;
using namespace std;
int n, m;
long long N;
bool isTime = false;
int dx[8] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy[8] = {1, -1, 0, -1, 1, 0, -1, 1};
vector<int> dist[MAX], vis[MAX];
vector<pair<int, int> > goodOnes, ans;
vector<char> grid[MAX], resp[MAX];... | 7 |
#include <bits/stdc++.h>
struct Edge {
int u, v;
int id;
Edge(int u, int v, int id) : u(u), v(v), id(id) {}
};
int a[500005], b[500005];
std::vector<Edge> g[2000005];
int in[2000005];
int vis[1000005];
int stack[500005];
int top = -1;
int p[2000005];
int size[2000005];
int find(int u) {
if (p[u] == u)
retur... | 8 |
#include <bits/stdc++.h>
using namespace std;
long long int INF = 1e12;
long long int n, m, i, a, b, maxx, ff = 0, flag = 0;
vector<long long int> adj[1000001];
vector<long long int> fi(1000001, 0);
vector<long long int> brr(1000001, 0);
unordered_map<string, long long int> hM;
vector<pair<long long int, long long int>... | 8 |
#include <bits/stdc++.h>
using namespace std;
long long readi() {
long long input = 0;
char c = ' ';
while (c < '-') {
c = getchar();
}
bool negative = false;
if (c == '-') {
negative = true;
c = getchar();
}
while (c >= '0') {
input = 10 * input + (c - '0');
c = getchar();
}
if ... | 8 |
#include <bits/stdc++.h>
using namespace std;
int dp[2][1005][1005];
int v[2][1005][1005];
const int INF = 1000000000;
int n;
int main() {
scanf("%d", &n);
bool iszero = false;
int zx, zy;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int x;
scanf("%d", &x);
if (x == 0) {
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 7;
const int INF = 1e9 + 7;
int d[N];
int n, k, ans;
vector<int> g[N];
vector<pair<int, int> > r;
pair<int, int> deg[N];
map<pair<int, int>, int> mp;
void dfs(int v = 1, int p = 0, int c = 0) {
int clr = 1;
for (int to : g[v]) {
if (to == p) cont... | 5 |
#include <bits/stdc++.h>
using namespace std;
vector<string> V;
vector<long long> B;
set<long long> S;
double n, a, c, l, r, ans, b, m;
string p, s;
long long arr[101];
int main() {
ios_base::sync_with_stdio(0);
cin >> a >> b >> c;
double D = 0;
D = pow(b, 2) - 4 * a * c;
D = sqrt(D);
n = -b - D;
n /= 2 *... | 2 |
#include <bits/stdc++.h>
const int N = 5e5 + 30;
int read() {
char ch = getchar();
int s = 0;
while (ch < '0' || ch > '9') ch = getchar();
while (ch >= '0' && ch <= '9')
s = (s << 3) + (s << 1) + ch - '0', ch = getchar();
return s;
}
int n, m, Son, cnt, x, y;
int c[N], siz[N], son[N], ans[N], dep[N], tot[... | 8 |
#include <bits/stdc++.h>
using namespace std;
int t, n;
int MAXN;
vector<long long> S, D;
vector<pair<long long, pair<long long, long long> > > C[2];
void input();
void solve();
long long dist(long long, long long, int);
pair<long long, long long> toFL(long long, int);
int main() {
input();
solve();
return 0;
}
v... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3005;
int n, m, k, t, a[N], b[N], sum;
char s[N];
void dfs(int p, int m) {
for (; m; p = (p >= n - 1 ? 1 : p + 1)) {
if (a[p] == 1 && a[p + 1] == 0) {
printf("%d %d\n", 1, p);
swap(a[p], a[p + 1]);
++p;
--m;
}
}
}
int main()... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
while (n--) {
long long c, s;
cin >> c >> s;
long long k = abs(c - s);
long long q = min(c, s);
if (q >= k && (q - k) % 3 == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
char s[103];
int a[103], Ans[103], M;
vector<int> G[103];
queue<int> Q;
int main() {
int N;
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%s", s + 1);
for (int j = 1; j <= N; j++)
if (s[j] == '1') G[i].push_back(j);
}
for (int i = 1; i <= N;... | 7 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
using namespace std;
using ll = long long;
template <typename T>
inline T& ckmin(T& a, T b) {
return a = a > b ? b : a;
}
template <typename T>
inline T& ckmax(T& a, T b) {
return a = a < b ? b : a;
}
class lazy_segment_tree {
struc... | 9 |
#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-11;
int n, t;
bool b[1 << 20];
set<int> st, st2;
set<int>::iterator it;
int main() {
cout << setiosflags(ios::fixed) << setprecision(10);
scanf("%d", &n);
for (int i = 0; i < (n); i++... | 4 |
#include <bits/stdc++.h>
char a[200001], b[200001];
int main() {
int T;
scanf("%d", &T);
int n;
while (T--) {
scanf("%d", &n);
scanf("%s", &b);
scanf("%s", &a);
int cont = 0;
for (int i = 0; i < n; i++) {
if (a[i] == '1') {
if (b[i] == '0')
cont++;
else if (i ... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long int ans = LLONG_MAX;
bool isValid(long long int n) {
long long int a4 = 0, a7 = 0;
while (n != 0) {
if (n % 10 == 4) a4++;
if (n % 10 == 7) a7++;
n = n / 10;
}
if (a4 == a7)
return true;
else
return false;
}
void make(long long int n,... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int inf = INT_MAX;
int n, m, s, ans, now = 1, w[N], v[N], c[N], nex[N], head[N];
void add(int x, int y, int co, int z) {
nex[++now] = head[x], w[now] = z;
head[x] = now, v[now] = y, c[now] = co;
}
int vi[N], dis[N], way[N], bfe[N];
queue<int... | 10 |
#include <bits/stdc++.h>
using namespace std;
long long n, x1, x2;
vector<pair<long long, long long> > v;
int32_t main() {
scanf("%lld%lld%lld", &n, &x1, &x2);
long long l = 1, r = n;
v.resize(n);
for (long long i = 0; i < n; i++) scanf("%lld", &v[i].first), v[i].second = i;
sort(v.begin(), v.end());
long l... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5;
const long long INF = 1e18;
int N;
long long C[MAX_N];
vector<int> G[MAX_N];
long long dp[MAX_N][2];
bool used[MAX_N];
vector<int> ans;
int nxt[MAX_N];
long long psm[MAX_N + 1];
bool memo[MAX_N][2];
void dfs(int v, int p) {
for (auto e : G[v]) {
... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, table = 0, res = 0;
cin >> n;
vector<int> cnt(n + 1, 0);
for (int i = 0; i < 2 * n; ++i) {
int s;
cin >> s;
if (cnt[s] == 0) {
++cnt[s];
++table;
... | 0 |
#include <bits/stdc++.h>
struct TNode {
bool is_terminal;
int number_of_sons;
std::map<char, int> sons;
TNode() : is_terminal(false), number_of_sons(0), sons() {}
};
std::vector<TNode> trie;
int ans = 0;
int last_pref = 0;
std::vector<int> cur_word;
int process(int node, char c) {
ans += 1;
if (c < 'a' or c... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e6 + 6;
long long a[N];
void solve() {
int n;
cin >> n;
vector<pair<int, int> > v;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
v.push_back({x, 1});
v.push_back({y, -1});
}
v.push_back({1e9... | 2 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define debug cout<<"here\n"
#define MOD 1000000007
const int MAXN = 2e5 +15;
using namespace std;
int A[MAXN], pre[MAXN], mpre[MAXN];
int st[4*MAXN][2];
void update(int f, int v, int tl, int tr, int p, int x){
if(... | 4 |
#include <bits/stdc++.h>
using namespace std;
void Emsawy() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const double PI = acos(-1.0);
const double eps = 1e-10;
const long long mod = 1e9 + 7, oo = 1e9;
int dx[]{1, -1, 0, 0, 1, -1, 1, -1};
int dy[]{0, 0, 1, -1, 1, -1, -1, 1};
int n, m, k, c;
const int... | 5 |
#include <bits/stdc++.h>
using namespace std;
int n, k, startnode, ansnode;
vector<int> sz, mark, lleft, rright;
vector<vector<int> > g;
int getSize(int node = startnode, int par = -1) {
sz[node] = mark[node];
for (int i = 0; i < (int)g[node].size(); i++) {
int to = g[node][i];
if (to != par) sz[node] += ge... | 7 |
#include <bits/stdc++.h>
#pragma GCC optimize "-O3"
using namespace std;
const int MAXN = 120000;
int n;
int a[MAXN];
int go[MAXN];
int pl[MAXN];
int en[MAXN];
int pr[MAXN];
vector<int> gg[MAXN];
void solve() {
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i], --a[i], pl[a[i]] = i;
memset(en, 0, sizeof(en[0]) * ... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int modmult(int x, int y) { return (x * int64_t(y)) % MOD; }
template <class T>
void chmin(T& x, T y) {
if (y < x) x = y;
}
int64_t solve(const vector<string>& s) {
int n = s.size();
vector<array<int, 26>> cnt(n);
for (int i = 0; i < n; ++... | 8 |
#include <bits/stdc++.h>
using namespace std;
int t;
long long n, m, k;
long long blocks[233333];
long long mmax(long long a, long long b) { return (a > b ? a : b); }
int main() {
scanf("%d", &t);
while (t--) {
scanf("%lld%lld%lld", &n, &m, &k);
for (int i = 1; i <= n; i++) scanf("%lld", &blocks[i]);
fo... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2222;
char a[MAXN][MAXN];
vector<pair<int, int> > V;
set<int> S[MAXN];
int dp[MAXN][MAXN];
int odpow[MAXN];
deque<int> lw, pw;
void dodlw(int val) {
while (!lw.empty() && lw.back() < val) lw.pop_back();
lw.push_back(val);
}
void dodpw(int val) {
while... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[2 * n];
for (int i = 0; i < 2 * n; i++) {
cin >> a[i];
}
int co = 0;
for (int i = 0; i < 2 * n; i = i + 2) {
int now = a[i];
int pos;
for (int j = i + 1; j < 2 * n; j++) {
if (a[j] == now) {
pos... | 3 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++)
if (a[a[a[i]]] == i) {
cout << "YES";
return 0;
}
cout << "NO";
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
bool checkBit(int mask, int idx) { return mask & (1 << idx); }
int main() {
int tc;
scanf("%d", &tc);
while (tc--) {
long long d, m;
scanf("%lld %lld", &d, &m);
long long st[35] = {};
long long en[35] = {};
st[0] = 0;
en[0] = 1;
long long i... | 4 |
#include <bits/stdc++.h>
int st[101];
int main() {
int to, car = 2, cal = 0, cho = 100, flo = 1, egg = 1;
scanf("%d", &car);
for (to = 0; car > 0; car--) {
scanf("%d", &cho);
st[++to] = cho;
st[to] *= flo;
cho = st[to--];
st[to] += cho;
st[++to] = flo;
st[to] += egg;
flo = st[to--]... | 6 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
bool a[111][111];
int X[] = {-1, 0, 1, 0};
int Y[] = {0, -1, 0, 1};
void DFS(int x, int y) {
a[x][y] = 0;
for (int i = 0; i < 4; i++) {
if (a[x + X[i]][y + Y[i]]) DFS(x + X[i], y + Y[i]);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> m;
... | 2 |
#include <bits/stdc++.h>
using namespace std;
int x, n, px;
int main() {
scanf("%d", &x);
if (x == 3) {
printf("5\n");
return 0;
}
for (n = 1; 1; n += 2) {
px = n * n / 2 + 1;
if (px >= x) {
printf("%d\n", n);
return 0;
}
}
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const long long UNDEF = -1;
const long long INF = 1e18;
template <typename T>
inline bool chkmax(T& aa, T bb) {
return aa < bb ? aa = bb, true : false;
}
template <typename T>
inline bool chkmin(T& aa, T bb) {
return aa > bb ? aa = bb, true : false;
}
static char stdinB... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
if (n - a > b + 1) {
cout << b + 1;
} else {
cout << n - a;
}
return 0;
}
| 1 |
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<string>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<iostream>
#include<algorithm>
#include<unordered_map>
#include<unordered_set>
#define PI acos(-1)
#define pb push_back
#define all(x) x.begin(),x.end()
#define INF... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int MAXL = 62;
long long dp[MAXL + 10], fp[MAXL + 10];
void make() {
for (int i = 1; i <= MAXL; i++) {
memset(dp, 0, sizeof dp);
for (int j = 1; j <= i; j++) {
if (i % j != 0) continue;
dp[j] = (1ll << (j - 1));
}
for (int j = 1; j < i; j... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 1; i <= t; i++) {
int a, b, c, d, s, e, minx, maxx;
cin >> a >> b >> c;
s = a + b + c;
e = max(a, max(b, c));
minx = (e - (s - e));
maxx = s;
cout << (minx + maxx) / 2 << endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300 + 10;
const int maxm = 100000 + 10;
map<string, int> mp;
char s[maxm];
int n, res, sum, i, j, k, a[maxn], len[maxn], nxt[maxn];
int getId(const string& t) {
if (!mp[t]) mp[t] = (int)mp.size();
return mp[t];
}
int kmp(int a[], int n, int b[], int m) ... | 7 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
string home;
cin >> home;
int cntl = 0, cntr = 0;
while (n--) {
string t;
cin >> t;
string l, r;
l = t.substr(0, 3);
r = t.substr(5, 3);
if (l == home) cntl++;
if (r == home) cntr++;
}
if (cntl == c... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.