Cod sursa(job #894368)
Utilizator | Data | 26 februarie 2013 20:54:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int n, k;
int v[19];
ofstream out ("combinari.out");
void back(int pas)
{
int i;
if (pas>k)
{
for (i=1; i<=k; i++)
out<<v[i]<<" ";
out<<"\n";
}
else
{
for (i=v[pas-1]+1; i<=n-k+pas; i++)
{
v[pas]=i;
back(pas+1);
}
}
}
int main()
{
ifstream in ("combinari.in");
in>>n>>k;
int i;
back(1);
return 0;
}