Submission #15200

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
15200	2015-07-12T03:45:18 Z	gs14004	분배 (kriii3_Q)	C++14	0 / 24	0 ms	1736 KB

Q

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long lint;

lint bino[44][44];

int main(){
	int n, k;
	scanf("%d %d",&n,&k);
	int pt = 0;
	for(int i=0; i<(1<<k); i++){
		for(int j=0; j<(1<<(n-k-1)); j++){
			printf("%d %d ",i,((1<<n) - 1) ^ i);
		}
		puts("");
	}
}

Subtask #1

0.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1736 KB	Output is correct
2	Incorrect	0 ms	1736 KB	Output isn't correct
3	Halted	0 ms	0 KB	-