摘要: 题目描述 Given an array A with length n a[1],a[2],...,a[n] where a[i] (1<=i<=n) is positive integer. Count the number of pair (l,r) such that a[l],a[l+1], 阅读全文
posted @ 2017-12-24 20:11 Fighting_Heart 阅读(351) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Small koala special love LiaoHan (of course is very handsome boys), one day she saw N (N<1e18) guys standing in a row, because the boys had some 阅读全文
posted @ 2017-12-24 20:09 Fighting_Heart 阅读(360) 评论(0) 推荐(0) 编辑
摘要: 题目描述 In country A, some roads are to be built to connect the cities。However, due to limited funds, only some roads can be built.That is to say,if the 阅读全文
posted @ 2017-12-24 20:06 Fighting_Heart 阅读(319) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Once there was a pig, which was very fond of treasure hunting. The treasure hunt is risky, and it is inadvertently caught in the peach blossom tr 阅读全文
posted @ 2017-12-24 20:04 Fighting_Heart 阅读(348) 评论(0) 推荐(1) 编辑
摘要: 题目描述 A mod-dot product between two arrays with length n produce a new array with length n. If array A is a1,a2,...,an and array B is b1,b2,...bn, then 阅读全文
posted @ 2017-12-24 20:03 Fighting_Heart 阅读(340) 评论(0) 推荐(0) 编辑
摘要: 题目描述 We define Shuaishuai-Number as a number which is the sum of a prime square(平方), prime cube(立方), and prime fourth power(四次方). The first four Shuai 阅读全文
posted @ 2017-12-24 20:01 Fighting_Heart 阅读(542) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Yuanyuan Long is a dragon like this picture? I don’t know, maybe you can ask him. But I’m sure Yuanyuan Long likes ballons, he has a lot of ballo 阅读全文
posted @ 2017-12-24 19:59 Fighting_Heart 阅读(384) 评论(0) 推荐(1) 编辑
摘要: 题目描述 BSD is a lazy boy. He doesn't want to wash his socks, but he will have a data structure called 'socks heap'.By maintaining this structure, he can 阅读全文
posted @ 2017-12-24 19:56 Fighting_Heart 阅读(377) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Two endpoints of two line segments on a plane are given to determine whether the two segments are intersected (there is a common point or there i 阅读全文
posted @ 2017-12-24 19:54 Fighting_Heart 阅读(244) 评论(0) 推荐(0) 编辑