Cod sursa(job #318252)
Utilizator | Data | 27 mai 2009 19:40:09 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
using namespace std;
int s[100],n,p;
void tipar(){for(int i=1;i<=p;i++)printf("%d ",s[i]);printf("\n");}
void back(int pas)
{
int i;
if(pas==p+1)tipar();
else
{
for(i=s[pas-1]+1;i<=n;i++)
{
s[pas]=i;
back(pas+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&p);
back(1);
return 0;
}