Cod sursa(job #1139595)
Utilizator | Data | 11 martie 2014 12:11:25 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,x,st[1001];
void afis()
{
int i=0;
for (i=1;i<=x;++i) g<<st[i]<<' ';
g<<'\n';
}
void back(int k)
{
int i=0;
if (k==x+1) afis();
else
{
for (i=st[k-1]+1;i<=n;++i)
{
st[k]=i;
back(k+1);
}
}
}
int main()
{
f>>n>>x;
back(1);
return 0;
}