Cod sursa(job #1690975)
| Utilizator | Data | 16 aprilie 2016 14:35:49 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int s[50],n,k;
int valid(int p)
{
int i;
for(i=1; i<p; i++)
{
if (s[i]>=s[p])
return 0;
}
return 1;
}
void tipar(int p)
{
int i;
for(i=1; i<=p; i++)
{
out<<s[i]<<" ";
}
out<<endl<<endl;
}
void back(int p)
{
int i;
for(i=1; i<=n; i++)
{
s[p]=i;
if(valid(p)==1)
if(k==p)
tipar(p);
else back(p+1);
}
}
int main()
{
in>>n>>k;
back(1);
return 0;
}
