ZOJ(浙大)
文章平均质量分 77
hdweilao
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
ZOJ.2773 Triangular Sums【水~】 2015/09/24
Triangular SumsTime Limit: 2 Seconds Memory Limit: 65536 KB The nth Triangular number, T(n) = 1 + ... + n, is the sum of the first n integers. It is the number of points in a triangul原创 2015-09-24 22:17:01 · 392 阅读 · 0 评论 -
ZOJ.2818 Root of the Problem【开根号,水】 2015/09/22
Root of the ProblemTime Limit: 2 Seconds Memory Limit: 65536 KB Given positive integers B and N, find an integer A such that AN is as close as possible to B. (The result A is an approxi原创 2015-09-22 17:33:51 · 539 阅读 · 0 评论 -
ZOJ.1577 GCD & LCM【水,暴力】 2015/09/22
GCD & LCMTime Limit: 2 Seconds Memory Limit: 65536 KB Given x and y (2 <= x <= 100,000, 2 <= y <= 1,000,000), you are to count the number of p and q such that:1) p and q are posit原创 2015-09-22 22:38:36 · 497 阅读 · 0 评论 -
ZOJ.1938 Binomial Showdown【组合数】 2015/09/23
Binomial ShowdownTime Limit: 2 Seconds Memory Limit: 65536 KB In how many ways can you choose k elements out of n elements, not taking order into account?Write a program to comput原创 2015-09-23 16:40:58 · 409 阅读 · 0 评论 -
ZOJ.1526 Big Number【对数】 2015/09/22
Big NumberTime Limit: 10 Seconds Memory Limit: 32768 KB In many applications very large integers numbers are required. Some of these applications are using keys for secure transmissio原创 2015-09-22 20:41:26 · 450 阅读 · 0 评论 -
ZOJ.3437 Very Hard Problem【strtoll函数】 2015/09/23
Very Hard ProblemTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge It was in the ancient world. ZOJ, the greatest treasure hunter in the world has been lost in the fores原创 2015-09-23 18:46:57 · 504 阅读 · 0 评论 -
ZOJ.1871 Steps【水,”英语题“】 2015/09/22
StepsTime Limit: 2 Seconds Memory Limit: 65536 KB 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原创 2015-09-22 22:02:27 · 350 阅读 · 0 评论 -
ZOJ.2358 Sum of Factorials【略坑】 2015/10/12
Sum of FactorialsTime Limit: 2 Seconds Memory Limit: 65536 KB John von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1957, was a Hungarian-American mathematician who made important contributi原创 2015-10-12 09:50:00 · 433 阅读 · 0 评论 -
ZOJ.2679 Old Bill【水】 2015/10/12
Old BillTime Limit: 2 Seconds Memory Limit: 65536 KB Among grandfather��s papers a bill was found:72 turkeys $_679_The first and the last digits of the number that obviously repre原创 2015-10-12 22:03:47 · 633 阅读 · 0 评论 -
ZOJ.1597 Circular Area【两圆相交面积】 2015/09/23
Circular AreaTime Limit: 2 Seconds Memory Limit: 65536 KB Your task is to write a program, which, given two circles, calculates the area of their intersection with the accuracy of thr原创 2015-09-23 22:28:51 · 377 阅读 · 0 评论 -
ZOJ.2835 Magic Square【水】 2015/09/23
Magic SquareTime Limit: 2 Seconds Memory Limit: 65536 KB In recreational mathematics, a magic square of n-degree is an arrangement of n2 numbers, distinct integers, in a square, such th原创 2015-09-23 10:10:45 · 467 阅读 · 0 评论 -
ZOJ.1152 A Mathematical Curiosity 2015/10/12
A Mathematical CuriosityTime Limit: 2 Seconds Memory Limit: 65536 KB Given two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains mult原创 2015-10-12 22:19:50 · 522 阅读 · 0 评论 -
ZOJ.2481 Unique Ascending Array【子集】 2015/09/24
Unique Ascending ArrayTime Limit: 2 Seconds Memory Limit: 65536 KB Given an array of integers A[N], you are asked to decide the shortest array of integers B[M], such that the followin原创 2015-09-24 17:46:55 · 420 阅读 · 0 评论 -
ZOJ.2405 Specialized Four-Digit Numbers【水,暴力】 2015/09/24
Specialized Four-Digit NumbersTime Limit: 2 Seconds Memory Limit: 65536 KB Find and list all four-digit numbers in decimal notation that have the property that the sum of its four dig原创 2015-09-24 17:52:54 · 312 阅读 · 0 评论 -
ZOJ.3175 Number of Containers【数学问题】 2015/10/11
Number of ContainersTime Limit: 1 Second Memory Limit: 32768 KB For two integers m and k, k is said to be a container ofm if k is divisible by m. Given 2 positive integers n and m原创 2015-10-11 16:52:13 · 552 阅读 · 0 评论 -
ZOJ.3131 Digital Clock【打表】 2015/10/11
Digital ClockTime Limit: 1 Second Memory Limit: 32768 KB Digital clocks usually show the time in the form hh:mm:ss, where hh is a number between 00 and 23, and both mm and ss are nu原创 2015-10-11 21:40:47 · 413 阅读 · 0 评论 -
ZOJ.1797 Least Common Multiple【最小公倍数,水】 2015/09/22
Least Common MultipleTime Limit: 2 Seconds Memory Limit: 65536 KB The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by al原创 2015-09-22 17:08:45 · 396 阅读 · 0 评论 -
ZOJ.2729 Sum Up【暴力水~】 2015/09/29
Sum UpTime Limit: 2 Seconds Memory Limit: 65536 KB Vivid has stored a piece of private information, which consisted of a serial of integers in a secret number format. All the stored n原创 2015-09-29 22:46:30 · 367 阅读 · 0 评论 -
ZOJ.2540 Form a Square【水】 2015/10/01
Form a SquareTime Limit: 2 Seconds Memory Limit: 65536 KB Have you ever put up a tent on top of a mountain? The difficulty lies in finding the appropriate positions to fix the nails on原创 2015-10-01 06:13:45 · 497 阅读 · 0 评论 -
ZOJ.2277 The Gate to Freedom【数论-海伦】 2015/09/16
The Gate to FreedomTime Limit: 2 Seconds Memory Limit: 32768 KB BackgroundIt is dark at night.It is silence at night.It is she in the dark.It is she in the silence. Then a lig原创 2015-09-16 18:32:00 · 470 阅读 · 0 评论 -
ZOJ.2105 Number Sequence【数论-快速幂矩阵】 2015/09/16
Number SequenceTime Limit: 2 Seconds Memory Limit: 65536 KB A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, an原创 2015-09-16 18:48:29 · 361 阅读 · 0 评论 -
ZOJ.2723 Semi-Prime【数论】 2015/09/16
Semi-PrimeTime Limit: 2 Seconds Memory Limit: 65536 KB Prime Number Definition An integer greater than one is called a prime number if its only positive divisors (factors) are one and原创 2015-09-16 07:13:39 · 525 阅读 · 1 评论 -
ZOJ.2952 Find All M^N Please【数学】 2015/10/20
Find All M^N PleaseTime Limit: 2 Seconds Memory Limit: 65536 KB Recently, Joey has special interest in the positive numbers that could be represented asM ^ N (M to the power N), whe原创 2015-10-20 22:31:40 · 780 阅读 · 2 评论 -
ZOJ.1439 Area Ratio【三角形外接圆内切圆】 2015/10/20
Area RatioTime Limit: 2 Seconds Memory Limit: 65536 KB To make things easier, WishingBone decides to put this simple geometry problem at the beginning. Given a triangle, what is the r原创 2015-10-20 19:53:38 · 817 阅读 · 0 评论 -
ZOJ.2060 Fibonacci Again【数论-斐波那契】 2015/09/16
Fibonacci AgainTime Limit: 2 Seconds Memory Limit: 65536 KB There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2)InputInput consists of原创 2015-09-16 22:11:29 · 423 阅读 · 0 评论 -
ZOJ.3336 Friend Number II【有点水】 2015/10/09
Friend Number IITime Limit: 1 Second Memory Limit: 32768 KB Given a positive integer x, let S(x) denotes the sum of all x's digits. Two integersx and y are friend numbers if S(x)=S(原创 2015-10-09 17:25:21 · 521 阅读 · 0 评论 -
ZOJ.1951 Goldbach's Conjecture【素数】 2015/09/22
Goldbach's ConjectureTime Limit: 2 Seconds Memory Limit: 65536 KB In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the follo原创 2015-09-22 15:03:18 · 293 阅读 · 0 评论 -
ZOJ.3418 Binary Number【异或】 2015/09/22
Binary NumberTime Limit: 2 Seconds Memory Limit: 65536 KB For 2 non-negative integers x and y, f(x, y) is defined as the number of different bits in the binary format ofx and y. For原创 2015-09-22 15:51:07 · 299 阅读 · 0 评论 -
ZOJ.1730 Crazy Tea Party 2015/09/22
Crazy Tea PartyTime Limit: 2 Seconds Memory Limit: 65536 KB n participants of "crazy tea party" sit around the table. Each minute one pair of neighbors can change their places. Find the原创 2015-09-22 14:50:59 · 287 阅读 · 0 评论 -
ZOJ.2829 Beautiful Number【水】 2015/09/22
Beautiful NumberTime Limit: 2 Seconds Memory Limit: 65536 KB Mike is very lucky, as he has two beautiful numbers, 3 and 5. But he is so greedy that he wants infinite beautiful numbers.原创 2015-09-22 16:37:26 · 541 阅读 · 0 评论 -
ZOJ.2421 Recaman's Sequence【暴力打表】 2015/09/24
Recaman's SequenceTime Limit: 2 Seconds Memory Limit: 65536 KB The Recaman's sequence is defined by a0 = 0 ; for m > 0, am = am-1 - m if the rsulting am is positive and not already in原创 2015-09-24 22:09:34 · 375 阅读 · 0 评论
分享