Submission #15174

#TimeUsernameProblemLanguageResultExecution timeMemory
15174progressive분배 (kriii3_Q)C++14
24 / 24
9 ms1084 KiB
#include<cstdio>
int main()
{
	int K,N;
	scanf("%d%d",&N,&K);
	int tot=1<<K;
	int dist=1<<(N-K-1);
	int top=0;
	int bot=(1<<N)-1;
	for(int i=0;i<tot;i++)
	{
		for(int j=top;j<top+dist;j++)
			printf("%d ",j);
		for(int j=bot;j>bot-dist;j--)
			printf("%d ",j);
		puts("");
		top+=dist;
		bot-=dist;
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...