Cod sursa(job #1396570)
Utilizator | Data | 22 martie 2015 18:26:07 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n,p,a[20],viz[20];
void back(int k)
{
if (k>p){
for (int i=1;i<=p;i++)cout<<a[i]<<' ';
cout<<'\n';
return;
}
for (int i=a[k-1]+1;i<=n;i++)
a[k]=i,
back(k+1);
}
int main()
{
cin >> n >> p;
back(1);
return 0;
}