Cod sursa(job #699519)
| Utilizator | Data | 29 februarie 2012 19:50:14 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[20],n,c;
bool b[20];
void back(int k){
if(k>c){
for(int i=1;i<=c;i++)
g<<x[i]<<" ";
g<<"\n";
return ;
}
for(int i=1;i<=n;i++)
if(!b[i] && x[k-1]<i){
x[k]=i;
b[i]=1;
back(k+1);
b[i]=0;
}
}
int main (){
f>>n>>c;
back(1);
return 0;
}