Cod sursa(job #1135184)
Utilizator | Ionutas Ioan I04N | Data | 7 martie 2014 13:57:09 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int i,k,st[100],n,p;
void tip ()
{
for(i=1;i<=p;i++)
fout << st[i] << " ";
fout << "\n";
}
void back(int k)
{
int i;
for(i=st[k-1]+1;i<=n;i++)
{
st[k]=i;
if(k==p)
tip();
else
back(k+1);
}
}
int main()
{
fin >> n >> p;
back(1);
return 0;
}