Cod sursa(job #1331326)
Utilizator | Data | 31 ianuarie 2015 15:25:32 | |
---|---|---|---|
Problema | Combinari | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, i, k2, x[13], m[13];
void back(int k){
if(k>k2){
for(int i=1; i<=k2; i++)
out<<x[i]<<" ";
out<<"\n";
return ;
}
for(int i=x[k-1]+1; i<=n; i++){
x[k]=i;
if(m[i]==0){
m[i]=1;
back(k+1);
m[i]=0;
}
}
}
int main(){
in>>n>>k2;
back(1);
return 0;
}