Pagini recente » Cod sursa (job #3214511) | Cod sursa (job #1029900) | Cod sursa (job #3242362)
//package submultimi;
import java.io.*;
import java.util.StringTokenizer;
public class Main {
static final String INPUT_FILE = "submultimi.in";
static final String OUTPUT_FILE = "submultimi.out";
public static class TokenizedReader {
private final BufferedReader reader;
private StringTokenizer tokenizer;
TokenizedReader(String filePath) throws FileNotFoundException {
reader = new BufferedReader(new FileReader(filePath));
}
private String nextToken() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
private int nextInt() {
return Integer.parseInt(nextToken());
}
public void close() throws IOException {
reader.close();
}
}
public static void main(String[] args) throws IOException {
TokenizedReader reader = new TokenizedReader(INPUT_FILE);
PrintWriter writer = new PrintWriter(OUTPUT_FILE);
solve(reader, writer);
reader.close();
writer.flush();
writer.close();
}
public static void solve(TokenizedReader reader,
PrintWriter writer) {
int n = reader.nextInt();
if (n == 0) {
return;
}
int max = (1 << n) - 1;
for (int i = 1; i <= max; ++i) {
int mask = 1;
int bitIdx = 0;
while (mask <= i) {
if ((mask & i) > 0) {
writer.print((bitIdx + 1) + " ");
}
++bitIdx;
mask <<= 1;
}
writer.println();
writer.flush();
}
}
}