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 6 Sample output: no no yes no no no yes Time Limit: 2000/1000 MS (Java/Others)???? Memory Limit: 65536/32768 K (Java/Others) 题目分析： 能被3整除的整数的特点？ 还要看程序吗？ 如果两个数的和能被3整除，这两个数有什么特点？ 关于能否被3整除，这两个数一共有多少种组合？ #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; } /showproblem.php?pid=1061 Rightmost Digit Problem Description Given a positive integer N, you should output the most right digit of N^N. Input The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.Each test case contains a single positive integer N(1=N=1,000,000,000). Output For each test case, you should output the rightmost digit of N^N. Sample input: 2 3 4 Sample output: 7 6 数据规模? 很大 暴力方法? 该打 基本思路? 规律 #includestdio.hmain(){int T,i,a,digit;long n;scanf(%d,T); for(i=0;iT;i++){scanf(%ld,n);? a=n%10; if(a==0||a==1||a==6||a==9||a==5)? ? ? digit=a; else if(a==4)? ? ? digit=6; else if(a==2)? ? ? {if(n%4==0) digit=6;? ? ? else digit=4;} else if(a==3)? ? ? {if(n%4==1) digit=3;? ? ? else digit=7;} ?else if(a==7)? ? ? {if(n%4==1) digit=7;? ? ? else digit=3;} ?else? ? ? {if(n%4==0) digit=6;? ? ? else digit=4;} printf(%d\n,digit);}} 人见人爱A^B 求A^B的最后三位数表示的整数（1=A,B=10000） 2 3 12 6 8 984 HDOJ_2035 人见人爱A^B 最暴力的暴力？ 改进的暴力？ 还有规律么？ #includestdio.hint main(){? ? int a,b,i,a0,m;? ? while(scanf(%d%d,a,b)!=EOF (a!=0 || b!=0))? ? {? ? ? ? a0=a=a%1000;? ? ? ? for(i=2;i=b;i++)? ? ? ? {? ? ? ? ? ? m=a0*a;? ? ?