Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
29586 | Jeremy | Pell数列 | C++ | Wrong Answer | 0 MS | 260 KB | 251 | 2023-10-31 20:34:40 |
#include<iostream> using namespace std; int n; int k; int p[1000379]; int main() { cin>>n; p[1]=1; p[2]=2; while(n--){ cin>>k; for(int i=3;i<=k;i++){ p[i]=(2*p[i]-1+p[i]-2)%32767; } cout<<p[k]<<endl; } return 0; }