Cod sursa(job #2011233)
Utilizator | Data | 15 august 2017 17:40:52 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
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 n,k,s[20];
void bak(int top)
{
int i;
if(top==k+1)
{
for(i=1;i<=k;i++)
g<<s[i]<<" ";
g<<endl;
return;
}
for(i=s[top-1]+1;i<=n;i++)
{
s[top]=i;
bak(top+1);
}
}
int main()
{
f>>n>>k;
bak(1);
return 0;
}