Cod sursa(job #616577)
Utilizator | Data | 12 octombrie 2011 21:27:09 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ofstream fout("combinari.out");
int x[100],n,p;
void afis()
{
for(int i=1;i<=p;i++)
fout<<x[i]<<" ";
fout<<endl;
}
void back(int k)
{
for(int i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
if(k==p)
afis();
else
back(k+1);
}
}
int main()
{
ifstream fin("combinari.in");
fin>>n>>p;
back(1);
return 0;
}