Cod sursa(job #1928846)
Utilizator | Data | 16 martie 2017 19:55:11 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int v[20],k,n;
void back(int l)
{
int i;
if(l==k)
{
for(i=1;i<=k;i++)
{
out<<v[i]<<" ";
}
out<<endl;
}
else
{
for(i=v[l]+1;i<=n;i++)
{
v[l+1]=i;
back(l+1);
}
}
}
int main()
{
in>>n>>k;
back(0);
return 0;
}