摘要：
費用流裸題 要注意的是浮點數判斷 #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
閱讀全文
摘要：
模擬題。 題面較長，讀懂了模擬即可。 題意概括如下：n名選手會進行m輪比賽，每輪比賽有a[i]場，每場比賽會給出比賽的選手編號及勝負情況。 要求輸出每輪比賽后每位選手的MP,OMW, GW, OGW. 縮寫解釋： (GP)：每場比賽不超過三小輪，三局兩勝，每小輪勝利+3，輸+0，平局+1。 (MP)
閱讀全文
摘要：
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:
閱讀全文
摘要：
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];
閱讀全文
摘要：
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
閱讀全文
浙公網安備 33010602011771號