Cod sursa(job #1327885)
Utilizator | Data | 27 ianuarie 2015 12:54:44 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,x[19],p;
void afis()
{
int i;
for(i=1; i<=p; i++)
g<<x[i]<<" ";
g<<'\n';
}
void back(int k)
{
int i;
if(k==p+1) afis();
else
for(i=x[k-1]+1; i<=n; i++)
{
x[k]=i;
back(k+1);
}
}
int main()
{
f>>n>>p;
back(1);
return 0;
}