代码改变世界

今日的我要超越昨日的我,明日的我要胜过今日的我;以创作出更好的代码为目标,不断地超越自己。...

排序:
默认
按更新时间
按访问量

HDU 4592 Boring Game(高斯消元好题)

传送门 Boring GameTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 827    Accepted Submission(s)...

2016-09-11 12:09:11

阅读数:949

评论数:0

如何用线性筛法求欧拉函数

线性筛法求欧拉函数

2016-03-24 12:27:16

阅读数:2957

评论数:0

HDU 6069 Counting Divisors(素数筛法+枚举+技巧)——2017 Multi-University Training Contest - Team 4

传送门 Counting DivisorsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 741    Accepted Subm...

2017-08-03 20:34:11

阅读数:1308

评论数:2

HDU 6053 TrickGCD(分块+容斥)——2017 Multi-University Training Contest - Team 2

传送门 TrickGCDTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2177    Accepted Submission(s)...

2017-07-30 11:28:14

阅读数:491

评论数:0

求 [1,n-1]中 与 n 的 GCD 值的和

如何求 ∑n−1i=1gcd(i,n)——(1)\sum_{i=1}^{n-1}gcd(i, n)——(1) 因为 gcd(i,n)gcd(i,n) 的值一定是 nn 的因子,然后我们通过观察发现 (1)(1) 式可以写成如下形式: ∑d∗phi(nd),d∈{n的因子},去掉d是n的情况\s...

2017-06-27 18:14:31

阅读数:260

评论数:0

HDU 5514 Collision(扩展欧几里得+解方程)——2014ACM/ICPC亚洲区北京站

传送门 Matt is playing a naive computer game with his deeply loved pure girl. The playground is a rectangle with walls around. Two balls are put ...

2017-06-26 18:45:09

阅读数:415

评论数:0

Poj 2689 Prime Distance(素数筛+二次素数筛)

传送门The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoretic...

2017-06-16 11:57:27

阅读数:286

评论数:0

51NOD 1678 lyk与gcd(容斥+素数筛)

传送门 这天,lyk又和gcd杠上了。 它拥有一个n个数的数列,它想实现两种操作。1:将 aia_i 改为 bb。 2:给定一个数i,求所有 gcd(i,j)=1gcd(i,j)=1 时的 aja_j 的总和。Input 第一行两个数n,Q(1<=n,Q<=100000)...

2017-06-11 21:13:48

阅读数:411

评论数:0

HDU 5950 Recursive sequence(构造矩阵+矩阵乘法)——2016ACM/ICPC亚洲区沈阳站(重现赛)

传送门 Recursive sequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 98    Accepted Submiss...

2016-10-30 16:33:25

阅读数:2121

评论数:0

HDU 5478 Can you find it(数学归纳法 + 快速幂)——2015 ACM/ICPC Asia Regional Shanghai Online

传送门 Can you find itTime Limit: 8000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1487    Accepted Submissi...

2016-10-25 21:06:54

阅读数:676

评论数:0

HDU 1402 A * B Problem Plus(FFT加速优化乘法)

传送门 A * B Problem PlusTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18312    Accepted Subm...

2016-10-08 16:50:23

阅读数:1261

评论数:0

ACM-ICPC国际大学生程序设计竞赛北京赛区(2016)网络赛 F. Periodic Signal(FFT 优化乘法)

传送门 时间限制:5000ms 单点时限:5000ms 内存限制:256MB 描述 Profess X is an expert in signal processing. He has a device which can send a particular 1 second sign...

2016-10-01 10:32:00

阅读数:1223

评论数:0

HDU 4810 Wall Painting(组合数学 + 位运算)——2013ACM/ICPC亚洲区南京站现场赛

传送门Wall PaintingTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2627    Accepted Submission(...

2016-09-20 21:06:46

阅读数:1640

评论数:0

HDU 5895 Mathematician QSC(逆元应用+矩阵快速幂+数论知识)——2016 ACM/ICPC Asia Regional Shenyang Online

传送门 Mathematician QSCTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 208    Accepted Submi...

2016-09-19 19:07:02

阅读数:1004

评论数:0

HDU 5879 Cure(技巧)——2016 ACM/ICPC Asia Regional Qingdao Online

传送门Problem Description Given an integer nn, we only want to know the sum of 1/k21/k^2 where kk from 11 to nn. Input There are multiple cases.For each...

2016-09-18 11:20:24

阅读数:840

评论数:0

HDU 3364 Lanterns(高斯消元入门题目——开关问题)

传送门 LanternsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1582    Accepted Submission(s): ...

2016-09-13 10:26:08

阅读数:1249

评论数:0

POJ 1222 EXTENDED LIGHTS OUT(高斯消元 异或+求逆版本)

传送门EXTENDED LIGHTS OUTTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9297Accepted: 6040DescriptionIn an extended version of the game Lights...

2016-09-08 14:08:50

阅读数:672

评论数:0

2016年湖南省第十二届大学生计算机程序设计竞赛 A. 2016(数学)

传送门问题 A: 2016 问题 A: 2016时间限制: 5 Sec  内存限制: 128 MB提交: 248  解决: 137[提交][状态][讨论版]题目描述  给出正整数 n 和 m,统计满足以下条件的正整数对 (a,b) 的数量: 1. 1≤a≤n,1≤b≤m; 2. a×b...

2016-09-03 18:44:21

阅读数:1157

评论数:0

HDU 5399 Too Simple(数学 + 找规律)——2015 Multi-University Training Contest 9

传送门Too SimpleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1673    Accepted Submission(s): ...

2016-09-01 18:59:53

阅读数:576

评论数:0

HDU 5318 The Goddess Of The Moon(构造矩阵 )——2015 Multi-University Training Contest 3

传送门 The Goddess Of The MoonTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1471    Accepte...

2016-08-25 20:09:00

阅读数:822

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