Cod sursa(job #1260051)
Utilizator | Data | 10 noiembrie 2014 20:49:20 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int v[20];
int n,k;
void combinari(int l)
{
if (l==k){
for (int i=1;i<=k;++i) g<<v[i]<<" ";
g<<"\n";
}
else for (int i=v[l]+1;i<=n;++i){
v[l+1]=i;
combinari(l+1);
}
}
int main()
{
f>>n>>k;
combinari(0);
return 0;
}