Cod sursa(job #1986300)
| Utilizator | Data | 28 mai 2017 13:56:48 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#define ll long long
#define pb push_back
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int NLIM = 18 + 10;
int N, K;
int v[NLIM];
void f( int p )
{
if( p == K + 1 )
{
for( int i = 1; i <= K; ++i )
fout << v[i] << " ";
fout << "\n";
}
for( int i = v[p - 1] + 1; i <= N; ++i )
{
v[p] = i;
f( p + 1 );
}
}
int main()
{
fin >> N >> K;
f( 1 );
return 0;
}
