数学
文章平均质量分 80
SF-_-
这个作者很懒,什么都没留下…
展开
-
POJ 1830 开关问题 解题报告(高斯消元法)
题目大意:中文题…… 解题报告:问我们有多少种可行方法。仔细想一下,如果矩阵有唯一解,那么只有一种可行方法。如果有一个变元,变元取0或者1对其他非变元的值会有影响,但仍然都是可行解。换句话说,变元有多少种,就有2的多少次方个解。简单算一下就知道了。 另外,给定的是开关的初状态和末状态,我们可以记录哪些状态是改变的,记为1。未改变的记为0。用高斯消元法计算变元数量即可。原创 2013-08-11 12:40:48 · 1488 阅读 · 0 评论 -
Uva 11401 - Triangle Counting 解题报告(计数)
Problem GTriangle CountingInput: Standard InputOutput: Standard Output You are given n rods of length 1, 2…, n. You have to pick any 3 of them & build a triangle. How many distinct triangl原创 2014-03-25 19:34:43 · 822 阅读 · 0 评论 -
Uva 1315 - Crazy tea party 解题报告(找规律)
1315 - Crazy tea partyTime limit: 3.000 secondsn participants of �crazy tea party� sit around the table. Each minute one pair of neighbors can change their places. Find the minimum time (in minu原创 2014-03-25 17:59:53 · 3496 阅读 · 0 评论 -
POJ 1730 Perfect Pth Powers 解题报告(因式分解)
Perfect Pth PowersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16348 Accepted: 3704DescriptionWe say that x is a perfect square if, for some intege原创 2014-04-21 15:52:47 · 1201 阅读 · 0 评论 -
Uva 12075 - Counting Triangles 解题报告
Triangles are polygons with three sides and strictly positive area. Lattice triangles are the triangles all whose vertexes have integer coordinates. In this problem you have to find the number of latt原创 2014-04-06 20:46:14 · 1340 阅读 · 0 评论 -
POJ 2795 (LA 3516) Exploring Pyramids 解题报告(递推)
Exploring PyramidsTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 1975 Accepted: 902Case Time Limit: 2000MSDescriptionArchaeologists have discov原创 2014-03-19 16:42:51 · 875 阅读 · 0 评论 -
POJ 2429 GCD & LCM Inverse 解题报告(大数因式分解)
GCD & LCM InverseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8910 Accepted: 1675DescriptionGiven two positive integers a and b, we can easily calc原创 2014-04-22 08:38:15 · 1043 阅读 · 0 评论 -
POJ 2689 Prime Distance 解题报告(素数筛)
Prime DistanceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11435 Accepted: 3064DescriptionThe branch of mathematics called number theory is about p原创 2014-04-21 18:50:50 · 774 阅读 · 0 评论 -
ZOJ 2562 More Divisors 解题报告(反素数)
More DivisorsTime Limit: 2 Seconds Memory Limit: 65536 KBEverybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians say that it is so because men have t原创 2014-04-21 20:46:26 · 707 阅读 · 0 评论 -
POJ 1284 Primitive Roots 解题报告(欧拉函数)
Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2714 Accepted: 1532DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is eq原创 2014-04-22 09:03:57 · 741 阅读 · 0 评论 -
POJ 2407 Relatives 解题报告(欧拉函数水题)
RelativesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10886 Accepted: 5235DescriptionGiven n, a positive integer, how many positive integers less t原创 2014-04-22 09:06:54 · 821 阅读 · 0 评论 -
Uva 11461 - Square Numbers 解题报告(水题)
ASquare NumbersInput: Standard InputOutput: Standard Output A square number is an integer number whose square root is also an integer. For example 1, 4, 81 are some squ原创 2014-03-25 16:17:40 · 1029 阅读 · 0 评论 -
Uva 10791 - Minimum Sum LCM 解题报告(因式分解)
Minimum Sum LCM LCM (Least Common Multiple) of a set of integers is defined as the minimum number, which is a multiple of all integers of that set. It is interesting to note that any p原创 2014-03-24 21:40:11 · 886 阅读 · 0 评论 -
Uva 10497 - Sweet Child Makes Trouble 解题报告(递推+大数)
Problem FSweet Child Makes TroubleInput: standard inputOutput: standard outputTime Limit: 8 secondsChildren are always sweet but they can sometimes make you feel bitter. In this problem, y原创 2014-04-03 17:45:49 · 1611 阅读 · 1 评论 -
Uva 580 - Critical Mass 解题报告(递推)
Critical Mass During the early stages of the Manhattan Project, the dangers of the new radioctive materials were not widely known. Vast new factory cities were built to manufacture urani原创 2014-04-03 21:14:46 · 1123 阅读 · 0 评论 -
Uva 10892 - LCM Cardinality 解题报告(因式分解)
Problem FLCM CardinalityInput: Standard InputOutput: Standard OutputTime Limit: 2 Seconds A pair of numbers has a unique LCM but a single number can be the LCM of more than one possible pa原创 2014-03-24 17:50:41 · 836 阅读 · 0 评论 -
Uva 10780 Again Prime? No time. 解题报告(数学)
Again Prime? No time.Input: standard inputOutput: standard outputTime Limit: 1 secondThe problem statement is very easy. Given a number n you have to determine the largest power of m, not ne原创 2014-03-24 14:42:33 · 727 阅读 · 0 评论 -
Uva 11752 The Super Powers 解题报告(数学)
The Super PowersWe all know the Super Powers of this world and how they manage to get advantages in political warfare or even in other sectors. But this is not a political platform and so we will原创 2014-03-24 17:54:38 · 763 阅读 · 0 评论 -
Uva 11076 Add Again 解题报告(组合数学)
Problem CAdd AgainInput: Standard InputOutput: Standard Output Summation of sequence of integers is always a common problem in Computer Science. Rather than computing blindly, some intellige原创 2014-03-24 18:22:10 · 991 阅读 · 0 评论 -
Uva 11609 - Teams 解题报告(组合数学)
Problem ETeamsInput: Standard InputOutput: Standard Output In a galaxy far far away there is an ancient game played among the planets. The specialty of the game is that there is no limitati原创 2014-03-24 18:43:07 · 976 阅读 · 0 评论 -
Uva 12050 (POJ 2402) - Palindrome Numbers 解题报告(数学)
A palindrome is a word, number, or phrase that reads the same forwards as backwards. For example, the name "anna" is a palindrome. Numbers can also be palindromes (e.g.151 or 753357). Additionally n原创 2014-03-24 20:45:21 · 1196 阅读 · 0 评论 -
Uva 11489 - Integer Game 解题报告(简单推理)
Integer GameTwo 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. In each move, a player removes one digit from the原创 2014-03-24 21:12:10 · 770 阅读 · 0 评论 -
Uva 1319 - Maximum 解题报告(数学)
1319 - MaximumTime limit: 3.000 secondsLet x1, x2,..., xm be real numbers satisfying the following conditions:a)-xi ;b)x1 + x2 +...+ xm = b * for some integers a and b (a > 0).Determine原创 2014-03-25 18:27:53 · 1093 阅读 · 0 评论 -
POJ 2478 Farey Sequence 解题报告(欧拉函数 筛求法)
Farey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11555 Accepted: 4492DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is th原创 2014-04-22 09:17:14 · 716 阅读 · 0 评论 -
POJ 3101 Astronomy 解题报告(大数乘法+分数最小公倍数)
题目大意:给出n的行星的周期,问n个行星在一条直线上的周期。 解题报告:懒……就直接用Java大数。当然,时间垫底import java.math.BigInteger;import java.util.Scanner;public class Main { static int[] a = new int[1010]; static Scanner cin = new S原创 2013-08-11 20:24:39 · 3226 阅读 · 0 评论 -
POJ 3233 Matrix Power Series 解题报告(子矩阵构造+矩阵快速幂)
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 14105 Accepted: 6078DescriptionGiven a n × n matrix A and a positive integer k,原创 2014-04-24 20:11:05 · 919 阅读 · 0 评论 -
POJ 1091 跳蚤 解题报告(2014携程第一场A题,聪明的猴子)(容斥原理)
/* * 大数模版 * 完美支持负数及加减法操作 * 支持乘法,大小比较,赋值 * 支持与long long类型的赋值比较 * SF-_- 14.04.01 */#include #include #include #include using namespace std;typedef long long LL;const int K原创 2014-04-11 00:04:09 · 1441 阅读 · 0 评论 -
POJ 2480 Longge's problem 解题报告(欧拉函数 + 积性函数)
Longge's problemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6914 Accepted: 2234DescriptionLongge is good at mathematics and he likes to think abou原创 2014-04-27 08:58:02 · 847 阅读 · 0 评论 -
UVa 1326 Jurassic Remains 解题报告(Meet-in-the-Middle)
1326 - Jurassic RemainsTime limit: 18.000 secondsPaleontologists in Siberia have recently found a number of fragments of Jurassic period dinosaur skeleton. The paleontologists have decided to fo原创 2014-07-16 15:04:47 · 983 阅读 · 0 评论 -
UVa 1121 Subsequence 解题报告(思维)
1326 - Jurassic RemainsTime limit: 18.000 seconds原创 2014-07-16 14:40:35 · 631 阅读 · 0 评论 -
BNU 34986 Football on Table 解题报告(暴力)
Football on TableTime Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainPrev Submit Status Statistics Discuss NextType: None原创 2014-05-24 08:11:50 · 850 阅读 · 0 评论 -
XTU 1203 A simple problem (2014 湖南湘潭邀请赛 A题)(数学)
A simple problemAccepted : 27 Submit : 296Time Limit : 15000 MS Memory Limit : 655360 KBProblem DescriptionThere is a simple problem. Given a number N. yo原创 2014-06-08 00:26:29 · 2048 阅读 · 0 评论 -
Uva 1388 Graveyard 解题报告(数学)
1388 - GraveyardTime limit: 3.000 seconds原创 2014-07-13 16:30:59 · 816 阅读 · 0 评论 -
Uva 11300 Spreading the Wealth(数学,中位数)
F. Spreading the Wealth ProblemA Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has con原创 2014-07-13 11:25:55 · 900 阅读 · 0 评论 -
HDU 4944 FSF’s game 解题报告(递推)
FSF’s gameTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 72 Accepted Submission(s): 30Problem DescriptionFSF has programmed a原创 2014-08-12 18:50:49 · 925 阅读 · 0 评论 -
POJ 1061 青蛙的约会 解题报告(模线性方程)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 85835 Accepted: 15080Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面原创 2014-03-14 18:56:05 · 923 阅读 · 0 评论 -
POJ 2115 C Looooops 解题报告(模线性方程)
题目大意:给定初值,步长,终值,计算机字长,问你循环多少次。 解题报告:使用拓展欧里几得解线性方程……算法导论上有详细的证明推导过程,在下也还没看完,看完再来补充哈。AC代码如下:#include #include #include using namespace std;#define LL long longLL gcd(LL a,LL b){ retur原创 2013-08-07 10:06:06 · 955 阅读 · 0 评论 -
POJ 3358 Period of an Infinite Binary Expansion 解题报告(欧拉函数+因式分解)
Period of an Infinite Binary ExpansionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2891 Accepted: 768DescriptionLet {x} = 0.a1a2a3... be the binary原创 2014-04-22 17:05:58 · 1242 阅读 · 0 评论 -
POJ 2992 Divisors 解题报告(素因子统计)
DivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9978 Accepted: 2933DescriptionYour task in this problem is to determine the number of divisors原创 2014-04-22 20:06:10 · 670 阅读 · 0 评论 -
HDU 3579 Hello Kiki 解题报告(中国剩余定理 非互质)
Hello KikiTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1835 Accepted Submission(s): 649Problem DescriptionOne day I was sh原创 2014-03-15 09:47:35 · 1093 阅读 · 0 评论