Cod sursa(job #1000670)
| Utilizator | Data | 23 septembrie 2013 16:04:33 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
void back(int k);
int n,m;
int x[20];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int main()
{
fin >> n;
fin >> m;
back(0);
return 0;
}
void back(int k)
{
if(k==m)
{
for(int i=0; i<m; i++)
{
fout << x[i] << " ";
}
fout << '\n';
}
else
{
for(int i=x[k-1]+1; i<=n; i++)
{
x[k]=i;
back(k+1);
}
}
}
