Cod sursa(job #705249)
| Utilizator | Data | 3 martie 2012 19:42:03 | |
|---|---|---|---|
| Problema | Combinari | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[100],b[100],n,lung;
void back(int k,int n,int lung){
if(k-1==lung){
for(int i=1;i<=lung;i++)
g<<a[i]<<" ";
g<<endl;}
else{
for(int i=1;i<=n;i++){
if(!b[i] && a[k-1]<i){
a[k]=i;
b[i]=1;
back(k+1,n,lung);
b[i]=0;
}
}
}
}
int main (){
f>>n>>lung;
back(1,n,lung);
return 0;
}