NYOJ 480 Fibonacci Again!

Fibonacci Again!

描述

求第n个斐波那契数是否是一个素数,n为整数 f[n]=f[n-1]+f[n-2] (2

输入

输入整数m,0

输出

如果f[m]是素数 则输出Yes,否则输出No,
每行输出占一行。

样例输入

2
3

样例输出

Yes
No

#include
    
     
int f[35]={0,3,7};
int prime(int x)
{
	int k;
	for(k=2;k
     
      
 
      
 
      
 
      

 
 
     
    

<script type="text/java script">BAIDU_CLB_fillSlot("771048");

点击复制链接 与好友分享! 回本站首页

<script> function copyToClipBoard(){ var clipBoardContent=document.title + '\r\n' + document.location; clipBoardContent+='\r\n'; window.clipboardData.setData("Text",clipBoardContent); alert("恭喜您！复制成功"); }

<script>window._bd_share_config={"common":{"bdSnsKey":{},"bdText":"","bdMini":"2","bdMiniList":false,"bdPic":"","bdStyle":"0","bdSize":"24"},"share":{}};with(document)0[(getElementsByTagName('head')[0]||body).appendChild(createElement('script')).src='http://bdimg.share.baidu.com/static/api/js/share.js?v=89860593.js?cdnversion='+~(-new Date()/36e5)];