C++博客-Feng-随笔分类-DP

hdu 2670 Girl Love Value

Going — Sun, 17 May 2009 13:28:00 GMT

#include<iostream>
#include<algorithm>
using namespace std;

typedef struct node
{
    int value;
    int bb;
}Node;

Node a[1001];
int dp[1001][1001];
int lvs[1001][1001];

bool cmp(Node a,Node b)
{
    if(a.bb != b.bb)
        return a.bb > b.bb;
    else
        return a.value > b.value;
}

int getMax(int a,int b)
{
    if(a > b)
        return a;
    else
        return b;
}

int main()
{
    int n,k;
    while(cin>>n>>k)
    {
        int i,j;
        for(i = 1;i <= n;i++)
        {
            scanf("%d",&a[i].value);
        }
        for(i = 1; i <= n;i++)
        {
            scanf("%d",&a[i].bb);
        }
        sort(a+1,a+n+1,cmp);
        for(i = 1;i <= n;i++)
            for(j = 1;j <= k;j++)
                lvs[i][j] = a[i].value - (j-1)*a[i].bb;//经过j天之后的数值
        int maxs = 0;
        for(i = 1; i <= n;i++)
        {
            if(a[i].value > maxs)
                maxs = a[i].value;
            dp[i][1] = maxs;//第一个初始化为数值最大的那个数
        }
        for(i = 2;i <= n;i++)
        {
            for(j = 2; j <= k && j <= i;j++)
            {
                if(i-1 >= j)
                    dp[i][j] = getMax(dp[i-1][j],dp[i-1][j-1] + lvs[i][j]);dp[i][j] = MAX(dp[i-1][j] , dp[i-1][j-1] + X)//dp[i][j] 表示前i个人中选j个的最优值
                else
                    dp[i][j] = dp[i-1][j-1]+lvs[i][j];
            }
        }
        cout<<dp[n][k]<<endl;
    }
    return 0;
}

Going 2009-05-17 21:28 发表评论

hdu 2372 El Dorado

Going — Thu, 14 May 2009 12:24:00 GMT

#include<iostream>
#include<cstdio>
using namespace std;

int a[101];
__int64 dp[101][101];//以第i个位置的元素结尾的长度为j的个数

int main()
{
    int n,k;
    while(cin>>n>>k)
    {
        int i,j,p;
        if(n == 0 && k == 0)
            break;
        memset(dp,0,sizeof(dp));
        for(i = 1 ;i <= n;i++)
        {
            scanf("%d",&a[i]);
            dp[i][1] = 1;
        }
        for(j = 2; j <= k;j++)//个数
            for(i = j;i <= n;i++)//比较
                for(p = j-1;p < i;p++)
                {
                    if(a[i] > a[p])
                        dp[i][j] += dp[p][j-1];
                }
        __int64 sum = 0;
        for(i =k;i <= n;i++ )
            sum += dp[i][k];
        printf("%I64d\n",sum);
    }
    return 0;
}

Going 2009-05-14 20:24 发表评论

zju 1520 Duty Free Shop

Going — Tue, 12 May 2009 11:41:00 GMT

#include<iostream>
using namespace std;

int a[2002];
int fige[2002];

int main()
{
    int m,h;
    while(cin>>m>>h)
    {
        if(m == 0 && h == 0)
            break;
        int n;
        cin>>n;
        int i;
        int sum = 0;
        int count;
        for(i = 1;i <= n;i++)
        {
            cin>>a[i];
            sum += a[i];
        }
        if(sum  > m + h)
        {
            cout<<"Impossible to distribute"<<endl;
            continue;
        }
        int j;
        for(i = 1; i <= n;i++)
        {
            memset(fige,false,sizeof(fige));
            int total = 0;
            count = 0;
            for(j = i ; j <= n;j++)
            {
                if(total + a[j] > m)
                    continue;
                fige[j] = true;
                total += a[j];
                count++;
            }
            if(sum - total <= h)
                break;
        }
        if(i > n)
            cout<<"Impossible to distribute"<<endl;
        else
        {
            cout<<count;
            for(i = 1; i <= n;i++)
            {
                if(fige[i])
                    cout<<" "<<i;
            }
            cout<<endl;
        }

    }
    return 0;
}

Going 2009-05-12 19:41 发表评论

zju 1503 One Person "The Price is Right"

