Cod sursa(job #418543)
| Utilizator | Data | 15 martie 2010 23:58:38 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int n,k,st[20];
ofstream g("combinari.out");
void afisare()
{
for(int i=1;i<=k;i++)
g<<st[i]<<" ";
g<<"\n";
}
int valid(int p)
{
if(p==1) return 1;
if(st[p]>st[p-1]) return 1;
return 0;
}
void back(int p)
{
int i;
for(i=1;i<=n;i++)
{
st[p]=i;
if(valid(p))
if(p==k) afisare();
else back(p+1);
}
}
int main()
{
ifstream f("combinari.in");
f>>n>>k;
back(1);
return 0;
}
