数学知识
文章平均质量分 84
ZSGG_ACM
既然选择了ACM了,那就好好爱它,不管风雨兼程.
展开
-
素数
B. T-primestime limit per test 2 secondsmemory limit per test 256 megabytesWe know that prime numbers are positive integers that have exactly two distinct positive divisors. Simila原创 2014-09-08 18:23:56 · 1275 阅读 · 0 评论 -
Number Theory(数论-对数)
X -Number TheoryTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionFactorial of an integer is defined by the following f原创 2014-10-08 18:41:20 · 1482 阅读 · 0 评论 -
C. MUH and House of Cards(数论规律题)
C. MUH and House of Cardstime limit per test 1 secondmemory limit per test 256 megabytesPolar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horac原创 2014-11-01 16:58:48 · 1370 阅读 · 0 评论 -
余数之和sum
余数之和sumTime Limit:5000MS Memory Limit:165888KB 64bit IO Format:%lld & %lluSubmitStatusDescription给出正整数n和k,计算j(n, k)=k mod 1 + k mod 2 + k mod 3 + … + k mod n的值,原创 2014-11-03 20:40:45 · 1226 阅读 · 0 评论 -
B - Prime Path(BFS)
B -Prime PathTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescriptionThe ministers of the cabinet were quite upset by the message from the Chief of原创 2014-11-02 21:29:25 · 827 阅读 · 0 评论 -
莫比乌斯函数,数论中的战斗机
莫比乌斯函数,数论函数,由德国数学家和天文学家莫比乌斯(August Ferdinand Möbius ,1790–1868)提出。梅滕斯(Mertens)首先使用μ(n)作为莫比乌斯函数的记号。而据说,高斯(Gauss)比莫比乌斯早三十年就曾考虑过这个函数。莫比乌斯函数在数论中有着广泛应用。设f为算术函数,F为f的和函数,有F(n)=sigma[f(d)],d|n。我们现在要做的事转载 2014-11-03 13:12:33 · 5618 阅读 · 0 评论 -
C - Eddy's爱好
C -Eddy's爱好Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionIgnatius 喜欢收集蝴蝶标本和邮票,但是Eddy的爱好很特别,他对数字比较感兴趣,他曾经一度沉迷于素数,而现在他对于一些新的特殊数比较有兴趣。原创 2014-11-05 14:52:28 · 1005 阅读 · 0 评论 -
H - Happy 2006
H -Happy 2006Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionTwo positive integers are said to be relatively prime to each o原创 2014-11-05 23:13:17 · 990 阅读 · 0 评论 -
D. Little Girl and Maximum XOR(贪心)
D. Little Girl and Maximum XORA little girl loves problems on bitwise operations very much. Here's one of them.You are given two integers l and r. Let's consider the values of for all pa原创 2015-04-09 23:26:08 · 1745 阅读 · 0 评论 -
Code( BestCoder Round #39 ($) C) (莫比乌斯反演)
CodeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 209 Accepted Submission(s): 85Problem DescriptionWLD likes playing with cod原创 2015-04-27 23:23:25 · 977 阅读 · 0 评论 -
E. Mike and Foam(容斥原理)
E. Mike and FoamMike is a bartender at Rico's bar. At Rico's, they put beer glasses in a special shelf. There aren kinds of beer at Rico's numbered from 1 to n. i-th kind of beer hasai原创 2015-06-10 17:27:54 · 1292 阅读 · 1 评论 -
1236 - Pairs Forming LCM (唯一分解定理加组合数学)
一、题目链接:传送门二、题解: 先对n进行素因子分解,时间复杂度近似sqrt(n) / k,k为一个常数。 假设 n = a1^p1 * a2 ^ p2 * a3 ^ p3 * ... * an ^ pn。 (ai为素因子,pi为素因子的指数) 假设Lcm(a,b) = n,则对于每一个素因子原创 2015-10-05 12:34:43 · 693 阅读 · 0 评论 -
1154: 又是取石子
1154: 又是取石子Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 4 Solved: 4DescriptionOyk和Wzx又在玩取石子游戏了。在他们面前两堆石子,而游戏规定谁取了最后一颗石子谁就输了。跟其它的取石子游戏一样,他们两人轮流在两堆里面选一堆来取,可以全部取走,但不能一颗不取。 现在给你两堆石子的数目,作为原创 2015-12-17 16:42:28 · 687 阅读 · 0 评论 -
Sum(容斥原理)
E -SumTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionXXX is puzzled with the question below:1, 2, 3, ..., n (1<=n<=400000) are原创 2014-11-07 22:06:37 · 861 阅读 · 0 评论 -
Big Number(大整数取模)
Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4789 Accepted Submission(s): 3329Problem DescriptionAs we know, Big Num原创 2014-09-03 16:25:52 · 2131 阅读 · 0 评论 -
B. On Sum of Fractions(数论)
B. On Sum of Fractionstime limit per test 2 secondsmemory limit per test 256 megabytesLet's assume that v(n) is the largest prime number, that does not exceedn;u(n) is the原创 2014-09-12 00:33:51 · 1045 阅读 · 0 评论 -
C. Present(二分加贪心)
C. Presenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle beaver is a beginner programmer, so informatics is原创 2014-08-30 16:19:32 · 1285 阅读 · 0 评论 -
B. Easy Number Challenge
B. Easy Number Challengetime limit per test 2 secondsmemory limit per test 256 megabytesLet's denote d(n) as the number of divisors of a positive integern. You are give原创 2014-09-23 21:36:06 · 1093 阅读 · 0 评论 -
Square Coins(dp-母函数)
Square CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8307 Accepted Submission(s): 5648Problem DescriptionPeople in Sil原创 2014-08-31 16:34:32 · 1405 阅读 · 0 评论 -
Ignatius and the Princess III(母函数一种技巧性的暴力)
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13070 Accepted Submission(s): 9236Problem Descriptio原创 2014-08-31 15:41:47 · 965 阅读 · 0 评论 -
C. Modified GCD(二分加搜索约数)
C. Modified GCDtime limit per test 2 secondsmemory limit per test 256 megabytes题目连接: 传送门Well, here is another math class task. In mathematics, GCD is the great原创 2014-09-23 20:36:29 · 1354 阅读 · 1 评论 -
Fruit(母函数模板题)
FruitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3268 Accepted Submission(s): 1852Problem Description转眼到了收获的季节,由于有TT的专业指导,Lel原创 2014-09-02 00:10:32 · 889 阅读 · 0 评论 -
Holding Bin-Laden Captive!(母函数)
Holding Bin-Laden Captive!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15010 Accepted Submission(s): 6726Problem Description原创 2014-08-31 22:55:05 · 1920 阅读 · 0 评论 -
The Balance(母函数)
The BalanceTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5655 Accepted Submission(s): 2285Problem DescriptionNow you are asked原创 2014-09-01 21:15:52 · 870 阅读 · 0 评论 -
Big Event in HDU(母函数)
Big Event in HDU Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 23902 Accepted Submission(s): 8424原创 2014-08-31 23:46:06 · 831 阅读 · 0 评论 -
Big Number(简单数学题)
Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26003 Accepted Submission(s): 11810Problem DescriptionIn many applicati原创 2014-09-03 00:38:36 · 943 阅读 · 0 评论 -
1451 合法三角形
萌萌哒的传送门这道题很明显,可以通过算出有多少个三元组在一条线上,总的结果减去就行。这个可以通过枚举每一个点,算出数组其它的点跟这个点的斜率,如果斜率相同的,就意味着在同一条线上。然后就直接搞了弱写的代码://package xdlove_acmer;import java.util.*;import java.io.*;import java.math.*;原创 2015-12-21 20:55:05 · 889 阅读 · 0 评论