Cod sursa(job #654687)
Utilizator | Data | 30 decembrie 2011 19:36:25 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | winners1 | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int s[21],n,k;
void back(int l)
{
int i;
if (l==k)
{
for (i=1 ;i<=k;i++)
g<<s[i]<<" ";
g<<"\n";
}
else
{
for (i=s[l]+1;i<=n;i++)
{
s[l+1]=i;
back(l+1);
}
}
}
int main()
{
f>>n>>k;
back(0);
return 0;
}