solution stringlengths 53 181k | difficulty int64 0 27 |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int par[5005];
int check[5005];
void dfs(vector<int> vt[], int s, int src, bool vis[]) {
vis[s] = 1;
par[s] = src;
for (int i = 0; i < vt[s].size(); i++) {
if (!vis[vt[s][i]]) dfs(vt, vt[s][i], src, vis);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.ti... | 12 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int main() {
int n, Q;
cin >> n >> Q;
int qh = 0, qt = n;
int q[2 * n + 5], mx = 0;
for (int i = 0; i < (int)n; ++i) {
cin >> q[i];
mx = max(mx, q[i]);
}
pair<int, int> ans[n + 1];
int ansh = 0;
while (q[qh] < mx) {
i... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long int P[] = {2147483647, 1147483661, 1147483721, 1147483723,
1147483751};
long long int INV[] = {1503238553, 1032735295, 1032735349, 344245117,
1032735376};
long long int R[5][1000010];
struct HV {
long long int h[5];
... | 15 |
#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INF = 2000000000;
long long INFF = 8000000000000000000LL;
double PI = acos(-1);
inline string IntToString(int a) {
char x[100];
sprintf(x, "%d", a);
string s = x;
return s;
}
inline int StringToInt(string a) {
char x[100];
int res;
strcp... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++) {
for (int a = 1; a <= 2 * n - 2 * i; a++) cout << " ";
for (int j = 0; j <= i; j++) {
if (i > 0)
cout << j << " ";
else
cout << j;
}
for (int k = i - 1; k >= 0; k--... | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long double n, t;
cin >> n >> t;
long double ans = n * exp(t * log(1.000000011));
cout << setprecision(15) << ans << endl;
return 0;
}
| 4 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 100001;
string s, ss, s2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(20);
cin >> s >> ss;
for (int i = 0; i < s.size(); i++) {
if (s[i] < ss[i]) {
cout << -1;
return 0;
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int a[MAXN];
int dp[MAXN][320];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int q;
scanf("%d", &q);
int SQRT = sqrt(n);
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= SQRT;... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long a, b, n, m;
cin >> a >> b >> n >> m;
if (a + b < n + m) {
cout << "No" << endl;
continue;
}
if (min(a, b) < m) {
cout << "No" << endl;
continue;
}
cout << "Yes" <... | 5 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#define ll long long
#define MAXN 100005
#define uns unsigned
#define INF 0x3f3f3f3f
using namespace std;
inline ll read(){
ll x=0;bool f=1;char s=getchar();
while((s<'0'||s>'9')&... | 24 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long MOD1 = 998244353;
const long long MIN_LL = -1e18;
const long long MAX_LL = 1e18;
const int MAX_INT = 1e9;
const int MIN_INT = -1e9;
const long double pie = 3.1415926535;
long long fpow(long long n, long long p) {
;
long ... | 8 |
#include <bits/stdc++.h>
using namespace std;
int toInt(string s) {
istringstream sin(s);
int t;
sin >> t;
return t;
}
template <class T>
string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T>
void chmin(T &t, T f) {
if (t > f) t = f;
}
template <class T>
void chma... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2000;
const int INF = 2000000000;
inline void read(int &re) {
re = 0;
int flag = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') flag = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
re = (re << 1) + (re <<... | 18 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
if (k % (m << 1))
cout << (((k / m) >> 1) + 1) << " " << ((k % (m << 1) + 1) >> 1) << " ";
else
cout << ((k / m) >> 1) << " " << m << " ";
if (k % 2)
cout << "L";
else
cout << "R";
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
#define mp make_pair
#define pr pair<long long,long long>
#define vr vector<long long>
#define MOD ... | 8 |
#include <bits/stdc++.h>
using namespace std;
int n, a = 0, c = 0, g = 0, t = 0, ques = 0, m = 0;
char f[400];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) cin >> f[i];
if (n % 4 != 0) {
cout << "===";
return 0;
}
for (int i = 0; i < n; i++) {
if (f[i] == 'A')
a++;
else if (... | 1 |
#include <bits/stdc++.h>
using namespace std;
int n, k, a[320000];
long long f[5200][5200];
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
int sl1 = n % k;
int sl2 = k - sl1;
int sp = n / k;
memset(f, 126, sizeof(f));
f[0... | 12 |
#include<bits/stdc++.h>
using namespace std;
const int N=114514;
char s[N];
int n,v[N],kkr;
int main(){int t;
scanf("%d",&t);while(t--){kkr=0;
scanf("%s",s+1);n=strlen(s+1);
for(int i=2;i<=n;i++){v[i]=0;
if((s[i]==s[i-1]&&!v[i-1]||s[i]==s[i-2]&&!v[i-2]))v[i]=1,kkr++;
}printf("%d\n",kkr);
}} | 5 |
#include <bits/stdc++.h>
using namespace std;
long long dp[1000100];
long long n, x, nm = 999999999999999999;
vector<long long> v;
bool pedal[1000100];
void xdxdxdxd(long long a) {
long long now = 0;
for (int i = 1; i <= n; ++i) now += min(dp[i] % a, a - dp[i] % a);
if (nm > now) nm = now;
}
void genprm() {
ped... | 10 |
#include <bits/stdc++.h>
using namespace std;
struct point {
int i;
int x;
int y;
};
bool isintersecting(point& p1, point& p2, point& q1, point& q2) {
return (((q1.x - p1.x) * (p2.y - p1.y) - (q1.y - p1.y) * (p2.x - p1.x)) *
((q2.x - p1.x) * (p2.y - p1.y) - (q2.y - p1.y) * (p2.x - p1.x)) <
... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int Mod = 998244353;
int dcmp(double x) {
if (fabs(x) <= 1e-9) return 0;
return x < 0 ? -1 : 1;
}
struct Point {
double x, y;
double ang;
Point() {}
Point(double x, double y) : x(x), y(y) {}
Point operator-(const Point &a) const { return Point(x - a.x, y... | 7 |
#include <bits/stdc++.h>
using namespace std;
string s1, s2;
int n;
bool iseq(int l1, int l2, int r1, int r2) {
int len = l2 - l1 + 1;
if (len % 2 == 1) {
for (int k = 0; k < len; k++) {
if (s1[k + l1] != s2[k + r1]) {
return false;
}
}
return true;
} else {
int m1 = l1 + len /... | 9 |
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, num;
bool operator<(const node &rhs) const { return x < rhs.x; }
} a[300005], b[300005], s[300005], t[300005];
struct date {
int num1, num2, d;
} ans[300005];
int n, sum, cnta, cntb, cnt;
bool vis[300005];
int main() {
scanf("%d", &n);
for (in... | 15 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
int input[100000], i, j, k, output, now, n;
while (scanf(" %d", &n) == 1) {
now = 0;
output = 0;
for (i = 0; i < n; i++) {
scanf(" %d", &input[i]);
if (input[i] > 0) now += input[i];
if (input[i] < 0) {
... | 0 |
#include <bits/stdc++.h>
const int N = 1000010;
const long long p = 1000000007;
long long f[N], a[N], b[N];
long long work(int n, int m) { return (a[n] * b[m] % p); }
long long pow(int n, int m) {
if (m == 0) return (1);
if (m == 1)
return (n);
else {
long long temp = pow(n, m / 2);
temp = temp * temp... | 22 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long po(long long x, long long y) {
if (y == 0) return 1;
long long z = po(x, y / 2);
z = (z * z) % mod;
if (y & 1) z = (z * x) % mod;
return z;
}
string s[105];
void flip(int x, int y) {
if (s[x][y] == '0')
s[x][y] = '1';
els... | 11 |
#include <bits/stdc++.h>
using namespace std;
namespace fastIO1 {
inline char read() {
static const int IN_LEN = 1000000;
static char buf[IN_LEN], *s, *t;
return (s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin),
(s == t ? -1 : *s++) : *s++);
}
template <class T>
inline void read(T &x... | 21 |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
template <class T>
T _max(T x, T y) {
return x > y ? x : y;
}
template <class T>
T _min(T x, T y) {
return x < y ? x : y;
}
template <class T>
T _abs(T x) {
return (x < 0) ? -x : x;
}
template <class T>
T _mod(T x,... | 6 |
#include <bits/stdc++.h>
using namespace std;
long long sum[100009], maxx, ans[100009];
bool use[100009];
int n, fa[100009], a[100009], order[100009];
int find(int x) {
if (fa[x] == x) return x;
fa[x] = find(fa[x]);
return fa[x];
}
void Union(int x, int y) {
int fx = find(x), fy = find(y);
fa[fy] = fx;
sum[... | 8 |
#include <bits/stdc++.h>
const int N = 1e5;
int n, m;
inline long long ABS(long long x) { return x < 0 ? -x : x; }
struct SegTree {
struct Node {
long long v, lt;
};
Node t[(N << 2) + 10];
inline void pushUp(int i) { t[i].v = t[(i << 1)].v + t[(i << 1 | 1)].v; }
inline void pushDown(int i, int l, int r) {... | 16 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T MAX(T a, T b) {
return a > b ? a : b;
}
template <class T>
T MIN(T a, T b, T c) {
return min(a, min(b, c));
}
template <class T1>
void __(T1 p) {
cout << p << endl;
}
template <class T1>
void deb(T1 p) {
cout << "Debugging: " << p << endl;
}
tem... | 8 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
const long long INF = 1e15;
long long t, x, y, k, tmp, l, r, n, m;
string str;
vector<long long> tree(4 * N, 0);
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
t = 1;
while (t--) {
cin >> n >> m;
vector<long long> arr... | 7 |
#include <bits/stdc++.h>
using namespace std;
int T;
int n, m;
char s[80][80];
int get(int k, int first) {
int ans = 0;
if (k == 1) {
for (int i = 1; i <= m; i++)
if (s[first][i] == 'A') ans++;
} else {
for (int i = 1; i <= n; i++) {
if (s[i][first] == 'A') ans++;
}
}
return ans;
}
voi... | 10 |
#include <bits/stdc++.h>
using namespace std;
const int MAXM = 1e5 + 10;
int n, m, sx, sy, ex, ey, insx[MAXM], insy[MAXM], St = 1;
long long dis[MAXM], ans;
set<pair<int, int> > Sx, Sy;
vector<pair<int, int> > Mat[MAXM];
set<pair<long long, int> > Dij;
bool se[MAXM];
void addv(int v) {
for (int i = 0; i < Mat[v].size... | 15 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
struct rge {
T b, e;
};
template <class T>
rge<T> range(T i, T j) {
return rge<T>{i, j};
}
struct debug {
template <class T>
debug& operator<<(const T&) {
return *this;
}
};
using ll = long long;
template <typename T>
void min_self(T& a, T b... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t = 1;
while (t--) {
int n;
cin >> n;
int a[n];
set<int> s;
map<int, int> hash, hash1, hash2;
for (int i = 0; i < n; i++) {
cin >> a[i];
hash1[a[i]]++;
}
... | 7 |
#include <bits/stdc++.h>
using namespace std;
set<pair<string, int>> box;
string s;
int main() {
int i, j, x, y, t, n, m, p, k;
cin >> s;
scanf("%d", &k);
n = s.length();
if (1ll * n * (n + 1) / 2 < 1ll * k) {
puts("No such line.");
return 0;
}
for (i = 0; i < n; i++) {
box.insert(make_pair(st... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
int ans[MAXN], t[MAXN];
int a[MAXN];
int main() {
int n, m;
long long sum = 0;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%... | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (i == j)
cout << k << " ";
else
cout << 0 << " ";
}
cout << endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int* l = new int[n + 1]();
int* r = new int[n + 1]();
int* c = new int[n + 1]();
int* td = new int[n + 1];
int* d = new int[n + 1];
int maxh = 0, maxi;
for (int i = 0; i < n; i++) {
cin >> td[i];
if (td[i] > maxh) {
... | 16 |
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1.01e9;
const long long infll = (long long)1.01e18;
const long double eps = 1e-9;
const long double pi = acos((long double)-1);
mt19937 mrand(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x) { return mrand() % x; }
const int mod =... | 21 |
#include <bits/stdc++.h>
using namespace std;
string a[1005], b[1005], p1, p2;
int main() {
int n, i;
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> a[0] >> b[0];
cin >> n;
cout << a[0] << " " << b[0] << endl;
p1 = a[0];
p2 = b[0];
for (i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
if (a[i] =... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 500;
const int maxm = 500000 + 10;
struct Edge {
int next, v;
Edge() {}
Edge(int next, int v) : next(next), v(v) {}
} e[maxm << 1];
int n, m, len, timer, num;
int head[maxm], cnt;
int low[maxn], dfn[maxn], belo[maxn];
bool ins... | 18 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T& res) {
res = 0;
bool bo = 0;
char c;
while (((c = getchar()) < '0' || c > '9') && c != '-')
;
if (c == '-')
bo = 1;
else
res = c - 48;
while ((c = getchar()) >= '0' && c <= '9')
res = (res << 3) + (res << ... | 18 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, k, length, c = 0, savek;
cin >> n >> m >> k;
savek = k;
length = 2;
vector<pair<long long, long long> > v;
for (long long i = 1; i <= n; i++) {
if (i % 2)
for (long long j = 1; j <= m; j++) v.push_back(make_pair(i, j));
... | 7 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> g[30005];
int vis[30005];
void euler(int u) {
if (vis[u]) return;
vis[u] = 1;
for (int v = 0; v < g[u].size(); v++) {
euler(g[u][v]);
}
printf("%d ", u);
}
int main() {
memset(vis, 0, sizeof(vis));
scanf("%d %d", &n, &m);
while (m--... | 12 |
#include <bits/stdc++.h>
using namespace std;
int dfs(set<int> s, int t) {
if (s.empty()) return 0;
if (s.size() == 1) return 1;
set<int> sd[2];
for (int si : s) sd[si >> t & 1].insert(si);
return max(dfs(sd[0], t - 1) + min((int)sd[1].size(), 1),
dfs(sd[1], t - 1) + min((int)sd[0].size(), 1));
}... | 13 |
#include <bits/stdc++.h>
using namespace std;
string arr[26];
long long check(string *arr, long long n, long long a, long long b,
long long len) {
long long wid = 1, i, j, f;
f = 1;
for (i = a - 1; i >= 0; i--) {
for (j = b; j < b + len; j++) {
if (arr[i][j] == '1') {
f = 0;
... | 7 |
#include <bits/stdc++.h>
using namespace std;
long long int ans[100001];
int main() {
long long int i, n, k, a, b;
cin >> n >> k;
ans[0] = 1ll;
for (i = 1; i <= 100000; ++i) {
ans[i] = ans[i - 1];
if (i >= k) ans[i] += ans[i - k];
if (ans[i] >= 1000000007) ans[i] -= 1000000007;
}
for (i = 1; i <... | 9 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5;
int N, M;
vector<pair<int, int>> V;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
int t;
cin >> t;
V.push_back({t, 1});
}
cin >> M;
for (int i = 0; i < M; i++) {
int t;
cin >> t;
V.push_back({t, -1});
}
sort(... | 8 |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
return n | (1LL << i);
;
}
inl... | 12 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[1000], used[100], ee[1000], br2;
vector<int> s;
bool chk(int x, int pos) {
if (x == 0) {
return true;
}
int br = 0;
bool re = 0;
while (x != 0) {
br++;
if (x % 10 != 0 && br == pos) {
re = true;
}
if (x % 10 != 0 && br != pos... | 8 |
#include <bits/stdc++.h>
using namespace std;
inline int comb(int x, int y) {
int ret = 1;
for (int i = 0; i < y; i++) ret *= x - i;
for (int i = 1; i <= y; i++) ret /= i;
return ret;
}
int main() {
int k;
cin >> k;
int n = 3;
while (comb(n + 1, 3) <= k) n++;
k -= comb(n, 3);
vector<int> vec;
for ... | 8 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2001;
int arr[MAXN][MAXN];
int d[MAXN];
int main() {
int n, q;
scanf("%d", &n);
int total = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
scanf("%d", &arr[i][j]);
if (i == j) total += (arr[i][j] * arr[i][j]) % 2;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int setBitNumber(int n) {
n |= n >> 1;
n |= n >> 2;
n |= n >> 4;
n |= n >> 8;
n |= n >> 16;
n = n + 1;
return (n >> 1);
}
int main() {
int t;
t = 1;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n + 1];
a[0] = 0;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
string s;
long long n;
const long long N = 100005;
long long tens[N], sumTens[N], pref[N], suff[N], prefSum[N], suffSum[N];
long long mulMod(long long a, long long b) {
a *= b;
a %= 1000000007;
return a;
}
long long addMod(long long a, long long b) {
long long c = (... | 9 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[200];
memset(arr, 0, sizeof(arr));
int in[5], sum = 0, ans, temp = 10000;
for (int i = 0; i < 5; i++) {
cin >> in[i];
sum += in[i];
arr[in[i]]++;
}
ans = sum;
for (int i = 0; i < 200; i++) {
if (arr[i] == 2 || arr[i] == 3)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000000;
int n, m;
struct side {
int y, next;
} e[N + 9];
int lin[N + 9], cs;
void Ins(int x, int y) {
e[++cs].y = y;
e[cs].next = lin[x];
lin[x] = cs;
}
void into() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ++i) {
int x, y;
scanf("%... | 22 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
long long sign(long long a) {
if (a > 0) return 1;
if (a < 0) return -1;
return 0;
}
int main() {
long long x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int n;
cin >> n;
long long res = 0;
for (long long i = 0; i ... | 9 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
return os << "(" << a.first << ", " << a.second << ")";
};
template <class T>
void pv(T a, T b) {
for (T i = a; i != b; ++i) cerr << *i << " ";
cerr << endl;... | 19 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
;
int t, m, n;
string s;
cin >> t;
while (t--) {
cin >> n >> m >> s;
int a[m], cnt[26];
memset(cnt, 0, sizeof(cnt));
for (long long i = 0; i < m; i++) cin >> a[i];
sort(a, a + m);
for (l... | 5 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
if (k < 25)
cout << -1;
else {
int n = 0, m = 0;
for (int i = 5; i <= sqrt(k); i++)
if (k % i == 0) {
n = i;
m = k / i;
if (m > 4) break;
}
if (m < 5)
cout << -1;
else {
... | 3 |
#include <bits/stdc++.h>
using namespace std;
char s[111];
int main() {
gets(s);
int last = 0, len = strlen(s);
for (int i = 0; i < len; i++) {
int x = s[i], now = 0;
for (int j = 7; j >= 0 && x; j--, x >>= 1) now += (1 << j) * (x & 1);
printf("%d\n", (last - now + 256) % 256);
last = now;
}
r... | 5 |
#include <bits/stdc++.h>
using namespace std;
string s;
string s2;
int P[110];
int m;
void pre(int l) {
P[1] = 0;
int k = 0;
for (int q = 2; q <= l; q++) {
while (k > 0 && s2[k + 1] != s2[q]) k = P[k];
if (s2[k + 1] == s2[q]) k++;
P[q] = k;
}
}
int solve(int max) {
int i = 2;
while (i < m) {
... | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k = 1;
cin >> n;
while (n > 3) {
for (int j = 0; j < n / 2 + n % 2; j++) {
cout << k << " ";
}
n /= 2;
k *= 2;
}
if (n == 1)
cout << k;
else if (n == 2)
cout << k << " " << 2 * k;
else if (n == 3)
cout << k... | 8 |
#include <bits/stdc++.h>
int main() {
int n, m, k, c = 0, d = 0;
scanf("%d", &n);
while (n--) {
scanf("%d%d", &m, &k);
if (m > 0)
c++;
else
d++;
}
if (c < 2 || d < 2)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 100011;
int n, m, q, c, dp[N][20], dis[N];
vector<int> a[N][20], g[N], now;
void dfs(int v, int par) {
dis[v] = dis[par] + 1;
dp[v][0] = par;
sort(a[v][0].begin(), a[v][0].end());
a[v][0].erase(unique(a[v][0].begin(), a[v][0].end()), a[v][0].end(... | 14 |
#include <bits/stdc++.h>
const int mod = 998244353;
int mul(int a, int b) { return a * (long long)b % mod; }
int ad(int a, int b) { return (a + b) % mod; }
int de(int a, int b) { return (a - b) % mod; }
int pow(int a, int b) {
int s = 1;
while (b) {
if (b & 1) s = mul(s, a);
a = mul(a, a);
b >>= 1;
}
... | 21 |
#include <bits/stdc++.h>
using namespace std;
struct node {
char ch;
int l;
};
vector<node> vc;
int leara[1200][1200], reara[1200][1200], v, w, n, m, upara[1200][1200],
nichara[1200][1200];
int cntN(int l) {
int k = v - l;
if (k < 0) return 0;
if (upara[v][w] >= k) {
return 0;
}
v = k;
return 1;... | 9 |
#include <bits/stdc++.h>
using namespace std;
int L, N, M;
bool isR[2005], isX[2005];
int c[2005], p[2005];
long long memo[2005][2005];
long long dfs(int i, int j) {
if (memo[i][j] != -1)
return memo[i][j];
else if (i == L)
return memo[i][j] = 0;
else {
long long ans = (1 << 30);
if (isX[i]) {
... | 13 |
#include <bits/stdc++.h>
int64_t solve(int64_t ts, int64_t tf, int64_t t,
const std::vector<int64_t> &v) {
if (v.empty()) return ts;
int64_t min_wait = std::numeric_limits<int64_t>::max();
int64_t res = -1;
if (v[0] > 0) {
if (ts < v[0]) return ts;
min_wait = std::max<int64_t>(0, ts - v[0]... | 13 |
#include <bits/stdc++.h>
using namespace std;
char s[1005], t[1005];
int dp[1005][1005];
struct {
int x, y;
int s;
} re[1005][1005];
int main() {
while (scanf("%s", s) == 1) {
scanf("%s", t);
memset(dp, 0, sizeof(dp));
int n = strlen(s);
int m = strlen(t);
for (int i = 0; i <= n; i++) {
... | 13 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2001010;
int n, m, i, c[N], a[N], b[N], flag[N], dp[N], cnt;
int ef(int l, int r, int x) {
int m;
while (l <= r) {
m = (l + r) >> 1;
if (a[m] > x)
r = m - 1;
else
l = m + 1;
}
return r;
}
int main() {
scanf("%d%d", &n, &m);
... | 12 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c = 1, d, i, j, k, n, m;
cin >> n >> m;
string s, ss, s1, s2;
cin >> s >> ss;
if ((n - 1) > m) {
cout << "NO" << endl;
return 0;
}
for (i = 0; i < n; i++) {
if (s[i] == '*') {
b = i;
c = 0;
break;
... | 4 |
#include <bits/stdc++.h>
using namespace std;
double mi, ho, se;
int main() {
int h, m, s, t1, t2;
scanf("%d", &h), scanf("%d", &m);
scanf("%d", &s), scanf("%d", &t1);
scanf("%d", &t2);
h *= 5;
h %= 60;
t1 *= 5;
t1 %= 60;
t2 *= 5;
t2 %= 60;
ho = h + m / 60.0 + s / 360.0;
mi = m + s / 60.0;
se ... | 6 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 50;
int n, l;
char s[maxn];
int nxt[maxn];
long long f[maxn][maxn][maxn][2];
inline void getnxt() {
for (int i = 1; i < l; ++i) {
nxt[i] = nxt[i - 1];
while (s[nxt[i]] != s[i]) {
if (!nxt[i]) break;
nxt[i] = nxt[nxt[i] - 1];
}
... | 21 |
#include <bits/stdc++.h>
using namespace std;
template <class Iter, class T>
Iter closest_value(Iter begin, Iter end, T value) {
Iter result = upper_bound(begin, end, value);
if (result != begin) {
Iter lower_result = result;
--lower_result;
if (result == end || ((value - *lower_result) < (*result - val... | 3 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
template <typename Type>
istream &operator>>(istream &in, vector<Type> &vec) {
long long n = vec.size();
for (int i = 0; i < n; i++) in >> vec[i];
return in;
}
template <typename Type>
ostream &operator<<(ostream &out, vector<Type> &vec)... | 4 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T max2(T a, T b) {
return a < b ? b : a;
}
template <class T>
T min2(T a, T b) {
return a < b ? a : b;
}
template <class T>
T max3(T a, T b, T c) {
return Max2(Max2(a, b), c);
}
template <class T>
T min3(T a, T b, T c) {
return Min2(Min2(a, b), c)... | 3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
char a[N];
char b[N];
int arr[N];
int n;
int m;
int mark[N];
bool check(int mid) {
for (int i = 1; i <= n; ++i) {
mark[i] = 1;
}
for (int i = 1; i <= mid; ++i) {
mark[arr[i]] = 0;
}
int ptr = 1;
for (int i = 1; i <= n; ++i) {
i... | 9 |
#include <bits/stdc++.h>
using namespace std;
int n, m, f[1003][1003], lx[1003][1003], ly[1003][1003], sx[1003][1003],
sy[1003][1003];
char st[1003][1003];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%s", st[i] + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
... | 11 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n, k, a[1003], r, dp[1003][1003], dpp[1003], fp;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
sort(a + 1, a + n + 1);
dpp[0] = 1;
for (int i = 1; i <= (a[n] ... | 17 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979;
const double eps = 1e-6;
const long long _INF = 1e18;
const int INF = 1e9;
const int maxn = 1000;
const int maxm = 10000000;
long long l, r;
int main() {
while (~scanf("%I64d %I64d", &l, &r)) {
long long ans = 0;
for (long long ... | 5 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000005;
const int mod = 998244353;
char str[MAXN];
int n;
int power(int a, int n) {
int ans = 1;
for (; n; n >>= 1) {
if (n & 1) ans = (long long)ans * a % mod;
a = (long long)a * a % mod;
}
return ans;
}
struct mint {
int a;
mint() { a... | 18 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
map<char, int> cont;
string s, t, p;
cin >> s >> t >> p;
int usados = 0;
for (int j = 0; j < p.size(); j++) cont[p[j]]++;
int po = 0;
string ans = "YES";
for (int j = 0; j < t.... | 5 |
#include <bits/stdc++.h>
using namespace std;
map<pair<int, int>, bool> vis;
int N;
void rec(int n, int m, int c) {
if (!n || !m) return;
int cntA = 0, cntB = 0;
if (n == 1) {
for (int i = 1; i <= m; i++) {
if (i & 1) {
cout << c + 1 << " " << (i + 1) / 2 << '\n';
} else {
cout << ... | 10 |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> sz;
vector<long long> price;
int main() {
long long tmp;
long long ans = 10e9;
cin >> n;
for (long long i = 0; i < n; ++i) {
cin >> tmp;
sz.push_back(tmp);
}
for (long long i = 0; i < n; ++i) {
cin >> tmp;
price.pus... | 6 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int w = 0, x = 0;
char c = getchar();
while (!isdigit(c)) w |= c == '-', c = getchar();
while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar();
return w ? -x : x;
}
namespace star {
const int maxn = 605, maxm = 1e5 + 10;
int n, m, tot, mod, a[... | 21 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T mulmod(T a, T b) {
if (b == 0) return 0;
if (b == 1) return a;
T x = mulmod(a, b >> 1);
x = (x + x) % 1000000007;
if (b & 1) x = (x + a) % 1000000007;
return x;
}
template <class T>
T larger(T a, T b) {
return (a > b ? a : b);
}
template <... | 8 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, m, r = 0, c = 0, i;
cin >> n >> m;
long p[n];
for (i = 0; i < n; ++i) cin >> p[i];
sort(p, p + n);
for (i = n - 1; i > -1; --i) {
if (m % p[i] == 0) break;
}
cout << m / p[i];
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
bool isPrime(int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
void printPrime(in... | 10 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
using namespace std;
using ll = long long int;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, s, q;
cin >> n >> s >> q;
vector<bitset<1000>> B(30);
for (int i ... | 18 |
#include <bits/stdc++.h>
using namespace std;
int n, a[3];
int main() {
scanf("%d%d%d%d", &n, &a[0], &a[1], &a[2]);
sort(a, a + 3);
int i, j;
i = 0;
j = 0;
int ans = 0;
for (i = 0; i * a[2] <= n; i++)
for (j = 0; (i * a[2] + j * a[1]) <= n; j++) {
int k = n - i * a[2] - j * a[1];
if (k >= ... | 5 |
#include <bits/stdc++.h>
using namespace std;
inline int read(int& a) { return scanf("%d", &a); }
inline int writeln(int a, int b) { return printf("%d %d\n", a, b); }
int n, k, x;
int a[1 << 17];
int main() {
read(n);
read(k);
read(x);
for (int i = 0; i < n; ++i) read(a[i]);
k = k % 64;
for (int i = 0; i < ... | 10 |
#include <bits/stdc++.h>
using namespace std;
int A[111111], n, B[111111];
int main() {
int i, ma = -1;
cin >> n;
for (i = 0; i < n; i++) cin >> A[i];
for (i = n - 1; i >= 0; i--) {
if (A[i] > ma) {
ma = A[i];
B[i] = 0;
} else {
B[i] = ma - A[i] + 1;
}
}
for (i = 0; i < n; i++)... | 3 |
#include <bits/stdc++.h>
using namespace std;
int tree[100001 * 2], seg[100001 * 3], top[100001 * 3], dep[100001 * 3],
size[100001 * 3], mson[100001 * 3], father[100001 * 3];
int cnt, from[100001 * 3], to[100001 * 3], head[100001 * 3], Next[100001 * 3];
int n, m, root, x, y, segcnt;
int g[100001 * 3], a[100001 * 3]... | 17 |
#include <bits/stdc++.h>
using namespace std;
char s[100555];
int main() {
int x, y, x0, y0;
scanf("%d %d %d %d", &x, &y, &x0, &y0);
scanf("%s", s);
int size = strlen(s);
int count = 1;
set<pair<int, int> > vis;
vis.insert(make_pair(x0, y0));
printf("1 ");
for (int i = 0; i < size - 1; i++) {
;
... | 8 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, a, b;
cin >> n >> a >> b;
if (2 * a > b) {
if (n & 1)
cout << b * (n / 2) + a << '\n';
else
cout << b * (n / 2) << '\n';
} else {
cout << a * n << '\n';
}
}
int main() {
ios::sync_with_stdio(false), cin.tie(0),... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 17;
const int MOD = 1e9 + 7;
int a[MAXN], b[MAXN];
int main(int argc, char const *argv[]) {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
a[i] = a[i - 1];
b[i] = b[i - 1];
int tmp;
cin >> tmp;
if (tmp == 1)
a[i]++;
... | 11 |
#include <bits/stdc++.h>
using namespace std;
int n, L;
char s[21];
int digit[200010], F[21][1 << 20];
void read() {
static char s[21];
for (int i = 1; i <= n; i++) {
scanf("%s", s + 1);
L = strlen(s + 1);
for (int j = 1; j <= L; j++) digit[i] = digit[i] * 2 + s[j] - '0';
}
}
void min(int &a, int b) {... | 20 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.