Cod sursa(job #821378)
Utilizator | coman cosmin Coman95 | Data | 22 noiembrie 2012 12:15:57 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int a[18], n, m;
void Back( int x );
int main()
{
fin >> n >> m;
Back( 1 );
fin.close();
fout.close();
return 0;
}
void Back( int x )
{
for( int i = a[x-1]+1; i <= n; ++i )
{
a[x] = i;
if( x == m )
{
for( int i = 1; i <= m; ++i )
fout << a[i] << ' ';
fout << '\n';
}
else
Back( x + 1 );
}
}