Cod sursa(job #950703)
Utilizator | Data | 17 mai 2013 16:57:38 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int s[20], n, k;
void back(int l)
{
if (l=k)
{
for (int i=1; i<=k; i++) g<<s[i]<<' '; g<<'\n';
}
else
{
for (int i=s[l]+1; i<=n; i++)
{
s[l+1]=i; back(l+1);
}
}
}
int main()
{
f>>n>>k;
back(0);
f.close(); g.close();
return 0;
}