035:Pell数列

2
1
8

1
408

#include <cstdio>
#include <iostream>

using namespace std;

int pell(int n)
{
    int a=1, b=2, c;
    if (n==1)
        return a;
    if (n==2)
        return b;
    while (n>2)
    {
        c= (2*b+a)%32767;
        a=b;
        b=c;
        n--;
    }
    return b;
}

int main()
{
    int n, m;
    cin >> n;
    for (int i=0;i<n;i++)
    {
        cin >> m;
        cout << pell(m) <<endl;
    }
    return 0;
}