Cod sursa(job #1497373)
Utilizator | Gelu Ungur ImGelu | Data | 6 octombrie 2015 18:41:37 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
///produsul cartezian
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int st[100], n, k;
void afisare(int p)
{
for(int i=1; i<=p; i++)
cout<<st[i]<<" ";
cout<<'\n';
}
void back(int p)
{
for(int 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;
}