Going — Mon, 11 May 2009 12:31:00 GMT

#include<iostream>
using namespace std;

int dp[31][31];

int main()
{
    int m,n;
    int cas = 1;
    while(cin>>m>>n)
    {
        if(m == 0 && n == 0)
            break;
        int i,j;
        for(i = 0 ; i <= m;i++)
            dp[i][0] = i;
        for(i = 0;i <= n;i++)
            dp[0][i] = 0;
        for(i = 1;i <= m;i++)
            for(j = 1;j <= n;j++)
            {
                dp[i][j] = dp[i-1][j-1] + 1 + dp[i-1][j];
            }
        cout<<"Case "<<cas++<<": "<<dp[m][n]<<endl;
    }
    return 0;
}

Going 2009-05-11 20:31 发表评论

hdu 1978 how many ways

Going — Fri, 08 May 2009 13:35:00 GMT

#include<iostream>
using namespace std;
int main()
{
    int dp[101][101],po[101][101];
    int i,j,k,p,t,n,m,x,y;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            {
                scanf("%d",&po[i][j]);
                dp[i][j]=0;
            }
        dp[1][1]=1;
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            {
                for(k=0;k<=po[i][j];k++)
                    for(p=0;p<=po[i][j]-k;p++)
                    {
                        if(p==0&&k==0)
                            continue;
                        x=k+i;
                        y=p+j;
                        if(x>n||y>m)
                            continue;
                        dp[x][y]+=dp[i][j];
                        if(dp[x][y]>10000)
                            dp[x][y]%=10000;
                    }
            }
        printf("%d\n",dp[n][m]);
    }
    return 1;
}

Going 2009-05-08 21:35 发表评论

zju 2765 Recursively Palindromic Partitions

Going — Fri, 08 May 2009 00:14:00 GMT

#include<iostream>
using namespace std;
int dp[1010];
int main()
{
    int i,j,k;
    dp[1]=1;
    for(i=2;i<1001;i++)
    {
        dp[i]=1;
        for(j=0;j<i;j++)
            if((i-j)%2==0)
                dp[i]+=dp[(i-j)/2];
    }
    scanf("%d",&k);
    for(j=1;j<=k;j++)
    {
        scanf("%d",&i);
        printf("%d %d\n",j,dp[i]);
    }
    return 0;
}

Going 2009-05-08 08:14 发表评论

zju 2852 Deck of Cards

Going — Wed, 06 May 2009 10:59:00 GMT

摘要: #includeusing namespace std;int dp[101][22][22][22];//dp[k][r][s][t]表示前k张card里面三堆分别为r点、s点、t点时的最优值int MAX(int x,int y){ if( x&g... 阅读全文

Going 2009-05-06 18:59 发表评论

zju 2975 Kinds of Fuwas

Going — Mon, 04 May 2009 06:23:00 GMT

#include<iostream>
#include<string>
#include<map>
using namespace std;

string maps[252];
map<char,int> M;
int a[5];//记录每一个福娃在两行相同的位子出现的次数

int main()
{
    int text;
    cin>>text;
    M['B'] = 0;//将福娃与编号绑定
    M['J'] = 1;
    M['H'] = 2;
    M['Y'] = 3;
    M['N'] = 4;
    while(text--)
    {
        int n,m;
        int i,j,k;
        cin>>n>>m;
        int ans = 0;
        for(i = 1;i <= n ;i++)
            cin>>maps[i];
        for(i = 1;i <= n;i++)//从第i行
            for(j = i+1; j <= n;j++)//到第j行
            {
                memset(a,0,sizeof(a));
                for(k = 0;k < m;k++)//相同的k列是否是相同的福娃
                {
                    if(maps[i][k] == maps[j][k])
                    {
                        ans = ans + a[M[maps[i][k]]];//记录总的个数，先加以前的个数
                        a[M[maps[i][k]]] ++;//再将自身加一，很巧妙
                    }
                }

            }
        cout<<ans<<endl;
    }
    return 0;
}

Going 2009-05-04 14:23 发表评论

zju 2972 Hurdles of 110m

Going — Sun, 03 May 2009 02:57:00 GMT

#include<iostream>
using namespace std;

int a[1111],b[111],c[111];
int cost[111],earn[111];
int dp[111][111];//记录到第i个栏还有能量j的最短时间

