Cod sursa(job #1839776)
| Utilizator | Data | 3 ianuarie 2017 14:09:28 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n,k;
vector <int> a;
void f(int x)
{
if (x==a.size()-1)
{
if (k==1) a[x]=1; else a[x]=a[x-1]+1;
for (; a[x]<=n; a[x]++,cout << '\n')
for (int j=0; j<a.size(); j++)
cout << a[j] << ' ';
}
else
{
if (x==0) a[x]=1; else a[x]=a[x-1]+1;
for (; a[x]<=n; a[x]++)
f(x+1);
}
}
main()
{
cin >> n >> k;
a.resize(k);
f(0);
}
