Cod sursa(job #155985)
| Utilizator | Data | 12 martie 2008 12:01:34 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int N, K, L, x[20];
ofstream g("combinari.out");
void afis(){
int i;
for(i=1;i<=K;i++)
g<<x[i]<<' ';
g<<'\n';
}
void back(int i){
int j;
L=N-K+i;
for(j=x[i-1]+1;j<=L;j++){
x[i]=j;
if(i==K)
afis();
else back(i+1);
}
}
int main(){
ifstream f("combinari.in");
f>>N>>K;
f.close();
back(1);
g.close();
return 0;
}
