Cod sursa(job #1693700)
| Utilizator | Data | 23 aprilie 2016 18:46:41 | |
|---|---|---|---|
| Problema | Combinari | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,v[100];
void generare(int pasi)
{
if(pasi>k)
{
for(int i=1; i<k; i++) if(v[i]>=v[i+1]) return;
for(int i=1; i<=k; i++) fout<<v[i]<<" ";
fout<<"\n";
}
else
{
for(int i=1; i<=n; i++)
{
v[pasi]=i;
generare(pasi+1);
}
}
}
int main()
{
fin>>n>>k;
generare(1);
}
