Cod sursa(job #1166269)
Utilizator | Data | 3 aprilie 2014 13:35:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int comb[20], n, k;
void print()
{
for (int i=1; i<=k; i++)
g<<comb[i]<<" ";
g<<"\n";
}
void back(int el)
{
for (int i=comb[el-1]+1; i<=n; i++) {
comb[el]=i;
if (el==k)
print();
else
back(el+1);
}
}
int main()
{
f>>n>>k;
back(1);
return 0;
}