Cod sursa(job #392727)
| Utilizator | Data | 8 februarie 2010 09:06:22 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, k, sol[10];
void back(int p)
{
if(p == k)
for(int i=0;i<k;i++)
printf("%d \n", sol[i]);
else
for(int i=sol[p-1]+1;i<=n;i++)
{
sol[p] = i;
back(p+1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d",&n, &k);
back(0);
return 0;
}
