solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int V = 3010;
struct Point {
int x, y;
};
struct Rec {
Point a, b;
} a[100100];
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int mx[V][V][4];
bool dr[V][V][4];
Point ls[V];
int ret[100100];
int cl[V][V], s[V][V];
int sum(int lx, int ly, int l) {
int rx = ... | 16 |
#include <bits/stdc++.h>
using namespace std;
long long dp[200005][3], res[200005];
pair<long long, long long> a[200005];
void solve() {
long long q;
cin >> q;
for (long long i = 0; i < q; ++i) {
long long n;
string s, t;
cin >> n >> s >> t;
vector<long long> cnts(26), cntt(26);
for (long long... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s = "";
long long n;
cin >> n;
while (1) {
s += "47";
sort(s.begin(), s.end());
do {
if (stoll(s) >= n) {
cout << stoll(s) << '\n';
return 0;
}
} while (next_permutation(s.begin(), s.end()));
}
}
| 5 |
#include <bits/stdc++.h>
int main() {
long long int test, t, n, k1, k2, a[100], b[100], i, j;
scanf("%lld", &test);
for (t = 0; t < test; t++) {
scanf("%lld %lld %lld", &n, &k1, &k2);
for (i = 0; i < k1; i++) {
scanf("%lld", &a[i]);
if (a[i] == n) j = 0;
}
for (i = 0; i < k2; i++) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 30005;
int d, m, n, lm, i, j, b[N], gen[25];
long long L, R;
struct atom {
bitset<N> pr, sf, all;
long long ans, l;
void set(int v) {
if (v <= b[n]) pr.set(n);
if (v <= b[1]) sf.set(1);
for (int i = 1; i <= n; ++i)
if (v <= b[i]) all.se... | 26 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long m, n;
string str, ptr;
str = "qwertyuiopasdfghjkl;zxcvbnm,./";
char c;
cin >> c;
cin >> ptr;
m = ptr.length();
if (c == 'R') {
for (long long i = 0; i < m; i++) {
for (long long j = 0; j < 30; j++) {
if (ptr[i] == str... | 1 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
const int mod = 1000000007;
const double pi = (double)22 / 7;
int main() {
cin.tie(0);
std::ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k > n || (k == 1 && n != 1)) return cout << -1, 0;
string an... | 5 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:512000000")
using namespace std;
using li = long long;
using ld = long double;
void solve(bool);
void precalc();
clock_t start;
int main() {
start = clock();
int t = 1;
cout.sync_with_stdio(0);
cin.tie(0);
cout.precision(20);
cout << fixed;
precalc(... | 19 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
const int MAXN = 2e5 + 20;
int a[MAXN], w[MAXN], n;
const int P = 1e9 + 7;
inline void MOD(int& p) {
while (p < 0) p += P;
while (p >= P) p -= P;
}
struct BIT1 {
long long bit[MAXN];
inline void modify(int w, long long v) {
while (w... | 17 |
#include <bits/stdc++.h>
const int maxn = 100100;
struct T {
int to, nxt;
} way[maxn << 1];
int h[maxn], num;
inline void adde(int x, int y) {
way[++num] = {y, h[x]}, h[x] = num;
way[++num] = {x, h[y]}, h[y] = num;
}
int fa[maxn], vis[maxn];
double sum[maxn], v[maxn];
inline void dfs(int a) {
vis[a] = 1;
for ... | 14 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, k;
cin >> m >> k;
int i;
int score = 0;
int tab[m];
for (i = 0; i < m; i++) {
tab[i] = 5 * (i + 1);
}
i = 0;
while (((k + tab[i]) <= 240) && (i < m)) {
score += 1;
k += tab[i];
i++;
}
cout << score;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, b, p;
cin >> n >> b >> p;
int a[n + 10], i, useB = 0, useP = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if (a[i] == 1) {
useB++;
} else {
if ((p - useP) <= 0)
useB++;
else
... | 1 |
#include <bits/stdc++.h>
int a[200005];
std::vector<int> v, p, vt;
int main() {
int n, cnt = 0, cur = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (!a[i]) {
v.push_back(i);
} else if (a[i] < 0) {
++cnt;
p.push_back(i);
} else
vt.push_back(i);
... | 9 |
#include <bits/stdc++.h>
using namespace std;
long long hilbertorder(int x, int y, int lg) {
long long ret = 0;
for (int s = lg - 1; s >= 0; --s) {
int rx = x >> s & 1, ry = y >> s & 1;
ret = (ret << 2) | ((rx * 3) ^ ry);
if (!ry) {
if (rx) x = (1 << lg) - 1 - x, y = (1 << lg) - 1 - y;
swap(... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100000, LL = 20;
int q[N + 3], Fa[LL + 3][N + 3], dep[N + 3], L[N + 3], Ti[N + 3];
int go[N * 2 + 3], t[N * 2 + 3], last[N + 3], NowT[N + 3], n, K, en, Lar, ls,
Dn, ans;
set<int> A;
void add(int u, int v) {
go[++en] = v;
t[en] = last[u];
last[u] = en... | 18 |
#include <bits/stdc++.h>
using namespace std;
long long mp[3005][3005];
long long c[3005][3005];
long long n, m, mod;
long long a, b, x, y;
long long g;
int main() {
cin >> n >> m >> a >> b >> g >> x >> y >> mod;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
mp[i][j] = g;
g = (x * g ... | 13 |
#include <bits/stdc++.h>
using namespace std;
int n, l[100100], r[100100], ans, a[100100];
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int m = n / 2;
for (int i = 1; i <= m; i++) {
if (a[i] >= i) {
l[a[i] - i]++;
}
}
for (int j... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 10000;
const int M = 1000000;
const int INF = 0x7f7f7f7f;
struct edge {
int v, cap, cost, next;
edge() {}
edge(int a, int b, int c, int d) : v(a), cap(b), cost(c), next(d) {}
} e[M];
int head[N], sz;
int dis[N], pre[N], cur[N];
bool inq[N];
queue<int> q;... | 14 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200;
const int max_len = 200;
struct widget;
struct Box {
string name;
long long x, y;
vector<Box *> box_inside;
vector<widget *> widget_inside;
long long border, space;
bool type;
vector<Box *> parent;
void init(const string s, const bool t... | 15 |
#include <bits/stdc++.h>
using namespace std;
int set_bit(int mask, int c) { return mask |= (1UL << c); }
bool get_bit(int mask, int c) { return (mask >> c) & 1U; }
int fx[] = {1, -1, 0, 0, 1, 1, -1, -1, 0};
int fy[] = {0, 0, 1, -1, 1, -1, 1, -1, 0};
string fn[] = {"D", "U", "R", "L", "DR", "DL", "UR", "UL", "*"};
int ... | 12 |
#include <bits/stdc++.h>
int n;
int t[109][109];
int a[109];
int main() {
scanf("%d", &n);
for (int h = 0; h < n; h++)
for (int j = 0; j < n; j++) scanf("%d", &t[h][j]);
for (int h = 0; h < n; h++)
for (int j = 0; j < n; j++)
if (h != j) a[h] = a[h] | t[h][j];
for (int h = 0; h < n; h++) printf("%... | 7 |
#include <bits/stdc++.h>
int main() {
int i, n;
char str[1000];
while (scanf("%s", str) != -1) {
n = strlen(str);
if (n < 5) {
printf("Too weak\n");
continue;
}
int a, b, c;
a = b = c = 0;
for (i = 0; i < n; i++) {
if (str[i] >= 'A' && str[i] <= 'Z')
a = 1;
... | 0 |
#include <bits/stdc++.h>
int main() {
int tests;
std::cin >> tests;
for (int i = 0; i < tests; ++i) {
int r;
std::cin >> r;
std::cout << r / 7 + 1 << std::endl;
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int s[105];
int main() {
scanf("%d%d%d", &n, &a, &b);
s[0] = 1;
int sum = 1, i = 1, ma = 1;
while (b) {
s[i] = sum + 1;
sum += sum + 1;
ma = max(ma, s[i]);
i++;
b--;
}
while (a) {
if (sum <= ma) {
s[i] = s[i - 1];
... | 9 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double tiaohe = 0.57721566490153286060651209;
long long oula(long long x) {
long long res = x;
for (register int i = 2; i <= x / i; ++i) {
if (x % i == 0) {
res = res / i * (i - 1);
while (... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long r;
cin >> r;
for (long long x = 1; (x * x + x + 1) < r; ++x) {
long long num = r - (pow(x, 2) + x + 1);
long long deno = 2 * x;
if (num % deno == 0 && num / deno >= 1) {
cout << x << " " << num / deno << "\n";
return 0;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int cnt[1000005];
const int mod = 1e9 + 7;
void solve() {
int a, b;
cin >> a >> b;
for (int i = 1;; i += 2) {
if (a >= i) {
a -= i;
} else {
cout << "Vladik" << endl;
return;
}
if (b >= i + 1) {
b -= (i + 1);
} else {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long m[1000000], a[1000001], tr[1000001], mx;
long long ans = 0;
void build(int n, int b, int e, long long cost) {
if (b == e) {
m[b] = cost;
return;
}
int l = 2 * n, mid = (b + e) / 2;
build(l, b, mid, cost + a[l]);
build(l + 1, mid + 1, e, cost + a[... | 6 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
template <typename T>
void chmin(T &a, T b) {
if (a > b) a = b;
}
template <typename T>
void chmax(T &a, T b) {
if (a < b) a = b;
}
template <typename T>
void add(T &a, T b) {
a += b;
if (a < 0) a += MOD;
if (a >= MOD) a -= MOD;
}
vo... | 14 |
#include <bits/stdc++.h>
using namespace std;
long double EPS = 1e-12;
struct pt {
long double x, y;
pt(long double x, long double y) : x(x), y(y) {}
pt operator+(const pt &first) const { return pt(x + first.x, y + first.y); }
pt operator-(const pt &first) const { return pt(x - first.x, y - first.y); }
pt ope... | 12 |
#include <bits/stdc++.h>
using namespace std;
const int mn = 2e5 + 10;
int n, a, b, k;
vector<int> v;
int main() {
cin >> n >> a >> b >> k;
int health;
int tk;
int ans = 0;
for (int i = 1; i <= n; ++i) {
cin >> health;
int last = health;
bool f = 1;
int x1 = health / (a + b);
int x2 = x1 *... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int lim = 26;
struct so {
so() : v(0), flip(0), len(0), c(0) {}
so(int _v, int _flip, int _len, int _c) {
v = _v;
flip = _flip;
len = _len;
c = _c;
}
int v, flip, len, c;
};
struct node {
int v, c;
node *next;
} p... | 16 |
#include <bits/stdc++.h>
using namespace std;
int n;
char a[111][111];
vector<pair<int, int> > v, vv;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) cin >> a[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (a[i][j] == '.') {
v.push_back(m... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000001;
const long long int LLINF = 1000000000000000001LL;
const int ALPH = 2;
struct node {
int s[ALPH];
int flink = -1, dictlink = -1, par;
char parChar;
int word = -1;
node(int par = -1, char parChar = '$') : par(... | 24 |
#include <bits/stdc++.h>
using namespace std;
char s[100005];
int n, m;
int g[100005];
using namespace std;
const int maxn = 100001;
int x[maxn], y[maxn], z[maxn];
int main() {
int i, j, k, a, b;
while (cin >> s) {
n = strlen(s);
scanf("%d", &m);
memset(g, 0, sizeof(g));
memset(x, 0, sizeof(x));
... | 7 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void PV(T x) {
for (__typeof__((x).begin()) i = (x).begin(); i != (x).end(); ++i)
cout << *i << " ";
cout << endl;
}
vector<double> fac;
double logC(int a, int b) { return fac[a] - fac[b] - fac[a - b]; }
int main(int argc, char *argv[]) {
int n,... | 18 |
#include <bits/stdc++.h>
using namespace std;
int give[101];
int take[101];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b, c;
cin >> a >> b >> c;
give[a] += c;
take[b] += c;
}
int sum = 0;
for (int i = 1; i <= n; i++) {
int mn = min(give[i], take[i]);
g... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5;
int n, T;
double c, pa[N], sa[N];
int a[N];
int main() {
cin >> n >> T >> c;
double revT = 1.0 / T;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
pa[i + 1] = (pa[i] + a[i] * revT) / c;
sa[i + 1] = sa[i] + a[i] * revT;
}
int tt;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
int x, dist[1002][1002], n, m;
vector<int> of[1002];
vector<int> am[1002];
pair<int, int> tmp;
string s;
queue<pair<int, int> > q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s;
for (int j = 0; j ... | 10 |
#include <bits/stdc++.h>
using namespace std;
long long c[100100], sum, ans;
set<int> st;
int id[100100], pre[100100], suc[100100];
int n, k;
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> c[i];
pre[i] = i - 1;
suc[i] = i + 1;
}
pre[1] = n;
suc[n] ... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long resl[1000], resr[1000];
map<pair<int, long long>, long long> cache;
long long query(int f, long long x) {
if (cache.count({f, x})) return cache[{f, x}];
cout << "? " << f << " " << x << "\n" << flush;
long long r;
cin >> r;
cache[{f, x}] = r;
return r;... | 24 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string x;
getline(cin, x);
int prev = 0;
for (int i = 0; i < x.length(); i++) {
string curStr, prevStr;
curStr = bitset<8>(x.c_str()[i]).to_string();
reverse(curStr.begin(), curStr.end());
unsigned int cur = std::strtol(curStr.c_str(), N... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const long long INF = 1ll << 60;
const double Inf = 1e20;
const double eps = 1e-9;
void gmax(int &a, int b) { a = (a > b ? a : b); }
void gmin(int &a, int b) { a = (a < b ? a : b); }
const int maxn = 200050;
int month[] = {31, 28, 31, 30, 31, 30, 31... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t) {
int n;
t--;
cin >> n;
if (n % 2 == 0) {
cout << int(n / 2) - 1 << "\n";
} else {
cout << int(n / 2) << "\n";
}
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, q, t, k, a, b, c, d;
long long ans[100005];
long long aux[5];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> a >> b >> c >> d;
long long n = a + b + c + d;
aux[0] = a;
aux[1] = b;
aux[2] = c;
aux[3] = d;
deque<long long> d;
... | 11 |
#include <bits/stdc++.h>
using namespace std;
long long po[11], tot[11], len[11];
long long calc(long long x, long long lim) {
if (x == 0) return lim;
int num = 0;
long long now = x;
while (now) {
num++;
now /= 10;
}
long long sum = 0;
for (int i = 0; i < num - 1; i++) {
if (sum >= lim - tot[i... | 11 |
#include <bits/stdc++.h>
using namespace std;
long long n, m, p = 1e9 + 7, v[201], cnt[201], a[201];
bitset<130> f[8];
long long get(long long x) {
long long now = 1, i;
for (i = 1; i < x; i++) now = now * cnt[a[i]] % p;
return now;
}
long long dfs(long long x, long long la) {
long long now = get(x), i;
if (x... | 21 |
#include <bits/stdc++.h>
using namespace std;
void bla() {
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
}
int main() {
bla();
int n;
cin >> n;
int x[n + 1], y[n + 1];
for (int i = 0; i < n; ++i) cin >> x[i] >> y[i];
int c = 0;
for (int i = 0; i < n; ++i) {
int ... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n++;
cout << ceil(n / 2.0) * (n / 2) << endl;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int w, m, l = 0;
bool f = 1;
int d[30] = {0};
cin >> w >> m;
while (m) {
d[l] = m % w;
m /= w;
l++;
}
for (int i = 0; i < l; i++) {
if (d[i] == 0 || d[i] == 1) continue;
if (d[i] == w - 1 || d[i] == w)
d[i + 1]++;
els... | 11 |
#include <bits/stdc++.h>
using namespace std;
int now, n, rec;
int a[60];
long long dp[52][52][52];
inline long long DP(int left, int at, int pep) {
if (left < 0 || pep < 0) return 0;
if (at == n) {
if (pep == 0 && left < now) return 1;
return 0;
}
long long a1, a2, ans;
long long &ret = dp[left][at][... | 11 |
#include <bits/stdc++.h>
using namespace std;
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
return pair<S, T>(s.fir... | 11 |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
std::istream& operator>>(std::istream& i, pair<T, U>& p) {
i >> p.first >> p.second;
return i;
}
template <typename T>
std::istream& operator>>(std::istream& i, vector<T>& t) {
for (auto& v : t) {
i >> v;
}
return i;
}
templat... | 17 |
#include <bits/stdc++.h>
using namespace std;
long long da[15], a[15][15], n;
int main() {
scanf("%lld", &n);
for (int i = 1; i < n; i++)
for (int j = 1; j < n; j++) {
a[i][j] = i * j;
memset(da, 0, sizeof da);
long long now = a[i][j], ans = 0, num = 0;
while (now >= 1) {
da[++nu... | 5 |
#include <bits/stdc++.h>
using namespace std;
int l(int x1, int y1, int x2, int y2) {
if (x1 == x2 || y1 == y2)
return 1;
else
return 2;
}
int s(int x1, int y1, int x2, int y2) {
if (((x1 % 2) == 0 && (y1 % 2) == 0) || ((x1 % 2) != 0 && (y1 % 2) != 0)) {
if (((x2 % 2) == 0 && (y2 % 2) == 0) || ((x2 % ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
if (n % 4 == 0) {
cout << n / 4;
} else if (n % 2 == 0 && n >= 6) {
n -= 6;
cout << n / 4 + 1;
} else if (n % 2 != 0 && n >= 9) {
if (n == 9)
cout << 1;
... | 5 |
#include <bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define deb(x) cout<<#x<<"="<<x<<endl;
#define endl '\n'
#define M 1000000007
#define int long long
#define INF 1e18
#define N 1000005
using namespace std;
void solve()
{
ll n, m;
cin >> n >> m;
... | 11 |
#include <bits/stdc++.h>
using namespace std;
int cards[222222];
pair<int, int> cards2[222222];
int big = 1000000002;
map<int, int> mp;
char mark[222222];
int m;
int allocard1() {
static int last = -1;
last += 2;
while (true) {
if (mp.find(last) == mp.end()) {
break;
}
last += 2;
}
if (last ... | 11 |
#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int N = 100010;
const int inf = 0x3f3f3f3f;
using namespace std;
int a[100005];
int main() {
int n, i, dis, cot, ans;
while (~scanf("%d", &n)) {
ans = 0;
cot = 10000000;
while (n--) {
scanf("%d", &dis);
cot = cot < dis ? cot : dis;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = -1, MOD = 1e9 + 7;
int n;
long long ans;
bool roto;
set<int> P, S, U;
void mete(int t) {
if (((int)P.size()) && *P.rbegin() > t) {
P.insert(t);
return;
}
if (((int)S.size()) && *S.begin() < t) {
S.insert(t);
return;
}
U.insert(t);
... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int count = 0;
while (1) {
if ((*min_element(arr, arr + n) == k)) {
break;
}
sort(arr, arr + n);
int prev = -1;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > s, t;
void read(int n, int m, vector<vector<int> >& b, vector<int>& elem) {
b.assign(n, vector<int>(m, 0));
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) scanf("%d", &b[i][j]), elem.push_back(b[i][j]);
;
sort(elem.begin(), elem.end... | 20 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
struct ed {
int x, y, w, id;
} e[maxn * maxn];
bool cmp(ed a, ed b) { return a.w > b.w; }
int fa[maxn], en[maxn];
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
void Merge(int x, int y) {
int f = find(y);
fa[f] = find(x);
}
int... | 17 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
if (tmp) a.push_back(tmp);
}
int count = 0;
if (a.size()) {
count = 1;
sort(a.begin(... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, a, b;
cin >> q;
for (int t = 0; t < q; t++) {
cin >> a >> b;
int c = b / a;
int d = b % a;
cout << d * (c + 1) * (c + 1) + (a - d) * c * c << endl;
}
}
| 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = int(1E9 + 7);
const double EPS = 1e-6;
int main() {
int n, p[4][4];
bool found;
int f, s;
while (cin >> n) {
found = false;
for (int i = (0); (i) < int(4); ++i)
for (int j = (0); (j) < int(4); ++j) cin >> p[i][j];
for (int i = (0); ... | 3 |
#include <bits/stdc++.h>
using namespace std;
int dp[5009][5009], a[5009], b[5009], c[5009], from[5009], n;
vector<int> retval[5009];
int solve(int i, int m) {
if (i == (n + 1)) return 0;
if (m < a[i]) return dp[i][m] = -1e9;
if (dp[i][m] != -1) return dp[i][m];
int ansmax = solve(i + 1, m + b[i]);
int ans, j... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1 << 10;
const int mod = (int)1e9 + 7;
int dp[2][maxN][maxN];
string a[maxN];
void add(int &x, int a) {
x += a;
if (x >= mod) {
x -= mod;
}
}
int abs_(int x) { return max(x, -x); }
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m ... | 15 |
#include <bits/stdc++.h>
using namespace std;
const int MXN = 100100;
const int inf = 1e9;
const int mod = 1000000007;
char s[MXN];
int add(int a, int b, int m) { return (a + b) % m; }
int mul(int a, int b, int m) { return (1LL * a * b) % m; }
int powmod(int a, int n, int m) {
int res = 1;
while (n) {
if (n & 1... | 10 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long n;
cin >> n;
long long q;
cin >> q;
map<long long, long long> m1, m2;
long long problem = 0;
while (q--) {
long long r, c;
cin >> r >> c;
if (r == 1) {
if (m1[c] == 1) {
m1[c] = 0;
if (m2[c - 1] == 1)... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100;
const int off = 1e5 - 100;
const int B = 1e4 - 100 + off;
int n, k, a[N], b[N];
int dp[N][B];
int f(int n, int r) {
if (n == 0) return a[0] * (a[0] - k * b[0] == r - off);
if (dp[n][r] != -1) return dp[n][r];
int ans = f(n - 1, r);
if (f(n - 1, r ... | 11 |
#include <bits/stdc++.h>
using namespace std;
int min(int x, int y) { return (x < y) ? x : y; }
int max(int x, int y) { return (x > y) ? x : y; }
int find(int disjoint[], int x) {
if (disjoint[x] == x)
return x;
else
disjoint[x] = find(disjoint, disjoint[x]);
return disjoint[x];
}
void unio(int disjoint[]... | 8 |
#include <bits/stdc++.h>
long long ans = 1e9, a, b, i, j, o, sum, siz, D[3333], data[3333][3333],
sz[3333], x, y, h;
int main() {
ans = ans * ans;
scanf("%lld%lld", &a, &b);
for (i = 0; i < a; i++) {
scanf("%lld%lld", &x, &y);
data[x][sz[x]++] = y;
}
for (i = 1; i <= b; i++) std::sort(data[i... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a;
scanf("%lld%lld", &n, &a);
long long ang = 2;
double pang = 180. / n;
for (int i = 2; i < n; ++i) {
if (fabs(pang * (i - 1) - a) < fabs(pang * (ang - 1) - a)) ang = i;
}
printf("%lld %lld %lld\n", 2ll, 1ll, ang + 1);
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
long long fr() {
long long t = 0;
long long flag = 0;
char ch = getchar();
while (ch < 33) ch = getchar();
if (ch == '-') {
flag = 1;
ch = getchar();
}
while (ch > 32) {
t = t * 10 + ch - '0';
ch = getchar();
}
if (flag == 1)
return ((-... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int x, y, w;
int mp[22][22];
int d[22];
int minn;
int stk[22], top;
bool vis[22];
void DFS(int cnt, int val) {
if (cnt == top) minn = min(minn, val);
for (int i = 0; i < top; i++) {
int now = stk[i];
if (!vis[now]) {
for (int j = i + 1; j < top; ... | 16 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(const pair<long long int, long long int>& a,
const pair<long long int, long long int>& b) {
if (a.first > b.first) return true;
if (a.first < b.first) return false;
if (a.first == b.first) return a.second < b.second;
}
int main() {
long long int t ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (i == 1 && j == 1)
cout << "W";
else
cout << "B";
}
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100100, maxk = 13, maxm = 4;
const int mod = 1000000007;
int mul(long long a, long long b) { return a * b % mod; }
int f[maxn][1 << maxm][maxk];
int main() {
int n, k, m;
cin >> n >> k >> m;
f[n + 1][0][0] = 1;
for (int i = n + 1; i >= 2; i--) {
... | 20 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
bool flag = false;
for (int i = 1; i <= k; i++) {
int x, y;
scanf("%d%d", &x, &y);
int dx1 = x - 1;
int dx2 = n - x;
int dy1 = y - 1;
int dy2 = m - y;
if (dx1 <= 4 || dx2 <= 4) fl... | 11 |
#include <bits/stdc++.h>
using namespace std;
void fw_update(map<int, int> &f, int pos, int diff, int max_pos) {
for (int i = pos; i <= max_pos; i += i & (-i)) {
f[i] += diff;
}
}
int fw_sum(map<int, int> &f, int pos) {
int res = 0;
for (int i = pos; i >= 1; i -= i & (-i)) {
res += f[i];
}
return re... | 12 |
#include <bits/stdc++.h>
using namespace std;
string a;
int n;
int k;
int used[50];
int used1[50];
void input();
void solve();
int main() {
input();
solve();
return 0;
}
void input() {
cin >> a;
n = a.size();
cin >> k;
}
void solve() {
int i, j;
int br1 = 0;
for (i = 0; i < n; i++) {
if (used[a[i]... | 4 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int n, m, k;
ll need;
vector<vector<int>> row, col;
vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};
int mn_x, mx_x, mn_y, mx_y;
inline void GG(bool chk = false) {
cout << (chk ? "Yes\n" : "No\n");
exit(0)... | 15 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
int getbit(T s, int i) {
return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
return __builtin_popcoun... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 55;
const int INF = 1e9 + 77;
const long long INFINF = 1e18 + 1e17;
const double PI = acos(-1.0);
long long Power(long long x, long long y) {
if (!y) return 1;
long long s = Power(x, y >> 1);
s *= s;
if (y & 1) s *= x;
... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, a[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
map<int, int> f;
long long x = 0, y;
for (int i = 0; i < n; ++i) {
cin >> a[i];
++f[a[i]];
}
sort(a, a + n);
for (auto x : f)
if (x.s... | 10 |
#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
int dp[(1 << 20) + 100];
int a[50][50];
int main() {
int n, k, i, j, mask, m, _m;
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
... | 19 |
#include <bits/stdc++.h>
using namespace std;
int high[105];
vector<string> v;
bool stu[105];
int main() {
int n, m;
cin >> n >> m;
string s;
for (int i = 0; i < n; i++) {
cin >> s;
v.push_back(s);
for (int i = 0; i < s.size(); i++) {
int x = s[i] - '0';
high[i] = max(high[i], x);
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, m, sum;
int main() {
cin >> n >> m;
int pos = 1;
while (1) {
if (m >= pos)
m -= pos;
else
break;
pos++;
if (pos == n + 1) pos = 1;
}
cout << m;
time_t start = clock();
cerr << "\n"
<< "Execution Time = " << double(cloc... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;
string s1, s2;
int ans[maxn];
int main() {
int n, m, q;
cin >> n >> m >> q;
cin >> s1 >> s2;
memset(ans, 0, sizeof(ans));
for (int i = 0; i + m <= n; i++) {
if (s1.substr(i, m) == s2) {
ans[i + 1]++;
}
}
for (int i = 1;... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
int a[maxn];
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
int i, j;
int t;
cin >> t;
long long n, a, b;
while (t--) {
cin >> n >> a >> b;
if (2 * a <= b) {
cout << n * a << endl;
} else {
long long ... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
cout << x << endl;
exit(0);
}
const long long mod = 1e9 + 7;
const int maxn = 1e6 + 5;
int n, m;
vector<pair<int, int>> g[maxn];
int a[maxn];
vector<int> ans;
bool viz[maxn];
int dfs(int at, int id = -1) {
viz[at] = true;
int cu... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int N = 52, mod = 1e9 + 7;
int c[N], dp[N][N][N], power[N];
inline long long mul(int a, int b) { return 1LL * a * b % mod; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, p;
cin >> n >> p;
for (int i = 0; i < n; i++) cin >> c[i];
dp[0][0][0... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const int N = 102, mod = 1000000007;
vector<int> compute_prefix(string s) {
vector<int> pi(s.size(), -1);
int k = -1;
for (int i = 1; i < s.size(); i++) {
while (k >= 0 && s[k + 1] != s[i]) k = pi[k];
if (s[k + 1] == s[i]) k++;
pi[... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n;
int m;
cin >> n >> m;
vector<int> w(n);
for (int _n(n), i(0); i < _n; i++) cin >> w[i];
vector<int> b(m);
for (int _n(m), i(0); i < _n; i++) {
cin >> b[i];
b[i]--;
}
long long ans = 0;
vecto... | 8 |
#include <bits/stdc++.h>
using namespace std;
int a[100000];
int main() {
int n, k;
scanf("%i%i", &n, &k);
k--;
for (int i = 0; i < n; i++) scanf("%i", &a[i]);
for (int i = k + 1; i < n; i++)
if (a[i] != a[k]) {
printf("-1\n");
return 0;
}
int cnt = n;
for (int i = n - 1; i >= 0; i--)
... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 2;
const int logn = 20 + 2;
const int mod = 998244353;
char str[maxn];
int x, y, len, ans;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int change(char ch) { return ch - '0'; }
int dp[maxn][logn][logn][logn][2];
int DP(int pos, int pre, int... | 19 |
#include <bits/stdc++.h>
using namespace std;
int n;
double mx[100010], mn[100010];
double a[100010], b[100010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lf", mx + i);
mx[i] += mx[i - 1];
}
for (int i = 1; i <= n; i++) {
scanf("%lf", mn + i);
mn[i] += mn[i - 1];
}
... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 10;
vector<int> g[maxn];
int n, a[maxn], nxt[maxn], gcd;
long long ans;
void work(int l, int r) {
for (int i = l; i <= min(r, n); i++)
if (nxt[i] < r) {
ans += (long long)gcd * (r - nxt[i]);
nxt[i] = r;
} else
break;
}
i... | 20 |
#include <bits/stdc++.h>
using namespace std;
double p = 1;
int n, m, h;
int A[1005], sum;
int main() {
scanf("%d%d%d", &n, &m, &h);
for (int i = 1; i <= m; i++) {
scanf("%d", &A[i]);
sum += A[i];
}
if (sum < n) {
puts("-1");
return 0;
}
if (sum - A[h] < n - 1) {
puts("1");
return 0;... | 8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.