1892957_ac_46ms_128k.cc

北大大牛代码 1240道题的原代码 超级权威

# include <iostream>
# include <algorithm>
using namespace std;

int c[11][11] = {{1},{1,1},{1,2,1},{1,3,3,1},{1,4,6,4,1},{1,5,10,10,5,1},{1,6,15,20,15,6,1},{1,7,21,35,35,21,7,1},{1,8,28,56,70,56,28,8,1},{1,9,36,84,126,126,84,36,9,1},{1,10,45,120,210,252,210,120,45,10,1}};
int main()
{
 int  n, i;
 int A[11];
 long m, sum;

 scanf("%d%ld",&n,&sum);
 
 for(i = 0; i < n; i++)
	 A[i] = 1+i;
    while(1)
	 {
            m = 0;
	   for(i = 0; i < n; i++)
	    m+=c[n-1][i]*A[i];
	   if(m==sum) break;
            next_permutation(A,A+n);
	 }
	 for(i = 0; i < n-1; i++)
		 printf("%d ",A[i]);
	 printf("%d\n",A[n-1]);
          return 1;
}