数学
martinue
攻城狮
展开
-
二进制枚举(容斥原理)
The Sports Association of Bangladesh is in great problem with their latest lottery ‘Jodi laiga Jai’. Thereare so many participants this time that they cannot manage all the numbers. In an urgent mee原创 2015-08-02 10:09:43 · 1183 阅读 · 0 评论 -
hdu1299(数论题)
DescriptionDiophantus of Alexandria was an egypt mathematician living in Alexandria. He was one of the first mathematicians to study equations where variables were restricted to integral values. I原创 2015-08-02 10:18:35 · 691 阅读 · 0 评论 -
fzu1075(数论入门)
Description假设x是一个正整数,它的值不超过65535(即1Input输入的第一行含一个正整数k (1Output每个测试例对应一行输出,输出x的素数乘积表示式,式中的素数从小到大排列,两个素数之间用“*”表示乘法。Sample Input2119828Sample Output原创 2015-08-02 10:13:11 · 664 阅读 · 0 评论 -
hdu1452(数论入门)
DescriptionConsider a positive integer X,and let S be the sum of all positive integer divisors of 2004^X. Your job is to determine S modulo 29 (the rest of the division of S by 29). Take X = 1原创 2015-08-02 09:57:16 · 484 阅读 · 0 评论 -
acdream1084(数论入门)
Description寒假又快要到了,不过对于lzx来说,头疼的事又来了,因为众多的后宫都指望着能和lzx约会呢,lzx得安排好计划才行。假设lzx的后宫团有n个人,寒假共有m天,而每天只能跟一位后宫MM约会,并且由于后宫数量太过庞大了,而寒假的天数太少,所以lzx在寒假里不会与一个MM约会一次以上。现在lzx想要知道:寒假安排的方案数如果写成k进制,末位会有多少个0。原创 2015-08-02 09:53:55 · 428 阅读 · 0 评论 -
sgu154(数论入门)
Description154. Factorialtime limit per test: 0.25 sec. memory limit per test: 4096 KBinput: standard input output: standard outputYou task is to find minimal natural numbe原创 2015-08-02 09:51:19 · 602 阅读 · 0 评论 -
两个数的平方和
description给出一个整数N,将N表示为2个整数i j的平方和(i <= j),如果有多种表示,按照i的递增序输出。例如:N = 130,130 = 3^2 + 11^2 = 7^2 + 9^2 (注:3 11同11 3算1种)input一个数N(1 <= N <= 10^9)output原创 2015-04-23 00:38:27 · 2707 阅读 · 0 评论 -
Simple Calculation
description有一个包含n+2个元素的序列(a[0],a[1],…,a[n+1])。我们知道,对于任意的i(i=1,2,...,n),满足a[i]=(a[i-1]+a[i+1])/2-c[i]。给定a[0],a[n+1],c[0],c[1],...c[n],你的任务是写一个程序求出a[1]。input输入包含三行。第一行原创 2015-04-16 16:44:06 · 512 阅读 · 0 评论 -
欧拉函数模板
欧拉函数:设oula(i)为i对应的欧拉函数值,那么oula(i)=i*(1-1/p1)*(1-1/p2)*(1-1/p3)*……*(1-1/pn)(这是定理,我们也不需要去推导了。。大师推出来的结果比我们准确得多,会用就行)其中,p1,p2,p3,……,pn为i的素因子,就是将i素因子分解之后得到的所有因子。那么,得出代码:int oula(int n){原创 2016-01-18 17:16:15 · 377 阅读 · 0 评论 -
hdu5753(2016多校第三场,数学题)
Permutation BoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 593 Accepted Submission(s): 360Special JudgeProblem DescriptionTh原创 2016-07-28 11:23:00 · 515 阅读 · 0 评论 -
hdu5762(2016多校第三场,思维题)
Teacher BoTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1532 Accepted Submission(s): 593Problem DescriptionTeacher BoBo is a原创 2016-07-28 11:28:38 · 363 阅读 · 0 评论 -
poj3301(三分)
DescriptionAfter a day trip with his friend Dick, Harry noticed a strange pattern of tiny holes in the door of his SUV. The local American Tire store sells fiberglass patching material only in s原创 2015-08-04 11:36:16 · 474 阅读 · 0 评论 -
uva11237(数学题)
Every year there is the same problem at Halloween: Each neighbour is only willing to give a certaintotal number of sweets on that day, no matter how many children call on him, so it may happen thata原创 2015-08-05 20:06:43 · 281 阅读 · 0 评论 -
fzu1752(坑!!!)
DescriptionGiven A,B,C, You should quickly calculate the result of A^B mod C. (1InputThere are multiply testcases. Each testcase, there is one line contains three integers A, B and C原创 2015-08-05 20:17:52 · 677 阅读 · 0 评论 -
hdu3117(斐波那契数列,矩阵连乘)
DescriptionThe Fibonacci sequence is the sequence of numbers such that every element is equal to the sum of the two previous elements, except for the first two elements f0 and f1 which are respect原创 2015-08-13 17:06:43 · 1362 阅读 · 0 评论 -
hdu1588(斐波那契,矩阵连乘)
Problem DescriptionWithout expecting, Angel replied quickly.She says: "I'v heard that you'r a very clever boy. So if you wanna me be your GF, you should solve the problem called GF~. "How good a原创 2015-09-08 21:41:40 · 504 阅读 · 0 评论 -
hdu2814(斐波那契,费马小定理,快速幂)
Problem DescriptionIn mathematics, the Fibonacci numbers are a sequence of numbers named after Leonardo of Pisa, known as Fibonacci (a contraction of filius Bonaccio, "son of Bonaccio"). Fibonacci原创 2015-09-09 21:10:23 · 546 阅读 · 0 评论 -
hdu3054(斐波那契。。。。找规律)
Problem DescriptionWe know the Fibonacci SequenceF1=1,F2=1,F3=2,F4=3,F5=5,...Fx = Fx-1+Fx-2We want to know the Mth number which has K consecutive "0" at the end of Fx.For examp原创 2015-09-10 20:19:38 · 981 阅读 · 0 评论 -
hdu4099(trie树,斐波那契数列)
Problem DescriptionThe well-known Fibonacci sequence is defined as following: Here we regard n as the index of the Fibonacci number F(n). This sequence has been studied since the publica原创 2015-09-14 20:15:06 · 871 阅读 · 0 评论 -
hdu1796(二进制枚举)
Problem Description Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For examp原创 2015-09-15 19:17:54 · 806 阅读 · 0 评论 -
hdu1018(求n!的位数)
Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you ar原创 2015-09-15 19:54:49 · 3922 阅读 · 4 评论 -
cf(思维题,判断两个大数的大小的比较方法)
C. The Big Racetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVector Willman and Array Bolt are the two mo原创 2015-11-03 21:09:33 · 1257 阅读 · 0 评论 -
hdu2421(数学题)
DescriptionXiaoming has just come up with a new way for encryption, by calculating the key from a publicly viewable number in the following way: Let the public key N = A B, where 1 0, a 1, a 2,原创 2015-08-05 20:12:08 · 574 阅读 · 0 评论 -
最大公约数简洁代码
ll gcd(ll a,ll b){ return b? gcd(b,a%b):a;}简洁版本的总是容易忘。。。。。放这儿容易找~~原创 2015-11-03 18:35:24 · 1447 阅读 · 2 评论