Cod sursa(job #1343314)
Utilizator | Data | 15 februarie 2015 12:03:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int sol[20],n,k;
int afis()
{
for(int i=1;i<=k;i++)
fout<<sol[i]<<' ';
fout<<'\n';
}
void back(int p)
{
if(p==k+1)
afis();
else
for(int i=sol[p-1]+1;i<=n;i++)
{
sol[p] = i;
back(p+1);
}
}
int main()
{
fin>>n>>k;
back(1);
return 0;
}