int getMin(int a,int b)
{
    if(a < b)
        return a;
    else
        return b;
}

int main()
{
    int text;
    cin>>text;
    while(text--)
    {
        int n,m;
        int i,j;
        cin>>n>>m;
        for(i = 0; i < n;i++)
        {
            cin>>a[i]>>b[i]>>c[i]>>cost[i]>>earn[i];
        }
        for(i = 0;i <111;i++)
            for(j = 0;j < 111;j++)
                dp[i][j] = 100000000;
        dp[0][m] = 0;
        for(i = 0;i < n;i++)//栏的个数
            for(j = 0;j <= m;j++)//剩余时间
            {
                if(j >= cost[i])//剩余时间大于最快速度花费的时间
                    dp[i+1][j-cost[i]] = getMin(dp[i+1][j-cost[i]],dp[i][j] + a[i]);
                if(j+earn[i] > m)//剩余时间加上最慢时间所给时间大于m
                    dp[i+1][m] = getMin(dp[i+1][m],dp[i][j] + c[i]);
                else//不大于m
                    dp[i+1][j+earn[i]] = getMin(dp[i+1][j+earn[i]],dp[i][j]+c[i]);
                dp[i+1][j] = getMin(dp[i+1][j],dp[i][j]+b[i]);//以正常速度跑步
            }
        int mins = 100000000;
        for(i = 0;i <= m;i++)//选择最小时间
        {
            if(mins > dp[n][i])
                mins = dp[n][i];
        }
        cout<<mins<<endl;
    }
    return 0;
}

Going 2009-05-03 10:57 发表评论

hdu 1078 FatMouse and Cheese

Going — Sat, 02 May 2009 10:49:00 GMT

#include<iostream>
using namespace std;

int a[101][101];
int dp[101][101];
int dir[4][2] = {{1,0},{-1,0},{0,-1},{0,1}};
int n,k;

int Dfs(int i,int j)//深搜方位
{
    int p,q,s,t,temp,m = 0;
    if(dp[i][j] > 0)
        return dp[i][j];
    for(p = 0;p < 4;p++)//搜四个方向
        for(q = 1;q <= k;q++)//一次可以跳1-k步
        {
            s = i + dir[p][0]*q;
            t = j + dir[p][1]*q;
            if(s>=1 && s<=n && t>=1 && t<= n && a[i][j] < a[s][t])
            {
                temp = Dfs(s,t);
                if(m < temp)//从周围找到最大的数
                {
                    m = temp;
                }
            }
        }
    dp[i][j] = m + a[i][j];//本身也要加上
    return dp[i][j];
}

int main()
{
    while(cin>>n>>k)
    {
        if(n == -1 && k == -1)
            break;
        int i,j;
        for(i = 1;i <= n;i++)
            for(j = 1; j <= n;j++)
            {
                scanf("%d",&a[i][j]);
                dp[i][j] = 0;
            }
        Dfs(1,1);
        cout<<dp[1][1]<<endl;
    }
    return 0;
}

Going 2009-05-02 18:49 发表评论

hdu 1500 Chopsticks

Going — Wed, 29 Apr 2009 06:39:00 GMT

#include<iostream>
#include<algorithm>
using namespace std;

int a[5005];
int dp[1001][5005];

bool cmp(int a,int b)
{
    return a > b;
}

int getMin(int a,int b)
{
    if(a < b)
        return a;
    else
        return b;
}

int main()
{
    int text;
    cin>>text;
    while(text--)
    {
        int k,n;
        int i,j;
        cin>>k>>n;
        for(i = 1;i <= n; i++ )
            cin>>a[i];
        k = k+8;
        sort(a+1,a+n+1,cmp);
        memset(dp,0,sizeof(dp));
        for(i = 1;i <= k;i++)
        {
            dp[i][3*i] = dp[i-1][3*i-2] + (a[i*3]-a[i*3-1])*(a[i*3]-a[i*3-1]);
            for(j = 3*i+1 ; j <= n ;j++)
            {
                dp[i][j] = getMin(dp[i][j-1],dp[i-1][j-2] + (a[j]-a[j-1])*(a[j]-a[j-1]));
            }
        }
        cout<<dp[k][n]<<endl;
    }
    return 0;
}

Going 2009-04-29 14:39 发表评论

hdu 1421 搬寝室

