Cod sursa(job #1094067)
| Utilizator | Data | 28 ianuarie 2014 21:17:29 | |
|---|---|---|---|
| Problema | Combinari | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k;
int b[20];
int a[20];
void comb(int n,int k,int t)
{
if (t==k+1) { for (int j=1;j<=k;j++) g << a[j] << " "; g << "\n"; }
else
{
for (int j=1;j<=n;j++)
if (b[j] == 0 && a[k-1] < j) { a[t] = j; b[j] = 1; comb(n,k,t+1); b[j] = 0; }
}
}
int main()
{
f >> n >> k;
comb(n,k,1);
return 0;
}
