Cod sursa(job #248967)
Utilizator | Data | 27 ianuarie 2009 10:27:54 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include "fstream.h"
int n,s[100];
ifstream f("combinari.in");
ofstream g("combinari.out");
int valid(int k)
{
int v=1;
for (int i=1; i<k && v;i++)
if (s[i]==s[k]) v=0;
if (v)
{
for (int i=1;i<k && v;i++)
if (s[i]>s[k]) v=0;
}
return v;
}
void back(int k)
{
if (k==n+1)
{
for (int i=1;i<=n;i++) g<<s[i]<<" ";
g<<'\n';
}
else
{
for (int i=1;i<=n;i++)
{
s[k]=i;
if (valid(k)) back(k+1);
}
}
}
int main()
{
f>>n;
back(1);
return 0;
}