递推
123~mutouren
这个作者很懒,什么都没留下…
展开
-
hdu 6957 Maximal submatrix
#include<bits/stdc++.h>using namespace std;const int M = 2005;int l[M][M],r[M][M],h[M][M],v[M][M];:int t,n,m,temp;int main (){ int ans; scanf("%d",&t); while(t--){ scanf("%d%d",&n,&m); for(int i = 1;i<=n;i++){ for(int j原创 2021-08-01 14:37:00 · 123 阅读 · 0 评论 -
hdu 4165 Pills
#include<bits/stdc++.h>using namespace std;typedef long long ll;ll a[35] = {1};int main (){ int n,i; while(scanf("%d",&n),n) { for(i = 1;i<=n;i++) a[i] = a[i-1]*4 - a[i-1]*6/(i+1);//符合卡特兰数 printf("%lld\n",a[n]); } return 0;}原创 2021-05-20 19:23:47 · 66 阅读 · 0 评论 -
hdu 2067小兔的棋盘
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main (){ int n,i,j,c = 0; ll ans[40][40]; while(scanf("%d",&n)==1) { if(n==-1) break; else for(i = 1;i<=n;i++) { ans[i][0] = 1; for(j = 1;j<i;j++)转载 2021-05-17 20:00:01 · 72 阅读 · 0 评论 -
hdu 2045 不容易系列之(3)—— LELE的RPG难题
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main (){ int n,i; ll a[55];a[1]=3; while(scanf("%d",&n)==1) { if(n>1) { a[n] = pow(2,n)+pow(-1,n)*2; printf("%lld\n",a[n]); } else printf("%d\n",a[1]原创 2021-05-17 19:25:25 · 77 阅读 · 0 评论 -
hdu 2047 阿牛的EOF牛肉串
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main (){ int n,i; ll e[45],o[45]; e[1] = 2;o[1] = 1; while(scanf("%d",&n)==1) { for(i = 2;i<=n;i++) { o[i] = e[i-1]; e[i] = 2*e[i-1]+2*o[i-1]; } printf(原创 2021-05-16 18:34:40 · 60 阅读 · 0 评论 -
hdu 2501Tiling_easy version
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main (){ int t,i,n; ll ans[35]; ans[1] = 1,ans[2] = 3; while(scanf("%d",&t)==1) { while(t--) { scanf("%d",&n); for(i = 3;i<=n;i++) ans[i] = 2*ans[i-2]+a原创 2021-05-16 18:13:26 · 106 阅读 · 0 评论 -
hdu 2190 悼念512汶川大地震遇难同胞——重建希望小学
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main (){ int c,i,n; ll ans[35]; ans[1] = 1,ans[2] = 3; while(scanf("%d",&c)==1) { while(c--) { scanf("%d",&n); for(i = 3;i<=n;i++) ans[i] = 2*ans[i-2]+a原创 2021-05-16 18:05:08 · 77 阅读 · 0 评论 -
hdu 2050 折线分割平面
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main (){ int n,i,c; ll a[10010]; a[1] = 2; while(scanf("%d",&c)==1) { while(c--) { scanf("%d",&n); for(i = 2;i<=n;i++) a[i] = a[i-1]+4原创 2021-05-16 17:02:10 · 85 阅读 · 0 评论 -
hdu 2046 骨牌铺方格
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main (){ int n,i; ll ans[55]; ans[1] = 1,ans[2] = 2; while(scanf("%d",&n)==1) { for(i = 3;i<=n;i++) ans[i] = ans[i-1]+ans[i-2]; printf("%lld\n",ans[n]); } ret原创 2021-05-16 16:48:37 · 47 阅读 · 0 评论 -
hdu 2044 一只小蜜蜂
#include<bits/stdc++.h>using namespace std;typedef long long ll;int main (){ int n,i,a,b; ll ans[55]; ans[1] = 1,ans[2] = 2; for(i = 3;i<=50;i++) ans[i] = ans[i-1]+ans[i-2]; scanf("%d",&n); while(n--) { scanf("%d%d",&a,&b)原创 2021-05-16 16:34:22 · 45 阅读 · 0 评论 -
hdu 2041 超级楼梯
#include<bits/stdc++.h>using namespace std;int main (){ int n,m,i; int a[45];a[1] = 1,a[2] = 1; scanf("%d",&n); while(n--) { scanf("%d",&m); for(i = 3;i<=m;i++) a[i] = a[i-1]+a[i-2]; printf("%d\n",a[m]); } r原创 2021-05-16 11:13:38 · 79 阅读 · 0 评论