Going — Wed, 29 Apr 2009 05:06:00 GMT

#include<iostream>
#include<algorithm>
using namespace std;

int a[2005];
int dp[2005][1005];//从前i个物品中选取j对

bool cmp(int a,int b)
{
    return a < b;
}

int getMin(int a,int b)
{
    if(a < b)
        return a;
    else
        return b;
}

int main()
{
    int n,k;
    while(cin>>n>>k)
    {
        int i,j;
        for(i = 1;i <= n;i++)
        {
            cin>>a[i];
        }
        sort(a+1,a+n+1,cmp);
        for(i = 0 ; i <= n ;i++  )//物品
        {
            for(j = 1;j <= k;j++)//选取的对数
                dp[i][j] = 100000000;//一定要足够大
        }
        for(i = 0;i <= n;i++)
            dp[i][0] = 0;
        for(i = 2;i <= n;i++ )
            for(j = 1;2*j <= i && j <= k;j++)
            {
                dp[i][j] = getMin(dp[i-1][j],dp[i-2][j-1] + (a[i] - a[i-1])*(a[i] - a[i-1]));
            }
        cout<<dp[n][k]<<endl;
    }
    return 0;
}

Going 2009-04-29 13:06 发表评论

hdu 2670 Girl Love Value

Going — Tue, 28 Apr 2009 10:22:00 GMT

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

typedef struct node
{
    int love;
    int bb;
}Node;

Node a[1005];
int dp[1005][1005];

bool cmp(Node a,Node b)
{
    return a.bb > b.bb;
}

int getMax(int a,int b)
{
    if(a > b)
        return a;
    else
        return b;
}

int main()
{
    int n,k;
    while(scanf("%d%d",&n,&k) != EOF)
    {
        int i,j;
        for(i = 1; i <= n;i++)
            scanf("%d",&a[i].love);
        for(i = 1;i <= n;i++)
            scanf("%d",&a[i].bb);
        sort(a+1,a+n+1,cmp);
        int maxs = 0;
        for(i = 1;i <= n;i++)
        {
            if(maxs < a[i].love)
                maxs = a[i].love;
            dp[i][1] = maxs;
        }
        for(i = 1;i <= n;i++)
            for(j = 2;j <= i && j <= k; j++)
            {
                dp[i][j] = getMax(dp[i-1][j],dp[i-1][j-1] + a[i].love - (j-1)*a[i].bb);
            }
        printf("%d\n",dp[n][k]);
    }
    return 0;
}

Going 2009-04-28 18:22 发表评论

hdu 2059 龟兔赛跑

Going — Mon, 27 Apr 2009 12:21:00 GMT

#include<iostream>
using namespace std;

struct Node
{
    double time;
    double len;
};

int main()
{
    int n;
    double L;
    double c,T;
    double vr,vt1,vt2;
    while(cin>>L)
    {
        cin>>n>>c>>T;
        cin>>vr>>vt1>>vt2;
        int i,j;
        double a[105];
        Node dp[105];
        for(i = 1;i <= n;i++)
            cin>>a[i];
        double sum = L/vr;
        dp[0].time = 0.0;
        dp[0].len = c;
        a[0] = 0.0;
        a[n+1] = L;
        double dd;
        double t,t1,t2;
        double d,d1,d2;
        if(vt1<=vt2)
        {
            if( L/vt2 > sum)
            {
                cout<<"Good job,rabbit!"<<endl;
            }
            else
            {
                cout<<"What a pity rabbit!"<<endl;
            }
            continue;
        }
        for(i = 1;i <= n+1;i++)
        {
            if(a[i] <= c)
            {
                dp[i].time = a[i]/vt1;
                dp[i].len = c - a[i];
            }
            else
            {
                dp[i].time = c/vt1 + (a[i] - c)/vt2;
                dp[i].len = 0;
            }

            for(j = 1;j < i;j++)
            {
                dd = a[i] - a[j];
                if(dd <= dp[j].len)
                {
                    t = dd/vt1;
                    d = dp[j].len -dd;
                }
                else
                {
                    t1 = dp[j].len/vt1 + (dd-dp[j].len)/vt2 ;
                    d1 = 0;
                    if( c >= dd)
                    {
                        t2 = dd/vt1 + T;
                        d2 = c - dd ;
                    }
                    else
                    {
                        t2 =  c/vt1 + (dd - c)/vt2 +T;
                        d2 = 0;
                    }

                    if(t1 < t2)
                    {
                        t = t1 ;
                        d = d1;
                    }
                    else
                    {
                        t = t2;
                        d = d2;
                    }
                }
                if(dp[i].time > t + dp[j].time)
                {
                    dp[i].time = t + dp[j].time;
                    dp[i].len = d;
                }
            }//for(j = 1;j < i;j++)
        }
        if(dp[n+1].time > sum)
        {
            cout<<"Good job,rabbit!"<<endl;
        }
        else
        {
            cout<<"What a pity rabbit!"<<endl;
        }
    }
    return 0;
}

