【HDU】 1021 Fibonacci Again

Fibonacci Again

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int f[1000005],n;

int main()
{
f[0]=1; f[1]=2;
int max1=1;
while (scanf("%d",&n)!=EOF)
{
if (max1<n)
{
for(int i=max1+1;i<=n;i++) f[i]=(f[i-1]+f[i-2])%3;
max1=n;
}
if (f
%3==0) printf("yes\n");
else printf("no\n");
}
return 0;
}