HDU - 1133 - Buy the Ticket

最新推荐文章于 2024-08-29 16:57:08 发布

Spring.A

最新推荐文章于 2024-08-29 16:57:08 发布

阅读量88

点赞数 1

分类专栏：高精度文章标签：算法数据结构

本文链接：https://blog.csdn.net/weixin_60484917/article/details/127534589

版权

高精度专栏收录该内容

9 篇文章 0 订阅

订阅专栏

题目链接

点此跳转

代码

#include <bits/stdc++.h>

using namespace std;

int n, m;
vector<int> A;

vector<int> cal(vector<int> &A, int c) {
    vector<int> C;
    
    for (int i = 0, t = 0; i < A.size() || t > 0; i ++ ) {
        t += (i < A.size() ? A[i] : 0) * c;
        C.push_back(t % 10);
        t /= 10;
    }
    
    while(C.size() && C.back() == 0) C.pop_back();
    
    return C;
}

int main() {
    
    int T = 1;
    while (cin >> n >> m) {
        if (!n && !m) break;
        
        A.clear();
        A.push_back(1);
        if (n == 0 || m > n) A[0] = 0;
        else if (m == 0) {
            // n!
            for (int i = 1; i <= n; i ++ ) A = cal(A, i);
        } else {
            // (n + m)! * (n - 1 + m) / n + 1
            for (int i = 1; i <= n + m; i ++ ) {
                if (i != n + 1) A = cal(A, i);
            }
            A = cal(A, n - m + 1);
        }
        
        cout << "Test #" << T ++ << ":\n";
        
        reverse(A.begin(), A.end());
        for (auto t : A) cout << t;
        cout << endl;
    }
    
    return 0;
}