• test001


    #include <iostream>
    
    using namespace std;
    
    long long dp[36][36];
    int main()
    {
        
        int num;
        
        int i = 1;
        for (int i = 0; i <= 35; i++)
            dp[i][0] = 1;
        for (int i = 1; i <= 35; i++)
        {
            for (int j = 0; j <= i; j++)
            {
                if (i == j)
                    dp[i][j] = dp[i][j - 1];
                else
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        while (cin >> num && num != -1)
        {
            printf("%d %d %I64d
    ", i++, num, 2 * dp[num][num]);
            
        }
    }
  • 相关阅读:
    腾讯安全上海游戏部门笔试题
    2017
    2016
    2015
    2014
    2013
    2012
    2011
    2010
    2009
  • 原文地址:https://www.cnblogs.com/theskulls/p/6057124.html
Copyright © 2020-2023  润新知