蓝桥杯 算法训练 Remember the A La Mode
摘要：
费用流裸题 要注意的是浮点数判断 #include <bits/stdc++.h> using namespace std; typedef long long ll; const int N=100005; int cur[N],head[N],vis[N]; double dis[N]; con 阅读全文
Competition in Swiss-system——2019CCPC哈尔滨 C题
摘要：
模拟题。 题面较长，读懂了模拟即可。 题意概括如下：n名选手会进行m轮比赛，每轮比赛有a[i]场，每场比赛会给出比赛的选手编号及胜负情况。 要求输出每轮比赛后每位选手的MP,OMW, GW, OGW. 缩写解释： (GP)：每场比赛不超过三小轮，三局两胜，每小轮胜利+3，输+0，平局+1。 (MP) 阅读全文
Codeforces Round #603 (Div. 2)
摘要：
A. Sweet Problem 简单题，排个序判断a+b与c的关系，＜就是a+b＞是（a+b+c）/2 #include <bits/stdc++.h> using namespace std; typedef long long ll; const int N=1e5+5; ll a[3]; i 阅读全文
Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3) E. Arson In Berland Forest
摘要：
E. Arson In Berland Forest The Berland Forest can be represented as an infinite cell plane. Every cell contains a tree. That is, contained before the 阅读全文
数据结构必做题参考:实验一T1-20,实验2 T1
摘要：
#include <bits/stdc++.h> using namespace std; const int N=105; struct Book { string isbn; string name; double price; }b[N],r[N]; class book { private: 阅读全文
Codeforces Round #585 (Div. 2) CF1215A~C
摘要：
CF1215A. Yellow Cards简单的模拟，给定了黄票张数，判断最少和最多有多少人被罚下场。 #include <bits/stdc++.h> using namespace std; int main() { int a,b,aa,bb,n,nnn; cin>>a>>b>>aa>>bb> 阅读全文
图书管理系统，数组存储和链表存储
摘要：
#include <bits/stdc++.h> using namespace std; fstream in,out; int n=0; string temp[4]; struct book { string isbn; string name; double price; }b[205]; 阅读全文
CF1141E Superhero Battle
摘要：
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly n minutes. After a round ends, the next round starts imm 阅读全文
CF1141D Colored Boots
摘要：
There are n left boots and n right boots. Each boot has a color which is denoted as a lowercase Latin letter or a question mark ('?'). Thus, you are g 阅读全文
CF1209C Paint the Digits
摘要：
You are given a sequence of n digits d1d2…dn. You need to paint all the digits in two colors so that: each digit is painted either in the color 1 or i 阅读全文