// 356K 0MS G++#include #include unsigned int m;unsigned int n;void getNum(unsigned int m, unsigned int n) { long long total = m + n; long chooseNum = m > n ? n : m; double cnm = 1
// 356K 16MS G++// 356K 0MS G++ add m ==0 check#include #include #include int m;int n;void getNum(unsigned int n, unsigned int m) { // long long total = n; m = m < (n -m) ? m :
//stupid method!!!!!!!!!!!!!!!//388K 360MS G++#include #include #include int C[33][33]; // C[n][m], choose m from n;void getCombination() { for (int n = 0; n <= 32; n++) { for (
Copyright © 2005-2025 51CTO.COM 版权所有 京ICP证060544号
