- 博客(3)
- 资源 (5)
- 收藏
- 关注
RSS订阅原创 Codeforces Round #514 (Div. 2) C - Sequence Transformation
推规律 #include <bits/stdc++.h> using namespace std; #define ll long long const int maxn = 1e3+5; int n, m, k; int main() { scanf("%d", &n); int cnt = 0, ans = n, d = 1, sum = 0; while ...
2018-10-08 23:05:55
221
原创 Codeforces Round #514 (Div. 2) B - Forgery
遍历所有左上角# #include <bits/stdc++.h> using namespace std; #define ll long long const int maxn = 1e3+5; int n, m, k; char mapp[maxn][maxn]; int vis[maxn][maxn]; bool f(int i, int j) { if (mapp...
2018-10-08 23:04:04
183
原创 Codeforces Round #514 (Div. 2) A. Cashier
所有空闲时间除以休息时间累加 #include <bits/stdc++.h> using namespace std; #define ll long long const int maxn = 1e5+5; int n, m, k; int st, ti; int main() { int ans = 0, ttime = 0; scanf("%d%d%d", &...
2018-10-08 23:00:58
182
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人