Cod sursa(job #664473)
Utilizator | Data | 20 ianuarie 2012 10:06:07 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,sol[100];
void back(int x)
{
int i;
if (x>k)
{
for (i=1;i<=k;i++)
g<<sol[i]<<' ';
g<<'\n';
}
else
for (i=sol[x-1]+1;i<=n;i++)
{
sol[x]=i;
back(x+1);
}
}
int main()
{
f>>n>>k;
back(1);
return 0;
}