Cod sursa(job #988007)
Utilizator | Data | 21 august 2013 19:19:48 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k;
int s[20];
void comb(int p)
{
if(p == k+1)
{
for(int i=1; i<=k; i++)
out<<s[i]<<" ";
out<<'\n';
}
else
{
for(int i=s[p-1]+1; i<=n; i++)
{
s[p] = i;
comb(p+1);
}
}
}
int main()
{
in>>n>>k;
comb(1);
in.close();
out.close();
return 0;
}