Cod sursa(job #872335)
Utilizator | Dinu Radu RaduGabriel2012 | Data | 5 februarie 2013 22:48:54 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,s[19];
void Back(int p)
{int i;
if (p>k) {for(i=1;i<=k;i++) g<<s[i]<<" "; g<<"\n";}
else
for(i=s[p-1]+1;i<=n;i++) {s[p]=i;Back(p+1);}
}
int main()
{f>>n>>k;
Back(1);
return 0;
}