Cod sursa(job #3289198)
Utilizator | Data | 26 martie 2025 02:02:32 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream cin ( "combinari.in" );
ofstream cout ( "combinari.out" );
bool ales[19];
int cnt, k, n;
void f( int n_crt ) {
int i;
ales[n_crt] = true;
cnt = 0;
for( i = 1; i <= n_crt; i ++ )
if( ales[i] )
cnt++;
if( cnt == k ) {
for( i = 1; i <= n; i ++ )
if( ales[i] )
cout << i << " ";
cout << '\n';
}
if( cnt > k )
return;
if( n_crt < n )
f( n_crt + 1 );
ales[n_crt] = false;
if( n_crt < n )
f( n_crt + 1 );
}
int main()
{
cin >> n >> k;
f( 1 );
return 0;
}