Cod sursa(job #1219090)
| Utilizator | Data | 13 august 2014 13:46:35 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream fin( "combinari.in" );
ofstream fout( "combinari.out" );
int n, k, v[ 18 ];
void bkt( int x, int nr ) {
if ( x == k ) {
for( int i = 0; i < k; ++ i ) {
fout<<v[ i ]<<' ';
}
fout<<'\n';
return ;
}
for( v[ x ] = nr + 1; v[ x ] <= n - k + x + 1; ++ v[ x ] ) {
bkt( x + 1, v[ x ] );
}
}
int main(){
fin>>n>>k;
bkt( 0, 0 );
fin.close();
fout.close();
return 0;
}
