Cod sursa(job #1324818)
| Utilizator | Data | 22 ianuarie 2015 20:27:13 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int st[999],p,i,n,k;
void afisare(int p){
for(i=1;i<=p;++i)
cout<<st[i]<<" ";
cout<<endl;
}
void back(int p){
int pval;
for(pval=st[p-1]+1;pval<=n;++pval){
st[p]=pval;
if(p==k) afisare(p);
else back(p+1);
}
}
int main()
{
cin>>n>>k;
back(1);
return 0;
}
