Cod sursa(job #1997858)
Utilizator | Data | 5 iulie 2017 16:35:40 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,x[19],p;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
void s(int k)
{
int j,mi;
if(k>p)
{
for(j=1;j<=p;j++)fout<<x[j]<<" ";
fout<<"\n";
return;
}
for(int i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
s(k+1);
}
}
int main()
{
fin>>n>>p;
s(1);
return 0;
}