Cod sursa(job #719883)
Utilizator | Data | 22 martie 2012 10:05:43 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int n,k,s[19];
ifstream f("combinari.in");
ofstream h("combinari.out");
void bkt(int p){
int i;
if(p-1==k){
for(i=1;i<=k;i++)
h<<s[i]<<" ";
h<<"\n";
}
else for(i=s[p-1]+1;i<=n-k+p;i++){
s[p]=i;
bkt(p+1);
}
}
int main()
{
f>>n>>k;
bkt(1);
return 0;
}