Cod sursa(job #1185663)
Utilizator | Data | 16 mai 2014 11:45:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[20],n,p;
void tipar (int k)
{
for(int i=1;i<=k;i++)
g<<x[i]<<" ";
g<<'\n';
}
void back(int k)
{
for(int i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
if(k==p)
tipar(k);
else
back(k+1);
}
}
int main()
{
f>>n>>p;
back(1);
return 0;
}