Pagini recente » Cod sursa (job #2623993) | Cod sursa (job #2791979) | Cod sursa (job #2693699) | Cod sursa (job #125142) | Cod sursa (job #1016335)
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <assert.h>
using namespace std;
const string file = "combinari";
const string infile = file + ".in";
const string outfile = file + ".out";
const int INF = 0x3f3f3f3f;
int N, K;
int main()
{
fstream fin(infile.c_str(), ios::in);
fin >> N >> K;
fin.close();
fstream fout(outfile.c_str(), ios::out);
for(int i = (1 << N) - 1; i >= 0; i--)
{
int count = 0;
for(int j = 0; j <= N; j++)
{
if((1 << j) & i)
count++;
}
if(count == K)
{
for(int j = N - 1; j >= 0; j--)
{
if((1 << j) & i)
{
fout << N - j<< " ";
}
}
fout << "\n";
}
}
fout.close();
}