Cod sursa(job #2037315)
Utilizator | Data | 11 octombrie 2017 23:44:42 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, s[20];
int bt(int l)
{
int i;
if (l==k)
{
for (i=1; i<=k; i++) g<<s[i]<<" ";
g<<"\n";
}
else
for (i=s[l]+1; i<=n; i++)
{
s[l+1]=i;
bt(l+1);
}
}
int main()
{
f>>n>>k;
bt(0);
return 0;
}