solution stringlengths 53 181k | difficulty int64 0 13 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
inline long long pow_mod(long long X, long long N, long long mod) {
long long res = 1;
while (N > 0) {
if (N & 1) res = res * X % mod;
X = X * X % mod;
N >>= 1;
}
return res;
}
const long long SI = 1e6 + 100;
const long long mod = 1e... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
int n, m, q, v[maxn], lp[maxn];
vector<int> e[maxn], t[maxn];
vector<long long> ps[maxn];
int mx, argmx;
void dfs(int id, int p, int d, int cpn) {
if (cpn) v[id] = cpn;
lp[id] = max(lp[id], d);
if (d > mx) {
mx = d;
argmx = id;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long minn = INT_MAX;
long long maxx = INT_MIN;
bool ispalin(string str) {
long long l = 0;
long long h = str.size() - 1;
while (h > l) {
if (str[l++] != str[h--]) return 0;
}
return 1;
}
void isprime() {
long long n = 1000... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;
struct NODE {
int id, val;
} f[maxn];
struct node {
int l, r;
int minn;
} tree[maxn << 2];
int a[maxn], b[maxn], rt[maxn], ans[maxn];
bool cmp(NODE lft, NODE rt) {
if (lft.val == rt.val) return lft.id > rt.id;
... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100 + 5;
int n;
int a[N][4];
string name[N];
int mx[4];
string p[] = {
"If you want to call a taxi, you should call: ",
"If you want to order a pizza, you should call: ",
"If you want to go to a cafe with a wonderful girl, you should call: "};
bool... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MOD = 1000000007;
const int N = 100005;
int now;
int id = 0;
string in;
struct ct {
int id;
int layer;
string s;
vector<int> next;
int cnt;
};
vector<ct> vvv;
ct rt;
vecto... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string wire;
cin >> wire;
wire += ".";
char now = 'A';
int begin = 0;
bool flag = true;
std::string::size_type p;
int len = wire.length();
while (flag) {
for (int i = 0; i < wire.length(); i++) {
flag = false;
if (wire[i] != no... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 1;
const int mod = 1e9 + 7;
void slv() {
int64_t n;
cin >> n;
map<int64_t, int64_t> a;
long double ans = 0, sum = 0;
for (int64_t i = 0; i < n; i++) {
int64_t t;
cin >> t;
sum += t;
++a[t];
ans += (i - a[t] - a[t - 1] - a... | 7 |
#include <bits/stdc++.h>
using namespace std;
int n;
int arr[300300];
const int MOD = 1000000007;
int pwr(int base, int pw) {
int res = 1;
while (pw) {
if (pw & 1) res = (res * 1LL * base) % MOD;
base = (base * 1LL * base) % MOD;
pw >>= 1;
}
return res;
}
int main() {
scanf("%d", &n);
for (int i... | 3 |
#include <bits/stdc++.h>
using namespace std;
long long n, x, ans;
int main() {
cin >> n;
x = n * 6;
ans = (x / 2) * (n + 1);
cout << ans + 1 << endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
int t,n,q,l,r;
cin>>t;
while(t--)
{
cin>>n>>q;
cin>>s;
for(int i=0;i<q;i++)
{
cin>>l>>r;
l--;r--;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
int main() {
int n;
scanf("%d", &n);
long long l, r, d;
for (int i = 1; i <= n; i++) {
cin >> l >> r >> d;
if (d < l)
printf("%I64d\n", d);
else if (r / d * d > r)
printf("%I64d\n", r / d * d);
else
printf("... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int s, n;
cin >> s >> n;
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
for (auto u : v) {... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long t;
long long n;
long long a[100001];
signed main() {
cin >> t;
for (long long i = 1; i <= t; i++) {
cin >> n;
for (long long j = 1; j <= n; j++) {
cin >> a[j];
}
sort(a + 1, a + 1 + n);
long long ok = 1;
for (long long j = n; j >=... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, r;
while (cin >> k >> r) {
if (k < 0 || r <= 0) continue;
for (int n = 1;; n++) {
if (k * n % 10 == 0) {
cout << n << endl;
break;
}
if ((k * n - r) % 10 == 0) {
cout << n << endl;
break;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T>
inline T biton(T n, T pos) {
return n | ((T)1 << pos);
}
template <class T>
inline T bitoff(T n, T pos) {
return n & ~((T)1 << pos);
}
template <class T>
inline T ison(T n... | 2 |
#include <bits/stdc++.h>
using namespace std;
string reversed(string s) {
string res = "";
for (auto it = s.end() - 1; it >= s.begin(); it--) {
res += *it;
if (it == s.begin()) break;
}
return res;
}
bool isPal(string s) {
auto l = s.begin(), r = s.end() - 1;
while (*l == *r && l < r) {
l++;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
int f[N * 2 + 10];
void init(int n) {
for (int i = 1; i <= n; i++) f[i] = i;
}
int getf(int x) { return f[x] == x ? x : f[x] = getf(f[x]); }
int main() {
int n, m, q;
scanf("%d%d%d", &n, &m, &q);
init(n + m);
for (int i = 1; i <= q; i++) {
i... | 5 |
#include <bits/stdc++.h>
using namespace std;
bool p[400400];
vector<int> v;
int main() {
for (long long int i = 2; i <= 400000; i++) {
if (p[i] == 0)
for (long long int j = i; j * i <= 400000; j++) p[i * j] = 1;
}
for (int i = 2; i <= 400000; i++) {
if (p[i] == 0) v.push_back(i);
}
int n;
sca... | 2 |
#include <bits/stdc++.h>
using namespace std;
int arr[1000];
bool flag = true;
void makeearliest(int &n, int &early) {
char a[4], b[4];
b[3] = n % 10;
b[2] = (n / 10) % 10;
b[1] = (n / 100) % 10;
b[0] = (n / 1000) % 10;
for (int i = early; i <= 2011; i++) {
a[3] = i % 10;
a[2] = (i / 10) % 10;
a... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
vector<int> pool, ans;
for (int i = 0; i < n; i++) {
if ((1 << i) == (x & (-x)) && (1 << n) > x) continue;
pool.push_back(1 << i);
}
for (int i = 0; i < (int)pool.siz... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
std::vector<long long> v(1e5 + 7);
for (long long i = 0; i < 1e5 + 7; i++) {
v[i] = (i + 1) * (i + 2) / 2;
}
int flag = 0;
for (long long i = 0; i < 1e5 + 7; i++) {
if (binary_search(v.begin(), v.end(), n - v[i])) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000 * 5 + 10, D = 1000 * 1000 * 1000 + 7;
int n, m, mark[MAX], d[MAX][MAX];
vector<pair<int, int> > a;
long long dis(long long x, long long y) {
return abs(a[x].first - a[y].first) + abs(a[x].second - a[y].second);
}
bool dfs(int v, int color) {
if (mar... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200110;
int cnt[maxn];
int n, k, a, b, q;
int suma[maxn];
int sumb[maxn];
int lowbit(int x) { return x & (-x); }
void init() {
memset(suma, 0, sizeof(suma));
memset(sumb, 0, sizeof(sumb));
memset(cnt, 0, sizeof(cnt));
}
int sum(int i, int bit[]) {
i... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int x[26] = {0};
getline(cin, s);
for (int i = 1; i < s.length() - 1; i++) {
if (s[i] - 97 >= 0 && s[i] - 97 < 26) x[s[i] - 97]++;
}
int ans = 0;
for (int i = 0; i < 26; i++)
if (x[i] > 0) ans++;
cout << ans << endl;
return 0... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n, x, a, b;
cin >> n >> x >> a >> b;
cout << min(n - 1, abs(a - b) + x) << '\n';
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
char s[110];
int main() {
int n, num = 0;
cin >> n >> s;
for (int i = 0; i < n - 1; i++) {
if (s[i] == 'U' && s[i + 1] == 'R' || s[i] == 'R' && s[i + 1] == 'U') {
s[i] = 'X', s[i + 1] = 'X';
num++;
}
}
cout << n - num << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 28;
const long long LINF = 1ll << 61;
long long n, m, k, x, y, cnt[111][111];
int main() {
cin >> n >> m >> k >> x >> y;
if (n == 1) {
if (k % m == 0)
cout << k / m << " " << k / m << " " << k / m << endl;
else
cout << k / ... | 4 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int maxN = 110000;
int n, k, p;
vector<int> g[maxN];
bool used[maxN];
vector<int> d;
long long s[maxN];
void dfs(int v, int depth = 0) {
used[v] = true;
if (depth > 0) {
d.push_back(depth);
}
for (int i = 0; i < ... | 7 |
#include <bits/stdc++.h>
using namespace std;
string s[300005];
long long v[300004][2];
bool isregular(string a, int x, int y) {
int p = 0;
for (int i = x; i < y; i++) {
if (a[i] == '(')
p++;
else if (a[i] == ')' && p > 0)
p--;
else
return false;
}
if (p == 0)
return true;
el... | 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, m, k;
cin>>n>>m>>k;
vector<vector<int>> edges;
for(int i=0; i<n; i++) {
for(int j=0; j<m-1; j++) {
int x;
cin>>x;
edges.push_back({x, i, j, i, j+1});
}
}
... | 5 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void resize(int n, vector<T> &u) {
u.resize(n);
}
template <typename Head, typename... Tail>
void resize(int n, Head &H, Tail &...T) {
resize(n, H);
resize(n, T...);
}
template <typename T>
void debug_out(T t) {
cerr << t;
}
template <typename ... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
char s[5000];
char s1[5] = "bear";
int b[5000] = {0};
int i, j, k, len, t, n = 0;
long long int sum = 0;
scanf("%s", s);
len = strlen(s);
for (i = 0; i < len - 3; i++) {
if (s[i] == 'b') {
bool t = true;
for (j = 1; j < 4; j+... | 2 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const int N = 200010;
int n, m, p, x;
int a[N];
map<int, int> mp_b, mp_q[N];
set<int> st[N];
vector<int> ans;
int main() {
scanf("%d%d%d", &n, &m, &p);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
for (int i = 0; i < m; ++i) {
scanf("%... | 5 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int maxn = 1005;
int a[maxn];
int b[maxn];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
int x;
scanf("%d", &x);
b[x]++;
}
int ans = m;
for (int j = 1; j ... | 0 |
#include <bits/stdc++.h>
int brojZaPal[512][512];
int sol[512][512];
int prev[512][512];
bool postoji[512][512];
char s[512];
int o;
int res, solK;
char solution[1024];
int starting;
int min(int a, int b) { return a < b ? a : b; }
int main() {
scanf("%s", &s);
scanf("%d", &starting);
for (int i = 0; i < strlen(s)... | 5 |
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
int n, a, b, k;
scanf("%d%d%d%d", &n, &a, &b, &k);
int tot = 0;
cin >> s;
int prev = -1;
for (int i = 0; i < n; i++)
if (s[i] == '1') {
tot += (i - prev - 1) / b;
prev = i;
}
tot += (n - prev - 1) / b;
int ans = tot... | 4 |
#include <bits/stdc++.h>
using namespace std;
long long dp[71][71][36][71];
long long n, m, k;
long long tocal(long long num) {
if (num % k != 0)
return -1e9;
else
return 0;
}
long long vals[71][71];
long long calc(long long i, long long j, long long take, long long has) {
if (i >= n) {
return tocal(h... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100001;
struct edge {
int v, nxt;
edge(int v_ = 0, int nxt_ = 0) {
v = v_;
nxt = nxt_;
}
} e[MAXN * 2];
int f[MAXN][2], num, head[MAXN], pos[MAXN], ans, d;
void add_edge(int u, int v) {
e[++num] = edge(v, head[u]);
head[u] = num;
e[++num... | 6 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
register int x = 0, f = 0, ch = getchar();
while ('0' > ch || ch > '9') f ^= ch == '-', ch = getchar();
while ('0' <= ch && ch <= '9')
x = (x << 1) + (x << 3) + (ch ^ '0'), ch = getchar();
return f ? -x : x;
}
int n, a[1010];
int main() {
n... | 1 |
#include <bits/stdc++.h>
using namespace std;
int a[100000 + 5];
int main() {
int n, k;
cin >> n >> k;
int m = 0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (x != 0) a[++m] = x;
}
sort(a + 1, a + m + 1);
int s = 0;
for (int i = 1; i <= m; i++) {
a[i] -= s;
if (k == 0) break;
... | 1 |
#include <bits/stdc++.h>
int done[1001][1001];
int color[1001][1001];
int qu[1000000][2];
using namespace std;
int main() {
int k;
int pos[8][2] = {{1, 2}, {-1, 2}, {1, -2}, {-1, -2},
{2, 1}, {2, -1}, {-2, 1}, {-2, -1}};
int front, rear;
int x, y;
int i, j;
int n, m;
int z, o;
int tes... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, t;
cin >> n >> t;
vector<pair<int, pair<int, int>>> a(n);
bool run = false;
for (long long i = 0; i < (long long)n; i++) {
cin >> a[i].second.first >> a[i].first;
if (a[i].first <= t) {
... | 5 |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
long long read() {
long long x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') f = ... | 9 |
#include <bits/stdc++.h>
using namespace std;
char s[40][40];
char r[40], h[40];
int cnt[40];
int n, m, ans;
void reset() {
memset(s, 0, sizeof s);
memset(h, 0, sizeof h);
memset(r, 0, sizeof r);
memset(cnt, 0, sizeof cnt);
}
void permutation(int j) {
int i, c, ans, sum = 0, k;
sort(r, r + n);
do {
fo... | 7 |
#include <bits/stdc++.h>
int main() {
int a, i;
int m[10];
scanf("%d %d %d %d %d", &m[0], &m[1], &m[2], &m[3], &m[4]);
i = m[0] + m[1] + m[2] + m[3] + m[4];
if (i == 0)
printf("%d", -1);
else if (i % 5 == 0)
printf("%d", i / 5);
else
printf("%d", -1);
return 0;
}
| 1 |
#include <bits/stdc++.h>
int n, m;
char str[(21)][(21)];
int a[(21)][(21)], dp[1 << (21)], logdown[1 << ((21) + 1)];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i) {
scanf("%s", str[i]);
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
scanf("%d", &a[i][j]);
}
}... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
const int maxm = 1010;
double dp[2][maxn * maxm];
double sum[2][maxn * maxm];
int x[maxn];
int n, m;
int main() {
scanf("%d%d", &n, &m);
int tot = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &x[i]);
tot += x[i];
}
if (m == 1) {
... | 7 |
#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-11;
int n, m, s;
int first, second;
signed long long ans = 0;
signed long long f(int first, int second, int s) {
if (first * second == s)
return 2 * (first / 2 + 1) * (second / 2 + 1)... | 6 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define endl "\n"
#define pb push_back
#define sq(a) ((a)*(a))
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(a) ... | 3 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
int main(){
int TC;
cin >> TC;
while(TC--){
int N, le, ri, now;
cin >> N;
pair< pair<int... | 4 |
#include <bits/stdc++.h>
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long a, long long b) { return a < b ? a : b; }
int comparetor(const void* a, const void* b) { return (*(int*)a - *(int*)b); }
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", ... | 2 |
#include <bits/stdc++.h>
int abs(int a) { return a < 0 ? -a : a; }
int max(int a, int b) { return a > b ? a : b; }
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
int quick_power(int a, int b, int Mod) {
int ans = 1;
while (b) {
if (b & 1) {
ans = 1ll * ans * a % Mod;
... | 13 |
#include <bits/stdc++.h>
int main() {
int n, p, q, i, j, k, flag = 0, m = 0, k1;
scanf("%d %d %d ", &n, &p, &q);
char a[n + 1];
scanf("%s", a);
for (i = 0; i <= n / p; i++) {
for (j = 0; j <= n / q; j++) {
if (((p * i) + (q * j)) == n) {
flag = 1;
break;
} else if ((p * i) + (q... | 2 |
#include <bits/stdc++.h>
using namespace std;
long long int T, n, m, a, buc[63], con, sum, e;
bool z;
void pot(long int p) {
if (p > 60) {
z = true;
return;
}
if (buc[p] == 0) {
con++;
pot(p + 1);
buc[p]++;
return;
}
buc[p]--;
return;
}
int main() {
cin >> T;
for (int t = 0; t < ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
vector<int> pos[26];
char s[MAXN + 10];
int l[MAXN + 10], r[MAXN + 10];
int main() {
int n, m;
scanf("%d%s", &m, s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) l[i] = i - 1, r[i] = i + 1;
r[0] = 1;
for (int i = 1; i <= n; i++) p... | 5 |
#include <bits/stdc++.h>
using namespace std;
long long ans;
int main() {
long long n, r, avg;
while (cin >> n >> r >> avg) {
vector<pair<long long, long long> > v(n);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
sum += v[i].first;
swap(v[i].first,... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, m, id, ans, tr[N][26];
bool b[N];
char s[N];
std::priority_queue<int> q[N];
void dfs(int x, int d) {
for (int y, i = 0; i < 26; ++i)
if (y = tr[x][i]) {
dfs(y, d + 1);
while (q[y].size()) {
q[x].push(q[y].top());
... | 7 |
#include <bits/stdc++.h>
using namespace std;
const int d[] = {1, 2, 3, 5};
void solve() {
int n, k;
scanf("%d%d", &n, &k);
printf("%d\n", (6 * (n - 1) + 5) * k);
for (int i(0), _l((int)(n)-1); i <= _l; ++i) {
for (int j(0), _l((int)(4) - 1); j <= _l; ++j)
printf("%d%c", (6 * i + d[j]) * k, j == 3 ? '... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1.1e5;
const int MAXM = 1.1e5;
int N, M;
struct edge_t {
int c[2];
int other(int a) {
assert(a == c[0] || a == c[1]);
return a ^ c[0] ^ c[1];
}
} E[MAXM];
int last[MAXN];
int pred[MAXM * 2];
int ind[MAXM * 2];
int tot = 0;
void addEdge(int a, ... | 8 |
#include <bits/stdc++.h>
using namespace std;
set<long long int> s, r;
int main() {
long long int k, b, n, t, z = 1;
cin >> k >> b >> n >> t;
while (k * z + b <= t) {
z = z * k + b;
n--;
}
cout << (n > 0 ? n : 0);
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e2 + 5;
int n, grid[N][N];
bool col[N], row[N];
vector<pair<int, int> > ans;
int main() {
std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
memset(col, false, sizeof(col));
memset(row, false, sizeof(row));
cin >> n;
for (long lon... | 3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 1;
int n, k, deg[N];
set<int> adj[N];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> k;
for (int i = 1, u, v; i < n; i++) {
cin >> u >> v;
adj[u].insert(v);
adj[v].insert(u);
}
set<int> s;
for (int ... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << s;
reverse(s.begin(), s.end());
cout << s;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long flag = 0, n, k;
cin >> n >> k;
string s1;
cin >> s1;
long long l = s1.length();
string s2 = s1.substr(0, k);
for (long long i = k; i < l; i = i + 1) {
if (s1[i] > s1[i - k])
flag = 1;
else if (s1[i] < s1[i - k])
flag ... | 4 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1011110;
int n, nSwap;
int A[N];
void qSort(int l, int r) {
if (l >= r) return;
int key = A[rand() % (r - l) + l];
int i = l, k = r;
while (i <= k) {
while (A[i] < key) i++;
while (A[k] > key) k--;
if (i <= k) {
if (i < k) {
n... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int N, M, Q, to[maxn], w[maxn], delta[maxn];
long long dis[maxn];
vector<int> g[maxn];
queue<int> q[maxn];
inline void init() {
memset(dis, 0x3f, sizeof dis);
priority_queue<pair<long long, int>, vector<pair<long long, int>>,
gr... | 13 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n], tmp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0) {
tmp[i] = a[i];
} else {
tmp[i] = tmp[i - 1] + a[i];
}
}
if (tmp[n - 1] % k != 0) {
cout << "No";
return 0;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fi first
#define se second
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define d... | 3 |
#include <bits/stdc++.h>
using namespace std;
bool greatfunc(long long int a, long long int b) { return (a > b); }
bool checkPrime(long long int N) {
if (N < 2) return false;
if (N == 2 || N == 3) return true;
if (N % 2 == 0) return false;
for (long long int i = 3; i <= sqrt(N); i++)
if (N % i == 0) return ... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
x = 0;
bool f = 0;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') f = 1;
for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
if (f) x = -x;
}
template <typename F>
inline void write(F x, char... | 11 |
#include <bits/stdc++.h>
using namespace std;
int n, m, l, r, a[100005], lnc[100005], rec[100005];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
if (a[i - 1] >= a[i])
lnc[i] = 1 + lnc[i - 1];
else
lnc[i] = 1;
}
for (int i = n; i >= 1; i--) {
i... | 4 |
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
os << "{" << p.first << ", " << p.second << "}";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& p) {
os << "[";
int i = 0;
for (typename vect... | 5 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using piii = pair<pair<int, int>, int>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
bool check(vi a, v... | 3 |
#include <bits/stdc++.h>
using namespace std;
int const N = 2000001;
int n, v[N];
map<int, int> f;
int main() {
scanf("%d", &n);
long long sm = 0, fs = 0, need = 0;
multiset<int> sf, pf;
for (int i = 0; i < n; ++i) {
scanf("%d", v + i);
sm += v[i];
sf.insert(v[i]);
}
if (sm & 1) {
return put... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, maxh, currd, newd, currh, newh;
bool error;
cin >> n >> m;
cin >> currd >> currh;
error = false;
maxh = currh;
maxh = (maxh > currd + currh - 1 ? maxh : currd + currh - 1);
for (i = 1; i < m; ++i) {
cin >> newd >> newh;
if (... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long int r = 1;
cin >> n;
for (int i = 0; i < n; i++) {
r = r * 2;
if (r == 8192) {
r = r - 100;
}
}
cout << r;
return 0;
}
| 5 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int64_t k, b, n, t;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout << fixed;
cin >> k >> b >> n >> t;
int64_t z = 1;
int i;
for (i = 0; i < n; i++) {
if (k * z + b > t) break;
z = k * z + b;
}
cout << n - i ... | 4 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:167772160000")
using namespace std;
char grid[110][110];
set<char> have;
int n, m;
pair<int, int> chk(char c) {
int minn1, minn2, maxx1, maxx2;
minn1 = minn2 = 1000;
maxx1 = maxx2 = -1;
for (int i = 0; i < (n); i++)
for (int j = 0; j < (m); j++) {
... | 4 |
#include <bits/stdc++.h>
#define maxn 300010
using namespace std;
int p[maxn], num[3], r, ans[maxn], st[maxn], tmp[maxn];
char dir[maxn];
struct pos
{
int po, d, orp;
bool operator < (const pos &a) const
{
return po < a.po;
}
}p1[maxn], p2[maxn];
void solve(pos *t, int n)
{
sort(t + 1, t + n + 1);
int cnt =... | 6 |
#include <bits/stdc++.h>
using namespace std;
int num_conduct[100005];
int num_blocked[100005];
int conductionCost(int magnetPos, int ironPos) {
int x;
int y;
x = min(magnetPos, ironPos);
y = max(magnetPos, ironPos);
return num_conduct[y - 1] - num_conduct[x];
}
bool isBlocked(int magnetPos, int ironPos) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str[2];
ios_base::sync_with_stdio(false);
cin.tie(NULL);
getline(cin, str[0]);
getline(cin, str[1]);
long long i = 0, j = 0;
while (str[0][i] == '0') {
i++;
}
while (str[1][j] == '0') {
j++;
}
if (str[1].length() - j > str[0... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
const int base = 29;
unordered_map<unsigned long long, int> mmap;
unsigned long long p[maxn], h[maxn];
string s;
int n;
unsigned long long gethash(int l, int r) {
return h[r] - h[l - 1] * p[r - l + 1];
}
int last(int l, int len) {
int ans = 0;
... | 12 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long modi(long long a, long long m) { return power(a, m - 2, m); }
... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
long long bit[2][N], pos[N];
int n;
void updatebit(int x, int i, long long v) {
for (; i <= n; i += i & -i) bit[x][i] += v;
}
long long querybit(int x, int i) {
long long sum = 0;
for (; i > 0; i -= i & -i) sum += bit[x][i];
return sum;
}
int... | 7 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
bool is[1002];
int n, k, dp[1002], minii, maxii;
int viz[1000002];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
int dist = 0;
vector<int> di;
for (int i = 1; i <= k; ++i) {
int nr;
cin >> nr;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> res;
long long* p = new long long[2000001];
void SNT() {
for (long long i = 2; i * i < 2000001; i++) p[i] = 0;
for (long long i = 2; i * i < 2000001; i++)
if (!p[i])
for (long long j = i * i; j < 2000001; j += i) p[j] = 1;
}
int main() {
SN... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long n, k;
long long ans1, ans2, x, MAX = -1;
cin >> n >> k;
for (long long i = 1; i <= k; i++) {
cin >> x;
long long t = (n / x);
if (t * x > MAX) {
MAX = t * x;
ans1 = i;
ans2 = t;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if ((a + b) % 2 == 0) {
if (b + c > 0 and a + d > 0) {
cout << "Tidak Tidak Ya Ya"
<< "\n";
} else if (b + c > 0 and a + d == 0) {
... | 2 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void d_s_a() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int32_t main() {
d_s_a();
long long t;
cin >> t;
while (t--) {
long long n;
long long counter = 0;
cin >> n... | 0 |
#include <bits/stdc++.h>
using namespace std;
int a[1000001];
int b[10000000][2];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, edges = 0;
cin >> n;
a[1] = 0;
for (int i = 2; i <= 10000; i++) {
a[i] = -1;
}
for (int i = 2; i <= 10000; i++) {
if (a[i] == 0)
continue;
... | 3 |
#include <bits/stdc++.h>
using namespace std;
int n, mx = 0, ans = 0, a[200010], cnt[200010], b[400010];
void sol1(int x, int y) {
for (int i = 0; i <= 2 * n; i++) b[i] = -1;
b[n] = 0;
int cur = 0;
bool flag = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == x)
cur++, flag = 1;
else if (a[i] == mx)... | 9 |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long sum = 0, nega = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-') nega = -1;
ch = getchar();
}
while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
return sum * nega;
}
long lon... | 6 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
register int x = 0, f = 1;
register char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = 0;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + (ch ^ '0');
ch = getchar();
}
return f ? x : -x;
}
const double eps =... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
int dir[8][2] = {-1, 0, 1, 0, 0, -1, 0, 1, -1, -1, -1, 1, 1, -1, 1, 1};
template <typename S, typename T>
inline bool Min(S &a, const T &b) {
return a > b ? a = b, true : false... | 6 |
#include <bits/stdc++.h>
using namespace std;
int fa[1000005][21];
int st[1000005], en[1000005], Last[1000005];
char str[10 * 1000005];
int get(int L, int R, int len) {
int res = L;
while (L <= R) {
int mid = (L + R) >> 1;
if (en[mid] <= len) {
res = mid;
L = mid + 1;
} else
R = mid - ... | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum;
scanf("%d", &sum);
while (sum--) {
int a, b;
scanf("%d %d", &a, &b);
if (a >= b) {
printf("YES\n");
} else if (a == 1 && b != 1) {
printf("NO\n");
} else if (a <= 3 && b > 3) {
printf("NO\n");
} else {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
scanf("%d", &x);
printf("%d 2\n1 2\n", 2 * x - 1);
return 0;
}
| 3 |
#include <bits/stdc++.h>
using namespace std;
const int M = 5000005, N = 1000005;
int n, i, w, h, pe, k, j, L, st, erk, b, res, rx, a[N], t[N], d[N];
int as, p[N][23], qa, in, q[N][23];
char c[M];
vector<char> s[N];
vector<int> ma[N];
int main() {
scanf("%d%d%d", &n, &h, &w);
w++;
for (i = 1; i <= n; ++i) {
c... | 6 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int main() {
string t, hh, a, h, s, aa;
cin >> t;
for (int i = 0; i < t.size(); i++) {
if (t[i] != 'a') a.push_back(t[i]);
}
for (int i = 0; i < a.size() / 2; i++) {
h.push_back(a[i]);
}
for (int i = a.size() / 2; i < a.size(); i++) h... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.