text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
long long powmod(long long a, long long b, long long mod) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res % mod;
}
const int N = 1e5 + 10;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<pair<long long, int> > a(n + 1);
a[0].first = 0, a[0].second = 0;
long long pref[n + 1], sum = 0;
pref[0] = 0;
for (int i = 1; i <= n; ++i)
cin >> a[i].first, a[i].second = i, sum += a[i].first,
pref[i] = a[i].first + pref[i - 1];
vector<int> ans;
sort(a.begin(), a.end());
for (int i = n; i > 0; --i) {
long long x = sum - a[i].first;
long long rem = 0;
if (i == n) {
x -= a[n - 1].first;
if (x == a[n - 1].first) ans.push_back(a[i].second);
} else {
x -= a[n].first;
if (x == a[n].first) ans.push_back(a[i].second);
}
}
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() {
long long n;
cin >> n;
long long a[n];
long long sum = 0;
multiset<long long> s;
std::vector<pair<long long, long long> > vv;
for (long long i = 0; i < n; i++) {
cin >> a[i];
vv.push_back(make_pair(a[i], i + 1));
sum += a[i];
}
vector<long long> ans;
stable_sort(vv.begin(), vv.end());
for (long long i = 0; i < n; i++) {
long long ps = sum - vv[i].first;
if (i == n - 1) {
if (ps - vv[n - 2].first == vv[n - 2].first) {
ans.push_back(vv[i].second);
}
} else {
if (ps - vv[n - 1].first == vv[n - 1].first) {
ans.push_back(vv[i].second);
}
}
}
cout << ans.size() << endl;
for (long long i = 0; i < ans.size(); i++) cout << ans[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
class xxx {
public:
xxx(int x) : i(x) {}
int i;
void operator()() const { cout << i << endl; }
};
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
const long long mod = 1e9 + 7;
inline long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
class RMQ {
public:
std::vector<long long> v;
vector<vector<long long>> f;
RMQ(vector<long long> &t) {
v = t;
build();
}
void build() {
int n = v.size();
int level = log(n) / log(2) + 1;
f = vector<vector<long long>>(n, vector<long long>(level, 0));
for (int i = 0; i < n; ++i) f[i][0] = v[i];
for (int i = 1; i < level; ++i) {
for (int j = 0; j <= n - (1 << i); ++j) {
f[j][i] = gcd(f[j][i - 1], f[j + (1 << i - 1)][i - 1]);
}
}
}
long long query(int l, int r) {
int k = log(r - l + 1) / log(2);
return gcd(f[l][k], f[r - (1 << k) + 1][k]);
}
};
const long long INF = LLONG_MAX;
const int maxn = 2e5 + 5;
long long n, m;
long long sums = 0;
int k;
void read1() {}
const int N = 200010;
long long a[N];
long long pre[N];
int l[N], r[N];
int b[N][19];
void solve() {
int n;
cin >> n;
long long sum = 0;
unordered_map<long long, int> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
m[a[i]]++;
}
vector<int> res;
for (int i = 0; i < n; ++i) {
if ((sum - a[i]) % 2) continue;
long long tot = (sum - a[i]) / 2;
m[a[i]]--;
if (m.count(tot) and m[tot] >= 1) {
res.push_back(i);
}
m[a[i]]++;
}
cout << res.size() << endl;
for (auto x : res) {
cout << x + 1 << " ";
}
cout << endl;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int tests = 1;
for (int tc = 1; tc <= tests; tc++) {
solve();
cout << flush;
}
return 0;
}
int _, __;
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
long long sum = 0;
long long b[n], a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
sum += a[i];
}
sort(b, b + n);
vector<int> ans;
for (int i = 0; i < n; i++) {
if (a[i] != b[n - 1] and sum - a[i] - b[n - 1] == b[n - 1]) {
ans.push_back(i + 1);
}
if (a[i] == b[n - 1] and sum - a[i] - b[n - 2] == b[n - 2]) {
ans.push_back(i + 1);
}
}
cout << ans.size() << "\n";
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
return x * f;
}
struct node {
int val, idx;
bool operator<(const node &a) const { return val < a.val; }
} a[200005];
int n;
long long sum[200005];
vector<int> ver;
int my_upper_bound(int x) {
int L = 1, R = n - 1, mid, ans = n;
while (L <= R) {
mid = (L + R) >> 1;
if (a[mid].val > x) {
ans = mid;
R = mid - 1;
} else {
L = mid + 1;
}
}
return ans;
}
int my_lower_bound(int x) {
int L = 1, R = n - 1, mid, ans = n;
while (L <= R) {
mid = (L + R) >> 1;
if (a[mid].val >= x) {
ans = mid;
R = mid - 1;
} else {
L = mid + 1;
}
}
return ans;
}
void solve() {
for (register int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + a[i].val;
}
long long t = sum[n - 1] - a[n].val;
if (t > 0 && t <= a[n].val) {
int t2 = my_upper_bound(t);
int t1 = my_lower_bound(t);
for (register int i = t1; i <= t2 - 1; i++) {
ver.push_back(a[i].idx);
}
}
if (a[n - 1].val == sum[n - 2]) ver.push_back(a[n].idx);
printf("%d\n", ver.size());
for (int i = 0; i < ver.size(); i++) {
printf("%d%c", ver[i], i == ver.size() - 1 ? '\n' : ' ');
}
}
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; i++) {
a[i].val = read();
a[i].idx = i;
}
sort(a + 1, a + 1 + n);
if (n > 2)
solve();
else
puts("0");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
pair<long long, int> a[200005];
bool dd[1000005];
bool cmp(const pair<long long, int> &a, const pair<long long, int> &b) {
return a.first > b.first;
}
int main() {
cout << setprecision(10) << fixed;
ios::sync_with_stdio(false), cin.tie(0);
cin >> n;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i].first;
sum += a[i].first;
a[i].second = i + 1;
}
sort(a, a + n, cmp);
int res = 0;
if (a[1].first == sum - a[1].first - a[0].first)
res++, dd[a[0].second] = true;
for (int i = 1; i < n; i++)
if (a[0].first == sum - a[i].first - a[0].first)
res++, dd[a[i].second] = true;
cout << res << endl;
for (int i = 1; i <= n; i++)
if (dd[i]) cout << i << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[1000005];
long long int b[1000005];
vector<long long int> v;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i;
cin >> n;
long long int sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
sum += a[i];
}
sort(b, b + n);
long long int max = b[n - 1];
long long int max1 = b[n - 2];
for (i = 0; i < n; i++) {
long long int temp = sum - a[i];
if (a[i] != b[n - 1] && temp == 2 * max)
v.push_back(i + 1);
else if (a[i] == b[n - 1] && temp == 2 * max1)
v.push_back(i + 1);
}
cout << (long long int)(v.size()) << endl;
for (i = 0; i < (long long int)(v.size()); i++) cout << v[i] << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct shu {
int d;
int m;
long long int s;
} a[200005];
bool cmp(shu a, shu b) { return a.d > b.d; }
int main() {
vector<int> v;
int i, j, n, m;
cin >> n;
long long int sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i].d;
a[i].m = i + 1;
sum += a[i].d;
}
for (i = 0; i < n; i++) {
a[i].s = sum - a[i].d;
}
sort(a, a + n, cmp);
if (a[0].s % 2 == 0 && a[0].s / 2 == a[0].s - a[1].d) v.push_back(a[0].m);
int k = 1;
while (k < n) {
if (a[k].s % 2 == 0 && a[k].s / 2 == a[k].s - a[0].d) v.push_back(a[k].m);
k++;
}
if (v.size() == 0)
cout << 0 << endl << endl;
else
cout << v.size() << endl;
for (i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vll = vector<ll>;
using pll = pair<ll, ll>;
using vvi = vector<vi>;
constexpr int mod = 1000000007;
constexpr int inf = 0x3f3f3f3f;
inline ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
}
return res;
}
int main() {
int n;
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
vll v(n);
unordered_map<long long, int> freq;
for (auto& x : v) cin >> x;
for (auto& x : v) freq[x]++;
long long soma =
accumulate((v).begin(), (v).end(), 0ll, [](ll a, ll b) { return a + b; });
vi good;
for (int i = 0; i < n; ++i) {
ll x = v[i];
long long rem = soma - x;
if (rem % 2) continue;
long long want = rem / 2;
if (want == x) {
if (freq[want] > 1) good.push_back(i + 1);
} else {
if (freq[want]) good.push_back(i + 1);
}
}
cout << ((int)(good).size()) << endl;
for (const int& x : good) cout << x << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[1000009], b[1000009], c[1000009];
vector<int> v;
int main() {
int i, j, n, x, y, m;
scanf("%d", &n);
long long int z = 0, zz;
for (i = 1; i <= n; i++) {
cin >> a[i];
c[a[i]]++;
z += 1ll * a[i];
}
for (i = 1; i <= n; i++) {
zz = z - 2 * a[i];
if (a[i] == zz) {
if (c[zz] > 1) {
b[zz] = 1;
}
} else if (zz > 0 && zz <= 1000000) {
b[zz] = 1;
}
}
for (i = 1; i <= n; i++) {
if (b[a[i]]) {
v.push_back(i);
}
}
cout << ((long long int)(v).size()) << endl;
;
for (auto p : v) {
cout << p << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long n, m, p, k, i, s, a[200005], b[200005], c[200005], x;
int main() {
cin >> n;
m = 0;
p = 0;
k = 0;
s = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
s += a[i];
c[i] = a[i];
}
m = a[1];
x = 1;
for (i = 2; i <= n; i++)
if (a[i] > m) {
m = a[i];
x = i;
}
a[x] = 0;
p = a[1];
for (i = 2; i <= n; i++)
if (a[i] > p) p = a[i];
s -= m;
a[x] = m;
for (i = 1; i <= n; i++)
if (a[i] != m && m == s - a[i]) {
k++;
b[k] = i;
} else if (a[i] == m && p == s - p) {
k++;
b[k] = i;
}
cout << k << endl;
for (i = 1; i <= k; i++) cout << b[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, sum = 0;
cin >> n;
vector<long long int> v;
vector<long long int> u;
map<long long int, long long int> m;
for (i = 1; i <= n; i++) {
long long int x;
cin >> x;
v.push_back(x);
m[x]++;
sum += x;
}
for (i = 0; i < n; i++) {
sum -= v[i];
m[v[i]]--;
if (sum % 2 == 0) {
long long int ans = sum / 2;
if (m[ans] > 0) {
u.push_back(i + 1);
}
m[v[i]]++;
sum += v[i];
} else {
m[v[i]]++;
sum += v[i];
}
}
if (u.size() == 0)
cout << 0 << endl;
else {
cout << u.size() << endl;
for (i = 0; i < u.size(); i++) {
cout << u[i] << " ";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long sum;
struct myS {
int index;
long long v;
myS(){};
myS(int index, long long v) : index(index), v(v){};
bool operator<(const myS& right) const { return v < right.v; }
} a[200001];
bool dd[1000001];
vector<int> res;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout.tie(0);
;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].v;
sum += a[i].v;
a[i].index = i;
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) {
long long le = sum - a[i].v;
if (le % 2 == 1) continue;
long long need = (le >> 1);
auto it = lower_bound(a + 1, a + n + 1, myS(0, need));
if ((*it).v == need && (*it).index != a[i].index)
res.push_back(a[i].index);
else if ((*it).v == need && (*it).index == a[i].index) {
auto it2 = upper_bound(a + 1, a + n + 1, myS(0, need));
while (it != it2) {
if ((*it).index != a[i].index) {
res.push_back(a[i].index);
break;
} else
it++;
}
}
}
cout << res.size() << endl;
for (auto i : res) cout << i << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const int N = 2e5 + 5;
const long long INF = 1e18;
void solve() {
int n;
cin >> n;
vector<int> a(n);
long long sum = 0;
multiset<int, greater<int>> second;
for (int i = (0); i < (n); ++i) {
cin >> a[i];
second.insert(a[i]);
sum += a[i];
}
vector<int> nice;
for (int i = (0); i < (n); ++i) {
auto p = second.find(a[i]);
second.erase(p);
p = second.begin();
sum = sum - a[i] - *p;
if (sum == *p) nice.push_back(i + 1);
sum += a[i] + *p;
second.insert(a[i]);
}
cout << (int)(nice).size() << '\n';
for (auto x : nice) cout << x << " ";
return;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
long long int a[1000001];
vector<long long int> ans;
int main() {
long long int n, x, sum = 0, i, j;
scanf("%lld", &n);
for (i = 0; i <= 1000000; i++) a[i] = 0;
long long int b[n];
for (i = 0; i < n; i++) {
scanf("%lld", &b[i]);
a[b[i]]++;
sum += b[i];
}
for (i = 0; i < n; i++) {
if ((sum - b[i]) % 2 == 0) {
a[b[i]]--;
if ((sum - b[i]) / 2 <= 1000000 && a[(sum - b[i]) / 2] >= 1)
ans.push_back(i);
a[b[i]]++;
}
}
printf("%lld\n", (long long int)ans.size());
for (i = 0; i < ans.size(); i++) printf("%lld ", ans[i] + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, X, i, sum = 0, c = 0, big = 0, sb = 0, bi = 0, sbi = 0;
cin >> N;
long long int arr[N], s[N];
for (i = 0; i < N; i++) {
scanf("%lld", &arr[i]);
sum += arr[i];
if (arr[i] > big) {
sb = big;
big = arr[i];
sbi = bi;
bi = i;
} else if (arr[i] > sb) {
sb = arr[i];
sbi = i;
}
}
sum -= big;
for (i = 0; i < N; i++) {
if (i != bi) {
if (sum - arr[i] == big) {
s[c++] = i + 1;
}
}
}
if (sum - sb == sb) {
s[c++] = bi + 1;
}
cout << c << endl;
for (i = 0; i < c; i++) cout << s[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template <typename T>
inline T LCM(T a, T b) {
return (a * b) / GCD(a, b);
}
template <typename T>
inline T GCD(T a, T b) {
ll t;
while (a) {
t = a;
a = b % a;
b = t;
}
return b;
}
template <typename T>
inline string toString(T a) {
return to_string(a);
}
template <typename T>
inline void toInt(string s, T &x) {
stringstream str(s);
str >> x;
}
inline ll add(ll x, ll y) {
x += y;
if (x >= 1000000007) x -= 1000000007;
return x;
}
inline ll sub(ll x, ll y) {
x -= y;
if (x < 0) x += 1000000007;
return x;
}
inline ll mul(ll x, ll y) {
return ((x % 1000000007) * (y % 1000000007)) % 1000000007;
}
inline ll powr(ll a, ll b) {
ll x = 1LL;
while (b) {
if (b & 1) x = mul(x, a);
a = mul(a, a);
b >>= 1;
}
return x;
}
inline ll inv(ll a) { return powr(a, 1000000007 - 2); }
const int inv2 = (1000000007 + 1) >> 1;
const ll INF = 999999999999999999;
const int inf = 999999999;
bool check(ll n) {
if (n == 1) return 0;
if (n == 2 or n == 3) return 1;
if (n % 2 == 0 or n % 3 == 0) return 0;
for (ll i = 5; i * i <= n; i += 6)
if (n % i == 0 or n % (i + 2) == 0) return 0;
return 1;
}
const int N = 2 * 100004;
ll tree[4 * N];
vector<ll> v;
void make(int l, int r, int pos) {
if (l == r) {
tree[pos] = v[l];
return;
}
int mid = (l + r) / 2;
make(l, mid, 2 * pos + 1);
make(mid + 1, r, 2 * pos + 2);
tree[pos] = max(tree[2 * pos + 1], tree[2 * pos + 2]);
}
ll query(int l, int r, int low, int high, int pos) {
if (l > r) {
return -inf;
}
if (r < low or high < l) {
return -inf;
}
if (low <= l and r <= high) {
return tree[pos];
}
int mid = (l + r) / 2;
return max(query(l, mid, low, high, 2 * pos + 1),
query(mid + 1, r, low, high, 2 * pos + 2));
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
int n;
cin >> n;
ll s1 = 0;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
v.push_back(x);
s1 += x;
}
vector<int> ans;
make(0, n - 1, 0);
for (int i = 0; i < n; i++) {
ll u = s1 - v[i];
if (i == 0) {
ll d = query(0, n - 1, i + 1, n - 1, 0);
if (d == u - d) {
ans.push_back(i + 1);
}
} else if (i == n - 1) {
ll d = query(0, n - 1, 0, n - 2, 0);
if (d == u - d) {
ans.push_back(i + 1);
}
} else {
ll d1 = query(0, n - 1, 0, i - 1, 0);
ll d2 = query(0, n - 1, i + 1, n - 1, 0);
ll d = max(d1, d2);
if (d == u - d) {
ans.push_back(i + 1);
}
}
}
cout << ans.size(), cout << "\n";
for (auto x : ans) {
cout << x, cout << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n;
cin >> n;
long long int a[n + 1];
vector<long long int> v;
long long int sum = 0;
long long int b[n + 1];
b[0] = 0;
for (long long int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
b[i] = a[i];
}
sort(b, b + n + 1);
for (long long int i = 1; i <= n; i++) {
if (a[i] != b[n]) {
if (sum - a[i] - b[n] == b[n]) v.push_back(i);
} else {
if (sum - a[i] - b[n - 1] == b[n - 1]) v.push_back(i);
}
}
cout << v.size() << "\n";
for (auto x : v) cout << x << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, sum = 0;
cin >> n;
vector<int> a;
map<long long, long long> mp;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
a.push_back(t);
mp[t]++;
sum += t;
}
vector<long long> ans;
for (int i = 0; i < n; i++) {
sum -= a[i];
mp[a[i]]--;
if (sum % 2 == 0 && sum / 2 <= pow(10, 6) && mp[sum / 2] > 0)
ans.push_back(i);
;
sum += a[i];
mp[a[i]]++;
}
cout << ans.size() << endl;
for (auto i : ans) cout << i + 1 << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000007, inf = 0x3f3f3f3f;
long long v[N];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
long long sum = 0;
set<pair<long long, int> > st;
for (int i = 0; i < n; ++i) {
cin >> v[i];
sum += v[i];
st.insert(make_pair(v[i], i));
}
set<int> ans;
for (int i = 0; i < n; ++i) {
sum -= v[i];
st.erase(make_pair(v[i], i));
if (sum > v[i]) {
auto it = st.lower_bound(make_pair(sum - v[i], 0));
vector<pair<long long, int> > vec;
while (it != st.end() and it->first == sum - v[i]) {
ans.insert(it->second);
vec.push_back(*it);
it++;
}
for (auto x : vec) st.erase(x);
}
st.insert(make_pair(v[i], i));
sum += v[i];
}
cout << ans.size() << endl;
for (int x : ans) {
cout << x + 1 << " ";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ch;
long long sum = 0;
multiset<int> sett;
multiset<int> ans;
cin >> n;
vector<int> num(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> ch;
num[i] = ch;
sett.insert(ch);
sum += ch;
}
for (int i = 1; i <= sett.size(); i++) {
sett.erase(sett.find(num[i]));
if (sum - num[i] - (*sett.rbegin()) == (*sett.rbegin())) ans.insert(i);
sett.insert(num[i]);
}
cout << ans.size() << endl;
for (auto it = ans.begin(); it != ans.end(); it++) cout << *it << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, sum = 0;
cin >> n;
long long int a, i;
vector<pair<long long int, long long int>> v1;
for (i = 0; i < n; ++i) {
cin >> a;
sum += a;
v1.push_back(make_pair(a, i + 1));
}
sort(v1.begin(), v1.end());
vector<long long int> v;
for (i = 0; i < v1.size(); ++i) {
if (i != v1.size() - 1) {
if (v1[v1.size() - 1].first ==
sum - v1[i].first - v1[v1.size() - 1].first)
v.push_back(v1[i].second);
} else {
if (v1[v1.size() - 2].first ==
sum - v1[i].first - v1[v1.size() - 2].first)
v.push_back(v1[i].second);
}
}
cout << (int)v.size() << endl;
for (i = 0; i < v.size(); ++i) cout << v[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200005];
vector<int> ans;
int main() {
int n, maxx = 0, cnt = 0, now = 0;
long long sum = 0;
bool flag = 0, flag1 = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum += a[i];
if (maxx < a[i]) {
maxx = a[i];
now = i;
}
}
sum -= maxx;
int max2 = 0;
for (int i = 1; i <= n; i++) {
if (now != i) {
max2 = max(max2, a[i]);
if (sum - a[i] == maxx) ans.push_back(i);
}
}
if (sum - max2 == max2) ans.push_back(now);
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int arr[2 * 100010], cnt[1000010] = {0};
long long sum = 0;
vector<int> ans;
int main() {
cin.tie(0), ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
sum += arr[i];
++cnt[arr[i]];
}
for (int i = 0; i < n; ++i) {
sum -= arr[i];
--cnt[arr[i]];
if (sum % 2 == 0 && sum / 2 <= 1000000 && cnt[sum / 2]) {
ans.push_back(i);
}
++cnt[arr[i]];
sum += arr[i];
}
cout << ans.size() << "\n";
for (int i = 0; i < ans.size(); ++i) {
if (i) cout << " ";
cout << ans[i] + 1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
multiset<int> s;
void erase(int x) { s.erase(s.find(x)); }
int getmax() { return *s.rbegin(); }
const int limit = 1000000;
int n;
int a[limit];
vector<int> sol;
long long int sum;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
s.insert(a[i]);
}
for (int i = 1; i <= n; i++) {
erase(a[i]);
int maxi = getmax();
if (sum - a[i] - maxi == maxi) sol.push_back(i);
s.insert(a[i]);
}
cout << int(sol.size()) << endl;
for (int i = 0; i < int(sol.size()); i++) {
if (i > 0) cout << " ";
cout << sol[i];
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long sum = 0;
scanf("%d", &n);
long long a[n + 1];
for (int i = 1; i <= n; ++i) {
scanf("%I64d", &a[i]);
sum += a[i];
}
int ans = 0, idx[n + 1];
long long b[n + 1];
for (int i = 1; i <= n; ++i) b[i] = a[i];
sort(b + 1, b + 1 + n);
for (int i = 1; i <= n; ++i) {
long long cur = sum - a[i];
if (a[i] != b[n] && cur - b[n] == b[n]) {
++ans;
idx[ans] = i;
} else if (a[i] == b[n] && cur - b[n - 1] == b[n - 1]) {
++ans;
idx[ans] = i;
}
}
printf("%d\n", ans);
for (int i = 1; i <= ans; ++i) {
printf("%d ", idx[i]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
pair<long long int, long long int> a[200005];
int main() {
long long int n, y = 0, x, s = 0, i, z;
cin >> n;
map<long long int, long long int> mp, mpp;
vector<long long int> v;
for (i = 0; i < n; i++) {
cin >> a[i].first;
s += a[i].first;
a[i].second = i + 1;
}
sort(a, a + n);
for (i = 0; i < n; i++) {
if (i != n - 1) {
if (a[n - 1].first == s - a[n - 1].first - a[i].first) {
v.push_back(a[i].second);
}
} else {
if (a[n - 2].first == s - a[n - 2].first - a[n - 1].first) {
v.push_back(a[n - 1].second);
}
}
}
cout << v.size() << endl;
for (i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 200005;
const double PI = 4 * atan(1);
const long long MAX = 9223372036854775807;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }
bool isprime(long long u) {
for (long long i = 2; i <= (int)sqrt(u); i++) {
if (u % i == 0) return 0;
}
return 1;
}
long long mod(long long to_mod, long long MOD) {
to_mod %= MOD;
while (to_mod < 0) to_mod += MOD;
return to_mod % MOD;
}
long long moduloMultiplication(long long a, long long b, long long mod) {
long long res = 0;
a %= mod;
while (b) {
if (b & 1) res = (res + a) % mod;
a = (2 * a) % mod;
b >>= 1;
}
return res;
}
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long n, m, x, q, y, k, z, w, t, l, r, res, ans, b;
long long a[N];
map<long long, long long> maa;
set<long long> ss;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cin >> n;
res = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
res += a[i];
maa[a[i]]++;
}
ans = 0;
for (int i = 0; i < n; i++) {
maa[a[i]]--;
if ((res - a[i]) % 2 == 0) {
if (maa[(res - a[i]) / 2]) ss.insert(i);
}
maa[a[i]]++;
}
cout << ss.size() << endl;
for (auto t : ss) {
cout << t + 1 << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
unsigned int n, *input, max = 0, secondMax = 0;
std::vector<unsigned int> indcies;
long long int sum = 0;
std::cin >> n;
input = new unsigned int[n];
std::cin >> input[0];
max = input[0];
sum += input[0];
for (long int i = 1; i < n; i++) {
std::cin >> input[i];
if (input[i] > max) {
secondMax = max;
max = input[i];
} else if (input[i] > secondMax) {
secondMax = input[i];
}
sum += input[i];
}
for (long int i = 0; i < n; i++) {
sum -= input[i];
if (input[i] != max) {
if ((sum - max) == max) indcies.push_back(i + 1);
} else {
if ((sum - secondMax) == secondMax) indcies.push_back(i + 1);
}
sum += input[i];
}
std::cout << indcies.size() << std::endl;
for (int i = 0; i < indcies.size(); i++) {
std::cout << indcies[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2 * 1e5 + 5;
long long n, a[N], sum;
vector<int> ans;
map<long long, int> freq;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
freq[a[i]]++;
}
for (int i = 0; i < n; i++) {
long long s = sum - a[i];
if (s % 2 == 0) {
if (s / 2 == a[i] && freq[s / 2] < 2) continue;
if (freq[s / 2]) ans.push_back(i + 1);
}
}
cout << ans.size() << "\n";
for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int N = 1000001;
vector<int> count(N);
long long n;
cin >> n;
vector<long long> a(n), ans;
long long sum = 0, i, j, k;
for (i = 0; i < n; i++) cin >> a[i], sum += a[i], count[a[i]]++;
for (i = 0; i < n; i++)
if ((sum - a[i]) % 2 == 0 && (sum - a[i]) / 2 < N &&
(count[(sum - a[i]) / 2] > 1 ||
(count[(sum - a[i]) / 2] == 1 && a[i] != (sum - a[i]) / 2)))
ans.push_back(i + 1);
cout << ans.size() << endl;
for (auto x : ans) cout << x << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct compare {
bool operator()(const int64_t &a, const int64_t &b) { return a > b; }
};
bool customS(pair<int64_t, int> a, pair<int64_t, int> b) {
return a.first < b.first;
}
bool customS2(pair<int64_t, int64_t> a, pair<int64_t, int64_t> b) {
return a.second < b.second;
}
class CompareDist {
public:
bool operator()(pair<int64_t, int64_t> a, pair<int64_t, int64_t> b) {
return a.first < b.first;
}
};
int64_t gcd(int64_t a, int64_t b) {
if (b == 0) return a;
return gcd(b, a % b);
}
double gcdfloat(double a, double b) {
if (a < b) return gcd(b, a);
if (fabs(b) < 0.001)
return a;
else
return (gcd(b, a - floor(a / b) * b));
}
bool DFS(int64_t x, int64_t y, vector<string> &mat, vector<string> &visited) {
int64_t n = visited.size(), m = visited[0].size();
visited[x][y] = '1';
bool val = false;
if (x == n - 1 && y == m - 1) val = true;
int dx[4] = {0, 0, -1, +1};
int dy[4] = {1, -1, 0, 0};
for (int i = 0; i < 4; i++) {
int a = x + dx[i], b = y + dy[i];
if (a >= 0 && a < n && b >= 0 && b < m) {
if (visited[a][b] == '0') {
if (mat[a][b] != '#') {
val |= DFS(a, b, mat, visited);
}
}
}
}
return val;
}
int64_t LCA(int64_t a, int64_t b) {
while (a != b) {
if (b > a) {
swap(a, b);
}
a /= 2;
}
return a;
}
vector<int64_t> ra(int64_t n) {
vector<int64_t> arr(n);
for (int i = 0; i < n; i++) cin >> arr[i];
return arr;
}
int64_t binary_search_lower(vector<int64_t> &arr, int64_t n) {
int64_t low = 0, high = arr.size() - 1, mid, ans = -1;
while (low <= high) {
mid = (low + high) / 2;
if (arr[mid] <= n) {
ans = mid;
low = mid + 1;
} else {
high = mid - 1;
}
}
return ans;
}
int64_t binary_search_upper(vector<int64_t> &arr, int64_t n) {
int64_t low = 0, high = arr.size() - 1, mid, ans = -1;
while (low <= high) {
mid = (low + high) / 2;
if (arr[mid] >= n) {
ans = mid;
high = mid - 1;
} else {
low = mid + 1;
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int64_t i, j, a = 0, b = 0, c = 0, d = 0, n, m, k, sum = 0, x = 0, y = 0,
z = 0, flag = 0, zero = 0, ans = 0;
int64_t mod = 1000000007;
string s, newS, s2;
double dn;
cin >> n;
vector<int64_t> arr = ra(n), res;
map<int64_t, int64_t> hash;
for (i = 0; i < n; i++) {
hash[arr[i]]++;
sum += arr[i];
}
for (i = 0; i < n; i++) {
x = sum - arr[i];
if (x % 2 == 0) {
if (arr[i] == x / 2) {
if (hash[x / 2] >= 2) res.push_back(i);
} else {
if (hash[x / 2] >= 1) res.push_back(i);
}
}
}
cout << res.size() << "\n";
for (i = 0; i < res.size(); i++) {
cout << res[i] + 1 << " ";
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mult(long long a, long long b, long long p = 1000000007) {
return ((a % p) * (b % p)) % p;
}
long long add(long long a, long long b, long long p = 1000000007) {
return (a % p + b % p) % p;
}
long long fpow(long long n, long long k, long long p = 1000000007) {
long long r = 1;
for (; k; k >>= 1) {
if (k & 1) r = r * n % p;
n = n * n % p;
}
return r;
}
long long inv(long long a, long long p = 1000000007) {
return fpow(a, p - 2, p);
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> arr(n);
unordered_multiset<int> ele;
long long sum = 0;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
ele.insert(arr[i]);
sum += arr[i];
}
vector<int> ans;
for (int i = 0; i < n; ++i) {
long long newsum = sum - arr[i];
if (newsum % 2) continue;
auto it = ele.find(arr[i]);
ele.erase(it);
long long divs = newsum / 2;
if (divs > 1000000) continue;
auto iter = ele.find((int)(divs));
if (iter != ele.end()) ans.push_back(i + 1);
ele.insert(arr[i]);
}
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() {
int n;
cin >> n;
pair<long long int, long long int> a[n];
int i, x;
for (i = 0; i < n; i++) {
cin >> x;
a[i].first = x;
a[i].second = i;
}
sort(a, a + n);
long long int sum = 0;
long long int b[n];
for (i = 0; i < n; i++) {
sum += a[i].first;
b[i] = sum;
}
vector<int> j;
for (i = 0; i < n - 1; i++) {
if (b[n - 2] - a[n - 1].first == a[i].first) j.push_back(a[i].second);
}
if (b[n - 3] == a[n - 2].first) j.push_back(a[n - 1].second);
cout << j.size() << endl;
for (i = 0; i < j.size(); i++) cout << j[i] + 1 << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 322;
const long long LINF = 2e18 + 474;
const long long MAXN = 2e5 + 5;
const long long MOD = 1e9 + 7;
const double eps = 1e-12;
long long n, s = 0;
pair<long long, long long> a[MAXN];
vector<long long> ans;
void solve() {
cin >> n;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
a[i] = make_pair(x, i);
s += a[i].first;
}
sort(a, a + n);
if (s - a[n - 1].first == 2 * a[n - 2].first) {
ans.push_back(a[n - 1].second);
}
for (int i = n - 2; i >= 0; i--) {
long long curs = s - a[i].first;
if (curs == a[n - 1].first * 2) {
ans.push_back(a[i].second);
}
}
cout << (long long)ans.size() << endl;
for (long long i = 0; i < (long long)ans.size(); i++) {
cout << ans[i] + 1 << " ";
}
}
int main() {
if (!1) {
freopen(
"474"
".in",
"r", stdin);
freopen(
"474"
".out",
"w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
setlocale(LC_ALL, "Russian");
int T = 1;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int N = 200500;
void solve() {
int n;
cin >> n;
vector<long long> a(n + 1);
for (int quer = 1; quer < n + 1; quer++) cin >> a[quer];
map<long long, pair<int, int> > m;
long long sum = 0;
for (int i = 1; i <= n; i++) {
m[a[i]] = {i, m[a[i]].second + 1};
sum += a[i];
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
long long t = sum - a[i];
if (t % 2 == 0) {
if (m[t / 2].first > 0 && (m[t / 2].first != i || m[t / 2].second > 1)) {
ans.push_back(i);
}
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) cout << ans[i] << ' ';
}
int main() {
ios::sync_with_stdio(false);
int q = 1;
for (int i = 1; i <= q; i++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int arr[N];
int maze[N];
int sa[N];
bool cmp(int a, int b) { return arr[a] < arr[b]; }
int main() {
int n;
long long sum = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
sum += arr[i];
maze[i] = i;
}
int tot = 0;
sort(maze + 1, maze + 1 + n, cmp);
for (int i = 1; i < n; i++)
if (sum - arr[maze[i]] == 1ll * arr[maze[n]] * 2) sa[tot++] = maze[i];
if (sum - arr[maze[n]] == 1ll * arr[maze[n - 1]] * 2) sa[tot++] = maze[n];
printf("%d\n", tot);
for (int i = 0; i < tot; i++) printf("%d ", sa[i]);
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long cnt[1000006];
unsigned long long mx = 1e6;
int main() {
unsigned long long n;
cin >> n;
unsigned long long a[n];
unsigned long long sum = 0;
for (unsigned long long i = 0; i < n; i++) {
cin >> a[i];
cnt[a[i]] += 1;
sum += a[i];
}
vector<unsigned long long> ans;
for (unsigned long long i = 0; i < n; i++) {
sum -= a[i];
cnt[a[i]] -= 1;
if (sum % 2 == 0) {
if (sum % 2 == 0 && sum / 2 <= mx && cnt[sum / 2] > 0) {
ans.push_back(i + 1);
}
}
sum += a[i];
cnt[a[i]] += 1;
}
cout << ans.size() << "\n";
if (ans.size() != 0) {
for (unsigned long long i = 0; i < ans.size(); i++) cout << ans[i] << " ";
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int64_t n, i, x, sum = 0;
cin >> n;
vector<pair<int64_t, int64_t> > v;
for (i = 0; i < n; i++) {
cin >> x;
sum += x;
v.push_back({x, i + 1});
}
sort(v.begin(), v.end());
int64_t a = v[n - 1].first, b = v[n - 2].first;
vector<int64_t> p;
for (i = 0; i < n - 2; i++) {
if (sum - v[i].first - a == a) p.push_back(v[i].second);
}
if (sum - b - a == b) p.push_back(v[n - 1].second);
if (sum - a - b == a) p.push_back(v[n - 2].second);
if (p.size() == 0)
cout << 0 << endl;
else {
cout << p.size() << endl;
for (i = 0; i < p.size(); i++) cout << p[i] << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
double arr[n];
int mx = -1;
map<double, int> mp;
double sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
mp[(double)arr[i]]++;
sum += arr[i];
}
vector<int> vec;
for (int i = 0; i < n; i++) {
double x = sum - arr[i];
x = x / 2.0;
if (mp[x] >= 1) {
if (x == arr[i] && mp[arr[i]] >= 2)
vec.push_back(i + 1);
else if (x != arr[i] && mp[x] >= 1)
vec.push_back(i + 1);
}
}
cout << vec.size() << endl;
if (vec.size() >= 1) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> data[(int)2e5];
long long pref[(int)2e5];
long long sum, dop, ans;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
long long a;
cin >> a;
if (a == 5) dop++;
data[i].first = a;
data[i].second = i;
}
sort(data + 1, data + n + 1);
for (int i = 1; i <= n; i++) pref[i] = pref[i - 1] + data[i].first;
int j = -1, f = -1;
if (data[n - 1].first == pref[n - 2]) sum++, j = data[n].first;
for (int i = 1; i < n; i++)
if (data[i].first == pref[n - 1] - data[n].first) ans++;
if (ans) f = pref[n - 1] - data[n].first;
cout << sum + ans << endl;
for (int i = 1; i <= n; i++)
if (data[i].first == j or data[i].first == f) cout << data[i].second << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void check_max(T& actual, T check) {
if (actual < check) {
actual = check;
}
}
template <class T>
inline void check_min(T& actual, T check) {
if (actual > check) {
actual = check;
}
}
const double EPS = 1e-9;
const int IINF = 1000000000;
const double PI = acos(-1.0);
const long long LINF = 6000000000000000000LL;
namespace Solution {
const int MAXN = 200007;
int n, a[MAXN];
long long mmax[MAXN], f[MAXN], r[MAXN];
void cleanup() {
memset(mmax, 0, sizeof(mmax));
memset(f, 0, sizeof(f));
memset(r, 0, sizeof(r));
}
bool Read() {
cleanup();
if (scanf("%d", &n) != 1) return false;
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
}
return true;
}
void Run() {
if (n == 1) return;
long long sum = 0;
f[0] = a[0];
sum += a[0];
for (int i = 1; i < n; ++i) {
sum += a[i];
f[i] = max(f[i - 1], (long long)a[i]);
}
r[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; --i) {
r[i] = max(r[i + 1], (long long)a[i]);
}
std::vector<int> answer;
for (int i = 0; i < n; ++i) {
if (i == 0) {
if (sum - r[i + 1] - a[i] == r[i + 1]) {
answer.push_back(i);
}
} else if (i == n - 1) {
if (sum - f[i - 1] - a[i] == f[i - 1]) {
answer.push_back(i);
}
} else {
int mmax = max(f[i - 1], r[i + 1]);
if (sum - a[i] - mmax == mmax) {
answer.push_back(i);
}
}
}
printf("%d\n", answer.size());
if (!answer.empty()) {
for (int x : answer) {
printf("%d ", x + 1);
}
}
printf("\n");
}
} // namespace Solution
namespace StressTest {
long long GetTime() {
srand(time(NULL));
return rand() << 16LL;
}
void GenerateInput() {
FILE* output = fopen("input.txt", "w");
srand(GetTime());
fclose(output);
}
void BruteForce() {
FILE* input = fopen("input.txt", "r");
FILE* output = fopen("brute.out", "w");
fclose(input);
fclose(output);
}
} // namespace StressTest
int main() {
while (Solution::Read()) {
Solution::Run();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, int> mp;
int main() {
int n;
cin >> n;
pair<long long, int> a[n];
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i].first;
sum += a[i].first;
a[i].second = i + 1;
}
sort(a, a + n);
vector<int> ans;
for (int i = 0; i < n - 1; i++) {
long long nowsum = sum - a[i].first - a[n - 1].first;
if (nowsum == a[n - 1].first) {
ans.push_back(a[i].second);
}
}
if ((sum - a[n - 1].first - a[n - 2].first) == a[n - 2].first) {
ans.push_back(a[n - 1].second);
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int call(long long int a, long long int b) {
if (a % b == 0)
return (a / b);
else
return (a / b) + 1;
}
long long int max1(long long int a1, long long int b1) {
if (a1 >= b1) return a1;
return b1;
}
long long int sop(long long int n) {
long long int sum = 0;
while (n != 0) {
sum = sum + n % 10;
n = n / 10;
}
return sum;
}
int main() {
long long int t, n, i, j, k, l, flag, flag1, count, count1, count2, count3,
count4, sum, max1, max2, m, c1, c2, temp, suma, sumb;
long long int a[300001];
vector<long long int> v1, v2, v;
vector<string> vs;
map<long long int, long long int> m1;
string s1, s2, s3 = "hello", s;
long long int f[301];
for (i = 0; i < 301; i++) f[i] = 0;
count = 0, flag = 0, flag1 = 0, sum = 0, max1 = 0, max2 = 0, c1 = 0, c2 = 0,
temp = 0, suma = 0, sumb = 0, count1 = 0, count2 = 0, count3 = 0, count4 = 0;
long long int max3 = 0, max4 = 0, min1 = 999999999, ans = 0;
j = 0;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n; i++) v.push_back(a[i]);
sort(v.begin(), v.end());
max1 = v[n - 1];
max2 = v[n - 2];
for (i = 0; i < n; i++) sum = sum + a[i];
for (i = 0; i < n; i++) {
if (a[i] != max1) {
if (2 * max1 == sum - a[i]) v1.push_back(i + 1);
} else {
if (2 * max2 == sum - a[i]) v1.push_back(i + 1);
}
}
cout << v1.size() << endl;
for (i = 0; i < v1.size(); i++) cout << v1[i] << " ";
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[200005];
long long b[1000001];
long long c[200005];
int main(void) {
int n;
cin >> n;
long long sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
sum += a[i];
b[a[i]]++;
}
long long ans = 0;
for (int i = 0; i < n; i++) {
long long k = sum - a[i];
if (k % 2 != 0 || k > 2e6) {
continue;
}
k /= 2;
if (b[k] - (a[i] == k) > 0) {
c[ans++] = i + 1;
}
}
cout << ans << endl;
if (ans) {
for (int i = 0; i < ans; i++) {
if (i != 0) printf(" ");
printf("%lld", c[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long b[1000009], c[1000009];
int main() {
unsigned long long n;
cin >> n;
unsigned long long a[n + 1];
unsigned long long sum = 0;
unsigned long long ans = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
b[a[i]]++;
sum += a[i];
}
for (int i = 1; i <= n; i++) {
b[a[i]]--;
if ((sum - a[i]) % 2 == 0 && (sum - a[i]) / 2 <= 1000000 &&
b[(sum - a[i]) / 2]) {
c[++ans] = i;
}
b[a[i]]++;
}
cout << ans << "\n";
for (int i = 1; i <= ans; i++) {
cout << c[i] << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 5;
int n, k = 0, ans[maxN], maxA;
long long sum = 0, res = 0;
struct T {
int Value, id;
};
T a[maxN];
bool lf(const T& p, const T& q) {
if (p.Value == q.Value) return p.id < q.id;
return p.Value < q.Value;
}
bool Check(int x) {
if ((sum - x) % 2 != 0) return false;
long long NewValue = (sum - x) / 2;
if (NewValue == maxA) return true;
return false;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].Value;
a[i].id = i;
sum += (long long)a[i].Value;
}
sort(a + 1, a + n + 1, lf);
maxA = a[n].Value;
for (int i = 1; i <= n; i++) {
if (i == n) {
maxA = a[n - 1].Value;
}
if (Check(a[i].Value)) {
res++;
ans[k++] = a[i].id;
}
}
cout << res << '\n';
for (int i = 0; i < k; i++) cout << ans[i] << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
bool sortbyfirstandsec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.first == b.first) return (a.second > b.second);
return a.first < b.first;
}
long long fact(long long int a, long long int b) {
if (b == 0)
return a;
else
return fact(b, a % b);
}
long long int power(long long int a, long long int b) {
long long int ret = 1;
long long int mod = 1e9 + 7;
while (b) {
if (b % 2) {
ret = (ret * a) % mod;
}
a = (a * a) % mod;
b /= 2;
}
return ret;
}
long long int foo(long long int a, long long int b) {
long long int mod = 1e9 + 7;
return (power(2, a + b) - power(2, b) + mod) % mod;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, i, j, k, r = 0, l, l1 = 0, r1 = 0, r2 = 0, m, z = 0;
cin >> n;
multiset<long long int> s;
long long int a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i];
s.insert(a[i]);
r = r + a[i];
}
for (i = 0; i < n; i++) {
k = r - a[i];
if (k % 2 == 0) {
if (k / 2 == a[i]) {
if (s.count(k / 2) > 1) {
b[l1] = i + 1;
l1++;
}
}
if (s.count(k / 2) >= 1 && (k / 2) != a[i]) {
b[l1] = i + 1;
l1++;
}
}
}
cout << l1 << endl;
for (i = 0; i < l1; i++) {
cout << b[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
long long a[n];
vector<pair<long long, long long>> v;
for (long long i = 0; i < n; i++) {
cin >> a[i];
v.push_back(make_pair(a[i], i + 1));
}
sort(v.begin(), v.end());
long long prefix[n];
prefix[0] = v[0].first;
for (long long i = 1; i < n; i++) prefix[i] = prefix[i - 1] + v[i].first;
long long cnt = 0;
vector<long long> ans;
for (long long i = 0; i < n - 1; i++) {
if (prefix[n - 2] - v[i].first == prefix[n - 1] - prefix[n - 2]) {
cnt++;
ans.push_back(v[i].second);
}
}
if (prefix[n - 3] == prefix[n - 2] - prefix[n - 3]) {
cnt++;
ans.push_back(v[n - 1].second);
}
cout << cnt << endl;
for (long long i = 0; i < ans.size(); i++) cout << ans[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXA = 1000000;
const int MAXN = 200000;
int n, L[1 + MAXA], R[1 + MAXA];
long long a, s;
pair<int, int> A[MAXN];
vector<int> N;
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> A[i].first;
s += A[i].first;
A[i].second = i + 1;
}
sort(A, A + n);
for (int i = 1; i <= MAXA; ++i) {
L[i] = R[i] = -1;
}
for (int i = n - 1; i >= 0; --i) {
L[A[i].first] = i;
}
for (int i = 0; i < n; ++i) {
R[A[i].first] = i;
}
for (int i = 0; i < n; ++i) {
a = s - A[i].first;
if (a % 2 == 1) {
continue;
}
a /= 2;
if (a > MAXA) {
continue;
}
if (L[a] == i && L[a] < R[a]) {
N.push_back(A[i].second);
}
if (L[a] != i && L[a] > -1) {
N.push_back(A[i].second);
}
}
cout << N.size() << endl;
for (auto i : N) {
cout << i << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long arr[n];
long long sum = 0;
long long arr2[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
arr2[i] = arr[i];
sum += arr[i];
}
sort(arr2, arr2 + n);
map<long long, long long> mp;
mp[arr2[n - 1]] = arr2[n - 2];
for (int i = n - 1; i >= 0; i--) {
if (mp.find(arr2[i]) == mp.end()) mp[arr2[i]] = arr2[n - 1];
}
vector<int> v;
int c = 0;
for (int i = 0; i < n; i++) {
long long temsum = sum - arr[i];
long long high = mp[arr[i]];
if (high * 2 == temsum) {
c += 1;
v.push_back(i + 1);
}
}
cout << c << endl;
for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 2e5 + 5, maxa = 1e6 + 5;
long long a[maxn];
vector<long long> vis[maxa], ans;
signed main() {
long long n, cnt = 0;
long long sum = 0;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
vis[a[i]].push_back(i + 1);
}
sort(a, a + n);
if (sum - a[n - 1] > a[n - 1]) {
long long tmp = sum - a[n - 1] * 2;
if (tmp < a[n - 1]) {
cnt += vis[tmp].size();
for (long long i = 0; i < vis[tmp].size(); i++) {
ans.push_back(vis[tmp][i]);
}
}
}
if (sum - a[n - 1] == 2 * a[n - 2]) {
long long tmp = a[n - 1];
cnt += vis[tmp].size();
for (long long i = 0; i < vis[tmp].size(); i++) {
ans.push_back(vis[tmp][i]);
}
}
cout << cnt << endl;
for (long long i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void err() {
cout << "NO\n";
exit(0);
}
int main() {
int n, i, j;
cin >> n;
int arr[n], brr[n];
long long int sum = 0;
for (i = 0; i < n; i++) {
cin >> arr[i];
brr[i] = arr[i];
sum += arr[i];
}
sort(brr, brr + n);
int mx = brr[n - 1], mx2 = brr[n - 2];
vector<int> v;
if (mx == mx2) {
for (i = 0; i < n; i++) {
if (sum - arr[i] - mx == mx) v.push_back(i + 1);
}
} else {
for (i = 0; i < n; i++) {
if (arr[i] == mx) {
if (sum - arr[i] - mx2 == mx2) v.push_back(i + 1);
} else {
if (sum - arr[i] - mx == mx) v.push_back(i + 1);
}
}
}
cout << v.size() << endl;
for (auto z : v) {
cout << z << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int brr[n];
vector<int> b;
long long s = 0;
int flag = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
brr[i] = arr[i];
s = s + arr[i];
}
sort(brr, brr + n);
for (int i = 0; i < n; i++) {
flag = 0;
if ((s - arr[i]) % 2 == 0) {
int l = 0;
int h = n - 1;
int mid = (l + h) / 2;
long long p = (s - arr[i]) / 2;
while (l <= h) {
mid = l + (h - l) / 2;
if (brr[mid] > p) {
h = mid - 1;
}
if (brr[mid] < p) {
l = mid + 1;
}
if (brr[mid] == p) {
if (p == arr[i]) {
if (brr[mid + 1] == p || brr[mid - 1] == p) {
flag = 1;
break;
} else {
flag = 0;
break;
}
} else {
flag = 1;
break;
}
}
}
if (flag == 1) {
b.push_back(i + 1);
}
}
}
if (b.size() == 0) {
cout << 0 << "\n";
}
if (b.size() != 0) {
cout << b.size() << "\n";
for (int i = 0; i < b.size(); i++) {
cout << b[i] << "\t";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<pair<long long, long long> > v(n);
long long sum = 0;
for (long long i = 0; i < n; ++i) {
cin >> v[i].first;
sum += v[i].first;
v[i].second = i + 1;
}
sort(v.begin(), v.end());
vector<long long> ans;
for (long long i = n - 1; i >= 0; --i) {
if (i == n - 1) {
if (sum - (v[i].first) == 2 * (v[i - 1].first)) {
ans.push_back(v[i].second);
}
} else {
if (sum - v[i].first == 2 * (v[n - 1].first)) {
ans.push_back(v[i].second);
}
}
}
cout << ans.size() << "\n";
sort(ans.begin(), ans.end());
for (int i : ans) {
cout << i << " ";
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[200000];
struct B {
long long S, W;
};
B b[200000];
long long d[200000];
bool operator<(const B &a1, const B &a2) {
if (a1.S < a2.S) return true;
return false;
}
int main() {
long long n, he = 0, c = 0;
cin >> n;
for (long long i = 0; i < n; ++i) {
cin >> a[i];
he += a[i];
b[i].S = a[i];
b[i].W = i + 1;
}
sort(b, b + n);
for (long long i = n - 1; i >= 0; --i) {
he -= b[i].S;
if ((!(he & 1)) && he == b[n - 2].S * 2 && i == n - 1) {
d[c++] = b[i].W;
}
if ((!(he & 1)) && he == b[n - 1].S * 2 && i != n - 1) {
d[c++] = b[i].W;
}
he += b[i].S;
}
if (c != 0) {
printf("%lld\n", c);
for (long long i = 0; i < c; ++i) {
if (i)
printf(" %lld", d[i]);
else
printf("%lld", d[i]);
}
} else
printf("0");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline bool eq(double a, double b) { return fabs(a - b) < 1e-9; }
const int inf = 1 << 29;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
int res = 0;
while (n && ++res) n -= n & (-n);
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, a;
long long int sum = 0;
cin >> n;
vector<pair<int, int> > ar;
for (int i = 0; i < (n); i++) {
cin >> a;
ar.push_back({a, i});
sum += ar[i].first;
}
sort(ar.begin(), ar.end());
vector<int> ans;
if (n == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < (n); i++) {
if (i == n - 1) {
if (sum - ar[i].first == 2 * ar[n - 2].first) {
ans.push_back(ar[i].second + 1);
}
} else {
if (sum - ar[i].first == 2 * ar[n - 1].first) {
ans.push_back(ar[i].second + 1);
}
}
}
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;
template <typename T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = ((ans % m) * (a % m)) % m;
b /= 2;
a = ((a % m) * (a % m)) % m;
}
return ans % m;
}
const long double eps = 1e-10L;
long long a[300005];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n;
cin >> n;
long long sum = 0;
map<long long, long long> m;
vector<long long> ans;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
m[a[i]]++;
}
for (long long i = 1; i <= n; i++) {
long long sum1 = sum;
sum1 -= a[i];
if (sum1 & 1) continue;
long long temp = sum1 / 2;
if (temp == a[i]) {
if (m.find(a[i]) != m.end() && m[a[i]] > 1) ans.push_back(i);
} else {
if (m.find(temp) != m.end()) ans.push_back(i);
}
}
cout << ans.size() << "\n";
for (long long i = 0; i < ans.size(); i++) cout << ans[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
long long min(long long a, long long b) {
if (a > b) return b;
return a;
}
long long max(long long a, long long b) {
if (a < b) return b;
return a;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
while (t--) {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
long long summ = 0;
for (long long i = 0; i < n; i++) summ += a[i];
long long maxx = -1, smax = -1;
for (long long i = 0; i < n; i++) {
if (a[i] >= maxx) {
smax = maxx;
maxx = a[i];
} else if (a[i] >= smax) {
smax = a[i];
}
}
vector<long long> ans;
for (long long i = 0; i < n; i++) {
if (a[i] != maxx) {
if (summ - a[i] == 2 * maxx) ans.push_back(i);
} else {
if (summ - a[i] == 2 * smax) ans.push_back(i);
}
}
cout << ans.size() << endl;
for (long long i = 0; i < ans.size(); i++) cout << ans[i] + 1 << " ";
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[(long long)2e5 + 100];
vector<long long> ans;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n, s = 0;
cin >> n;
for (long long i = 0; i < n; i++)
cin >> a[i].first, s += a[i].first, a[i].second = i + 1;
sort(a, a + n);
for (long long i = 0; i < n - 1; i++) {
if ((s - a[i].first) % 2 == 0 && a[n - 1].first == (s - a[i].first) / 2) {
ans.push_back(a[i].second);
}
}
if (n > 2)
if ((s - a[n - 1].first) % 2 == 0 &&
a[n - 2].first == (s - a[n - 1].first) / 2)
ans.push_back(a[n - 1].second);
cout << ans.size() << '\n';
for (long long i = 0; i < (long long)ans.size(); i++) cout << ans[i] << ' ';
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
string intostr(int x) {
stringstream ss;
ss << x;
string str = ss.str();
return str;
}
char Uplowch(char ch) {
if (ch >= 'A' && ch <= 'Z') ch += 32;
return ch;
}
char Lowupch(char ch) {
if (ch >= 'a' && ch <= 'z') ch -= 32;
return ch;
}
bool Isalpha(char ch) {
if ((ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z')) return true;
return false;
}
int Strtoint(string str) {
stringstream ss(str);
int x = 0;
ss >> x;
return x;
}
string Intostr(int x) {
stringstream ss;
ss << x;
string str = ss.str();
return str;
}
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n;
cin >> n;
long long ar[n + 3];
long long sum = 0;
map<long long, long long> mp;
for (long long i = 0; i < n; i++) {
cin >> ar[i];
mp[ar[i]]++;
sum += ar[i];
}
vector<long long> v;
for (long long i = 0; i < n; i++) {
if ((sum - ar[i]) % 2 == 0) {
long long id = (sum - ar[i]) / 2;
if ((ar[i] == id && mp[id] > 1) || (ar[i] != id && mp[id]))
v.push_back(i + 1);
}
}
cout << (long long)v.size() << "\n";
for (long long i = 0; i < (long long)v.size(); i++) {
cout << v[i] << ' ';
}
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, x, y, k, ans, a[200050], u;
pair<int, int> p[200050];
bool l[200050];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i], p[i].first = a[i], p[i].second = i, k += a[i];
sort(a, a + n);
sort(p, p + n);
for (int i = 0; i < n; ++i) {
y = k - a[i];
x = lower_bound(a, a + n, y / 2) - a;
if (x == i) ++x;
if (y % 2 == 0 && y / 2 == a[x]) l[p[i].second] = 1, ++ans;
}
cout << ans << endl;
for (int i = 0; i < n; ++i)
if (l[i]) cout << i + 1 << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, oldm, k, l, nrs, sol[200005];
struct indici {
int i, x;
} v[200005];
long long s;
bool comp(indici a, indici b) { return a.x < b.x; }
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> v[i].x;
s += v[i].x;
v[i].i = i;
}
sort(v + 1, v + n + 1, comp);
if (v[n - 1].x == s - v[n - 1].x - v[n].x) {
k++;
sol[k] = v[n].i;
}
for (i = n - 1; i >= 1; i--) {
if (v[n].x == s - v[n].x - v[i].x) {
k++;
sol[k] = v[i].i;
}
}
cout << k << '\n';
for (i = 1; i <= k; i++) cout << sol[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
long long sum = 0;
vector<long long> v, vp, okk;
for (long long i = 0; i < n; i++) {
cin >> a[i];
v.push_back(a[i]);
vp.push_back(a[i]);
sum += a[i];
}
sort(vp.begin(), vp.end());
long long ans = 0;
for (long long i = 0; i < n; i++) {
if (v[i] == vp[n - 1])
ans = vp[n - 2];
else
ans = vp[n - 1];
if (sum - v[i] == 2 * ans) {
okk.push_back(i + 1);
}
}
cout << okk.size() << '\n';
for (long long i = 0; i < okk.size(); i++) cout << okk[i] << " ";
}
|
#include <bits/stdc++.h>
int main(int argc, char const *argv[]) {
int n;
int numbers[1000000];
std::cin >> n;
long long int sum = 0;
int biggest = 0, biggest_pos = -1;
int sec_biggest = 0, sec_biggest_pos = -1;
for (int i = 0; i < n; i++) {
std::cin >> numbers[i];
sum += numbers[i];
if (numbers[i] > sec_biggest) {
if (biggest_pos == -1) {
biggest = numbers[i];
biggest_pos = i;
continue;
}
sec_biggest = numbers[i];
sec_biggest_pos = i;
if (sec_biggest > biggest) {
int tmp = biggest;
biggest = sec_biggest;
sec_biggest = tmp;
tmp = biggest_pos;
biggest_pos = sec_biggest_pos;
sec_biggest_pos = tmp;
}
}
}
int output[1000000];
int output_cnt = 0;
if (biggest_pos != sec_biggest_pos) {
if (sum - biggest - sec_biggest == sec_biggest) {
output[output_cnt++] = biggest_pos;
}
}
for (int i = 0; i < n; i++) {
if (i == biggest_pos) continue;
if (sum - numbers[i] - biggest == biggest) {
output[output_cnt++] = i;
}
}
if (output_cnt == 0) {
std::cout << 0 << std::endl;
std::cout << std::endl;
} else {
std::cout << output_cnt << std::endl;
for (int i = 0; i < output_cnt; i++) {
if (i + 1 == output_cnt) {
std::cout << output[i] + 1 << std::endl;
} else {
std::cout << output[i] + 1 << ' ';
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
long long sum = 0;
map<long long, int> m;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n;
int ai;
for (int i = 0; i < n; ++i) {
cin >> ai;
a.push_back(ai);
m[ai] += 1;
sum += ai;
}
vector<int> res;
for (int i = 0; i < n; ++i) {
long long ts = sum - a[i];
int tr;
if (ts % 2 == 0 && ts / 2 == a[i]) {
tr = 1;
} else {
tr = 0;
}
if (ts % 2 == 0 && m[ts / 2] > tr) {
res.push_back(i + 1);
}
}
cout << res.size() << "\n";
for (int it : res) {
cout << it << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int MIN(long long int a, long long int b) {
if (a > b)
return b;
else
return a;
}
long long int MAX(long long int a, long long int b) {
if (a > b)
return a;
else
return b;
}
long long int MOD(long long int x) {
if (x >= 0)
return x;
else
return -x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
vector<long long int> v;
vector<long long int>::iterator it;
;
long long int n;
cin >> n;
long long int A[n + 1];
for (int i = 1; i <= n; i++) cin >> A[i];
;
long long int sum = 0;
map<long long int, long long int> M;
for (int i = 1; i <= n; i++) {
sum += A[i];
M[A[i]]++;
}
for (int i = 1; i <= n; i++) {
long long int d = sum;
d -= A[i];
M[A[i]]--;
if (d % 2 == 0) {
long long int x = d / 2;
if (M[x] > 0) v.push_back(i);
}
M[A[i]]++;
}
cout << v.size() << endl;
for (it = v.begin(); it != v.end(); it++) cout << *it << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200 * 1000 + 5;
map<long long, long long> mp;
long long s, i;
vector<int> v;
int n, a[N], ans;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
mp[a[i]]++;
}
for (i = 0; i < n; i++)
if ((s - a[i]) % 2 == 0 && mp[(s - a[i]) / 2] &&
!(mp[(s - a[i]) / 2] == 1 && a[i] == ((s - a[i]) / 2))) {
ans++;
v.push_back(i);
}
cout << ans << endl;
for (i = 0; i < v.size(); i++) cout << v[i] + 1 << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, cnt = 0;
long long sum = 0;
bool flag = false;
struct Node {
int num;
int pos;
} a[200005];
bool cmp(const Node &a, const Node &b) { return a.num < b.num; }
vector<int> v;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].num;
a[i].pos = i;
sum += a[i].num;
}
sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n - 1; i++) {
if (sum - a[i].num == 2 * a[n].num) {
cnt++;
v.push_back(a[i].pos);
}
}
if (sum - a[n].num == 2 * a[n - 1].num) {
v.push_back(a[n].pos);
cnt++;
}
if (cnt == 0) {
cout << 0 << endl;
return 0;
}
cout << cnt << endl;
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int arr[n];
vector<int> *index;
index = new vector<int>[1000001];
set<long long> present;
int temp[1000001] = {0};
long long sum = 0;
for (auto i = 0; i < n; i++) {
scanf("%d", &arr[i]);
sum += (1LL * arr[i]);
present.insert(1LL * arr[i]);
index[arr[i]].push_back(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (present.find(sum - (1LL * 2 * arr[i])) != present.end() &&
temp[sum - (1LL * 2 * arr[i])] == 0) {
if (((sum - (1LL * 2 * arr[i])) == arr[i] && index[arr[i]].size() > 1) ||
((sum - (1LL * 2 * arr[i])) != arr[i])) {
temp[sum - (1LL * 2 * arr[i])] = 1;
count += index[sum - (1LL * 2 * arr[i])].size();
}
}
}
printf("%d\n", count);
set<long long>::iterator itr;
itr = present.begin();
for (int i = 0; i < present.size(); i++) {
if (temp[*itr] != 0) {
for (int j = 0; j < index[*itr].size(); j++)
printf("%d ", index[*itr][j] + 1);
}
itr++;
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[200001];
vector<long long> ans;
long long sum;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i + 1;
sum += a[i].first;
}
sort(a, a + n);
for (long long i = 0; i < n - 1; i++) {
if (sum - a[i].first == a[n - 1].first * 2) {
ans.push_back(a[i].second);
}
}
if (sum - a[n - 1].first == a[n - 2].first * 2) {
ans.push_back(a[n - 1].second);
}
cout << ans.size() << endl;
for (long long i : ans) {
cout << i << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
int n;
cin >> n;
long long a[n + 1];
for (int i = 1; i <= n; i++) cin >> a[i];
map<long long, vector<int>> mp;
long long S = 0;
for (int i = 1; i <= n; i++) S += a[i];
for (int i = 1; i <= n; i++) mp[a[i] + a[i] - S].emplace_back(i);
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (mp[-a[i]].size() == 1) {
if (mp[-a[i]][0] != i) {
ans.emplace_back(i);
}
} else if (mp[-a[i]].size()) {
ans.emplace_back(i);
}
}
cout << ans.size() << endl;
random_shuffle(ans.begin(), ans.end());
for (int i : ans) cout << i << ' ';
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (auto &x : arr) cin >> x;
int pos = 0, MAX = 0;
for (int i = 0; i < n; i++) {
if (MAX < arr[i]) {
MAX = arr[i];
pos = i;
}
}
int secMax = 0, ps = 0;
for (int i = 0; i < n; i++) {
if (i == pos) continue;
if (secMax < arr[i]) {
secMax = arr[i];
ps = i;
}
}
long long sum = 0;
vector<int> ans;
for (auto &x : arr) sum += x;
for (int i = 0; i < n; i++) {
long long rem = sum - arr[i];
int mx = MAX;
if (i == pos) mx = secMax;
if (rem - mx == mx) ans.push_back(i);
}
cout << ans.size() << '\n';
for (auto &x : ans) cout << x + 1 << ' ';
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1;
int n;
long long int a[N], t[N], sum, ans[N], k = 0;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i], sum += a[i], t[i] = a[i];
sort(t + 1, t + 1 + n);
for (int i = 1; i <= n; i++) {
if (sum - a[i] == 2 * t[a[i] == t[n] ? n - 1 : n]) ans[++k] = i;
}
cout << k << '\n';
for (; k;) cout << ans[k--] << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
int a[n + 2], b[n + 2], ans[n + 2];
long long sum = 0;
for (int i = (1), _b = (n); i <= _b; i++) {
cin >> a[i];
sum += a[i];
b[i - 1] = a[i];
}
sort(b, b + n, greater<int>());
int temp;
int dem = 0;
for (int i = (1), _b = (n + 1); i <= _b; i++) {
temp = b[0];
if (a[i] == b[0]) b[0] = b[1];
if (sum - a[i] == 2 * b[0]) {
dem++;
ans[dem] = i;
}
b[0] = temp;
}
cout << dem << "\n";
for (int i = (1), _b = (dem); i <= _b; i++) cout << ans[i] << " ";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
const double PI =
3.141592653589793238462643383279502884197169399375105820974944;
using namespace std;
const int MOD = 1e9 + 7;
double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }
template <typename T>
T mymax(T a, T b) {
return (a > b) ? a : b;
}
template <typename T>
T mymax(T a, T b, T c) {
return mymax(a, mymax(b, c));
}
template <typename T>
T mymin(T a, T b) {
return (a < b) ? a : b;
}
template <typename T>
T mymin(T a, T b, T c) {
return mymin(a, mymin(b, c));
}
template <typename T>
T power(T x, T y) {
T res = 1;
x = x % MOD;
while (y > 0) {
if (y & 1) res = (res * x) % MOD;
y = y >> 1;
x = (x * x) % MOD;
}
return res;
}
template <typename T>
void swap(T *x, T *y) {
T temp;
temp = *y;
*y = *x;
*x = temp;
}
template <typename T>
T mod(T a) {
if (a > 0)
return a;
else
return -a;
}
template <typename T>
T logg(T a) {
T x = 0;
while (a > 1) {
x++;
a /= 2;
}
return x;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int a, n;
cin >> n;
long long int m = INT_MIN, sum = 0;
vector<pair<long long int, long long int>> v;
for (int i = 1; i <= n; i++) {
cin >> a;
v.push_back({a, i});
sum += a;
}
sort(v.begin(), v.end());
long long int c = 0, temp = sum;
vector<int> k;
for (int i = 0; i <= n - 2; i++) {
if ((temp - v[i].first) == (2 * (v[v.size() - 1].first))) {
k.push_back(v[i].second);
}
}
if ((sum - (v[v.size() - 1].first)) == (2 * (v[v.size() - 2].first)))
k.push_back(v[v.size() - 1].second);
cout << k.size() << endl;
for (auto l : k) {
cout << l << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
const double PI = 3.141592653589793238460;
using namespace std;
void solve() {
long long n;
cin >> n;
long long arr[n + 1];
long long sum = 0;
map<long long, long long> mp;
map<long long, long long> ind;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
mp[arr[i]]++;
}
vector<long long> v;
for (int i = 1; i <= n; i++) {
long long num = sum - arr[i];
mp[arr[i]]--;
if (mp[num / 2] > 0 and num % 2 == 0) v.push_back(i);
mp[arr[i]]++;
}
cout << v.size() << '\n';
for (auto x : v) cout << x << " ";
cout << '\n';
}
int main() {
int T = 1;
while (T--) solve();
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const double pi = 3.14159265359;
const double eps = 1e-9;
const int mod = 1e9 + 7;
const int mod1 = 1e9 + 9;
const int INF = 1e9;
const long long INFLL = 2e18;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<pair<long long, long long> > a(n);
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
sum += a[i].first;
}
sort(a.begin(), a.end());
vector<int> ans;
for (int i = 0; i < n; i++) {
if (i < n - 1) {
sum -= a[i].first;
sum -= a.back().first;
if (sum == a.back().first) ans.push_back(a[i].second + 1);
sum += a[i].first + a.back().first;
} else {
sum -= a[i].first + a[i - 1].first;
if (sum == a[i - 1].first) ans.push_back(a[i].second + 1);
sum += a[i].first + a[i - 1].first;
}
}
cout << ans.size() << endl;
for (auto i : ans) cout << i << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[200005];
long long sum = 0;
int bucket[1000005];
int ans[200005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
bucket[a[i]]++;
}
for (int i = 1; i <= n; i++) {
bucket[a[i]]--;
if (((sum - a[i]) % 2 == 0) && ((sum - a[i]) / 2 <= 1000000) &&
bucket[(sum - a[i]) / 2] > 0)
ans[++ans[0]] = i;
bucket[a[i]]++;
}
cout << ans[0] << endl;
for (int i = 1; i <= ans[0]; i++) cout << ans[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, int> m;
long long a[200002];
int main() {
int n;
scanf("%d", &n);
long long sum = 0LL;
for (int i = 1; i <= n; ++i) {
scanf("%lld", a + i);
if (m.count(a[i]))
m[a[i]] += 1;
else
m[a[i]] = 1;
sum += a[i];
}
vector<int> ans;
for (int i = 1; i <= n; ++i) {
long long tmp = sum - a[i];
if (tmp % 2LL == 0 && m.count(tmp / 2LL)) {
if (a[i] != tmp / 2LL || m[a[i]] > 1) ans.push_back(i);
}
}
printf("%d\n", (int)ans.size());
for (int i : ans) printf("%d ", i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int NN = 1e6 + 5;
struct node {
long long num;
long long wei;
} a[N];
bool anss[NN];
bool cmp(node a, node b) { return a.num < b.num; }
long long qian[N];
int main() {
long long n;
scanf("%lld", &n);
memset(qian, 0, sizeof(qian));
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i].num);
a[i].wei = i;
}
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= n; ++i) {
qian[i] = qian[i - 1] + a[i].num;
}
memset(anss, 0, sizeof(anss));
long long ans = 0;
for (int i = 1; i <= n - 1; ++i) {
long long now = a[i].num;
if ((qian[n] - now) == 2 * a[n].num) {
anss[a[i].wei] = 1;
ans++;
}
}
if (a[n - 1].num == qian[n - 2]) {
anss[a[n].wei] = 1;
ans++;
}
printf("%lld\n", ans);
for (int i = 1; i < NN; ++i)
if (anss[i]) printf("%lld ", i);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
cin >> n;
long int a[n];
unsigned long long int sum = 0;
vector<pair<long int, long int>> vec;
for (long int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
vec.push_back(make_pair(a[i], i));
}
sort(vec.begin(), vec.end());
unsigned long long int sum1;
vector<long int> count;
for (long int i = 0; i < n - 1; i++) {
sum1 = sum - vec[i].first;
if (vec[n - 1].first * 2 == sum1) {
count.push_back(vec[i].second + 1);
}
}
sum1 = sum - vec[n - 1].first;
if (vec[n - 2].first * 2 == sum1) count.push_back(vec[n - 1].second + 1);
cout << count.size() << endl;
for (int i = 0; i < count.size(); i++) cout << count[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e6 + 7;
int a[maxn], b[maxn], c[maxn];
int main() {
int n;
cin >> n;
long long ans = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = a[i];
ans += a[i];
}
sort(a + 1, a + n + 1);
int maxx = a[n];
int sum = 0;
for (int i = 1; i <= n; i++) {
if (c[i] == maxx) {
ans -= a[n - 1];
if (ans - c[i] == a[n - 1]) {
b[sum] = i;
sum++;
}
ans += a[n - 1];
} else {
ans -= maxx;
if (ans - c[i] == a[n]) {
b[sum] = i;
sum++;
}
ans += maxx;
}
}
cout << sum << endl;
for (int i = 0; i < sum; i++) cout << b[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[200007];
long long sum;
pair<int, int> p[200007];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> p[i].first;
sum += p[i].first;
p[i].second = i;
}
sort(p, p + n);
int j = 0, k = 0;
for (int i = 0; i < n - 1; ++i) {
if (sum - p[i].first == 2 * p[n - 1].first) {
k++;
a[j] = ++p[i].second;
j++;
}
}
if (sum == 2 * (p[n - 2].first) + p[n - 1].first) {
k++;
a[j] = ++p[n - 1].second;
j++;
}
cout << k << '\n';
for (int i = 0; i < j; ++i) {
cout << a[i] << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long n, pozmax = 0, maxim = 0;
cin >> n;
vector<long long> v(n + 5, 0);
for (int i = 1; i <= n; i++) cin >> v[i];
long long sum = 0;
for (int i = 1; i <= n; i++) {
if (v[i] > maxim) {
maxim = v[i];
pozmax = i;
}
sum += v[i];
}
sum -= maxim;
vector<int> sol;
long long maxim2 = 0;
for (int i = 1; i <= n; i++) {
if (i != pozmax) {
if (sum - v[i] == maxim) {
sol.push_back(i);
}
maxim2 = max(maxim2, v[i]);
}
}
if (sum - maxim2 == maxim2) {
sol.push_back(pozmax);
}
cout << sol.size() << '\n';
for (int i = 0; i < sol.size(); i++) cout << sol[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int N = 300005;
long long sum;
vector<int> ans, v;
int main() {
int n;
scanf("%d", &n);
int arr[n + 5];
for (int i = 1, x; i <= n; i++)
scanf("%d", &arr[i]), sum += arr[i], v.push_back(arr[i]);
bool good = 0;
sort(v.begin(), v.end());
for (int i = 1; i <= n; i++) {
long long temp = sum - arr[i];
long long x = v[n - 1];
if (x == arr[i]) x = v[n - 2];
if (temp - x == x) ans.push_back(i);
}
if (ans.size() == 0) return cout << 0 << endl, 0;
cout << ans.size() << endl;
for (int i : ans) cout << i << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long n, sm = 0;
cin >> n;
vector<long long> v(n);
vector<long long> s(n);
for (long long i = 0; i < n; i++) {
cin >> v[i];
sm += v[i];
s[i] = v[i];
}
sort(s.begin(), s.end());
vector<long long> res;
for (long long i = 0; i < n; i++) {
long long x = s[s.size() - 1];
if (x == v[i]) {
x = s[s.size() - 2];
}
if ((sm - v[i] - x) == x) {
res.push_back(i + 1);
}
}
cout << res.size() << endl;
for (long long i = 0; i < res.size(); i++) {
cout << res[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int cmod = 998244353;
const long long int N = 1e7 + 5;
const long long int inf = 1e16 + 2;
void solve(long long int Case) {
long long int n;
cin >> n;
long long int arr[n], s = 0;
map<long long int, long long int> m;
for (long long int i = 0; i < n; i++) cin >> arr[i], s += arr[i];
for (long long int i = 0; i < n; i++) {
s -= arr[i];
m[s - arr[i]]++;
s += arr[i];
}
vector<long long int> v;
for (long long int i = 0; i < n; i++) {
if (m[arr[i]] > 1 or (m[arr[i]] == 1 and (s - 2 * arr[i]) != arr[i]))
v.push_back(i + 1);
}
cout << v.size() << '\n';
for (auto x : v) cout << x << ' ';
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int testcase = 1;
long long int Case = 1;
while (testcase--) {
solve(Case++);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
long long int a[n];
vector<pair<long long int, long long int>> b;
long long int mx = 0, pos = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b.push_back({a[i], i});
if (a[i] > mx) {
mx = a[i];
pos = i;
}
}
sort(b.begin(), b.end());
vector<long long int> pref(n + 5, 0), suf(n + 5, 0);
for (int i = 0; i < n; i++) {
pref[i + 1] = pref[i] + a[i];
}
for (int i = n - 1; i >= 0; i--) {
suf[i + 1] = suf[i + 2] + a[i];
}
vector<long long int> ans;
for (int i = 0; i < n; i++) {
if (a[i] == mx) {
if (pref[b[n - 2].second] + suf[b[n - 2].second + 2] - mx ==
b[n - 2].first) {
ans.push_back(i + 1);
}
continue;
}
if (pref[pos] + suf[pos + 2] - a[i] == mx) {
ans.push_back(i + 1);
}
}
cout << ((int)(ans).size()) << "\n";
for (auto it : ans) {
cout << it << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto& x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
long long mod_1097(long long a) {
long long mod_a;
if (a > 1000000007) {
mod_a = a % 1000000007;
if (mod_a < 0) {
mod_a += 1000000007;
}
} else {
mod_a = a;
}
return mod_a;
}
long long calc_good(vector<long long>& a, int i, int b_length,
vector<map<int, int>>& cache) {
if (cache[i].find(b_length) != cache[i].end()) {
return cache[i][b_length];
}
long long good_count = 0;
for (int j = i; j < a.size(); j++) {
if ((a[j] % (b_length + 1)) == 0) {
good_count += 1;
good_count += calc_good(a, j + 1, b_length + 1, cache);
good_count = mod_1097(good_count);
}
}
cache[i][b_length] = good_count;
return good_count;
}
vector<int> get_primes(long long n) {
vector<int> primes = {1};
vector<int> nums(n, 0);
for (int i = 2; i < n; i++) {
if (nums[i] == 0) {
primes.push_back(i);
for (int j = i * 2; j < n; j += i) {
nums[j] = i;
}
}
}
return primes;
}
vector<long long> sieve(long long n) {
vector<long long> res(n + 1, 0);
res[n] = n;
for (int i = 2; i < pow(n, 1 / 2); i++) {
long long shuttle = i * i;
while (shuttle < n) {
res[shuttle] = i;
shuttle += i;
}
}
return res;
}
long long ceil_(long long a, long long b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
long long array_sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
array_sum += a[i];
}
map<long long, vector<long long>> sum_without_el;
vector<long long> sum_without_el_arr(n);
for (int i = 0; i < n; i++) {
long long sum_wihout_i = array_sum - a[i];
if (sum_without_el.find(sum_wihout_i) == sum_without_el.end()) {
sum_without_el[sum_wihout_i] = vector<long long>();
}
sum_without_el[sum_wihout_i].push_back(i);
sum_without_el_arr[i] = sum_wihout_i;
}
set<long long> res;
for (int i = 0; i < n; i++) {
if (sum_without_el.find(a[i] * 2) != sum_without_el.end()) {
;
;
if (sum_without_el[a[i] * 2].size() == 1 &&
sum_without_el[a[i] * 2][0] == i) {
continue;
}
for (auto& res_index : sum_without_el[a[i] * 2]) {
res.insert(res_index + 1);
}
}
}
cout << res.size() << endl;
for (auto& res_val : res) {
cout << res_val << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int N = int(2e5) + 111;
const int MOD = int(1e9) + 7;
long long a[N], prefix[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
long long maxim = -1, maxim2 = -1;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (a[i] >= maxim)
maxim2 = maxim, maxim = a[i];
else if (a[i] > maxim2)
maxim2 = a[i];
}
vector<int> ans;
for (int i = 0; i < n; i++) {
long long cur = maxim;
if (a[i] == maxim) cur = maxim2;
if (sum - a[i] - 2 * cur == 0) ans.push_back(i + 1);
}
cout << ans.size() << endl;
for (auto i : ans) {
cout << i << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long sum = 0, sum1, a;
vector<long long> v(n);
vector<int> ans;
map<long long, set<int> > mp;
for (int i = 0; i < n; i++) {
cin >> a;
v[i] = a;
sum += a;
mp[a].insert(i);
}
for (int i = 0; i < n; i++) {
sum1 = sum - v[i];
if (sum1 % 2 == 0) {
if (mp.find(sum1 / 2) != mp.end()) {
if (mp[sum1 / 2].find(i) == mp[sum1 / 2].end() ||
mp[sum1 / 2].size() > 1) {
ans.push_back(i + 1);
}
}
}
}
cout << ans.size() << endl;
for (auto i : ans) {
cout << i << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
#pragma warning(disable : 6031)
void IO() { ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); }
const int N = (int)2e5 + 5;
int a[N], cnt[(int)1e6];
vector<int> idx;
int main() {
IO();
int n;
cin >> n;
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
cnt[a[i]]++;
sum += a[i];
}
for (int i = 1; i <= n; i++) {
sum -= a[i];
cnt[a[i]]--;
if ((!(sum & 1)) && sum / 2 <= 1e6 && cnt[sum / 2] > 0) idx.push_back(i);
sum += a[i];
cnt[a[i]]++;
}
cout << idx.size() << '\n';
for (auto it : idx) cout << it << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, max1, max2, a[maxn], b[maxn], num, t;
long long sum;
int main() {
while (scanf("%d", &n) != EOF) {
sum = 0;
max1 = -1, max2 = -1, num = 0, t = 0;
int j, k;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
if (max1 <= a[i]) {
max2 = max1;
max1 = a[i];
j = i;
} else if (max2 <= a[i]) {
max2 = a[i];
}
}
for (int i = 0; i < n; i++) {
if (a[i] == sum - max1 - max1 && i != j) {
b[t] = i + 1;
t++;
}
}
if (sum - max1 - max2 == max2) {
b[t] = j + 1;
t++;
}
if (t == 0)
printf("0\n");
else {
int flag = 0;
printf("%d\n", t);
for (int i = 0; i < t; i++) {
if (flag) printf(" ");
printf("%d", b[i]);
flag = 1;
}
printf("\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxi = 1e6;
void solve() {
long long n;
cin >> n;
vector<long long> v(n);
map<long long, long long> mp;
long long sum = 0;
for (long long i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
mp[v[i]]++;
}
vector<long long> ans;
for (long long i = 0; i < n; i++) {
sum -= v[i];
mp[v[i]]--;
if (sum % 2 == 0) {
if (sum / 2 <= maxi and mp[sum / 2] > 0) {
ans.push_back(i + 1);
}
}
sum += v[i];
mp[v[i]]++;
}
cout << ans.size() << endl;
for (long long i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
}
int32_t main() {
{ solve(); }
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int M = 1000000007;
long long int power(long long int x, long long int n) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return (power((x * x) % M, n / 2)) % M;
else
return ((x % M) * power(x, n - 1) % M);
}
long long int ncr(int n, int r) {
if (r > n) return 0;
if (r > n - r) r = n - r;
long long int ans = 1;
int i;
for (i = 1; i <= r; i++) {
ans *= n - r + i;
ans /= i;
}
return ans;
}
long long int nCrModpDP(long long int n, long long int r, long long int p) {
long long int C[r + 1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (long long int i = 1; i <= n; i++) {
for (long long int j = min(i, r); j > 0; j--) C[j] = (C[j] + C[j - 1]) % p;
}
return C[r];
}
long long int ncrmod(long long int n, long long int r, long long int p) {
if (r == 0) return 1;
long long int ni = n % p, ri = r % p;
return (ncrmod(n / p, r / p, p) * nCrModpDP(ni, ri, p)) % p;
}
long long int modInverse(long long int a, long long int m) {
long long int m0 = m;
long long int y = 0, x = 1;
if (m == 1) return 0;
while (a > 1) {
long long int q = a / m;
long long int t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) x += m0;
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<long long int> num(n, 0);
map<int, int> vec;
long long int jum = 0;
for (int i = 0; i < n; i++) {
cin >> num[i];
jum += num[i];
}
vector<long long int> aa;
aa = num;
sort(num.begin(), num.end());
int d = 0;
vector<long long int> ans;
for (int i = 0; i < n; i++) {
if (i != n - 1) {
if (jum - num[i] - num[n - 1] == num[n - 1])
d += 1, ans.push_back(num[i]), vec[num[i]]++;
} else {
if (jum - num[i] - num[n - 2] == num[n - 2])
d += 1, ans.push_back(num[i]), vec[num[i]]++;
}
}
if (d == 0)
cout << "0";
else {
long long int sum = 0;
for (auto i = vec.begin(); i != vec.end(); i++) {
sum += (i->second);
}
cout << sum << "\n";
for (int i = 0; i < n; i++) {
if (vec[aa[i]] > 0) cout << i + 1 << " ";
}
}
return 0;
}
|
#include <bits/stdc++.h>
int dx[] = {0, 0, 1, 1};
int dy[] = {1, 1, 0, 0};
using namespace std;
vector<long long int> v2, v3, sum;
vector<pair<long long int, long long int> > v, v1;
map<long long int, long long int> m;
pair<long long int, long long int> p;
vector<int>::iterator it1, it2;
int main() {
long long int t;
cin >> t;
for (long long int i = 0; i < t; i++) {
long long int tmp;
cin >> tmp;
v.push_back({tmp, i});
}
v1 = v;
sort(v1.begin(), v1.end());
sum.push_back(v1[0].first);
long long int keep = v1[0].first;
for (long long int i = 1; i < t; i++) {
long long int tmp = v1[i].first;
tmp += sum[i - 1];
sum.push_back(tmp);
}
for (long long int i = 0; i < t - 1; i++) {
long long int ans = sum[t - 1];
ans -= v1[i].first;
if (ans % 2 == 0) {
ans /= 2;
if (ans == v1[t - 1].first) {
v3.push_back(v1[i].second);
}
}
}
long long int ans = sum[t - 1];
ans -= v1[t - 1].first;
if (ans % 2 == 0) {
ans /= 2;
if (ans == v1[t - 2].first) {
v3.push_back(v1[t - 1].second);
}
}
sort(v3.begin(), v3.end());
cout << v3.size() << endl;
for (long long int i = 0; i < v3.size(); i++) {
cout << v3[i] + 1 << " ";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int val, pos;
} a[201000];
int cmp(node x, node y) { return x.val < y.val; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int i, j, n;
cin >> n;
long long sum = 0;
for (i = 1; i <= n; i++) {
cin >> a[i].val;
a[i].pos = i;
sum += a[i].val;
}
sort(a + 1, a + n + 1, cmp);
long long ans = 0, tmax;
vector<int> vc;
for (i = 1; i <= n; i++) {
ans = sum - a[i].val;
if (i != n) {
tmax = a[n].val;
} else
tmax = a[n - 1].val;
if (tmax == ans - tmax) {
vc.push_back(a[i].pos);
}
}
cout << vc.size() << endl;
for (i = 0; i < vc.size(); i++) {
cout << vc[i] << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool com(long long arr[], long long n, long long s, long long m, long long j) {
long long sum = s - arr[j];
sum -= m;
if (sum == m) {
return 1;
}
return 0;
}
int main(int argc, char** argv) {
cin.tie(0);
cin.sync_with_stdio(0);
long long n;
cin >> n;
long long arr[n];
long long ar[n];
long long a[n];
long long s = 0;
for (long long i = 0; i < n; i++) {
ar[i] = -1;
cin >> arr[i];
s += arr[i];
a[i] = arr[i];
}
sort(a + 0, a + n);
long long m2 = a[n - 2];
long long m1 = a[n - 1];
long long c = 0;
for (long long i = 0; i < n; i++) {
if (arr[i] == m1) {
if (com(arr, n, s, m2, i) == 1) {
ar[i] = i;
c++;
}
} else {
if (com(arr, n, s, m1, i) == 1) {
ar[i] = i;
;
c++;
}
}
}
cout << c << "\n";
if (c == 0) return 0;
for (long long i = 0; i < n; i++) {
if (ar[i] != -1) cout << ar[i] + 1 << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long>> v;
long long n, m;
bool ch(long long q) {
bool ansf = false;
if (v[0].first != 1) {
if (q - v[0].second <= v[0].first - 1) {
ansf = true;
}
}
for (long long i = 1; i < m; i++) {
if (q - v[i].second + v[i + 1].second - q <= v[i + 1].first - v[i].first) {
ansf = true;
} else {
if (v[i + 1].first - v[i].first < abs(v[i + 1].second - v[i].second)) {
cout << "IMPOSSIBLE";
return 0;
}
}
}
if (v[m - 1].first != n) {
if (q - v[m - 1].second <= v[m - 1].first - n) {
ansf = true;
}
}
return ansf;
}
signed main() {
long long n;
cin >> n;
vector<long long> v(n);
long long sum = 0;
map<long long, long long> mp;
for (long long i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
for (long long i = 0; i < n; i++) {
mp[2 * v[i]]++;
}
vector<long long> ans;
for (long long i = 0; i < n; i++) {
if (mp[sum - v[i]] != 0 && ((sum - v[i] != v[i] * 2) ||
(sum - v[i] == v[i] * 2 && mp[v[i] * 2] > 1))) {
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (long long i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.