~~~~~~~~~~数学
文章平均质量分 75
zzuspy
本人初学者~~
展开
-
置换问题
Arif in Dhaka (First Love Part 2)题目传送:UVA - 10294 - Arif in Dhaka (First Love Part 2)AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stac原创 2015-09-10 22:40:38 · 748 阅读 · 0 评论 -
UVA - 10717 - Mint (GCD + LCM)
题目传送:UVA - 10717思路:思路很明确,就是找出所有的四种硬币的组合,然后求出他们的最小公倍数,再去找出该最小公倍数的倍数中与desired length最接近的,昨晚不知道啥错误,一直WA,今天重写一下就过了AC代码:#include #include #include #include #include #include #include #原创 2015-04-29 10:03:57 · 705 阅读 · 0 评论 -
SGU - 106 - The equation (扩展欧几里得)
题目传送:106. The equation106. The equationtime limit per test: 0.25 sec. memory limit per test: 4096 KBThere is an equation ax + by + c = 0. Given a,b,c,x1,x2,y1,y2 you must det原创 2015-04-26 13:22:31 · 1249 阅读 · 0 评论 -
UVA - 10006 - Carmichael Numbers (快速幂+素数判断)
题目传送:UVA - 10006思路:就是快速幂暴力过去就行了,然后要注意点细节,就是快速幂的时候会爆int,然后就是先判断是否为素数,是素数就直接输出结果is normal,不然会超时AC代码:#include #include #include #include #include #include #include #include原创 2015-04-26 10:35:48 · 787 阅读 · 0 评论 -
UVA - 138 - Street Numbers (简单数论)
题目传送: UVA - 138思路:题意好难懂,看了半天,还是搜了题解才搞懂题意,真是给英语跪啦m在家的位置,而n是最后一个位置,直接输出前10组满足1~m-1的和 == m+1 ~ n的和,这是题意;然后通过题意可以得到n*(n+1)/2 - m - m*(m-1)/2 = m*(m-1)/2;化简可得2*m*m = n*(n+1);然后可以通原创 2015-04-26 00:19:03 · 721 阅读 · 0 评论 -
HDU - 1098 - Ignatius's puzzle (数论 - 费马小定理)
Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7012 Accepted Submission(s): 4847Problem DescriptionIgnatius原创 2015-03-13 23:21:44 · 797 阅读 · 0 评论 -
SGU - 154 - Factorial (数论)
154. Factorialtime limit per test: 0.25 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputYou task is to find minimal natural number N, so that N! c原创 2015-03-12 19:58:54 · 799 阅读 · 0 评论 -
SGU - 113 - Nearly prime numbers (素数)
113. Nearly prime numberstime limit per test: 0.25 sec. memory limit per test: 4096 KBNearly prime number is an integer positive number for which it is possible to find such primes P1 and P2原创 2015-03-12 10:17:18 · 965 阅读 · 0 评论 -
SGU - 184 - Patties
184. Pattiestime limit per test: 0.25 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputPetya is well-known with his famous cabbage patties. Petya's原创 2015-03-12 09:19:05 · 1124 阅读 · 2 评论 -
SGU - 169 - Numbers (找规律)
169. Numberstime limit per test: 0.25 sec.memory limit per test: 4096 KBinput: standardoutput: standardLet us call P(n) - the product of all digits of number n (in decimal nota原创 2015-03-20 19:11:03 · 622 阅读 · 0 评论 -
SGU - 222 - Little Rooks (组合数)
222. Little Rookstime limit per test: 0.25 sec.memory limit per test: 65536 KBinput: standardoutput: standardInspired by a "Little Bishops" problem, Petya now wants to solve pr原创 2015-03-16 23:29:31 · 738 阅读 · 0 评论 -
POJ - 3070 - Fibonacci (矩阵快速幂 + 斐波那契数列)
FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10096 Accepted: 7208DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn原创 2015-03-26 23:17:25 · 3954 阅读 · 0 评论 -
HDU - 1097 - A hard puzzle (快速幂取模)
A hard puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32633 Accepted Submission(s): 11672Problem Descriptionlcy gives原创 2015-03-13 22:44:32 · 671 阅读 · 0 评论 -
UVA - 10023 - Square root (模拟手算开方)
题目传送:UVA - 10023思路:模拟手算开方,不想用c/c++,感觉太麻烦了,就直接用的java里的BigInteger类来写的,写了好久......Java还是得看看书呀,手算开方参考的这里AC代码:import java.util.Scanner;import java.math.BigInteger;public class Main原创 2015-04-29 16:35:26 · 954 阅读 · 0 评论 -
UVA - 10820 - Send a Table (欧拉函数)
题目传送:UVA - 10820思路:找出1~n之间的所有互质的整数对,可以用欧拉函数做,先打出50000以内的欧拉函数的表,然后累加即可AC代码:#include #include #include #include #include #include #include #include #include #include #include #i原创 2015-05-02 20:52:40 · 658 阅读 · 0 评论 -
UVA - 10308 - Roads in the North (DFS)
题目传送:UVA - 10308思路:就是树的遍历,DFS即可,注意输入AC代码:#include #include #include #include #include #include #include #include #include #include #include #include #include #include #defi原创 2015-04-30 00:58:50 · 677 阅读 · 1 评论 -
概率与数学期望简单题
UVA - 11021 - Tribles题目传送:TriblesAC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <cctype>#include <cst原创 2015-08-12 13:09:34 · 2544 阅读 · 0 评论 -
莫比乌斯反演简单题
莫比乌斯函数这里简述一下莫比乌斯函数: 若d=1 那么μ(d)=1 若d=p1p2…pr (r个不同质数,且次数都为一)μ(d)=(-1)^r 其余 μ(d)=0莫比乌斯反演的性质性质一:(莫比乌斯反演公式)f(n)=∑(d|n)μ(d)F(n/d)f(n) = \sum(d|n) {\mu(d)F(n/d)} 性质二:μ(n)是积性函数性质三:设f是算术函数,它的和函数F(n)=原创 2015-08-10 21:11:24 · 3459 阅读 · 3 评论 -
数论 - 线性筛法与积性函数
首先以求1000000以内的素数为例来探讨筛法Eratosthenes筛法(埃拉托斯特尼筛法)时间复杂度:O(N*loglogN) 空间复杂度:O(N)代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#inclu原创 2015-08-07 22:01:08 · 1949 阅读 · 0 评论 -
POJ - 2115 - C Looooops (扩展欧几里得)
C LooooopsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19826 Accepted: 5299DescriptionA Compiler Mystery: We are given a C-language style for loop原创 2015-07-27 14:02:51 · 752 阅读 · 0 评论 -
POJ - 1061 - 青蛙的约会 (扩展欧几里得)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 96667 Accepted: 18091Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到原创 2015-07-27 13:12:38 · 718 阅读 · 0 评论 -
UVA - 11827 - Maximum GCD,10200 - Prime Time (数学)
两个暴力题。。题目传送:11827 Maximum GCDAC代码:#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define LL l原创 2015-07-27 15:22:39 · 838 阅读 · 0 评论 -
POJ - 2478 - Farey Sequence (欧拉函数)
题目传送:Farey SequenceFarey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13070 Accepted: 5119DescriptionThe Farey Sequence Fn for an原创 2015-07-27 16:16:00 · 505 阅读 · 0 评论 -
UVA - 571 - Jugs (数论 - 经典倒水问题)
题目传送:UVA - 571思路:A为空时就加满,不空就倒给B,B满了后就全倒掉,直到B的容量为n(参考)AC代码:#include #include #include #include #include #include #include #include #include #include #include #include #define原创 2015-04-28 22:22:30 · 940 阅读 · 0 评论 -
UVA - 11029 - Leading and Trailing (快速幂+公式变形)
题目传送: UVA - 11029思路:后三位可以直接快速幂取模,然后前三位可以有两种做法,一个是利用double,一个是利用公式法,具体看代码吧注意,后三位不足三位要补0,即用%03dAC代码①:#include #include #include #include #include #include #include #include #原创 2015-04-28 00:25:18 · 914 阅读 · 0 评论 -
UVA - 10229 - Modular Fibonacci (矩阵快速幂 + fibonacci)
题目传送:UVA - 10229思路:就是简单的矩阵快速幂求fibonacci数列,然后注意可能中间结果会爆int,因为2^19有50多万AC代码:#include #include #include #include #include #include #include #include #include #include #include原创 2015-04-30 19:20:36 · 1110 阅读 · 0 评论 -
UVA - 10375 - Choose and divide (组合数)
题目传送:UVA - 10375思路:用double存答案,不过要注意是边乘边除,这样不会爆double,还有记得乘的时候要把int转换成doubleAC代码:#include #include #include #include #include #include #include #include #include #include #inclu原创 2015-04-30 13:49:33 · 688 阅读 · 0 评论 -
UVA - 10183 - How Many Fibs? (斐波那契 + 高精度)
题目传送:UVA - 10183思路:高精度就可以了,因为10^100以内的斐波那契数不多,根据公式来看,估计就500多,开个1000的数组足够啦,实现的话是用的java,注意这里的斐波那契是从1开始的,我一开始是从0开始的,wa了一下AC代码:import java.util.Scanner;import java.math.BigInteger;public原创 2015-04-30 15:08:32 · 999 阅读 · 0 评论 -
SGU - 196 - Matrix Multiplication (矩阵乘法)
196. Matrix Multiplicationtime limit per test: 0.25 sec.memory limit per test: 65536 KBinput: standardoutput: standardLet us consider an undirected graph G = which has N verti原创 2015-03-19 19:52:51 · 805 阅读 · 0 评论 -
HDU - 5187 - zhx's contest (快速幂+快速乘)
zhx's contestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 448 Accepted Submission(s): 147Problem DescriptionAs one of the原创 2015-03-15 01:00:23 · 1760 阅读 · 0 评论 -
SGU - 105 - Div 3 (简单数学题!)
SGU - 105Div 3Time Limit: 250MS Memory Limit: 4096KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionThere is sequence 1, 12, 123, 1234, ..., 12345678原创 2014-12-11 16:41:52 · 1027 阅读 · 0 评论 -
SGU - 123 - The sum (简单数学!)
SGU - 123The sumTime Limit: 250MS Memory Limit: 4096KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionHere is your second problem, keep calm and solve原创 2014-12-11 16:55:32 · 775 阅读 · 0 评论 -
SGU - 102 - Coprimes (简单数论!)
SGU - 102CoprimesTime Limit: 250MS Memory Limit: 4096KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionFor given integer N (1N104) find amount of p原创 2014-12-11 16:30:33 · 895 阅读 · 0 评论 -
UVA - 264 - Count on Cantor (Cantor的数表!)
UVA - 264Count on CantorTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription Count on Cantor原创 2014-12-24 12:43:45 · 1169 阅读 · 0 评论 -
UVA - 575 - Skew Binary (简单数论!)
UVA - 575Skew BinaryTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription Skew Binary When原创 2014-12-07 20:46:42 · 731 阅读 · 0 评论 -
UVA - 568 - Just the Facts (简单数论!)
UVA - 568Just the FactsTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription Just the Facts原创 2014-12-07 21:44:22 · 1024 阅读 · 0 评论 -
HDU - 2501 - Tiling_easy version (简单递推关系!!)
Tiling_easy versionTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5516 Accepted Submission(s): 4347Problem Description有一个大小是原创 2014-12-22 23:49:24 · 672 阅读 · 0 评论 -
UVA - 11121 - Base -2 (负进制转换!)
UVA - 11121Base -2Time Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem DBase -2 Input: Standard InputOutput: S原创 2014-12-13 16:55:14 · 787 阅读 · 0 评论 -
UVA - 10014 - Simple calculations (经典的数学推导题!!)
UVA - 10014Simple calculationsTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescription Simple calculations原创 2014-12-19 00:36:13 · 1102 阅读 · 0 评论 -
HDU - 3003 - Pupu (快速幂取模!)
PupuTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1133 Accepted Submission(s): 445Problem DescriptionThere is an island cal原创 2014-12-14 11:29:11 · 1333 阅读 · 0 评论