wust_cyl的博客

问题描述:iSea is tired of writing the story of Harry Potter, so, lucky you, solving the following problem is enough. InputThe first line contains a single integer T, indicating the number of t

Given an integer n, you have to findlcm(1, 2, 3, ..., n)lcm means least common multiple. For example lcm(2, 5, 4) = 20, lcm(3, 9) = 9, lcm(6, 8, 12) = 24.InputInput starts with an integer T (≤ 10000),...

Problem DescriptionOn the way to the next secret treasure hiding place, the mathematician discovered a cave unknown to the map. The mathematician entered the cave because it is there. Somewhere deep i...

问题描叙:We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (x i mod p) | 1 <= i <= p-1 } is equal to { 1, ..., p-1 }. For example, the consecuti...

DescriptionChinese people think of '8' as the lucky digit. Bob also likes digit '8'. Moreover, Bob has his own lucky number L. Now he wants to construct his luckiest number which is the minimum among ...

DescriptionLongge is good at mathematics and he likes to think about hard mathematical problems which will be solved by some graceful algorithms. Now a problem comes: Given an integer N(1 < N < ...

Description根据一些书上的记载，上帝的一次失败的创世经历是这样的：第一天， 上帝创造了一个世界的基本元素，称做“元”。第二天， 上帝创造了一个新的元素，称作“α”。“α”被定义为“元”构成的集合。容易发现，一共有两种不同的“α”。第三天， 上帝又创造了一个新的元素，称作“β”。“β”被定义为“α”构成的集合。容易发现，一共有四种不同的“β”。第四天， 上帝创造了新的元素“γ”，“γ”被定...

Description大富翁国因为通货膨胀，以及假钞泛滥，政府决定推出一项新的政策：现有钞票编号范围为1到N的阶乘，但是，政府只发行编号与M!互质的钞票。房地产第一大户沙拉公主决定预测一下大富翁国现在所有真钞票的数量。现在，请你帮助沙拉公主解决这个问题，由于可能张数非常大，你只需计算出对R取模后的答案即可。R是一个质数。Input第一行为两个整数T，R。R<=10^9+10，T<=10...

Problem DescriptionAssume that f(0) = 1 and 0^0=1. f(n) = (n%10)^f(n/10) for all n bigger than zero. Please calculate f(n)%m. (2 ≤ n , m ≤ 10^9, x^y means the y th power of x).InputThe first line cont...

Problem Descriptionan = X*an-1 + Y and Y mod (X-1) = 0.Your task is to calculate the smallest positive integer k that ak mod a0 = 0.InputEach line will contain only three integers X, Y, a0 ( 1 < X ...

题目:求1到n里面约数最多的数的约数个数分析:首先明白一个数的约数的求法。根据约数和定理:对于一个大于1正整数n可以分解质因数：n=p1^a1*p2^a2*p3^a3*…*pk^ak,则由约数个数定理可知n的正约数有(a₁+1)(a₂+1)(a₃+1)…(ak+1)个，暴力算出每一个数的约数的个数，超时！根据唯一分解定理，我们知道每一个数都可以用质因子的积表示，而约数的个数只与指数

问题描述:Professor Ben is an old stubborn man teaching mathematics in a university. He likes to puzzle his students with perplexing (sometimes boring) problems. Today his task is: for a given integer N, a...

问题描述:Any positive integer v can be written as p 1 a1*p 2 a2*...*p n an where p i is a prime number and ai ≥ 0. For example: 24 = 2 3*3 1. Pick any two prime numbers p 1 and p 2 where p 1 = p 2. Imagin...

                                                        GCD                                                             Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Othe...

问题描述:Today Pari and Arya are playing a game called Remainders.Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the value . There are n ancient numbers c1, c2, ....

中国剩余定理是用来求解一次同余方程组问题的重要方法，是数论的一个重要定理。对于同余方程组：     x=a1 mod n1     x=a2  mod n2     ......................     x=ak  mod nk我们就可以利用中国剩余定理来求解x!下面我们分俩种情况来求解：1  当n1  n2     nk俩俩互质时的情况：我们由方程组第一个式子可以得到：x1=n1...

问题描述:Consider 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 for an exampl...

 DescriptionMs. Iyo Kiffa-Australis has a balance and only two kinds of weights to measure a dose of medicine. For example, to measure 200mg of aspirin using 300mg weights and 700mg weights, she can p...

Problem DescriptionIn the year 3013, it has been 1000 years since the previous predicted rapture. However, the Maya will not play a joke any more and the Rapture finally comes in. Fortunately people h...

Problem DescriptionWe will consider a linear Diaphonic equation here and you are to find out whether the equation is solvable in non-negative integers or not.Easy, is not it?InputThere will be multipl...

Problem DescriptionGirls are clever and bright. In HDU every girl like math. Every girl like to solve math problem!Now tell you two nonnegative integer a and b. Find the nonnegative integer X and inte...

问题描述:Besides the ordinary Boy Friend and Girl Friend, here we define a more academic kind of friend: Prime Friend. We call a nonnegative integer A is the integer B’s Prime Friend when the sum of A and...

问题描述:By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activati...

首先我们先了解欧几里得算法求俩个数a,b的最大公约数gcd(a,b)根据贝祖定理得，gcd(a,b)=gcd(b,a-b),(a>b) 直到b为0时，a就是答案，但是这样时间复杂度有点高，因为a-b并不能保证一定大于b，所以我们又会做一次同样操作，即gcd(a,b)=gcd(b,a mod b)。时间复杂度log N代码如下：int gcd(int a,int b){ return...