Cod sursa(job #690371)
| Utilizator | Data | 25 februarie 2012 16:18:35 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int k,n,x[50],p;
int verif (int k)
{if (k>1)
if (x[k]<=x[k-1])
return 0;
return 1;
}
void afisare (int k)
{int i;
for (i=1; i<=k; i++)
g<<x[i]<<" ";
g<<'\n';
}
void back (int k)
{int i;
for (i=1; i<=n; i++)
{x[k]=i;
if (verif(k)==1)
if (k==p)
afisare(k);
else back(k+1);
}
}
main()
{int i;
f>>n>>p;
back(1);
}
