Codeforces Round 1006 (Div. 3) 补题+题解
A. New World, New Me, New Array贪心的想每次都赋值一个 \(p\) 如果正好和为 \(k\) 则答案就是 \(k/p\) ，否则是 \(k/p+1\)。
#includeusing namespace std;#define int long longconst int N = 1e6 + 10;void solve() { int n, k, p; cin >> n >> k >> p; if (n * p < abs(k)) { coutn; cin >> s; int cnt = 0, cnt1 = 0; for (auto t : s) { if (t == '-') cnt++; } int mx = 0; cnt1 = s.size() - cnt; for (int i = 1; i > n >> x; int now = 0; vector ans(n+10, 0); for (int i = 1; i < n; i ++ ) { if ((x | i) == x) { ans = i; now |= i; } } if (now != x) { ans = x; } for (int i = 0; i < n; i ++ ) { cout
页:
[1]