Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
25229 | LeoWang | Pell数列 | C++ | Accepted | 6 MS | 4172 KB | 320 | 2023-08-23 21:01:10 |
#include<bits/stdc++.h> using namespace std; int a[1000100]; int main() { int n,k; a[1]=1; a[2]=2; for(int i=3;i<=1000000;i++){ a[i]=(2*a[i-1]+a[i-2])%32767; } cin>>n; int b[n]={}; for(int i=0;i<n;i++){ cin>>b[i]; } for(int i=0;i<n;i++){ cout<<a[b[i]]<<endl; } return 0; }