Cod sursa(job #218992)
Utilizator | Mihnea Andrei mihnea_andrei | Data | 4 noiembrie 2008 17:53:04 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
int sol[20],n,p;
ofstream out("combinari.out");
void afisare ()
{
for(int i=1;i<=p;i++)
out<<sol[i]<<" ";
out<<"\n";
}
int valid(int k)
{
if(sol[k-1]<sol[k])
return 1;
return 0;
}
void back (int k)
{
if(k==p+1)
{
afisare ();
return ;
}
for(int i=1;i<=n;i++)
{
sol[k]=i;
if(valid(k))
back(k+1);
}
}
int main ()
{
ifstream in("combinari.in");
in>>n>>p;
back(1);
in.close();
out.close();
return 0;
}