Cod sursa(job #1455344)
| Utilizator | Data | 27 iunie 2015 17:51:07 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#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 )
Afisare();
else
Back (k+1) ;
}
}
int main()
{
fin >> n >> m ;
Back (1);
return 0;
}
