![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
life4711
这个作者很懒,什么都没留下…
展开
-
HDU 2899 Strange fuction 二分+数学
http://acm.hdu.edu.cn/showproblem.php?pid=2899Problem DescriptionNow, here is a fuction: F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 Can you find the minimum value when x is between 0 a原创 2014-02-24 09:37:09 · 749 阅读 · 0 评论 -
(HDU1061||nefu783)&&nefu 66 求N^N的最右边和最左边的数
http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=783http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=66原创 2014-09-22 09:00:23 · 947 阅读 · 0 评论 -
2010成都站F题 三分
http://acm.hdu.edu.cn/showproblem.php?pid=3714Problem DescriptionJosephina is a clever girl and addicted to Machine Learning recently. Shepays much attention to a method called Linear Disc原创 2014-08-23 20:23:30 · 814 阅读 · 0 评论 -
HDU 3059 Fibonacci数列与矩阵求和 矩阵大小不固定
http://acm.hdu.edu.cn/showproblem.php?pid=3509原创 2014-07-27 15:04:58 · 807 阅读 · 0 评论 -
HDU 2814 斐波那契数列的循环节问题
http://acm.hdu.edu.cn/showproblem.php?pid=2814Problem DescriptionIn mathematics, the Fibonacci numbers are a sequence of numbers named after Leonardo of Pisa, known as Fibonacci (a contracti原创 2014-07-26 19:54:45 · 913 阅读 · 0 评论 -
hdu 1757 矩阵连乘
http://acm.hdu.edu.cn/showproblem.php?pid=1757原创 2014-07-26 14:27:33 · 811 阅读 · 0 评论 -
HDU 1588 斐波那契数列数列变形和矩阵连乘
http://acm.hdu.edu.cn/showproblem.php?pid=1588原创 2014-07-26 12:00:47 · 989 阅读 · 0 评论 -
HITOJ 1864 求Fibonacci数列的位数
http://acm.hit.edu.cn/hoj/problem/view?id=1864原创 2014-07-25 16:35:43 · 1133 阅读 · 0 评论 -
poj 3070
http://poj.org/problem?id=3070原创 2014-07-25 15:26:37 · 540 阅读 · 0 评论 -
2013成都站J题||hdu4790 数论
http://acm.hdu.edu.cn/showproblem.php?pid=4790Problem Description Coach Pang and Uncle Yang both love numbers. Every morning they play a game with number together. In each game the followin原创 2014-08-29 11:20:01 · 1214 阅读 · 0 评论 -
陈老师的多校联合20140816||SPOJ AMR11B 三角形的有向面积
http://www.spoj.com/problems/AMR11B/Hogwarts is under attack by the Dark Lord, He-Who-Must-Not-Be-Named. To protect the students, Harry Potter must cast protective spells so that those who are p原创 2014-08-17 16:58:15 · 877 阅读 · 0 评论 -
hdu 5187 快速幂快速乘法
http://acm.hdu.edu.cn/showproblem.php?pid=5187Problem DescriptionAs one of the most powerful brushes, zhx is required to give his juniors n problems.zhx thinks the ith problem's difficul原创 2015-03-15 11:44:27 · 1273 阅读 · 0 评论 -
NEFU 457 矩阵连乘
http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=457原创 2014-05-20 12:05:20 · 614 阅读 · 0 评论 -
矩阵的乘法和矩阵快速幂
代码如下:#include #include #include using namespace std;typedef long long LL;const int N = 2,M=2,P=2;const int MOD=1000000007;struct Matrix{ LL m[N][N];};Matrix A={1,1, 1,0};原创 2014-05-20 09:12:23 · 2229 阅读 · 0 评论 -
2014年北京邀请赛 E题 矩阵+dp
题目大意:判断有多少个长度为n的字符串原创 2014-05-20 20:03:38 · 658 阅读 · 0 评论 -
NEFU 458 矩阵连乘
http://acm.nefu.edu.cn/JudgeOnline/problemshow.php原创 2014-05-20 14:23:21 · 645 阅读 · 0 评论 -
nefu 459 矩阵连乘
http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=459descriptionLele now is thinking about a simple function f(x).If x < 10 f(x) = x.If x >= 10 f(x) = a0 * f(x-1)原创 2014-05-20 15:44:55 · 655 阅读 · 0 评论 -
工大培训——day3 G题
解题思路:原创 2014-11-23 13:29:38 · 647 阅读 · 0 评论 -
2012天津站H题||hdu4438 数学期望
http://acm.hdu.edu.cn/showproblem.php?pid=4438Problem DescriptionAlice and Bob are the topmost hunters in the forest, so no preys can escape from them. However, they both think that its原创 2014-09-16 18:14:27 · 981 阅读 · 0 评论 -
HITOJ 2060 类似斐波那契数列(一段和取模)
http://acm.hit.edu.cn/hoj/problem/view?id=2060As we know , the Fibonacci numbers are defined as follows: """"Given two numbers a and b , calculate . """"InputThe input contains s原创 2014-07-25 15:20:51 · 1357 阅读 · 0 评论 -
hdu 3117矩阵+斐波那契数列
http://acm.hdu.edu.cn/showproblem.php?pid=3117原创 2014-07-21 11:52:18 · 1511 阅读 · 0 评论 -
Timus Online Judge 哥德巴赫猜想
http://acm.timus.ru/problem.aspx?space=18&num=10J. Something EasierTime limit: 1.0 secondMemory limit: 64 MB“How do physicists define prime numbers? Very easily: prime numbers are原创 2014-03-31 17:26:12 · 1358 阅读 · 0 评论 -
CodeForces 221B
http://codeforces.com/problemset/problem/221/BB. Little Elephant and Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard input原创 2014-03-20 07:33:43 · 738 阅读 · 0 评论 -
POJ 1595 素数的筛选输出问题
http://poj.org/problem?id=1595Prime CutsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9976 Accepted: 3822DescriptionA prime number is a counti原创 2014-03-31 16:20:10 · 568 阅读 · 0 评论 -
poj 2739
http://poj.org/problem?id=2739DescriptionSome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive intege原创 2014-03-29 14:51:35 · 815 阅读 · 0 评论 -
hdu 1215
http://acm.hdu.edu.cn/showproblem.php?pid=1215Problem Description七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!"人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下:数字N的因子就是所有比N小又原创 2014-03-29 18:26:04 · 613 阅读 · 0 评论 -
codeforces 227 A 三角形的有向面积
http://codeforces.com/problemset/problem/227/AA. Where do I Turn?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard o原创 2014-03-29 20:38:17 · 784 阅读 · 0 评论 -
素数筛选
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=43142#problem/BDescriptionWhile preparing this problem set the jury has run into the following problem: it was necessary to send by原创 2014-03-29 20:59:26 · 930 阅读 · 0 评论 -
求 N!末尾0的个数
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=43142#problem/CDescriptionThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers f原创 2014-03-29 14:57:00 · 1489 阅读 · 0 评论 -
codeforces 276 B 博弈
http://codeforces.com/problemset/problem/276/BB. Little Girl and Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstanda原创 2014-04-01 19:17:50 · 852 阅读 · 0 评论 -
NEFU 630 数论扩展欧几里得算法的应用
http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=630原创 2014-05-03 20:54:10 · 763 阅读 · 0 评论 -
hdu 1021 斐波那契数列取模(循环节)
http://acm.hdu.edu.cn/showproblem.php?pid=1021Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInp原创 2014-07-21 16:13:08 · 2786 阅读 · 0 评论 -
HITOJ 2255 类似Fibonacci数列求和取模拓展
http://acm.hit.edu.cn/hoj/problem/view?id=2255原创 2014-07-25 15:22:39 · 1102 阅读 · 0 评论 -
codeforce 7C 扩展欧几里得算法
http://codeforces.com/problemset/problem/7/C原创 2014-06-03 21:19:35 · 1053 阅读 · 0 评论 -
Uva 10780 素因子分解的应用(n的分解、n!的分解)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1721原创 2014-05-13 10:47:53 · 948 阅读 · 0 评论 -
UVA10892 最小公倍数素因子分解
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1833A pair of numbers has a unique LCM but a single number can be the LCM of more than one possible p原创 2014-05-13 21:05:26 · 1156 阅读 · 0 评论 -
NEFU 快速幂取模
http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=602description对于一个正整数n,求出它的欧拉函数值,其中1 input输入数据有多组,每组数据一行,有1个正整数为n。 out原创 2014-04-26 19:57:34 · 763 阅读 · 0 评论 -
UVA 11489 博弈思维题
http://vjudge.net/contest/view.action?cid=46225#problem/H Two players, S and T, are playing a game where they make alternate moves. S plays first. In this game, they start with an integer N. I原创 2014-05-14 16:23:24 · 770 阅读 · 0 评论 -
codeforces 230/B 素数变形计
http://codeforces.com/problemset/problem/230/BB. T-primestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output原创 2014-04-02 20:22:12 · 2820 阅读 · 0 评论 -
hdu 5366 排列组合
http://acm.hdu.edu.cn/showproblem.php?pid=5366Problem Description![](../../data/images/C613-1001-1.jpg)ZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want t原创 2015-08-09 13:54:20 · 1046 阅读 · 0 评论