text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
const double euler_r = 0.57721566490153286060651209;
const double pi = 3.141592653589793238462643383279;
const int inf = ~0U >> 1;
const int MOD = int(1e9) + 7;
const double EPS = 1e-6;
char s1[1000010], s2[1000010];
int main() {
int i, l1, l2, j;
scanf("%s%s", s1, s2);
l2 = strlen(s2);
l1 = l2 + 1;
int p, s;
p = s = 0;
while (p < l2) {
if (s1[p] != s2[p]) break;
p++;
}
for (i = l1 - 1, j = l2 - 1; i >= 0 && j >= 0; i--, j--) {
if (s1[i] != s2[j])
break;
else
s++;
}
if (p + s + 1 < l1) {
cout << "0" << endl;
} else {
if (p + s + 1 == l1)
printf("1\n%d\n", p + 1);
else {
int L, R;
L = max(1, l1 - s);
R = min(l1, p + 1);
cout << R - L + 1 << endl;
for (i = (L); i <= (R); i++) cout << i << " ";
cout << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<long long int> v;
long long int i;
long long int n = t.size();
long long int j = 0;
long long int cnt = 0;
long long int x;
if (n == 1) {
if (s[0] != t[0] && s[1] != t[0]) {
cout << 0 << endl;
return 0;
}
}
for (i = 0; i < n && j <= n; i++, j++) {
if (s[j] == t[i]) {
continue;
} else {
cnt++;
x = j;
j++;
}
}
if (cnt == 0) {
x = n;
v.push_back(x);
for (i = n - 1; i >= 0; i--) {
if (s[i] == s[x]) {
v.push_back(i);
} else {
break;
}
}
} else if (cnt == 1) {
v.push_back(x);
for (i = x - 1; i >= 0; i--) {
if (s[i] == s[x]) {
v.push_back(i);
} else {
break;
}
}
for (i = x + 1; i <= n; i++) {
if (s[i] == s[x]) {
v.push_back(i);
} else {
break;
}
}
} else {
cout << 0 << endl;
return 0;
}
sort(v.begin(), v.end());
;
cout << v.size() << "\n";
for (i = 0; i < v.size(); i++) {
cout << v[i] + 1 << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
string s1, s2;
cin >> s1 >> s2;
if (s1.size() != s2.size() + 1) {
printf("0\n");
return 0;
}
int l = 0, r = s1.size() - 1;
for (int i = 0; i < s1.size(); i++) {
if (s1[i] == s2[i]) {
l++;
} else {
break;
}
}
for (int i = s1.size() - 1; i >= 0; i--) {
if (s1[i] == s2[i - 1]) {
r--;
} else {
break;
}
}
if (l < r) {
printf("0\n");
} else {
int begin = min(r, l);
int end = max(r, l);
printf("%d\n", end - begin + 1);
for (int i = begin; i <= end; i++) {
printf("%d ", i + 1);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[1000005];
char b[1000005];
int len;
int out[1000005];
bool can(int i) {
while (i < len) {
if (a[i + 1] != b[i]) {
return false;
}
i++;
}
return true;
}
int main() {
scanf("%s", a);
scanf("%s", b);
len = strlen(b);
for (int i = 0; i <= len; i++) {
if (a[i] != b[i]) {
if (can(i)) {
int io = 0;
for (int j = i; j <= len; j++) {
if (a[j] == a[i]) {
out[io++] = j + 1;
} else {
break;
}
}
for (int j = i - 1; j >= 0; j--) {
if (a[j] == a[i]) {
out[io++] = j + 1;
} else {
break;
}
}
sort(out, out + io);
printf("%d\n", io);
for (int j = 0; j < io - 1; j++) {
printf("%d ", out[j]);
}
printf("%d\n", out[io - 1]);
return 0;
} else {
puts("0");
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> v[301], vv, v1;
long long a, b, c[1234567], c1[1234][1234], e, d[1234567], i, j, n, x, y, l, r,
k;
string s, s1;
long long used[301];
long long ans, sum;
bool ok[123];
set<long long> se;
int main() {
string s, s1;
cin >> s >> s1;
i = 0;
while (s[i] == s1[i]) i++;
j = s1.size() - 1;
while (s[j + 1] == s1[j]) j--;
if (i > j)
cout << i - j << '\n';
else
cout << 0 << '\n';
for (int k = j + 1; k <= i; k++) cout << k + 1 << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
string s1, s2;
vector<int> pos;
long long hash1[1001000], hash2, pot[1001000], inverse;
long long fast_pow(long long base, long long expo) {
if (expo < 1) return 1;
long long result = fast_pow(base, expo / 2);
result *= result;
result %= 1000000007;
if (expo % 2 != 0) result *= base;
return result % 1000000007;
}
void calc_hash() {
long long aux = 0;
for (int i = 0; i < s1.size(); i++) {
aux += s1[i] * pot[i];
aux %= 1000000007;
hash1[i] = aux;
}
hash2 = 0;
for (int i = 0; i < s2.size(); i++) hash2 += s2[i] * pot[i];
hash2 %= 1000000007;
}
int main() {
cin >> s1 >> s2;
pot[0] = 1;
for (int i = 1; i < 1001000; i++) {
pot[i] = pot[i - 1] * 41;
pot[i] %= 1000000007;
}
calc_hash();
inverse = fast_pow(41, 1000000007 - 2);
for (int i = 0; i < s1.size(); i++) {
long long aux = 0;
if (i > 0) aux += hash1[i - 1];
if (i < s1.size() - 1)
aux += ((((hash1[s1.size() - 1] - hash1[i]) * inverse) % 1000000007) +
1000000007) %
1000000007;
aux %= 1000000007;
if (aux == hash2) pos.push_back(i + 1);
}
printf("%d\n", pos.size());
for (int i = 0; i < pos.size(); i++) {
if (i > 0) printf(" ");
printf("%d", pos[i]);
}
if (pos.size() > 0) printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long h1[1000010];
long long p[1000010];
int main() {
string s1, s2;
cin >> s1 >> s2;
p[0] = 1;
for (int i = 1; i <= s1.length() + 5; ++i) p[i] = p[i - 1] * 31;
h1[0] = 0;
for (int i = 1; i <= s1.size(); ++i)
h1[i] = h1[i - 1] + p[i - 1] * (s1[i - 1] - 'a' + 1);
long long h2 = 0;
for (int i = 1; i <= s2.size(); ++i) h2 += p[i - 1] * (s2[i - 1] - 'a' + 1);
vector<int> res;
for (int i = 1; i <= s1.size(); ++i) {
long long hs1 = h1[i - 1] * p[1] + h1[s1.size()] - h1[i];
if (hs1 == h2 * p[1]) res.push_back(i);
}
cout << res.size() << endl;
for (int i = 0; i < res.size(); ++i) cout << res[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long int has[1000001];
unsigned long long int has1[1000001], po[1000001];
unsigned long long int gethas(int L, int R) {
return (has[R] - (has[L - 1] * po[R - L + 1]));
}
int main() {
string s, s1;
cin >> s >> s1;
po[0] = 1;
for (int i = 1; i <= (int)(s.size()); i++) {
has[i] = has[i - 1] * 31 + (s[i - 1] - 'a' + 1);
po[i] = po[i - 1] * 31;
}
int c = 0;
for (int i = 1; i <= (int)(s1.size()); i++)
has1[i] = has1[i - 1] * 31 + (s1[i - 1] - 'a' + 1);
unsigned long long int z = has1[s.size() - 1], p2;
vector<int> v;
for (int i = 1; i <= s.size(); i++) {
unsigned long long int p = has[i - 1];
p2 = 0;
if (i + 1 <= s.size()) {
p2 = gethas(i + 1, s.size());
}
unsigned long long int zz = po[s.size() - i];
p *= zz;
if (p + p2 == z) {
v.push_back(i);
c++;
}
}
cout << c << endl;
for (auto i : v) cout << i << " ";
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
struct hs {
public:
static const unsigned HBASE = 1000013;
static unsigned HPOW[1000010];
static void init() {
HPOW[0] = 1;
for (int i = 1; i < 1000010; i++) HPOW[i] = HPOW[i - 1] * HBASE;
}
vector<unsigned> h;
hs(const string &s) : h(((int)(s).size()) + 1, 0) {
for (int i = 0; i < ((int)(s).size()); i++) h[i + 1] = h[i] * HBASE + s[i];
}
unsigned geth(int a, int b) { return h[b] - h[a] * HPOW[b - a]; }
};
unsigned hs::HPOW[1000010];
int main() {
hs::init();
string a, b;
cin >> a >> b;
hs ha(a), hb(b);
vector<int> v;
for (int i = 0; i < ((int)(a).size()); i++)
if (ha.geth(0, i) == hb.geth(0, i) &&
ha.geth(i + 1, ((int)(a).size())) == hb.geth(i, ((int)(b).size())))
v.push_back(i);
cout << ((int)(v).size()) << endl;
for (int i = 0; i < ((int)(v).size()); i++) cout << v[i] + 1 << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
int l1 = s1.length();
int l2 = s2.length();
int ind = -1;
for (int i = 0; i < l2; i++) {
if (s1[i] != s2[i]) {
ind = i;
break;
}
}
if (ind == -1) {
int i = l2;
set<int> s;
s.insert(l2);
while (i > 0) {
if (s1[i] == s1[i - 1]) {
s.insert(i - 1);
i--;
} else {
break;
}
}
cout << s.size() << endl;
for (set<int>::iterator it = s.begin(); it != s.end(); it++)
cout << *it + 1 << " ";
return 0;
}
for (int i = ind; i < l2; i++) {
if (s1[i + 1] != s2[i]) {
cout << 0;
return 0;
}
}
int i = ind;
int count = 0;
set<int> s;
s.insert(i);
while (i > 0) {
if (s1[i - 1] == s1[i]) {
count++;
s.insert(i - 1);
i--;
} else {
break;
}
}
while (i < l2) {
if (s1[i] == s1[i + 1]) {
count++;
s.insert(i + 1);
i++;
} else {
break;
}
}
cout << s.size() << endl;
for (set<int>::iterator it = s.begin(); it != s.end(); it++)
cout << *it + 1 << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
string s, t;
int n, m;
vector<int> res;
long long POW[1000010], hashS[1000010];
int main() {
ios::sync_with_stdio(0);
cin >> s >> t;
POW[0] = 1;
n = s.length();
m = t.length();
s = " " + s;
t = " " + t;
long long hashT = 0;
for (int i = (1), _b = (1000000); i <= _b; i++)
POW[i] = POW[i - 1] * 26 % 1000000007LL;
for (int i = (1), _b = (n); i <= _b; i++)
hashS[i] = (hashS[i - 1] * 26 + s[i] - 'a') % 1000000007LL;
for (int i = (1), _b = (m); i <= _b; i++)
hashT = (hashT * 26 + t[i] - 'a') % 1000000007LL;
for (int i = (1), _b = (n); i <= _b; i++) {
long long remain = n - i;
long long hashNow =
(hashS[i - 1] * POW[remain] % 1000000007LL +
((hashS[n] - hashS[i] * POW[remain] % 1000000007LL + 1000000007LL) %
1000000007LL)) %
1000000007LL;
if (hashNow == hashT) res.push_back(i);
}
cout << res.size() << endl;
for (vector<int>::iterator it = res.begin(); it != res.end(); it++)
cout << *it << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b, la, lb, ra, rb;
int m, n, l[1000002], r[1000002], sl = 0;
int main() {
getline(cin, a);
getline(cin, b);
m = a.size();
n = b.size();
l[0] = 1;
for (int i = 0; i < n; i++) l[i + 1] = (l[i] * (a[i] == b[i]));
r[n] = 1;
for (int i = n - 1; i >= 0; i--) r[i] = (r[i + 1] * (a[i + 1] == b[i]));
for (int i = 0; i <= n; i++)
if ((l[i] == 1) && (r[i] == 1)) sl++;
cout << sl << endl;
for (int i = 0; i <= n; i++)
if ((l[i] == 1) && (r[i] == 1)) cout << i + 1 << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[10000000];
int main() {
long long n, i, j, m, l, r, cnt = 0;
string s, s2, s3 = "", s4 = "", s5 = "";
cin >> s >> s2;
n = s.size();
for (i = 0; i < n - 1; i++) {
if (s[i] == s2[i])
s3 += s[i];
else
break;
}
for (i = n - 1; i > 0; i--) {
if (s[i] == s2[i - 1])
s4 += s[i];
else
break;
}
l = s3.size();
r = s4.size();
if (l + 1 < n - r)
cout << "0" << endl;
else {
s5 = s5 + s[l];
cnt = 0;
for (i = l; i >= 0; i--) {
if (s5[0] == s[i]) {
a[cnt] = i + 1;
++cnt;
} else
break;
}
for (i = l + 1; i < n; i++) {
if (s5[0] == s[i]) {
a[cnt] = i + 1;
++cnt;
} else
break;
}
sort(a, a + cnt);
cout << cnt << endl;
for (i = 0; i < cnt; i++) {
cout << a[i] << " ";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int const maxn = 1e6 + 10;
const int INF = 0x3f3f3f3f;
const long long INFL = 0x3f3f3f3f3f3f3f3f;
inline int lc(int x) { return x << 1; }
inline int rc(int x) { return x << 1 | 1; }
char s1[maxn], s2[maxn];
long long hash1[maxn], hash2[maxn];
long long p1[maxn], p2[maxn];
int base = 131;
int main(void) {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> s1 + 1;
cin >> s2 + 1;
int len1 = strlen(s1 + 1);
int len2 = strlen(s2 + 1);
p1[0] = 1;
for (int i = 1; i <= len1; i++) {
hash1[i] = hash1[i - 1] * base + s1[i] - 'a' + 1;
p1[i] = p1[i - 1] * base;
}
for (int i = 1; i <= len2; i++) {
hash2[i] = (hash2[i - 1] * base + s2[i] - 'a' + 1);
}
vector<int> ans;
auto has1 = hash2[len2];
p2[len1] = s1[len1] - 'a' + 1;
for (int i = len1 - 1; i >= 1; i--) {
p2[i] = p2[i + 1] + p1[len1 - i] * (s1[i] - 'a' + 1);
}
for (int i = 1; i <= len1; i++) {
auto temp = hash1[i - 1] * p1[len1 - i] + p2[i + 1];
if (temp == has1) {
ans.emplace_back(i);
}
}
cout << ans.size() << endl;
for (int &x : ans) {
cout << x << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
string sep;
for (const auto &x : v) os << sep << x, sep = ", ";
return os << '}';
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
os << '{';
string sep;
for (const auto &x : v) os << sep << x, sep = ", ";
return os << '}';
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
os << '{';
string sep;
for (const auto &x : v) os << sep << x, sep = ", ";
return os << '}';
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << ' ' << H;
dbg_out(T...);
}
long long ppow[(long long)(1e6) + 88];
long long pinv[(long long)(1e6) + 88];
long long H[(long long)(1e6) + 88];
long long power(long long b, long long p) {
long long r = 1ll;
b = b % (long long)(1e9 + 7);
while (p) {
if (p & 1) r = (r * b) % (long long)(1e9 + 7);
b = (b * b) % (long long)(1e9 + 7);
p >>= 1;
}
return r;
}
void pre() {
ppow[0] = pinv[0] = 1;
for (int i = 1; i < (long long)(1e6); i++) {
ppow[i] = (ppow[i - 1] * 39) % (long long)(1e9 + 7);
pinv[i] = power(ppow[i], (long long)(1e9 + 7) - 2);
}
}
long long getHash(string &s) {
long long h = 0;
for (int i = 0; i < s.size(); i++) {
h = (h + (s[i] - 'a' + 1) * ppow[i]) % (long long)(1e9 + 7);
}
return h;
}
void getHashTable(string &s) {
H[0] = 0;
for (int i = 0; i < s.size(); i++) {
H[i + 1] = (H[i] + (s[i] - 'a' + 1) * ppow[i]) % (long long)(1e9 + 7);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string a, b;
cin >> a >> b;
pre();
getHashTable(a);
long long h = getHash(b);
vector<int> r;
for (int i = 0; i < a.size(); i++) {
long long x = (H[i] + ((H[a.size()] - H[i + 1] + (long long)(1e9 + 7)) %
(long long)(1e9 + 7) * pinv[1]) %
(long long)(1e9 + 7)) %
(long long)(1e9 + 7);
if (x == h) r.push_back(i + 1);
}
if (r.size() == 0)
cout << 0 << endl;
else {
cout << r.size() << endl;
for (int x : r) cout << x << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
int n = s2.length();
int count = 0;
int pre = 0;
int suf = 0;
for (int i = 0; i <= n; i++) {
if (s1[i] == s2[i]) {
pre++;
} else
break;
}
for (int i = n - 1; i >= 0; i--) {
if (s1[i + 1] == s2[i]) {
suf++;
} else
break;
}
if (suf + pre < n) {
cout << "0" << endl;
return 0;
} else {
for (int i = max(n - suf + 1, 1); i <= min(pre + 1, n + 1); i++) {
count++;
}
cout << count << endl;
for (int i = max(n - suf + 1, 1); i <= min(pre + 1, n + 1); i++) {
cout << i << " ";
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1;
cin >> s2;
vector<int> res;
for (int i = 0; i < s1.size(); ++i) {
if (s1[i] != s2[i]) {
string s3 = s1.substr(0, i) + s1.substr(i + 1, s1.size() - i);
if (s3 != s2) break;
char c = s1[i];
while (s1[i] == c) {
res.push_back(i + 1);
--i;
}
break;
}
}
cout << res.size() << endl;
for (int i = res.size() - 1; i >= 0; --i) cout << res[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s01[1000002];
char s02[1000002];
int main() {
scanf("%s", &s01);
scanf("%s", &s02);
long long te = clock();
int n = strlen(s02);
int l = n - 1;
for (int i = 0; i < n; i++) {
if (s01[i] != s02[i]) {
l = i - 1;
break;
}
}
int r = 0;
for (int i = n - 1; i >= 0; i--) {
if (s01[i + 1] != s02[i]) {
r = i + 1;
break;
}
}
int ans = l + 2 - r;
if (ans <= 0) {
printf("0\n");
return 0;
}
printf("%d\n", ans);
for (int i = r; i <= l + 1; i++) {
printf("%d%c", i + 1, i == l + 1 ? '\n' : ' ');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-9;
const int maxn = 2200000;
char s[maxn];
char t[maxn];
char q[maxn];
int p[maxn];
int rp[maxn];
void calcPrefix(int *p, char *s) {
int n = strlen(s);
p[0] = -1;
for (int i = 1; i < n; ++i) {
int r = p[i - 1];
while (r >= 0 && s[i] != s[r + 1]) r = p[r];
if (s[i] == s[r + 1]) r++;
p[i] = r;
}
}
int main() {
scanf("%s", s);
scanf("%s", t);
int n = strlen(s);
int m = strlen(t);
for (int i = 0; i < m; ++i) q[i] = t[i];
q[m] = '$';
for (int i = 0; i < n; ++i) q[i + m + 1] = s[i];
q[n + m + 1] = 0;
calcPrefix(p, q);
int len = n + m + 1;
for (int i = 0; i < m; ++i) q[i] = t[m - 1 - i];
q[m] = '$';
for (int i = 0; i < n; ++i) q[i + m + 1] = s[n - 1 - i];
q[n + m + 1] = 0;
calcPrefix(rp, q);
vector<int> ans;
for (int i = 0; i < n; ++i) {
int left = p[m + i] + 1;
int right = rp[len - i - 2] + 1;
if (left + right == m) ans.push_back(i + 1);
}
printf("%d\n", (int)ans.size());
if (ans.size()) {
for (int i = 0; i < ans.size(); ++i) {
if (i) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt1[30];
int cnt2[30];
int main() {
int i, j, k, l, m, n;
string s, t;
cin >> s;
cin >> t;
if (s == t) return cout << 0 << endl, 0;
for (i = 0; i < s.size(); i++) cnt1[s[i] - 'a']++;
for (i = 0; i < t.size(); i++) cnt2[t[i] - 'a']++;
vector<int> ans;
bool ok = true;
char ch = '&';
for (i = 0; i < 26; i++) {
if (cnt2[i] < cnt1[i]) {
if (ch == '&')
ch = char('a' + i);
else {
ok = false;
break;
}
}
}
if (ok)
for (i = 0; i < 26; i++) {
if (i == int(ch - 'a')) {
if (cnt1[i] - 1 == cnt2[i])
continue;
else {
ok = false;
break;
}
} else {
if (cnt1[i] != cnt2[i]) {
ok = false;
break;
}
}
}
if (!ok) {
cout << 0 << endl;
} else {
for (i = 0; i < s.size(); i++) {
if (s[i] == ch && i == s.size() - 1) {
while (s[i] == ch && i >= 0) {
ans.push_back(i + 1);
i--;
}
break;
}
if (s[i] != t[i]) {
j = i - 1;
while (s[j] == ch && j >= 0) {
ans.push_back(j + 1);
j--;
}
while (s[i] == ch && i < s.size()) {
ans.push_back(i + 1);
i++;
}
break;
}
}
sort(ans.begin(), ans.end());
cout << ans.size() << endl;
for (auto x : ans) cout << x << " ";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int B = 257;
char s[1000100];
char t[1000100];
int n;
int m;
unsigned long long int hash1[1000100];
unsigned long long int hash2[1000100];
struct resp {
unsigned long long int count;
unsigned long long int indices[1000100];
} indice;
long long int expBinaria(long long int a, long long int b) {
long long int res = 1;
while (b) {
if (b % 2) res = res * a;
b = b / 2;
a = a * a;
}
return res;
}
void armaHashes() {
hash1[0] = 0;
for (int i = 1; i <= n; i++) {
hash1[i] = hash1[i - 1] * B + s[i - 1];
}
hash2[0] = 0;
for (int i = 1; i <= m; i++) {
hash2[i] = hash2[i - 1] * B + t[i - 1];
}
}
long long int h_1(int i, int j) {
return hash1[j] - hash1[i - 1] * expBinaria(B, j - i + 1);
}
long long int h_2(int i, int j) {
return hash2[j] - hash2[i - 1] * expBinaria(B, j - i + 1);
}
void solve() {
long long int cuenta = 0;
if (h_1(2, n) == h_2(1, m)) {
indice.indices[cuenta] = 1;
cuenta++;
}
for (int i = 2; i < n; i++) {
if (h_1(1, i - 1) == h_2(1, i - 1) && h_1(i + 1, n) == h_2(i, m)) {
indice.indices[cuenta] = i;
cuenta++;
}
}
if (h_1(1, n - 1) == h_2(1, m)) {
indice.indices[cuenta] = n;
cuenta++;
}
indice.count = cuenta;
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> s;
cin >> t;
n = strlen(s);
m = strlen(t);
armaHashes();
solve();
cout << indice.count;
cout << "\n";
for (int i = 0; i < indice.count; i++) {
cout << indice.indices[i];
cout << "\t";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007ll;
const long long p = 29ll;
long long pow_table[1000005];
char a[1000005];
char b[1000005];
int n, m;
long long pow(long long a, int x) { return pow_table[x]; }
long long lnk(long long x, long long y, int yl) {
long long x2 = x * pow(p, yl);
x2 %= mod;
return (x2 + y) % mod;
}
vector<int> ans;
int main() {
pow_table[0] = 1ll;
for (int i = 1; i <= 1000002; i++) {
pow_table[i] = pow_table[i - 1] * p;
pow_table[i] %= mod;
}
scanf("%s%s", a, b);
n = strlen(a);
m = strlen(b);
for (int i = 0; i < n; i++) {
a[i] -= 'a';
}
for (int i = 0; i < m; i++) {
b[i] -= 'a';
}
long long hashb = 0;
for (int i = 0; i < m; i++) {
hashb *= p;
hashb += b[i];
hashb %= mod;
}
long long hasha1 = 0, hasha2 = 0;
for (int i = 1; i < n; i++) {
hasha2 *= p;
hasha2 += a[i];
hasha2 %= mod;
}
if (lnk(hasha1, hasha2, n - 1) == hashb) {
ans.push_back(1);
}
int axb = 1;
while (1) {
axb += axb;
if (axb > 1e8) {
break;
}
}
for (int i = 1; i < n; i++) {
hasha1 *= p;
hasha1 += a[i - 1];
hasha1 %= mod;
hasha2 += mod;
hasha2 -= (pow(p, n - i - 1) * a[i]) % mod;
hasha2 %= mod;
if (lnk(hasha1, hasha2, n - i - 1) == hashb) {
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
if (!ans.size()) {
return 0;
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << ' ';
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const int maxn = 1000010;
const long long mod = 1e9 + 7;
char str1[maxn], str2[maxn];
int ans[maxn];
long long L1[maxn], R1[maxn], L2[maxn], R2[maxn];
int main() {
while (scanf("%s", str1 + 1) != -1) {
scanf("%s", str2 + 1);
int len1 = strlen(str1 + 1);
int len2 = strlen(str2 + 1);
if (len1 - 1 != len2) {
printf("0\n");
continue;
}
L1[0] = 0;
L2[0] = 0;
R1[len1 + 1] = 0;
R2[len2 + 1] = 0;
for (int i = 1; i <= len1; i++) L1[i] = (L1[i - 1] * 26 + str1[i]) % mod;
for (int i = len1; i >= 1; i--) R1[i] = (R1[i + 1] * 26 + str1[i]) % mod;
for (int i = 1; i <= len2; i++) L2[i] = (L2[i - 1] * 26 + str2[i]) % mod;
for (int i = len2; i >= 1; i--) R2[i] = (R2[i + 1] * 26 + str2[i]) % mod;
int len = 0;
for (int i = 1; i <= len1; i++) {
if (L1[i - 1] == L2[i - 1] && R1[i + 1] == R2[i]) ans[len++] = i;
}
printf("%d\n", len);
for (int i = 0; i < len; i++) {
if (i == len - 1)
printf("%d\n", ans[i]);
else
printf("%d ", ans[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char* argv[]) {
ios::sync_with_stdio(0);
cin.tie(0);
string s, d, c;
int begin = 0, end;
getline(cin, s);
getline(cin, d);
c = s;
for (int i = 0; i < s.length(); i++) {
if (s[i] != d[i]) {
begin = i;
s.erase(i, 1);
if (s.compare(d) != 0) {
cout << 0;
return 0;
}
while (c[i] == c[i - 1]) {
i--;
}
begin = i;
while (c[i] == c[i + 1]) {
i++;
}
if (i == begin) {
cout << 1 << "\n" << i + 1;
} else {
begin++;
i++;
cout << i - begin + 1 << "\n";
for (begin; begin <= i; begin++) {
cout << begin << " ";
}
}
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000010], c[1000010];
int r, l;
int main() {
scanf("%s %s", &s, &c);
for (r = 0; s[r] == c[r];) r++;
for (l = strlen(c); l >= 0 && c[l] == s[l + 1];) l--;
if (r > l)
printf("%d\n", r - l);
else
printf("0");
for (int i = l + 1; i <= r; i++) printf("%d ", i + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
priority_queue<long long> pq;
long long i, j;
char ch;
string a, b;
int main() {
pq = priority_queue<long long>();
long long c = 0;
cin >> a >> b;
for (i = 0; i < a.size(); i++) {
if (a[i] != b[i]) {
ch = a[i];
long long p = i, x = i;
for (j = i - 1; j >= 0; j--) {
if (a[j] == ch) {
if (x - j == 1) {
x = j;
pq.push((j + 1) * -1);
}
}
}
for (j = i; j < a.size(); j++) {
if (a[j] == ch) {
if (pq.size() == 0 || j - p == 1 || j - p == 0) {
p = j;
pq.push((j + 1) * -1);
}
}
}
break;
}
}
long long j = 0;
for (i = 0; i < a.size(); i++) {
if (a[i] != b[j]) {
c++;
continue;
} else {
j++;
}
}
if (c > 1)
cout << 0 << endl;
else {
cout << pq.size() << endl;
while (!pq.empty()) {
cout << pq.top() * -1;
pq.pop();
if (pq.empty())
cout << endl;
else
cout << " ";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MN = 1000 * 1000 + 10;
long long p_pow[MN], hash1[MN], hash2[MN], p = 31;
vector<int> ans;
string s1, s2;
bool is_eq(int i, int j, int len) {
long long x = hash1[i + len - 1];
if (i) x -= hash1[i - 1];
long long y = hash2[j + len - 1];
if (j) y -= hash1[j - 1];
if (i > j)
y *= p_pow[i - j];
else if (i < j)
x *= p_pow[j - i];
return x == y;
}
int main() {
cin >> s1 >> s2;
p_pow[0] = 1;
for (int i = 1; i < MN; i++) p_pow[i] = p_pow[i - 1] * p;
for (int i = 0; i < s1.size(); i++) {
hash1[i] = (s1[i] - 'a' + 1ll) * p_pow[i];
if (i) hash1[i] += hash1[i - 1];
}
for (int i = 0; i < s2.size(); i++) {
hash2[i] = (s2[i] - 'a' + 1ll) * p_pow[i];
if (i) hash2[i] += hash2[i - 1];
}
for (int i = 0; i < s1.size(); i++) {
if (!i) {
if (is_eq(1, 0, s2.size())) ans.push_back(i + 1);
} else if (i == s1.size() - 1) {
if (is_eq(0, 0, s2.size())) ans.push_back(i + 1);
} else if (is_eq(0, 0, i) && is_eq(i + 1, i, s2.size() - i))
ans.push_back(i + 1);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100001;
const int M = 1000000007;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
string s, t;
cin >> s >> t;
int a = -1, b = -1;
for (int i = 0; i < t.size(); i++) {
if (s[i] != t[i]) {
a = i;
break;
}
}
for (int i = s.size() - 1; i >= 1; i--) {
if (s[i] != t[i - 1]) {
b = i - 1;
break;
}
}
set<int> ans;
if (a == -1 && b == -1) {
for (int i = 1; i <= s.size(); i++) {
ans.insert(i);
}
} else if (a == -1 || b == -1) {
if (a == -1) {
for (int i = b + 2; i <= s.size(); i++) {
ans.insert(i);
}
} else {
for (int i = a + 1; i >= 1; i--) {
ans.insert(i);
}
}
} else {
if (a <= b) {
cout << 0 << '\n';
return 0;
} else {
for (int i = b + 2; i < a + 2; i++) {
ans.insert(i);
}
}
}
cout << ans.size() << '\n';
for (int c : ans) cout << c << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
void Weapons19() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int32_t main() {
Weapons19();
string a, b;
cin >> a >> b;
vector<long long> v;
long long i;
for (i = 0; i < b.size(); i++) {
if (a[i] != b[i]) {
for (long long j = i; j < b.size(); j++) {
if (a[j + 1] != b[j]) {
cout << 0;
return 0;
}
}
break;
}
}
if (i == b.size()) {
char k = a[a.size() - 1];
v.push_back(a.size() - 1);
for (long long i = a.size() - 2; i >= 0; i--) {
if (a[i] == k)
v.push_back(i);
else
break;
}
sort(v.begin(), v.end());
cout << v.size() << "\n";
for (auto a : v) cout << a + 1 << " ";
} else {
long long x = i - 1;
v.push_back(i);
char k = a[i];
while (x >= 0) {
if (a[x] == k)
v.push_back(x);
else
break;
x--;
}
x = i + 1;
while (x < a.size() - 1) {
if (a[x] == k)
v.push_back(x);
else
break;
x++;
}
sort(v.begin(), v.end());
cout << v.size() << "\n";
for (auto a : v) cout << a + 1 << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2, s;
int n, i, k, j, bo = 0;
vector<int> res;
getline(cin, s1);
getline(cin, s2);
n = s1.length();
j = 0;
for (i = 0; i < n; i++) {
if (s1[i] == s2[j]) {
j++;
continue;
}
if (bo) {
res.clear();
break;
}
if (s1[i + 1] == s2[j]) {
bo = 1;
k = i;
while (s1[k] == s1[i] && k >= 0) res.push_back(k + 1), k--;
} else {
res.clear();
break;
}
}
sort(res.begin(), res.end());
cout << res.size() << endl;
for (i = 0; i < res.size(); i++) cout << res[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
char s1[MAXN], s2[MAXN];
int l, r;
signed main() {
scanf("%s %s", s1, s2);
register int i;
l = strlen(s2);
while (s1[r] == s2[r]) ++r;
while (s1[l + 1] == s2[l] && l >= 0) --l;
printf("%d\n", r > l ? r - l : 0);
for (i = l + 1; i <= r; i++) printf("%d ", i + 1);
return puts(""), 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[2][1000010];
long long h[2];
stack<int> ans;
int main() {
scanf("%s%s", str[0], str[1]);
int s = 0;
h[0] = 0, h[1] = 0;
for (; str[1][s]; ++s) {
h[0] = 31 * h[0] + str[0][s];
h[1] = 31 * h[1] + str[1][s];
}
if (h[0] == h[1]) ans.push(s + 1);
long long pot = 1;
for (int i = s; i > 0; --i) {
h[0] -= pot * str[0][i - 1];
h[0] += pot * str[0][i];
if (h[0] == h[1]) ans.push(i);
pot *= 31;
}
printf("%d\n", ans.size());
while (!ans.empty()) {
int i = ans.top();
ans.pop();
if (ans.empty()) {
printf("%d\n", i);
} else {
printf("%d ", i);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 9;
const long long BASE = 797;
long long h1[N], h2[N], pw[N];
long long n;
string s1, s2;
vector<long long> ans;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> s1;
cin >> s2;
n = s1.size();
pw[0] = 1;
for (long long i = 1; i < N; i++) pw[i] = pw[i - 1] * BASE;
for (long long i = 1; i <= n; i++) h1[i] = h1[i - 1] * BASE + s1[i - 1];
for (long long i = 1; i <= n - 1; i++) h2[i] = h2[i - 1] * BASE + s2[i - 1];
for (long long i = 0; i < (n - 1); i++) {
if (h1[i] == h2[i] && h2[n - 1] - h2[i] * pw[n - i - 1] * bool(i) ==
h1[n] - h1[i + 1] * pw[n - 1 - i])
ans.push_back(i + 1);
}
s1.pop_back();
if (s1 == s2) ans.push_back(n);
cout << ans.size() << endl;
for (auto it : ans) cout << it << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
char s1[1000010], s2[1000010];
int len1, len2, sxl;
int main() {
cin >> s1 + 1;
len1 = strlen(s1 + 1);
cin >> s2 + 1;
len2 = strlen(s2 + 1);
int t = 1, ff = 0, sxls = 0;
for (int i = 1; i <= len1; i++) {
if (s1[i] == s2[t])
t++;
else
sxl = i, ff++;
}
if (ff > 1) {
cout << "0";
return 0;
}
for (int i = sxl - 1; i >= 1; i--) {
if (s1[i] == s1[sxl])
sxls++;
else
break;
}
cout << sxls + 1 << endl;
for (int i = sxl - sxls; i <= sxl; i++) cout << i << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000000 + 7;
long long power(long long x, long long y) {
long long res = 1;
x = x;
while (y > 0) {
if (y & 1) res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
long long powe(long long x, long long y) {
x = x % mod, y = y % (mod - 1);
long long ans = 1;
while (y > 0) {
if (y & 1) {
ans = (1ll * x * ans) % mod;
}
y >>= 1;
x = (1ll * x * x) % mod;
}
return ans;
}
void fun() {}
long long ncr(long long n, long long r) {
long long res = 1;
if (r > n) return 0;
if (r > n - r) r = n - r;
for (long long i = 0; i < r; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
fun();
long long ttt = 1;
while (ttt--) {
string s, t;
cin >> s >> t;
set<long long> st;
long long n = s.length(), m = t.length();
long long h[26] = {0}, k[26] = {0};
for (long long i = 0; i < n; i++) h[s[i] - 'a']++;
for (long long i = 0; i < m; i++) k[t[i] - 'a']++;
for (long long i = 0; i < 26; i++)
if ((h[i] == 0 and k[i] > 0) or (h[i] < k[i])) return cout << 0, 0;
long long i = 0, j = 0;
s = s + '$';
set<char> sett;
for (; i < n;) {
if (s[i] != t[j]) {
st.insert(i);
sett.insert(s[i]);
long long k = i;
while (s[k] == s[k - 1]) {
st.insert(k - 1);
k--;
}
i++;
} else
i++, j++;
if (i >= n) break;
}
if (sett.size() != 1) return cout << 0, 0;
cout << st.size() << "\n";
for (long long i : st) cout << i + 1 << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
char s1[N], s2[N];
int main() {
scanf("%s%s", s1, s2);
int len = strlen(s1);
int flag = 0, l = 0, r = 0;
for (int i = 0; i < len; i++) {
if (s1[i] != s2[i]) {
for (int j = i; j < len - 1; j++)
if (s1[j + 1] != s2[j]) flag = 1;
if (flag) break;
l = r = i;
for (int j = i + 1; j < len; j++)
if (j == r + 1 && s1[j] == s1[i]) r = j;
for (int j = i - 1; j >= 0; j--)
if (j == l - 1 && s1[j] == s1[i]) l = j;
break;
}
}
if (flag)
printf("0\n");
else {
printf("%d\n", r - l + 1);
for (int i = l; i <= r; i++) {
printf("%d%c", i + 1, i == r ? '\n' : ' ');
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
struct Hashs {
vector<long long> hashs;
vector<long long> pows;
long long P;
long long MOD;
Hashs() {}
Hashs(string &s, long long P, long long MOD) : P(P), MOD(MOD) {
long long n = s.size();
pows.resize(n + 1, 0);
hashs.resize(n + 1, 0);
pows[0] = 1;
for (long long i = n - 1; i >= 0; i--) {
hashs[i] = (1LL * hashs[i + 1] * P + s[i] - 'a' + 1) % MOD;
pows[n - i] = (1LL * pows[n - i - 1] * P) % MOD;
}
pows[n] = (1LL * pows[n - 1] * P) % MOD;
}
long long get_hash(long long l, long long r) {
long long ans =
hashs[l] + MOD - (1LL * hashs[r + 1] * pows[r - l + 1]) % MOD;
ans %= MOD;
return ans;
}
};
long long pow(long long a, long long b, long long m) {
long long ans = 1;
while (b) {
if (b & 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans;
}
const long long P1 = 27;
const long long P2 = 31;
const long long MOD = 1e9 + 7;
string a, b;
Hashs ha1, ha2;
Hashs hb1, hb2;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> a >> b;
ha1 = Hashs(a, P1, MOD);
ha2 = Hashs(a, P2, MOD);
hb1 = Hashs(b, P1, MOD);
hb2 = Hashs(b, P2, MOD);
pair<long long, long long> reqd = {hb1.get_hash(0, b.size() - 1),
hb2.get_hash(0, b.size() - 1)};
vector<long long> v;
for (long long i = 0; i < a.size(); i++) {
pair<long long, long long> have;
long long h = 0;
if (a.size() - i - 1 > 0) h = ha1.get_hash(i + 1, a.size() - 1);
long long r = i;
if (r > 0) {
h *= pow(P1, r, MOD);
h %= MOD;
h += ha1.get_hash(0, i - 1);
h %= MOD;
}
have.first = h;
h = 0;
if (a.size() - i - 1 > 0) h = ha2.get_hash(i + 1, a.size() - 1);
r = i;
if (r > 0) {
h *= pow(P2, r, MOD);
h %= MOD;
h += ha2.get_hash(0, i - 1);
h %= MOD;
}
have.second = h;
if (have == reqd) v.push_back(i + 1);
}
cout << v.size() << "\n";
for (auto &it : v) cout << it << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[30], B[30];
int main() {
string s, t;
cin >> s >> t;
vector<int> v;
bool ok = true;
int sz = t.size();
int sz1 = s.size();
for (int i = 0; i < sz1; i++) {
A[s[i] - 'a']++;
}
for (int i = 0; i < sz; i++) {
B[t[i] - 'a']++;
}
int e = 0;
for (int i = 0; i < 26; i++) {
if (A[i] != B[i]) e++;
}
if (e != 1) {
puts("0");
return 0;
}
int cnt = 0;
for (int i = 0, j = 0; i < sz; i++, j++) {
if (s[i] != t[j]) {
v.push_back(i);
cnt++;
j--;
}
}
if (cnt == 0) {
v.push_back(sz);
cnt++;
}
if (cnt == 1) {
int r = v[0];
char ch = s[r];
v.clear();
for (int i = r; i >= 0; i--) {
if (s[i] == ch)
v.push_back(i + 1);
else
break;
}
for (int i = r + 1; i < sz + 1; i++) {
if (s[i] == ch)
v.push_back(i + 1);
else
break;
}
sort(v.begin(), v.end());
int z = v.size();
cout << z << endl;
for (int i = 0; i < z; i++) {
if (i) cout << ' ';
cout << v[i];
}
cout << endl;
} else {
puts("0");
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1000010;
char a[MaxN], b[MaxN];
bool ok[MaxN];
int ans[MaxN];
int main() {
scanf("%s %s", a, b);
int L = strlen(b);
for (int i = L - 1; i >= 0 && a[i + 1] == b[i]; i--) {
ok[i + 1] = 1;
}
int an = 0;
if (ok[1]) ans[an++] = 0;
ok[L + 1] = 1;
for (int i = 0; i < L && a[i] == b[i]; i++) {
if (ok[i + 2]) ans[an++] = i + 1;
}
cout << an << endl;
if (an) {
cout << ans[0] + 1;
for (int i = 1; i < an; i++) printf(" %d", ans[i] + 1);
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long P = 31;
int main() {
string a, b;
cin >> a >> b;
vector<long long> phash(a.size() + 1, 0), shash(a.size() + 1, 0),
pow_p(a.size() + 1, 0);
long long bhash = 0, chash;
pow_p[0] = 1;
for (int i = 1; i < pow_p.size(); i++)
pow_p[i] = (pow_p[i - 1] * P) % 1000000007;
for (int i = 0; i < a.size(); i++)
phash[i + 1] = (phash[i] + (a[i] - 'a' + 1) * pow_p[i]) % 1000000007;
for (int i = a.size() - 1; i >= 0; i--)
shash[i] = (shash[i + 1] * P + (a[i] - 'a' + 1)) % 1000000007;
for (int i = 0; i < b.size(); i++)
bhash = (bhash + (b[i] - 'a' + 1) * pow_p[i]) % 1000000007;
vector<int> res;
for (int i = 1; i <= a.size(); i++)
if ((phash[i - 1] + pow_p[i - 1] * shash[i]) % 1000000007 == bhash)
res.push_back(i);
cout << res.size() << endl;
for (int e : res) cout << e << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> d;
string s1, s2;
int kol = 0;
void f(int uk) {
d.push_back(uk + 1);
while (uk - 1 >= 0 && s1[uk - 1] == s1[uk]) {
d.push_back(uk);
--uk;
}
cout << d.size() << "\n";
reverse(d.begin(), d.end());
for (int i = 0; i < d.size(); ++i) cout << d[i] << ' ';
}
int main() {
cin >> s1 >> s2;
s2 += '$';
for (int i = 0; i < s2.length() - 1; ++i)
if (s1[i] != s2[i] && kol == 0)
++kol;
else if (s1[i + 1] != s2[i] && kol > 0)
++kol;
if (s1[s1.length() - 1] != s2[s2.length() - 2]) ++kol;
if (kol > 1) {
cout << 0;
return 0;
}
kol = 0;
while (s1[kol] == s2[kol]) ++kol;
f(kol);
return 0;
}
|
#include <bits/stdc++.h>
char s1[1000010], s2[1000010];
int main() {
scanf("%s", s1);
scanf("%s", s2);
const int len1 = strlen(s1);
int j = 0, differencesCount = 0;
int differenceIndex;
for (int i = 0; i < len1; i += 1) {
if (s1[i] == s2[j]) {
j += 1;
} else {
differenceIndex = i;
differencesCount += 1;
}
}
if (differencesCount > 1) {
printf("0");
return 0;
}
int ans = 0;
for (int i = differenceIndex - 1; i >= 0; i -= 1) {
if (s1[i] == s1[differenceIndex]) {
ans += 1;
} else {
break;
}
}
printf("%d\n", ans + 1);
for (int i = differenceIndex - ans; i <= differenceIndex; i += 1) {
printf("%d ", i + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1000005;
long long int prime = 2017;
long long int mod = 1e9 + 7;
long long int hashi[MaxN];
long long int pot[MaxN];
void hasha(string a) {
long long int i, N = a.size();
for (i = N - 1; i >= 0; i--) {
hashi[i] = hashi[i + 1] * prime;
hashi[i] = hashi[i] % mod;
hashi[i] += (a[i] - 'a' + 1);
hashi[i] = hashi[i] % mod;
}
}
long long int hashb(string a) {
long long int i, N = a.size();
long long int res = 0;
for (i = N - 1; i >= 0; i--) {
res = res * prime;
res = res % mod;
res += (a[i] - 'a' + 1);
res = res % mod;
}
return res % mod;
}
vector<long long int> v;
int main() {
long long int N, i, j, p, q, t = 0, aux, aux2;
string a, b;
cin >> a >> b;
hasha(a);
p = hashb(b);
p = p % mod;
pot[0] = 1;
for (i = 1; i < MaxN; i++) {
pot[i] = pot[i - 1] * prime;
pot[i] = pot[i] % mod;
}
for (i = 0; i < a.size(); i++) {
aux = hashi[i + 1] * pot[i] % mod;
aux2 = hashi[i] * pot[i] % mod;
if (((aux + hashi[0] - aux2) + mod) % mod == p % mod) {
t++;
v.push_back(i);
}
}
cout << t << "\n";
for (i = 0; i < v.size(); i++) {
cout << v[i] + 1 << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
ifstream from;
const int err = 0;
const long long nmin = 1, nmax = 1000000;
long long n, m, res, rt, i, i0, i1, j, k, ax;
string s, st, ss, sb;
if (0) from.open("test.txt");
cin >> ss;
cin >> s;
n = s.length();
i0 = n;
i1 = 0;
for (i = 0; i < n; i++) {
if (s[i] != ss[i]) break;
i1++;
}
for (i = n; i > 0; i--) {
if (s[i - 1] != ss[i]) break;
i0--;
}
res = (i0 <= i1) ? (i1 - i0 + 1) : 0;
cout << res << endl;
if (res > 0) {
for (i = i0; i < i1; i++) cout << (i + 1) << ' ';
cout << (i1 + 1) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
char s1[1000001], s2[1000001];
int n, counta, cantidad, resp2[1000001];
int main() {
scanf("%s %s", s1 + 1, s2 + 1);
n = strlen(s1 + 1);
for (int i = n; i >= 1; --i)
if (i == 1 || s1[i] != s2[i - 1]) {
counta = n - i;
break;
}
for (int i = 1; i <= n; ++i) {
if (counta >= n - i) {
resp2[++cantidad] = i;
}
if (i == n || s1[i] != s2[i]) {
break;
}
}
printf("%d\n", cantidad);
if (cantidad != 0) {
for (int i = 1; i <= cantidad; ++i) {
printf("%d ", resp2[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
int I = -1;
for (int i = 0; i < s2.length(); ++i)
if (s1[i] != s2[i]) {
I = i;
break;
}
vector<int> dif;
if (I == -1) {
dif.push_back(s1.length());
for (int i = s1.length() - 2; i >= 0 && s1[i] == s1[s1.length() - 1]; --i)
dif.push_back(i + 1);
sort(dif.begin(), dif.end());
cout << dif.size() << "\n";
for (int i = 0; i < dif.size() - 1; ++i) cout << dif[i] << " ";
cout << dif[dif.size() - 1] << "\n";
return 0;
}
dif.push_back(I + 1);
for (int i = I + 1; i < s1.length() && s1[i] == s1[I]; ++i)
dif.push_back(i + 1);
for (int i = I - 1; I >= 0 && s1[i] == s1[I]; --i) dif.push_back(i + 1);
sort(dif.begin(), dif.end());
string s3 = s2;
for (int i = 0; i < s1.length(); ++i) {
if (i < I)
s3[i] = s1[i];
else if (i > I)
s3[i - 1] = s1[i];
}
if (s3 != s2)
cout << "0\n";
else {
cout << dif.size() << "\n";
for (int i = 0; i < dif.size() - 1; ++i) cout << dif[i] << " ";
cout << dif[dif.size() - 1] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double euler_r = 0.57721566490153286060651209;
const double pi = 3.141592653589793238462643383279;
const int inf = ~0U >> 1;
const int MOD = int(1e9) + 7;
const double EPS = 1e-6;
char s1[1000010], s2[1000010];
int main() {
int i, l1, l2, j;
scanf("%s%s", s1, s2);
l2 = strlen(s2);
l1 = l2 + 1;
int p, s;
p = s = 0;
while (p < l2) {
if (s1[p] != s2[p]) break;
p++;
}
for (i = l1 - 1, j = l2 - 1; i >= 0 && j >= 0; i--, j--) {
if (s1[i] != s2[j])
break;
else
s++;
}
if (p + s + 1 < l1) {
cout << "0" << endl;
} else {
int L, R;
L = max(1, l1 - s);
R = min(l1, p + 1);
cout << R - L + 1 << endl;
for (i = (L); i <= (R); i++) cout << i << " ";
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
char s[1000020], c[1000020];
int l, r;
int main() {
scanf("%s %s", s, c);
for (r = 0; s[r] == c[r];) r++;
for (l = strlen(c); l >= 0 && s[l + 1] == c[l];) l--;
printf("%d\n", r > l ? r - l : 0);
for (int i = l + 1; i <= r; i++) printf("%d ", i + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
int p = 131;
int inv = 190839696;
long long mod = 1000000007;
const int MAX = 1000005;
long long pows[MAX];
long long invpows[MAX];
long long prefx[MAX];
string s1, s2;
int main() {
cin >> s1;
cin >> s2;
int L = s1.length();
pows[0] = 1;
invpows[0] = 1;
for (int i = 1; i < MAX - 1; i++) {
pows[i] = (pows[i - 1] * p) % mod;
invpows[i] = (invpows[i - 1] * inv) % mod;
}
prefx[0] = s1[0] - 'a' + 1;
long long s1_hash = 0;
long long s2_hash = 0;
s1_hash += ((s1[0] - 'a' + 1) * pows[0]) % mod;
s2_hash += ((s2[0] - 'a' + 1) * pows[0]) % mod;
for (int i = 1; i < L - 1; i++) {
prefx[i] = (prefx[i - 1] + pows[i] * (s1[i] - 'a' + 1)) % mod;
s1_hash = (s1_hash + (s1[i] - 'a' + 1) * pows[i]) % mod;
s1_hash = (s1_hash + mod) % mod;
s2_hash = (s2_hash + (s2[i] - 'a' + 1) * pows[i]) % mod;
s2_hash = (s2_hash + mod) % mod;
}
int i = L - 1;
prefx[i] = (prefx[i - 1] + pows[i] * (s1[i] - 'a' + 1)) % mod;
s1_hash = (s1_hash + (s1[i] - 'a' + 1) * pows[i]) % mod;
s1_hash = (s1_hash + mod) % mod;
vector<int> ans;
if (((s1_hash - prefx[0]) * inv + mod * mod) % mod == s2_hash) {
ans.push_back(1);
}
for (int i = 1; i < L; i++) {
long long newhash =
(prefx[i - 1] + (s1_hash - prefx[i]) * inv + mod * mod) % mod;
if (newhash == s2_hash) {
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
if (ans.size() != 0) {
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b;
int se[1000005], sb[1000005];
vector<int> out;
int main() {
int i, j, k, n;
cin >> a >> b;
n = a.size();
se[n] = 1;
for (i = n - 1; i > 0; i--) se[i] = se[i + 1] && a[i] == b[i - 1];
sb[0] = a[0] == b[0];
for (i = 1; i < n - 1; i++) sb[i] = sb[i - 1] && a[i] == b[i];
for (i = 0; i < a.size(); i++) {
if (i == 0 && se[i + 1])
out.push_back(i + 1);
else if (sb[i - 1] && se[i + 1])
out.push_back(i + 1);
}
cout << out.size() << endl;
for (i = 0; i < out.size(); i++) cout << out[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long k = 997;
long long h[1000010], p[1000010], s[1000010];
long long h2;
string s1, s2;
int ansk = 0;
int ans[1000010];
int main() {
cin >> s1;
cin >> s2;
int n1 = s1.length(), n2 = s2.length();
h[0] = 1;
for (int i = 1; i <= max(n1, n2) + 100; i++) h[i] = h[i - 1] * k;
h2 = s2[0];
for (int i = 1; i < n2; i++) h2 = h2 * k + s2[i];
p[0] = 0;
for (int i = 1; i <= n1; i++) p[i] = p[i - 1] * k + s1[i - 1];
s[n1] = 0;
for (int i = n1 - 1; i >= 0; i--) s[i] = s1[i] * h[n1 - i - 1] + s[i + 1];
for (int i = 0; i <= n1; i++)
if (p[i] * h[n1 - i - 1] + s[i + 1] == h2) ans[ansk++] = i + 1;
printf("%d\n", ansk);
for (int i = 0; i < ansk; i++) printf("%d ", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const long long p = 3731;
const int N = 1000000 + 3;
long long power[N];
long long h1[N], h2[N];
long long get1(int a, int b) { return h1[b] - power[b - a] * h1[a]; }
long long get2(int a, int b) { return h2[b] - power[b - a] * h2[a]; }
int main() {
power[0] = 1;
for (int i = 1; i < N; i++) power[i] = power[i - 1] * p;
char s1[N], s2[N];
scanf("%s", s1);
scanf("%s", s2);
h1[0] = 0;
h2[0] = 0;
int L = (int)strlen(s1);
for (int i = 1; i <= L; i++) h1[i] = h1[i - 1] * p + s1[i - 1];
for (int i = 1; i <= L - 1; i++) h2[i] = h2[i - 1] * p + s2[i - 1];
int res = 0;
vector<int> ans;
if (get1(1, L) == get2(0, L - 1)) {
res++;
ans.push_back(1);
}
for (int i = 1; i < L - 1; i++) {
if (get1(0, i) == get2(0, i) && get1(i + 1, L) == get2(i, L - 1)) {
res++;
ans.push_back(i + 1);
}
}
if (get1(0, L - 1) == get2(0, L - 1)) {
res++;
ans.push_back(L);
}
printf("%d\n", res);
for (int i = 0; i < (int)ans.size(); i++) printf("%d ", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
string a, b;
getline(cin, a);
a = a + '.';
getline(cin, b);
b = b + ',';
register int n = b.length() - 1;
register int pos1 = 0, pos2 = 0;
register int ans;
bool flag = 0;
while (1) {
while (a[pos1] == b[pos2]) pos1++, pos2++;
if (pos1 == n + 1 and pos2 == n) break;
ans = pos1;
pos1++;
if (flag == 1) return puts("0"), 0;
flag = 1;
}
int last_ans = ans;
while (a[ans] == a[ans - 1]) ans--;
printf("%d\n", last_ans - ans + 1);
printf("%d\n", ans + 1);
while (a[ans] == a[ans + 1]) printf("%d ", (++ans + 1));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k, cnt = 0, p1, p2, max, min;
char s1[1000003], s2[1000003], s;
scanf("%s %s", &s1, &s2);
for (i = 0; i < strlen(s1); i++) {
if (s1[i] != s2[i]) {
p1 = i;
break;
}
}
for (i = strlen(s1) - 1; i >= 0; i--) {
if (s1[i] != s2[i - 1]) {
p2 = i;
break;
}
}
if (p1 < p2) {
printf("0\n");
return 0;
}
printf("%d\n", p1 - p2 + 1);
for (i = p2; i <= p1; i++) {
printf("%d ", i + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
int k = 0, p = a.size() - 1;
while (a[k] == b[k] && k < b.size()) k++;
while (p - 1 >= 0 && a[p] == b[p - 1]) p--;
if (k < p)
cout << 0 << endl;
else {
cout << abs(k - p) + 1 << endl;
for (int i = p; i <= k; i++) {
cout << i + 1 << ' ';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s, t;
bool B1[1000001];
bool B2[1000001];
vector<int> R;
int main() {
int n;
getline(cin, s);
getline(cin, t);
int i = 0;
bool b = true;
while (i < t.size()) {
if (t[i] != s[i]) b = false;
B1[i] = b;
i++;
}
i = 0;
b = true;
while (i < t.size()) {
if (t[t.size() - i - 1] != s[s.size() - i - 1]) b = false;
B2[s.size() - i - 1] = b;
i++;
}
for (int i = 0; i < s.size() + 1; i++) {
bool b1 = true, b2 = true;
if (i > 0) b1 = B1[i - 1];
if (i + 1 < s.size()) b2 = B2[i + 1];
if (b1 && b2) R.push_back(i);
}
cout << R.size() << endl;
for (int i = 0; i < R.size(); i++) cout << R[i] + 1 << ' ';
cin >> n;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int p = 1;
long long int mod = 1000000007;
long long int vec[1000009], vec2[1000009];
long long int po[1000009];
string a, b;
vector<int> resp;
int main() {
getline(cin, a);
getline(cin, b);
p = 31;
po[0] = 1;
for (int i = 1; i < max(a.size(), b.size()) + 1; i++)
po[i] = (po[i - 1] * p) % mod;
vec[a.size() - 1] = a[a.size() - 1] - 'a' + 1;
for (int i = a.size() - 2; i >= 0; i--)
vec[i] = (a[i] - 'a' + 1 + ((vec[i + 1] * p) % mod)) % mod;
vec2[b.size() - 1] = b[b.size() - 1] - 'a' + 1;
for (int i = b.size() - 2; i >= 0; i--)
vec2[i] = (b[i] - 'a' + 1 + ((vec2[i + 1] * p) % mod)) % mod;
for (int c = 0; c < a.size(); c++) {
long long int aux = vec[0] - ((vec[c] * po[c]) % mod);
if (aux < 0) aux += mod;
aux %= mod;
long long int aux2 = (vec[c + 1] * po[c]) % mod;
aux2 += aux;
aux2 %= mod;
if (aux2 == vec2[0]) resp.push_back(c);
}
cout << resp.size() << "\n";
for (int c = 0; c < resp.size(); c++) cout << resp[c] + 1 << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
string sres, s;
int p1, p2, res;
int main() {
cin >> s >> sres;
int i = 0;
while (s[i] == sres[i] && i < sres.length()) {
p1++;
i++;
}
i = sres.length() - 1;
while (s[i + 1] == sres[i] && i >= 0) {
p2++;
i--;
}
res = (p1 + p2) - sres.length() + 1;
if (res < 0) res = 0;
cout << res;
if (res) {
cout << endl;
for (int i = sres.length() - p2 + 1; i <= p1 + 1; i++) cout << i << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
long long int N = 1000000;
long long int power(long long int a, long long int b) {
if (b == 0) return 1;
long long int temp = a * power(a, b - 1);
return temp;
}
int main() {
string s1, s2;
cin >> s1 >> s2;
int n = s1.length();
int prefix = 0, suffix = 0, i = 0;
while (s1[i] == s2[i]) {
prefix++;
i++;
}
i = 0;
while (s1[n - i - 1] == s2[n - i - 2]) {
suffix++;
i++;
}
if (prefix + suffix < n - 1)
cout << "0";
else {
cout << suffix + prefix + 2 - n << endl;
}
for (int i = n - suffix - 1; i <= prefix; i++) cout << i + 1 << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000020], t[1000020];
bool f[1000020], g[1000020];
vector<int> v;
int main(void) {
int n;
int i;
scanf("%s", s + 1);
scanf("%s", t + 1);
for (i = 1, f[0] = true, n = strlen(s + 1); i < n; i++)
f[i] = f[i - 1] && s[i] == t[i];
for (i = n, g[n + 1] = true; i > 1; i--) g[i] = g[i + 1] && s[i] == t[i - 1];
for (i = 1; i <= n; i++)
if (f[i - 1] && g[i + 1]) v.push_back(i);
printf("%d\n", (signed)v.size());
for (i = 0; i < (signed)v.size(); i++) printf("%d ", v.at(i));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 1;
bool ok[N];
vector<int> v;
int main() {
string a, b;
cin >> a >> b;
for (int i = a.size() - 1; i > 0; i--) {
if (a[i] == b[i - 1])
ok[i - 1] = true;
else
break;
}
for (int i = 0; i < b.size(); i++) {
if (ok[i]) v.push_back(i);
if (a[i] != b[i]) break;
}
bool all = true;
for (int i = 0; i < b.size(); i++)
if (a[i] != b[i]) all = false;
if (all) v.push_back(a.size() - 1);
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) cout << v[i] + 1 << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
int n = a.size();
int l = 0, r = n - 1;
while (l < n - 1) {
if (a[l] == b[l])
++l;
else
break;
}
while (r > 0) {
if (a[r] == b[r - 1])
--r;
else
break;
}
vector<int> ans;
for (int i = r; i <= l; ++i) ans.push_back(i + 1);
cout << ans.size() << '\n';
for (int i = 0; i < ans.size(); ++i)
cout << ans[i] << " \n"[i == (int)ans.size() - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
long long hash_computation(string const& s) {
long long hash_val = 0, p = 31, p_pow = 1;
for (char c : s) {
hash_val = (hash_val + (c - 'a' + 1) * p_pow) % (long long)1e9 + 7;
p_pow = (p * p_pow) % (long long)1e9 + 7;
}
return hash_val;
}
vector<long long> hash_vector(string const& s) {
long long n = s.length();
vector<long long> v(n, 0);
long long hash_val = 0, p = 31, p_pow = 1, i = 0;
for (char c : s) {
hash_val = (hash_val + (c - 'a' + 1) * p_pow) % (long long)1e9 + 7;
p_pow = (p * p_pow) % (long long)1e9 + 7;
v[i] = hash_val;
i += 1;
}
return v;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s, t;
cin >> s >> t;
long long n = t.length();
vector<long long> hash_of_s = hash_vector(s);
reverse(s.begin(), s.end());
vector<long long> hash_of_s_reverse = hash_vector(s);
reverse(s.begin(), s.end());
vector<long long> hash_of_t = hash_vector(t);
reverse(t.begin(), t.end());
vector<long long> hash_of_t_reverse = hash_vector(t);
reverse(t.begin(), t.end());
long long ans = 0;
vector<int> ans_v;
for (long long int i = 0; i <= n; ++i) {
if (i == 0 && hash_of_s_reverse[n - 1] == hash_of_t_reverse[n - 1])
ans += 1, ans_v.push_back(i);
else if (i == n && hash_of_s[n - 1] == hash_of_t[n - 1])
ans += 1, ans_v.push_back(i);
else if (i > 0 && i < n) {
if (hash_of_s[i - 1] == hash_of_t[i - 1] &&
hash_of_s_reverse[n - i - 1] == hash_of_t_reverse[n - i - 1])
ans += 1, ans_v.push_back(i);
}
}
cout << ans << endl;
if (ans > 0) {
for (int x : ans_v) cout << x + 1 << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s1[2000000], s2[2000000];
int error, l, r, len, cur, pos;
int main() {
gets(s1);
gets(s2);
len = strlen(s1);
for (int i = 0; i < len; ++i)
if (s1[i] == s2[cur])
cur++;
else {
if (error > 0) {
putchar('0');
return 0;
}
error++;
pos = i;
}
if (error == 0) pos = len - 1;
l = pos;
while (l >= 0 && s1[l] == s1[pos]) l--;
l++;
r = pos;
while (r < len && s1[r] == s1[pos]) r++;
r--;
l++;
r++;
printf("%d\n", r - l + 1);
for (int i = l; i <= r; ++i) printf("%d ", i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s1[1000010], s2[1000010];
int nxt[1000010], fro[1000010], bac[1000010], len1, len2;
int pos[1000010], cnt;
int read() {
static int res;
static char op;
do op = getchar();
while (op > '9' || op < '0');
for (res = 0; op >= '0' && op <= '9'; op = getchar())
res = res * 10 + (op ^ 48);
return res;
}
signed main(int argc, char **argv) {
scanf("%s\n%s", s1 + 1, s2 + 1);
len1 = strlen(s1 + 1), len2 = len1 - 1;
for (int i = 2, j = 0; i <= len2; ++i) {
while (j && s2[j + 1] != s2[i]) j = nxt[j];
if (s2[j + 1] == s2[i]) ++j;
nxt[i] = j;
}
for (int i = 1, j = 0; i <= len1; ++i) {
while (j && s2[j + 1] != s1[i]) j = nxt[j];
if (s2[j + 1] == s1[i]) ++j;
fro[i] = j;
}
memset(nxt, 0, sizeof nxt);
nxt[len2] = len1;
for (int i = len2 - 1, j = len2 + 1; i; --i) {
while (j < len2 && s2[j - 1] != s2[i]) j = nxt[j];
if (s2[j - 1] == s2[i]) --j;
nxt[i] = j;
}
for (int i = len1, j = len1; i; --i) {
while (j < len2 && s2[j - 1] != s1[i]) j = nxt[j];
if (s2[j - 1] == s1[i]) --j;
bac[i] = len2 - j + 1;
}
for (int i = 1; i <= len1; ++i)
if (fro[i - 1] + bac[i + 1] == len2) pos[++cnt] = i;
printf("%d\n", cnt);
for (int i = 1; i <= cnt; ++i) printf("%d ", pos[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000010], c[1000010];
int r, l;
int main() {
scanf("%s %s", &s, &c);
for (r = 0; s[r] == c[r];) r++;
for (l = strlen(c); l >= 0 && c[l] == s[l + 1];) l--;
if (r > l)
printf("%d\n", r - l);
else
printf("0");
for (int i = l + 1; i <= r; i++) printf("%d ", i + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int p = 31;
const int m = 1e9 + 9;
vector<long long> compute_hash(string const& s) {
int n = s.size();
vector<long long> pre_pow(n);
pre_pow[0] = 1;
for (int i = 1; i < n; ++i) {
pre_pow[i] = (pre_pow[i - 1] * p) % m;
}
vector<long long> pre_hash(n + 1, 0);
pre_hash[0] = 0;
for (int i = 1; i <= n; ++i) {
pre_hash[i] = pre_hash[i - 1];
pre_hash[i] += ((s[i - 1] - 'a' + 1) * pre_pow[i - 1]) % m;
pre_hash[i] %= m;
}
return pre_hash;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s, t;
cin >> s >> t;
auto a1 = compute_hash(s);
auto a2 = compute_hash(t);
int n1 = a1.size();
int n2 = a2.size();
long long total = (a2[n2 - 1] * p) % m;
vector<int> ans;
for (int i = 1; i < n1 - 1; ++i) {
long long prev = a1[i - 1];
long long nxt = (a1[n1 - 1] - a1[i] + m) % m;
long long should_be = (prev * p + nxt) % m;
if (should_be == total) {
ans.push_back(i);
}
}
long long prev = a1[n1 - 2];
if (prev == a2[n2 - 1]) {
ans.push_back(n1 - 1);
}
cout << ans.size() << '\n';
for (auto i : ans) {
cout << i << " ";
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int q = 0, w = 0;
for (int i = 0; i < s.size() && i < t.size(); i++)
if (s[i] == t[i])
q++;
else
break;
for (int i = 0; i < s.size() && i < t.size(); i++)
if (s[s.size() - i - 1] == t[t.size() - i - 1])
w++;
else
break;
if (q + 1 < s.size() - w)
cout << 0;
else {
cout << -max(int(s.size()) - w, 1) + min(q + 1, int(s.size())) + 1 << endl;
for (int i = max(int(s.size()) - w, 1); i <= min(q + 1, int(s.size())); i++)
cout << i << ' ';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string first, second;
char err_char;
int count = 0;
cin >> first >> second;
int pos;
int try_no = 0;
for (int i = 0; i <= second.size(); i++) {
if (first[i] != second[i - try_no]) {
err_char = first[i];
while (first[i] == err_char) {
if (try_no == 1) {
cout << 0 << endl;
return 0;
}
count++;
i--;
}
pos = i + 1;
i = i + count;
try_no = 1;
}
}
cout << count << endl;
for (int i = 1; i <= count; i++) {
cout << pos + i << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2, tmp;
int count = 0;
getline(cin, s1);
getline(cin, s2);
if (s2.size() > s1.size()) {
tmp = s1;
s1 = s2;
s2 = tmp;
}
long long sum = 0;
for (char c : s1) {
sum += c;
}
for (char c : s2) {
sum -= c;
}
if (sum < 97 || sum > 122) {
cout << 0;
exit(0);
} else {
char letter = (char)sum;
vector<int> arr;
string::size_type start_pos = 0;
while ((string::npos) != (start_pos = s1.find(letter, start_pos))) {
if (s2[start_pos] != letter) {
s1.erase(start_pos, 1);
if (s1 == s2) {
count++;
arr.push_back(start_pos);
s1.insert(start_pos, 1, letter);
for (int i = start_pos; i > 0; i--) {
if (s1[i] == s1[i - 1]) {
count++;
arr.push_back(i - 1);
} else {
break;
}
}
}
}
++start_pos;
}
cout << count;
std::sort(arr.begin(), arr.end());
if (!arr.empty()) {
cout << endl;
for (int i = 0; i < arr.size(); i++) {
cout << arr[i] + 1 << " ";
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
string s1;
int main() {
cin >> s;
cin >> s1;
int j = 0;
bool a = true;
int g1 = -1, g2;
int i;
for (i = 0; i < s1.size(); i++) {
if (s[j] != s1[i]) {
if (!a) {
cout << 0;
return 0;
}
g1 = i;
g2 = g1;
a = false;
i--;
}
j++;
}
if (g1 == -1) {
g1 = s1.size();
g2 = g1;
}
for (i = g1 - 1; i >= 0; i--) {
if (s[i] == s[g1]) {
g2--;
} else
break;
}
cout << g1 - g2 + 1 << '\n';
for (i = g2; i <= g1; i++) cout << i + 1 << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s1, s2;
const int N = 1000 * 1000 + 121, mod = 1000 * 1000 * 1000 + 7;
long long base[2] = {701, 727}, pbase[2][N], phash[2][N];
pair<long long, long long> H2;
void Hash() {
for (int k = 0; k < 2; k++) {
pbase[k][0] = 1;
for (int i = 1; i <= s1.size(); i++) {
pbase[k][i] = pbase[k][i - 1] * base[k] % mod;
phash[k][i] = (phash[k][i - 1] * base[k] + s1[i - 1]) % mod;
}
}
long long hs[2] = {0, 0};
for (int k = 0; k < 2; k++) {
for (int i = 1; i <= s2.size(); i++) {
hs[k] = (hs[k] * base[k] + s2[i - 1]) % mod;
}
}
H2 = {hs[0], hs[1]};
}
pair<long long, long long> get_hash(int l, int r) {
long long hs[2];
for (int k = 0; k < 2; k++)
hs[k] = (((phash[k][r] - phash[k][l] * pbase[k][r - l]) % mod) + mod) % mod;
return {hs[0], hs[1]};
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> s1 >> s2;
int n = s1.size();
Hash();
vector<int> ans;
for (int i = 0; i < s1.size(); i++) {
pair<long long, long long> h1 = get_hash(0, i), h2 = get_hash(i + 1, n);
h1.first = h1.first * pbase[0][n - i - 1] % mod;
h1.second = h1.second * pbase[1][n - i - 1] % mod;
if ((h1.first + h2.first) % mod == H2.first &&
(h1.second + h2.second) % mod == H2.second)
ans.push_back(i + 1);
}
cout << ans.size() << endl;
for (auto i : ans) cout << i << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string a, b;
cin >> b >> a;
map<int, int> all;
int siz = a.size();
int siz2 = b.size();
for (int i = 0; i < siz; i++) {
all[a[i] - 'a']++;
}
int count = 0;
char temp;
for (int i = 0; i < siz2; i++) {
all[b[i] - 'a']--;
if (all[b[i] - 'a'] == -1) temp = b[i];
}
for (int i = 0; i <= 26; i++) {
if (all[i] != 0) count++;
}
if (count != 1)
cout << "0" << endl;
else {
int start = 0;
int flag = 0;
vector<int> ans;
for (int i = 0; i < siz2; i++) {
if (i < siz2 - 1 && b[i] == a[i]) {
if (b[i] == temp && !flag) {
start = i;
flag = 1;
} else if (b[i] != temp) {
flag = 0;
}
} else if (b[i] == temp) {
if (!flag) {
ans.push_back(i + 1);
} else {
for (int i1 = start; i1 <= i; i1++) ans.push_back(i1 + 1);
}
break;
}
}
int siz3 = ans.size();
cout << siz3 << endl;
for (int i = 0; i < siz3; i++) {
cout << ans[i] << " ";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
string b;
cin >> b;
int n = a.size();
char c, d;
int idx1 = 0, idx2 = n;
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
c = a[i];
idx1 = i;
break;
}
}
for (int i = n; i >= 0; i--) {
if (a[i] != b[i - 1]) {
d = a[i];
idx2 = i;
break;
}
}
if (c != d) {
cout << 0 << endl;
return 0;
}
cout << idx1 - idx2 + 1 << endl;
for (int i = idx2; i <= idx1; i++) {
cout << i + 1 << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool vis[1000004], siv[1000004];
string s, t;
int main() {
memset(vis, 1, sizeof(vis));
memset(siv, 1, sizeof(siv));
cin >> s >> t;
for (int i = 0; i < t.size(); i++)
if (s[i] != t[i] || (i != 0 && !vis[i - 1])) vis[i] = 0;
for (int i = int(t.size()) - 1; i >= 0; i--)
if (s[i + 1] != t[i] || !siv[i + 2]) siv[i + 1] = 0;
vector<int> ans;
for (int i = 0; i < s.size(); i++) {
if (i != 0 && !vis[i - 1]) continue;
if (siv[i + 1]) ans.push_back(i);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) cout << ans[i] + 1 << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string st, s1;
cin >> st >> s1;
vector<int> ans;
long p = 0, s = st.size();
while (p < s1.size() && st[p] == s1[p]) p++;
while (s >= 0 && st[s] == s1[s - 1]) s--;
for (int i = s + 1; i <= p + 1; i++) ans.push_back(i);
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int dr[] = {0, -1, 0, 1, -1, 1, 1, -1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1};
const double eps = 1e-9;
template <class T>
void print(const vector<T> &v) {
ostringstream os;
for (int i = 0; i < v.size(); ++i) {
if (i) os << ' ';
os << v[i];
}
cout << os.str() << endl;
}
template <class T>
int sz(const T &c) {
return (int)c.size();
}
template <class T>
void srt(T &c) {
sort(c.begin(), c.end());
}
template <class T>
void checkmin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
void checkmax(T &a, T b) {
if (b > a) a = b;
}
template <class T>
T sqr(T x) {
return x * x;
}
template <class T, class U>
T cast(U x) {
ostringstream os;
os << x;
T res;
istringstream is(os.str());
is >> res;
return res;
}
template <class T>
vector<T> split(string s, string x = " ") {
vector<T> res;
for (int i = 0; i < s.size(); i++) {
string a;
while (i < (int)s.size() && x.find(s[i]) == string::npos) a += s[i++];
if (!a.empty()) res.push_back(cast<T>(a));
}
return res;
}
template <class T>
bool inside(T r, T c, T R, T C) {
return r >= 0 && r < R && c >= 0 && c < C;
}
int main(int argc, char *argv[]) {
string a, b;
cin >> a >> b;
int n = sz(b);
vector<int> res;
bool ok = false;
int pos = 0;
for (int i(0), _n(n); i < _n; ++i) {
if (a[i] != b[i]) {
pos = i;
ok = true;
for (int k(i), _b(n - 1); k <= _b; ++k) ok &= a[k + 1] == b[k];
break;
}
if (i == n - 1) {
pos = n;
ok = true;
break;
}
}
if (ok) {
int j = pos;
while (j > 0 && a[j - 1] == a[pos]) --j;
while (j < sz(a)) {
if (a[j] != a[pos]) break;
res.push_back(j + 1);
j++;
}
}
cout << sz(res) << endl;
print(res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = (1 << 31) - 1;
template <typename T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
char str1[1000100], str2[1001000];
string s1, s2;
int par[1000010];
int main() {
int i, j, cnt, ind;
while (scanf("%s %s", str1, str2) == 2) {
s1 = str1;
s2 = str2;
j = 0;
memset(par, -1, sizeof(par));
for (i = 0; i < ((int)s2.size()); i++) {
for (j = j; j < ((int)s1.size()); j++)
if (s1[j] == s2[i]) {
par[j] = i;
j++;
break;
}
}
cnt = 0;
for (i = 0; i < ((int)s1.size()); i++)
if (par[i] == -1) {
ind = i;
cnt++;
}
vector<int> ans;
if (cnt == 1) {
ans.push_back(ind);
for (j = ind + 1; j < ((int)s1.size()); j++)
if (s1[j] == s1[ind]) {
ans.push_back(j);
} else
break;
for (j = ind - 1; j >= 0; j--)
if (s1[j] == s1[ind]) {
ans.push_back(j);
} else
break;
sort(ans.begin(), ans.end());
printf("%d\n", ((int)ans.size()));
for (i = 0; i < ((int)ans.size()); i++) printf("%d ", ans[i] + 1);
printf("\n");
} else
printf("0\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
string a, b;
cin >> a >> b;
int N = b.length();
int cs1[26] = {0}, cc = 0, cs2[26] = {0};
bool v = 1;
for (int i = (0); i < (N); ++i) cs1[b[i] - 'a']++;
for (int i = (0); i < (N + 1); ++i) cs2[a[i] - 'a']++;
for (int i = (0); i < (26); ++i) cc += abs(cs1[i] - cs2[i]);
v = cc == 1;
int p = 0;
for (int i = (0); i < (N); ++i)
if (b[i] == a[i])
p = i + 1;
else
break;
for (int i = (p + 1); i < (N + 1) && (v); ++i) v = b[i - 1] == a[i];
if (!v)
puts("0");
else {
int L = p, R = p;
for (int i = (p); i < (N); ++i)
if (a[i + 1] == a[p])
R++;
else
break;
for (int i = (p); i >= (1); --i)
if (a[i - 1] == a[p])
L--;
else
break;
printf("%d\n", R - L + 1);
for (int i = (L); i < (R + 1); ++i) printf("%d ", i + 1);
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
const long long N = 1000005;
const long long M = 1e9 + 7;
using namespace std;
long long h_s[N], h_t[N], p[N];
vector<int> ans;
int main() {
string s, t;
cin >> s >> t;
p[0] = 1;
s = '#' + s;
t = '#' + t;
h_s[0] = 0;
h_t[0] = 0;
for (int i = 1; i <= s.size(); i++) p[i] = (p[i - 1] * 31) % M;
for (int i = 1; i < s.size(); i++)
h_s[i] = (h_s[i - 1] + ((s[i] - 'a' + 1) * p[i]) % M) % M;
for (int i = 1; i < t.size(); i++)
h_t[i] = (h_t[i - 1] + ((t[i] - 'a' + 1) * p[i]) % M) % M;
for (int i = 1; i < s.size(); i++) {
long long hesh_s =
(((h_s[s.size() - 1] + M) - h_s[i]) % M) * p[s.size() - i - 1] % M;
int j = i - 1;
long long hesh_t =
(((h_t[t.size() - 1] + M) - h_t[j]) % M) * p[t.size() - j] % M;
if (hesh_s == hesh_t && h_s[i - 1] == h_t[i - 1]) ans.push_back(i);
}
cout << ans.size() << '\n';
for (int i : ans) cout << i << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b) {
long long res = 1;
a %= 1000000007;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % 1000000007;
a = a * a % 1000000007;
}
return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s, t;
cin >> s >> t;
int prf = t.size(), suf = 0;
for (int i = 0; i < t.size(); i++) {
if (s[i] != t[i]) {
prf = i;
break;
}
}
for (int i = t.size(); i >= 0; i--) {
if (s[i + 1] != t[i]) {
suf = i + 1;
break;
}
}
if (prf > suf) swap(prf, suf);
char c = s[prf];
for (int i = prf; i <= suf; i++) {
if (s[i] != c) {
cout << "0\n";
return 0;
}
}
cout << suf - prf + 1 << "\n";
for (int i = prf; i <= suf; i++) cout << i + 1 << " ";
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000005, P = 20040911;
int ha[N], hb, p[N];
vector<int> ans;
string a, b;
int main() {
p[0] = 1;
for (int i = 1; i < N; i++) p[i] = p[i - 1] * P;
cin >> a >> b;
for (int i = 0; i < a.size(); i++) ha[i] = ha[i - 1] * P + a[i] - 'a';
for (int i = 0; i < b.size(); i++) hb = hb * P + b[i] - 'a';
for (int i = 0; i < a.size(); i++) {
int k = (i == 0 ? 0 : ha[i - 1]) * p[a.size() - i - 1] + ha[a.size() - 1] -
ha[i] * p[a.size() - i - 1];
if (k == hb) ans.push_back(i);
}
printf("%d\n", ans.size());
for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i] + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000000;
const int P = 4073;
const int MOD = 1000000009;
char s[MAX_N + 4], t[MAX_N + 4];
int rhs[MAX_N + 1];
inline int powmod(int a, int b) {
int p = 1;
while (b) {
if (b & 1) p = (long long)p * a % MOD;
a = (long long)a * a % MOD;
b >>= 1;
}
return p;
}
inline int s2rh(int rh[], const char s[]) {
int k = 0, pe = 1;
rh[0] = 0;
for (; s[k]; k++) {
rh[k + 1] = (rh[k] + (long long)s[k] * pe % MOD) % MOD;
pe = (long long)pe * P % MOD;
}
return k;
}
inline int s2hash(const char s[]) {
int h = 0, pe = 1;
for (int i = 0; s[i]; i++) {
h = (h + (long long)s[i] * pe % MOD) % MOD;
pe = (long long)pe * P % MOD;
}
return h;
}
int main() {
scanf("%s%s", s, t);
int n = strlen(s), m = strlen(t);
if (n != m + 1) {
puts("0");
return 0;
}
s2rh(rhs, s);
int th = s2hash(t);
int invp = powmod(P, MOD - 2);
vector<int> v;
for (int i = 0; i < n; i++) {
int h =
(rhs[i] + (long long)(rhs[n] + MOD - rhs[i + 1]) * invp % MOD) % MOD;
if (h == th) v.push_back(i);
}
printf("%d\n", (int)v.size());
if (!v.empty()) {
for (int i = 0; i < v.size(); i++) {
if (i) putchar(' ');
printf("%d", v[i] + 1);
}
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000100;
long long hash1[MAXN], hash2[MAXN], ppow[MAXN];
const int base = 123321123;
const int MOD = 321123321;
string s1, s2;
inline void init() {
for (int i = 0; i < s1.size(); i++)
if (!i)
hash1[i] = s1[i];
else
hash1[i] = (hash1[i - 1] * base + s1[i]) % MOD;
for (int i = 0; i < s2.size(); i++)
if (!i)
hash2[i] = s2[i];
else
hash2[i] = (hash2[i - 1] * base + s2[i]) % MOD;
ppow[0] = 1;
for (int i = 1; i < 1000000; i++) {
ppow[i] = (ppow[i - 1] * base) % MOD;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin >> s1 >> s2;
int n = s1.size();
init();
vector<int> ans;
for (int i = 0; i < s1.size(); i++) {
if (!i) {
if ((hash1[n - 1] - hash1[0] * ppow[n - 1] + (long long)MOD * MOD) %
MOD ==
hash2[n - 2])
ans.push_back(i + 1);
} else if (i != n - 1) {
if ((hash1[i - 1] * ppow[n - i - 1] % MOD + hash1[n - 1] -
hash1[i] * ppow[n - i - 1] + (long long)MOD * MOD) %
MOD ==
hash2[n - 2])
ans.push_back(i + 1);
} else {
if (hash1[n - 2] == hash2[n - 2]) ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) cout << ans[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
int main() {
ios_base::sync_with_stdio(0);
string s, c, s1 = "", s2 = "";
cin >> s >> c;
bool f = false;
int num = -1;
for (int i = 0; i < c.size(); i++) {
if (s[i] != c[i] && !f) f = true, num = i;
if (!f)
s1 += s[i];
else
s1 += s[i + 1];
s2 += s[i];
}
if (!f) num = s.size() - 1;
if (s1 == c) {
for (int i = num; i < s.size() && s[i] == s[num]; i++) ans.push_back(i + 1);
for (int i = num - 1; i >= 0 && s[i] == s[num]; i--) ans.push_back(i + 1);
}
sort(ans.begin(), ans.end());
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) cout << ans[i] << ' ';
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
long long n, m, a, i, b, j, k, t, x, y, z, tc, u, v, w;
string s1, s2;
cin >> s1 >> s2;
char ch;
string str = "";
n = s1.size();
k = 0;
long long flag = 0;
for (i = 0; i < n; i++) {
if (flag == 1) str += s1[i];
if (s1[i] == s2[i] && flag == 0)
str += s1[i];
else if (flag == 0) {
ch = s1[i];
flag = 1;
k = i;
continue;
}
}
if (str != s2)
cout << 0 << endl;
else {
long long cnt = 0;
vector<long long> vct;
u = v = k;
for (i = k + 1; i < n; i++) {
if (ch == s1[i])
u = i, vct.push_back(i + 1);
else
break;
}
for (i = k; i >= 0; i--) {
if (ch == s1[i])
v = i, vct.push_back(i + 1);
else
break;
}
cout << abs(u - v) + 1 << endl;
sort(vct.begin(), vct.end());
for (i = 0; i < vct.size(); i++) cout << vct[i] << " ";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
{
string a, b;
cin >> a >> b;
long long int c = 0, p = 0;
vector<long long int> v;
long long int n = a.length();
long long int i = 0, j = 0, f = 1, x = 0;
while (i < n) {
if (j < n - 1 && a[i] == b[j])
i++, j++;
else {
p = a[i] - 'a';
c++;
x = i;
i++;
}
}
if (c == 1) {
i = x - 1;
j = x + 1;
v.push_back(x + 1);
while (i >= 0 && a[i] - 'a' == p) c++, i--, v.push_back(i + 2);
while (j < n && a[j] - 'a' == p) c++, j++, v.push_back(j);
} else
c = 0;
sort((v).begin(), (v).end());
cout << c << endl;
for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << endl;
;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000000;
string s, ss;
unsigned long long p = 31, pPows[MAXN], pref[MAXN], need;
void prepare() {
pPows[0] = 1;
for (int i = 1; i < MAXN; i++) pPows[i] = pPows[i - 1] * p;
for (int i = 0; i < s.size(); i++)
pref[i] = (s[i] - 'a' + 1) * pPows[i] + (i ? pref[i - 1] : 0);
for (int i = 0; i < ss.size(); i++) need += (ss[i] - 'a' + 1) * pPows[i];
}
int main() {
int len;
vector<int> ans;
cin >> s >> ss;
len = s.size();
prepare();
for (int i = 0; i < len; i++)
if (pref[len - 1] - pref[i] == (need - (i ? pref[i - 1] : 0)) * p)
ans.push_back(i);
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) cout << ans[i] + 1 << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int hx[8] = {1, 0, -1, 0, 1, -1, 1, -1};
int hy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
string a, b;
int u, v, m, n, pos;
int dai;
void solve() {
cin >> a >> b;
int dai = a.size();
a += '$';
b += '$';
while (a[m] == b[n] && m <= dai && n <= dai - 1) {
m++;
n++;
}
pos = m;
u = pos + 1;
v = pos;
while (a[u] == b[v] && u <= dai && v <= dai - 1) {
u++;
v++;
}
if (u != dai + 1)
cout << 0;
else {
u = pos - 1;
v = pos + 1;
int dem = 1;
deque<int> q;
while (a[u] == a[pos] && u >= 0) {
q.push_front(u);
u--;
}
q.push_back(pos);
while (a[v] == a[pos] && v <= dai) {
q.push_back(v);
v++;
}
cout << q.size() << endl;
while (q.empty() != 1) {
cout << q.front() + 1 << " ";
q.pop_front();
}
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const int P = int(1e9) + 7;
const int MAX_N = int(1e6) + 10;
int n;
char a[MAX_N], b[MAX_N];
unsigned long long pows[MAX_N], pa[MAX_N], sum;
int main() {
gets(a + 1);
gets(b + 1);
n = strlen(b + 1);
pows[0] = 1;
for (int i = 1; i <= n; i++) {
pows[i] = pows[i - 1] * P;
sum = sum * P + b[i];
pa[i] = pa[i - 1] * P + a[i];
}
pa[n + 1] = pa[n] * P + a[n + 1];
vector<int> v;
n++;
for (int i = 1; i <= n; i++) {
if (pa[i - 1] * pows[n - i] + pa[n] - pa[i] * pows[n - i] == sum) {
v.push_back(i);
}
}
if (!v.empty()) {
printf("%d\n", (int)v.size());
for (int i = 0; i < (int)v.size(); i++) {
printf("%d%c", v[i], i < (int)v.size() - 1 ? ' ' : '\n');
}
} else {
puts("0");
}
}
|
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::string s, t;
std::cin >> s >> t;
long ind(0), pos(s.size() - 1);
bool inc(false), possible(true);
for (long p = 0; p < t.size(); p++) {
if (t[p] == s[ind]) {
++ind;
} else if (!inc && t[p] == s[ind + 1]) {
pos = ind;
ind += 2;
inc = true;
} else {
possible = false;
break;
}
}
if (possible) {
std::vector<long> v;
for (long p = pos; p >= 0; p--) {
if (s[p] == s[pos]) {
v.push_back(p + 1);
} else {
break;
}
}
printf("%ld\n", v.size());
for (long p = v.size() - 1; p >= 0; p--) {
printf("%ld ", v[p]);
}
puts("");
} else {
puts("0");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int p4[] = {-1, 1, 0, 0};
long long int q4[] = {0, 0, 1, -1};
long long int p8[] = {-1, 1, 0, 0, -1, 1, -1, 1};
long long int q8[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long int gcd(long long int a, long long int b) {
if (b > a) gcd(b, a);
return ((b == 0) ? a : gcd(b, a % b));
}
long long int LCM(long long int a, long long int b) {
long long int p = (a * b) / (gcd(a, b));
return p;
}
long long int BigMod(long long int a, long long int b, long long int m) {
if (!b) return 1;
long long int ans = BigMod(a, b / 2, m);
ans = (ans * ans) % m;
if (b & 1) ans = (ans * a) % m;
return ans;
}
long long int Mod_inv(long long int a) {
return BigMod(a, 1000000007LL - 2, 1000000007LL);
}
long long int a[1000005], b[1000005], b2[1000005], c[1000005], c2[1000005];
vector<long long int> v, v1, v2;
map<long long int, long long int> mp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int i, j, k, l, m, n, d, p, q, h1, h2;
long long int cs = 0, tc, t = 1, flg, f, sm;
for (i = 0; i <= 1000000; i++) {
a[i] = BigMod(31, i, 1000000007LL);
}
string s, s1, s2;
while (cin >> s1 >> s2) {
s1 = "*" + s1;
h1 = h2 = 0;
for (i = 1; i < s1.size(); i++) {
b[i] = ((a[i - 1] * (s1[i] - 'a' + 1)) % 1000000007LL + b[i - 1]) %
1000000007LL;
c[i] = ((a[i - 1] * (s1[i] - 'a' + 1)) % 1000000009LL + c[i - 1]) %
1000000009LL;
}
for (i = 2; i < s1.size(); i++) {
b2[i] = ((a[i - 2] * (s1[i] - 'a' + 1)) % 1000000007LL + b2[i - 1]) %
1000000007LL;
c2[i] = ((a[i - 2] * (s1[i] - 'a' + 1)) % 1000000009LL + c2[i - 1]) %
1000000009LL;
}
for (i = 0; i < s2.size(); i++) {
h1 = ((a[i] * (s2[i] - 'a' + 1)) % 1000000007LL + h1) % 1000000007LL;
h2 = ((a[i] * (s2[i] - 'a' + 1)) % 1000000009LL + h2) % 1000000009LL;
}
v.clear();
for (i = 1; i < s1.size(); i++) {
p = (b[i - 1] +
((b2[s1.size() - 1] - b2[i] + 1000000007LL) % 1000000007LL)) %
1000000007LL;
q = (c[i - 1] +
((c2[s1.size() - 1] - c2[i] + 1000000009LL) % 1000000009LL)) %
1000000009LL;
if (p == h1 && q == h2) {
v.push_back(i);
}
}
cout << v.size() << endl;
for (i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Data {
Data(int count_, int pos_) : count(count_) { pos.insert(pos_); }
int count;
set<int> pos;
};
int main() {
string a, b;
cin >> a;
cin >> b;
int n = b.size();
int c[n + 1];
c[n] = 1;
for (int i = n - 1; i >= 0; i--) {
c[i] = (a[i + 1] == b[i] && c[i + 1] > 0);
}
Data data(1, n);
for (int i = n - 1; i >= 0; i--) {
if (a[i] == b[i]) {
if (c[i] > 0) {
data.count++;
data.pos.insert(i);
}
} else if (c[i] > 0) {
data.count = 1;
data.pos.clear();
data.pos.insert(i);
} else {
data.count = 0;
data.pos.clear();
}
}
if (data.count == 0) {
cout << 0 << endl;
return 0;
}
cout << data.count << endl;
for (set<int>::const_iterator it = data.pos.begin(); it != data.pos.end();
it++) {
cout << *it + 1 << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool derecha[1000001], izquierda[1000001];
int main() {
string a, b;
cin >> a >> b;
int L = a.size();
for (int i = 0; i < L - 1 && a[i] == b[i]; i++) izquierda[i] = true;
for (int i = L - 1; i >= 1 && a[i] == b[i - 1]; i--) derecha[i] = true;
vector<int> res;
if (derecha[1]) res.push_back(1);
for (int i = 1; i < L; i++)
if (izquierda[i - 1] && derecha[i + 1]) res.push_back(i + 1);
if (izquierda[L - 2]) res.push_back(L);
cout << res.size() << endl;
for (auto k : res) printf("%d ", k);
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000020], c[1000020];
int l, r;
int main() {
scanf("%s %s", s, c);
for (r = 0; s[r] == c[r];) r++;
for (l = strlen(c); l >= 0 && s[l + 1] == c[l];) l--;
printf("%d\n", r > l ? r - l : 0);
for (int i = l + 1; i <= r; i++) printf("%d ", i + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
bool pre[1000000], suf[1000000];
string s, t;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> s >> t;
int n = t.size();
pre[0] = suf[n] = 1;
for (int i = 1; i <= n; ++i) pre[i] = pre[i - 1] && s[i - 1] == t[i - 1];
for (int i = n - 1; i >= 0; --i) suf[i] = suf[i + 1] && s[i + 1] == t[i];
vector<int> ans;
for (int i = 0; i <= n; ++i)
if (pre[i] && suf[i]) ans.push_back(i + 1);
cout << ans.size() << "\n";
for (int i : ans) cout << i << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000050], c[1000050];
vector<int> ans;
long long l1[1000050], r1[1000050], l2[1000050], r2[1000050];
int main() {
int i, j;
while (~scanf("%s", s + 1)) {
scanf("%s", c + 1);
int len1 = strlen(s + 1), len2 = strlen(c + 1);
if (len1 - 1 != len2) {
puts("0");
continue;
}
l1[0] = 0;
for (i = 1; i <= len1; i++) {
l1[i] = l1[i - 1] * 26 + s[i];
if (l1[i] >= 100000007) l1[i] %= 100000007;
}
r1[len1 + 1] = 0;
for (i = len1; i; i--) {
r1[i] = r1[i + 1] * 26 + s[i];
if (r1[i] >= 100000007) r1[i] %= 100000007;
}
l2[0] = 0;
for (i = 1; i <= len2; i++) {
l2[i] = l2[i - 1] * 26 + c[i];
if (l2[i] >= 100000007) l2[i] %= 100000007;
}
r2[len2 + 1] = 0;
for (i = len2; i; i--) {
r2[i] = r2[i + 1] * 26 + c[i];
if (r2[i] >= 100000007) r2[i] %= 100000007;
}
ans.clear();
for (i = 1; i <= len1; i++) {
long long a = l1[i - 1] + r1[i + 1];
long long b = l2[i - 1] + r2[i];
if (a == b) ans.push_back(i);
}
cout << ans.size() << endl;
for (i = 0; i < ans.size(); i++)
printf("%d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b;
vector<vector<bool> > d;
int p, q;
int main() {
cin >> a >> b;
d.resize(b.size());
for (int i = 0; i < d.size(); i++) d[i].resize(2);
for (int i = 0; i < d.size(); i++) {
d[i][0] = (b[i] == a[i]);
d[i][1] = (b[i] == a[i + 1]);
}
p = 0;
q = d.size() - 1;
for (; p < d.size() && d[p][0]; p++)
;
for (; q >= 0 && d[q][1]; q--)
;
if (p >= q + 1) {
cout << p - q << "\n";
for (int i = q + 1; i <= p; i++) cout << i + 1 << " ";
} else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool pal(string s) {
int i = 0, j = s.size() - 1;
while (i <= j) {
if (s[i] != s[j]) return false;
i++;
j--;
}
return true;
}
int main() {
vector<int> v;
string s, k;
int i = 0, j = 0, l, p = 0;
cin >> s >> k;
int sz = s.size();
while (i < sz && j < k.size()) {
if (s[i] == k[j]) {
i++;
j++;
} else if (p == 0) {
p = i + 1;
i++;
} else {
p = -1;
break;
}
}
if (p == 0)
p = s.size();
else if (p == -1) {
cout << 0;
return 0;
}
for (i = p - 1; i >= 0; i--) {
if (s[i] == s[p - 1])
v.push_back(i);
else
break;
}
for (i = p - 1 + 1; i < s.size(); i++) {
if (s[i] == s[p - 1])
v.push_back(i);
else
break;
}
cout << v.size() << endl;
sort(v.begin(), v.end());
for (auto g : v) cout << g + 1 << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
string pattern, text;
long long hashText[1000007], hashPattern = 0, basePow[1000007];
long long fastPow(long long a, long long b) {
if (b < 1) {
return 1;
}
long long ret = fastPow(a, b / 2);
ret *= ret;
ret %= 1000000007;
if (b % 2 != 0) {
ret *= a;
}
return ret % 1000000007;
}
int main() {
cin >> text;
cin >> pattern;
basePow[0] = 1;
for (int i = 1; i < 1000007; i++) {
basePow[i] = basePow[i - 1] * 41;
basePow[i] %= 1000000007;
}
long long total = 0;
for (int i = 0; i < text.size(); i++) {
total += text[i] * basePow[i];
total %= 1000000007;
hashText[i] = total;
}
for (int i = 0; i < pattern.size(); i++) {
hashPattern += pattern[i] * basePow[i];
hashPattern %= 1000000007;
}
hashPattern %= 1000000007;
long long modInverse = fastPow(41, 1000000007 - 2);
std::vector<int> ans;
for (int i = 0; i < text.size(); i++) {
long long res = 0;
if (i > 0) res += hashText[i - 1] % 1000000007;
if (i < text.size() - 1)
res += (((hashText[text.size() - 1] - hashText[i]) * modInverse) %
1000000007 +
1000000007) %
1000000007;
res %= 1000000007;
if (res == hashPattern) ans.push_back(i);
}
printf("%d\n", (int)ans.size());
for (int i : ans) {
printf("%d ", i + 1);
}
printf("\n");
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.