Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
29590 | jiabokai | Pell数列 | C++ | Accepted | 0 MS | 252 KB | 273 | 2023-10-31 20:36:04 |
#include<iostream> #define mod 32767 using namespace std; int p[(int)1e6+10]; int n,k; int main(){ cin>>n; p[1]=1; p[2]=2; for(int i=1;i<=n;i++){ cin>>k; for(int i=3;i<=k;i++){ p[i]=(2*p[i-1]+p[i-2])%mod; } cout<<p[k]<<"\n"; } return 0; }