Fibonacci again cannot be underestimated.

# Include <stdio. h> # include <stdlib. h> # include <string. h >__ int64 f [1000110]; int main () {int I, n; while (scanf ("% i64d", & N )! = EOF) {memset (F, 0, sizeof (f); F [0] = 7, F [1] = 11; for (I = 2; I <= N; I ++) f [I] = f [I-1] + F [I-2]; If (! (F [N] % 3) printf ("Yes \ n"); else printf ("NO \ n");} return 0 ;} if the value is too large, _ int64 cannot be used. The above is always wa...

Find the rule.

Values of item 2, 6, 10, 14 can be divisible by 3, and the rule can be assumed that when the N-2 can be divisible by 4, the value of item N can be divisible by 3 ..

#include<stdio.h>#include<stdlib.h>#include<string.h>int main( ){ int i,n; while(scanf("%d",&n)!=EOF) {   if((n+2)%4==0)   printf("yes\n");   else   printf("no\n"); } return 0;}