text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
long long sum = 0;
int main() {
int n;
cin >> n;
vector<int> arr(n), ind, cnt(1e6 + 1);
for (int i = 0; i < n; i++) {
cin >> arr[i];
cnt[arr[i]]++;
}
sum = accumulate(arr.begin(), arr.end(), 0ll);
for (int i = 0; i < n; i++) {
sum -= arr[i];
cnt[arr[i]]--;
if (sum % 2 == 0 && sum / 2 <= 1e6 && cnt[sum / 2] > 0) ind.push_back(i);
sum += arr[i];
cnt[arr[i]]++;
}
cout << ind.size() << endl;
for (auto u : ind) {
cout << u + 1 << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long i, j, k, l, m, n, a[300001], c, d, s, t;
long long b[2000001];
vector<long long> p;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
b[a[i]]++;
s += a[i];
}
for (i = 0; i < n; i++) {
k = s - a[i];
if (k > 2000000) continue;
b[a[i]]--;
if (k % 2 == 0 && b[k / 2] > 0) {
p.push_back(i + 1);
}
b[a[i]]++;
}
cout << p.size() << endl;
for (i = 0; i < p.size(); i++) cout << p[i] << ' ';
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
struct node {
long long num, id;
} a[maxn];
vector<long long> v;
bool cmp(node a, node b) { return a.num > b.num; }
int main() {
int n;
scanf("%d", &n);
long long sum = 0;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i].num);
sum += a[i].num;
a[i].id = i;
}
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
long long p = sum - a[i].num;
if (i == 1 && p - a[i + 1].num == a[i + 1].num) {
v.push_back(a[i].id);
}
if (i != 1 && p - a[1].num == a[1].num) {
v.push_back(a[i].id);
}
}
printf("%d\n", v.size());
for (int i = 0; i < v.size(); i++) {
printf("%lld ", v[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
long long a[200005];
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (long long(i) = (1); (i) <= (n); (i)++) cin >> a[i];
long long mx = 0, sum = 0;
for (long long(i) = (1); (i) <= (n); (i)++) mx = max(mx, a[i]), sum += a[i];
long long l = 1e18, r = -1e18;
for (long long(i) = (1); (i) <= (n); (i)++) {
if (a[i] == mx) l = min(l, i), r = max(r, i);
}
vector<long long> vec;
for (long long(i) = (1); (i) <= (n); (i)++) {
if (l == r && i == l) continue;
if (sum - a[i] == mx * 2) vec.push_back(i);
}
if (l == r) {
sum -= a[l], mx = 0;
for (long long(i) = (1); (i) <= (n); (i)++) {
if (i == l) continue;
mx = max(mx, a[i]);
}
if (mx * 2 == sum) vec.push_back(l);
}
cout << vec.size() << endl;
for (auto x : vec) cout << x << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
std::vector<int> z(MAX + 1);
int arr[n];
int x;
long long c = 0;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
c += arr[i];
z[arr[i]] += 1;
}
std::vector<int> v;
for (int i = 0; i < n; ++i) {
c -= arr[i];
z[arr[i]] -= 1;
if (c % 2 == 0 && c / 2 <= MAX && z[c / 2] > 0) {
v.push_back(i + 1);
}
c += arr[i];
z[arr[i]] += 1;
}
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() {
long long n, k, x, y, m, flag = 0, r = 0, p = 0, q = 0, l = 0, z = 0, sum = 0,
i, j, k1, k2, k3, k4, t;
cin >> n;
long long a[n], b[n];
vector<long> v;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
sum += a[i];
b[i] = a[i];
}
sort(b, b + n);
for (i = 0; i < n; i++) {
if (b[n - 1] == a[i]) {
if (sum - a[i] == 2 * b[n - 2]) {
v.push_back(i + 1);
}
} else {
if (sum - a[i] == 2 * b[n - 1]) {
v.push_back(i + 1);
}
}
}
cout << v.size() << endl;
for (i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 100010;
const long long MOD = 1000000007;
void testCase() {
long long n;
cin >> n;
vector<pair<long long, long long> > a(n);
long long sum = 0;
for (long long i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
sum += a[i].first;
}
sort(begin(a), end(a));
long long mx1 = a[n - 1].first, mx2 = a[n - 2].first;
vector<long long> ans;
for (long long i = 0; i < n; i++) {
sum -= a[i].first;
if (a[i].first == mx1) {
if (sum - mx2 == mx2) {
ans.push_back(a[i].second);
}
} else {
if (sum - mx1 == mx1) {
ans.push_back(a[i].second);
}
}
sum += a[i].first;
}
cout << (long long)ans.size() << '\n';
for (long long i = 0; i < (long long)ans.size(); i++) {
cout << ans[i] + 1 << ' ';
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
for (long long tc = 1; tc <= t; tc++) {
testCase();
}
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 >> 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>
const long long MOD = 1e9 + 7;
const long long INF = 1011111111;
const long long LLINF = 1000111000111000111LL;
const long double EPS = 1e-10;
const long double PI = 3.14159265358979323;
using namespace std;
long long powm(long long base, long long exp, long long mod = MOD) {
long long ans = 1;
while (exp) {
if (exp & 1) ans = (ans * base) % mod;
exp >>= 1, base = (base * base) % mod;
}
return ans;
}
const long long N = 1000005;
long long a[N];
multiset<long long> m;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, sm = 0;
cin >> n;
for (long long i = 1; i < n + 1; i++) cin >> a[i], sm += a[i], m.insert(a[i]);
vector<long long> ans;
for (long long i = 1; i < n + 1; i++) {
m.erase(m.find(a[i]));
sm -= a[i];
long long maxm = *m.rbegin();
if (maxm == sm - maxm) ans.push_back(i);
m.insert(a[i]);
sm += a[i];
}
cout << (long long)((ans).size()) << '\n';
for (auto i : ans) cout << i << " ";
return 0;
}
|
#include <bits/stdc++.h>
long long mod = 1000000007;
long long inf = 1e18;
using namespace std;
pair<long long, long long> p[200011];
vector<long long> v;
int main() {
ios::sync_with_stdio(0);
long long n, i, x, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p[i].first;
sum += p[i].first;
p[i].second = i + 1;
}
sort(p, p + n);
for (i = 0; i < n; i++) {
if (i != n - 1) {
x = sum - p[i].first;
if (x - p[n - 1].first == p[n - 1].first) v.push_back(p[i].second);
} else {
x = sum - p[i].first;
if (x - p[n - 2].first == p[n - 2].first) v.push_back(p[i].second);
}
}
cout << v.size() << endl;
for (i = 0; i < v.size(); i++) cout << v[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int num;
int indx;
} a[200010];
int st[200010];
bool cmp(node x, node y) { return x.num < y.num; }
int main() {
int n;
long long sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].num;
sum += a[i].num;
a[i].indx = i;
}
sort(a + 1, a + n + 1, cmp);
int flag = 0;
for (int i = 1; i <= n; i++) {
long long lsum = sum;
lsum -= a[i].num;
if (i != n) {
if (lsum - a[n].num == a[n].num) {
st[flag++] = a[i].indx;
}
} else {
if (lsum - a[n - 1].num == a[n - 1].num) {
st[flag++] = a[i].indx;
}
}
}
cout << flag << endl;
for (int i = 0; i < flag; i++) {
cout << st[i] << " ";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
fast();
bool flag = true;
while (flag) {
flag = false;
long long n;
cin >> n;
vector<pair<long long, long long> > v;
long long sum = 0;
for (long long i = 1; i <= n; i++) {
long long t;
cin >> t;
sum += t;
v.push_back(make_pair(t, i));
}
sort(v.begin(), v.end());
vector<long long> goodIndices;
for (long long i = 0; i < v.size(); i++) {
long long ind = v[i].second;
long long val = v[i].first;
long long sum1 = sum - val;
if (i == v.size() - 1) {
long long sum2 = sum1 - v[v.size() - 2].first;
if (sum2 == v[v.size() - 2].first) goodIndices.push_back(ind);
continue;
}
long long sum2 = sum1 - v[v.size() - 1].first;
if (sum2 == v[v.size() - 1].first) {
goodIndices.push_back(ind);
}
}
sort(goodIndices.begin(), goodIndices.end());
cout << goodIndices.size() << endl;
for (long long i = 0; i < goodIndices.size(); i++)
cout << goodIndices[i] << " ";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
long long n, sum{0}, j = 0;
cin >> n;
pair<long long, long long> a[n];
for (auto &i : a) {
cin >> i.first;
i.second = ++j;
sum += i.first;
}
sort(a, a + n);
sum -= a[n - 1].first;
vector<long long> js;
for (long long i = 0; i < n - 1; ++i) {
if (sum - a[i].first == a[n - 1].first) {
js.push_back(a[i].second);
}
}
if (sum - a[n - 2].first == a[n - 2].first) {
js.push_back(a[n - 1].second);
}
cout << js.size() << '\n';
for (long long i : js) {
cout << i << ' ';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2 * 1e5 + 5;
int n, a[maxn], f1[maxn], f2[maxn], first[maxn], d = 0;
long long t = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
t += a[i];
if (i == 1)
f1[1] = a[1];
else
f1[i] = max(f1[i - 1], a[i]);
}
if (n == 2) {
cout << 0;
return 0;
}
f2[n] = a[n];
for (int i = n - 1; i >= 1; i--) f2[i] = max(f2[i + 1], a[i]);
for (int i = 1; i <= n; i++) {
long long p = t - a[i], maxx;
if (i == 1) {
maxx = f2[2];
if (p % maxx == 0 && p / maxx == 2) {
d++;
first[d] = i;
}
}
if (i == n) {
maxx = f1[n - 1];
if (p % maxx == 0 && p / maxx == 2) {
d++;
first[d] = i;
}
}
if (i > 1 && i < n) {
maxx = max(f1[i - 1], f2[i + 1]);
if (p % maxx == 0 && p / maxx == 2) {
d++;
first[d] = i;
}
}
}
cout << d << '\n';
for (int i = 1; i <= d; i++) cout << first[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;
const double PI = 3.14159265358979323846;
const int N = 1e6 + 5;
const long long MOD = 1000000007;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
bool cmp(const pair<int, int>& a, const pair<int, int>& b) {
return (a.second < b.second);
}
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long power(long long n, long long k) {
if (k == 0) return 1;
long long sq = (power(n, k / 2));
sq = (sq * sq);
if (k % 2 == 1) sq = (sq * n);
return sq;
}
bool isPrime(int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
string to_binary(int x) {
string s;
while (x > 0) {
s += (x % 2 ? '1' : '0');
x /= 2;
}
reverse(s.begin(), s.end());
return s;
}
bool isPerfect(long long x) {
if (x < 1) return false;
long long root(round(sqrt(x)));
return x == root * root * 1LL;
}
bool valid(int i, int j, int n, int m) {
return i >= 0 && i < n && j >= 0 && j < m;
}
long long FastPower(long long x, long long y) {
return (!y ? 1
: (((y & 1) ? x : 1) % MOD *
FastPower((x % MOD) * (x % MOD) % MOD, y >> 1) % MOD) %
MOD);
}
void solve() {
int n;
cin >> n;
vector<pair<int, int>> arr(n);
vector<int> ans;
long long all_sum = 0;
for (int i = 0; i < n; i++)
cin >> arr[i].first, arr[i].second = i, all_sum += arr[i].first;
sort((arr).begin(), (arr).end());
bool flg = true;
for (int i = 0; i < n - 1; i++) {
if ((all_sum - arr[i].first - arr[n - 1].first) == arr[n - 1].first)
ans.push_back(arr[i].second + 1), flg = false;
}
if ((all_sum - arr[n - 1].first - arr[n - 2].first) == arr[n - 2].first)
ans.push_back(arr[n - 1].second + 1), flg = false;
if (((int)((ans).size())) == 0) {
cout << ((int)((ans).size())) << "\n";
} else {
cout << ((int)((ans).size())) << "\n";
for (int i = 0; i < ((int)((ans).size())) - 1; i++) cout << ans[i] << " ";
cout << ans[((int)((ans).size())) - 1] << "\n";
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t = 1;
while (t--) solve();
}
|
#include <bits/stdc++.h>
const long long INF = 1e18;
const long long mx = 0;
const long long mn = 1e9;
using namespace std;
long long n, a[200005], ans, sum, l;
map<long long, long long> mp;
vector<long long> vr;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 1; i <= n; i++) {
mp[a[i]]++;
}
for (int i = 1; i <= n; i++) {
if (mp[(sum - a[i]) / 2] && (sum - a[i]) % 2 == 0) {
if (mp[(sum - a[i]) / 2] == 1 && a[i] == (sum - a[i]) / 2) {
l++;
} else {
vr.push_back(i);
}
}
}
cout << vr.size() << "\n";
for (int i = 0; i < vr.size(); i++) {
cout << vr[i] << " ";
}
return 0;
;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
void solve() {
long long n;
cin >> n;
long long a[n + 1];
long long sum = 0;
vector<pair<long long, long long> > v(n);
for (long long i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
v[i].first = a[i];
v[i].second = i;
}
sort(v.begin(), v.end());
vector<long long> ans;
for (int i = 0; i < (n); i++) {
if (i != n - 1) {
if (v[n - 1].first == (sum - v[i].first - v[n - 1].first)) {
ans.push_back(v[i].second + 1);
}
} else {
if (v[n - 2].first == (sum - v[i].first - v[n - 2].first))
ans.push_back(v[i].second + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < (ans.size()); i++) cout << ans[i] << " ";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
pair<int, int> a[200000];
long long sum = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a[i] = {x, i + 1};
sum += x;
}
sort(a, a + n);
vector<int> v;
for (int i = 0; i < n - 1; i++)
if (sum - a[i].first - a[n - 1].first == a[n - 1].first)
v.push_back(a[i].second);
if (sum - a[n - 1].first - a[n - 2].first == a[n - 2].first)
v.push_back(a[n - 1].second);
cout << v.size() << endl;
for (auto i : v) cout << i << " ";
}
|
#include <bits/stdc++.h>
using ll = long long;
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
int n;
std::cin >> n;
std::vector<std::pair<ll, int>> vec(n);
ll sum = 0;
for (int i = 0; i < n; ++i) {
ll x;
std::cin >> x;
vec[i] = {x, i + 1};
sum += x;
}
std::vector<int> ans;
std::sort(vec.begin(), vec.end());
sum -= vec[n - 1].first;
for (int i = 0; i < n - 1; ++i) {
if (sum - vec[i].first == vec[n - 1].first) {
ans.push_back(vec[i].second);
}
}
sum -= vec[n - 2].first;
if (vec[n - 2].first == sum) {
ans.push_back(vec[n - 1].second);
}
std::cout << (int)ans.size() << "\n";
for (int i = 0; i < (int)ans.size(); ++i) {
std::cout << ans[i] << " ";
}
std::cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pa;
const int N = 2e5 + 5;
int a[N], maxx = 0, maxx2 = 0;
ll sum = 0;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
sum += a[i];
if (a[i] > maxx) {
maxx2 = max(maxx2, maxx);
maxx = a[i];
} else
maxx2 = max(maxx2, a[i]);
}
int cnt = 0;
int ans[N];
for (int i = 1; i <= n; ++i)
if (sum - a[i] == 2 * (a[i] == maxx ? maxx2 : maxx)) ans[cnt++] = i;
printf("%d\n", cnt);
for (int i = 0; i < cnt; ++i) printf("%d ", ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, a[200005], arr[200005], s = 0, c, x, cnt[1000006];
long long binarySearch(long long arr[], long long l, long long r, long long x) {
if (r >= l) {
int mid = (r + l) / 2;
if (arr[mid] == x) return mid;
if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
int main() {
cin >> n;
vector<long long> v;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
arr[i] = a[i];
cnt[a[i]]++;
}
sort(arr, arr + n);
for (int i = 0; i < n; i++) {
c = s - a[i];
if (c % 2 == 0) {
c /= 2;
x = binarySearch(arr, 0, n - 1, c);
if (x != -1) {
if (a[i] == arr[x] && cnt[a[i]] > 1)
v.push_back(i + 1);
else if (a[i] != arr[x])
v.push_back(i + 1);
}
}
}
cout << v.size() << endl;
for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int oo = (1e9) + 7;
long long oo2 = 1ll * oo * oo;
int main() {
int n;
cin >> n;
vector<long long> v(n);
long long soma = 0;
map<long long, list<int>> mp;
for (int i = 0; i < n; i++) {
scanf("%lld", &v[i]);
mp[v[i]].push_back(i);
soma += v[i];
}
vector<int> ans;
for (int i = 0; i < n; i++) {
long long aux = (soma - v[i]) / 2;
if ((soma - v[i]) % 2 == 1) continue;
if (mp.find(aux) != mp.end()) {
if (mp[aux].size() == 1 and mp[aux].front() == i) continue;
ans.push_back(i);
}
}
if (ans.empty())
puts("0");
else {
printf("%d\n", (int)ans.size());
for (int k : ans) printf("%d ", k + 1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
static int n;
static vector<long long> ve;
static multiset<long long> s;
static vector<int> ans;
int main() {
while (scanf("%d", &n) != EOF) {
s.clear();
long long sum = 0;
ve.clear();
ve.resize(n);
for (int i = 0; i < n; i++) {
scanf("%I64d", &ve[i]);
sum += ve[i];
s.insert(ve[i]);
}
ans.clear();
for (int i = 0; i < n; i++) {
long long p = sum - ve[i];
if (p % 2) continue;
auto it1 = s.lower_bound(ve[i]);
s.erase(it1);
auto it2 = s.lower_bound(p / 2);
if (it2 == s.end() || *it2 != p / 2) {
s.insert(ve[i]);
continue;
}
ans.push_back(i + 1);
s.insert(ve[i]);
}
printf("%d\n", ans.size());
for (auto& v : ans) printf("%d ", v);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
ostream& operator<<(ostream& os, const vector<long long>& a) {
for (long long i = 0; i < a.size(); ++i) {
os << a[i] << ' ';
}
return os;
}
bool res[200005];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
long long sum = 0, ma1 = 0, ma2 = 0, ima1, ima2;
for (long long i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
if (a[i] > ma1) {
ma2 = ma1;
ima2 = ima1;
ma1 = a[i];
ima1 = i;
continue;
}
if (a[i] > ma2) {
ma2 = a[i];
ima2 = i;
}
}
long long c = 0;
for (long long i = 0; i < n; ++i) {
if ((ma1 == sum - ma1 - a[i] && ima1 != i) ||
(ma2 == sum - ma2 - a[i] && ima2 != i)) {
res[i + 1] = true;
c++;
}
}
long long ci = 0, i = 0;
cout << c << endl;
while (ci < c) {
if (res[i]) {
cout << i << ' ';
ci++;
}
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[1000000], s[10000000];
int main() {
long long sum = 0, b = -1, c = -1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
if (s[i] > c) {
b = c;
c = s[i];
} else if (s[i] > b)
b = s[i];
}
int k = 0;
for (int i = 0; i < n; i++) {
if (s[i] == c) {
if (sum - c - b == b) a[k++] = i;
} else {
if (sum - s[i] - c == c) a[k++] = i;
}
}
cout << k << endl;
for (int i = 0; i < k; i++) {
cout << a[i] + 1 << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long MOD = (long long)1e9 + 7LL;
long long a[100005];
vector<long long> v;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, q, c, m, x, y, cnt = 0, sum = 0, t, maxi = 0;
cin >> n;
vector<pair<long long, long long> > a(n);
for (int i = 0; i < n; i++)
cin >> a[i].first, a[i].second = i + 1, sum += a[i].first;
sort(a.begin(), a.end());
sum -= a[n - 1].first;
for (int i = 0; i < n; i++) {
if ((sum - a[i].first == a[n - 1].first && i != n - 1))
v.push_back(a[i].second);
}
if ((sum - a[n - 2].first == a[n - 2].first)) v.push_back(a[n - 1].second);
cout << v.size() << "\n";
for (auto i : v) cout << i << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<long long> a(n);
long long sum = 0;
unordered_map<long long, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
sum += a[i];
}
vector<long long> ans;
for (int i = 0; i < n; i++) {
long long rest = sum - a[i];
if (rest % 2) continue;
rest /= 2;
if (rest == a[i] && mp[a[i]] < 2) continue;
if (mp.find(rest) != mp.end()) {
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (auto it : ans) cout << it << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[1000007];
vector<long long> v;
bool sortinrev(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.first > b.first);
}
void seive() {
for (long long i = 0; i <= 1000000; i++) a[i] = 1;
a[0] = a[1] = 0;
for (long long i = 2; i <= 1000; i++) {
if (a[i] == 1) {
v.push_back(i);
for (long long j = 2 * i; j <= 1000000; j += i) a[j] = 0;
}
}
for (long long i = 1001; i <= 1000000; i++) {
if (a[i] == 1) v.push_back(i);
}
}
long long nCr(long long n, long long r) {
long long ans = 1;
long long k = 2;
if (n - r < r)
k = n - r;
else
k = r;
for (long long i = n; i >= n - k; i--) {
ans *= i;
if (ans % k == 0 && k > 1) {
ans /= k;
k--;
}
}
while (k > 1) {
ans /= k;
k--;
}
return ans;
}
long long fpow(long long a, long long n) {
if (n == 1) return a;
if (n % 2) return (a % 1000000007 * fpow(a, n - 1) % 1000000007) % 1000000007;
return (fpow(a, n / 2) % 1000000007 * fpow(a, n / 2) % 1000000007) %
1000000007;
}
int32_t main() {
ios_base ::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
long long a[n];
map<long long, vector<long long> > mp;
long long sum = 0;
for (long long i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]].push_back(i + 1);
sum += a[i];
}
long long b[n];
for (long long i = 0; i < n; i++) {
b[i] = sum - a[i];
}
set<long long> v;
for (long long i = 0; i < n; i++) {
if (mp.find(b[i] - a[i]) != mp.end()) {
for (long long j = 0; j < mp[b[i] - a[i]].size(); j++) {
if (mp[b[i] - a[i]][j] - 1 != i) v.insert(mp[b[i] - a[i]][j]);
}
}
}
cout << v.size() << "\n";
for (set<long long>::iterator x = v.begin(); x != v.end(); x++) {
cout << *x << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e6 + 10;
vector<int> v1[MAXN];
int a[MAXN];
int cm[MAXN];
long long s[MAXN];
long long ans = 0;
set<int> s1;
set<int>::iterator iter;
void init() {
memset(a, 0, sizeof(a));
memset(cm, 0, sizeof(cm));
memset(s, 0, sizeof(s));
for (int i = 0; i < MAXN; i++) {
v1[i].clear();
}
s1.clear();
ans = 0;
}
int main() {
int N;
while (~scanf("%d", &N)) {
init();
for (int i = 1; i <= N; i++) {
scanf("%d", &a[i]);
cm[i] = a[i];
ans += a[i];
v1[a[i]].push_back(i);
}
for (int i = 1; i <= N; i++) {
s[i] = ans - a[i];
}
sort(cm + 1, cm + N + 1);
for (int i = 1; i <= N; i++) {
long long cha = s[i] - a[i];
int pos = lower_bound(cm + 1, cm + 1 + N, cha) - cm;
for (int j = 0;
j < v1[cm[pos]].size() &&
(v1[cm[pos]].size() > 1 || cm[pos] != a[i]) && cm[pos] == cha;
j++) {
s1.insert(v1[cm[pos]][j]);
}
}
long long flag = s1.size();
if (flag == 0) {
printf("0\n");
} else {
printf("%lld\n", flag);
for (iter = s1.begin(); iter != s1.end(); iter++) {
printf("%d ", *iter);
}
printf("\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int maxint = numeric_limits<int>::max();
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
long long bino(int n, int m) {
long long j = 1;
for (int i = 0; i < m; i++) j = j * (n - i) / (i + 1);
return j;
}
long long int fast_power(long long int a, long long int x) {
if (x == 0)
return 1;
else if (x == 1)
return a;
else {
long long int R = fast_power(a, x >> 1);
if (!(x & 1))
return R * R;
else
return R * a * R;
}
}
void solve() {
long long int n, c = 0;
cin >> n;
long long int a[n];
long long int b[n];
vector<pair<long long int, long long int>> vec;
for (long long int i = 0; i < n; i++) {
b[i] = 0;
cin >> a[i];
vec.push_back(make_pair(a[i], i));
}
sort(vec.begin(), vec.end());
for (long long int i = 0; i < n; i++) {
if (i == 0)
b[i] += vec[i].first;
else
b[i] += vec[i].first + b[i - 1];
}
vector<long long int> v;
for (long long int i = 0; i < n; i++) {
if (i != n - 1) {
if (b[n - 1] - vec[i].first - vec[n - 1].first == vec[n - 1].first)
v.push_back(vec[i].second);
} else {
if (b[n - 2] - vec[n - 2].first == vec[n - 2].first)
v.push_back(vec[i].second);
}
}
cout << v.size() << endl;
for (long long int i = 0; i < v.size(); i++) cout << v[i] + 1 << " ";
}
int main() {
ios_base::sync_with_stdio(false);
long long int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[200500], b[1005000], c[200500], j = 1;
long long sum;
int n;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%I64d", &a[i]);
b[a[i]]++;
sum += a[i];
}
for (int i = 0; i < n; i++) {
sum -= a[i];
if (sum % 2 == 0 && sum / 2 <= 1000000) {
if (a[i] == sum / 2 && b[sum / 2] > 1) {
c[j] = i + 1;
j++;
} else if (a[i] != sum / 2 && b[sum / 2] > 0) {
c[j] = i + 1;
j++;
}
}
sum += a[i];
}
if (j == 1) {
printf("0\n");
return 0;
}
printf("%I64d\n", j - 1);
for (int i = 1; i < j - 1; i++) {
printf("%I64d ", c[i]);
}
printf("%I64d\n", c[j - 1]);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int n;
cin >> n;
vector<int> cnt(MAX, 0), v(n, 0);
long long sum = 0;
for (int i = 0; i < n; ++i) {
cin >> v[i];
cnt[v[i]]++;
sum += (long long)v[i];
}
vector<int> ans;
for (int i = 0; i < n; ++i) {
long long s = sum - v[i];
--cnt[v[i]];
if (s / 2 < MAX && s % 2 == 0 && cnt[s / 2] > 0) ans.push_back(i + 1);
++cnt[v[i]];
}
cout << ans.size() << "\n";
for (int i = 0; i < ans.size(); ++i) cout << ans[i] << " ";
cout << "\n";
}
|
#include <bits/stdc++.h>
const uint32_t MAX_N = 200001;
const uint32_t MAX_A = 1000001;
std::array<int32_t, MAX_N> a;
std::array<int32_t, MAX_A> count;
std::vector<int32_t> js;
int main(void) {
int32_t n;
int64_t sum = 0;
std::cin >> n;
for (int32_t i = 0; i < n; i++) {
std::cin >> a[i];
count[a[i]]++;
sum += a[i];
}
for (int32_t i = 0; i < n; i++) {
sum -= a[i];
count[a[i]]--;
if (sum % 2 == 0 && sum / 2 < MAX_A && count[sum / 2] > 0)
js.push_back(i + 1);
sum += a[i];
count[a[i]]++;
}
std::cout << js.size() << std::endl;
for (int32_t j : js) {
std::cout << j << " ";
}
return EXIT_SUCCESS;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n;
long long a[N];
map<long long, int> ma;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
long long sum = 0;
for (int i = (0); i < (n); i++) {
cin >> a[i];
sum += a[i];
ma[a[i]]++;
}
vector<int> ve;
for (int i = (0); i < (n); i++) {
if ((sum - a[i]) % 2 == 0 &&
(ma[(sum - a[i]) / 2] >= 2 ||
(a[i] != (sum - a[i]) / 2 && ma[(sum - a[i]) / 2] >= 1))) {
ve.push_back(i);
}
}
cout << ((int)(ve).size()) << '\n';
for (int x : ve) {
cout << x + 1 << ' ';
}
cout << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int num, pos;
bool operator<(const node& a) const { return num < a.num; }
} a[200005];
vector<node> veans;
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i].num;
a[i].pos = i;
sum += a[i].num;
}
sort(a, a + n);
int ans = 0;
if (sum - a[n - 1].num == 2 * a[n - 2].num) ans++, veans.push_back(a[n - 1]);
for (int i = 0; i < n - 1; ++i) {
if (sum - a[i].num == 2 * a[n - 1].num) ans++, veans.push_back(a[i]);
}
if (veans.size() == 0)
puts("0"), puts("");
else {
cout << veans.size() << endl;
for (int i = 0; i < veans.size(); ++i) {
cout << veans[i].pos + 1 << " ";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> ind[1000005];
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
long long sum = 0;
set<int> ans;
for (int i = 1; i <= n; i++) cin >> a[i], sum += a[i], ind[a[i]].push_back(i);
for (int i = 1; i <= n; i++) {
long long cur = sum - 2 * a[i];
if (0 < cur && cur < 1000005)
if (ind[cur].size())
for (int j : ind[cur])
if (j != i) ans.insert(j);
}
cout << ans.size() << endl;
for (int k : ans) cout << k << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> cnt(MAX + 1);
for (int i = 0; i < n; ++i) {
cin >> a[i];
++cnt[a[i]];
}
long long sum = accumulate(a.begin(), a.end(), 0ll);
vector<int> ans;
for (int i = 0; i < n; ++i) {
sum -= a[i];
--cnt[a[i]];
if (sum % 2 == 0 && sum / 2 <= MAX && cnt[sum / 2] > 0) {
ans.push_back(i);
}
sum += a[i];
++cnt[a[i]];
}
cout << ans.size() << endl;
for (auto it : ans) cout << it + 1 << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
multiset<long long> v;
int main() {
long long t, n, i, j, arra[200000], l, m, sum = 0, k, r, x;
string s;
vector<long long> v2;
cin >> n;
for (i = 0; i < n; i++) {
cin >> arra[i];
v.insert(arra[i]);
sum += arra[i];
}
for (i = 0; i < n; i++) {
sum -= arra[i];
v.erase(v.find(arra[i]));
if (sum % 2 == 0 && v.count(sum / 2)) {
v2.push_back(i + 1);
}
sum += arra[i];
v.insert(arra[i]);
}
k = v2.size();
cout << k << endl;
for (i = 0; i < k; i++) {
cout << v2[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, i;
cin >> n;
vector<pair<long long int, long long int> > v;
vector<long long int> ans;
for (i = 0; i < n; i++) {
long long int x;
cin >> x;
v.push_back({x, i + 1});
}
sort(v.begin(), v.end());
long long int a[n];
a[0] = v[0].first;
for (i = 1; i < n; i++) {
a[i] = v[i].first + a[i - 1];
}
if (a[n - 3] * 2 == a[n - 2]) ans.push_back(v[n - 1].second);
for (i = 0; i < n - 1; i++) {
long long int x = a[n - 2];
if (x - v[i].first == v[n - 1].first) ans.push_back(v[i].second);
}
cout << ans.size() << "\n";
for (i = 0; i < ans.size(); i++) cout << ans[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[200005], f[1000005], an[200005], cnt = 0;
int main() {
long long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
f[a[i]]++;
sum += a[i];
}
for (int i = 0; i < n; i++) {
long long ans = (sum - a[i]);
if (ans & 1)
continue;
else
ans /= 2;
if (ans > 1000003)
continue;
else if (ans == a[i] && f[ans] > 1)
an[cnt++] = i + 1;
else if (ans != a[i] && f[ans])
an[cnt++] = i + 1;
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++) printf("%d ", an[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(false);
long long n;
cin >> n;
long long arr[n];
for (long long i = 0; i < n; i++) {
cin >> arr[i];
}
long long tot_sum = 0;
long long max = 0;
long long max2 = 0;
for (long long i = 0; i < n; i++) {
tot_sum += arr[i];
if (arr[i] > max) {
max2 = max;
max = arr[i];
} else if (arr[i] > max2) {
max2 = arr[i];
}
}
long long count = 0;
tot_sum -= max;
long long ind[n];
long long size = 0;
for (long long i = 0; i < n; i++) {
if (arr[i] != max) {
long long temp_sum = tot_sum;
temp_sum -= arr[i];
if (temp_sum == max) {
count++;
ind[size] = i + 1;
size++;
}
} else {
long long temp_sum = tot_sum;
temp_sum -= max2;
if (max2 == temp_sum) {
count++;
ind[size] = i + 1;
size++;
}
}
}
cout << count << endl;
for (long long i = 0; i < size; i++) {
cout << ind[i] << " ";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 5];
long long sum = 0;
int mx = -1, smx = -1;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (a[i] > mx) {
smx = mx;
mx = a[i];
} else if (a[i] > smx)
smx = a[i];
}
vector<int> v;
for (int i = 0; i < n; i++) {
long long nsum = sum - a[i];
if (a[i] == mx) {
if (nsum - smx == smx) {
v.push_back(i + 1);
}
} else if (nsum - mx == mx) {
v.push_back(i + 1);
}
}
cout << v.size() << "\n";
for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
ifstream fi("test.txt");
ifstream fir("inp.txt");
ofstream fo("out.txt");
const long long MOD = 1e9 + 7;
const long long base = 269;
const int ooi = 1 << 30;
const int N = 1e5 + 5;
long long P(long long x, long long y) {
long long ret = 1;
while (y > 0) {
if (y & 1) ret *= x;
y /= 2;
x = x * x;
}
return ret;
}
long long GCD(long long a, long long b) { return (b ? GCD(b, a % b) : a); }
long long n, m, q, k, pos, rs, check, t, T, s;
long long maxx = -1e9, minn = 1e9;
pair<long long, long long> a[2 * N];
vector<long long> ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
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); (i)++) {
long long s1 = s - a[i].first;
if (i == n - 1 && n - 2 >= 0) {
if (a[n - 2].first == s1 - a[n - 2].first) {
ans.push_back(a[i].second);
}
continue;
}
if (a[n - 1].first == s1 - a[n - 1].first) {
ans.push_back(a[i].second);
}
}
cout << ans.size() << "\n";
for (long long(i) = 0; (i) < (ans.size()); (i)++) {
cout << ans[i] << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = 2.0 * acos(0.0);
char small[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
long long int big_mod(long long int BASE, long long int POWER,
long long int MOD) {
if (POWER == 0)
return 1;
else if (POWER % 2 == 0) {
long long int RESULT = big_mod(BASE, POWER / 2, MOD);
return ((RESULT % MOD) * (RESULT % MOD)) % MOD;
} else
return ((BASE % MOD) * (big_mod(BASE, POWER - 1, MOD) % MOD)) % MOD;
}
int main() {
ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
int a[n], b[n];
long long int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
sum += a[i];
}
sort(b, b + n);
long long int p = sum - b[n - 1];
long long int q = sum - b[n - 2];
vector<int> v;
for (int i = 0; i < n; i++) {
if (p - a[i] == b[n - 1] && (a[i] != b[n - 1] || b[n - 1] == b[n - 2]))
v.push_back(i + 1);
else if (q - a[i] == b[n - 2] &&
(a[i] != b[n - 2] || (b[n - 2] == b[n - 3] && n - 3 >= 0) ||
b[n - 2] == b[n - 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;
int main() {
long long n, sum = 0;
cin >> n;
vector<pair<long long, long long>> v;
vector<long long> ans;
for (int i = 0; i < n; i++) {
long long k;
cin >> k;
v.push_back(make_pair(k, i + 1));
sum += k;
}
sort(v.begin(), v.end());
for (int i = 0; i < n - 1; i++) {
if (v[n - 1].first == sum - v[i].first - v[n - 1].first) {
ans.push_back(v[i].second);
}
}
if (n > 1 && v[n - 2].first == sum - v[n - 1].first - v[n - 2].first) {
ans.push_back(v[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;
const int maxn = 1e6 + 10;
long long int sum[maxn];
struct node {
int sum, id;
} a[maxn];
bool cmp(node &a, node &b) { return a.sum < b.sum; }
int p[maxn], cnt = 0;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].sum;
a[i].id = i;
}
sort(a + 1, a + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + a[i].sum;
}
int ans = 0;
for (int i = 1; i < n; i++) {
if ((sum[n - 1] - a[i].sum) == a[n].sum) ans++, p[cnt++] = a[i].id;
}
if (sum[n - 2] == a[n - 1].sum) ans++, p[cnt++] = a[n].id;
cout << ans << endl;
for (int i = 0; i < cnt; i++) cout << p[i] << ' ';
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
unsigned long long T, n, m;
cin >> n;
vector<long long> a(n, 0);
vector<long long> answer;
vector<long long> dup(1000006, 0);
unsigned long long total_sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
dup[a[i]]++;
total_sum += a[i];
}
for (int i = 0; i < n; i++) {
unsigned long long cur_sum = total_sum - a[i];
if (cur_sum % 2 == 1) continue;
cur_sum /= 2;
if (cur_sum > 1000000) continue;
if (cur_sum == a[i] && dup[a[i]] > 1) {
answer.push_back(i);
} else if (cur_sum != a[i] && dup[cur_sum] >= 1) {
answer.push_back(i);
}
}
cout << answer.size() << endl;
for (unsigned long long ca : answer) cout << (ca + 1) << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200000, A = 1000000;
int aa[N], kk[A + 1];
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
kk[a]++;
aa[i] = a;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
int a = aa[i];
sum -= a;
kk[a]--;
if (sum % 2 == 0 && sum / 2 <= A && kk[sum / 2]) aa[cnt++] = i;
sum += a;
kk[a]++;
}
cout << cnt << '\n';
while (cnt--) cout << aa[cnt] + 1 << ' ';
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[202400];
int b[1001000];
void solve() {
int i;
long long m = 0;
for (i = 0; i <= 1000000; i++) {
b[i] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
b[a[i]]++;
m += a[i];
}
int ans = 0;
for (i = 0; i < n; i++) {
long long x = m - (long long)a[i];
if (x <= 2000000 && x % 2 == 0) {
if (a[i] != x / 2 && b[x / 2] > 0 || a[i] == x / 2 && b[x / 2] > 1) {
ans++;
}
}
}
printf("%d\n", ans);
for (i = 0; i < n; i++) {
long long x = m - (long long)a[i];
if (x <= 2000000 && x % 2 == 0) {
if (a[i] != x / 2 && b[x / 2] > 0 || a[i] == x / 2 && b[x / 2] > 1) {
printf("%d ", (i + 1));
}
}
}
printf("\n");
}
int main() {
while (scanf("%d", &n) != EOF) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[200010];
long long sum;
std::vector<int> ans;
std::map<long long, int> numCountMap;
int main() {
sum = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%I64d", &(a[i]));
numCountMap[a[i]]++;
sum = sum + a[i];
}
ans.clear();
long long dSum, target;
int order;
for (int i = 1; i <= n; i++) {
dSum = sum - a[i];
numCountMap[a[i]]--;
if (dSum % 2 == 0) {
target = dSum / 2;
if (numCountMap[target] > 0) {
ans.push_back(i);
}
}
numCountMap[a[i]]++;
}
printf("%d\n", ans.size());
for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<unsigned long long, vector<int> > num_pos;
vector<int> arr;
vector<int> ans;
bool sudah[2000010];
int main() {
int n;
cin >> n;
int x;
unsigned long long sum = 0;
for (x = 1; x <= n; x++) {
int a;
cin >> a;
sum += a;
arr.push_back(a);
num_pos[a].push_back(x);
}
for (x = 0; x < arr.size(); x++) {
if (sudah[arr[x]] == 0) {
int y;
sudah[arr[x]] = 1;
unsigned long long need = sum - arr[x] - arr[x];
if (need == arr[x]) {
if (num_pos[need].size() == 1) {
} else {
for (y = 0; y < num_pos[need].size(); y++) {
ans.push_back(num_pos[need][y]);
}
}
} else {
for (y = 0; y < num_pos[need].size(); y++) {
ans.push_back(num_pos[need][y]);
}
}
}
}
cout << ans.size() << endl;
if (ans.size()) {
for (x = 0; x < ans.size(); x++) {
if (x) {
cout << " ";
}
cout << ans[x];
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int const N = 2 * 1e5 + 10;
long long a[N];
map<long long, int> mp;
vector<int> v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n, sum = 0;
cin >> n;
for (int i = 0; i < (int)(n); ++i) cin >> a[i], mp[a[i]]++, sum += a[i];
for (int i = 0; i < (int)(n); ++i)
if (((mp[(sum - a[i]) / 2] && a[i] != (sum - a[i]) / 2) ||
(a[i] == (sum - a[i]) / 2 && mp[(sum - a[i]) / 2] > 1)) &&
(sum - a[i]) % 2 == 0)
v.push_back(i + 1);
int sz = v.size();
cout << sz << endl;
for (int i = 0; i < (int)(sz); ++i) cout << v[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 200009;
int n;
vector<pair<int, int> > a;
int main() {
while (cin >> n) {
a.resize(n);
long long sum = 0, x;
for (int i = 0; i < n; i++) {
cin >> x;
a[i] = make_pair(x, i + 1);
sum += x;
}
sort(a.begin(), a.end());
if (n == 2)
cout << "0" << endl;
else {
vector<int> res;
if (2 * a[n - 2].first == sum - a[n - 1].first)
res.push_back(a[n - 1].second);
for (int i = n - 2; i >= 0; i--) {
if (sum - a[i].first == 2 * a[n - 1].first) res.push_back(a[i].second);
}
cout << res.size() << endl;
if (res.size()) {
for (auto j : res) cout << j << " ";
cout << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int count;
cin >> count;
int result = 0;
std::uint64_t max = 0;
std::vector<std::pair<int, int>> arr;
std::vector<int> arr_result;
for (int i = 0; i < count; i++) {
int value = 0;
cin >> value;
max += value;
arr.push_back(make_pair(value, i + 1));
}
if (arr.size() >= 3) {
std::sort(arr.begin(), arr.end(),
[](const std::pair<int, int>& l, const std::pair<int, int>& p) {
return l.first > p.first;
});
for (int i = 0; i < arr.size(); i++) {
std::uint64_t c_max = max - arr[i].first;
if ((c_max % 2 == 0) &&
(i == 0 ? arr[1].first : arr[0].first) == c_max / 2) {
result += 1;
arr_result.push_back(arr[i].second);
}
}
}
cout << result << endl;
if (result != 0)
for (const auto& iter : arr_result) cout << iter << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long hell = 1000000007;
const long long INF = 1000000000;
void solve() {
long long n;
cin >> n;
map<long long, long long> mp;
long long a[n];
long long s = 0;
for (long long i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
mp[a[i]]++;
}
vector<long long> ans;
for (long long i = 0; i < n; i++) {
long long S = s - a[i];
if (S % 2) continue;
mp[a[i]]--;
S = S / 2;
if (mp[S]) ans.push_back(i);
mp[a[i]]++;
}
cout << ans.size() << endl;
for (long long j : ans) cout << j + 1 << " ";
cout << endl;
}
int32_t main() {
long long t;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
unsigned long long n, s, j, i, a[200005], b[200005];
map<unsigned long long, unsigned long long> c;
int main() {
cin >> n;
j == 0;
s == 0;
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
c[a[i]]++;
}
for (i = 0; i < n; i++) {
s -= a[i];
c[a[i]]--;
if (s % 2 == 0 && c[s / 2] > 0) {
j++;
b[j] = i + 1;
}
s += a[i];
c[a[i]]++;
}
cout << j << endl;
for (i = 1; i <= j; i++) cout << b[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long n, i, x, sum = 0;
vector<long long> p;
vector<pair<long long, long long>> v;
cin >> n;
for (i = 0; i < n; ++i) {
cin >> x;
v.push_back({x, i});
sum += x;
}
sort(v.begin(), v.end());
sum -= v[n - 1].first;
for (i = 0; i < n - 1; ++i) {
if (sum - v[i].first == v[n - 1].first) p.push_back(v[i].second);
}
sum -= v[n - 2].first;
if (sum == v[n - 2].first) p.push_back(v[n - 1].second);
cout << p.size() << "\n";
for (auto x : p) cout << x + 1 << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
int main(int argc, char *argv[]) {
int n;
scanf("%d", &n);
vector<pair<int, int> > a;
vector<int> ans;
int tmp;
for (int i = 1; i <= n; i++) {
scanf("%d", &tmp);
a.push_back(pair<int, int>(tmp, i));
}
sort(a.begin(), a.end(), cmp);
long long sum = 0;
int len = a.size();
for (int i = 0; i < len; i++) {
sum += a[i].first;
}
int flag = 0;
int index = 0;
while (sum - a[index].first - a[len - 1].first >= a[len - 1].first) {
if (index >= len - 1) break;
if (sum - a[index].first - a[len - 1].first == a[len - 1].first) {
flag++;
ans.push_back(a[index].second);
}
index++;
}
if (sum - a[len - 1].first - a[len - 2].first == a[len - 2].first) {
flag++;
ans.push_back(a[len - 1].second);
}
index = len - 2;
if (flag) {
printf("%d\n", flag);
for (int i = 0, len = ans.size(); i < len; i++) {
printf("%d ", ans[i]);
}
} else {
printf("0\n");
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct B {
long long S, W;
friend bool operator<(const B &a1, const B &a2) {
if (a1.S < a2.S) return true;
return false;
}
friend bool operator<(const B &a1, const long long &a2) {
if (a1.S < a2) return true;
return false;
}
friend bool operator<(const long long &a1, const B &a2) {
if (a1 < a2.S) return true;
return false;
}
};
long long SE(B b[], long long n, long long K) {
long long low = 0, high = n - 1, mid;
while (low <= high) {
mid = low + (high - low) / 2;
if (b[mid].S == K)
return mid;
else if (b[mid].S < K)
low = mid + 1;
else
high = mid - 1;
}
if (low > high) return -1;
}
B b[1000000];
long long d[1000000];
int main() {
long long n, he = 0, c = 0;
cin >> n;
for (long long i = 0; i < n; ++i) {
cin >> b[i].S;
he += b[i].S;
b[i].W = i + 1;
}
sort(b, b + n);
long long kk = he - b[n - 1].S * 2;
if (he - b[n - 1].S == b[n - 2].S * 2) {
d[c++] = b[n - 1].W;
}
if (!binary_search(b, b + n - 1, kk)) {
if (c)
printf("1\n%lld", d[0]);
else
printf("0");
exit(0);
} else {
for (long long i = SE(b, n - 1, kk); i < n - 1 && b[i].S == kk; i++) {
d[c++] = b[i].W;
}
for (long long i = SE(b, n - 1, kk) - 1; i >= 0 && b[i].S == kk; i--) {
d[c++] = b[i].W;
}
}
printf("%lld\n%lld", c, d[0]);
for (long long i = 1; i < c; ++i) {
printf(" %lld", d[i]);
}
return 0;
}
|
#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, k, j;
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;
mp[a[i].first]++;
s += a[i].first;
a[i].second = i + 1;
}
for (i = 0; i < n; i++) {
k = 0;
z = s - a[i].first;
if (mp[z - a[i].first] >= 1) {
x = z - a[i].first;
if (x == a[i].first && mp[x] == 1) {
continue;
}
for (j = 0; j < n; j++) {
if (a[j].first == x) {
v.push_back(a[j].second);
mp[x]--;
}
if (mp[x] == 0) {
break;
}
}
}
}
cout << v.size() << endl;
for (i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k = 0, b[900005];
long long sum;
struct note {
int num;
int x;
} a[900005];
int cmp(note m, note n) { return m.x < n.x; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i].x);
a[i].num = i;
}
sort(a + 1, a + n + 1, cmp);
for (int j = 1; j < n; j++) sum += a[j].x;
for (int i = 1; i < n; i++) {
sum -= a[i].x;
if (sum == a[n].x) {
b[k] = a[i].num;
k++;
}
sum += a[i].x;
}
sum -= a[n - 1].x;
if (sum == a[n - 1].x) {
b[k] = a[n].num;
k++;
}
printf("%d\n", k);
for (int i = 0; i < k; i++) cout << b[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
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 <= 1000000) {
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++) {
scanf("%d", &a[i].val);
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;
struct shiki {
long long int id, t;
} a[900005];
bool cmp(shiki q, shiki p) { return q.t < p.t; }
long long int sum[900005], b[900005];
int main() {
long long int n;
while (scanf("%lld", &n) != EOF) {
long long int t_sum = 0;
memset(sum, 0, sizeof(sum));
for (long long int i = 1; i <= n; i++) {
scanf("%lld", &a[i].t);
a[i].id = i;
t_sum += a[i].t;
}
sort(a, a + n + 1, cmp);
int t = 0;
for (long long int i = 1; i <= n; i++) {
sum[i] = t_sum - a[i].t;
}
for (long long int i = 1; i <= n; i++) {
long long int sum1 = 0, temp = 0;
sum1 = sum[i];
if (i != n) {
temp = a[n].t;
} else {
temp = a[n - 1].t;
}
if (temp * 2 == sum1) {
t++;
b[t] = a[i].id;
}
}
printf("%d\n", t);
if (t != 0) {
for (long long int i = 1; i < t; i++) {
printf("%d ", b[i]);
}
printf("%d\n", b[t]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e6 + 15;
void my_dbg() { cout << endl; }
template <typename Arg, typename... Args>
void my_dbg(Arg A, Args... B) {
cout << ' ' << A;
my_dbg(B...);
}
bool vis[N];
int main() {
int n;
scanf("%d", &n);
vector<int> a(n + 1);
long long sum = 0;
multiset<int, greater<int> > s;
for (int i = 1; i < (int)n + 1; i++) {
scanf("%d", &a[i]), sum += a[i], vis[a[i]] = 1;
s.insert(a[i]);
}
vector<int> id;
for (int i = 1; i < (int)n + 1; i++) {
int cur = a[i];
s.erase(s.find(a[i]));
int mx = *s.begin();
if (2 * mx == sum - a[i]) id.push_back(i);
s.insert(a[i]);
}
printf("%d\n", (int)id.size());
for (auto xy : id) printf("%d ", (int)xy);
printf("\n");
;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, int> vis;
int n, cnt = 0;
long long a[200005], ans[200005];
int main() {
scanf("%d", &n);
long long sum = 0;
for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), vis[a[i]]++, sum += a[i];
for (int i = 1; i <= n; i++) {
long long t = sum - a[i];
if (t % 2) continue;
t /= 2;
if (a[i] == t && vis[a[i]] > 1)
ans[cnt++] = i;
else if (a[i] != t && vis[t])
ans[cnt++] = i;
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++) printf(i == 0 ? "%d" : " %d", ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<int> pos_indicator[1000004];
int main() {
long long n, sum = 0;
cin >> n;
vector<long long> a(n), ans;
for (int i = 0; i < n; i++) {
cin >> a[i];
pos_indicator[a[i]].push_back(i + 1);
sum += a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (i + 1 != n && sum - a[i] - a[n - 1] == a[n - 1]) {
for (int j = 0; j < pos_indicator[a[i]].size(); j++)
ans.push_back(pos_indicator[a[i]][j]);
pos_indicator[a[i]].clear();
} else if (i == n - 1 && sum - a[i] - a[i - 1] == a[i - 1]) {
for (int j = 0; j < pos_indicator[a[i]].size(); j++)
ans.push_back(pos_indicator[a[i]][j]);
}
}
cout << ans.size() << '\n';
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << " \n"[i == ans.size() - 1];
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long numbersCount;
std::cin >> numbersCount;
long long numbers[numbersCount];
long long sumOfAllNumbers = 0;
std::map<long long, long long> occurenceCount;
for (long long i = 0; i < numbersCount; i++) {
std::cin >> numbers[i];
sumOfAllNumbers += numbers[i];
occurenceCount[numbers[i]]++;
}
std::vector<long long> niceIndicies;
long long foundCount = 0;
for (long long i = 0; i < numbersCount; i++) {
int n = numbers[i];
long long sumWithoutRemovedElement = sumOfAllNumbers - n;
if (sumWithoutRemovedElement % 2 != 0) continue;
occurenceCount[n]--;
if (occurenceCount[(sumWithoutRemovedElement) / 2] > 0) {
niceIndicies.push_back(i + 1);
foundCount++;
}
occurenceCount[n]++;
}
std::cout << foundCount << std::endl;
std::for_each(niceIndicies.begin(), niceIndicies.end(),
[](long long &n) { std::cout << n << " "; });
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const int maxm = 2000000 + 10;
int n, a[maxn], ans[maxn], num[maxm], pos[maxm];
int main() {
memset(num, 0, sizeof(num));
scanf("%d", &n);
long long sum = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
sum += a[i];
}
for (int i = 0; i < n; i++) {
num[2 * a[i]]++;
if (num[2 * a[i]] == 1) pos[2 * a[i]] = i;
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (sum - a[i] <= 2000000 && num[sum - a[i]]) {
if (num[sum - a[i]] == 1 && pos[sum - a[i]] == i) continue;
ans[cnt++] = i;
}
}
printf("%d\n", cnt);
for (int i = 0; i < cnt; i++)
printf("%d%c", ans[i] + 1, i == cnt - 1 ? '\n' : ' ');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
long long sum = 0;
vector<long long> vec(n);
unordered_map<long long, unordered_set<long long>> mp;
for (long long i = 0; i < n; i++) {
cin >> vec[i];
sum += vec[i];
mp[vec[i]].insert(i + 1);
}
sort(vec.begin(), vec.end());
long long temp = sum;
temp -= vec.back();
long long left = 0, right = temp, cnt = 0;
unordered_set<long long> remove;
for (long long i = 0; i < n; i++) {
if (right == 0) {
left -= vec[i - 1];
if (left == vec[i - 1]) {
remove.insert(vec[i]);
}
continue;
}
right -= vec[i];
if (left + right == vec.back()) {
remove.insert(vec[i]);
}
left += vec[i];
}
for (auto x : remove) cnt += mp[x].size();
cout << cnt << "\n";
for (auto x : remove)
for (auto y : mp[x]) cout << y << " ";
}
int main() {
long long t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void shikhar7s(long long int cas) {
long long int n, i, s = 0, ma = 0, in, maa = 0, inn;
cin >> n;
long long int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
if (a[i] > ma) {
ma = a[i];
in = i;
}
}
s -= ma;
vector<long long int> ans;
for (i = 0; i < n; i++) {
if (in != i) {
if (s - a[i] == ma) {
ans.push_back(i);
}
if (a[i] > maa) {
maa = a[i];
inn = i;
}
}
}
if (s == 2 * maa) ans.push_back(in);
cout << (long long int)ans.size() << "\n";
for (i = 0; i < (long long int)ans.size(); i++) cout << ans[i] + 1 << " ";
}
signed main() {
std::ios_base::sync_with_stdio(false);
long long int t = 1;
long long int cas = 1;
while (cas <= t) {
shikhar7s(cas);
cas++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)1e9 + 7;
const int N = 1e5 + 5, inf = 1e9 + 5;
long long add(long long x, long long y) {
x += y;
if (x >= MOD) return x - MOD;
return x;
}
long long sub(long long x, long long y) {
x -= y;
if (x < 0) return x + MOD;
return x;
}
long long mult(long long x, long long y) { return (x * y) % MOD; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<long long> a(n);
for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
i += 1 - 2 * ((0) > (n)))
cin >> a[i];
long long sum = accumulate(begin(a), end(a), 0LL);
long long maxx1 = 0, maxxi1 = 0;
long long maxx2 = 0;
for (int i = 0; i < n; ++i) {
if (a[i] > maxx1) {
maxx2 = maxx1;
maxx1 = a[i];
maxxi1 = i;
} else if (a[i] > maxx2) {
maxx2 = a[i];
}
}
vector<long long> ans;
for (int i = 0; i < n; ++i) {
if (i == maxxi1) {
if (sum - a[i] - maxx2 == maxx2) ans.push_back(i);
} else {
if (sum - a[i] - maxx1 == maxx1) ans.push_back(i);
}
}
cout << ans.size() << "\n";
for (long long x : ans) cout << x + 1 << " ";
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[200001];
int main() {
int n;
while (scanf("%d", &n) != EOF) {
long long sum = 0;
int maxx = 0;
int pos = -1;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] > maxx) maxx = a[i], pos = i;
sum += a[i];
}
int max2 = 0;
for (int i = 0; i < n; i++) {
if (a[i] > max2 && i != pos) max2 = a[i];
}
sum -= maxx;
vector<int> re;
for (int i = 0; i < n; i++) {
if ((pos != i) && (sum - a[i]) == maxx) {
re.push_back(i);
}
}
if (sum - max2 == max2) re.push_back(pos);
printf("%d\n", re.size());
if (re.size() == 0) cout << endl;
for (int i = 0; i < re.size(); i++)
printf("%d%c", re[i] + 1, i == (re.size() - 1) ? '\n' : ' ');
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
int n, a[N];
int freq[1000001];
bool can[1000001];
vector<int> sol;
int main(int argc, char **argv) {
scanf("%d", &n);
long long sum = 0;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
sum += a[i];
++freq[a[i]];
}
for (int i = 0; i < n; ++i) {
long long need = sum - 2 * a[i];
if (need >= 0 && need <= 1000000 &&
(freq[need] > 1 || (need != a[i] && freq[need] > 0)))
can[need] = true;
}
for (int i = 0; i < n; ++i)
if (can[a[i]]) sol.push_back(i + 1);
printf("%d\n", (int)sol.size());
for (size_t i = 0; i < sol.size(); ++i) printf("%s%d", i ? " " : "", sol[i]);
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, k = 0, total = 0;
cin >> n;
long long int r[n + 1], sum = 0;
map<long long int, long long int> mp;
vector<long long int> V;
vector<long long int>::iterator j;
for (i = 1; i <= n; i++) {
cin >> r[i];
sum = sum + r[i];
mp[r[i]] += 1;
}
for (i = 1; i <= n; i++) {
mp[r[i]]--;
if ((sum - r[i]) % 2 == 0 && mp[(sum - r[i]) / 2] != 0) {
V.push_back(i);
total++;
}
mp[r[i]]++;
}
cout << total << endl;
if (total != 0) {
for (j = V.begin(); j != V.end(); j++) {
cout << *j << " ";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
pair<long long, int> a[200005];
long long sum;
vector<int> res;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = (1), _b = (n); i <= _b; i++) {
int tmp;
cin >> tmp;
a[i] = make_pair(tmp, i);
sum += tmp;
}
sort(a + 1, a + n + 1, greater<pair<long long, int> >());
if (a[2].first == (sum - a[1].first - a[2].first)) {
res.push_back(a[1].second);
}
for (int i = (2), _b = (n); i <= _b; i++) {
if (a[1].first == (sum - a[i].first - a[1].first))
res.push_back(a[i].second);
}
cout << ((int)(res).size()) << endl;
for (auto i : res) cout << i << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
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++) {
scanf("%d", &a[i].val);
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 main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long n;
cin >> n;
vector<pair<long long, int> > a;
long long x;
long long sum = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
a.push_back(make_pair(x, i));
sum += x;
}
sort(a.begin(), a.end());
vector<int> ans;
for (int i = 0; i < n - 1; ++i) {
if (a[n - 1].first == (sum - a[i].first - a[n - 1].first)) {
ans.push_back(a[i].second);
}
}
if (a[n - 2].first == (sum - a[n - 1].first - a[n - 2].first)) {
ans.push_back(a[n - 1].second);
}
cout << ans.size() << "\n";
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i] + 1 << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long k = 1000000000;
int binary(int arr[], int l, int r, int x) {
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x) return mid;
if (arr[mid] > x) return binary(arr, l, mid - 1, x);
return binary(arr, mid + 1, r, x);
}
return 0;
}
int binarySearch(int arr[], int l, int r, int x, int kal) {
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x && mid != kal) return 1;
if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x, kal);
return binarySearch(arr, mid + 1, r, x, kal);
}
return 0;
}
int main() {
int n;
cin >> n;
int a[n], b[n];
long long sumcheck = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
sumcheck = sumcheck + a[i];
}
sort(b, b + n);
vector<int> ans;
for (int i = 0; i < n; i++) {
float p = (sumcheck - a[i]) / 2.0;
int m = binary(b, 0, n - 1, a[i]);
int k = binarySearch(b, 0, n - 1, p, m);
if (k == 1 && ceil(p) == floor(p)) {
ans.push_back(i + 1);
}
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[200005];
map<int, int> mp;
vector<int> ver;
long long sum;
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; ++i)
scanf("%d", &a[i]), sum += a[i], mp[a[i]]++;
long long t;
for (register int i = 1; i <= n; ++i) {
t = sum - a[i];
if (t & 1) continue;
t >>= 1;
if (t > 0 && t <= 1000000) {
if ((t != a[i] && mp[t] >= 1) || (t == a[i] && mp[t] >= 2)) {
ver.push_back(i);
}
}
}
printf("%d\n", ver.size());
for (int i : ver) printf("%d ", i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (long long i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t, n, i, j, m, k = 0;
string s;
cin >> n;
long long a[n + 1], sum = 0;
map<long long, long long> ma;
for (i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
ma[a[i]]++;
}
vector<long long> v;
long long temp;
map<long long, long long>::iterator it;
for (i = 1; i <= n; i++) {
t = sum - a[i];
temp = t % 2;
if (temp) {
continue;
} else {
ma[a[i]]--;
k = t / 2;
it = ma.find(k);
if (it != ma.end() && it->second > 0) v.push_back(i);
ma[a[i]]++;
}
}
cout << v.size() << endl;
for (i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
vector<T> get_n_maxs(T a[], int n, int N) {
vector<T> res(N);
for (int i = 0; i < N; i++) res[i] = a[i];
sort(begin(res), end(res));
for (int i = N; i < n; i++) {
int insert_pos = 0;
while (insert_pos < N && a[i] >= res[insert_pos]) insert_pos++;
for (int i = 1; i < insert_pos; i++) res[i - 1] = res[i];
if (insert_pos != 0) res[--insert_pos] = a[i];
}
return res;
}
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
auto v = get_n_maxs(a, n, 2);
long long s = accumulate(a, a + n, 0LL);
vector<int> indexes;
for (int i = 0; i < n; i++) {
bool is_good;
if (a[i] == v[1])
is_good = v[0] == s - v[0] - v[1];
else
is_good = v[1] == s - v[1] - a[i];
if (is_good) indexes.push_back(i + 1);
}
printf("%d\n", indexes.size());
for (auto i : indexes) printf("%d ", i);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long sum = 0;
int k = 0;
struct val {
int v, i;
};
val a[1000010];
int sol[1000001];
bool fun(const val& a, const val& b) { return a.v > b.v; }
int mx, mxx;
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i].v);
a[i].i = i;
sum += a[i].v;
}
sort(a, a + (sizeof(a) / sizeof(val)), fun);
if (sum - ((long long)a[0].v) - ((long long)a[1].v) == a[1].v) {
sol[k++] = a[0].i + 1;
}
for (int i = 1; i < n; i++) {
if (sum - ((long long)a[i].v) - ((long long)a[0].v) == a[0].v) {
sol[k++] = a[i].i + 1;
}
}
printf("%d\n", k);
if (!k) return 0;
for (int i = 0; i < k - 1; i++) {
printf("%d ", sol[i]);
}
printf("%d\n", sol[k - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int dell[8][2] = {{1, 2}, {1, -2}, {2, 1}, {2, -1},
{-1, 2}, {-1, -2}, {-2, 1}, {-2, -1}};
long long mod = 1e9 + 7;
const long long inf = (1LL << 31) - 1;
const int maxn = 1e6 + 7;
const int maxm = 1e6 + 7;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int csize = 22;
int n, k, m, ar[maxn];
int xl[maxn], num[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", ar + i);
long long s = 0;
for (int i = 1; i <= n; i++) s += ar[i];
memset(num, 0, sizeof(num));
for (int i = 1; i <= n; i++) {
num[ar[i]]++;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if ((s - ar[i]) % 2 == 0) {
if ((s - ar[i]) / 2 < maxn) {
int x = (s - ar[i]) / 2;
if (num[x] >= 2 || num[x] == 1 && x != ar[i]) xl[++ans] = i;
}
}
}
printf("%d\n", ans);
for (int i = 1; i <= ans; i++) printf("%d%c", xl[i], i == ans ? '\n' : ' ');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> v(n), v1(n);
long long int second = 0;
for (int i = 0; i < n; ++i) {
cin >> v[i];
v1[i] = v[i];
second += v[i];
}
sort(v1.begin(), v1.end());
vector<int> a;
for (int i = 0; i < n; ++i) {
long long int sum = second - v[i];
if (sum % 2) continue;
if (v[i] == v1[n - 1]) {
if (v1[n - 2] == sum / 2) a.push_back(i + 1);
} else {
if (v1[n - 1] == sum / 2) a.push_back(i + 1);
}
}
cout << a.size() << "\n";
for (int i = 0; i < a.size(); ++i) {
cout << a[i] << " ";
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class U, class T>
void Max(U &first, T second) {
if (first < second) first = second;
}
template <class U, class T>
void Min(U &first, T second) {
if (first > second) first = second;
}
template <class T>
void add(int &a, T b) {
a = (a + b) % 1000000007;
}
inline int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
inline long long gcd(long long a, long long b) {
return b == 0 ? a : gcd(b, a % b);
}
int pow(int a, int b) {
int ans = 1;
while (b) {
if (b & 1) ans = 1LL * ans * a % 1000000007;
a = 1LL * a * a % 1000000007;
b >>= 1;
}
return ans;
}
int pow(int a, int b, int c) {
int ans = 1;
while (b) {
if (b & 1) ans = 1LL * ans * a % c;
a = 1LL * a * a % c;
b >>= 1;
}
return ans;
}
string s[300010];
pair<int, int> f[16][300010];
char ch[] = "AGCT", g[2];
int solve(int n, int m, vector<string> &t, int rev = 0) {
for (int i = 0; i < 16; i++) {
if (__builtin_popcount(i) == 2) {
int first = -1, second;
for (int j = 0; j < 4; j++)
if (i >> j & 1) {
if (first == -1)
first = j;
else
second = j;
}
g[0] = ch[first], g[1] = ch[second];
for (int l = 0; l < n; l++) {
int a = 0, b = 0;
if (rev == 0)
for (int r = 0; r < m; r++)
a += (s[l][r] != g[r & 1]), b += (s[l][r] != g[!(r & 1)]);
else
for (int r = 0; r < m; r++)
a += (s[r][l] != g[r & 1]), b += (s[r][l] != g[!(r & 1)]);
if (a <= b)
f[i][l] = {0, a};
else
f[i][l] = {1, b};
}
}
}
int ans = -1, p;
for (int i = 0; i < 16; i++) {
if (__builtin_popcount(i) == 2) {
int j = 15 - i;
int res = 0;
for (int k = 0; k < n; k++)
res += k % 2 == 0 ? f[i][k].second : f[j][k].second;
if (ans == -1 || ans > res) ans = res, p = i;
}
}
for (int it = 0; it < 2; it++) {
int first = -1, second;
for (int i = 0; i < 4; i++)
if (p >> i & 1) {
if (first == -1)
first = i;
else
second = i;
}
for (int i = it; i < n; i++) {
if (f[p][i].first == 0) {
g[0] = ch[first], g[1] = ch[second];
} else {
g[0] = ch[second], g[1] = ch[first];
}
if (rev == 0)
for (int j = 0; j < m; j++) t[i][j] = g[j & 1];
else
for (int j = 0; j < m; j++) t[j][i] = g[j & 1];
i++;
}
p = 15 - p;
}
return ans;
}
int main() {
int ca = 0, T, k, i, j, m = 0, K, n;
double start = clock();
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) cin >> s[i];
vector<string> t1(n, string(m, ' ')), t2(n, string(m, ' '));
int ans1 = solve(n, m, t1);
int ans2 = solve(m, n, t2, 1);
if (ans2 < ans1) t1 = t2;
for (int i = 0; i < n; i++) puts(t1[i].c_str());
cerr << (1. * clock() - start) / CLOCKS_PER_SEC << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, ord1[300005][6], cnt1[300005], ord2[300005][6], cnt2[300005];
char str[6][2] = {{'A', 'C'}, {'A', 'G'}, {'A', 'T'},
{'C', 'G'}, {'C', 'T'}, {'G', 'T'}};
string s[300005], pri[300005];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
memset(cnt1, 0, sizeof(cnt1));
memset(cnt2, 0, sizeof(cnt2));
for (int i = 0; i < n; i++) {
for (int k = 0; k < 6; k++) {
int now1 = 0, now2 = 0;
for (int j = 0; j < m; j++) {
now1 += (s[i][j] != str[(i & 1) ? 5 - k : k][j & 1]);
now2 += (s[i][j] != str[(i & 1) ? 5 - k : k][(j & 1) ^ 1]);
}
cnt1[k] += min(now1, now2);
ord1[i][k] = now1 < now2 ? 0 : 1;
}
}
for (int j = 0; j < m; j++) {
for (int k = 0; k < 6; k++) {
int now1 = 0, now2 = 0;
for (int i = 0; i < n; i++) {
now1 += (s[i][j] != str[(j & 1) ? 5 - k : k][i & 1]);
now2 += (s[i][j] != str[(j & 1) ? 5 - k : k][(i & 1) ^ 1]);
}
cnt2[k] += min(now1, now2);
ord2[j][k] = now1 < now2 ? 0 : 1;
}
}
int minn = 1e9, ans, ansk;
for (int k = 0; k < 6; k++) {
if (cnt1[k] < minn) minn = cnt1[k], ans = 0, ansk = k;
}
for (int k = 0; k < 6; k++) {
if (cnt2[k] < minn) minn = cnt2[k], ans = 1, ansk = k;
}
if (ans == 0) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
pri[i] += str[(i & 1) ? 5 - ansk : ansk][(j & 1) ^ ord1[i][ansk]];
}
}
}
if (ans == 1) {
for (int j = 0; j < m; j++) {
for (int i = 0; i < n; i++) {
pri[i] += str[(j & 1) ? 5 - ansk : ansk][(i & 1) ^ ord2[j][ansk]];
}
}
}
for (int i = 0; i < n; i++) cout << pri[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
const int N = 3e5 + 10;
char S[] = "AGCT";
string s[N];
int pos[N], tpos[N];
int a[4], ta[4];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> s[i];
int ans = INT_MAX, flag = -1;
for (int i = 0; i < 4; i++)
for (int j = i + 1; j < 4; j++)
for (int k = 0; k < 4; k++)
if (k != i && k != j) {
int p = 6 - (i + j + k);
a[0] = i;
a[1] = j;
a[2] = k;
a[3] = p;
int tmp = 0;
for (int i = 0; i < n; i++) {
int t1 = 0, t2 = 0;
for (int j = 0; j < m; j++) {
int k = ((i & 1) << 1) + (j & 1);
if (s[i][j] != S[a[k]]) t1++;
k = ((i & 1) << 1) + (1 - (j & 1));
if (s[i][j] != S[a[k]]) t2++;
}
if (t1 < t2)
pos[i] = 0;
else
pos[i] = 1;
tmp += min(t1, t2);
}
if (tmp < ans) {
ans = tmp;
flag = 1;
memcpy(ta, a, sizeof(a));
memcpy(tpos, pos, sizeof(pos));
}
}
for (int i = 0; i < 4; i++)
for (int j = i + 1; j < 4; j++)
for (int k = 0; k < 4; k++)
if (k != i && k != j) {
int p = 6 - (i + j + k);
a[0] = i;
a[1] = j;
a[2] = k;
a[3] = p;
int tmp = 0;
for (int i = 0; i < m; i++) {
int t1 = 0, t2 = 0;
for (int j = 0; j < n; j++) {
int k = ((i & 1) << 1) + (j & 1);
if (s[j][i] != S[a[k]]) t1++;
k = ((i & 1) << 1) + (1 - (j & 1));
if (s[j][i] != S[a[k]]) t2++;
}
if (t1 < t2)
pos[i] = 0;
else
pos[i] = 1;
tmp += min(t1, t2);
}
if (tmp < ans) {
ans = tmp;
flag = 2;
memcpy(ta, a, sizeof(a));
memcpy(tpos, pos, sizeof(pos));
}
}
memcpy(a, ta, sizeof(a));
memcpy(pos, tpos, sizeof(pos));
if (flag == 1) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int k;
if (pos[i] == 0)
k = ((i & 1) << 1) + (j & 1);
else
k = ((i & 1) << 1) + (1 - (j & 1));
s[i][j] = S[a[k]];
}
}
} else {
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int k;
if (pos[i] == 0)
k = ((i & 1) << 1) + (j & 1);
else
k = ((i & 1) << 1) + (1 - (j & 1));
s[j][i] = S[a[k]];
}
}
}
for (int i = 0; i < n; i++) cout << s[i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int N = 100005;
int n, m;
vector<vector<char>> mat;
vector<vector<char>> ans;
ll qtd = 1e9;
void f(char i1, char j1, char i2, char j2) {
char x[2] = {i1, i2};
char y[2] = {j1, j2};
int aux = 0;
for (int i = 0; i < n; i++) {
int aux1 = 0, aux2 = 0;
for (int j = 0; j < m; j++) {
if (j & 1)
aux1 += x[i & 1] != mat[i][j];
else
aux1 += y[i & 1] != mat[i][j];
}
for (int j = 0; j < m; j++) {
if (!(j & 1))
aux2 += x[i & 1] != mat[i][j];
else
aux2 += y[i & 1] != mat[i][j];
}
aux += min(aux1, aux2);
}
if (aux < qtd) {
qtd = aux;
for (int i = 0; i < n; i++) {
int aux1 = 0, aux2 = 0;
for (int j = 0; j < m; j++) {
if (j & 1)
aux1 += x[i & 1] != mat[i][j];
else
aux1 += y[i & 1] != mat[i][j];
}
for (int j = 0; j < m; j++) {
if (!(j & 1))
aux2 += x[i & 1] != mat[i][j];
else
aux2 += y[i & 1] != mat[i][j];
}
if (aux1 < aux2) {
for (int j = 0; j < m; j++) {
if (j & 1)
ans[i][j] = x[i & 1];
else
ans[i][j] = y[i & 1];
}
} else {
for (int j = 0; j < m; j++) {
if (!(j & 1))
ans[i][j] = x[i & 1];
else
ans[i][j] = y[i & 1];
}
}
}
}
}
int f2(char i1, char j1, char i2, char j2) {
char x[2] = {i1, i2};
char y[2] = {j1, j2};
int aux = 0;
for (int j = 0; j < m; j++) {
int aux1 = 0, aux2 = 0;
for (int i = 0; i < n; i++) {
if (i & 1)
aux1 += x[j & 1] != mat[i][j];
else
aux1 += y[j & 1] != mat[i][j];
}
for (int i = 0; i < n; i++) {
if (!(i & 1))
aux2 += x[j & 1] != mat[i][j];
else
aux2 += y[j & 1] != mat[i][j];
}
aux += min(aux1, aux2);
}
if (aux < qtd) {
qtd = aux;
for (int j = 0; j < m; j++) {
int aux1 = 0, aux2 = 0;
for (int i = 0; i < n; i++) {
if (i & 1)
aux1 += x[j & 1] != mat[i][j];
else
aux1 += y[j & 1] != mat[i][j];
}
for (int i = 0; i < n; i++) {
if (!(i & 1))
aux2 += x[j & 1] != mat[i][j];
else
aux2 += y[j & 1] != mat[i][j];
}
if (aux1 < aux2) {
for (int i = 0; i < n; i++) {
if (i & 1)
ans[i][j] = x[j & 1];
else
ans[i][j] = y[j & 1];
}
} else {
for (int i = 0; i < n; i++) {
if (!(i & 1))
ans[i][j] = x[j & 1];
else
ans[i][j] = y[j & 1];
}
}
}
return 1;
}
return 0;
}
int main() {
scanf("%d %d", &n, &m);
mat = vector<vector<char>>(n, vector<char>(m + 5));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf(" %c", &mat[i][j]);
}
}
vector<char> v = {'A', 'C', 'G', 'T'};
ans = vector<vector<char>>(n, vector<char>(m + 5));
int tp = 0;
do {
ll aux = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
aux += v[(j + (i & 1) * 2) % 4] != mat[i][j];
}
}
if (aux < qtd) {
qtd = aux;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ans[i][j] = v[(j + (i & 1) * 2) % 4];
}
}
}
} while (next_permutation(v.begin(), v.end()));
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 4; j++) {
for (int i2 = 0; i2 < 4; i2++) {
for (int j2 = i2 + 1; j2 < 4; j2++) {
if (i != i2 && i != j2 && j != j2 && j != i2) {
f(v[i], v[j], v[i2], v[j2]);
}
}
}
}
}
for (int i = 0; i < 4; i++) {
for (int j = i + 1; j < 4; j++) {
for (int i2 = 0; i2 < 4; i2++) {
for (int j2 = i2 + 1; j2 < 4; j2++) {
if (i != i2 && i != j2 && j != j2 && j != i2) {
tp |= f2(v[i], v[j], v[i2], v[j2]);
}
}
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
printf("%c", ans[i][j]);
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 300010;
int col[N][4][2];
int fil[N][4][2];
char C[4] = {'A', 'G', 'C', 'T'};
int solucio_colum(int a, int b, int c, int d, int n) {
int res = 0;
for (int i = 0; i < n; i += 2) {
res += max(col[i][a][0] + col[i][b][1], col[i][a][1] + col[i][b][0]);
}
for (int i = 1; i < n; i += 2) {
res += max(col[i][c][0] + col[i][d][1], col[i][c][1] + col[i][d][0]);
}
return res;
}
int solucio_fila(int a, int b, int c, int d, int n) {
int res = 0;
for (int i = 0; i < n; i += 2) {
res += max(fil[i][a][0] + fil[i][b][1], fil[i][a][1] + fil[i][b][0]);
}
for (int i = 1; i < n; i += 2) {
res += max(fil[i][c][0] + fil[i][d][1], fil[i][c][1] + fil[i][d][0]);
}
return res;
}
void print_column(int a, int b, int c, int d, int n, int m) {
char M[n][m];
for (int i = 0; i < n; i += 2) {
int a1 = col[i][a][0] + col[i][b][1];
int a2 = col[i][a][1] + col[i][b][0];
for (int j = 0; j < m; ++j) {
if ((j % 2 and a1 > a2) or (j % 2 == 0 and a1 <= a2))
M[i][j] = C[b];
else
M[i][j] = C[a];
}
}
for (int i = 1; i < n; i += 2) {
int a1 = col[i][c][0] + col[i][d][1];
int a2 = col[i][c][1] + col[i][d][0];
for (int j = 0; j < m; ++j) {
if ((j % 2 and a1 > a2) or (j % 2 == 0 and a1 <= a2))
M[i][j] = C[d];
else
M[i][j] = C[c];
}
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) cout << M[j][i];
cout << '\n';
}
}
void print_fila(int a, int b, int c, int d, int n, int m) {
char M[n][m];
for (int i = 0; i < n; i += 2) {
int a1 = fil[i][a][0] + fil[i][b][1];
int a2 = fil[i][a][1] + fil[i][b][0];
for (int j = 0; j < m; ++j) {
if ((j % 2 and a1 > a2) or (j % 2 == 0 and a1 <= a2))
M[i][j] = C[b];
else
M[i][j] = C[a];
}
}
for (int i = 1; i < n; i += 2) {
int a1 = fil[i][c][0] + fil[i][d][1];
int a2 = fil[i][c][1] + fil[i][d][0];
for (int j = 0; j < m; ++j) {
if ((j % 2 and a1 > a2) or (j % 2 == 0 and a1 <= a2))
M[i][j] = C[d];
else
M[i][j] = C[c];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) cout << M[i][j];
cout << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
map<char, int> M;
M['A'] = 0;
M['G'] = 1;
M['C'] = 2;
M['T'] = 3;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
char a;
cin >> a;
int k = M[a];
col[j][k][i % 2]++;
fil[i][k][j % 2]++;
}
}
vector<int> resc;
vector<int> resf;
int valc = -1;
int valf = -1;
vector<int> S({0, 1, 2, 3});
for (int i = 0; i < 24; ++i) {
int k = solucio_colum(S[0], S[1], S[2], S[3], m);
int t = solucio_fila(S[0], S[1], S[2], S[3], n);
if (k > valc) {
valc = k;
resc = S;
}
if (t > valf) {
valf = t;
resf = S;
}
next_permutation(S.begin(), S.end());
}
if (valc > valf) {
print_column(resc[0], resc[1], resc[2], resc[3], m, n);
} else {
print_fila(resf[0], resf[1], resf[2], resf[3], n, m);
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long poww(long long a, long long b, long long md) {
return (!b ? 1
: (b & 1 ? a * poww(a * a % md, b / 2, md) % md
: poww(a * a % md, b / 2, md) % md));
}
const long long MAXN = 1e6 + 10;
const long long INF = 8e18;
const long long MOD = 1e9 + 7;
vector<vector<char>> G;
long long n, m;
pair<long long, vector<char>> min_row(long long i, char c1, char c2) {
pair<long long, vector<char>> ans1, ans2;
ans1.first = ans2.first = 0;
for (int j = 0; j < m; j++) {
if (j & 1)
ans1.second.push_back(c2);
else
ans1.second.push_back(c1);
if (G[i][j] == ans1.second.back()) ans1.first++;
}
for (int j = 0; j < m; j++) {
if (j & 1)
ans2.second.push_back(c1);
else
ans2.second.push_back(c2);
if (G[i][j] == ans2.second.back()) ans2.first++;
}
return max(ans1, ans2);
}
pair<long long, vector<char>> min_col(long long j, char c1, char c2) {
pair<long long, vector<char>> ans1, ans2;
ans1.first = ans2.first = 0;
for (int i = 0; i < n; i++) {
if (i & 1)
ans1.second.push_back(c2);
else
ans1.second.push_back(c1);
if (G[i][j] == ans1.second.back()) ans1.first++;
}
for (int i = 0; i < n; i++) {
if (i & 1)
ans2.second.push_back(c1);
else
ans2.second.push_back(c2);
if (G[i][j] == ans2.second.back()) ans2.first++;
}
return max(ans1, ans2);
}
pair<long long, vector<vector<char>>> row(char c1, char c2) {
pair<long long, vector<vector<char>>> ans;
ans.first = 0;
char c3 = 'N', c4 = 'N';
if (c1 != 'A' && c2 != 'A' && c3 != 'A') c4 = 'A';
if (c1 != 'T' && c2 != 'T' && c3 != 'T') c4 = 'T';
if (c1 != 'C' && c2 != 'C' && c3 != 'C') c4 = 'C';
if (c1 != 'G' && c2 != 'G' && c3 != 'G') c4 = 'G';
if (c1 != 'A' && c2 != 'A' && c4 != 'A') c3 = 'A';
if (c1 != 'T' && c2 != 'T' && c4 != 'T') c3 = 'T';
if (c1 != 'C' && c2 != 'C' && c4 != 'C') c3 = 'C';
if (c1 != 'G' && c2 != 'G' && c4 != 'G') c3 = 'G';
for (int i = 0; i < n; i++) {
if (i & 1) {
auto P = min_row(i, c1, c2);
ans.first += P.first;
ans.second.push_back(P.second);
} else {
auto P = min_row(i, c3, c4);
ans.first += P.first;
ans.second.push_back(P.second);
}
}
return ans;
}
void ins_col(vector<vector<char>>& v, vector<char> c, long long j) {
for (int i = 0; i < n; i++) v[i][j] = c[i];
}
pair<long long, vector<vector<char>>> col(char c1, char c2) {
pair<long long, vector<vector<char>>> ans;
ans.first = 0;
char c3 = 'N', c4 = 'N';
if (c1 != 'A' && c2 != 'A' && c3 != 'A') c4 = 'A';
if (c1 != 'T' && c2 != 'T' && c3 != 'T') c4 = 'T';
if (c1 != 'C' && c2 != 'C' && c3 != 'C') c4 = 'C';
if (c1 != 'G' && c2 != 'G' && c3 != 'G') c4 = 'G';
if (c1 != 'A' && c2 != 'A' && c4 != 'A') c3 = 'A';
if (c1 != 'T' && c2 != 'T' && c4 != 'T') c3 = 'T';
if (c1 != 'C' && c2 != 'C' && c4 != 'C') c3 = 'C';
if (c1 != 'G' && c2 != 'G' && c4 != 'G') c3 = 'G';
ans.second.resize(n);
for (int i = 0; i < n; i++) ans.second[i].resize(m);
for (int j = 0; j < m; j++) {
if (j & 1) {
auto P = min_col(j, c1, c2);
ans.first += P.first;
ins_col(ans.second, P.second, j);
} else {
auto P = min_col(j, c3, c4);
ans.first += P.first;
ins_col(ans.second, P.second, j);
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
G.resize(n);
for (int i = 0; i < n; i++) {
G[i].resize(m);
for (int j = 0; j < m; j++) cin >> G[i][j];
}
pair<long long, vector<vector<char>>> ans;
ans = row('A', 'G');
ans = max(ans, row('A', 'C'));
ans = max(ans, row('A', 'T'));
ans = max(ans, row('G', 'C'));
ans = max(ans, row('G', 'T'));
ans = max(ans, row('C', 'T'));
ans = max(ans, col('A', 'G'));
ans = max(ans, col('A', 'C'));
ans = max(ans, col('A', 'T'));
ans = max(ans, col('G', 'C'));
ans = max(ans, col('G', 'T'));
ans = max(ans, col('C', 'T'));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cout << ans.second[i][j];
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 3e5 + 5;
vector<int> a[Nmax];
vector<int> b[Nmax];
vector<int> ans[Nmax];
int cntr[Nmax][2][4];
int cntc[Nmax][2][4];
int n, m, sum;
void solve() {
int sum = 1e9;
for (int x = 0; x <= 3; x++)
for (int y = x + 1; y <= 3; y++) {
int z = -1;
int t = -1;
for (int i = 0; i <= 3; i++) {
if (i != x && i != y) {
if (z < 0)
z = i;
else
t = i;
}
}
int res = 0;
for (int i = 1; i <= n; i++) {
if (i & 1) {
int xy = m - (cntr[i][1][x] + cntr[i][0][y]);
int yx = m - (cntr[i][1][y] + cntr[i][0][x]);
if (xy < yx) {
res += xy;
b[i][1] = x;
b[i][2] = y;
} else {
res += yx;
b[i][1] = y;
b[i][2] = x;
}
} else {
int zt = m - (cntr[i][1][z] + cntr[i][0][t]);
int tz = m - (cntr[i][1][t] + cntr[i][0][z]);
if (zt < tz) {
res += zt;
b[i][1] = z;
b[i][2] = t;
} else {
res += tz;
b[i][1] = t;
b[i][2] = z;
}
}
}
if (res < sum) {
sum = res;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j += 2) {
ans[i][j] = b[i][1];
}
for (int j = 2; j <= m; j += 2) {
ans[i][j] = b[i][2];
}
}
}
}
for (int x = 0; x <= 3; x++)
for (int y = x + 1; y <= 3; y++) {
int z = -1;
int t = -1;
for (int i = 0; i <= 3; i++) {
if (i != x && i != y) {
if (z < 0)
z = i;
else
t = i;
}
}
int res = 0;
for (int i = 1; i <= m; i++) {
if (i & 1) {
int xy = n - (cntc[i][1][x] + cntc[i][0][y]);
int yx = n - (cntc[i][1][y] + cntc[i][0][x]);
if (xy < yx) {
res += xy;
b[1][i] = x;
b[2][i] = y;
} else {
res += yx;
b[1][i] = y;
b[2][i] = x;
}
} else {
int zt = n - (cntc[i][1][z] + cntc[i][0][t]);
int tz = n - (cntc[i][1][t] + cntc[i][0][z]);
if (zt < tz) {
res += zt;
b[1][i] = z;
b[2][i] = t;
} else {
res += tz;
b[1][i] = t;
b[2][i] = z;
}
}
}
if (res < sum) {
sum = res;
for (int j = 1; j <= m; j++) {
for (int i = 1; i <= n; i += 2) {
ans[i][j] = b[1][j];
}
for (int i = 2; i <= n; i += 2) {
ans[i][j] = b[2][j];
}
}
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (ans[i][j] == 0)
cout << 'A';
else if (ans[i][j] == 1)
cout << 'C';
else if (ans[i][j] == 2)
cout << 'G';
else
cout << 'T';
if (j == m) cout << "\n";
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
a[i].push_back(0);
b[i].resize(m + 1);
ans[i].resize(m + 1);
for (int j = 1; j <= m; j++) {
char c;
cin >> c;
if (c == 'A')
a[i].push_back(0);
else if (c == 'C')
a[i].push_back(1);
else if (c == 'G')
a[i].push_back(2);
else
a[i].push_back(3);
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
cntr[i][j & 1][a[i][j]]++;
cntc[j][i & 1][a[i][j]]++;
}
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> v;
vector<vector<string> > cases = {{"AT", "CG"}, {"AC", "TG"}, {"AG", "CT"}};
vector<string> tmp;
vector<string> best;
int min_score = 1000000000;
void print(vector<string> &m) {
for (int i = 0; i < m.size(); i++) {
cout << m[i] << endl;
}
}
vector<string> transpose(vector<string> &m) {
vector<string> res;
res.resize(m[0].size());
for (int i = 0; i < m.size(); i++) {
for (int j = 0; j < m[0].size(); j++) {
res[j] += m[i][j];
}
}
return res;
}
int cmp(string x, string y) {
int res = 0;
for (int i = 0; i < x.size(); i++) {
if (x[i] != y[i]) res++;
}
return res;
}
vector<string> build_matrix(vector<string> tab) {
vector<string> res;
for (int i = 0; i < v.size(); i++) {
string str1 = "";
string str2 = "";
for (int j = 0; j < v[0].size(); j++) str1 += tab[i % 2][j % 2];
for (int j = 0; j < v[0].size(); j++) str2 += tab[i % 2][(j + 1) % 2];
int score1 = cmp(str1, v[i]), score2 = cmp(str2, v[i]);
res.push_back(score1 < score2 ? str1 : str2);
}
return res;
}
int cmp(vector<string> &x, vector<string> &y) {
int res = 0;
for (int i = 0; i < x.size(); i++) res += cmp(x[i], y[i]);
return res;
}
void check(vector<string> tab, bool trans = false) {
int score;
tmp = build_matrix(tab);
score = cmp(v, tmp);
if (trans) tmp = transpose(tmp);
if (score < min_score) {
best = tmp;
min_score = score;
}
}
int main() {
int a, b;
cin >> a >> b;
string s;
for (int i = 0; i < a; i++) {
cin >> s;
v.push_back(s);
}
for (auto tab : cases) {
check(tab);
swap(tab[0], tab[1]);
check(tab);
v = transpose(v);
check(tab, true);
swap(tab[0], tab[1]);
check(tab, true);
v = transpose(v);
}
print(best);
}
|
#include <bits/stdc++.h>
long long int const MOD = 1000000007;
long long int const N = 1000005;
long long int const LN = 20;
long long int const inf = 8e18;
using namespace std;
long long int n, m, a[N];
string str[N];
char ch[6];
string ok[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long int n, m;
cin >> n >> m;
for (long long int i = 1; i <= n; i++)
cin >> str[i], str[i] = " " + str[i], ok[i] = str[i];
ch[1] = 'A';
ch[2] = 'G';
ch[3] = 'C';
ch[4] = 'T';
long long int ans = inf;
for (long long int i1 = 1; i1 <= 4; i1++) {
for (long long int i2 = i1 + 1; i2 <= 4; i2++) {
long long int temp = 0;
long long int i3, i4;
for (long long int j = 1; j <= 4; j++)
if (j != i1 && j != i2) i3 = j;
for (long long int j = 1; j <= 4; j++)
if (j != i1 && j != i2 && j != i3) i4 = j;
for (long long int i = 1; i <= n; i++) {
long long int curr[5] = {0};
long long int cnt[5] = {0};
curr[1] = i1;
curr[2] = i2;
curr[3] = i3;
curr[4] = i4;
for (long long int j = 1; j <= m; j++) {
if (i % 2 == 0) {
if (str[i][j] != ch[curr[1]]) cnt[1]++;
if (str[i][j] != ch[curr[2]]) cnt[2]++;
swap(curr[1], curr[2]);
} else {
if (str[i][j] != ch[curr[3]]) cnt[3]++;
if (str[i][j] != ch[curr[4]]) cnt[4]++;
swap(curr[4], curr[3]);
}
}
temp += min(cnt[1], cnt[2]) + min(cnt[3], cnt[4]);
}
ans = min(ans, temp);
}
}
for (long long int i1 = 1; i1 <= 4; i1++) {
for (long long int i2 = i1 + 1; i2 <= 4; i2++) {
long long int temp = 0;
long long int i3, i4;
for (long long int j = 1; j <= 4; j++)
if (j != i1 && j != i2) i3 = j;
for (long long int j = 1; j <= 4; j++)
if (j != i1 && j != i2 && j != i3) i4 = j;
for (long long int i = 1; i <= m; i++) {
long long int curr[5] = {0};
long long int cnt[5] = {0};
curr[1] = i1;
curr[2] = i2;
curr[3] = i3;
curr[4] = i4;
for (long long int j = 1; j <= n; j++) {
if (i % 2 == 0) {
if (str[j][i] != ch[curr[1]]) cnt[1]++;
if (str[j][i] != ch[curr[2]]) cnt[2]++;
swap(curr[1], curr[2]);
} else {
if (str[j][i] != ch[curr[3]]) cnt[3]++;
if (str[j][i] != ch[curr[4]]) cnt[4]++;
swap(curr[4], curr[3]);
}
}
temp += min(cnt[1], cnt[2]) + min(cnt[3], cnt[4]);
}
ans = min(ans, temp);
}
}
for (long long int i1 = 1; i1 <= 4; i1++) {
for (long long int i2 = i1 + 1; i2 <= 4; i2++) {
long long int temp = 0;
long long int i3, i4;
for (long long int j = 1; j <= 4; j++)
if (j != i1 && j != i2) i3 = j;
for (long long int j = 1; j <= 4; j++)
if (j != i1 && j != i2 && j != i3) i4 = j;
for (long long int i = 1; i <= n; i++) {
long long int curr[5] = {0};
long long int cnt[5] = {0};
curr[1] = i1;
curr[2] = i2;
curr[3] = i3;
curr[4] = i4;
for (long long int j = 1; j <= m; j++) {
if (i % 2 == 0) {
if (str[i][j] != ch[curr[1]]) cnt[1]++;
if (str[i][j] != ch[curr[2]]) cnt[2]++;
swap(curr[1], curr[2]);
} else {
if (str[i][j] != ch[curr[3]]) cnt[3]++;
if (str[i][j] != ch[curr[4]]) cnt[4]++;
swap(curr[4], curr[3]);
}
}
if (i % 2) {
if (cnt[3] > cnt[4]) {
for (long long int j = 1; j <= m; j++) {
if (j % 2)
ok[i][j] = ch[i4];
else
ok[i][j] = ch[i3];
}
} else {
for (long long int j = 1; j <= m; j++) {
if (j % 2)
ok[i][j] = ch[i3];
else
ok[i][j] = ch[i4];
}
}
} else {
if (cnt[1] > cnt[2]) {
for (long long int j = 1; j <= m; j++) {
if (j % 2)
ok[i][j] = ch[i2];
else
ok[i][j] = ch[i1];
}
} else {
for (long long int j = 1; j <= m; j++) {
if (j % 2)
ok[i][j] = ch[i1];
else
ok[i][j] = ch[i2];
}
}
}
temp += min(cnt[1], cnt[2]) + min(cnt[3], cnt[4]);
}
if (temp == ans) {
for (long long int i = 1; i <= n; i++) {
for (long long int j = 1; j <= m; j++) cout << ok[i][j];
cout << '\n';
}
return 0;
}
}
}
for (long long int i1 = 1; i1 <= 4; i1++) {
for (long long int i2 = i1 + 1; i2 <= 4; i2++) {
long long int temp = 0;
long long int i3, i4;
for (long long int j = 1; j <= 4; j++)
if (j != i1 && j != i2) i3 = j;
for (long long int j = 1; j <= 4; j++)
if (j != i1 && j != i2 && j != i3) i4 = j;
for (long long int i = 1; i <= m; i++) {
long long int curr[5] = {0};
long long int cnt[5] = {0};
curr[1] = i1;
curr[2] = i2;
curr[3] = i3;
curr[4] = i4;
for (long long int j = 1; j <= n; j++) {
if (i % 2 == 0) {
if (str[j][i] != ch[curr[1]]) cnt[1]++;
if (str[j][i] != ch[curr[2]]) cnt[2]++;
swap(curr[1], curr[2]);
} else {
if (str[j][i] != ch[curr[3]]) cnt[3]++;
if (str[j][i] != ch[curr[4]]) cnt[4]++;
swap(curr[4], curr[3]);
}
}
if (i % 2) {
if (cnt[3] > cnt[4]) {
for (long long int j = 1; j <= n; j++) {
if (j % 2)
ok[j][i] = ch[i4];
else
ok[j][i] = ch[i3];
}
} else {
for (long long int j = 1; j <= n; j++) {
if (j % 2)
ok[j][i] = ch[i3];
else
ok[j][i] = ch[i4];
}
}
} else {
if (cnt[1] > cnt[2]) {
for (long long int j = 1; j <= n; j++) {
if (j % 2)
ok[j][i] = ch[i2];
else
ok[j][i] = ch[i1];
}
} else {
for (long long int j = 1; j <= n; j++) {
if (j % 2)
ok[j][i] = ch[i1];
else
ok[j][i] = ch[i2];
}
}
}
temp += min(cnt[1], cnt[2]) + min(cnt[3], cnt[4]);
}
if (temp == ans) {
for (long long int i = 1; i <= n; i++) {
for (long long int j = 1; j <= m; j++) cout << ok[i][j];
cout << '\n';
}
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<string, long long> mp;
long long cnt;
map<string, string> mp2;
string str = "ACGT";
long long side[12][300011];
long long up[12][300011];
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t, i, j, m, x, y, n, z, p, k, T;
string s1, s2, s3;
x = 1;
cin >> n >> m;
char a[n][m];
for (i = 0; i < n; ++i)
for (j = 0; j < m; ++j) cin >> a[i][j];
for (long long ci = 0; ci < 4; ++ci) {
for (long long cj = 0; cj < 4; ++cj) {
if (ci == cj) continue;
p = 0;
long long idx = cnt;
string s;
s += str[ci];
s += str[cj];
mp[s] = cnt++;
string s2;
for (long long io = 0; io < 4; ++io)
if (io != ci && io != cj) s2 += str[io];
mp2[s] = s2;
for (i = 0; i < n; ++i) {
p = 0;
for (j = 0; j < m; ++j) {
if (j % 2) {
if (a[i][j] != str[cj]) ++p;
}
if (j % 2 == 0) {
if (a[i][j] != str[ci]) ++p;
}
}
side[idx][i] = p;
}
}
}
cnt = 0;
for (long long ci = 0; ci < 4; ++ci) {
for (long long cj = 0; cj < 4; ++cj) {
if (ci == cj) continue;
p = 0;
long long idx = cnt;
string s;
s += str[ci];
s += str[cj];
mp[s] = cnt++;
for (i = 0; i < m; ++i) {
p = 0;
for (j = 0; j < n; ++j) {
if (j % 2)
if (a[j][i] != str[cj]) ++p;
if (j % 2 == 0)
if (a[j][i] != str[ci]) ++p;
}
up[idx][i] = p;
}
}
}
p = 1e17;
for (auto x : mp) {
string other = mp2[x.first];
vector<string> v;
v.push_back(other);
reverse(other.begin(), other.end());
v.push_back(other);
long long cost = 0;
for (auto o : v) {
long long id = 0;
cost = 0;
for (id = 0; id < n; ++id) {
if (id == 0)
cost += side[x.second][0];
else if (id == 1)
cost += side[mp[o]][1];
else {
if (id % 2 == 0) {
string oth = string(x.first);
reverse(oth.begin(), oth.end());
cost += (min(side[mp[x.first]][id], side[mp[oth]][id]));
} else {
string oth = string(o);
reverse(oth.begin(), oth.end());
cost += (min(side[mp[o]][id], side[mp[oth]][id]));
}
}
}
p = min(p, cost);
}
}
for (auto x : mp) {
string other = mp2[x.first];
vector<string> v;
v.push_back(other);
reverse(other.begin(), other.end());
v.push_back(other);
long long cost = 0;
for (auto o : v) {
long long id = 0;
cost = 0;
for (id = 0; id < m; ++id) {
if (id == 0)
cost += up[x.second][0];
else if (id == 1)
cost += up[mp[o]][1];
else {
if (id % 2 == 0) {
string oth = string(x.first);
reverse(oth.begin(), oth.end());
cost += (min(up[mp[x.first]][id], up[mp[oth]][id]));
} else {
string oth = string(o);
reverse(oth.begin(), oth.end());
cost += (min(up[mp[o]][id], up[mp[oth]][id]));
}
}
}
p = min(p, cost);
}
}
for (auto x : mp) {
string other = mp2[x.first];
vector<string> v;
v.push_back(other);
reverse(other.begin(), other.end());
v.push_back(other);
long long cost = 0;
for (auto o : v) {
long long id = 0;
cost = 0;
for (id = 0; id < n; ++id) {
if (id == 0)
cost += side[x.second][0];
else if (id == 1)
cost += side[mp[o]][1];
else {
if (id % 2 == 0) {
string oth = string(x.first);
reverse(oth.begin(), oth.end());
cost += (min(side[mp[x.first]][id], side[mp[oth]][id]));
} else {
string oth = string(o);
reverse(oth.begin(), oth.end());
cost += (min(side[mp[o]][id], side[mp[oth]][id]));
}
}
}
if (p == cost) {
for (i = 0; i < n; ++i) {
if (i == 0) {
for (j = 0; j < m; ++j) a[0][j] = x.first[j % 2];
} else if (i == 1) {
for (j = 0; j < m; ++j) a[1][j] = o[j % 2];
} else {
if (i % 2 == 0) {
string oth = string(x.first);
reverse(oth.begin(), oth.end());
if (side[mp[x.first]][i] < side[mp[oth]][i])
for (j = 0; j < m; ++j) a[i][j] = x.first[j % 2];
else
for (j = 0; j < m; ++j) a[i][j] = oth[j % 2];
} else {
string oth = string(o);
reverse(oth.begin(), oth.end());
if (side[mp[o]][i] < side[mp[oth]][i])
for (j = 0; j < m; ++j) a[i][j] = o[j % 2];
else
for (j = 0; j < m; ++j) a[i][j] = oth[j % 2];
}
}
}
for (i = 0; i < n; ++i) {
for (j = 0; j < m; ++j) cout << a[i][j];
cout << "\n";
}
return 0;
}
}
}
for (auto x : mp) {
string other = mp2[x.first];
vector<string> v;
v.push_back(other);
reverse(other.begin(), other.end());
v.push_back(other);
long long cost = 0;
for (auto o : v) {
long long id = 0;
cost = 0;
for (id = 0; id < m; ++id) {
if (id == 0)
cost += up[x.second][0];
else if (id == 1)
cost += up[mp[o]][1];
else {
if (id % 2 == 0) {
string oth = string(x.first);
reverse(oth.begin(), oth.end());
cost += (min(up[mp[x.first]][id], up[mp[oth]][id]));
} else {
string oth = string(o);
reverse(oth.begin(), oth.end());
cost += (min(up[mp[o]][id], up[mp[oth]][id]));
}
}
}
if (p == cost) {
for (i = 0; i < m; ++i) {
if (i == 0) {
for (j = 0; j < n; ++j) a[j][i] = x.first[j % 2];
} else if (i == 1) {
for (j = 0; j < n; ++j) a[j][i] = o[j % 2];
} else {
if (i % 2 == 0) {
string oth = string(x.first);
reverse(oth.begin(), oth.end());
if (up[mp[x.first]][i] < up[mp[oth]][i])
for (j = 0; j < n; ++j) a[j][i] = x.first[j % 2];
else
for (j = 0; j < n; ++j) a[j][i] = oth[j % 2];
} else {
string oth = string(o);
reverse(oth.begin(), oth.end());
if (up[mp[o]][i] < up[mp[oth]][i])
for (j = 0; j < n; ++j) a[j][i] = o[j % 2];
else
for (j = 0; j < n; ++j) a[j][i] = oth[j % 2];
}
}
}
for (i = 0; i < n; ++i) {
for (j = 0; j < m; ++j) cout << a[i][j];
cout << "\n";
}
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI =
3.141592653589793238462643383279502884197169399375105820974944;
int power(int a, int b, int m = 1000000007) {
if (b == 0) return 1;
if (b == 1) return a;
int x = power(a, b / 2, m) % m;
x = (x * x) % m;
if (b % 2) return (x * a) % m;
return x;
}
signed main() {
int n, m;
int perm[4] = {0, 1, 2, 3};
cin >> n >> m;
int a[n + 5][m + 5], b[n + 5][m + 5], c[n + 5][m + 5];
int ans = n * m + 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
char c;
cin >> c;
if (c == 'A')
a[i][j] = 0;
else if (c == 'G')
a[i][j] = 1;
else if (c == 'C')
a[i][j] = 2;
else
a[i][j] = 3;
}
}
int cnt;
for (int subtopewdszzzz = 0; subtopewdszzzz < 24; subtopewdszzzz++) {
cnt = 0;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) {
int lol1 = 0, lol2 = 0;
for (int j = 0; j < m; j++) {
if (a[i][j] != perm[j % 2]) lol1++;
if (a[i][j] != perm[(j + 1) % 2]) lol2++;
}
if (lol1 < lol2) {
cnt += lol1;
for (int j = 0; j < m; j++) {
b[i][j] = perm[j % 2];
}
} else {
cnt += lol2;
for (int j = 0; j < m; j++) {
b[i][j] = perm[(j + 1) % 2];
}
}
} else {
int lol1 = 0, lol2 = 0;
for (int j = 0; j < m; j++) {
if (a[i][j] != perm[2 + (j % 2)]) lol1++;
if (a[i][j] != perm[2 + ((j + 1) % 2)]) lol2++;
}
if (lol1 < lol2) {
cnt += lol1;
for (int j = 0; j < m; j++) {
b[i][j] = perm[2 + (j % 2)];
}
} else {
cnt += lol2;
for (int j = 0; j < m; j++) {
b[i][j] = perm[2 + ((j + 1) % 2)];
}
}
}
}
if (cnt < ans) {
ans = cnt;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
c[i][j] = b[i][j];
}
}
}
cnt = 0;
for (int j = 0; j < m; j++) {
if (j % 2 == 0) {
int lol1 = 0, lol2 = 0;
for (int i = 0; i < n; i++) {
if (a[i][j] != perm[i % 2]) lol1++;
if (a[i][j] != perm[(i + 1) % 2]) lol2++;
}
if (lol1 < lol2) {
cnt += lol1;
for (int i = 0; i < n; i++) {
b[i][j] = perm[i % 2];
}
} else {
cnt += lol2;
for (int i = 0; i < n; i++) {
b[i][j] = perm[(i + 1) % 2];
}
}
} else {
int lol1 = 0, lol2 = 0;
for (int i = 0; i < n; i++) {
if (a[i][j] != perm[2 + (i % 2)]) lol1++;
if (a[i][j] != perm[2 + ((i + 1) % 2)]) lol2++;
}
if (lol1 < lol2) {
cnt += lol1;
for (int i = 0; i < n; i++) {
b[i][j] = perm[2 + (i % 2)];
}
} else {
cnt += lol2;
for (int i = 0; i < n; i++) {
b[i][j] = perm[2 + ((i + 1) % 2)];
}
}
}
}
if (cnt < ans) {
ans = cnt;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
c[i][j] = b[i][j];
}
}
}
next_permutation(perm, perm + 4);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (c[i][j] == 0)
cout << "A";
else if (c[i][j] == 1)
cout << "G";
else if (c[i][j] == 2)
cout << "C";
else
cout << "T";
}
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
string s[N], t[N], a[N], b[N], r[N];
int n, m;
inline void flip(string x[N], int u, int v) {
for (int i = 0; i < v; i++) r[i].clear();
for (int i = 0; i < u; i++)
for (int j = 0; j < v; j++) r[j] += x[i][j];
for (int i = 0; i < v; i++) x[i] = r[i];
}
inline int check() {
int k = 0;
string c[4] = {"A", "C", "G", "T"};
do {
int ans = 0;
string x[2] = {}, y[2] = {};
for (int i = 0; i < m; i++)
for (int j = 0; j < 2; j++) {
x[j] += c[i & 1 ^ j];
y[j] += c[i & 1 ^ j | 2];
}
for (int i = 0; i < n; i++) {
int cnt[2] = {};
for (int j = 0; j < m; j++)
for (int k = 0; k < 2; k++)
cnt[k] += ((i & 1 ? y : x)[k][j] == a[i][j]);
r[i] = (i & 1 ? y : x)[cnt[1] > cnt[0]];
ans += cnt[cnt[1] > cnt[0]];
}
if (ans > k) {
k = ans;
for (int i = 0; i < n; i++) b[i] = r[i];
}
} while (next_permutation(c, c + 4));
return k;
}
inline void readInput() {
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> s[i];
}
inline void solve() {
int mx = 0;
for (int i = 0; i < n; i++) a[i] = s[i];
for (int i = 0; i < 4; i++) {
int k = check();
if (mx < k) {
for (int j = 0; j < 4 - i; j++) {
flip(b, n, m);
swap(n, m);
}
for (int j = 0; j < n; j++) t[j] = b[j];
if (4 - i & 1) swap(n, m);
mx = k;
}
flip(a, n, m);
swap(n, m);
}
}
inline void writeOutput() {
for (int i = 0; i < n; i++) cout << t[i] << endl;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
readInput(), solve(), writeOutput();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class Timer {
private:
string scope_name;
chrono::high_resolution_clock::time_point start_time;
public:
Timer(string name) : scope_name(name) {
start_time = chrono::high_resolution_clock::now();
}
~Timer() {
auto stop_time = chrono::high_resolution_clock::now();
auto length =
chrono::duration_cast<chrono::microseconds>(stop_time - start_time)
.count();
double mlength = double(length) * 0.001;
;
}
};
const long long MOD = 1000000007;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int iNF = 0x3f3f3f3f;
const long long MAXN = 300005;
int n, m;
char tbl[MAXN], bst[MAXN], cur[MAXN];
char get(int x, int y) { return tbl[x * m + y]; }
int test1(vector<char> perm) {
int ret = 0;
for (int i = 0; i < n; i += 1) {
int cnt1 = 0, cnt2 = 0;
for (int j = 0; j < m; j += 1) {
cnt1 += get(i, j) != perm[(i & 1) * 2 + (j & 1)];
cnt2 += get(i, j) != perm[(i & 1) * 2 + (j & 1 ^ 1)];
}
ret += min(cnt1, cnt2);
for (int j = 0; j < m; j += 1) {
if (cnt1 < cnt2) {
cur[i * m + j] = perm[(i & 1) * 2 + (j & 1)];
} else {
cur[i * m + j] = perm[(i & 1) * 2 + (j & 1 ^ 1)];
}
}
}
return ret;
}
int test2(vector<char> perm) {
int ret = 0;
for (int j = 0; j < m; j += 1) {
int cnt1 = 0, cnt2 = 0;
for (int i = 0; i < n; i += 1) {
cnt1 += get(i, j) != perm[(j & 1) * 2 + (i & 1)];
cnt2 += get(i, j) != perm[(j & 1) * 2 + (i & 1 ^ 1)];
}
ret += min(cnt1, cnt2);
for (int i = 0; i < n; i += 1) {
if (cnt1 < cnt2) {
cur[i * m + j] = perm[(j & 1) * 2 + (i & 1)];
} else {
cur[i * m + j] = perm[(j & 1) * 2 + (i & 1 ^ 1)];
}
}
}
return ret;
}
int main() {
;
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n * m; i += 1) {
cin >> tbl[i];
}
vector<char> perm = {'A', 'T', 'G', 'C'};
sort(perm.begin(), perm.end());
int ans = iNF;
do {
int t1 = test1(perm);
if (t1 < ans) {
for (int i = 0; i < n * m; i += 1) {
bst[i] = cur[i];
}
ans = t1;
}
int t2 = test2(perm);
if (t2 < ans) {
for (int i = 0; i < n * m; i += 1) {
bst[i] = cur[i];
}
ans = t2;
}
} while (next_permutation(perm.begin(), perm.end()));
for (int i = 0; i < n; i += 1) {
for (int j = 0; j < m; j += 1) {
cout << bst[i * m + j];
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> s;
map<char, int> c2i = {{'A', 0}, {'G', 1}, {'C', 2}, {'T', 3}};
string i2c = "AGCT";
int col_cost(int n, int a, int b) {
int cost = 0;
for (int m = 0; m < M; ++m) {
if (m % 2 == 0) {
cost += (a != s[n][m]);
} else {
cost += (b != s[n][m]);
}
}
return cost;
}
int row_cost(int m, int a, int b) {
int cost = 0;
for (int n = 0; n < N; ++n) {
if (n % 2 == 0) {
cost += (a != s[n][m]);
} else {
cost += (b != s[n][m]);
}
}
return cost;
}
int main() {
cin >> N >> M;
string S[N];
for (int i = 0; i < N; ++i) {
cin >> S[i];
}
s.resize(N);
for (int i = 0; i < N; ++i) {
s[i].resize(M);
for (int j = 0; j < M; ++j) {
s[i][j] = c2i[S[i][j]];
}
}
int mincost = N * M;
int best[2];
int a[2];
for (a[0] = 0; a[0] < 4; ++a[0]) {
for (a[1] = a[0] + 1; a[1] < 4; ++a[1]) {
int b[2], j = 0;
for (int i = 0; i < 4; ++i) {
if (i != a[0] && i != a[1]) {
b[j] = i;
++j;
}
}
int cost = 0;
for (int n = 0; n < N; ++n) {
if (n % 2 == 0) {
cost += min(col_cost(n, a[0], a[1]), col_cost(n, a[1], a[0]));
} else {
cost += min(col_cost(n, b[0], b[1]), col_cost(n, b[1], b[0]));
}
}
if (cost < mincost) {
memcpy(&best, &a, sizeof(best));
mincost = cost;
}
}
}
bool row = false;
for (a[0] = 0; a[0] < 4; ++a[0]) {
for (a[1] = a[0] + 1; a[1] < 4; ++a[1]) {
int b[2], j = 0;
for (int i = 0; i < 4; ++i) {
if (i != a[0] && i != a[1]) {
b[j] = i;
++j;
}
}
int cost = 0;
for (int m = 0; m < M; ++m) {
if (m % 2 == 0) {
cost += min(row_cost(m, a[0], a[1]), row_cost(m, a[1], a[0]));
} else {
cost += min(row_cost(m, b[0], b[1]), row_cost(m, b[1], b[0]));
}
}
if (cost < mincost) {
memcpy(&best, &a, sizeof(best));
mincost = cost;
row = true;
}
}
}
memcpy(&a, &best, sizeof(a));
int b[2], j = 0;
for (int i = 0; i < 4; ++i) {
if (i != a[0] && i != a[1]) {
b[j] = i;
++j;
}
}
vector<string> ans(N, string(M, '$'));
if (!row) {
for (int n = 0; n < N; ++n) {
if (n % 2 == 0) {
if (col_cost(n, a[0], a[1]) > col_cost(n, a[1], a[0])) swap(a[0], a[1]);
for (int m = 0; m < M; ++m) {
ans[n][m] = i2c[a[m % 2]];
}
} else {
if (col_cost(n, b[0], b[1]) > col_cost(n, b[1], b[0])) swap(b[0], b[1]);
for (int m = 0; m < M; ++m) {
ans[n][m] = i2c[b[m % 2]];
}
}
}
} else {
for (int m = 0; m < M; ++m) {
if (m % 2 == 0) {
if (row_cost(m, a[0], a[1]) > row_cost(m, a[1], a[0])) swap(a[0], a[1]);
for (int n = 0; n < N; ++n) {
ans[n][m] = i2c[a[n % 2]];
}
} else {
if (row_cost(m, b[0], b[1]) > row_cost(m, b[1], b[0])) swap(b[0], b[1]);
for (int n = 0; n < N; ++n) {
ans[n][m] = i2c[b[n % 2]];
}
}
}
}
for (int n = 0; n < N; ++n) {
cout << ans[n] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a[300005], t, b, g, d[300005], ans;
int mk(int x, int y, int z, int w, int p) {
if (p == 1) {
int r = 0;
for (int i = 1; i <= n; i++) {
int p1 = 0, p2 = 0;
for (int j = 1; j <= m; j++) {
if (i & 1) {
p1 += (a[((i - 1) * m + j)] == x && (j & 1)) +
(a[((i - 1) * m + j)] == y && ((j & 1) ^ 1));
p2 += (a[((i - 1) * m + j)] == y && (j & 1)) +
(a[((i - 1) * m + j)] == x && ((j & 1) ^ 1));
} else {
p1 += (a[((i - 1) * m + j)] == z && (j & 1)) +
(a[((i - 1) * m + j)] == w && ((j & 1) ^ 1));
p2 += (a[((i - 1) * m + j)] == w && (j & 1)) +
(a[((i - 1) * m + j)] == z && ((j & 1) ^ 1));
}
}
if (p1 > p2) {
for (int j = 1; j <= m; j++) {
d[((i - 1) * m + j)] = (i & 1 ? (j & 1 ? x : y) : (j & 1 ? z : w));
}
} else {
for (int j = 1; j <= m; j++) {
d[((i - 1) * m + j)] = (i & 1 ? (j & 1 ? y : x) : (j & 1 ? w : z));
}
}
}
for (int i = 1; i <= n * m; i++) r += (d[i] != a[i]);
return r;
}
if (p == 2) {
int r = 0;
for (int i = 1; i <= m; i++) {
int p1 = 0, p2 = 0;
for (int j = 1; j <= n; j++) {
if (((j - 1) * m + i) > n * m)
while (1)
;
if (i & 1) {
p1 += (a[((j - 1) * m + i)] == x && (j & 1)) +
(a[((j - 1) * m + i)] == y && ((j & 1) ^ 1));
p2 += (a[((j - 1) * m + i)] == y && (j & 1)) +
(a[((j - 1) * m + i)] == x && ((j & 1) ^ 1));
} else {
p1 += (a[((j - 1) * m + i)] == z && (j & 1)) +
(a[((j - 1) * m + i)] == w && ((j & 1) ^ 1));
p2 += (a[((j - 1) * m + i)] == w && (j & 1)) +
(a[((j - 1) * m + i)] == z && ((j & 1) ^ 1));
}
}
if (p1 > p2) {
for (int j = 1; j <= n; j++) {
d[((j - 1) * m + i)] = (i & 1 ? (j & 1 ? x : y) : (j & 1 ? z : w));
}
} else {
for (int j = 1; j <= n; j++) {
d[((j - 1) * m + i)] = (i & 1 ? (j & 1 ? y : x) : (j & 1 ? w : z));
}
}
}
for (int i = 1; i <= n * m; i++) r += (d[i] != a[i]);
return r;
}
return 10000000;
}
int main() {
scanf("%d%d", &n, &m);
map<char, int> m1;
m1['A'] = 1, m1['T'] = 2, m1['G'] = 3, m1['C'] = 4;
map<int, char> m2;
m2[1] = 'A', m2[2] = 'T', m2[3] = 'G', m2[4] = 'C';
for (int i = 1; i <= n * m; i++) {
char c;
scanf(" %c", &c);
a[i] = m1[c];
}
int x1[] = {0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2,
3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4},
x2[] = {0, 2, 2, 3, 3, 4, 4, 1, 1, 3, 3, 4, 4,
1, 1, 2, 2, 4, 4, 1, 1, 2, 2, 3, 3},
x3[] = {0, 3, 4, 2, 4, 2, 3, 3, 4, 1, 4, 1, 3,
2, 4, 1, 4, 1, 2, 2, 3, 1, 3, 1, 2},
x4[] = {0, 4, 3, 4, 2, 3, 2, 4, 3, 4, 1, 3, 1,
4, 2, 4, 1, 2, 1, 3, 2, 3, 1, 2, 1},
y = mk(1, 2, 3, 4, 1), z1 = 1, z2 = 2, z3 = 3, z4 = 4, z5 = 1;
for (int i = 1; i <= 24; i++) {
if (mk(x1[i], x2[i], x3[i], x4[i], 1) < y) {
z1 = x1[i], z2 = x2[i], z3 = x3[i], z4 = x4[i], z5 = 1;
y = mk(z1, z2, z3, z4, z5);
}
if (mk(x1[i], x2[i], x3[i], x4[i], 2) < y) {
z1 = x1[i], z2 = x2[i], z3 = x3[i], z4 = x4[i], z5 = 2;
y = mk(z1, z2, z3, z4, z5);
}
}
mk(z1, z2, z3, z4, z5);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
printf("%c", m2[d[((i - 1) * m + j)]]);
}
puts("");
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.