Pagini recente » Cod sursa (job #3218249) | Cod sursa (job #1130674) | Cod sursa (job #1039694) | Cod sursa (job #3162236) | Cod sursa (job #1487246)
#include <fstream>
#include <iostream>
using namespace std;
int n,m, viz[21]={0}, ans[21]={0};
ifstream in("combinari.in");
ofstream out("combinari.out");
void back(int k)
{
if( k == m ){
for(int i=1;i<=m;++i){
out<<ans[i]<<" ";
}
out<<endl;
return;
}
for(int j=ans[k]+1;j<=n;++j) {
if( viz[j] == 0 ) {
viz[j] = 1;
ans[k+1] = j;
back(k+1);
viz[j] = 0;
}
}
}
int main()
{
in>>n>>m;
back(0);
return 0;
}