NowCoder数列

题目：https://www.nowcoder.com/questionTerminal/0984adf1f55a4ba18dade28f1ab15003

 #include <iostream>
 #include <algorithm>
 using namespace std;

 const int maxn =  + ;
 int f[maxn];

 void db(){
     f[] =  % ;
     f[] =  % ;
     for (int i = ; i < maxn; i++){
         f[i] = (f[i - ] + f[i - ]) % ;
     }
 }

 int main(){
     db();
     int n;
     while (cin >> n){
         if (f[n] == ){
             cout << "Yes" << endl;
         }
         else{
             cout << "No" << endl;
         }
     }
 //    system("pause");
     return ;
 }