Cod sursa(job #2076159)
Utilizator | Data | 26 noiembrie 2017 11:42:26 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int x[9],n,viz[9],m;
void tipar(){
int i;
for(i=1;i<=m;i++)
g<<x[i]<<' ';
g<<'\n';
}
void backt(int k){
int i;
for(i=x[k-1]+1;i<=n;i++){
x[k]=i;
if(k==m){
tipar();
}
else
backt(k+1);
}
}
int main()
{ f>>n>>m;
backt(1);
return 0;
}