Cod sursa(job #752650)
| Utilizator | Data | 29 mai 2012 09:30:17 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream fcin("combinari.in");
ofstream fcout("combinari.out");
int n,v[19],k;
void print()
{
for(int i=1;i<=k;i++)
fcout<<v[i]<<" ";
fcout<<"\n";
}
void back(int x)
{
if(x==k+1)
print();
else
for(int i=v[x-1]+1;i<=n;i++)
{
v[x]=i;
back(x+1);
}
}
int main()
{
fcin>>n>>k;
back(1);
return 0;
}
