Cod sursa(job #1708149)
Utilizator | Data | 26 mai 2016 18:11:44 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<iostream>
#include<fstream>
using namespace std;
int a[100], n,p;
ifstream f("combinari.in");
ofstream g("combinari.out");
void afis()
{
for(int i=1;i<=p;i++)
g<<a[i]<<" ";
g<<endl;
}
int valid(int k)
{
for(int i=1;i<k;i++)
if(a[k]>=a[i])
return 0;
return 1;
}
void BK(int k)
{
for( int i=1;i<=n;i++)
{
a[k]=i;
if(valid(k)!=0)
if(p==k)
afis();
else
BK(k+1);
}
}
int main()
{ int i;
g<<"n= ";
f>>n;
g<<"p= ";
f>>p;
BK(1);
return 0;
}