问题及代码:
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
Sample Output
no no yes no no no
/* *Copyright (c)2014,烟台大学计算机与控制工程学院 *All rights reserved. *文件名称:team.cpp *作 者:冷基栋 *完成日期:2015年2月16日 *版 本 号:v1.0 */ #include <iostream> using namespace std; int main() { int n; while (cin>>n) { if ((n-2)%4==0) cout<<"yes"<<endl; else cout<<"no"<<endl; } return 0; }
运行结果:
知识点总结:
合理余数进行整除运算 循环节
学习心得:
好好学习 天天向上
时间: 2024-10-10 09:54:11