Submission #12093

#	Time	Username	Problem	Language	Result	Execution time	Memory
12093		kriii	배낭 문제 준비하기 (GA9_invknapsack)	C++14	5 / 100	0 ms	1240 KiB

invknapsack

#include <stdio.h>
#include <vector>

unsigned long long comb[64][64];

int main()
{
	long long t;

	scanf ("%lld",&t);
	if (t <= 300){
		printf ("%lld 1\n",t);
		for (int i=0;i<t;i++) printf ("%d ",1);
	}
	else{
		for (int i=0;i<64;i++){
			comb[i][0] = comb[i][i] = 1;
			for (int j=1;j<i;j++) comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
		}

		std::vector<int> ans;
		for (int i=0;i<63;i++) ans.push_back(1);
		for (int j=31;j>=0;j--) while (t >= comb[31][j]){
			ans.push_back(300-j);
			t -= comb[31][j];
		}
		printf ("%u %d\n",ans.size(),300);
		for (auto x : ans) printf ("%d ",x);
	}

	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 13
• Subtask 3: 0 / 17
• Subtask 4: 0 / 29
• Subtask 5: 0 / 36