Cod sursa(job #633695)
| Utilizator | Data | 14 noiembrie 2011 16:12:25 | |
|---|---|---|---|
| Problema | Combinari | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
#include<string>
#include<iostream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,lol;
int d[10];
void back(int k,short ok[10],int last){
if(k==lol+1){
for(int j=1;j<=lol;j++){
g<<d[j]<<" ";
}
g<<"\n";
}
else{
int i;
for(i=last;i<=n;i++){
if(ok[i]==0){
d[k]=i;
ok[i]=1;
back(k+1,ok,i+1);
ok[i]=0;
}
}
}
}
short ok[10];
int main(){
f>>n>>lol;
back(1,ok,1);
return 0;
}