找规律 UVALive 6506 Padovan Sequence

题目传送门

 /*
     找规律：看看前10项就能看出规律，打个表就行了。被lld坑了一次:(
 */
 #include <cstdio>
 #include <algorithm>
 #include <iostream>
 #include <cstring>
 #include <cmath>
 #include <string>
 #include <vector>
 #include <queue>
 #include <map>
 #include <set>
 #include <ctime>
 #include <cstdlib>
 using namespace std;

 typedef long long ll;
 const int MAXN = 1e2 + ;
 const int INF = 0x3f3f3f3f;
 ll dp[MAXN];

 void solve(void)
 {
     dp[] = dp[] = dp[] = ;
     dp[] = dp[] = ;    dp[] = ;
     for (int i=; i<=; ++i)
     {
         dp[i] = dp[i-] + dp[i-];
     }
 }

 int main(void)        //UVALive 6506 Padovan Sequence
 {
 //    freopen ("G.in", "r", stdin);

     solve ();
     int t;    scanf ("%d", &t);
     while (t--)
     {
         int n;    scanf ("%d", &n);
         printf ("%lld\n", dp[n]);
     }

     return ;
 }