Cod sursa(job #1659111)
| Utilizator | Data | 21 martie 2016 23:34:44 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#define VAL 25
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N, K;
int v[VAL];
void back(int p)
{
int i;
if (p==K)
{
for (i=1; i<=K; i++)
fout << v[i] << " ";
fout << '\n';
}
else
{
for (i=v[p]+1; i<=N; i++)
{
v[p+1]=i;
back(p+1);
}
}
}
int main()
{
fin >> N >> K;
back(0);
fin.close();
fout.close();
return 0;
}
