Pagini recente » Cod sursa (job #2955165) | Cod sursa (job #274191) | Borderou de evaluare (job #2611401) | Algoritmiada 2011 - Clasament Runda Finală, Clasele 10-12 | Cod sursa (job #879098)
Cod sursa(job #879098)
#include <fstream>
using namespace std;
ifstream f("combinari.in"); ofstream g("combinari.out");
int n,p,v[19],j;
void combinari (int t) { int i;
if (t<=p) {for (i=v[t-1]+1;i<=n;i++) {v[t]=i;combinari(t+1);}}
else {for (j=1;j<=p;j++) g<<v[j]<<' '; g<<'\n';} }
int main () {
f>>n>>p;
combinari(1); }