ACM演示课件lecture老少皆宜数学题.pptVIP

ACM程序设计;第二讲;今天，;开胃羹（1）;开胃羹（2）;ACM数学题特点分析:;从首届“舜宇”杯说起;比赛背景;第一类;1004: Let the Balloon Rise;Problem Description;Input;Output;Sample Input 5 green red blue red red 3 pink orange pink 0 ?;题目评述：;1004题目分析：;1008: Elevator;Problem Description;Input;Output;Sample Input 1 2 3 2 3 1 0 ? Sample Output 17 41; 实际上，这是本次比赛最简单的一题，浙大、浙工大等当时训练水平相对较高的学校基本上10分钟之内解决该题，这也是一个没有算法的题目。 这种题目大家不会错过的…;不要分析了吧…;第二类;1009: FatMouse Trade;Problem Description;Input;Output;;题目特点：;1009算法分析：;第三类;小锤抠缝——;1021 Fibonacci Again ;Problem Description;Input Input consists of a sequence of lines, each containing an integer n. (n 1,000,000). ? Output Print the word yes if 3 divide evenly into F(n).Print the word no if not.;Sample Input 0 1 2 3 4 5 ?;题目分析：;Hdoj_1021程序清单：;回到正题——大锤搞定;1005: Number Sequence;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, and n, you are to calculate the value of f(n).;Input The input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 = A, B = 1000, 1 = n = 100,000,000). Three zeros signal the end of input and this test case is not to be processed. ? Output For each test case, print the value of f(n) on a single line.;Sample Input 1 1 3 1 2 10 0 0 0 ? Sample Output 2 5;题目特点：;Question:;拒绝暴力～;题目分析：;现在对这题有什么想法;第四类;HDOJ_1071 The Area ;Sample Input 2 5.000000 5.000000 0.000000 0.000000 10.000000 0.000000 10.000000 10.000000 1.000000 1.000000 14.000000 8.222222 ? Sample Output 33.33 40.69;第一眼：傻了…;再一看——;抛物线公式：y=ax^2+bx+c;该你思考了…;思考题：; Famous Harry Potter,who seemd to be a normal and poor boy,is actually a wizard.Everything changed when he had his birthday of ten years old.A huge man called Hagrid found Harry and lead him to a new world full of magic power. If youve read this story,you probably know that Harrys parents had left him a lot of gold coins.Hagrid lead Harry to Gringotts(the bank hold up by Goblins). And they stepped into the room which stored the fortune