08 2019 档案

摘要:Almost everyone likes kebabs nowadays (Here a kebab means pieces of meat grilled on a long thin stick). Have you, however, considered about the hardsh 阅读全文
posted @ 2019-08-22 10:38 cherish__lin 阅读(202) 评论(0) 推荐(0)
摘要://高斯消元 时间复杂度O(n^3) 使用浮点数计算 #include #include #include using namespace std; const double eps=1e-8; const int maxn=101; double a[maxn][maxn]; bool l[maxn]; double ans[maxn]; int n,m; int t; void prin... 阅读全文
posted @ 2019-08-20 16:55 cherish__lin 阅读(434) 评论(0) 推荐(0)
摘要:Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph 阅读全文
posted @ 2019-08-10 20:27 cherish__lin 阅读(754) 评论(0) 推荐(0)
摘要:为什么有人永远渴望旅行,或许就因为,巧合和温暖会在下一秒蜂拥而至吧。 一直想去旅游的天天决定在即将到来的五一假期中安排一场环游世界的旅行。为此,他已经提前查阅了很多资料,并准备画一张旅游路线图。天天先将所有可能会去的 nn 个旅游城市依次编号标记为 1,2,⋯,n1,2,⋯,n。如果从城市 AA 到 阅读全文
posted @ 2019-08-09 21:02 cherish__lin 阅读(586) 评论(0) 推荐(0)
摘要:Cao Cao made up a big army and was going to invade the whole South China. Yu Zhou was worried about it. He thought the only way to beat Cao Cao is to 阅读全文
posted @ 2019-08-08 20:46 cherish__lin 阅读(224) 评论(0) 推荐(0)