组合数学
文章平均质量分 75
fyfcauc
这个作者很懒,什么都没留下…
展开
-
poj-3252
#include #include int C[33][33]; int begin; int end; const int MAX = 0x80000000; void getCombination() { for (int n = 0; n <= 32; n++) { for (int m = 0; m <= 32; m++) { if (m == 0) { // cho原创 2014-08-20 14:34:00 · 505 阅读 · 0 评论 -
poj-1850
// 160K 0MS C++ #include "stdio.h" #include "string.h" char str[12]; int C[32][32]; void getCombination() { for (int n = 0; n <= 32; n++) { for (int m = 0; m <= n; m++) {原创 2014-08-21 14:36:23 · 446 阅读 · 0 评论 -
poj-1942
// 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原创 2014-08-22 13:51:27 · 458 阅读 · 0 评论 -
poj-3286
//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 (原创 2014-08-22 22:59:01 · 470 阅读 · 0 评论 -
poj-2249
// 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 :原创 2014-08-23 22:10:11 · 510 阅读 · 0 评论 -
poj-2282
// 380K 32MS G++ #include #include #include long long appearTime1[10]; long long appearTime2[10]; void getAppearTime(int num, long long * appearArray) { appearArray[0] = 1; if (num == 0) { re原创 2014-08-23 18:50:10 · 471 阅读 · 0 评论 -
poj-1306
//356K 0MS G++ #include #include #include int m; int n; int originalM; int originalN; // void getNum(unsigned int n, unsigned int m) { // // long long total = n;原创 2014-09-10 20:57:40 · 466 阅读 · 0 评论