Sizaif

摘要：定理1: 最大流最小割定量：在任何的网络中，最大流的值等于最小割的容量定理2:在任何网络中，如果f是一个流，CUT（S,T）是一个割，且f的值等于割CUT（S,T）的容量，那么f是一个最大流结论1：最大流时，最小割cut（S，T）中，正向割边的流量=容量，逆向割边的... 阅读全文

posted @ 2017-09-17 21:15 Sizaif 阅读(208) 评论(0) 推荐(0) 编辑

摘要： f(cos(x))=cos(n∗x) holds for all xx.Given two integers nn and mm, you need to calculate the coefficient of x^mxm in f(x)f(x), modu... 阅读全文

posted @ 2017-09-17 19:41 Sizaif 阅读(216) 评论(0) 推荐(0) 编辑

摘要：传送门: https://nanti.jisuanke.com/t/17115Bob has a not even coin, every time he tosses the coin, the probability that the coin's front ... 阅读全文

posted @ 2017-09-16 19:00 Sizaif 阅读(248) 评论(0) 推荐(0) 编辑

摘要：问题 K: keks时间限制: 1 Sec 内存限制: 128 MB提交: 24 解决: 5[提交][状态][讨论版]题目描述给出一个n位数，要求删掉其中k位数字，使得剩下的数字组成的数尽量大。输入第1行：两个正整数n, k(1 <= k < n <= 500,0... 阅读全文

posted @ 2017-09-15 21:55 Sizaif 阅读(148) 评论(0) 推荐(0) 编辑

摘要： Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 17336 Accepted: 6095DescriptionDearboy, a goods victualer, now c... 阅读全文

posted @ 2017-09-14 20:28 Sizaif 阅读(152) 评论(0) 推荐(0) 编辑

摘要： Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23603 Accepted: 11885DescriptionOn a grid map there are n little m... 阅读全文

posted @ 2017-09-11 21:46 Sizaif 阅读(199) 评论(0) 推荐(0) 编辑

摘要： 1001: [BeiJing2006]狼抓兔子Time Limit: 15 Sec Memory Limit: 162 MBSubmit: 24061 Solved: 6086[Submit][Status][Discuss]Description现在小朋友们最喜... 阅读全文

posted @ 2017-09-09 17:22 Sizaif 阅读(134) 评论(0) 推荐(0) 编辑

摘要： A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17529 Accepted: 6055DescriptionYou are in charge of setting u... 阅读全文

posted @ 2017-09-09 10:34 Sizaif 阅读(161) 评论(0) 推荐(0) 编辑

摘要： DiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19307 Accepted: 8607DescriptionCows are such finicky eaters. Each cow ... 阅读全文

posted @ 2017-09-07 23:53 Sizaif 阅读(126) 评论(0) 推荐(0) 编辑

摘要： Our bear's forest has a checkered field. The checkered field is an n × n table, the rows are numbered from 1 to n from top to bottom, ... 阅读全文

posted @ 2017-09-06 16:39 Sizaif 阅读(162) 评论(0) 推荐(0) 编辑