摘要:
费用流裸题 要注意的是浮点数判断 #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 阅读全文
摘要:
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 阅读全文
摘要:
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 阅读全文
摘要:
#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: 阅读全文
摘要:
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 阅读全文
摘要:
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 阅读全文
摘要:
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 阅读全文