Cod sursa(job #1150803)
| Utilizator | Data | 23 martie 2014 15:58:36 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std ;
const int NMAX = 20 ;
ifstream cin("combinari.in") ;
ofstream cout("combinari.out") ;
void Back(int) ;
int N, K;
int S[NMAX];
void Back(int L)
{
if(L == K)
{
for(int i = 1 ; i <= K ; ++ i)
cout << S[i] << ' ' ;
cout << '\n' ;
}
else
for(int i = S[L] + 1 ; i <= N ; ++ i)
{
S[L + 1] = i ;
Back(L + 1) ;
}
}
int main()
{
cin >> N >> K ;
Back(0) ;
cin.close() ;
cout.close() ;
return 0 ;
}
