一本通OJ1202 Pell数列（递推算法）

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>

#define M 32767

int main()
{
	int n;
	int* Test;
	scanf("%d", &n);
	Test = (int*)malloc((n + 1) * sizeof(int));
	int i,Max=0;
	for (i = 0; i < n; i++)
	{
		scanf("%d", Test + i);
		if (Test[i] > Max) Max = Test[i];
	}
	int* PellMod;
	PellMod = (int*)malloc((Max+1)* sizeof(int));
	PellMod[1] = 1;
	PellMod[2] = 2;
	for (i = 3; i <= Max; i++)
	{
		PellMod[i] = ((2*PellMod[i-1]) % M + PellMod[i - 2]) % M;
	}
	for (i = 0; i < n; i++)
	{
		printf("%d\n", PellMod[Test[i]]);
	}
	free(Test);
	free(PellMod);
	return 0;
}