roblem Link : http://acm.hdu.edu.cn/showproblem.PHP?pid=1021
Fibonacci Again
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36522 Accepted Submission(s): 17632
Print the word "no" if not.
0 1 2 3 4 5
no no yes no no no
余数里面的一条公式:(a+b)%3 = (a%3+b%3)%3
-------------------------------------------------------------------------------------------------------------
#include<stdio.h>
int f[1000001];
int main()
{
int n,i;
f[0]=7;
f[1]=11;
for(i=2;i<=1000000;i++)
f[i]=(f[i-1]%3+f[i-2]%3)%3;
while(scanf("%d",&n)!=EOF)
{
if(n<2)
printf("no\n");
else
{
if(f[n]==0)
printf("yes\n");
else
printf("no\n");
}
}
return 0;
}
---------------------------------------------------------------------------------------------------------------------
code 2:
这种题一般情况下会有规律。把前几个能被3整除的数的下标列出来一看,规律就出现了:2 6 10 14…,这就是一个等差数列嘛,这就好办了,an = a1 + (n-1)*4,那么an-a1肯定能被4整除。代码如下:
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
int n;
while (scanf("%d", &n) == 1)
{
if ((n-2)%4 == 0)
printf("yes\n");
else
printf("no\n");
}
return 0;
}
该解法如果说还可以优化的话,那只能把取余运算变为位运算了。
if ((n-2)&3)
printf("no\n");
else
printf("yes\n");
如果把数列前几项的值列出来,会发现数组中每8项构成一个循环。这也很好办。
代码如下:
#include <stdio.h>
#include <stdlib.h>
int a[8];
int main(void)
{
int n;
a[2] = a[6] = 1;
while (scanf("%d", &n) == 1)
printf("%s\n", a[n%8] == 0 ? "no" : "yes" );
return 0;
}
其实这个还可以优化,我们仔细观察可以看到这些满足条件的下标有一个特点:
N%8 == 2或者n%8==6
代码如下:
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
int n;
while (scanf("%d", &n) == 1)
{
if (n%8 == 2 || n%8 == 6)
printf("yes\n");
else
printf("no\n");
}
return 0;
}
转载自:http://blog.csdn.net/enjoying_science/article/details/38491343