text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
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;
long long bigmod(long long b, long long p, long long n) {
if (p == 0)
return 1;
else if (p % 2 == 0) {
long long half1 = bigmod(b, p / 2, n);
return ((half1 * half1) % n);
} else if (p % 2 == 1) {
long long p1 = b % n;
long long p2 = bigmod(b, p - 1, n);
return ((p1 * p2) % n);
}
}
long long pre11[1000010], pre21[1000010];
string s, s1;
const int p = 31;
const int m1 = 1e9 + 7;
long long MMI[1000010];
void com() {
MMI[0] = 1;
MMI[1] = bigmod(31, m1 - 2, m1);
for (long long i = 2; i <= s.size() + 3; i++)
MMI[i] = (MMI[i - 1] * MMI[1]) % m1;
}
void compute_hash() {
long long hash_value1 = 0, hash_value2 = 0;
long long p_pow1 = 1, p_pow2 = 1;
for (int i = 0; i < s.size(); i++) {
hash_value1 = (hash_value1 + (s[i] - 'a' + 1) * p_pow1) % m1;
if (i < s1.size())
hash_value2 = (hash_value2 + (s1[i] - 'a' + 1) * p_pow1) % m1;
p_pow1 = (p_pow1 * p) % m1;
pre11[i] = hash_value1;
if (i < s1.size()) pre21[i] = hash_value2;
}
}
void compute_hash2() {
long long hash_value1 = 0, hash_value2 = 0;
long long p_pow1 = 1, p_pow2 = 1;
for (int i = 0; i < s1.size(); i++) {
hash_value1 = (hash_value1 + (s1[i] - 'a' + 1) * p_pow1) % m1;
p_pow1 = (p_pow1 * p) % m1;
pre21[i] = hash_value1;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> s >> s1;
com();
compute_hash();
vector<int> V;
for (int i = 0; i < s.size(); i++) {
long long p1, p2;
long long t1, t2;
if (i == 0) {
p2 = pre11[s.size() - 1] - pre11[0];
if (p2 < 0) p2 += m1;
p2 = ((p2 % m1) * MMI[i + 1]) % m1;
if (p2 == pre21[s1.size() - 1]) V.push_back(i + 1);
} else if (i == s.size() - 1) {
if (pre21[i - 1] == pre11[i - 1]) V.push_back(i + 1);
} else {
p2 = pre11[s.size() - 1] - pre11[i];
if (p2 < 0) p2 += m1;
p2 = ((p2 % m1) * MMI[i + 1]) % m1;
t2 = pre21[s1.size() - 1] - pre21[i - 1];
if (t2 < 0) t2 += m1;
t2 = ((t2 % m1) * MMI[i]) % m1;
if (p2 == t2 && pre21[i - 1] == pre11[i - 1]) V.push_back(i + 1);
}
}
cout << V.size() << endl;
for (int i = 0; i < V.size(); i++) cout << V[i] << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
string prv, dr;
vector<int> sol, sla, slb;
int main() {
cin >> prv >> dr;
dr += "3";
sla.resize(32, 0);
slb.resize(32, 0);
int i, razl = 0;
char nas = '0';
for (i = 0; i < prv.size() - 1; ++i) {
++sla[prv[i] - 'a'];
++slb[dr[i] - 'a'];
}
++sla[prv[i] - 'a'];
for (i = 0; i < 26; ++i) {
razl += abs(sla[i] - slb[i]);
}
if (razl > 1) {
printf("0\n");
return 0;
}
for (i = 0; i < prv.size(); ++i)
if (prv[i] != dr[i]) break;
nas = prv[i];
while (i >= 0)
if (prv[i] == nas)
sol.push_back(i-- + 1);
else
break;
printf("%d\n", sol.size());
if (!sol.empty()) {
reverse(sol.begin(), sol.end());
for (i = 0; i < sol.size(); ++i) printf("%d ", sol[i]);
printf("\n");
}
cin.get();
cin.get();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
int pos1 = s.size() - 1;
for (int i = 0; i < t.size(); i++)
if (s[i] != t[i]) {
pos1 = i;
break;
}
int pos2 = 0;
for (int i = t.size() - 1; i >= 0; i--)
if (s[i + 1] != t[i]) {
pos2 = i + 1;
break;
}
if (pos1 < pos2)
cout << 0 << endl;
else {
cout << pos1 - pos2 + 1 << endl;
for (int i = pos2; i <= pos1; i++) cout << i + 1 << " ";
cout << endl;
}
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;
r[n] = 1;
for (int i = 0; i < n; i++)
if (a[i] == b[i])
l[i + 1] = l[i];
else
l[i + 1] = 0;
for (int i = n - 1; i >= 0; i--)
if (a[i + 1] == b[i])
r[i] = r[i + 1];
else
r[i] = 0;
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;
char s[1000005], t[1000005];
int main() {
scanf("%s%s", s + 1, t + 1);
int n = strlen(t + 1);
int l = 0;
while (l < n && s[l + 1] == t[l + 1]) {
++l;
}
int r = n + 1;
while (r > 1 && s[r] == t[r - 1]) {
--r;
}
cout << max(0, l - r + 2) << endl;
for (int i = r; i <= l + 1; ++i) {
cout << i << " ";
}
cout << endl;
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s1, s2;
cin >> s1 >> s2;
long long p = 0, s = 0;
for (long long i = 0; i < s2.size(); i++) {
if (s1[i] != s2[i]) break;
++p;
}
for (long long i = 0; i < s2.size(); i++) {
if (s1[s1.size() - i - 1] != s2[s2.size() - i - 1]) break;
++s;
}
vector<long long> res;
for (long long i = 0; i < s1.size(); i++) {
if (p >= i && s1.size() - i - 1 <= s) res.push_back(i + 1);
}
cout << res.size() << "\n";
for (auto i : res) cout << i << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const int MMAX = 1000005, inf = 1e9 + 7;
char s1[MMAX], s2[MMAX];
int ans[MMAX];
stack<char> q1, q2;
int main() {
int f = 0, tot = 0, tt = 0;
char last = '1';
scanf("%s%s", s1, s2);
int len = strlen(s1);
for (int i = len - 1; i >= 0; i--) q1.push(s1[i]);
for (int i = len - 2; i >= 0; i--) q2.push(s2[i]);
while (!q2.empty() && !q1.empty()) {
tt++;
char n1 = q1.top(), n2 = q2.top();
q1.pop();
q2.pop();
if (n1 == n2)
continue;
else {
tot++;
ans[tot] = tt;
q2.push(n2);
}
}
if (tot >= 2)
printf("0\n");
else {
if (tot == 0) ans[1] = len;
int l = ans[1] - 1, r = ans[1] + 1;
while (l >= 1 && s1[l - 1] == s1[ans[1] - 1]) l--;
while (r <= len && s1[r - 1] == s1[ans[1] - 1]) r++;
printf("%d\n", r - l - 1);
for (int i = l + 1; i <= r - 1; i++) printf("%d ", i);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
ifstream fin("in.in");
ofstream fout("out.out");
const int N = 1e6 + 10;
const long long b = 29;
int n;
string s[2];
long long pre[2][N], pw[N];
vector<int> res;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
pw[0] = 1;
for (int i = 1; i < N; i++) pw[i] = pw[i - 1] * b;
for (int i = 0; i < 2; i++) {
cin >> s[i];
for (int j = 1; j <= s[i].length(); j++)
pre[i][j] = pre[i][j - 1] * b + (s[i][j - 1] - 'a' + 1);
}
n = s[0].length();
for (int i = 1; i <= n; i++) {
if (pre[0][i - 1] != pre[1][i - 1]) continue;
long long hash1 = pre[0][n] - pw[n - i] * pre[0][i];
long long hash2 = pre[1][n - 1] - pw[n - i] * pre[0][i - 1];
if (hash1 == hash2) 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>
#pragma GCC optimize("O3")
const int inf = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long power(long long a, long long b, long long m = 1000000007) {
long long answer = 1;
while (b) {
if (b & 1) answer = (answer * a) % m;
b /= 2;
a = (a * a) % m;
}
return answer;
}
using namespace std;
int main() {
string p, s1, s2;
cin >> p >> s1;
int pr = 3;
long long hash[p.length() + 1];
hash[0] = 0;
long long p_pow = 1;
for (int i = 0; i < p.length(); i++) {
hash[i + 1] = (p[i] - 'a' + 1) * p_pow;
hash[i + 1] %= 1000000007;
p_pow *= pr;
p_pow %= 1000000007;
}
long long hash1 = 0, hash2 = 0;
long long pref[p.length() + 1], suff[p.length() + 1 + 1];
pref[0] = 0;
for (int i = 1; i <= p.length(); i++) {
pref[i] = hash[i] + pref[i - 1];
pref[i] %= 1000000007;
}
suff[p.length() + 1] = 0;
suff[p.length()] = hash[p.length()];
for (int i = p.length() - 1; i >= 0; i--) {
suff[i] = suff[i + 1] + hash[i];
suff[i] %= 1000000007;
}
p_pow = 1;
for (int i = 0; i < s1.length(); i++) {
hash1 += (s1[i] - 'a' + 1) * p_pow;
hash1 %= 1000000007;
p_pow *= pr;
p_pow %= 1000000007;
}
long long x = power(pr, 1000000007 - 2);
vector<int> v;
for (int i = 1; i <= p.length(); i++) {
long long val = (x * suff[i + 1]) % 1000000007;
val += pref[i - 1];
val = val % 1000000007;
if (val == hash1) {
v.push_back(i);
}
}
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char* argv[]) {
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;
const int INF = 1000000007;
const long long INF64 = 1e18 + 3;
const unsigned long long p = 31;
vector<unsigned long long> pows = {1};
void CalcPows(int n) {
int end = pows.size();
pows.resize(n);
for (int i = end; i < pows.size(); i++) {
pows[i] = pows[i - 1] * p;
}
}
void ToHashArray(const string& s, vector<unsigned long long>& hash) {
if (pows.size() < s.size()) CalcPows(s.size());
hash.resize(s.size() + 1);
hash[0] = 0;
for (int i = 1; i <= s.size(); i++) {
hash[i] = hash[i - 1] + (s[i - 1] - 'a' + 1) * pows[i - 1];
}
}
unsigned long long ToHash(const string& s) {
if (pows.size() < s.size()) CalcPows(s.size());
unsigned long long hash = 0;
for (int i = 0; i < s.size(); i++) {
hash += s[i] * pows[i];
}
return hash;
}
bool AreEqualHashes(unsigned long long h1, int i, unsigned long long h2,
int j) {
if (i > j) {
swap(i, j);
swap(h1, h2);
}
return h1 * pows[j - i] == h2;
}
int main() {
string a, b;
cin >> a >> b;
vector<unsigned long long> ah;
ToHashArray(a, ah);
vector<unsigned long long> bh;
ToHashArray(b, bh);
vector<int> res;
for (int i = 0; i < a.size(); i++) {
if (AreEqualHashes(ah[i], 0, bh[i], 0) &&
AreEqualHashes(ah.back() - ah[i + 1], i + 1, bh.back() - bh[i], i)) {
res.push_back(i + 1);
}
}
cout << res.size() << endl;
for (int r : res) {
cout << r << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string a;
string b;
cin >> a >> b;
if (a.size() - b.size() != 1) {
cout << "NO";
return 0;
}
unordered_map<char, vector<int>> mp;
unordered_map<char, vector<int>> mpc;
for (int i = 0; i < a.size(); i++) {
mp[a[i]].push_back(i);
}
for (int i = 0; i < b.size(); i++) {
mpc[b[i]].push_back(i);
}
unordered_map<char, vector<int>>::iterator it;
int count = 0;
int pos = 0;
vector<int> res;
bool check = true;
for (it = mp.begin(); it != mp.end(); it++) {
vector<int> v1 = it->second;
char key = it->first;
if (mpc.find(key) == mpc.end()) {
count++;
if (count > 1) {
check = false;
}
res.push_back(v1[0] + 1);
} else {
vector<int> v2 = mpc[key];
if (v1.size() == v2.size()) {
continue;
} else if (v1.size() - v2.size() != 1) {
check = false;
} else {
count++;
if (count > 1) {
check = false;
}
int i = 0;
int j = 0;
while (i < v1.size() && j < v2.size()) {
if (v1[i] != v2[j]) {
break;
} else {
i++;
j++;
}
}
int k = i - 1;
int l = i + 1;
res.push_back(v1[i] + 1);
while (k >= 0 && abs(v1[k] - v1[i]) == 1) {
res.push_back(v1[k] + 1);
k--;
i--;
}
while (l < v1.size() && abs(v1[l] - v1[i]) == 1) {
res.push_back(v1[l] + 1);
l++;
i++;
}
}
}
}
if (check) {
cout << res.size() << endl;
sort(res.begin(), res.end());
for (int i = 0; i < res.size(); i++) {
cout << res[i] << " ";
}
} else {
cout << 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const int N = 0;
string s, s1;
int main() {
cin >> s >> s1;
int n = s.length(), L = -1, R = n;
while (L < n - 2 && s[L + 1] == s1[L + 1]) L++;
while (R >= 2 && s[R - 1] == s1[R - 2]) R--;
if (L + 1 < R) {
if (L + 2 != R)
printf("0");
else
printf("1\n%d", L + 2);
} else {
printf("%d\n", L - R + 3);
for (auto i = R - 1; i <= L + 1; i++) printf("%d ", i + 1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s1, s2;
int main() {
cin >> s1 >> s2;
int i = 0, j = 0;
while (s1[i] == s2[j]) {
++i;
++j;
}
int center = i;
++i;
while (s1[i] == s2[j] && (i < (int)s1.length() && j < (int)s2.length())) {
++i;
++j;
}
if ((i < (int)s1.length() && j < (int)s2.length()))
cout << "0";
else {
int kol = 0;
i = center;
while (i > 0 && s1[i] == s1[center]) --i;
if (s1[i] == s1[center])
center = i;
else {
center = i + 1;
++i;
}
while (i < (int)s1.length() && s1[i] == s1[center]) {
++i;
++kol;
}
cout << kol << endl;
for (int i = 0; i < kol; ++i) cout << center + i + 1 << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
string s1, s2;
cin >> s1 >> s2;
int i, j;
for (i = 0; i < s1.size(); ++i)
if (i == s1.size() - 1 || s1[i] != s2[i]) break;
for (j = s1.size() - 1; j >= 0; --j)
if (j == 0 || s1[j] != s2[j - 1]) break;
if (i < j)
cout << 0;
else {
cout << i - j + 1 << endl;
for (; j <= i; ++j) cout << j + 1 << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 8;
const int mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s, tar;
cin >> s >> tar;
int n, m;
n = s.length();
m = tar.length();
if (n < m || m < n - 1) {
cout << 0 << endl;
return 0;
}
int flag = 0;
int index;
int j = m - 1;
for (int i = n - 1; i > -1; i--) {
if (i < j) {
flag = 0;
break;
}
if (s[i] != tar[j]) {
index = i;
flag = 1;
continue;
}
j--;
}
if (j > -1) flag = 0;
if (!flag) {
cout << 0 << endl;
} else {
if (index == n - 1) {
cout << 1 << endl;
cout << n << endl;
} else if (s[index] == tar[index]) {
int temp = 1;
for (int i = index + 1; i < n; i++) {
if (s[i] == s[index])
temp++;
else
break;
}
cout << temp << endl;
for (int i = index; i < index + temp; i++) {
cout << i + 1 << " ";
}
cout << endl;
} else {
cout << 1 << endl;
cout << index + 1 << endl;
}
}
}
|
#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);
}
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;
int n, i, j, k, l, p, x, mx, in, g, h, m, k1, k2, k3, a[100005], b[100005],
c[100005], MOD = 1000000007;
vector<int> v;
string s1, s2;
int main() {
cin >> s1 >> s2;
n = s1.size();
m = s2.size();
s2 += 96;
for (i = 0; i < n; i++) {
a[s1[i]]++;
b[s2[i]]++;
}
for (i = 97; i <= 122; i++)
if (a[i] != b[i]) {
k++;
k1 = i;
}
if (k != 1) {
cout << 0;
return 0;
}
for (i = 0; i < n; i++)
if (s1[i] != s2[i]) {
while (s1[i] == k1) i--, k2++;
k3 = i + 1;
break;
}
cout << k2 << endl;
for (i = 1; i <= k2; i++) cout << k3 + i << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
void cp() {}
long long ab(long long a, long long b) {
if (a > b)
return a - b;
else
return b - a;
}
int main() {
cp();
long long n, m, i, j = 0, k, f = 0;
string s, c;
char ch;
vector<long long> v;
cin >> s >> c;
n = s.size();
m = c.size();
for (i = 0; i < n; i++) {
if (s[i] == c[j]) {
j++;
} else {
ch = s[i];
f = i;
while (s[i] == s[f] && f >= 0) {
v.push_back(f + 1);
f--;
}
}
}
if (j < m)
cout << "0" << endl;
else {
cout << v.size() << endl;
for (i = v.size() - 1; i >= 0; i--) cout << v[i] << " ";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int size = 1000005;
char s1[size];
char s2[size];
int main() {
int i, j, n, m, num, k;
while (scanf("%s%s", s1, s2) == 2) {
num = 0;
m = strlen(s1);
for (i = 0, j = 0; i < m; i++) {
if (s1[i] != s2[j]) {
num++;
k = i;
} else
j++;
}
if (num > 1)
printf("0\n");
else {
if (s1[k] != s1[k - 1]) {
printf("1\n");
printf("%d\n", k + 1);
} else {
j = k;
while (s1[k] == s1[j] && k >= 0) k--;
cout << j - k << endl;
for (i = k + 1; i <= j; i++) printf("%d ", i + 1);
cout << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[1000006] = {0}, b[1000006] = {0};
cin >> a >> b;
int i = 0;
int begin = 0, index;
bool fuck = true;
int l = 0;
while (b[l]) {
l++;
}
while (b[i]) {
if (i != 0 && a[i] != a[i - 1]) {
begin = i;
}
if (b[i] != a[i]) {
index = i;
fuck = false;
break;
}
i++;
}
if (fuck) {
index = l;
}
if (fuck && a[l] != a[l - 1]) {
begin = l;
}
bool check = false;
for (i = index; i < l; i++) {
if (b[i] != a[i + 1]) {
check = true;
break;
}
}
if (check) {
cout << 0;
} else {
cout << index - begin + 1 << endl;
for (int i = begin; i <= index; i++) {
cout << i + 1 << " ";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 10;
const int MAXN = 1e4 + 10;
const long long MOD = 1e9 + 7;
const int inf = 1e9;
const double pi = acos(-1.0);
const double eps = 1e-6;
long long hs[MAX], p[MAX], hsp;
int main() {
ios::sync_with_stdio(false);
int n, m;
string s, t;
cin >> s >> t;
n = s.length();
m = t.length();
if (n - m != 1) {
cout << 0;
return 0;
}
s = " " + s;
t = " " + t;
hs[0] = 0;
for (int i = 1; i <= n; i++)
hs[i] = (hs[i - 1] * 26 + (s[i] - 'a' + 1)) % MOD;
p[0] = 1;
for (int i = 1; i <= n; i++) p[i] = (p[i - 1] * 26) % MOD;
for (int i = 1; i <= m; i++) hsp = (hsp * 26 + (t[i] - 'a' + 1)) % MOD;
vector<int> f;
for (int i = 1; i <= n; i++) {
long long tmp =
((hs[n] - hs[i] * p[n - i] + MOD * MOD) % MOD + hs[i - 1] * p[n - i]) %
MOD;
if (tmp == hsp) f.push_back(i);
}
cout << f.size() << "\n";
for (int i = 0; i < f.size(); i++) cout << f[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, len1, len2, ans = 0, loc, z, y;
char s1[1000100], s2[1000100];
int main() {
int i;
ans = 0;
memset(s1, '0', sizeof(s1));
cin >> s2 >> s1;
len1 = strlen(s1);
len2 = strlen(s2);
for (i = 0; i < len2; i++) {
if (s1[ans] == s2[i])
ans++;
else
loc = i;
}
if (ans == len1) {
for (z = loc - 1; z >= 0; z--)
if (s2[z] != s2[loc]) break;
for (y = loc + 1; y < len2; y++)
if (s2[y] != s2[loc]) break;
cout << y - z - 1 << endl;
for (i = z + 1; i < y; i++) cout << i + 1 << " ";
} else
printf("0\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 1e6 + 4;
const long long p = 239017;
long long deg[maxn] = {1};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
for (int i = 1; i < maxn; ++i) deg[i] = (deg[i - 1] * p) % mod;
string s, t;
cin >> s >> t;
vector<long long> hash_s(s.size()), hash_t(t.size());
hash_s[0] = s[0];
for (int i = 1; i < s.size(); ++i)
hash_s[i] = ((hash_s[i - 1] * p) % mod + s[i]) % mod;
hash_t[0] = t[0];
for (int i = 1; i < t.size(); ++i)
hash_t[i] = ((hash_t[i - 1] * p) % mod + t[i]) % mod;
long long left_hash = 0;
long long need = hash_t[t.size() - 1];
set<int> ans;
for (int i = 0; i < s.size(); ++i) {
long long right_hash = (hash_s[s.size() - 1] + mod -
(hash_s[i] * deg[s.size() - i - 1]) % mod) %
mod;
long long t = (left_hash * deg[s.size() - i - 1]) % mod + right_hash;
t %= mod;
if (t == need) ans.insert(i + 1);
left_hash = (((left_hash * p) % mod) + s[i]) % mod;
}
cout << ans.size() << '\n';
for (int i : ans) {
cout << i << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout.setf(ios::fixed);
cout.setf(ios::showpoint);
{
string s, s1;
cin >> s >> s1;
long long int n = s1.length();
long long int c = 0, ans = 0;
long long int i = 0, j = 0;
while (i < (n + 1) && j < n) {
if (s[i] != s1[j])
c++, ans = i, i++;
else
j++, i++;
}
if (c > 1)
cout << 0;
else {
if (c == 1) {
long long int l = ans, r = ans;
char ch = s[ans];
while (l >= 0 && s[l] == ch) l--;
l++;
while (r <= n && s[r] == ch) r++;
r--;
cout << (r - l + 1) << endl;
for (long long int i = l; i < r + 1; i++) cout << i + 1 << " ";
} else {
long long int j = n - 1;
char ch = s[n];
while (j >= 0 && s[j] == ch) j--;
j++;
cout << (n - j + 1) << endl;
for (long long int i = j; i < n + 1; i++) cout << i + 1 << " ";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
char s[1000050], c[1000050];
int ans[1000050];
unsigned long long l1[1000050], r1[1000050], l2[1000050], r2[1000050];
int main(void) {
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] * 39 + s[i];
}
r1[len1 + 1] = 0;
for (i = len1; i; i--) {
r1[i] = r1[i + 1] * 39 + s[i];
}
l2[0] = 0;
for (i = 1; i <= len2; i++) {
l2[i] = l2[i - 1] * 39 + c[i];
}
r2[len2 + 1] = 0;
for (i = len2; i; i--) {
r2[i] = r2[i + 1] * 39 + c[i];
}
int total = 0;
for (i = 1; i <= len1; i++) {
unsigned long long a = l1[i - 1] + r1[i + 1];
unsigned long long b = l2[i - 1] + r2[i];
if (a == b) {
ans[total] = i;
total++;
}
}
printf("%d\n", total);
for (i = 0; i < total; i++)
printf("%d%c", ans[i], i == total - 1 ? '\n' : ' ');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> Q;
char str1[1000005];
char str2[1000005];
int main() {
Q.clear();
scanf("%s", str1);
scanf("%s", str2);
int len = strlen(str2);
int left = 0, right = len - 1;
while (left < len && str1[left] == str2[left]) left++;
while (right >= 0 && str1[right + 1] == str2[right]) right--;
if (left <= right) {
cout << "0" << endl;
return 0;
}
char tmp = str1[left];
while (tmp >= 0 && str1[left] == tmp) left--;
left++;
while (left < len + 1 && str1[left] == tmp) {
Q.push_back(left);
left++;
}
cout << Q.size() << endl;
for (int i = 0; i < Q.size(); i++) {
cout << Q[i] + 1 << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s, t;
int k = 0, p = 0;
int main() {
ios_base::sync_with_stdio(false);
cin >> s >> t;
int n = s.size(), m = t.size();
for (int i = 0; i < m; i++)
if (s[i] == t[i])
k++;
else
break;
for (int i = m - 1; i >= 0; i--)
if (s[i + 1] == t[i])
p++;
else
break;
if (k + p < m)
printf("0\n");
else {
printf("%d\n", k - (n - p) + 2);
for (int i = n - p; i <= k; i++) printf("%d ", i);
printf("%d", k + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:64000000")
using namespace std;
template <typename first>
inline first abs(const first& a) {
return a < 0 ? -a : a;
}
template <typename first>
inline first sqr(const first& a) {
return a * a;
}
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-9;
const int INF = 1000 * 1000 * 1000;
const int N = 1000 * 1000 + 13;
string s1, s2;
long long h[N];
long long deg[N];
int main() {
deg[0] = 1;
for (int i = 1; i <= int(N - 1); i++) deg[i] = deg[i - 1] * 1009LL;
cin >> s1 >> s2;
long long h2 = 0;
for (int i = 0; i < int(int((s2).size())); i++) h2 = h2 + s2[i] * deg[i];
h2 *= 1009LL;
h[0] = s1[0];
for (int i = 1; i <= int(int((s1).size()) - 1); i++)
h[i] = h[i - 1] + s1[i] * deg[i];
vector<int> ans;
for (int i = 0; i < int(int((s1).size())); i++) {
long long curh = h[int((s1).size()) - 1];
curh -= h[i];
curh += (i == 0 ? 0 : h[i - 1] * 1009LL);
if (curh == h2) ans.push_back(i);
}
cout << int((ans).size()) << endl;
for (int i = 0; i < int(int((ans).size())); i++) printf("%d ", ans[i] + 1);
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
int pre = 1;
for (int i = 0; i < a.length(); i++) {
if (a[i] == b[i]) {
pre++;
}
if (a[i] != b[i]) {
break;
}
}
int i = a.length();
while (a[i] == b[i - 1]) {
i--;
}
if (pre > i) {
cout << (pre - i) << endl;
for (int j = i + 1; j <= pre; j++) {
cout << j << " ";
}
} else {
cout << 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int HX = 0x3F3F3F3F;
const int S2 = 111, S3 = 1111, S4 = 11111, S5 = 111111, S6 = 1111111;
char a[S6], b[S6];
int p, q;
int ans, s[S6];
int main() {
gets(a);
gets(b);
int n = strlen(b);
p = -1;
for (int i = 0; i < (n); ++i)
if (a[i] == b[i])
p = i;
else
break;
q = n + 1;
for (int i = (n - 1); i >= (0); --i)
if (a[i + 1] == b[i])
q = i + 1;
else
break;
ans = 0;
for (int i = 0; i < (n + 1); ++i)
if (i <= p + 1 && i >= q - 1) s[ans++] = i;
printf("%d\n", ans);
if (ans) {
for (int i = 0; i < (ans - 1); ++i) printf("%d ", s[i] + 1);
printf("%d\n", s[ans - 1] + 1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T = 1;
for (int tt = 1; tt <= T; tt++) {
string s, t;
cin >> s >> t;
int f = 1, one = 1, u = 0, sz = s.size(), pas = sz - 1;
for (char x : t) {
if (x != s[u] && one)
pas = u, u++, one = 0;
else if (x != s[u])
f = 0;
if (x == s[u])
u++;
else
f = 0;
}
int v = pas - 1;
vector<int> ls;
if (f) {
ls.push_back(pas + 1);
while (v >= 0) {
if (s[pas] == s[v])
ls.push_back(v + 1);
else
break;
v--;
}
v = pas + 1;
while (v < sz) {
if (s[pas] == s[v])
ls.push_back(v + 1);
else
break;
v++;
}
sort(ls.begin(), ls.end());
cout << ls.size() << '\n';
for (int x : ls) cout << x << ' ';
} else
cout << "\t0";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string a, b;
cin >> a >> b;
long long n = a.length();
a = '+' + a;
b = '-' + b;
for (int i = 1; i <= n; i++) {
if (a[i] != b[i]) {
int check = 0;
for (int x = i + 1; x <= n; x++) {
if (a[x] != b[x - 1]) check = 1;
}
if (check == 1)
cout << "0" << endl;
else {
long long dem = 0, k = i;
while (a[k] == a[i]) {
dem++;
k--;
}
cout << dem << endl;
for (int j = k + 1; j <= i; j++) cout << j << " ";
}
break;
}
}
}
|
#include <bits/stdc++.h>
template <class T>
T sqr(T x) {
return x * x;
}
template <class T>
T lcm(T a, T b) {
return a / __gcd(a, b) * b;
}
template <class T>
T minimize(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
T maximize(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
const long long mod = 1e9 + 7, N = 1e6 + 6;
char str[2][N];
long long n, m;
long long H[4][N];
void Inp() {
scanf("%s", str[0] + 1);
scanf("%s", str[1] + 1);
n = strlen(str[0] + 1);
m = strlen(str[1] + 1);
}
void Hash_build() {
for (long long i = 1; i <= n; i++) H[0][i] = H[0][i - 1] * mod + str[0][i];
for (long long i = n; i > 0; --i) H[1][i] = H[1][i + 1] * mod + str[0][i];
for (long long i = 1; i <= m; i++) H[2][i] = H[2][i - 1] * mod + str[1][i];
for (long long i = m; i > 0; --i) H[3][i] = H[3][i + 1] * mod + str[1][i];
}
void Solve() {
vector<long long> Ans;
for (long long i = 1; i <= n; i++) {
if (H[0][i - 1] == H[2][i - 1] && H[1][i + 1] == H[3][i]) {
Ans.push_back(i);
}
}
cout << Ans.size() << '\n';
for (__typeof((Ans).begin()) it = (Ans).begin(); it != (Ans).end(); ++it)
cout << *it << " ";
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
Inp();
Hash_build();
Solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
inline int read() {
int w = 1, data = 0;
char ch = 0;
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ch <= '9') data = data * 10 + ch - '0', ch = getchar();
return w * data;
}
unsigned long long base = 927;
unsigned long long hal1[MAXN], har1[MAXN], hal2[MAXN], har2[MAXN];
int len1, len2;
char s1[MAXN], s2[MAXN];
vector<int> v;
int main() {
scanf("%s%s", s1 + 1, s2 + 1);
len1 = strlen(s1 + 1);
len2 = strlen(s2 + 1);
for (int i = 1; i <= len1; i++)
hal1[i] = hal1[i - 1] * base + (unsigned long long)s1[i];
for (int i = len1; i >= 1; i--)
har1[i] = har1[i + 1] * base + (unsigned long long)s1[i];
for (int i = 1; i <= len2; i++)
hal2[i] = hal2[i - 1] * base + (unsigned long long)s2[i];
for (int i = len2; i >= 1; i--)
har2[i] = har2[i + 1] * base + (unsigned long long)s2[i];
for (int i = 1; i <= len1; i++) {
unsigned long long a = hal1[i - 1] + har1[i + 1];
unsigned long long b = hal2[i - 1] + har2[i];
if (a == b) v.push_back(i);
}
if (!v.size())
printf("0");
else {
printf("%d\n", v.size());
int m = v.size();
for (int i = 0; i < m; i++) printf("%d ", v[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
string a, b;
cin >> a >> b;
set<int> s;
int cancelled = 0, index = a.size() - 1;
char letter = a[a.size() - 1];
for (int i = 0, j = 0; i < a.size() and j < b.size(); i++, j++) {
if (a[i] != b[j] and cancelled) {
cout << 0 << endl;
return 0;
} else if (a[i] != b[j]) {
letter = a[i];
cancelled = 1;
index = i;
if (i + 1 < a.size() and a[i + 1] != b[j]) {
cout << 0 << endl;
return 0;
}
i++;
}
}
s.insert(index);
for (int i = index + 1; i < a.size(); i++) {
if (a[i] != a[i - 1]) break;
s.insert(i);
}
for (int i = index - 1; i >= 0; i--) {
if (a[i] != a[i + 1]) break;
s.insert(i);
}
cout << s.size() << endl;
for (int i : s) cout << i + 1 << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int lowbit(int x) { return x & (-x); }
string s1, s2;
int main() {
cin >> s1 >> s2;
int p = 0, q = 0;
for (int i = 0; i < s2.size(); i++) {
if (s1[i] == s2[i])
p++;
else
break;
}
for (int i = s2.size() - 1; i >= 0; i--) {
if (s1[i + 1] == s2[i])
q++;
else
break;
}
if (p - ((int)s1.size() - q) + 2 > 0) {
cout << p - ((int)s1.size() - q) + 2 << endl;
for (int i = (int)s1.size() - q; i <= p + 1; i++) cout << i << " ";
} else
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s1, s2;
cin >> s1 >> s2;
int index = -1;
for (int i = 0; i < s2.length(); i++) {
if (s1[i] != s2[i]) {
index = i;
break;
}
}
if (index == -1) index = s1.length() - 1;
for (int i = index + 1; i < s1.length(); i++) {
if (s1[i] != s2[i - 1]) {
cout << 0 << '\n';
return 0;
}
}
int r, l;
char c = s1[index];
vector<int> v;
v.push_back(index + 1);
for (int i = index + 1; i < s1.length(); i++) {
if (s1[i] == c && s1[i - 1] == c)
v.push_back(i + 1);
else
break;
}
for (int i = index - 1; i >= 0; i--) {
if (s1[i] == c && s1[i + 1] == c)
v.push_back(i + 1);
else
break;
}
sort(v.begin(), v.end());
cout << v.size() << '\n';
for (int x : v) cout << x << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, m, i, sum = 0;
int a[101];
m = -1;
scanf("%d%d", &n, &s);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (m < a[i]) {
m = a[i];
}
sum += a[i];
}
if (sum - m <= s) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int arr[n + 1];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += arr[i];
}
if (sum <= s)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, m, i, j, temp, s = 0;
scanf("%d %d", &n, &m);
int a[n];
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
for (j = 0; j < n - i; j++) {
if (a[j] > a[j + 1]) {
temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
for (i = 0; i < n - 1; i++) s = s + a[i];
if (s > m)
printf("NO");
else if (s <= m)
printf("YES");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, i, v = 0, a[1010];
cin >> n >> s;
for (i = 1; i <= n; i++) {
cin >> a[i];
v = v + a[i];
}
for (i = 1; i <= n; i++)
if ((v - a[i]) <= s) {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int sum = 0, m = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
m = max(m, a);
}
if (sum - m <= s)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
int main() {
int n, s, v, t(0), m(0);
std::scanf("%d%d", &n, &s);
for (int i(0); i < n; ++i) {
std::scanf("%d", &v);
t += v;
m = std::max(m, v);
}
t -= m;
std::puts(t <= s ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5 + 9;
long long n, ans, cap;
long long a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cerr << "";
cin >> n >> cap;
for (int i = 0; i < (n); i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < (n - 1); i++) cap -= a[i];
if (cap >= 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k = 1, s = 0, n, v;
cin >> n >> v;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
v -= a[i];
s = max(v, a[i]);
}
sort(a, a + n);
if (v < -a[n - 1])
cout << "NO\n";
else
cout << "YES\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, x, max = -1, i, s = 0;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> x;
if (max < x) {
max = x;
}
s += x;
}
if (s - max > k) {
cout << "NO";
} else {
cout << "YES";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, sum = 0;
cin >> n >> s;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
cout << (sum - a[n - 1] > s ? "NO" : "YES");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long currentMax(0), total(0);
long n(0), s(0);
cin >> n >> s;
while (n--) {
int temp(0);
cin >> temp;
if (temp > currentMax) {
currentMax = temp;
}
total += temp;
}
total -= currentMax;
if (total <= s)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[2000];
int main() {
int x, y, z, n;
int i, j, m, top = 0;
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++) scanf("%d", &arr[i]);
sort(arr, arr + n);
for (i = 0; i < n - 1; i++) top += arr[i];
if (top > m)
printf("NO");
else
printf("YES");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
scanf("%d%d", &n, &s);
int a, max, sum = 0;
scanf("%d", &a);
max = a;
sum += a;
for (int i = 1; i < n; i++) {
scanf("%d", &a);
if (a > max) max = a;
sum += a;
}
sum -= max;
if (sum <= s)
printf("YES");
else
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, mx = -1e8, sum;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
sum += t;
mx = max(t, mx);
}
if (sum - mx <= m)
cout << "YES\n";
else
cout << "NO\n";
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
int n, s, x, add = 0;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
for (int i = 0; i < n - 1; i++) {
add += v[i];
}
if (add <= s) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = int(1e9) + 123;
int main() {
int n, v;
cin >> n >> v;
vector<int> a;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = 0; i < a.size() - 1; i++) {
sum += a[i];
}
if (sum <= v) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int sum = 0;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - 1; i++) {
sum += a[i];
}
if (sum <= s)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[100009], b[100009];
int main() {
long long int i, j, k, l, m, n, flag, count, sum, ans, t, A, B, C, D, x, y, z,
diff, count2, count3, max;
while (scanf("%I64d", &n) == 1) {
cin >> m;
sum = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
if (i == 1)
max = a[i];
else {
if (a[i] > max) max = a[i];
}
sum += a[i];
}
sum -= max;
if (sum > m)
printf("NO\n");
else
printf("YES\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int main() {
int n, s;
cin >> n >> s;
int a[N] = {0};
int mini = N, pos = -1, ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int k = 0; k < n - 1; k++) {
for (int i = 0; i < n; i++) {
if (mini > a[i]) {
mini = a[i];
pos = i;
}
}
if (pos != -1) a[pos] = N + 1;
ans += mini;
mini = N;
}
if (ans <= s)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100], s, sum = 0;
cin >> n >> s;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - 1; i++) sum += a[i];
if (sum <= s)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, v, arr[100000], c = 0, b = 0;
cin >> n >> v;
for (long long i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
for (long long i = 0; i < n; i++) {
if (c + arr[i] <= v) {
c = c + arr[i];
b = b + 1;
}
}
if (b == n || n - b == 1) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, sum = 0, big;
cin >> n >> s;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
sort(arr, arr + n);
big = arr[n - 1];
if (sum - big <= s)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, in;
vector<int> v;
int sum = 0;
cin >> n >> s;
int i;
bool flag = true;
for (i = 0; i < n; i++) {
cin >> in;
v.push_back(in);
}
sort(v.begin(), v.begin() + v.size());
for (i = 0; i < n - 1; i++) {
sum += v[i];
}
if (sum <= s)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
void solution();
solution();
return 0;
}
const int maxn = 100;
int a[maxn];
void solution() {
int n, s;
scanf("%i%i", &n, &s);
for (int i = 0; i < n; i++) {
scanf("%i", &a[i]);
}
sort(a, a + n);
for (int i = 0; i < n - 1; i++) {
s -= a[i];
}
if (s < 0)
printf("NO\n");
else
printf("YES\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int comp(const void* a, const void* b) { return (*(int*)a - *(int*)b); }
struct vidr {
int x;
int y;
};
int main() {
int n, s, max = 0;
cin >> n >> s;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
s -= x;
if (max < x) {
max = x;
}
}
s += max;
if (s >= 0) {
cout << "YES";
} else {
cout << "NO";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d = 0, e = 0, f = 0, g = 0, h[200001], i = 1, j, k,
p[200001], r, n[200001], m[200001];
string s, t, x;
cin >> a >> b;
for (i = 1; i <= a; i++) {
cin >> p[i];
d += p[i];
}
sort(p + 1, p + a + 1);
if (d - p[a] <= b) {
cout << "YES";
} else {
cout << "NO";
}
}
|
#include <bits/stdc++.h>
int sort(int arr[], int n) {
int temp = 0, i;
for (i = 0; i < n; i++) {
if (temp <= arr[i]) {
temp = arr[i];
}
}
return temp;
}
int sum(int arr[], int n) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum = sum + arr[i];
}
return sum;
}
int main() {
int n, vol, i = 0, *ptr, max, add;
scanf("%d %d", &n, &vol);
ptr = (int*)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &ptr[i]);
}
max = sort(ptr, n);
add = sum(ptr, n);
if ((add - max) <= vol) {
printf("YES");
} else
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int ar[n], c = 0;
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
sort(ar, ar + n);
for (int i = 0; i < n - 1; i++) {
c += ar[i];
}
if (c <= s)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
int max = 0;
int n, s, temp;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cin >> temp;
if (temp > max) max = temp;
sum += temp;
}
sum -= max;
if (sum <= s)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
template <int POS, class TUPLE>
void deploy(std::ostream &os, const TUPLE &tuple) {}
template <int POS, class TUPLE, class H, class... Ts>
void deploy(std::ostream &os, const TUPLE &t) {
os << (POS == 0 ? "" : ", ") << get<POS>(t);
deploy<POS + 1, TUPLE, Ts...>(os, t);
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &v) {
int remain = v.size();
os << "{";
for (auto e : v) os << e << (--remain == 0 ? "}" : ", ");
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::set<T> &v) {
int remain = v.size();
os << "{";
for (auto e : v) os << e << (--remain == 0 ? "}" : ", ");
return os;
}
template <class T, class K>
std::ostream &operator<<(std::ostream &os, std::map<T, K> &make_pair) {
int remain = make_pair.size();
os << "{";
for (auto e : make_pair)
os << "(" << e.first << " -> " << e.second << ")"
<< (--remain == 0 ? "}" : ", ");
return os;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n, q;
cin >> n >> q;
vector<int> nums;
int sums = 0;
for (int i = 0; i < (n); i++) {
int x;
cin >> x;
nums.push_back(x);
sums += x;
}
sums -= *max_element((nums).begin(), (nums).end());
if (sums <= q) {
cout << "YES\n";
} else {
cout << "NO\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int g = 0;
int n, m;
int a[100000];
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
for (int i = 1; i < n; i++) {
g += a[i];
}
if (g > m)
cout << "NO";
else
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s, a[1000000], bank;
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) {
cin >> a[i];
bank += a[i];
}
sort(a, a + n);
if (bank - a[n - 1] <= s)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s, a[1001], sum, mx;
int main() {
cin >> n >> s;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
mx = max(mx, a[i]);
}
if (sum - mx <= s) {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool s_end(size_t c) { return (c == string ::npos) ? true : false; }
int main() {
int n, s;
cin >> n >> s;
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sum -= *max_element(a, a + n);
if (sum <= s)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
int n, s;
cin >> n >> s;
int cnt = 0, sum = 0;
int a[n + 9];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - 1; ++i) {
sum += a[i];
}
if (sum > s) {
cout << "NO\n";
} else
cout << "YES\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int sum = 0, m = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
if (a > m) m = a;
}
sum -= m;
if (s >= sum)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
int a[1005], i;
while (scanf("%d%d", &n, &s) != EOF) {
int sum = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
for (i = 0; i < n - 1; i++) sum += a[i];
if (sum <= s)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0, s = 0, a[100], number = 0;
int sum = 0;
cin >> n >> s;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; ++i) {
int k = 0;
k = sum - a[i];
if (k <= s) number++;
}
if (number >= 1)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, s, i, j;
int a[100];
scanf("%d", &n);
scanf("%d", &s);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (a[i] >= a[j]) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
int sum = 0;
for (i = 0; i < n - 1; i++) {
sum += a[i];
}
if (sum > s)
printf("NO\n");
else
printf("YES\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s, sum, ma;
int main() {
scanf("%d%d", &n, &s);
for (int i(0); i < n; ++i) {
int a;
scanf("%d", &a);
sum += a, ma = ma > a ? ma : a;
}
sum -= ma;
if (sum > s)
puts("NO");
else
puts("YES");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int s;
cin >> n;
cin >> s;
int arr[n];
int sum = 0;
for (int i = 0; i < n; i++) cin >> arr[i];
bool t = false;
for (int i = 0; i < n; i++) sum += arr[i];
for (int i = 0; i < n; i++)
if ((sum - arr[i]) < s || (sum - arr[i]) == s) {
t = true;
cout << "YES" << endl;
break;
}
if (!t) cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ara[1000005], i, j, k, n, m, sum;
int main() {
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> ara[i];
}
sort(ara, ara + n);
j = n - 1;
while (j--) {
sum += ara[k++];
}
if (sum <= m)
printf("YES");
else
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, S, d = 0, A[100];
cin >> N >> S;
for (i = 0; i < N; ++i) {
cin >> A[i];
d += A[i];
}
if (d - A[max_element(A, A + N) - A] <= S)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, c = 0;
cin >> n >> s;
int x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
}
sort(x, x + n);
for (int i = 0; i < n - 1; i++) {
c = c + x[i];
}
if (c <= s) {
cout << "YES";
} else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (scanf("%d%d", &n, &m) != EOF) {
int a[10000];
memset(a, 0, sizeof(a));
int i;
for (i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
int sum = 0;
for (i = 0; i < n - 1; i++) {
sum += a[i];
}
if (sum > m)
printf("NO\n");
else
printf("YES\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int i, x, n, s, maks = 0, sum = 0;
scanf("%d %d", &n, &s);
for (i = 0; i < n; ++i) {
scanf("%d", &x);
sum += x;
maks = max(maks, x);
}
if (sum - maks <= s)
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void merge_sort(vector<int> &arr, int start, int end);
int main(void) {
int n, s;
cin >> n >> s;
vector<int> a(n, 0);
for (int i = 0; i < n; ++i) cin >> a[i];
merge_sort(a, 0, n - 1);
int sum{};
for (int i = 0; i < n - 1; ++i) sum += a[i];
if (sum > s)
cout << "NO";
else
cout << "YES";
return 0;
}
void merge_sort(vector<int> &arr, int start, int end) {
if (start >= end) return;
int mid = (start + end) / 2;
merge_sort(arr, start, mid);
merge_sort(arr, mid + 1, end);
vector<int> a, b;
for (int i = start; i <= mid; ++i) a.push_back(arr[i]);
for (int i = mid + 1; i <= end; ++i) b.push_back(arr[i]);
int i = 0, j = 0, k = start;
while (i < a.size() && j < b.size())
if (a[i] < b[j])
arr[k++] = a[i++];
else
arr[k++] = b[j++];
while (i < a.size()) arr[k++] = a[i++];
while (j < b.size()) arr[k++] = b[j++];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int a[1000];
int friends = n - 1;
int i = 0;
int temp = n;
while (n--) {
a[i] = 0;
cin >> a[i];
++i;
}
for (int i = 0; i < temp; ++i) {
for (int j = i + 1; j < temp; ++j) {
if (a[j] < a[i]) swap(a[i], a[j]);
}
}
i = 0;
while (temp--) {
if (s - a[i] >= 0 && friends != 0) {
s -= a[i];
friends--;
}
++i;
}
cout << (friends == 0 ? "YES" : "NO");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
while (scanf("%d %d", &n, &s) == 2) {
vector<int> v;
int t;
for (int i = 0; i < n; i++) {
scanf("%d", &t);
v.push_back(t);
}
sort(v.begin(), v.end());
int ans = 0;
for (int i = 0; i < n - 1; i++) {
ans += v[i];
}
if (ans <= s)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
int vu;
int a[1000];
cin >> n >> s;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
int sum = 0;
for (int i = 1; i <= n - 1; i++) sum += a[i];
if (sum <= s)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, s;
multiset<long long> a;
void initialization() {
cin >> n >> s;
for (long long i = 0; i < n; ++i) {
long long c;
cin >> c;
a.insert(c);
}
}
void solve() {}
void print() {}
int main() {
ios::sync_with_stdio(0);
initialization();
solve();
print();
long long cur = 0, sum = 0;
auto it = a.begin();
while (cur < n - 1) {
sum += *it;
it++;
cur++;
}
if (sum <= s)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e2 + 10;
int n, s, a[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> s;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
int sum = 0;
for (int i = 0; i < n - 1; i++) sum += a[i];
if (sum <= s)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s;
cin >> n >> s;
int a[n], i = 0, sum = 0, max = 0;
for (; i < n; i++) {
cin >> a[i];
sum += a[i];
max = max > a[i] ? max : a[i];
}
if ((sum - max) > s)
cout << "NO";
else
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long SUM = 0;
int n, m, a[10001];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i], SUM += a[i];
}
sort(a, a + n);
if (SUM - a[n - 1] > m) {
cout << "NO";
} else
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, sum = 0;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
for (int j = 0; j < n - 1; j++) {
sum = sum + arr[j];
}
if (sum <= k)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
int n, k, s = 0, max = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
s += a[i];
if (a[i] > max) max = a[i];
}
s -= max;
if (s <= k) {
cout << "YES";
return 0;
} else {
cout << "NO";
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, sum, mx, a, s;
int main(int argc, const char* argv[]) {
scanf("%d %d", &n, &s);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
sum += a;
mx = max(a, mx);
}
sum -= mx;
if (sum <= s) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int N, S, i, a, max = 0, sum = 0;
scanf("%d%d", &N, &S);
for (i = 0; i < N; i++) {
scanf("%d", &a);
if (max < a) max = a;
sum += a;
}
if ((sum - max) > S)
printf("NO");
else
printf("YES");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, a[1000];
int max = 0;
scanf("%d%d", &n, &s);
int sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] > max) max = a[i];
}
int flag = 1;
for (int i = 0; i < n; i++) {
if (a[i] == max && flag) {
flag = 0;
} else {
sum += a[i];
}
}
if (sum <= s)
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, s;
cin >> n >> s;
int a[n], c = 0, i, m = 0;
for (i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] > m) m = a[i];
c += a[i];
}
c -= m;
if (c <= s)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int m, s, a, b, c, d, sum;
int main() {
cin >> m >> s;
for (int i = 0; i < m; i++) {
cin >> a;
b += a;
c = max(a, c);
}
if (b - c <= s)
cout << "YES";
else
cout << "NO";
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.