3
4
NO
YES
一.思路解析
<span style="font-size:14px;">这种问题很常见,一般都是有循环节的,而且都不大,人肉找会更加简单快捷一些</span>
<span style="font-size:14px;"></span>//
// main.cpp
// NEFU 115
//
// Created by 张嘉韬 on 16/7/23.
// Copyright © 2016年 张嘉韬. All rights reserved.
//
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int fbi[1000]={0};
void cul()//打印结果,寻找循环节
{
fbi[0]=fbi[1]=1;
cout<<"NO"<<endl;
cout<<"NO"<<endl;
for(int i=2;i<=1000;i++)
{
fbi[i]=fbi[i-1]+fbi[i-2];
if(fbi[i]%12==0) cout<<"YES"<<endl;
else if(fbi[i]%3==0) cout<<"3"<<endl;
else if(fbi[i]%4==0) cout<<"4"<<endl;
else cout<<"NO"<<endl;
}
}
int main(int argc, const char * argv[]) {
//cul();
int a[13]={0,1,1,1,3,1,4,1,3,1,1,1,2};
int n;
while(cin>>n)
{
n=n%12;
if(n==0) n=12;
if(a[n]==1) cout<<"NO"<<endl;
else if(a[n]==2) cout<<"YES"<<endl;
else cout<<a[n]<<endl;
}
return 0;
}
<br /><br />