Cod sursa(job #693600)
| Utilizator | Data | 27 februarie 2012 14:00:02 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<cstdio>
using namespace std;
int viz[20],n,m,k;
void back (int k)
{
int i;
if(k<=m)
for( i=viz[k-1]+1;i<=n-m+k;i++)
{
viz[k]=i;
back(k+1);
}
else
{
for(i=1;i<=m;i++)
printf("%d ",viz[i]);
printf("\n");
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
back(1);
return 0;
}
