Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
180442 | A班匡嘉阳 | 组合数的高精度算法 | C++ | No Test Data | 0 | 0 MS | 0 KB | 358 | 2024-08-21 13:36:25 |
#include <bits/stdc++.h> using namespace std; long long int jc(int n){ long long int t = 1; for (int i=1;i<=n;i++){ t *= i; } return t; } long long int ct(int n,int m){ return (jc(n) / (jc(m) * jc(n- m))); } int main(){ int n,m; cin >> n >> m; cout << ct(n + m - 2,m - 1); return 0; }