简单数论
HonniLin
double fighting
展开
-
B. Multitasking CF_384
题意:Iahub wants to enhance his multitasking abilities. In order to do this, he wants to sort n arrays simultaneously, each array consisting of mintegers.Iahub can choose a pair of distinct in原创 2014-01-21 23:17:30 · 778 阅读 · 0 评论 -
POJ 3421 - X-factor Chains(数学)
题目:http://poj.org/problem?id=3421题意:求n的因子链,使得前一个数整除后一个数,求出链的最大长度以及这样的链的数量。 思路:n可以分解成质因子的乘积,n = p1^a1 * p2^a2 * p3^a2.....pn^an.最大长度ans = a1+a2+a3...+an,链的数量 = ans!/ a1! * a2! * ...* an原创 2015-02-23 12:33:29 · 607 阅读 · 0 评论 -
POJ 1995 - Raising Modulo Numbers(数学`快速幂运算)
题目:http://poj.org/problem?id=1995思路:快速幂运算,模版题。CODE:#include #include #include using namespace std;typedef long long ll;int m;ll cal(ll a, ll b){ ll s = 1; while(b > 0) {原创 2015-02-17 21:21:15 · 605 阅读 · 0 评论 -
POJ 3641 - Pseudoprime numbers(快速幂)
题目:http://poj.org/problem?id=3641思路:判断素数,快速幂求幂。CODE#include #include using namespace std;bool isprime(long long p){ for(int i = 2; i * i <= p; ++i) { if(p % i == 0) return原创 2015-02-22 17:19:45 · 496 阅读 · 0 评论 -
POJ 3292 - Semi-prime H-numbers(数学)
题目:http://poj.org/problem?id=3292思路:水水的题,无耻得写篇题解记录。=。=CODE:#include #include #include #include using namespace std;const int maxn = 1000005;int pri[maxn], num[maxn], ans[maxn];void原创 2015-02-23 09:44:25 · 476 阅读 · 0 评论 -
POJ 1930 - Dead Fraction(数学)
题目:http://poj.org/problem?id=1930题目:将无限循环小数转化成分数,但是循环节不确定,要求出分母最小的那个分数。思路:百度知道了 无限循环小数转化成分数的方法。详见笔记=。=CODE:#include #include #include #include using namespace std;typedef long long原创 2015-02-24 18:08:07 · 778 阅读 · 0 评论 -
POJ 2429 - GCD & LCM Inverse(数论)
题目:http://poj.org/problem?id=2429题意:已知两个数的最大公约数和最小公倍数,求出两个数(和最小).思路:因为题目的数据特别大,所以要用Rabin-Miller强伪素数测试和Pollard因数分解算法.基本思路是:(a / gcd) * (b / gcd) = lcm / gcd ,所以需要分解lcm / gcd 。将其分解为互质的两个数,原创 2015-02-25 11:52:46 · 817 阅读 · 0 评论 -
Codeforces Round #295 (Div. 2) C. DNA Alignment(数学)
题目:http://codeforces.com/problemset/problem/520/C题意:长度为n 的字符串, 与只含有"ACGT"的n长度的字符串作比较,求出得到得数最大的字符串有几条.思路:求出字符串中重复次数最多的字母的个数x , 则答案为 ans = x ^ n.AC.#include #include #include #include u原创 2015-03-10 17:11:10 · 548 阅读 · 0 评论 -
POJ 2739 - Sum of Consecutive Prime Numbers(素数筛法+前缀和 / 尺取法)
DescriptionSome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 5原创 2015-01-27 07:54:16 · 610 阅读 · 0 评论 -
ZOJ 3868 - GCD Expectation(数论)
题目:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5480题意:给出n和k, 求出n个数的任意非空子集的最大公约数的k次方的期望, 最后求出期望*(2^n-1)思路:每取一个子集的概率都为 1/(2^n-1), 结果除以(2^n-1),则实际上是求出每个非空子集的k次方的和.题目转化为gcd为i的原创 2015-04-13 14:26:50 · 1140 阅读 · 0 评论 -
Codeforces Round #298 (Div. 2) C. Polycarpus' Dice(数学)
题目:http://codeforces.com/contest/534/problem/C题意:n个筛子,s为n个筛子的和.给出n个数为每个筛子的最大点数. 求出每个筛子有多少个数是一定不能取的.思路:取极限的方法.每个筛子不能取的点数分别是: 1)当其他筛子取1,此筛子点数大于 s+1-n. 2)当其他筛子取最大值的时候,此筛子小于 s - (sum-a[i]).原创 2015-04-14 16:42:14 · 519 阅读 · 0 评论 -
ZOJ 3870 - Team Formation(数学)
题目:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3870题意:给出n个数,每次选出2个数,问一共有多少种选法使得两数异或后的值大于两个数的最大值。思路:对于一个数x,x的最高位0改为1时,且0前的数不变,则x比原来要大。AC.#include #include #include原创 2015-04-28 22:30:44 · 492 阅读 · 0 评论 -
HDU 4282 - A very hard mathematic problem(数学)
Problem Description Haoren is very good at solving mathematic problems. Today he is working a problem like this: Find three positive integers X, Y and Z (X 1) that holds X^Z + Y^Z + XYZ =原创 2015-02-06 11:21:41 · 688 阅读 · 0 评论 -
Codeforces Round #226 (Div. 2) C. Bear and Prime Numbers(素数筛法)
Recently, the bear started studying data structures and faced the following problem.You are given a sequence of integers x1, x2, ..., xn of lengthn and m queries, each of them is characterized by原创 2015-02-02 10:50:56 · 729 阅读 · 0 评论 -
389-A Fox and Number Game
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is playing a game with numbers now.Ciel has n positi原创 2014-02-14 14:23:11 · 843 阅读 · 0 评论 -
LightOJ-1027
题意: 有n个门, 其中N1个门可以ji原创 2014-04-15 21:46:06 · 1455 阅读 · 4 评论 -
HDU 4720--Naive and Silly Muggles (关于圆)
题意: 简单了说就是给你三个点 求一个最小的圆,原创 2014-05-10 10:08:22 · 929 阅读 · 0 评论 -
HDU 4722-Good Numbers
打表找规律~发现每原创 2014-05-10 09:59:38 · 571 阅读 · 0 评论 -
POJ 3641-Pseudoprime numbers
题目:题意:原创 2014-07-20 11:37:11 · 593 阅读 · 0 评论 -
UVA 10780-Again Prime? No Time. (数学-质因子)
题目原创 2014-07-27 21:31:40 · 764 阅读 · 0 评论 -
HDU 4762-Cut the Cake(概率+高精度)
Problem DescriptionMMM got a big big big cake, and invited all her M friends to eat the cake together. Surprisingly one of her friends HZ took some (N) strawberries which MMM likes very much to deco原创 2014-09-12 22:22:01 · 712 阅读 · 0 评论 -
CodeForces 432C - Prime Swaps (数论 + 贪心)
You have an array a[1], a[2], ..., a[n], containing distinct integers from1 to n. Your task is to sort this array in increasing order with the following operation (you may need to apply it multiple原创 2015-01-27 09:11:24 · 786 阅读 · 0 评论 -
LightOJ 1078 - Integer Divisibility(取模运算)
DescriptionIf an integer is not divisible by 2 or 5, some multiple of that number in decimal notation is a sequence of only a digit. Now you are given the number and the only allowable digit, you原创 2015-01-27 08:18:34 · 890 阅读 · 0 评论 -
韩信点兵(剩余定理)
题目: 31页思路: 开始的思路是暴力..三个for完事...去网上对对答案...发现了正确的算法... 中国剩余定理: CODE :#include#include#include#includeusing namespace std;int main(){ int a,b,c; scanf("%d%d%d",&a,&b,&c原创 2014-03-18 14:22:39 · 1556 阅读 · 0 评论 -
2014-2015 ACM-ICPC, NEERC, Moscow Subregional Contest —— E. Equal Digits
E. Equal Digitstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFor the given integer N and digit D, find the minim原创 2014-11-10 23:31:25 · 1850 阅读 · 0 评论 -
*UVALive 6657 - GCD XOR(数学)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=84227#problem/H题意:求出1~n中gcd(a,b)= a^b的对数。思路:枚举最大公约数的两个数 且符合条件,记录。AC.#include #include #include using namespace std;const i原创 2015-07-25 22:53:34 · 485 阅读 · 0 评论