﻿NBUT 1013 又是斐波那契数列-Ocrosoft

# NBUT 1013 又是斐波那契数列

Time Limit:1000MS     Memory Limit:65535KB     64bit IO Format:

Description

Input

Output

Sample Input

```0
1
2
3
4
5
```

Sample Output

```no
no
yes
no
no
no
```

Solution

```#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <queue>
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cctype>
#include <climits>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
#define strend string::npos
#define ms(a) memset(a,0,sizeof(a))
#define  rep(a,v,b) for(int a=v;a<b;a++)
#define  repe(a,v,b) for(int a=v;a<=b;a++)
typedef long long LL;
int gcd(int a, int b)
{
if (!b)return a;
return gcd(b, a%b);
}
/*(◕‿‿◕)(◕‿‿◕) (◕‿‿◕) (◕‿‿◕) (◕‿‿◕) (◕‿‿◕)*/
/*(◕‿‿◕) 签订契约,成为马猴烧酒吧 (◕‿‿◕)*/
/*(◕‿‿◕)(◕‿‿◕) (◕‿‿◕) (◕‿‿◕) (◕‿‿◕) (◕‿‿◕)*/
using namespace std;
int main()
{
int n;
while(cin>>n)
{
if(n<2)printf("no\n");
else if(n==2)printf("yes\n");
else
{
n-=2;
if(n%4==0)printf("yes\n");
else printf("no\n");
}
}
return 0;
}
```