Pagini recente » Cod sursa (job #2395281) | Cod sursa (job #2681299) | Cod sursa (job #1372931) | Cod sursa (job #211482) | Cod sursa (job #1455346)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int sol[20] , n , m ;
void Afisare ()
{
int i;
for ( i = 1 ; i <= n ; ++ i )
fout << sol [i] << " ";
fout << endl ;
}
void Back (int k)
{
int i ;
for ( i = sol[k-1] + 1 ; i <= n - m + k ; ++ i )
{
sol [k] = i ;
if ( k == m + 1 )
Afisare();
else
Back (k+1) ;
}
}
int main()
{
fin >> n >> m ;
Back (1);
return 0;
}