Cod sursa(job #988622)
Utilizator | Data | 23 august 2013 14:45:47 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,j,st[20];
void bkt(int k)
{
int i;
if(k==m)
{
for(i=1;i<=m;i++)
g<<st[i]<<" ";
g<<'\n';
}
else
{
for(i=st[k]+1;i<=n;i++)
{
st[k+1]=i;
bkt(k+1);
}
}
}
int main()
{
f>>n>>m;
bkt(0);
return 0;
}