随笔分类 -  数论

摘要:A: B: C: Molly's Chemicals(前缀和+map) 题意:在这个数组里面取连续的一段,问有多少种取法使得这段的和为k的自然数幂次; 思路:不能直接暴力,连续的自然联想到前缀和,假设要求和为x的数目,k的不同的幂次就是多个不同的x的计数和了;sum[i]-sum[j]=x,sum[ 阅读全文
posted @ 2017-02-25 21:35 LittlePointer 阅读(161) 评论(0) 推荐(0) 编辑
摘要:B: 思路: 暴力,每两个判断一下; C: 思路: 容斥定理,先枚举脖子下面那个点和那个不可描述的点,算出所有的方案数,这里面有多的腿当成了脖子或者胳膊的,然后就再枚举这种情况把这些减去,又减多了; 再把那些两条腿都连在上半身的加上; D: 思路: 分块+前缀和,把sqrt(n)个数字放在一个块里面 阅读全文
posted @ 2016-10-28 16:39 LittlePointer 阅读(379) 评论(0) 推荐(0) 编辑
摘要:题目链接: http://codeforces.com/contest/724 A. Checking the Calendar time limit per test 1 second memory limit per test 256 megabytes input standard input 阅读全文
posted @ 2016-10-10 16:12 LittlePointer 阅读(277) 评论(0) 推荐(0) 编辑
摘要:题目链接: Mathematician QSC Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 189 Accepted Submission 阅读全文
posted @ 2016-09-19 17:48 LittlePointer 阅读(597) 评论(0) 推荐(0) 编辑
摘要:题目链接: A. Dreamoon and Sums time limit per test 1.5 seconds memory limit per test 256 megabytes input standard input output standard output time limit 阅读全文
posted @ 2016-09-07 10:47 LittlePointer 阅读(279) 评论(0) 推荐(0) 编辑
摘要:题目链接: 1537 分解 问(1+sqrt(2)) ^n 能否分解成 sqrt(m) +sqrt(m-1)的形式 如果可以 输出 m%1e9+7 否则 输出no 问(1+sqrt(2)) ^n 能否分解成 sqrt(m) +sqrt(m-1)的形式 如果可以 输出 m%1e9+7 否则 输出no 阅读全文
posted @ 2016-09-02 18:23 LittlePointer 阅读(491) 评论(0) 推荐(0) 编辑
摘要:题目链接: C. Prefix Product Sequence time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time lim 阅读全文
posted @ 2016-09-02 16:05 LittlePointer 阅读(304) 评论(0) 推荐(0) 编辑
摘要:题目链接: E. ZS and The Birthday Paradox、 time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ti 阅读全文
posted @ 2016-08-31 16:13 LittlePointer 阅读(511) 评论(0) 推荐(0) 编辑
摘要:题目链接: 3288: Mato矩阵 Description Mato同学最近正在研究一种矩阵,这种矩阵有n行n列第i行第j列的数为gcd(i,j)。例如n=5时,矩阵如下:1 1 1 1 11 2 1 2 11 1 3 1 11 2 1 4 11 1 1 1 5Mato想知道这个矩阵的行列式的值, 阅读全文
posted @ 2016-08-29 17:19 LittlePointer 阅读(356) 评论(0) 推荐(0) 编辑
摘要:题目链接: gcd Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem Description Little White learned the greatest com 阅读全文
posted @ 2016-07-31 16:48 LittlePointer 阅读(259) 评论(0) 推荐(0) 编辑
摘要:题目链接: abs Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem Description Given a number x, ask positive intege 阅读全文
posted @ 2016-07-31 11:59 LittlePointer 阅读(323) 评论(0) 推荐(0) 编辑
摘要:题目链接: sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem Description Given a sequence, you're asked whethe 阅读全文
posted @ 2016-07-30 23:55 LittlePointer 阅读(315) 评论(0) 推荐(0) 编辑
摘要:题目链接: Lucky7 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description When ?? was born, seven crows flew i 阅读全文
posted @ 2016-07-29 00:00 LittlePointer 阅读(499) 评论(0) 推荐(0) 编辑
摘要:题目链接: PowMod Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Problem Description Declare:k=∑mi=1φ(i∗n) mod 10000000 阅读全文
posted @ 2016-07-25 11:39 LittlePointer 阅读(676) 评论(0) 推荐(0) 编辑
摘要:题目链接: Dertouzos Time Limit: 7000/3500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Problem Description A positive proper divisor is a 阅读全文
posted @ 2016-07-24 00:04 LittlePointer 阅读(486) 评论(0) 推荐(0) 编辑
摘要:题目链接: GCD Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Problem Description Give you a sequence of N(N≤100,000) in 阅读全文
posted @ 2016-07-23 17:28 LittlePointer 阅读(271) 评论(0) 推荐(0) 编辑
摘要:题目链接: C. PLEASE time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time limit per test 1 sec 阅读全文
posted @ 2016-07-16 11:14 LittlePointer 阅读(742) 评论(0) 推荐(0) 编辑
摘要:题目链接: GCD Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Given 5 integers: a, b, c, d, k, you're 阅读全文
posted @ 2016-07-01 20:00 LittlePointer 阅读(228) 评论(0) 推荐(1) 编辑
摘要:题目链接: X问题 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description 求在小于等于N的正整数中有多少个X满足:X mod a[0] = b[0], 阅读全文
posted @ 2016-06-30 19:43 LittlePointer 阅读(212) 评论(0) 推荐(0) 编辑
摘要:题目链接: D. Remainders Game time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time limit per t 阅读全文
posted @ 2016-06-30 12:07 LittlePointer 阅读(628) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示