Cod sursa(job #2209388)
Utilizator | Data | 3 iunie 2018 11:18:07 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, v[ 25 ];
void backtr( int nivel )
{
int i;
if ( nivel > k )
{
for ( i = 1 ; i <= k ; i++ )
{
fout<< v[ i ] << ' ';
}
fout<<'\n';
}
else
{
for ( i = v[ nivel - 1 ] + 1; i <= n; i++ )
{
v[ nivel ] = i;
backtr( nivel + 1 );
}
}
}
int main()
{
fin>> n >> k;
v[ 0 ] = 0;
backtr( 1 );
return 0;
}