Cod sursa(job #1598977)
Utilizator | Data | 13 februarie 2016 14:56:36 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, st[20];
void afisare ()
{ for(int i=1;i<=k;i++)
g<<st[i]<<' ';
g<<'\n';
}
void back(int p)
{ if(p==k+1)
{ afisare();
return;
}
for(int i=st[p-1]+1;i<=n;i++)///mergem de la elemtentul pus anterior, si +1 ca sa fie crescatoare secventa
{ st[p]=i;
p++;
}
}
int main()
{
f>>n>>k;
back(1);
return 0;
}