c语言Fibonacci Again

VIP文章 wys____

于 2020-03-21 14:59:27 发布

阅读量339

点赞数

文章标签：程序人生

本文链接：https://blog.csdn.net/wys____/article/details/105010091

版权

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 Input0
1
2
3
4
5

Sample Outputno
no
yes
no
no
no

法一：
找规律，等差数列
是从第三个开始所以每四个为yes

#include <stdio.h>
int main()
{
   
 int n;
 while(~scanf("%d",&n))
 {
   
  if(n%4==2)
   printf("yes\n");
  else
   printf("no\n"

关注