Educational Codeforces Round 96 (Rated for Div. 2) (A - C题个人题解)
2020-10-12 21:14
537 查看
因为火锅导致错过的上分机会😂,赛后发现人均AC5题
1430A. Number of Apartments
暴力搜索
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll n; void solve() { cin >> n; //bool flag = false; for (int i = 0; i * 3 <= n; i++) for (int j = 0; j * 5 <= n; j++) if ((n - i * 3 - j * 5) % 7 == 0) { cout << i << " " << j << " " << (n - i * 3 - j * 5) / 7 << endl; return; } cout << -1 << endl; } int main() { //freopen("in.txt", "r", stdin); ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); int _; cin >> _; while (_--)solve(); }
1430B. Barrels
对水桶排序,累加后面k个水量即可
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 2e5 + 100; ll n, k, a ; void solve() { cin >> n >> k; for (ll i = 0; i < n; i++) cin >> a[i]; sort(a, a + n);ll l = a[n - 1]; for (ll i = n - 2; i >= n - k - 1; i--) { l += a[i]; }cout << l << endl; } int main() { int _; cin >> _; while (_--)solve(); }
1430C. Numbers on Whiteboard
#include<bits/stdc++.h> using namespace std; typedef long long ll; const int N = 2e5 + 100; ll n, k, a , _, m; void solve() { cin >> n; m = n; k = n - 1; cout << 2 << '\n'; for (int i = 2; i <= n; ++i) { cout << k << ' ' << m << '\n'; m = (k + m + 1) / 2; --k; } } int main() { int _; cin >> _; while (_--)solve(); }
1430D. String Deletion
1430E. String Reversal
相关文章推荐
- Educational Codeforces Round 35 (Rated for Div. 2) A-D
- Educational Codeforces Round 35 (Rated for Div. 2)
- Educational Codeforces Round 33 (Rated for Div. 2) F - Subtree Minimum Query
- Educational Codeforces Round 57 (Rated for Div. 2)
- cf Educational Codeforces Round 85 (Rated for Div. 2)A. Level Statistics
- Educational Codeforces Round 82 (Rated for Div. 2) A. Erasing Zeroes(超简单的写法)
- Educational Codeforces Round 39 (Rated for Div. 2)(A-D)(水题 + 模拟 + 贪心模拟 + DP)
- Educational Codeforces Round 36 (Rated for Div. 2)D. Almost Acyclic Graph(正解!!百度的那些拓扑排序现在都已经TLE!)
- 【codeforces 】Educational Codeforces Round 36 (Rated for Div. 2)(C.模拟 D.拓扑排序判断环)
- Educational Codeforces Round 38 (Rated for Div. 2) C. Constructing Tests
- Educational Codeforces Round 54 (Rated for Div. 2)
- 【Educational Codeforces Round 38 (Rated for Div. 2)】 Problem A-D 题解
- Educational Codeforces Round 72 (Rated for Div. 2)
- Educational Codeforces Round 33 (Rated for Div. 2) A - Chess For Three
- Educational Codeforces Round 64 (Rated for Div. 2)
- Educational Codeforces Round 39 (Rated for Div. 2)D. Timetable(dp)
- Educational Codeforces Round 92 (Rated for Div. 2)
- Educational Codeforces Round 36 (Rated for Div. 2) C 不大于某个数的序列变换
- Educational Codeforces Round 36 (Rated for Div. 2)C. Permute Digits(贪心)
- Educational Codeforces Round 40 (Rated for Div. 2) F. Runner's Problem 前缀和求区间覆盖 矩阵快速幂优化DP 离散化