- 踩方格
0wa求救测试样例能过
- 2025-3-21 10:23:08 @
#include<iostream>
using namespace std;
int n;
long long a[21];
int main(){
cin>>n;
a[1]=3;
a[2]=7;
for(int i=3;i<=20;i++){
a[i]=2*a[i-2]+a[i-1];
}
// for(int i=1;i<=20;i++) cout<<a[i]<<' ';
cout<<a[n];
return 0;
}
/*
1 2 3
3 7 11
*/
1 comments
-
h_h LV 5 MOD @ 2025-3-21 15:09:39
/* 1 2 3 3 7 11 */这个思路很好啊,先枚举一下找规律,打草稿太粗心了,3不是11
- 1
Information
- ID
- 682
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- # Submissions
- 66
- Accepted
- 34
- Uploaded By