Cod sursa(job #1487245)
| Utilizator | Data | 16 septembrie 2015 15:59:58 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <iostream>
using namespace std;
int n,m, viz[21]={0}, ans[21]={0};
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()
{
ifstream in("combinari.in");
ofstream out("combinari.out");
in>>n>>m;
back(0);
return 0;
}
