风骨散人 - 博客园

摘要：题目描述给定 nn 个点，mm 条有向边，给定每条边的容量，求从点 ss 到点 tt 的最大流。输入格式第一行包含四个正整数nn、mm、ss、tt，用空格分隔，分别表示点的个数、有向边的个数、源点序号、汇点序号。... 阅读全文

posted @ 2019-11-10 12:06 风骨散人阅读(183) 评论(0) 推荐(0)

摘要： DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move... 阅读全文

posted @ 2019-11-10 11:54 风骨散人阅读(135) 评论(0) 推荐(0)

摘要： DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale are... 阅读全文

posted @ 2019-11-10 10:49 风骨散人阅读(111) 评论(0) 推荐(0)

摘要： BigInteger abs() //返回大整数的绝对值BigInteger add(BigInteger val)// 返回两个大整数的和BigInteger and(BigInteger val) //返回两... 阅读全文

posted @ 2019-11-07 16:19 风骨散人阅读(96) 评论(0) 推荐(0)

摘要： Problem DescriptionFibonacci数列，定义如下：f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。 Input输入第一行为一个整数N，... 阅读全文

posted @ 2019-11-07 16:15 风骨散人阅读(94) 评论(0) 推荐(0)

摘要： Problem DescriptionGive you two numbers A and B, if A is equal to B, you should print "YES", or print "NO"... 阅读全文

posted @ 2019-11-07 15:21 风骨散人阅读(111) 评论(0) 推荐(0)

摘要： While doing some spring cleaning, Daniel found an old calculator that he loves so much. However, it seems ... 阅读全文

posted @ 2019-11-06 23:50 风骨散人阅读(101) 评论(0) 推荐(0)

摘要： Shichikuji is the new resident deity of the South Black Snail Temple. Her first job is as follows:There ar... 阅读全文

posted @ 2019-11-06 23:42 风骨散人阅读(118) 评论(0) 推荐(0)

摘要： Codeforces Round #597 (Div. 2) Constanze is the smartest girl in her village but she has bad eyesight.On... 阅读全文

posted @ 2019-11-06 23:30 风骨散人阅读(87) 评论(0) 推荐(0)

摘要： Codeforces Round #597 (Div. 2)Let nn be a positive integer. Let a,b,ca,b,c be nonnegative integers such th... 阅读全文

posted @ 2019-11-06 23:24 风骨散人阅读(121) 评论(0) 推荐(0)

CM_Lunatic