Pagini recente » Cod sursa (job #1861157) | Cod sursa (job #2820892) | Cod sursa (job #1638065) | Cod sursa (job #2980449) | Cod sursa (job #1439099)
#include <fstream>
#define nmax 20
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int N, K, s[nmax];
void afisare(){
for(int i = 1; i <= N; ++i){
if(s[i] == true)
g<<i<<' ';
}
g<<'\n';
}
void Combinari(int x, int nr){
if( nr == K ){
afisare();
}
else{
for(int i = x; i <= N; ++i){
if(!s[i]){
s[i] = true;
Combinari(i, nr + 1);
s[i] = false;
}
}
}
}
int main()
{
f>>N>>K;
Combinari(1, 0);
return 0;
}