Going 2009-04-27 20:21 发表评论

hdu 1114 Piggy-Bank

Going — Sat, 25 Apr 2009 12:12:00 GMT

#include<iostream>
#include<cmath>
using namespace std;

typedef struct node
{
    int p;
    int w;
}Node;

Node a[10001];
int dp[20001];

int main()
{
    int text;
    cin>>text;
    while(text--)
    {
        int e,f;
        cin>>e>>f;
        int c = f-e;
        int n,ps,ws;
        int i,j;
        int k = 1;
        int h = 2;
        cin>>n;
        for(i = 1;i <= n;i++)
        {
            cin>>ps>>ws;
            a[k].p = ps;
            a[k].w = ws;
            while(1)
            {
                k++;
                if(a[k-1].p*2 > c)
                    break;
                else
                {
                    a[k].p = a[k-1].p * 2;
                    a[k].w = a[k-1].w * 2;
                }
            }
        }
        for(i = 0;i <= c;i++)
            dp[i] = 1000000;
        dp[0] = 0;//
        for(i = 1;i < k;i++)
        {
            for(j = a[i].w ;j <= c;j++)
            {
                if(dp[j] > dp[j-a[i].w] + a[i].p)
                    dp[j] = dp[j-a[i].w] + a[i].p;
            }
        }
        if(dp[c] == 1000000)
            cout<<"This is impossible."<<endl;
        else
            cout<<"The minimum amount of money in the piggy-bank is "<<dp[c]<<"."<<endl;
    }
    return 0;
}

Going 2009-04-25 20:12 发表评论

hdu 2602 Bone Collector

Going — Fri, 24 Apr 2009 06:53:00 GMT

#include<iostream>
using namespace std;

typedef struct node
{
    int val;
    int vol;
}Node;

int dp[1005][1005];
Node a[1005];

int main()
{
    int text;
    cin>>text;
    while(text--)
    {
        int n,c;
        cin>>n>>c;
        int i,j;
        for(i = 1;i <= n;i++)
            cin>>a[i].val;
        for(i = 1;i <= n;i++)
            cin>>a[i].vol;
        for(i = 0;i < a[1].vol;i++)
            dp[1][i] = 0;
        for(i = a[1].vol;i <= c;i++)
            dp[1][i] =a[1].val;
        for(i = 2;i <= n;i++)
            for(j = 0;j <= c;j++)
            {
                if(a[i].vol > j)
                    dp[i][j] = dp[i-1][j];
                else if(dp[i-1][j] > dp[i-1][j-a[i].vol] + a[i].val)
                    dp[i][j] = dp[i-1][j];
                else
                    dp[i][j] = dp[i-1][j-a[i].vol] + a[i].val;
            }
        cout<<dp[n][c]<<endl;
    }
    return 0;
}

Going 2009-04-24 14:53 发表评论

hdu 2191 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活

Going — Fri, 24 Apr 2009 06:30:00 GMT

#include<iostream>
using namespace std;

typedef struct node
{
    int price;
    int wei;
}Node;

Node a[3000];
int dp[3000][3000];

