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