- 博客(8)
- 收藏
- 关注
RSS订阅原创 Educational Codeforces Round 132 (Rated for Div. 2)(A~C)
Educational Codeforces Round 132 (Rated for Div. 2)(A~C)
2022-07-27 00:15:05
231
原创 Codeforces Round #810 (Div. 2) (A~C)
Codeforces Round #810 (Div. 2) (A~C题解)
2022-07-25 23:44:28
386
原创 Codeforces Round 118 (Rated for Div. 2)(ABC)
A题链接解题思路：中心思想——节约时间#include <bits/stdc++.h> using namespace std; int main (){ int t; while (cin >> t) { while(t--) { string a,b;//10e6 用数字直接来肯定会爆 所以用字符串 int c,d; cin >> a >> c; cin >>
2021-12-03 23:32:11
548
原创 Codeforces489B（题解）
B. BerSU Balltime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary!nboys andmgirls are...
2021-12-01 20:25:44
841
原创 Codeforces Round #756 (Div. 3)- C
<补题>/* Codeforces Round #756 (Div. 3)-------C*/ //#include <bits/stdc++.h>#include <vector>#include <iostream>using namespace std;//对原序列 p 操作只操作小的数 所以最大值会在最左边或最右边 int n;int a[200200];int bucket[200200]; int main(){
2021-11-27 19:15:14
643
原创 Codeforces Round #756 (Div. 3) （AB题解）
A. Make Eventime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp has an integernnthat doesn't contain the digit0. He can do the following operation with his number several (possi...
2021-11-26 16:19:03
615
原创 DFS基础例题（全排列）
#include<iostream>using namespace std;int n;int book[10] = {0};int a[10]; void dfs(int index){ if(index == n) //递归终止条件 { for(int i = 0;i < n;i++) cout << a[i]; cout <<endl; return ; } else { for(int.
2021-10-17 15:00:45
257
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人