Pagini recente » Cod sursa (job #1318733) | Cod sursa (job #2235986) | Cod sursa (job #771710) | Cod sursa (job #1863559) | Cod sursa (job #1223029)
/*
generare toate combinarile 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;
float start;
//other functions
void generate(VI elem,int lenght)
{
if (lenght == 0)
{
string a;
FOR(i,1, k)
{
a = a + " " + to_string(elem[i]);
}
g << a.substr(1) <<"\n";
return;
}
FOR(i, elem.back()+1, n)
{
VI elem2 = elem;
elem2.push_back(i);
generate(elem2, lenght - 1);
}
}
void reading()
{
f >> n >> k;
f.close();
}
void solving()
{
VI aux;
aux.push_back(0);
generate(aux,k);
}
void write_data()
{
}
int main()
{
reading();
solving();
write_data();
}