Cod sursa(job #1497500)
| Utilizator | Data | 6 octombrie 2015 21:35:58 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[100],n,k;
void afisare(int p)
{
for(int i=1;i<=p;i++)
fout<<st[i]<<" ";
fout<<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()
{
fout<<"n=";
fin>>n;
fout<<"k=";
fin>>k;
back(1);
return 0;
}
