数学
文章平均质量分 67
HelloWorld10086
追随大神的脚步
展开
-
Uva 10499 The Land of Justice
Problem HThe Land of JusticeInput: standard inputOutput: standard outputTime Limit: 4 secondsIn the Land of Justice the selling price of everything is fixed all over the country. Nobody原创 2014-07-15 08:54:51 · 849 阅读 · 0 评论 -
Hdu-5053 the Sum of Cube(水题)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5053原创 2014-09-27 18:57:08 · 844 阅读 · 0 评论 -
Uva 107 The Cat in the Hat
The Cat in the Hat Background(An homage to Theodore Seuss Geisel) The Cat in the Hat is a nasty creature,But the striped hat he is wearing has a rather nifty feature. With one flic原创 2014-07-24 11:38:27 · 1009 阅读 · 0 评论 -
Uva 305 Joseph(数学+打表)
Joseph The Joseph's problem is notoriously known. For those who are not familiar withthe original problem:from amongn people, numbered 1, 2, ..., n, standing in circle every mthis going原创 2014-07-15 20:27:09 · 863 阅读 · 0 评论 -
HDU - 1008 Elevator(模拟题)
题目大意:先输入一个整数n原创 2014-11-02 15:33:22 · 715 阅读 · 0 评论 -
HDU - 2035 人见人爱A^B(数学)
解析:比较水的一道题,meic原创 2014-11-02 15:25:13 · 687 阅读 · 0 评论 -
HDU - 1061 Rightmost Digit(数学)
题目大意:要你求出N^N结果的个位数。jie原创 2014-11-02 15:35:42 · 545 阅读 · 0 评论 -
CodeForces 361B
题目大意:输入n,k,其中n代表有这个序列中的数字为1~n现在你要将这个数进行排序,使得其每个位置i上的数字Pi,gcd(Pi,i) > 1,则代表该位置上的数字漂亮,如果你能使得排序上的漂亮的位置的个数恰好为k,则输出该排序。如果不存在这个排序,则输出-1。解析:刚刚开始思路错了,想用暴力求解。后来听了yh同学的解答,才明白怎么做。如果两个数相邻则他们的最大公约数只可能为1,原创 2014-10-20 20:46:26 · 777 阅读 · 0 评论 -
UVA 11300 Spreading the Wealth(数学)
题目大意:圆桌旁坐着n个人,每人有一定数量的金币,金币总数能被n整除。每个人可以给他左右相邻的人一些金币,最终使得每个人的金币数目相等。你的任务是求出被转手的金币数量的最小值。比如,n=4,且4个人的金币数量分别为1,2,5,4时,只需转移4枚金币(第3个人给第2个人两枚金币,第2个人和第4个人分别给第1个人1枚金币)即可实现每人手中的金币数目相等。解析:原来金币数为a1,a2,.原创 2015-02-04 21:04:56 · 521 阅读 · 0 评论 -
UVA 106 Fermat vs. Pythagoras(勾股数)
题意: 给定一个整数N,你要写一个程序来计算出两个关于以下方程解的量: x^2 + y^2 = z^2 其中x,y和Z都限定为正整数且小于等于N。你要计算出所有满足x < y < z的三元组(x,y,z)的数量,并且使得x,y和z两两互质,即没有大于1的公因数。你还要计算出所有满足下面条件的p的数量:0 < p ≤ N,且p没有在所有这样的三元组中出现(并不限定为两两互质的三元组)。原创 2015-03-02 18:55:56 · 1082 阅读 · 0 评论 -
hdu 5207 Greatest Greatest Common Divisor(数论)
题意: 给你n个数的数组,挑两个数使得最大公约数最大,求最大的最大公约数。解析: 求出每个数的举因子,如果数组里有两个或两个以上能够整除这个因子,那么这些因子中,最大的因子就是ans。AC代码#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <cstdlib>using原创 2015-04-23 09:46:55 · 652 阅读 · 0 评论 -
HDU 5387 Clock(分数类+模拟)
题意: 给你一个格式为hh:mm:ss的时间,问:该时间时针与分针、时针与秒针、分针与秒针之间夹角的度数是多少。 若夹角度数不是整数,则输出最简分数形式A/B,即A与B互质。解析: 先计算出总的秒数 S=hh∗3600+mm∗60+ssS = hh * 3600 + mm * 60 + ss 因为秒钟每秒走1°, 所以当前时间,秒钟与12点的度数为 S%360S原创 2015-08-13 18:56:02 · 906 阅读 · 0 评论 -
hdu 5419 Victor and Toys(期望+差分前缀和)
题意: Victor有nn个玩具,编号为1到n,其中编号为ii的玩具有wiw_i点有趣值。 Victor对数字特别敏感,他在头脑中生成了m个区间,其中第i个区间为[li,ri][l_i,r_i],并随机选取了3个互不相同的数i,j,ki,j,k(1≤i<j<k≤m)(1\leq i < j < k \leq m),将所有满足 max(li,lj,lk)≤x≤min(ri,rj,rk)\原创 2015-08-23 10:19:35 · 683 阅读 · 0 评论 -
UVA - 10916 Factstone Benchmark(数学)
Problem B: Factstone BenchmarkAmtel has announced that it will release a 128-bit computer chip by 2010, a 256-bit computer by 2020, and so on, continuing its strategy of doubling the word-size eve原创 2014-08-28 20:42:13 · 798 阅读 · 0 评论 -
Uva 10025 The ? 1 ? 2 ? ... ? n = k problem
The ? 1 ? 2 ? ... ? n = k problem The problemGiven the following formula, one can set operators '+' or '-' instead of each '?', in order to obtain a given k? 1 ? 2 ? ... ? n = kFor e原创 2014-07-26 19:52:14 · 803 阅读 · 0 评论 -
Uva 621 Secret Research
Secret Research At a certain laboratory results of secret research are thoroughly encrypted. A result of a single experiment is stored as an information of its completion:`positive r原创 2014-07-22 09:06:15 · 856 阅读 · 0 评论 -
Uva 10790 How Many Points of Intersection?
How Many Points of Intersection? We have two rows. There are a dots on the toprow andb dots on the bottom row. We draw line segments connecting every dot on the top row with every dot on原创 2014-07-22 09:13:27 · 650 阅读 · 0 评论 -
Uva 591 Box of Bricks
Box of Bricks Little Bob likes playing with his box of bricks. He puts the bricks one upon another and buildsstacks of different height. ``Look, I've built a wall!'', he tells his older si原创 2014-07-22 09:10:19 · 821 阅读 · 0 评论 -
Uva 113 Power of Cryptography
Power of Cryptography BackgroundCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers modulo functions of these primes. Work in t原创 2014-07-22 08:53:29 · 706 阅读 · 0 评论 -
Uva 10161 Ant on a Chessboard
Problem A.Ant on a Chessboard Background One day, an ant called Alice came to an M*M chessboard. She wanted to go around all the grids. So she began to walk along the chessboard acc原创 2014-07-22 09:01:17 · 795 阅读 · 0 评论 -
Uva 10719 - Quotient Polynomial (多项式求解)
Problem BQuotient PolynomialTime Limit2 SecondsA polynomial of degree n can be expressed asIf k is any integer then we can write:Here q(x) is call原创 2014-07-24 14:54:54 · 917 阅读 · 0 评论 -
UVA 10014 Simple calculations
Simple calculations The ProblemThere is a sequence of n+2 elements a0, a1, , an+1 (n i 1000). It is known that ai = (ai1 + ai+1)/2 ci for each i=1, 2, ..., n. You are given a0, an原创 2014-07-24 15:22:19 · 694 阅读 · 0 评论 -
Uva 11044 Searching for Nessy
Searching for Nessy The Loch Ness Monsteris a mysterious and unidentified animal said to inhabit Loch Ness, a large deep freshwater loch near the city of Inverness in northern Scotland.原创 2014-07-24 14:51:46 · 694 阅读 · 0 评论 -
UVA 10970 Big Chocolate
Big ChocolateTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluDescriptionMohammad has recently visited Switzerland. As he loves his friends very much, he dec原创 2014-07-24 15:12:51 · 568 阅读 · 0 评论 -
Uva 846 Steps
Steps One steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to, or by one smaller than the length of the prev原创 2014-07-23 17:16:10 · 796 阅读 · 0 评论 -
Uva 573 The Snail
The Snail A snail is at the bottom of a 6-foot well and wants to climb to the top. The snail can climb 3 feet while the sun is up, but slides down 1 foot at night while sleeping. The sna原创 2014-07-24 15:36:22 · 734 阅读 · 0 评论 -
Uva-10177 - (2/3/4)-D Sqr/Rects/Cubes/Boxes?
Problem J(2/3/4)-D Sqr/Rects/Cubes/Boxes?Input: standard inputOutput: standard outputTime Limit: 2 seconds You can see a (4x4) grid below. Can you tell me how many squares and rectangles a原创 2014-07-24 15:04:45 · 606 阅读 · 0 评论 -
简说期望类问题的解法
近年的acm竞赛中,数学期望问题常有涉及,在以前也常让本人感到很头疼,近来突然开窍,掌握了基本的分析方法,希望对大家有帮助。写得浅薄,可能数学上不够严谨,只供理解。首先,来看下期望有啥基本的公式。对离散型随机变量x,其概率为p,有 E(x)=∑ipixiE(x)=\sum _{ i }^{ }{ { p }_{ i }{ x }_{ i } } 对随机变量A、B有 E(αA±βB)=αE(A)转载 2015-09-24 17:40:56 · 2720 阅读 · 0 评论