Cod sursa(job #870078)
Utilizator | Data | 2 februarie 2013 20:21:32 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,sol[20];
void back(int p)
{
if (p==k+1)
{
for (int i=1;i<=k;i++)
out<<sol[i]<<' ';
out<<'\n';
}
else for (int i=sol[p-1]+1;i<=n;i++)
{
sol[p]=i;
back(p+1);
}
}
int main()
{
in>>n>>k;
back(1);
}