ACM第三次课件.pptVIP

* * 第一类 技 巧 型 * * 1021 Fibonacci Again * * Problem Description There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n=2). * * 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 ? Sample Output no no yes no no no * * * * 题目分析： 判断某一项是否能被3 整除 是否需要把某一项的值求出来，进行整除判断？ 能被3整除的整数的特点？ 关于能否被3整除，这样的项在排列上是否有规律？ （找出规律） 第0项除以3余1，第1项除以3余2，第2项整除， 第3项除以3余2，第4项除以3余2，第5项除以3余1， 第6项整除，第7项除以3余1，第8项除以3余1， 第9项除以3余2，第7项整除……. * * 题目分析： 能被3整除的整数的特点？ 如果两个数的和能被3整除，这两个数有什么特点？ 关于能否被3整除，这两个数一共有多少种组合？ * * Hdoj_1021程序清单： #includestdio.h int main() { long n; while(scanf(%ld,n) != EOF) if (n%8==2 || n%8==6) printf(yes\n); else printf(no\n); return 0; } * * #include stdio.h int main() { int n; while(scanf(%d, n) !=EOF) { if((n - 2) % 4) printf(no\n); else printf(yes\n); } return 0; } * * #includestdio.h int main() { int F1,F2,i,t; long n; while(scanf(%ld,n)!=EOF) { F1=1; F2=2; for(i=2;i=n;i++) { t=F2; F2=(F1+F2)%3; F1=t; } if(n2) printf(no\n); else if(F2==0) printf(yes\n); else printf(no\n); } return 0; } * * 第二类 基 本 型 * * 1009: FatMouse Trade * * Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J[i]* a% pounds of JavaBeans if he pays F[i]* a% pounds of cat food. Here a is a real number. Now he is assigning this homework to you: tell him the maximum amount of JavaBeans he can obtain. * * Input The input consists of multiple t