摘要:
"BUPT2017 wintertraining(16) 5 D" "POJ 2823" 题意 给定n,k,求滑窗[i,i+k 1]在(1 include include include define pii pair define mp(i,j) make_pair(i,j) define N 1 阅读全文
posted @ 2017-02-10 02:42
水郁
阅读(450)
评论(0)
推荐(1)
摘要:
"BUPT2017 wintertraining(16) 5 C" "HDU 1021" 题意 1, 12, 123, 1234, ..., 12345678910, ... 问第a到第b个数(inclusive)里有几个可以被3整除。 题解 前几项的各位数之和对3取模,可以找到规律——余数是1,0 阅读全文
posted @ 2017-02-10 02:33
水郁
阅读(297)
评论(0)
推荐(0)
摘要:
"BUPT2017 wintertraining(16) 5 B" "POJ 2251" 题意 3维的地图,求从S到E的最短路径长度 题解 bfs 代码 include include include include define N 35 using namespace std; struct n 阅读全文
posted @ 2017-02-10 02:19
水郁
阅读(520)
评论(0)
推荐(0)
摘要:
"BUPT2017 wintertraining(16) 5 A" "HDU 1021" 题意 There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n 1) + F(n 2) (n =2). 输入n,若 阅读全文
posted @ 2017-02-10 02:16
水郁
阅读(1177)
评论(1)
推荐(1)