Cod sursa(job #1554960)
| Utilizator | Data | 21 decembrie 2015 23:52:31 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,a[21],sol[21],m;
void afis()
{
int i;
for(i=1;i<=m;i++)
{
g<<a[sol[i]]<<' ';
}
g<<'\n';
}
void back(int k)
{
int i;
if(k>m)
afis();
else
{
for(i=sol[k-1]+1; i<=n; i++)
{
sol[k]=i;
back(k+1);
}
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
a[i]=i;
}
back(1);
return 0;
}