杭电ojC++--2062 Subset sequence AC代码

今天又是bug比较多的一天,建议大家多自己手动计算一下该题目,就能够深刻理解其中的计算规则

---

题目描述

Consider the aggregate An= { 1, 2, …, n }. For example, A1={1}, A3={1,2,3}. A subset sequence is defined as a array of a non-empty subset. Sort all the subset sequece of An in lexicography order. Your task is to find the m-th one.

输入

The input contains several test cases. Each test case consists of two numbers n and m ( 0< n<= 20, 0< m<= the total number of the subset sequence of An ).

输出

For each test case, you should output the m-th subset sequence of An in one line.

代码

推导过程请点击here或者HERE,都讲的很详细,这里就不再赘述

AC代码展示

#include <iostream>
using namespace std;
int main() {
	__int64 m;//全部化为__int64整型,可以避免溢出,不会导致程序WA
	__int64 n, i;
	__int64 s[22];
	__int64 g[21] = { 0 };
	__int64 t;
	for (i = 1; i <= 20; i++) g[i] = (long long)(i - 1) * g[i - 1] + 1;
	while (cin >> n >> m) {
		for (i = 0; i < 22; i++) s[i] = i;
		while ((n > 0) && (m > 0)) {
			t = m / g[n] + (m % g[n] > 0 ? 1 : 0);//此语句就是求出在第几组
			if (t > 0) {
				cout << s[t];
				for (i = t; i <= n; i++) s[i] = s[i + 1];
				m -= ((t - 1) * g[n] + 1);//减去前面(t-1)组的个数和该组最前面的一个序列
				if (m == 0) cout << endl;
				else cout << " ";
				//m == 0 ? cout << endl : cout << " ";
			}
			n--;
		}
	}
	return 0;
}

值得注意的一点

一定要将类型化为__int64,避免程序出错,因为n 稍大后m等相关的数据就会很大;读者可以和作者一样将所有的类型都变为__int64,这样会减少调试的情况.