Cod sursa(job #1458692)
Utilizator | Data | 8 iulie 2015 12:05:09 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,a[20];
void Back (int p)
{
int i;
if (p<=k)
{
for (i=a[p-1]+1;i<=n;i++)
{
a[p]=i;
Back (p+1);
}
}
else
{
for (i=1;i<=k;i++) g<<a[i]<<" ";
g<<"\n";
}
}
int main()
{
f>>n>>k;
Back (1);
return 0;
}