int main()
{
    int text;
    cin>>text;
    while(text--)
    {
        int n,m;
        cin>>n>>m;
        int num;
        int i,j;
        int k = 1;
        for(i = 0;i < m;i++)
        {
            cin>>a[k].price;
            cin>>a[k].wei;
            cin>>num;
            k++;
            for(j = 1;j < num;j++ )
            {
                a[k].price = a[k-1].price;
                a[k].wei = a[k-1].wei;
                k++;
            }
        }
        for(j = 0;j < a[1].price;j++)
            dp[1][j] = 0;
        for(j = a[1].price;j <= n;j++)
            dp[1][j] = a[1].wei;
        for(i = 2;i < k;i++ )
        {
            for(j = 0;j <= n;j++)
            {
                if(a[i].price > j)
                    dp[i][j] = dp[i-1][j];
                else
                {
                    if(dp[i-1][j] > dp[i-1][j-a[i].price]+a[i].wei)
                        dp[i][j] = dp[i-1][j];
                    else
                        dp[i][j] = dp[i-1][j-a[i].price]+a[i].wei;
                }
            }

        }
        cout<<dp[k-1][n]<<endl;
    }
    return 0;
}

Going 2009-04-24 14:30 发表评论

hdu 1159 Common Subsequence 最大公共子序列

Going — Fri, 24 Apr 2009 02:42:00 GMT

#include<iostream>
#include<string>
using namespace std;

int dp[10005][10005];

int main()
{
    string str1;
    string str2;
    while(cin>>str1>>str2)
    {
    //    memset(dp,0,sizeof(dp));
        int len1 = str1.length();
        int len2 = str2.length();
        int i,j;
        for(i = 0;i <= len1;i++)
            dp[i][0] = 0;
        for(j = 0;j <= len2;j++)
            dp[0][j] = 0;
        for(i = 1;i <= len1;i++)
            for(j = 1;j <= len2;j++)
            {
                if(str1[i-1] == str2[j-1])
                    dp[i][j] = dp[i-1][j -1] + 1;
                else if(dp[i][j-1] > dp[i-1][j])
                    dp[i][j] = dp[i][j-1];
                else
                    dp[i][j] = dp[i-1][j];
            }
        cout<<dp[len1][len2]<<endl;
    }
    return 0;
}

Going 2009-04-24 10:42 发表评论

hdu 1087 Super Jumping! Jumping! Jumping!

Going — Thu, 23 Apr 2009 12:08:00 GMT

#include<iostream>
using namespace std;

int dp[1005];////存放第i之前的最大的递增数列和
int a[1005];

int main()
{
    int n;
    while(cin>>n)
    {
        if(n == 0)
            break;
        int i,j;
        for(i = 0;i < n;i++)
        {
            cin>>a[i];
        }
        //dp[0] = 1;
        int sum = 0;
        int max;
        int result = 0;
        for(i = 0;i < n;i++)
        {
            max = 0;
            for(j = 0;j < i;j++)
            {
                if(a[i] > a[j])
                    if(dp[j] > max)
                    {
                        max = dp[j];
                    //    sum += a[j];
                    }
            }
            dp[i] = max + a[i];
            if(result < dp[i])
            {
                result = dp[i];
            }
        }
        cout<<result<<endl;
    }
    return 0;
}

Going 2009-04-23 20:08 发表评论

hdu 2512 一卡通大冒险

Going — Thu, 23 Apr 2009 06:17:00 GMT

#include<iostream>
using namespace std;

int dp[2003][2003];

int main()
{
     int text;
     cin>>text;
     while(text--)
     {
        int n;
        cin>>n;
        int sum = 0;
        int i,j;
        for(i = 1;i <= n; i++ )
        {
            dp[i][1] = 1;
            dp[i][i] = 1;
        }
        for(i = 3;i <= n;i++)
        {
            for(j = 2;j <= i-1;j++)
            {
                dp[i][j] = (dp[i-1][j-1] + dp[i-1][j] * j) %1000;
            }
        }
        for(i = 1;i <= n;i++)
            sum = (sum + dp[n][i])%1000;
        cout<<sum%1000<<endl;
     }
     return 0;
}

Going 2009-04-23 14:17 发表评论

ZOJ 3182 /HUTC 1045 Nine Interlinks

Going — Thu, 23 Apr 2009 00:26:00 GMT

#include<iostream>
#include<cmath>
using namespace std;

int dp[33];

int main()
{
    int text;
    cin>>text;
    dp[1] = 1;
    dp[2] = 2;
    dp[3] = 5;
    int i;
    int sum = 0;
    for(i = 4;i <30;i++)
    {
        sum = (int)pow(2.0,i-1);
        dp[i] = sum + dp[i -2]; //规律
    }
    while(text--)
    {
        int n;
        cin>>n;
        cout<<dp[n]<<endl;
    }
    return 0;
}

Going 2009-04-23 08:26 发表评论