Pagini recente » Cod sursa (job #1281111) | Cod sursa (job #976119) | Cod sursa (job #301801) | Cod sursa (job #2590479) | Cod sursa (job #1183823)
/*
combinari infoarena
*/
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define Y second
#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))
#define IN_FILE "combinari.in"
#define OUT_FILE "combinari.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);
//variables
int n, k;
set<string> x;
//other functions
void rec(string s, set<int> cifre,int pos)
{
if (pos > k)
{
x.insert(s);
return;
}
int start = 1;
if (pos > 1)
{
start = s[pos - 2]-48 ;
}
FOR(i, start, n)
{
if (cifre.count(i) == 0)
{
char li = i + 48;
set < int >aux= cifre;
aux.insert(i);
rec(s+li,aux,pos+1);
}
}
}
void reading()
{
f >> n >> k;
f.close();
}
void solving()
{
set<int> aux;
rec("",aux,1);
}
void write_data()
{
for (std::set<string>::iterator it = x.begin(); it != x.end(); ++it)
{
string text = *it;
FORN(i, text.length())
{
g << text[i];
if (i < text.length() - 1)
{
g << " ";
}
}
g << "\n";
}
}
int main()
{
reading();
solving();
write_data();
}